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

access this stored object by calling the member function key_comp(). Such a traits object
must behave the same as an object of class hash_compare<Key, Pr>. Specifically, for all
values keyval of type Key, the call key_comp()(keyval) yields a distribution of values
of type size_t. Moreover, class Pr imposes a strict weak ordering on sort keys of type Key.
For any element X that precedes Y in the sequence and has the same hash value,
key_comp()(Y.first, X.first) is false. (For the default function object
less<Key>, sort keys never decrease in value.) Unlike template class hash_map, an object
of template class hash_multimap does not ensure that key_comp()(X.first,
Y.first) is true. (Keys need not be unique.)
The actual order of elements in the controlled sequence depends on the hash function, the
ordering function, and the current size of the hash table stored in the container object. You
cannot determine the current size of the hash table, so you cannot in general predict the order of
elements in the controlled sequence. You can always be assured, however, that any subset of
elements that have equivalent ordering are adjacent in the controlled sequence.
The object allocates and frees storage for the sequence it controls through a stored allocator
object of class Alloc. Such an allocator object must have the same external interface as an
object of template class allocator. Note that the stored allocator object is not copied when
the container object is assigned.
hash_multimap::allocator_type
typedef Alloc allocator_type;
The type is a synonym for the template parameter Alloc.
hash_multimap::begin
const_iterator begin() const;
iterator begin();
The member function returns a bidirectional iterator that points at the first element of the
sequence (or just beyond the end of an empty sequence).
hash_multimap::clear
void clear();
The member function calls erase( begin(), end()).
hash_multimap::const_iterator
typedef T1 const_iterator;
The type describes an object that can serve as a constant bidirectional iterator for the controlled