The C++ Standard Template Library (STL)
The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays, etc. It is a library of container classes, algorithms, and iterators. It is a generalized library and so, its components are parameterized. Working knowledge of template classes is a prerequisite for working with STL.
STL has 4 components:
The header algorithm defines a collection of functions specially designed to be used on a range of elements. They act on containers and provide means for various operations for the contents of the containers.
Containers or container classes store objects and data. There are in total seven standards “first-class” container classes and three container adaptor classes and only seven header files that provide access to these containers or container adaptors.
- Sequence Containers: implement data structures that can be accessed in a sequential manner.
- Container Adaptors: provide a different interface for sequential containers.
- Associative Containers: implement sorted data structures that can be quickly searched (O(log n) complexity).
- Unordered Associative Containers: implement unordered data structures that can be quickly searched
The STL includes classes that overload the function call operator. Instances of such classes are called function objects or functors. Functors allow the working of the associated function to be customized with the help of parameters to be passed. Must Read – Functors
As the name suggests, iterators are used for working on a sequence of values. They are the major feature that allows generality in STL. Must Read – Iterators
Defined in header <utility>. Must Read – Pair in C++ STL
For more details, refer to the Recent Articles on STL!