std::multiset::find
From cppreference.com
iterator find( const Key& key );
|
(1) | |
const_iterator find( const Key& key ) const;
|
(2) | |
template< class K > iterator find( const K& x );
|
(3) | (since C++14) |
template< class K > const_iterator find( const K& x ) const;
|
(4) | (since C++14) |
1,2) Finds an element with key equivalent to
key
.
3,4) Finds an element with key that compares equivalent to the value
x
. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. It allows calling this function without constructing an instance of Key
Contents |
[edit] Parameters
key | - | key value of the element to search for |
x | - | a value of any type that can be transparently compared with a key |
[edit] Return value
Iterator to an element with key equivalent to key
. If no such element is found, past-the-end (see end()) iterator is returned.
[edit] Complexity
Logarithmic in the size of the container.
[edit] Example
Run this code
#include <iostream> #include <set> int main() { std::multiset<int> example = {1, 2, 3, 4}; auto search = example.find(2); if(search != example.end()) { std::cout << "Found " << (*search) << '\n'; } else { std::cout << "Not found\n"; } }
Output:
Found 2
[edit] See also
returns the number of elements matching specific key (public member function) |
|
returns range of elements matching a specific key (public member function) |