Return an iterator providing modifiable access to the value_type object in this unordered set that 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 at most one element in this unordered set.

Synopsis

Declared in <bslstl_unorderedset.h>

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;

Description

Note: implemented inline due to Sun CC compilation error.

Created with MrDocs