Standard C++ Library Class Reference

insert(p,t) If the container does not support redundant key values then this
function only inserts t if there is no key present that is equal to the
key of t. If the container does support redundant keys then this
function always inserts the element t. The iterator p serves as a hint of
where to start searching, allowing for some optimization of the
insertion. It does not restrict the algorithm from inserting ahead of
that location if necessary.
insert(i,j) Inserts elements from the range [i,j).
erase(k) Erases all elements with key equal to k. Returns number of erased
elements.
erase(q) Erases the element pointed to by q.
erase(q1,q2) Erases the elements in the range [q1,q2).
find(k) Returns an iterator pointing to an element with key equal to k or end()
if such an element is not found.
count(k) Returns the number of elements with key equal to k.
lower_bound(k) Returns an iterator pointing to the first element with a key greater
than or equal to k.
upper_bound(k) Returns an iterator pointing to the first element with a key less than or
equal to k.
equal_range(k) Returns a pair of iterators such that the first element of the pair is
equivalent to lower_bound(k) and the second element equivelent to
upper_bound(k).
See Also
bitset, deque, list, map, multimap, multiset, priority_queue, queue, set, stack, vector