iterator find ( const key_type& x ) const;

Get iterator to element

Searches the container for an element with a value of x and returns an iterator to it if found, otherwise it returns an iterator to multiset::end (the element past the end of the container).

Notice that this function returns an iterator to only one of the elements with that value; To obtain the entire range of elements with a given value, you can use multiset::equal_range.

Parameters

x

Value to be searched for.
key_type is a member type defined in multiset containers as an alias of Key, which is the first template parameter and the type of the elements stored in the container.

Return value

Example

// multiset::find
#include <iostream>
#include <set>
using namespace std;

int main ()
{
  multiset<int> mymultiset;
  multiset<int>::iterator it;

  // set some initial values:
  for (int i=1; i<=5; i++) mymultiset.insert(i*10);   // 10 20 30 40 50

  it=mymultiset.find(20);
  mymultiset.erase (it);
  mymultiset.erase (mymultiset.find(40));

  cout << "mymultiset contains:";
  for (it=mymultiset.begin(); it!=mymultiset.end(); it++)
    cout << " " << *it;
  cout << endl;

  return 0;
}

Output:

mymultiset contains: 10 30 50

Complexity

See also