## Chapter Summary

1. Iterators are high-level abstractions, serve the same role as pointers, can be applied to a variety of data structures. Each STL container provides a pair of member functions, begin and end, that return a starting and ending iterator.
2. Pairs of iterators can be used to refer to a complete collection of values, or a subportion of a collection.
3. Through the use of iterators, generic algorithms can be made to work with a variety of containers.
4. Many generic algorithms take functions or function objects as argument. A function object is a class that implements the function call operator, and hence can be used in the same manner as a function.

prev |top |next