hash_map::equal_range (STL/CLR)

 

Finds range that matches a specified key.

cliext::pair<iterator, iterator> equal_range(key_type key);

key

Key value to search for.

The member function returns a pair of iterators cliext::pair<iterator, iterator>( hash_map::lower_bound (STL/CLR)(key), hash_map::upper_bound (STL/CLR)(key)). You use it to determine the range of elements currently in the controlled sequence that match a specified key.

Example

// cliext_hash_map_equal_range.cpp 
// compile with: /clr 
#include <cliext/hash_map> 

typedef cliext::hash_map<wchar_t, int> Myhash_map; 
typedef Myhash_map::pair_iter_iter Pairii; 
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(); 

// display results of failed search 
    Pairii pair1 = c1.equal_range(L'x'); 
    System::Console::WriteLine("equal_range(L'x') empty = {0}", 
        pair1.first == pair1.second); 

// display results of successful search 
    pair1 = c1.equal_range(L'b'); 
    for (; pair1.first != pair1.second; ++pair1.first) 
        System::Console::Write(" [{0} {1}]", 
            pair1.first->first, pair1.first->second); 
    System::Console::WriteLine(); 
    return (0); 
    } 

 [a 1] [b 2] [c 3]
equal_range(L'x') empty = True
 [b 2]

Requirements

Header: <cliext/hash_map>

Namespace: cliext

Show: