set::equal_range (STL/CLR)
The new home for Visual Studio documentation is Visual Studio 2017 Documentation on docs.microsoft.com.
The latest version of this topic can be found at set::equal_range (STL/CLR).
Finds range that matches a specified key.
Syntax
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>(
set::lower_bound (STL/CLR)(``key``),
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_set_equal_range.cpp
// compile with: /clr
#include <cliext/set>
typedef cliext::set<wchar_t> Myset;
typedef Myset::pair_iter_iter Pairii;
int main()
{
Myset 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/set>
Namespace: cliext
See Also
set (STL/CLR)
set::count (STL/CLR)
set::find (STL/CLR)
set::lower_bound (STL/CLR)
set::upper_bound (STL/CLR)