cpp/container/vector

@1@ is a sequence container that encapsulates dynamic size arrays. @2@ is an alias template that uses a polymorphic allocator.

The elements are stored contiguously, which means that elements can be accessed not only through iterators, but also using offsets to regular pointers to elements. This means that a pointer to an element of a vector may be passed to any function that expects a pointer to an element of an array.

The storage of the vector is handled automatically, being expanded as needed. Vectors usually occupy more space than static arrays, because more memory is allocated to handle future growth. This way a vector does not need to reallocate each time an element is inserted, but only when the additional memory is exhausted. The total amount of allocated memory can be queried using capacity function.

Reallocations are usually costly operations in terms of performance. The reserve function can be used to eliminate reallocations if the number of elements is known beforehand.

The complexity (efficiency) of common operations on vectors is as follows:


 * Random access - constant $O(1)$
 * Insertion or removal of elements at the end - amortized constant $O(1)$
 * Insertion or removal of elements - linear in the distance to the end of the vector $O(n)$

(for other than ) meets the requirements of,  and.

Specializations
The standard library provides a specialization of for the type, which may be optimized for space efficiency.