Create an unordered set from the specified iterator range.

Synopsis

Declared in <bslstl_unorderedset.h>

template<class INPUT_ITERATOR>
unordered_set(
    INPUT_ITERATOR first,
    INPUT_ITERATOR last,
    size_type initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);

Description

Same as the preceding overload without a key‐equality functor.

Create an unordered set, and insert (in order) each value_type object in the range starting at the specified first element, and ending immediately before the specified last element, ignoring those keys having a value equivalent to that which appears earlier in the sequence. Use the specified initialNumBuckets as the initial size of the array of buckets of this container. Use the specified hashFunction to generate hash values for the keys contained in this set. Use the specified basicAllocator to supply memory.

Parameters

Name

Description

first

the start of the iterator range

last

one past the end of the iterator range

initialNumBuckets

the initial number of buckets

hashFunction

the hash function

basicAllocator

the allocator used to supply memory

Created with MrDocs