[#bsl-unordered_set-0d2d-2constructor-0b]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_set-0d2d.adoc[unordered&lowbar;set]::unordered&lowbar;set
:relfileprefix: ../../
:mrdocs:

Create an unordered set from the specified iterator range&period;

== Synopsis

Declared in `&lt;bslstl&lowbar;unorderedset&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;class INPUT&lowbar;ITERATOR&gt;
unordered&lowbar;set(
    INPUT&lowbar;ITERATOR first,
    INPUT&lowbar;ITERATOR last,
    xref:bsl/unordered_set-0d2d/size_type.adoc[size&lowbar;type] initialNumBuckets,
    HASH const& hashFunction,
    ALLOCATOR const& basicAllocator);
----

== Description

Same as the preceding overload without a key&hyphen;equality functor&period;

Create an unordered set, and insert (in order) each `value&lowbar;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&period; Use the specified `initialNumBuckets` as the initial size of the array of buckets of this container&period; Use the specified `hashFunction` to generate hash values for the keys contained in this set&period; Use the specified `basicAllocator` to supply memory&period;

== Parameters

[cols="1,4"]
|===
| 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
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#
