c++容器类（C++ container class）.docVIP

c++容器类（C++ container class） C++ container class The container classes in C++ include the sequential storage structure and the associative storage structure. The former includes vector, list, deque, etc. the latter include set, map, multiset, Multimap, and so on. If you want to store the number of elements between the compiler can be determined, you can use the array to store, otherwise you will need to use the container class. 1, vector A contiguous storage structure where each element is contiguous in memory; Support for efficient random access and insertion / deletion operations at the tail end, but the insertion / deletion operations at other locations are inefficient; 2, deque Continuous storage structure, namely each element in memory is continuous, similar to vector, the difference is that deque provides two level array structure, the first stage is completely similar to the vector, representative of the actual vessel; another maintenance container first. In this way, deque supports efficient head end insertion / deletion operations in addition to all the functions of vector. 3, list The discontinuous storage structure has a doubly linked list structure, and each element maintains a pair of forward and backward pointers, so it supports forward / backward traversal. Efficient random insertion / deletion is supported, but random access is inefficient and overhead due to the need for additional maintenance pointers. 4, vector, V.S., list, V.S., deque: A, if random access operations are required, select vector; B, if you already know the number of storage elements you need, select vector; C, if you need to insert / delete randomly (not just at both ends), select list D, select deque only when you need to insert / delete at the head end, or else select vector. E, if you need both random insert / delete and random access, you need to make a compromise between vector and list. F, when the store is responsible for a large class of objects, list is better than vector;