[#BloombergLP-bslstl-HashTable-09-findRange-03]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::xref:BloombergLP/bslstl/HashTable-09.adoc[HashTable<UnorderedMapKeyConfiguration<basic_string<char> const, pair<basic_string<char> const, Json>>, TransparentHash, TransparentEqualTo, allocator<pair<basic_string<char> const, Json>>>]::findRange
:relfileprefix: ../../../
:mrdocs:

`findRange` overloads

== Synopses

Declared in `<bslstl_hashtable.h>`

Load into the specified `first` and `last` pointers the respective addresses of the first and last link (in the list of elements owned by this hash table) where the contained elements have a key that compares equal to the specified `key` using the `comparator` of this hash‐table, and null pointer values if there are no elements matching `key`. Note that the output values will form a closed range, where both `first` and `last` point to links satisfying the predicate (rather than a semi‐open range where `last` would point to the element following the range). Also note that this hash‐table ensures all elements having the same key form a contiguous sequence.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
xref:BloombergLP/bslstl/HashTable-09/findRange-0f.adoc[findRange](
    xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]** first,
    xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]** last,
    xref:BloombergLP/bslstl/HashTable-09/KeyType.adoc[KeyType] const& key) const;
----

[.small]#xref:BloombergLP/bslstl/HashTable-09/findRange-0f.adoc[_» more..._]#

Load into the specified `first` and `last` pointers the respective addresses of the first and last link (in the list of elements owned by this hash table) where the contained elements have a key that is equivalent to the specified `key` using the `comparator` of this hash‐table, and null pointer values if there are no elements matching `key`. The behavior is undefined unless `key` is equivalent to the elements of at most one equivalent‐key group. Note that the output values will form a closed range, where both `first` and `last` point to links satisfying the predicate (rather than a semi‐open range where `last` would point to the element following the range). Also note that this hash‐table ensures all elements having the same key form a contiguous sequence.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
void
xref:BloombergLP/bslstl/HashTable-09/findRange-0b.adoc[findRange](
    xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]** first,
    xref:BloombergLP/bslalg/BidirectionalLink.adoc[bslalg::BidirectionalLink]** last,
    LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<HASHER,    LOOKUP_KEY>::value
   && BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,LOOKUP_KEY>::value;
----

[.small]#xref:BloombergLP/bslstl/HashTable-09/findRange-0b.adoc[_» more..._]#


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