Hash_multiset is useful in applications where it is important
to be able to search for an element quickly. If it is important for
the elements to be in a particular order, however, then
multiset is more appropriate.

New members

Notes

[1]
This member function relies on member template functions, which
at present (early 1998) are not supported by all compilers. If your
compiler supports member templates, you can call this function with
any type of input iterator. If your
compiler does not yet support member templates, though, then the
arguments must either be of type const value_type* or of type
hash_multiset::const_iterator.