hash_map::key_comp (STL/CLR)

Copies the ordering delegate for two keys.

    key_compare^key_comp();

Remarks

The member function returns the ordering delegate used to order the controlled sequence. You use it to compare two keys.

Example

// cliext_hash_map_key_comp.cpp 
// compile with: /clr 
#include <cliext/hash_map> 
 
typedef cliext::hash_map<wchar_t, int> Myhash_map; 
int main() 
    { 
    Myhash_map c1; 
    Myhash_map::key_compare^ kcomp = c1.key_comp(); 
 
    System::Console::WriteLine("compare(L'a', L'a') = {0}", 
        kcomp(L'a', L'a')); 
    System::Console::WriteLine("compare(L'a', L'b') = {0}", 
        kcomp(L'a', L'b')); 
    System::Console::WriteLine("compare(L'b', L'a') = {0}", 
        kcomp(L'b', L'a')); 
    System::Console::WriteLine(); 
 
// test a different ordering rule 
    Myhash_map c2 = cliext::greater<wchar_t>(); 
    kcomp = c2.key_comp(); 
 
    System::Console::WriteLine("compare(L'a', L'a') = {0}", 
        kcomp(L'a', L'a')); 
    System::Console::WriteLine("compare(L'a', L'b') = {0}", 
        kcomp(L'a', L'b')); 
    System::Console::WriteLine("compare(L'b', L'a') = {0}", 
        kcomp(L'b', L'a')); 
    return (0); 
    } 
 

compare(L'a', L'a') = True compare(L'a', L'b') = True compare(L'b', L'a') = False compare(L'a', L'a') = False compare(L'a', L'b') = False compare(L'b', L'a') = True

Requirements

Header: <cliext/hash_map>

Namespace: cliext

See Also

Reference

hash_map (STL/CLR)

hash_map::key_compare (STL/CLR)

hash_map::key_type (STL/CLR)