find overloads
Synopses
Declared in <bslstl_unorderedmultimap.h>
Return an iterator providing modifiable access to the first value_type object in the sequence of all the value_type objects of this unordered multimap with a key equivalent to the specified key, if such entries exist, and the past‐the‐end (end) iterator otherwise.
Return an iterator providing non‐modifiable access to the first value_type object in the sequence of value_type objects of this unordered multimap with a key equivalent to the specified key, if such entries exist, and the past‐the‐end (end) iterator otherwise.
unordered_multimap<KEY, VALUE, HASH, EQUAL, ALLOCATOR>::const_iterator
find(key_type const& key) const;Return an iterator providing modifiable access to the first value_type object in the sequence of all the value_type objects of this unordered multimap with a key 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 key of the elements of at most one equivalent‐key group in this unordered multimap.
Return an iterator providing modifiable access to the first value_type object in this unordered multimap whose key is equivalent to the specified key, if such an entry exists, and the past‐the‐end (end) iterator otherwise. The behavior is undefined unless key is equivalent to the key of the elements of at most one equivalent‐key group in this unordered multimap.
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;Created with MrDocs