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) |
key
. 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
key | - | key value of the element to search for |
x | - | a value of any type that can be transparently compared with a key |
Iterator to an element with key equivalent to key
. If no such element is found, past-the-end (see end()
) iterator is returned.
Logarithmic in the size of the container.
#include <iostream> #include <set> struct FatKey { int x; int data[1000]; }; struct LightKey { int x; }; bool operator<(const FatKey& fk, const LightKey& lk) { return fk.x < lk.x; } bool operator<(const LightKey& lk, const FatKey& fk) { return lk.x < fk.x; } bool operator<(const FatKey& fk1, const FatKey& fk2) { return fk1.x < fk2.x; } int main() { // simple comparison demo std::set<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"; } // transparent comparison demo std::set<FatKey, std::less<>> example2 = { {1, {} }, {2, {} }, {3, {} }, {4, {} } }; LightKey lk = {2}; auto search2 = example2.find(lk); if (search2 != example2.end()) { std::cout << "Found " << search2->x << '\n'; } else { std::cout << "Not found\n"; } }
Output:
Found 2 Found 2
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/set/find