hash_set::find (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 hash_set::find (STL/CLR).
Finds an element that matches a specified key.
Syntax
iterator find(key_type key);
Parameters
key
Key value to search for.
Remarks
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_set::end (STL/CLR)()
. You use it to locate an element currently in the controlled sequence that matches a specified key.
Example
// cliext_hash_set_find.cpp
// compile with: /clr
#include <cliext/hash_set>
typedef cliext::hash_set<wchar_t> Myhash_set;
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();
System::Console::WriteLine("find {0} = {1}",
L'A', c1.find(L'A') != c1.end());
System::Console::WriteLine("find {0} = {1}",
L'b', *c1.find(L'b'));
System::Console::WriteLine("find {0} = {1}",
L'C', c1.find(L'C') != c1.end());
return (0);
}
a b c
find A = False
find b = b
find C = False
Description
Note that find
does not guarantee which of several element it finds.
Requirements
Header: <cliext/hash_set>
Namespace: cliext
See Also
hash_set (STL/CLR)
hash_set::equal_range (STL/CLR)
hash_set::lower_bound (STL/CLR)
hash_set::upper_bound (STL/CLR)