Primary knowledge of STL in C + +

First, the STL refers to the standard template Library, the C + + standards Templates Gallery, also known as the generic library.

STL provides three types of components: containers, iterators, and algorithms, all of which support generic program design standards.

(a) Container:

Divided into: sequential containers and associative containers. Sequential containers include vector,list,deque,string, etc., and a series of elements that have a continuation set. The associative container includes Set,multiset,map and Multimap, and so on, containing the key value of the lookup element.

(b) Iterators: As the name implies is iterative, the role is to traverse the container.

(c) algorithm: Sorting algorithm, immutable algorithm, non-variable order algorithm, variable order algorithm, numerical algorithm.

Second, these library functions need to refer to the header file before they can be used, as listed below:

<algorithm>, <deque>, <functional>, <iterator>, <vector>, <list>, <map>, <memory> , <numeric> , <queue> , <set> , <stack> and <utility>.

We will learn the knowledge of this place in succession. Consolidate themselves.

Primary knowledge of STL in C + +