Lecture 23

Learning objectives

After this class, you should be able to:

1. Write programs that use the following features of an STL set: (i) insert, (ii) erase, (iii) find, (iv) begin, and (v) end.
2. Write programs that use the following features of an STL map: (i) insert, (ii) erase, (iii) find, (iv) operator[ ], (v) begin, and (vi) end.

Reading assignment

1. Section 4.8.
2. Lecture: STL set and map.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Store the plays in assignment 4 in an STL set. How will you define the < operator (post your answer on the discussion board)? Compare the time taken against the time required to store it in a BST.
  2. Insert a large number of (key, value) pairs into an STL map. Insert the same pairs into a BST. Compare the time taken for searching for elements in the map against that in the BST.

• Questions on next lecture's material
  1. None.