bool contains( const Key& key ) const; | (1) | (since C++20) |
bool contains( const Key& key, std::size_t hash ) const; | (1) | (since C++20) |
template< class K > bool contains( const K& x ) const; | (2) | (since C++20) |
template< class K > bool contains( const K& x, std::size_t hash ) const; | (2) | (since C++20) |
key
in the container.x
. This overload only participates in overload resolution if the qualified-id Hash::transparent_key_equal
is valid and denotes a type. This assumes that such Hash is callable with both K and Key type, and that its key_equal is transparent, which, together, allows calling this function without constructing an instance of Key
.If present, the hash
parameter may be used to pass a pre-computed hash value as an optimization. The behavior is undefined if invoking hash_function()
on the key passed do not produce the same value as hash
.
key | - | key value of the element to search for |
x | - | a value of any type that can be transparently compared with a key |
hash | - | the hash value of the key |
true
if there is such an element, otherwise false
.
Constant on average, worst case linear in the size of the container.
#include <iostream> #include <unordered_map> int main() { std::unordered_multimap<int,char> example = {{1,'a'},{2,'b'}}; if(example.contains(2)) { std::cout << "Found\n"; } else { std::cout << "Not found\n"; } }
Output:
Found
finds element with specific key (public member function) |
|
returns the number of elements matching specific key (public member function) |
|
returns range of elements matching a specific key (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/unordered_multimap/contains