unordered_multiset::find

Finds an element that matches a specified key.

const_iterator find(const Key& keyval) const;

Parameters

• keyval
  Key value to search for.

Remarks

The member function returns unordered_multiset::equal_range(keyval).first.

Example

// std_tr1__unordered_set__unordered_multiset_find.cpp 
// compile with: /EHsc 
#include <unordered_set> 
#include <iostream> 
 
typedef std::unordered_multiset<char> Myset; 
int main() 
    { 
    Myset c1; 
 
    c1.insert('a'); 
    c1.insert('b'); 
    c1.insert('c'); 
 
// display contents " [c] [b] [a]" 
    for (Myset::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << *it << "]"; 
    std::cout << std::endl; 
 
// try to find and fail 
    std::cout << "find('A') == " 
        << std::boolalpha << (c1.find('A') != c1.end()) << std::endl; 
 
// try to find and succeed 
    Myset::iterator it = c1.find('b'); 
    std::cout << "find('b') == " 
        << std::boolalpha << (it != c1.end()) 
        << ": [" << *it << "]" << std::endl; 
 
    return (0); 
    } 
 

 [c] [b] [a]
find('A') == false
find('b') == true: [b]

Requirements

Header: <unordered_set>

Namespace: std

See Also

Reference

<unordered_set>

unordered_multiset Class

unordered_multiset::equal_range