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

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.
hash_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.
hash_map::key_comp
key_compare key_comp() const;
The member function returns the stored hash traits object that determines the order of elements
in the controlled sequence. In particular, 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.
hash_map::key_compare
typedef Tr key_compare;
The type describes a traits object that behaves much like an object of class
hash_compare<Key, Pr>. In particular, it can compare two sort keys to determine the
relative order of two elements in the controlled sequence.
hash_map::key_type
typedef Key key_type;
The type describes the sort key object stored in each element of the controlled sequence.
hash_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
sequence for which X.first has equivalent ordering to keyval. If no such element exists,
the function returns end().