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.

Synopsis

Declared in <bslstl_unorderedmap.h>

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;

Description

Note: implemented inline due to Sun CC compilation error.

Created with MrDocs