Intel® oneAPI Threading Building Blocks Developer Guide and API Reference
Lookup
All methods in this section can be executed concurrently with each other, concurrently-safe modifiers and while traversing the container.
count
size_type count( const key_type& key );Returns: the number of elements with the key equivalent to key.
template <typename K>
size_type count( const K& key );Returns: the number of elements with the key that is equivalent to key.
This overload only participates in overload resolution if qualified-id hasher::transparent_key_equal is valid and denotes a type.
find
iterator find( const key_type& key );
const_iterator find( const key_type& key ) const;Returns: an iterator to the element with the key equivalent to key, or end() if no such element exists.
template <typename K>
iterator find( const K& key );
template <typename K>
const_iterator find( const K& key ) const;Returns: an iterator to the element with the key that is equivalent to key, or end() if no such element exists.
These overloads only participate in overload resolution if qualified-id hasher::transparent_key_equal is valid and denotes a type.
contains
bool contains( const key_type& key ) const;Returns: true if an element with the key equivalent to key exists in the container; false, otherwise.
template <typename K>
bool contains( const K& key ) const;Returns: true if an element with the key equivalent to key exists in the container; false, otherwise.
This overload only participates in overload resolution if qualified-id hasher::transparent_key_equal is valid and denotes a type.
equal_range
std::pair<iterator, iterator> equal_range( const key_type& key );
std::pair<const_iterator, const_iterator> equal_range( const key_type& key ) const;Returns: if an element with the key equivalent to key exists, a pair of iterators {f, l}, where f is an iterator to this element, l is std::next(f). Otherwise, {end(), end()}.
template <typename K>
std::pair<iterator, iterator> equal_range( const K& key )
template <typename K>
std::pair<const_iterator, const_iterator> equal_range( const K& key )Returns: if an element with the key equivalent to key exists, a pair of iterators {f, l}, where f is an iterator to this element, l is std::next(f). Otherwise, {end(), end()}.
These overloads only participate in overload resolution if qualified-id hasher::transparent_key_equal is valid and denotes a type.