diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 70ee2a88e1b..920bd33e96c 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,8 @@ +2012-09-24 François Dumont + + * testsuite/performance/23_containers/insert_erase/41975.cc: Use + __uset_hashtable rather than removed __unordered_set. + 2012-09-23 Paolo Carlini Revert: diff --git a/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc b/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc index a5dae41dc60..286a045d8da 100644 --- a/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc +++ b/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, std::equal_to, - std::allocator, use_cache> us; + std::__uset_hashtable, std::equal_to, + std::allocator, + std::__uset_traits> us; for (int i = 0; i != nb; ++i) us.insert(i); @@ -125,9 +126,10 @@ namespace start_counters(time, resource); - std::__unordered_set, - std::equal_to, - std::allocator, use_cache> us; + std::__uset_hashtable, + std::equal_to, + std::allocator, + std::__uset_traits> us; for (int i = 0; i != nb; ++i) us.insert(strs[i]);