Handbook of Data Structures and Applications, 2nd Edition

43

Data Structures in C++

Mark Allen Weiss

Florida International University

43.1Introduction

43.2Basic Containers

Sequence Containers•Associative Containers•Container Adapters

43.3Iterators

Basics•Reverse Iterators

43.4Additional Components of the STL

Sorting, Searching, and Selection

Acknowledgments

References

43.1Introduction

In C++, several classic data structures are implemented as a part of the standard library, commonly known as the Standard Template Library. The Standard Template Library (or simply, the STL) consists of a set of container classes, such as lists, sets, and maps; iterator classes that are used to traverse the container classes; and generic algorithms, such as sorting and searching. As its name implies, the library consists ...