[#BloombergLP-bdlc-FlatHashMap-equal_range-02]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/FlatHashMap.adoc[FlatHashMap]::equal_range
:relfileprefix: ../../../
:mrdocs:

`equal_range` overloads

== Synopses

Declared in `<bdlc_flathashmap.h>`

Return a pair of iterators defining the sequence of modifiable elements in this map having 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. If this map contains no elements having a key equivalent to `key`, then the two returned iterators will have the same value. Note that since a map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<FlatHashMap<KEY, VALUE, HASH, EQUAL>::iterator, FlatHashMap<KEY, VALUE, HASH, EQUAL>::iterator>]
xref:BloombergLP/bdlc/FlatHashMap/equal_range-0b.adoc[equal_range](KEY const& key);
----

[.small]#xref:BloombergLP/bdlc/FlatHashMap/equal_range-0b.adoc[_» more..._]#

Return a pair of `const_iterator`s defining the sequence of elements in this map having 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. If this map contains no elements having a key equivalent to `key`, then the two returned iterators will have the same value. Note that since a map maintains unique keys, the range will contain at most one element.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/pair-0b.adoc[bsl::pair<FlatHashMap<KEY, VALUE, HASH, EQUAL>::const_iterator, FlatHashMap<KEY, VALUE, HASH, EQUAL>::const_iterator>]
xref:BloombergLP/bdlc/FlatHashMap/equal_range-039.adoc[equal_range](KEY const& key) const;
----

[.small]#xref:BloombergLP/bdlc/FlatHashMap/equal_range-039.adoc[_» more..._]#

Return a pair of iterators defining the sequence of modifiable elements in this map having a key 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. If this map contains no elements having a key equivalent to `key`, then the two returned iterators will have the same value. Note that since a 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[bsl::pair<iterator, iterator>]
xref:BloombergLP/bdlc/FlatHashMap/equal_range-04.adoc[equal_range](LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
         && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;
----

[.small]#xref:BloombergLP/bdlc/FlatHashMap/equal_range-04.adoc[_» more..._]#

Return a pair of iterators providing non‐modifiable access to the sequence of `value_type` objects in this unordered map 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. If this unordered map contains no `value_type` objects equivalent to `key`, then the two returned iterators will have the same value. 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[bsl::pair<const_iterator, const_iterator>]
xref:BloombergLP/bdlc/FlatHashMap/equal_range-030.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:BloombergLP/bdlc/FlatHashMap/equal_range-030.adoc[_» more..._]#


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