hash_multiset::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_multiset::find (STL/CLR).
Finds an element that matches a specified key.
iterator find(key_type key);
Parameters
key
Key value to search for.
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_multiset::end (STL/CLR)(). You use it to locate an element currently in the controlled sequence that matches a specified key.
// cliext_hash_multiset_find.cpp
// compile with: /clr
#include <cliext/hash_set>
typedef cliext::hash_multiset<wchar_t> Myhash_multiset;
int main()
{
Myhash_multiset 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
Note that find does not guarantee which of several element it finds.
Header: <cliext/hash_set>
Namespace: cliext
hash_multiset (STL/CLR)
hash_multiset::equal_range (STL/CLR)
hash_multiset::lower_bound (STL/CLR)
hash_multiset::upper_bound (STL/CLR)