public member function
<unordered_set>

std::unordered_multiset::find

      iterator find ( const key_type& k );
const_iterator find ( const key_type& k ) const;
Get iterator to element
Searches the container for an element with k as key and returns an iterator to it if found, otherwise it returns an iterator to unordered_multiset::end (the element past the end of the container).

To obtain a range with all the elements whose key is k you can use member function equal_range.
To just check whether a particular key exists, you can use count.

Parameters

k
Key to be searched for.
Member type key_type is the type of the keys for the elements in the container, defined in unordered_multiset as an alias of its first template parameter (Key).

Return value

An iterator to the element, if the specified key value is found, or unordered_multiset::end if the specified key is not found in the container.

Member types iterator and const_iterator are forward iterator types.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
// unordered_multiset::find
#include <iostream>
#include <string>
#include <unordered_set>

int main ()
{
  std::unordered_multiset<std::string> myums =
    {"cow","cow","pig","sheep","pig"};

  std::unordered_multiset<std::string>::iterator it = myums.find("pig");

  if ( it != myums.end() )
    std::cout << *it << " found" << std::endl;

  return 0;
}


Output:
pig found

Complexity

Average case: constant.
Worst case: linear in container size.

Iterator validity

No changes.

See also

unordered_multiset::equal_range
Get range of elements with specific key (public member function)
unordered_multiset::count
Count elements with a specific key (public member function )

C++