A
vector
is a sequence container that supports
(amortized) constant time insert and erase operations at the end;
insert and erase in the middle take linear time.
Storage management is handled automatically, though hints can be given
to improve efficiency.
The exceptions are the
push_front, prepend_range, pop_front, and emplace_front member functions, which are not
provided.
Descriptions are provided here only for operations on vector
that are not described in one of these tables or for operations where there is
additional semantic information.
An incomplete type T may be used when instantiating vector
if the allocator meets the
allocator completeness requirements ([allocator.requirements.completeness]).
T shall be complete before any member of the resulting specialization
of vector is referenced.