hash_map::find (STL/CLR)

Finds an element that matches a specified key.

    iterator find(key_type key);


Key value to search for.

If at least one element in the controlled sequence has equivalent ordering with key, the member function returns an iterator designating one of those elements; otherwise it returns hash_map::end (STL/CLR)(). You use it to locate an element currently in the controlled sequence that matches a specified key.

// cliext_hash_map_find.cpp 
// compile with: /clr 
#include <cliext/hash_map> 
typedef cliext::hash_map<wchar_t, int> Myhash_map; 
int main() 
    Myhash_map c1; 
    c1.insert(Myhash_map::make_value(L'a', 1)); 
    c1.insert(Myhash_map::make_value(L'b', 2)); 
    c1.insert(Myhash_map::make_value(L'c', 3)); 
// display contents " [a 1] [b 2] [c 3]" 
    for each (Myhash_map::value_type elem in c1) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine("find {0} = {1}", 
        L'A', c1.find(L'A') != c1.end()); 
    Myhash_map::iterator it = c1.find(L'b'); 
    System::Console::WriteLine("find {0} = [{1} {2}]", 
        L'b', it->first, it->second); 
    System::Console::WriteLine("find {0} = {1}", 
        L'C', c1.find(L'C') != c1.end()); 
    return (0); 
 [a 1] [b 2] [c 3]
find A = False
find b = [b 2]
find C = False

Note that find does not guarantee which of several element it finds.

Header: <cliext/hash_map>

Namespace: cliext

Was this page helpful?
(1500 characters remaining)
Thank you for your feedback

Community Additions

© 2014 Microsoft