bsl::unordered_map::find

Synopses

Declared in <bslstl_unorderedmap.h>

Return an iterator providing modifiable access to the value_type object in this unordered map with a key equivalent to the specified key, if such an entry exists, and the past-the-end iterator (end) otherwise.

iterator
find(key_type const& key);

» more...

Return an iterator providing non-modifiable access to the value_type object in this unordered map with a key equivalent to the specified key, if such an entry exists, and the past-the-end iterator (end) otherwise.

const_iterator
find(key_type const& key) const;

» more...

Return an iterator providing modifiable access to the value_type object in this unordered map with a key equivalent to the specified key, if such an entry exists, and the past-the-end iterator (end) otherwise. The behavior is undefined unless key is equivalent to the key of at most one element in this unordered map.

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 value_type object in this unordered map with a key equivalent to the specified key, if such an entry exists, and the past-the-end iterator (end) otherwise. The behavior is undefined unless key is equivalent to at most one key in this unordered map.

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...