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

reverse_iterator rend(); const_reverse_iterator rend() const; const_reverse_iterator crend() const; (since C++11) Returns a reverse iterator to the element following the last element of the reversed container. It corresponds to the element preceding the first element of the non-reversed container. This element acts as a placeholder, attempting to access it results in undefined behavior. Parameters (none). Return value Reverse iterator to the element following the last

void remove( const T& value ); template< class UnaryPredicate > void remove_if( UnaryPredicate p ); Removes all elements satisfying specific criteria. The first version removes all elements that are equal to value, the second version removes all elements for which predicate p returns true. Parameters value - value of the elements to remove p - unary predicate which returns ​true if the element should be removed. The signature of the predicate function shoul

reverse_iterator rbegin(); const_reverse_iterator rbegin() const; const_reverse_iterator crbegin() const; (since C++11) Returns a reverse iterator to the first element of the reversed container. It corresponds to the last element of the non-reversed container. Parameters (none). Return value Reverse iterator to the first element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. See also rend crend r

void push_front( const T& value ); void push_front( T&& value ); (since C++11) Prepends the given element value to the beginning of the container. No iterators or references are invalidated. Parameters value - the value of the element to prepend Return value (none). Complexity Constant. Exceptions If an exception is thrown, this function has no effect (strong exception guarantee). See also emplace_front (C++11) constructs an element in-plac

void push_back( const T& value ); (1) void push_back( T&& value ); (2) (since C++11) Appends the given element value to the end of the container. 1) The new element is initialized as a copy of value. 2) value is moved into the new element. No iterators or references are invalidated. Parameters value - the value of the element to append Type requirements - T must meet the requirements of CopyInsertable in order to use overload (1). - T must meet the requ

void pop_front(); Removes the first element of the container. References and iterators to the erased element are invalidated. Parameters (none). Return value (none). Complexity Constant. Exceptions Does not throw. See also pop_back removes the last element (public member function) push_front inserts an element to the beginning (public member function)

void pop_back(); Removes the last element of the container. Calling pop_back on an empty container is undefined. References and iterators to the erased element are invalidated. Parameters (none). Return value (none). Complexity Constant. Exceptions (none). See also pop_front removes the first element (public member function) push_back adds an element to the end (public member function)

void merge( list& other ); (1) void merge( list&& other ); (1) (since C++11) template <class Compare> void merge( list& other, Compare comp ); (2) template <class Compare> void merge( list&& other, Compare comp ); (2) (since C++11) Merges two sorted lists into one. The lists should be sorted into ascending order. No elements are copied. The container other becomes empty after the operation. The function does nothing if this == &

size_type max_size() const; Returns the maximum number of elements the container is able to hold due to system or library implementation limitations, i.e. std::distance(begin(), end()) for the largest container. Parameters (none). Return value Maximum number of elements. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Notes This value is typically equal to std::numeric_limits<size_type>::max(), and reflects the