47 lines
1.3 KiB
C++
47 lines
1.3 KiB
C++
// STLport regression testsuite component.
|
|
// To compile as a separate example, please #define MAIN.
|
|
|
|
#include <hash_map>
|
|
#include <iostream>
|
|
|
|
#ifdef MAIN
|
|
#define hmmap1_test main
|
|
#endif
|
|
|
|
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
|
using namespace std;
|
|
#endif
|
|
|
|
//struct hash<string>
|
|
//{
|
|
// size_t operator()(const string& s) const { return __stl_hash_string(s.c_str()); }
|
|
//};
|
|
|
|
// typedef _Hashtable_node< pair< const char, int > >* nodeptr;
|
|
// __STL_TYPE_TRAITS_POD_SPECIALIZE(nodeptr);
|
|
|
|
|
|
int hmmap1_test(int, char**)
|
|
{
|
|
cout<<"Results of hmmap1_test:"<<endl;
|
|
typedef hash_multimap<char, int, hash<char>,equal_to<char> > mmap;
|
|
mmap m;
|
|
cout << "count('X') = " << m.count('X') << endl;
|
|
m.insert(pair<const char,int>('X', 10)); // Standard way.
|
|
cout << "count('X') = " << m.count('X') << endl;
|
|
// m.insert('X', 20); // Non-standard, but very convenient!
|
|
m.insert(pair<const char,int>('X', 20)); // jbuck: standard way
|
|
cout << "count('X') = " << m.count('X') << endl;
|
|
// m.insert('Y', 32);
|
|
m.insert(pair<const char,int>('Y', 32)); // jbuck: standard way
|
|
mmap::iterator i = m.find('X'); // Find first match.
|
|
while(i != m.end()) // Loop until end is reached.
|
|
{
|
|
cout <<(*i).first << " -> " <<(*i).second << endl;
|
|
i++;
|
|
}
|
|
int count = m.erase('X');
|
|
cout << "Erased " << count << " items" << endl;
|
|
return 0;
|
|
}
|