stdcpp/tsrc/Stdcpp_test/stlport/auto/stlport_hset/src/hmset1.cpp
changeset 31 ce057bb09d0b
child 34 5fae379060a7
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/stdcpp/tsrc/Stdcpp_test/stlport/auto/stlport_hset/src/hmset1.cpp	Fri Jun 04 16:20:51 2010 +0100
@@ -0,0 +1,97 @@
+/*
+* 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_set>
+
+#ifdef MAIN
+#define hmset1_test main
+#endif
+
+
+// struct hash<string> {
+//      size_t operator()(const string& s) const { return __stl_hash_string(s.c_str()); }
+//};
+
+#if defined (__MVS__)
+  #define star   92
+#else
+  #define star   42
+
+#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
+using namespace std;
+#endif
+#endif
+
+typedef hash_multiset<char, hash<char>, equal_to<char> > hmset;
+// __STL_TYPE_TRAITS_POD_SPECIALIZE(_Hashtable_node<char>*);
+
+
+int hmset1_test(int, char**)
+{
+	cout<<	"Results of hmset1_test:"<<endl;
+
+	hmset s;
+	int failures = 0;
+	cout << "count(" << star << ") = " << s.count(star) << endl;
+	if(s.count(star)  != 0)
+		failures++;
+
+	s.insert(star);
+	cout << "count(" << star << ") = " << s.count(star) << endl;
+	if(s.count(star)  != 1)
+		failures++;
+
+	s.insert(star);
+	cout << "count(" << star << ") = " << s.count(star) << endl;
+	if(s.count(star)  != 2)
+		failures++;
+
+	hmset::iterator i = s.find(40);
+	if(i == s.end())
+	{
+		cout << "40 Not found" << endl;
+	}
+	else
+	{
+		cout << "Found " << *i << endl;
+		failures++;
+	}
+	i = s.find(star);
+	if(i == s.end())
+	{
+		cout << "Not found" << endl;
+		failures++;
+	}
+	else
+	{
+		cout << "Found " << *i << endl;
+	}
+
+	int count = s.erase(star);
+	cout << "Erased " << count << " instances" << endl;
+	if(count != 2)
+		failures++;
+
+	if (!failures)
+	return 0;
+	else
+	return 1;
+}