hash_map::clear (STL/CLR)
Removes all elements.
void clear();
Remarks
The member function effectively calls hash_map::erase (STL/CLR)( hash_map::begin (STL/CLR)(), hash_map::end (STL/CLR)()). You use it to ensure that the controlled sequence is empty.
Example
// cliext_hash_map_clear.cpp
// compile with: /clr
#include <cliext/hash_map>
typedef cliext::hash_map<wchar_t, int> Myhash_map;
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();
// clear the container and reinspect
c1.clear();
System::Console::WriteLine("size() = {0}", c1.size());
c1.insert(Myhash_map::make_value(L'a', 1));
c1.insert(Myhash_map::make_value(L'b', 2));
// display contents " [a 1] [b 2]"
for each (Myhash_map::value_type elem in c1)
System::Console::Write(" [{0} {1}]", elem->first, elem->second);
System::Console::WriteLine();
c1.clear();
System::Console::WriteLine("size() = {0}", c1.size());
return (0);
}
[a 1] [b 2] [c 3] size() = 0 [a 1] [b 2] size() = 0
Requirements
Header: <cliext/hash_map>
Namespace: cliext