std::multimap::find

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::multimap
Member functions multimap::multimap multimap::~multimap multimap::operator= multimap::get_allocator Iterators multimap::begin multimap::cbegin (C++11) multimap::end multimap::cend (C++11) multimap::rbegin multimap::crbegin (C++11) multimap::rend multimap::crend (C++11) Capacity multimap::erase multimap::size multimap::max_size Modifiers multimap::clear multimap::insert multimap::emplace (C++11) multimap::emplace_hint (C++11) multimap::erase multimap::swap Lookup multimap::count multimap::find multimap::equal_range multimap::lower_bound multimap::upper_bound Observers multimap::key_comp multimap::value_comp

iterator find( const Key& key );
const_iterator find( const Key& key ) const;

Finds an element with key key. If there are several elements with key in the container, the one inserted earlier is selected.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

key

-

key value of the element to search for

[edit] Return value

iterator to an elements with key key. If no such element is found, past-the-end (see end()) iterator is returned.

[edit] Complexity

This section is incomplete

[edit] See also

count	returns the number of elements matching specific key (public member function)
equal_range	returns range of elements matching a specific key (public member function)