day12（旅行）.docVIP

day12（旅行） Eleventh class STL (on) A STL container, an overview The advantages and disadvantages of the 1. arrays and linked lists 1) array: an efficient random access, space requirements, inserting and deleting inconvenience. 2) list: the space requirement is low, easy to insert and delete, random access difficulties. 2.C++ STL provides a set of container templates, makes the operations of the data structure of the program designer transparency, combined with the advantages of arrays and linked lists, as efficient use effect as much as possible simple way. 30 large container 1) vector (vector) Support the subscript to the data element access, insertion and deletion efficiency is very high in the tail of the container. 2) list (list) Do efficient insertion and deletion in any position, does not support the data elements of the access. 3) double end queue (deque) Support the subscript to the data element access, insertion and deletion efficiency is very high in the head and tail of container. 4) stack (stack) In the end only supports the storage and retrieval of data elements in the container. 5) queue (queue) Support pressure into the extraction of data element from the front from the rear. 6) priority queue (priority_queue) The extraction is always the highest priority in the current container data elements. 7) mapping (map) Key-value key of storage in ascending sequence. Each key can appear only once. According to the key value extraction efficiency is very high. 8) set (set) The lower forms of maps, each data element not only key value. 9) multiple mapping (Multimap) Not only the mapping of key. 10) multi set (multiset) The key collection not only. The classification of the 4. container 1) linear container: vector, list, double end queue. 2) adapter containers: stack, queue, priority queue. 3) associated container: mapping, mapping, multiple sets, multi set. The common features of the 5. container 1) any container type support copy constructor and copy assignment,