[#BloombergLP-bslstl-HashTable-09-findRange-0f]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::xref:BloombergLP/bslstl/HashTable-09.adoc[HashTable&lt;UnorderedMapKeyConfiguration&lt;basic&lowbar;string&lt;char&gt; const, pair&lt;basic&lowbar;string&lt;char&gt; const, Json&gt;&gt;, TransparentHash, TransparentEqualTo, allocator&lt;pair&lt;basic&lowbar;string&lt;char&gt; const, Json&gt;&gt;&gt;]::findRange
:relfileprefix: ../../../
:mrdocs:

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&hyphen;table, and null pointer values if there are no elements matching `key`&period; 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&hyphen;open range where `last` would point to the element following the range)&period; Also note that this hash&hyphen;table ensures all elements having the same key form a contiguous sequence&period;

== Synopsis

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

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
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]#Created with https://www.mrdocs.com[MrDocs]#
