[#bsl-unordered_map-02b-equal_range-05]
= xref:bsl.adoc[bsl]::xref:bsl/unordered_map-02b.adoc[unordered_map]::equal_range
:relfileprefix: ../../
:mrdocs:

`equal_range` overloads

== Synopses

Declared in `<bslstl_unorderedmap.h>`

Return a pair of iterators providing modifiable access to the sequence of `value_type` objects in this unordered map having 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. If this unordered map contains no `value_type` object having `key`, then the two returned iterators will have the same value, `end()`. Note that since an unordered map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[pair<iterator, iterator>]
xref:bsl/unordered_map-02b/equal_range-0b.adoc[equal_range](xref:bsl/unordered_map-02b/key_type.adoc[key_type] const& key);
----

[.small]#xref:bsl/unordered_map-02b/equal_range-0b.adoc[_» more..._]#

Return a pair of iterators providing non‐modifiable access to the sequence of `value_type` objects in this unordered map having 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. If this unordered map contains no `value_type` object having `key`, then the two returned iterators will have the same value, `end()`. Note that since an unordered map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[pair<const_iterator, const_iterator>]
xref:bsl/unordered_map-02b/equal_range-0c.adoc[equal_range](xref:bsl/unordered_map-02b/key_type.adoc[key_type] const& key) const;
----

[.small]#xref:bsl/unordered_map-02b/equal_range-0c.adoc[_» more..._]#

Return a pair of iterators providing modifiable access to the sequence of `value_type` objects in this unordered map having 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. If this unordered map contains no `value_type` object having `key`, then the two returned iterators will have the same value, `end()`. The behavior is undefined unless `key` is equivalent to at most one key in this unordered map. Note that since an unordered map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/pair-0b.adoc[pair<iterator, iterator>]
xref:bsl/unordered_map-02b/equal_range-07.adoc[equal_range](LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
        && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;
----

[.small]#xref:bsl/unordered_map-02b/equal_range-07.adoc[_» more..._]#

Return a pair of iterators providing non‐modifiable access to the sequence of `value_type` objects in this unordered map with a key equivalent to 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. If this unordered map contains no `value_type` objects having a key equivalent to `key`, then the two returned iterators will have the same value, `end()`. The behavior is undefined unless `key` is equivalent to at most one key in this unordered map. Note that since an unordered map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/pair-0b.adoc[pair<const_iterator, const_iterator>]
xref:bsl/unordered_map-02b/equal_range-0d.adoc[equal_range](LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
        && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;
----

[.small]#xref:bsl/unordered_map-02b/equal_range-0d.adoc[_» more..._]#


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