std::multimap::find

 

C++

Language

Standard library headers

Concepts

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::beginmultimap::cbegin (C++11)

multimap::endmultimap::cend (C++11)

multimap::rbeginmultimap::crbegin (C++11)

multimap::rendmultimap::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 );	(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. If there are several elements with key in the container, any of them may be returned.

3,4) Finds an element with key that compares equivalent to the value x. These templates only participate in overload resolution if the type Compare::is_transparent exists. They allow calling this function without constructing an instance of Key

Parameters

key	-	key value of the element to search for
x	-	a value of any type that can be transparently compared with a key

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.

Complexity

Logarithmic in the size of the container.

Example

Run this code

#include <iostream>
#include <map>
 
int main()
{  
    std::multimap<int,char> example = {{1,'a'},{2,'b'}};
 
    auto search = example.find(2);
    if(search != example.end()) {
        std::cout << "Found " << search->first << " " << search->second << '\n';
    }
    else {
        std::cout << "Not found\n";
    }
}

Output:

Found 2 b

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)