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

right.get_allocator(). Otherwise, it is Alloc().
All constructors also store a hash traits object that can later be returned by calling
key_comp(). The hash traits object is the argument traits, if present. For the copy
constructor, it is right.key_comp()). Otherwise, it is Tr().
The first three constructors specify an empty initial controlled sequence. The fourth constructor
specifies a copy of the sequence controlled by right. The last three constructors specify the
sequence of element values [first, last).
hash_multiset::insert
iterator 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 inserts the element val in the controlled sequence, then returns the
iterator that designates the inserted element. The second member function returns
insert(val), using where as a starting place within the controlled sequence to search for
the insertion point. (Insertion can possibly occur somewhat faster, 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.
hash_multiset::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_multiset::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.