| Functions | Description |
| assign(first,last) | Replaces the container elements with the elements specified by iterators first and last |
| assign(n,val) | Replaces the container elements with n copies of val |
| at(n) | Returns the value of the element located at position n |
| back() | Returns a reference to the element at the end of the container |
| begin() | Returns an iterator that points to the first element of the container |
| capacity() | Returns the current maximum number of elements that can fit into the container |
| clear() | Erases all elements of a container |
| count(val) | Returns the number of instances of val in the container |
| empty() | Returns a TRUE if the container is empty |
| end() | Returns an iterator that points to the last element of the container |
| equal_range(val) | Returns two iterators that represent val's loer and upper bounds |
| erase(start,end) | Erases the range of container elements from iterator pointed by start to iterator pointed by end |
| erase(I) | Erases the container element pointed to by the iterator I |
| erase(val) | Erases the associative container's element val |
| find(val) | Returns an iterator that points to val. If val does not exist, the returnd iterator is equal to end() |
| front() | Returns a reference to the element at the start of the container |
| insert(I,val) | Inserts value val at the position specified by iterator I |
| insert(I,start,end) | Inserts the range of values specified by the iterators start and end at the position specified by iterator I |
| insert(I,n,val) | Inserts n copies of val at the position specified by the iterator I |
| key_comp() | Returns the object of type key_compare that determines the order of elements in the container |
| lower_bound(val) | Returns an iterator to the element immediately preceding val |
| max_size() | Returns the maximum size (the greatest number of elements that can fit) of the container |
| merge(ref) | Inserts all elements in the list referenced by ref into the list |
| pop() | Removes the element from a container adapter |
| pop_back() | Removes the container's last element |
| pop_front() | Removes the container's first element |
| push() | Inserts the element into container adapter |
| push_back(val) | Places the value val at the end of container |
| push_front(val) | Places the value val at the begining of container |
| rbegin() | Returns a reverse iterator that points to the last element of the container |
| remove(val) | Removes all occurrences of val from the container |
| remove_if(pred) | Removes all occurrences of elements for which the predicate pred is true |
| rend() | Returns a reverse iterator that points to the first element of the container |
| reserve(n) | Resizze the vector by n elements |
| resize(n,val) | Resizes the container by n elements, initializing the new elements with value val |
| reverse() | Reverses the order of the elements in the container |
| size() | Returns the size (the number of elements) of the container |
| sort() | Sorts the container based on the default predicate |
| sort(pred) | Sorts the container based on the specified predicate |
| sort(start,end) | Sorts the range of container from position pointed by start to the position pointed by end |
| splice(I,container) | Insert into list contents of container at the position I |
| swap(container) | Swaps the contents of two containers |
| top() | Returns the top element of the container adapter |
| unique() | Removes all the elements necessary to create a container of unique elements - that is, a container that contains no duplicate elements |
| unique(pred) | Removes all the elements necessary to create a container of unique elements based on the specified predicate pred |
| upper_bound(val) | Returns an iterator that points to val |
| value_comp() | Returns the object of type value_compare that determines the order of elements in the container |