Namespaces
Variants
Views
Actions

std::unordered_multiset::find

From cppreference.com
< cpp‎ | container‎ | unordered multiset
Revision as of 19:16, 2 November 2012 by P12bot (Talk | contribs)

 
 
 
 
iterator find( const Key& key );
(1)
const_iterator find( const Key& key ) const;
(2)
1,2) Finds an element with key equivalent to key.


Contents

Parameters

key - key value of the element to search for


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

Constant on average, worst case linear in the size of the container.

Example

See also

returns the number of elements matching specific key
(public member function) [edit]
returns range of elements matching a specific key
(public member function) [edit]