Return an iterator to the element equivalent to key.
Declared in <bslstl_unorderedset.h>
Return an iterator to the element equivalent to key.
unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::iterator
find(key_type const& key);
» more...
Return an iterator to the element equivalent to key.
unordered_set<KEY, HASH, EQUAL, ALLOCATOR>::const_iterator
find(key_type const& key) const;
» more...
Return an iterator to the element equivalent to key.
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 to the element equivalent to key.
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...
end() if not foundend() if not found| Name | Description |
|---|---|
| key | key value to look up |