bsl::unordered_multiset::find

Synopses

Declared in <bslstl_unorderedmultiset.h>

Return an iterator providing modifiable access to the first value_type object in the sequence of all the value elements of this unordered multiset equivalent to the specified key, if such entries exist, and the past-the-end (end) iterator otherwise.

unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::iterator
find(key_type const& key);

» more...

Return an iterator providing non-modifiable access to the first value_type object in the sequence of all the value elements of this unordered multiset equivalent to the specified key, if such entries exist, and the past-the-end (end) iterator otherwise.

unordered_multiset<KEY, HASH, EQUAL, ALLOCATOR>::const_iterator
find(key_type const& key) const;

» more...

Return an iterator providing modifiable access to the first value_type object in the sequence of all the value elements of this unordered multiset equivalent to the specified key, if such entries exist, and the past-the-end (end) iterator otherwise. The behavior is undefined unless key is equivalent to the elements of at most one equivalent-key group in this unordered multiset.

template<class LOOKUP_KEY>
iterator
find(LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<HASH, LOOKUP_KEY>::value
        && BloombergLP::bslmf::IsTransparentPredicate<EQUAL,LOOKUP_KEY>::value;

» more...

Return an iterator providing non-modifiable access to the first value_type object in the sequence of all the value elements of this unordered multiset equivalent to the specified key, if such entries exist, and the past-the-end (end) iterator otherwise. The behavior is undefined unless key is equivalent to the elements of at most one equivalent-key group in this unordered multiset.

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

» more...