std::vector<T,Allocator>::resize (3) - Linux Manuals
void resize( size_type count, T value = T() ); (until C++11)
void resize( size_type count ); (1) (since C++11)
void resize( size_type count, const value_type& value ); (2) (since C++11)
Resizes the container to contain count elements.
If the current size is greater than count, the container is reduced to its first count elements.
If the current size is less than count, additional elements are appended and initialized with copies of value. (until C++11)
If the current size is less than count,
1) additional default-inserted elements are appended (since C++11)
2) additional copies of value are appended
T must meet the requirements of MoveInsertable and DefaultInsertable in order to use overload (1).
T must meet the requirements of CopyInsertable in order to use overload (2).
Linear in the difference between the current size and count. Additional complexity possible due to reallocation if capacity is less than count
If an exception is thrown, this function has no effect (strong_exception_guarantee).
In overload (1), if T's move constructor is not noexcept and T is not CopyInsertable into *this, vector will use the throwing move constructor. If it throws, the guarantee is waived and the effects are unspecified. (since C++11)
If value-initialization in overload (1) is undesirable, for example, if the elements are of non-class type and zeroing out is not needed, it can be avoided by providing a custom_Allocator::construct.
Vector capacity is never reduced when resizing to smaller size because that would invalidate all iterators, rather than only the ones that would be invalidated by the equivalent sequence of pop_back() calls.
// Run this code
size (public member function)
insert (public member function)
erase (public member function)