[#BloombergLP-bdlc-FlatHashTable-equal_range-07]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/FlatHashTable.adoc[FlatHashTable]::equal_range
:relfileprefix: ../../../
:mrdocs:

`equal_range` overloads

== Synopses

Declared in `<bdlc_flathashtable.h>`

Return a pair of iterators providing modifiable access to the sequence of objects in this flat hash table 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 table contains no object having `key`, then the two returned iterators will have the same value, `end()`. Note that since each key in a flat hash table is unique, the returned range contains at most one element.


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

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

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


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

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

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/pair-0b.adoc[bsl::pair<iterator, iterator>]
xref:BloombergLP/bdlc/FlatHashTable/equal_range-0aa.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/FlatHashTable/equal_range-0aa.adoc[_» more..._]#

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


[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/FlatHashTable/equal_range-0ad.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/FlatHashTable/equal_range-0ad.adoc[_» more..._]#


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