41975.cc: Use __uset_hashtable rather than removed __unordered_set.

2012-09-24  François Dumont  <fdumont@gcc.gnu.org>

	* testsuite/performance/23_containers/insert_erase/41975.cc: Use
	__uset_hashtable rather than removed __unordered_set.

From-SVN: r191678

libstdc++-v3/ChangeLog

+2012-09-24  François Dumont  <fdumont@gcc.gnu.org>
+
+	* testsuite/performance/23_containers/insert_erase/41975.cc: Use
+	__uset_hashtable rather than removed __unordered_set.
+
 2012-09-23  Paolo Carlini  <paolo.carlini@oracle.com>
 
 	Revert:

libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc

@@ -40,8 +40,9 @@ namespace
       const int nb = 200000;
       start_counters(time, resource);
 
-      std::__unordered_set<int, std::hash<int>, std::equal_to<int>,
-			   std::allocator<int>, use_cache> us;
+      std::__uset_hashtable<int, std::hash<int>, std::equal_to<int>,
+			    std::allocator<int>,
+			    std::__uset_traits<use_cache>> us;
       for (int i = 0; i != nb; ++i)
 	us.insert(i);
 
@@ -125,9 +126,10 @@ namespace
 
       start_counters(time, resource);
 
-      std::__unordered_set<std::string, std::hash<std::string>,
-			   std::equal_to<std::string>,
-			   std::allocator<std::string>, use_cache> us;
+      std::__uset_hashtable<std::string, std::hash<std::string>,
+			    std::equal_to<std::string>,
+			    std::allocator<std::string>,
+			    std::__uset_traits<use_cache>> us;
       for (int i = 0; i != nb; ++i)
 	us.insert(strs[i]);