unordered_map::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_map::equal_range(keyval).first.

Example

// std_tr1__unordered_map__unordered_map_find.cpp 
// compile with: /EHsc 
#include <unordered_map> 
#include <iostream> 
 
typedef std::unordered_map<char, int> Mymap; 
int main() 
    { 
    Mymap c1; 
 
    c1.insert(Mymap::value_type('a', 1)); 
    c1.insert(Mymap::value_type('b', 2)); 
    c1.insert(Mymap::value_type('c', 3)); 
 
// display contents " [c 3] [b 2] [a 1]" 
    for (Mymap::const_iterator it = c1.begin(); 
        it != c1.end(); ++it) 
        std::cout << " [" << it->first << ", " << it->second << "]"; 
    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 
    Mymap::iterator it = c1.find('b'); 
    std::cout << "find('b') == " 
        << std::boolalpha << (it != c1.end()) 
        << ": [" << it->first << ", " << it->second << "]" << std::endl; 
 
    return (0); 
    } 
 

 [c, 3] [b, 2] [a, 1]
find('A') == false
find('b') == true: [b, 2]

Requirements

Header: <unordered_map>

Namespace: std

See Also

Reference

<unordered_map>

unordered_map Class

unordered_map::equal_range