26.5 Unordered associative containers [unord]
unordered_multiset() : unordered_multiset(size_type(see below)) { }
explicit unordered_multiset(size_type n,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
Effects: Constructs an empty
unordered_multiset using the
specified hash function, key equality predicate, and allocator, and
using at least
n buckets
. For the default constructor,
the number of buckets is
implementation-defined
. max_load_factor() returns
1.0. template <class InputIterator>
unordered_multiset(InputIterator f, InputIterator l,
size_type n = see below,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
unordered_multiset(initializer_list<value_type> il,
size_type n = see below,
const hasher& hf = hasher(),
const key_equal& eql = key_equal(),
const allocator_type& a = allocator_type());
Effects:
Constructs an empty
unordered_multiset using the
specified hash function, key equality predicate, and allocator, and
using at least
n buckets
. If
n is not
provided, the number of buckets is
implementation-defined
. Then
inserts elements from the range
[f, l)
for the first form, or from the range
[il.begin(), il.end()) for the second form
. max_load_factor() returns
1.0. Complexity: Average case linear, worst case quadratic
.