Find it by yourself (Red indicates support for the previous function)
Size_type container: Capacity () const vector, string
Void constainer: Reserve (size_type num) vector, string
Bool comparison (const container & C1, const container & C2) vector, deque, list, set, Multiset, MAP, multimap, string
Size_type container: Count (const T & Value) const set, Multiset, MAP, multimap
Iterator container: Find (const T & value)
Const_iterator container: Find (const T & Value) const set, Multiset, MAP, multimap
Iterator container: lower_bound (const T & value)
Const_iterator container: lower_boudn (const T & Value) const set, Multiset, MAP, multimap
Iterator container: upper_bound (const T & value)
Const_iterator container: upper_boudn (const T & Value) const set, Multiset, MAP, multimap
Pair <iterator, iterator> container: pai_range (const T & value)
Pair <const_iterator, const_iterator> container: equal_range (const T & Value) const set, Multiset, MAP, multimap
Key_compare container: key_comp ()
Set, Multiset, MAP, multimap
Value_compare container: value_comp ()
Set, Multiset, MAP, multimap
Container & container: Operator = (const container & C) vector, deque, list, set, Multiset, MAP, multimap
Void container: Assign (size_type num, const T & Value) set, Multiset, MAP, multimap
Void container: Assign (inputiteartor beg, inputiterator end) vector, deque, list, string
Void container: swap (container & C) vector, deque, list, set, Multiset, MAP, multimap, string
Void swap (container & C1, container & C2)
Exclusive element access
Reference container: At (size_type idx)
Const_reference container: At (size_type idx) const vector, deque, string
Reference container: operator [] (size_type idx)
Const_reference container: operator [] (size_type idx) const vector, deque, string
T & map: operator [] (const key_type & Key) Map
Reference container: Front ()
Const_reference container: Front () const vector, deque, list
Reference container: Back ()
Const_reference container: Back () const
Vector, deque, list
Exclusive return iterator
Iterator container: Begin ()
Const_iterator container: Begin () const vector, deque, list, set, Multiset, MAP, multimap, string
Iterator container: end ()
Const_iterator container: end () const vector, deque, list, set, Multiset, MAP, multimap, string
Reverse_iterator container: rbegin ();
Const_reverse_iterator container: rbegin () const vector, deque, list, set, Multiset, MAP, multimap, string
Reverse_iterator container: rend ();
Const_reverse_iterator container: rend () const vector, deque, list, set, Multiset, MAP, multimap, string
Exclusive to insert and delete
Iterator container: insert (const T & Value) Multiset, multimap
Pair <iterator, bool> container: insert (const T & Value) set, map
Iterator container: insert (iterator POs, const T & Value) vector, deque, ist, set, Multiset, MAP, multimap, string
Void container: insert (iterator POs, size_type num, const T & Value) vector, deque, list, string
Void container: insert (inputiterator beg, inputiterator end) set, Multiset, MAP, multimap, string
Void container: insert (iterator posinputiterator beg, inputiterator end) vector, deque, list, string
Void container: push_front (const T & Value) deque, list
Void container: push_back (const T & Value) vector, deque, list, string
Void list: Remove (const T & value)
Void list: remove_if (unarypredicate OP)
Size_type container: erase (const T & Value) set, Multiset, MAP, multimap
Void container: erase (iterator POS)
Set, Multiset, MAP, multimap
Iterator container: erase (iterator POS) vector, deque, list, string
Void container: erase (iterator beg, iterator end) set, Multiset, MAP, multimap
Iterator container: erase (iterator beg, iterator end) vector, deque, list, string
Void container: pop_front ()
Deque, list
Void container: pop_back () vector, deque, list
Void container: resize (size_type num)
Void container: resize (size_type num, T value) vector, deque, list, string
Void container: clear ()
Vector, deque, list, set, Multiset, MAP, multimap, string
Exclusive list
Void list: Unique ()
Void list: Unique (binarypredicate OP)
Void list: splice (iterator POs, list & source)
Void list: splice (iterator POs, list & source, iterator sourcepos)
Void list: splice (iterator POs, list & source, iterator sourcebeg, iterator sourceend)
Void list: Sort ();
Void list: Sort (cmpfunc OP)
Void list: Merge (List & source)
Void list: Merge (List & source, compfunc OP)
Void list: reverse ()
Send two valuable images:
Extract from STL Library: