equal_range overloads

Synopses

Declared in <bdlc_flathashset.h>

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

bsl::pair<FlatHashSet<KEY, HASH, EQUAL>::const_iterator, FlatHashSet<KEY, HASH, EQUAL>::const_iterator>
equal_range(KEY const& key) const;

» more...

Return a pair of const_iterator providing non‐modifiable access to the sequence of value_type objects in this unordered set 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 set contains no value_type objects equivalent to key, then the two returned iterators will have the same value. Note that since an unordered set maintains unique keys, the range will contain at most one element.

template<class LOOKUP_KEY>
bsl::pair<const_iterator, const_iterator>
equal_range(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
         && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;

» more...

Created with MrDocs