vector Class
The STL vector class is a class template that stores elements of a given type in a linear arrangement and allows fast random access to any element. The vector class should be the preferred container for a sequence when randomaccess performance is at a premium. When you are not sure what type of sequence container to use, use vector.
template < class Type, class Allocator = allocator<Type> > class vector
Vectors allow constant time insertions and deletions at the end of the sequence. Inserting or deleting elements in the middle of a vector requires linear time. The performance of the deque Class container is superior with respect to insertions and deletions at the beginning and end of a sequence. The list Class container is superior with respect to insertions and deletions at any location within a sequence.
Vector reallocation occurs when a member function must increase the number of elements contained in the vector beyond its current storage capacity. Other insertions and erasures may alter various storage addresses within the sequence. In all such cases, iterators or references that point at altered portions of the sequence become invalid. If no reallocation happens, only iterators and references before the insertion/deletion point remain valid.
The vector<bool> Class is a full specialization of the class template vector for elements of type bool with an allocator for the underlying type used by the specialization.
The vector<bool> reference Class is a nested class whose objects are able to provide references to elements (single bits) within a vector<bool> object.
The type of the allocator used by the vector. 

A type that represents a randomaccess readonly iterator. 

A type that represents a readonly pointer to an element in a vector. 

A reference to a const element stored in a vector for reading and performing const operations. 

A readonly reverse iterator. 

A type that represents the difference between the addresses of two elements in a vector. 

A type that provides a randomaccess iterator that can read or modify any element in a vector. 

A type that represents a pointer to an element in a vector. 

A type that represents a reference to an element stored in a vector. 

A type that represents a reverse_iterator. 

A type that represents the number of elements in a vector. 

A type that represents the data type stored in a vector. 
Replaces the specified elements with copies of the new elements. 

Returns a reference to the element at a specified location in the vector and throws out_of_range exception if the index is less than zero or greater than or equal to size(). 

Returns a reference to the last element of the vector. 

Returns a randomaccess iterator to the first element in the vector. 

Returns the number of elements that the vector could contain without allocating more storage. 

Returns a randomaccess const iterator to the first element in the vector. 

Returns a randomaccess const iterator that points to one pastj the end of the vector. 

Returns a const reverse_iterator to the last element in a vector. 

Returns a const reverse_iterator that points to one before the first element in the vector. 

Erases the elements of the vector. 

Returns a pointer to the first element in the vector. 

Inserts an element constructed in place into the vector at a specified position. 

Adds an element constructed in place to the end of the vector. 

Tests if the vector contains any elements. 

Returns a randomaccess iterator that points to one past the last element of the vector. 

Removes an element or a range of elements in a vector from specified positions. 

Returns a reference to the first element in a vector. 

Returns the allocator used by the vector. 

Inserts an element or a number of elements into the vector at a specified position. 

Returns the maximum length of the vector. 

Deletes the element at the end of the vector. 

Adds an element to the end of the vector. 

Returns an iterator to the first element in a reversed vector. 

Returns a reverse_iterator that points to one before the first element. 

Reserves a minimum length of storage for a vector object. 

Specifies a new size for a vector. 

Discards excess capacity. 

Returns the number of elements in the vector. 

Exchanges the elements of two vectors. 