std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::find

Since C++11

1,2) Finds an element with key equivalent to key. If there are several elements with the requested key in the container, any of them may be returned.

# Declarations

iterator find( const Key& key );

(since C++11)

const_iterator find( const Key& key ) const;

(since C++11)

template< class K >
iterator find( const K& x );

(since C++20)

template< class K >
const_iterator find( const K& x ) const;

(since C++20)

# 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

An iterator to the requested element. If no such element is found, past-the-end (see end()) iterator is returned.

# Notes

Feature-test macro Value Std Feature __cpp_lib_generic_unordered_lookup 201811L (C++20) Heterogeneous comparison lookup in unordered associative containers; overloads (3,4)

# Example

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