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.
Declared in <bslstl_hashtable.h>
void
findRange(
bslalg::BidirectionalLink** first,
bslalg::BidirectionalLink** last,
KeyType const& key) const;