Standard Template Library STL (Standard Template Library)
STL can be divided into
Containers (containers)
Iterators (iterators)
Algorithms (algorithms)
Space configurator (the allocator)
Adapter (adapters)
Functor (functors)
Six parts
STL is organized into the following 13 header file: <algorithm>, <deque>, <functional>, <iterator>, <vector>, <list>, <map>, <memory.h>, <numeric>, <queue >, <set>, <stack> and <utility>
Sequence container
Vector (Vector) : Continuous storage element
List (List) : a doubly linked list of nodes, each node contains an element
Deque (the deque) : continuously storing a pointer pointing to different elements of the array consisting of
Container adapter
Stack (Stack) : last in, first out (LIFO) arrangement value
(Queue) queues : arrangement value FIFO (FIFO) of
Priority queue (priority_queue): The order of elements in the queue is a predicate on certain stored value determined by the effect
Associative containers
Set (SET) : a red-black tree consists of nodes, each node contains an element acting in a certain predicate element arranged between the nodes in the team is not able to have two different elements of the same order
Multiset (multiset) : equal allowed set of two order elements
Map (Map) : {a key, value} pairs set to a role predicate arranged on the key of
Multiple maps (the multimap) : allows key mappings to have equal order of
Pair (pair) : map and the like, but only one key-value <utility>
Smart pointers (auto_ptr) : an open auto_ptr from pointer memory with new, automatically reclaims space <memory>
Note:
The bottom of the vector sequence table (array)
The underlying list is doubly linked list
As a circular queue of the underlying deque
Underlying set of red-black tree
Hash_set bottom to a hash table
May be used #inlcude <bits / stdc ++. H> include all header files