## Chapter Summary

1. STL - a library of classes that represent containers that occur frequently in computer programs in all application areas.
2. Each class in the STL supports a relatively small set of operations. Basic functionality is extended through the use of generic algorithms.
3. The 3 fundamental data structures are the vector, list, and deque.
4. Vector and deque are indexed data structures; they support efficient access to each element based on an integer key.
5. A list supports efficient insertion into or removal from the middle of a collection. Lists can also be merged with other lists.

prev |top |next