C++ How to Program, 10/e

Summary

Section 15.1 Introduction

• The C++ Standard Library defines powerful, template-based, reusable components for common data structures and defines algorithms used to process those data structures.

• There are three container-class categories—first-class containers, container adapters and near containers.

• Iterators, which have properties similar to those of pointers, are used to manipulate container elements.

• Standard Library algorithms are function templates that perform such common data manipulations as searching, sorting and comparing elements or entire containers.

• Linked lists are collections of data items logically “lined up in a row”—insertions and removals are made anywhere in a linked list.

• Stacks are important in compilers and ...