Standard C++ Library Reference ISO/IEC (VERSION3)

lower_bound(keyval) and X.second == upper_bound(keyval).
map::erase
iterator erase(iterator where);
iterator erase(iterator first, iterator last);
size_type erase(const Key& keyval);
The first member function removes the element of the controlled sequence pointed to by
where. The second member function removes the elements in the interval [first, last).
Both return an iterator that designates the first element remaining beyond any elements
removed, or end() if no such element exists.
The third member function removes the elements with sort keys in the range
[lower_bound(keyval), upper_bound(keyval)). It returns the number of
elements it removes.
The member functions never throw an exception.
map::find
iterator find(const Key& keyval);
const_iterator find(const Key& keyval) const;
The member function returns an iterator that designates the element in the controlled sequence
whose sort key has equivalent ordering to keyval. If no such element exists, the function
returns end().
map::get_allocator
Alloc get_allocator() const;
The member function returns the stored allocator object.
map::insert
pair<iterator, bool> insert(const value_type& val);
iterator insert(iterator where, const value_type& val);
template<class InIt>
void insert(InIt first, InIt last);
The first member function determines whether an element X exists in the sequence whose key
has equivalent ordering to that of val. If not, it creates such an element X and initializes it with
val. The function then determines the iterator where that designates X. If an insertion
occurred, the function returns pair(where, true). Otherwise, it returns pair(where,
false).