C + + Container summary __c++

This article originates from: http://m.blog.csdn.net/cyh183269855/article/details/53760816
C + + container

Containers in C + + can be roughly divided into two broad categories: sequential containers and associated containers. The sequential container contains a sequential container adapter.
Sequential containers: Aggregates elements of a single type into containers and then stores and accesses them based on location. The main vector, list, deque (two-terminal queue). Sequential container adapters: Stack, queue, and priority_queue.
Associative containers: Supports the use of keys to efficiently find and read elements. Mainly include: pair, set, map, Multiset and Multimap.
Next, in turn, for a variety of containers to do a detailed introduction.

First, sequential container

1. Sequential container definition
In order to define an object of a container type, you must first include the associated header file:
Define vector: #include <vector>
Definition list: #include <list>
Definition deque: #include <deque>

Defining examples
?

1 2 3

vector< int > VI; list< int > li; deque< int > di;

2. Sequence container initialization

Initialization example:?

1 2 3 4 5 6 7 8 9 10