C++builder STL

Vectors (vector) elements for continuous storage <vector>
A list is a doubly linked table of nodes, each of which contains an element <list>
A double-queue (deque) array of pointers to different elements that are stored continuously <deque>
A set is a red-black tree of nodes, each of which contains an element that is arranged between nodes in a predicate that acts on the pair of elements, and that no two different elements can have the same order <set>
Multiset (Multiset) allows a collection of two elements of equal order <set>
Stack (stack) last-in-first-out value arrangement <stack>
Queuing (queue) FIFO value arrangement <queue>
The order of the priority queue (Priority_queue) element is a queue that is determined by a predicate that acts on the stored value pair <queue>
A map (map) consists of a set of {key, value} pairs, arranged in a verb on a function key <map>
Multi-mapping (MULTIMAP) allows key pairs to have equal order mappings <map>

The introduction of STL's header file is OK.
In the C + + standard, the STL is organized into the following 13 header files:
<algorithm><deque>, <functional>, <iterator>, <vector>, <list>, <map>, <memory>, <numeric>, <queue>, <set>, <stack> and <utility>

Contains the header file and then it can be used.

     std::map<int,int> aa;     // Aa.insert (;)     std::vector<int>  vi; //      vi.pop_back ();     std::stack<int>st; //     St.push (); //     st.top ();     std::queue<int> QE;    Qe.push ();    Qe.front ();

C++builder STL