23.1. Introduction to the Standard Template Library (STL)23.1.1. Introduction to ContainersSTL Containers OverviewSTL Container Common FunctionsSTL Container Header FilesFirst-Class Container Common typedefs23.1.2. Introduction to IteratorsUsing istream_iterator for Input and Using ostream_iterator for OutputIterator Categories and Iterator Category HierarchyPredefined Iterator typedefsIterator Operations23.1.3. Introduction to Algorithms23.2. Sequence Containers23.2.1. vector Sequence ContainerUsing Vector and IteratorsVector Element-Manipulation Functions23.2.2. list Sequence Container23.2.3. deque Sequence Container23.3. Associative Containers23.3.1. multiset Associative Container23.3.2. set Associative Container23.3.3. multimap Associative Container23.3.4. map Associative Container23.4. Container Adapters23.4.1. stack Adapter23.4.2. queue Adapter23.4.3. priority_queue Adapter23.5. Algorithms23.5.1. fill, fill_n, generate and generate_n23.5.2. equal, mismatch and lexicographical_compare23.5.3. remove, remove_if, remove_copy and remove_copy_if23.5.4. replace, replace_if, replace_copy and replace_copy_if23.5.5. Mathematical Algorithms23.5.6. Basic Searching and Sorting Algorithms23.5.7. swap, iter_swap and swap_ranges23.5.8. copy_backward, merge, unique and reverse23.5.9. inplace_merge, unique_copy and reverse_copy23.5.10. Set Operations23.5.11. lower_bound, upper_bound and equal_range23.5.12. Heapsort23.5.13. min and max23.5.14. STL Algorithms Not Covered in This Chapter23.6. Class bitsetSieve of Eratosthenes with bitset23.7. Function ObjectsPredefined Function Objects of the Standard Template LibraryUsing the STL Accumulate Algorithm23.8. Introduction to STL/CLR23.9. Wrap-Up23.10. STL Web ResourcesSummarySection 23.1 Introduction to the Standard Template Library (STL)Section 23.1.1 Introduction to ContainersSection 23.1.2 Introduction to IteratorsSection 23.1.3 Introduction to AlgorithmsSection 23.2 Sequence ContainersSection 23.2.1 vector Sequence ContainerSection 23.2.2 list Sequence ContainerSection 23.2.3 deque Sequence ContainerSection 23.3 Associative ContainersSection 23.3.1 multiset Associative ContainerSection 23.3.2 set Associative ContainerSection 23.3.3 multimap Associative ContainerSection 23.3.4 map Associative ContainerSection 23.4 Container AdaptersSection 23.4.1 stack AdapterSection 23.4.2 queue AdapterSection 23.4.3 priority_queue AdapterSection 23.5.1 fill, fill_n, generate and generate_nSection 23.5.2 equal, mismatch and lexicographical_compareSection 23.5.3 remove, remove_if, remove_copy and remove_copy_ifSection 23.5.4 replace, replace_if, replace_copy and replace_copy_ifSection 23.5.5 Mathematical AlgorithmsSection 23.5.6 Basic Searching and Sorting AlgorithmsSection 23.5.7 swap, iter_swap and swap_rangesSection 23.5.8 copy_backward, merge, unique and reverseSection 23.5.9 inplace_merge, unique_copy and reverse_copySection 23.5.10 Set OperationsSection 23.5.11 lower_bound, upper_bound and equal_rangeSection 23.5.12 HeapsortSection 23.5.13 min and maxSection 23.6 Class bitsetSection 23.7 Function ObjectsSection 23.8 Introduction to STL/CLRTerminologySelf-Review ExercisesAnswers to Self-Review ExercisesExercisesRecommended Reading