Share via


hash_set::equal_range (STL/CLR)

Finds range that matches a specified key.

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

Parameters

  • key
    Key value to search for.

Remarks

The member function returns a pair of iterators cliext::pair<iterator, iterator>( hash_set::lower_bound (STL/CLR)(key), hash_set::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_set_equal_range.cpp 
// compile with: /clr 
#include <cliext/hash_set> 
 
typedef cliext::hash_set<wchar_t> Myhash_set; 
typedef Myhash_set::pair_iter_iter Pairii; 
int main() 
    { 
    Myhash_set c1; 
    c1.insert(L'a'); 
    c1.insert(L'b'); 
    c1.insert(L'c'); 
 
// display initial contents " a b c" 
    for each (wchar_t elem in c1) 
        System::Console::Write(" {0}", elem); 
    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}", *pair1.first); 
    System::Console::WriteLine(); 
    return (0); 
    } 
 

a b c equal_range(L'x') empty = True b

Requirements

Header: <cliext/hash_set>

Namespace: cliext

See Also

Reference

hash_set (STL/CLR)

hash_set::count (STL/CLR)

hash_set::find (STL/CLR)

hash_set::lower_bound (STL/CLR)

hash_set::upper_bound (STL/CLR)