[#bsl-unordered_set-02a-equal_range-0c6]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_set-02a.adoc[unordered&lowbar;set&lt;ManagedAttribute, AttributeHash&gt;]::equal&lowbar;range
:relfileprefix: ../../
:mrdocs:

`equal&lowbar;range` overloads

== Synopses

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

Return a pair of iterators providing modifiable access to the sequence of `value&lowbar;type` objects in this unordered set that are equivalent to the specified `key`, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence&period; If this unordered set contains no `value&lowbar;type` objects equivalent to `key`, then the two returned iterators will have the same value&period; Note that since an unordered set maintains unique keys, the range will contain at most one element&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[pair&lt;iterator, iterator&gt;]
xref:bsl/unordered_set-02a/equal_range-04.adoc[equal&lowbar;range](xref:bsl/unordered_set-02a/key_type.adoc[key&lowbar;type] const& key);
----

[.small]#xref:bsl/unordered_set-02a/equal_range-04.adoc[_» more&period;&period;&period;_]#

Return a pair of iterators providing non&hyphen;modifiable access to the sequence of `value&lowbar;type` objects in this unordered set that are equivalent to the specified `key`, where the first iterator is positioned at the start of the sequence and the second iterator is positioned one past the end of the sequence&period; If this unordered set contains no `value&lowbar;type` objects equivalent to `key`, then the two returned iterators will have the same value&period; Note that since an unordered set maintains unique keys, the range will contain at most one element&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[pair&lt;const&lowbar;iterator, const&lowbar;iterator&gt;]
xref:bsl/unordered_set-02a/equal_range-06.adoc[equal&lowbar;range](xref:bsl/unordered_set-02a/key_type.adoc[key&lowbar;type] const& key) const;
----

[.small]#xref:bsl/unordered_set-02a/equal_range-06.adoc[_» more&period;&period;&period;_]#

Return a pair of iterators providing modifiable access to the sequence of `value&lowbar;type` objects in this unordered set that are equivalent to the specified `key`, where the first iterator is positioned at the start of the sequence, and the second is positioned one past the end of the sequence&period; If this unordered set contains no `value&lowbar;type` objects equivalent to `key`, then the two returned iterators will have the same value&period; The behavior is undefined unless `key` is equivalent to at most one element in this unordered set&period; Note that since an unordered set maintains unique keys, the range will contain at most one element&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;class LOOKUP&lowbar;KEY&gt;
xref:bsl/pair-0b.adoc[pair&lt;iterator, iterator&gt;]
xref:bsl/unordered_set-02a/equal_range-0c1.adoc[equal&lowbar;range](LOOKUP&lowbar;KEY const& key)
requires BloombergLP&colon;&colon;bslmf&colon;&colon;IsTransparentPredicate&lt;HASH, LOOKUP&lowbar;KEY&gt;&colon;&colon;value
        &amp;&amp; BloombergLP&colon;&colon;bslmf&colon;&colon;IsTransparentPredicate&lt;EQUAL,LOOKUP&lowbar;KEY&gt;&colon;&colon;value;
----

[.small]#xref:bsl/unordered_set-02a/equal_range-0c1.adoc[_» more&period;&period;&period;_]#

Return a pair of iterators providing non&hyphen;modifiable access to the sequence of `value&lowbar;type` objects in this unordered set that are equivalent to the specified `key`, where the first iterator is positioned at the start of the sequence and the second iterator is positioned one past the end of the sequence&period; If this unordered set contains no `value&lowbar;type` objects equivalent to `key`, then the two returned iterators will have the same value&period; The behavior is undefined unless `key` is equivalent to at most one element in this unordered set&period; Note that since an unordered set maintains unique keys, the range will contain at most one element&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;class LOOKUP&lowbar;KEY&gt;
xref:bsl/pair-0b.adoc[pair&lt;const&lowbar;iterator, const&lowbar;iterator&gt;]
xref:bsl/unordered_set-02a/equal_range-0c3.adoc[equal&lowbar;range](LOOKUP&lowbar;KEY const& key) const
requires BloombergLP&colon;&colon;bslmf&colon;&colon;IsTransparentPredicate&lt;HASH, LOOKUP&lowbar;KEY&gt;&colon;&colon;value
        &amp;&amp; BloombergLP&colon;&colon;bslmf&colon;&colon;IsTransparentPredicate&lt;EQUAL,LOOKUP&lowbar;KEY&gt;&colon;&colon;value;
----

[.small]#xref:bsl/unordered_set-02a/equal_range-0c3.adoc[_» more&period;&period;&period;_]#


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