std::vector (for T other than bool) meets the requirements of Container, AllocatorAwareContainer(since C++11), SequenceContainer, ContiguousContainer(since C++17) and ReversibleContainer. All …

Constructs a new vector from a variety of data sources, optionally using a user supplied allocator alloc.

std:: vector <bool> is a possibly space-efficient specialization of std::vector for the type bool. The manner in which std:: vector <bool> is made space efficient (as well as whether it is optimized at all) …

Compares the contents of two vector s. 1,2) Checks if the contents of lhs and rhs are equal, that is, they have the same number of elements and each element in lhs compares equal with the element in rhs …

Destroys the vector. The destructors of the elements are called (in unspecified order) and the dynamically allocated storage (if any) is deallocated. Note, that if the elements are pointers, the …

Iterators (including the end() iterator) and references to the elements at or after the point of the erase are invalidated. The iterator pos must be valid and dereferenceable. Thus the end () iterator (which is …

auto it = std::remove(c.begin(), c.end(), value); auto r = c.end() - it; c.erase(it, c.end()); return r;

Increase the capacity of the vector (the total number of elements that the vector can hold without requiring reallocation) to a value that's greater or equal to new_cap. If new_cap is greater than the …

Vector capacity is never reduced when resizing to smaller size because that would invalidate all iterators, while the specification only invalidates the iterators to/after the erased elements.

Return value Iterator pointing to the emplaced element. Complexity Linear in the distance between pos and end (). Exceptions If an exception is thrown other than by the copy constructor, move …