Chapter Summary

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