/*
* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
* All rights reserved.
* This component and the accompanying materials are made available
* under the terms of "Eclipse Public License v1.0"
* which accompanies this distribution, and is available
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
*
* Initial Contributors:
* Nokia Corporation - initial contribution.
*
* Contributors:
*
* Description: 
*
*/

 
// STLport regression testsuite component.
// To compile as a separate example, please #define MAIN.

#include <iostream>
#include <hash_map>
#include <rope>

#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;
	int failures = 0;
	cout << "count('X') = " << m.count('X') << endl;
	if(m.count('X') != 0)
		failures++;

	m.insert(pair<const char,int>('X', 10)); // Standard way.
	cout << "count('X') = " << m.count('X') << endl;
	if(m.count('X') != 1)
		failures++;

	//  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;
	if(m.count('X') != 2)
		failures++;

	//  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;
	if (count != 2)
		failures++;

	if (!failures)
	return 0;
	else
	return 1;
}
