std::multiset::find

iterator find (const value_type& val) const;

const_iterator find (const value_type& val) const;iterator find (const value_type& val);

Get iterator to element

Searches the container for an element equivalent to val and returns an iterator to it if found, otherwise it returns an iterator to multiset::end.

Notice that this function returns an iterator to a single element (of the possibly multiple equivalent elements). To obtain the entire range of equivalent elements, see multiset::equal_range.

Two elements of a multiset are considered equivalent if the container's comparison object returns false reflexively (i.e., no matter the order in which the elements are passed as arguments).

Parameters

val: Value to be searched for.
Member type value_type is the type of the elements in the container, defined in multiset as an alias of its first template parameter (T).

Return value

An iterator to the element, if val is found, or multiset::end otherwise.

Member types iterator and const_iterator are bidirectional iterator types pointing to elements.

Example

// multiset::find #include <iostream> #include <set> int main () { std::multiset<int> mymultiset; std::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)); std::cout << "mymultiset contains:"; for (it=mymultiset.begin(); it!=mymultiset.end(); ++it) std::cout << ' ' << *it; std::cout << '\n'; return 0; }

Output:

mymultiset contains: 10 30 50

Complexity

Logarithmic in size.

Iterator validity

No changes.

Data races

The container is accessed (neither the const nor the non-const versions modify the container).
Concurrently accessing the elements of a multiset is safe.

Exception safety

Strong guarantee: if an exception is thrown, there are no changes in the container.

member functions

non-member overloads