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

The second member function returns insert(val).first, using where as a starting place
within the controlled sequence to search for the insertion point. (Insertion can occur in
amortized constant time, instead of logarithmic time, if the insertion point immediately precedes
or follows where.) The third member function inserts the sequence of element values, for each
where in the range [first, last), by calling insert(*where).
If an exception is thrown during the insertion of a single element, the container is left unaltered
and the exception is rethrown. If an exception is thrown during the insertion of multiple
elements, the container is left in a stable but unspecified state and the exception is rethrown.
map::iterator
typedef T0 iterator;
The type describes an object that can serve as a bidirectional iterator for the controlled
sequence. It is described here as a synonym for the implementation-defined type T0.
map::key_comp
key_compare key_comp() const;
The member function returns the stored function object that determines the order of elements in
the controlled sequence. The stored object defines the member function:
bool operator()(const Key& left, const Key& right);
which returns true if left strictly precedes right in the sort order.
map::key_compare
typedef Pr key_compare;
The type describes a function object that can compare two sort keys to determine the relative
order of two elements in the controlled sequence.
map::key_type
typedef Key key_type;
The type describes the sort key object stored in each element of the controlled sequence.
map::lower_bound
iterator lower_bound(const Key& keyval);
const_iterator lower_bound(const Key& keyval) const;
The member function returns an iterator that designates the earliest element X in the controlled