Update copyright years.

[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 23_containers / unordered_multiset / erase / 1.cc

diff --git a/libstdc++-v3/testsuite/23_containers/unordered_multiset/erase/1.cc b/libstdc++-v3/testsuite/23_containers/unordered_multiset/erase/1.cc
index b95c8a38706a90d748f738d211213c3546b582be..3c82c8884232cba2443de57bcd58d37d7a9a63e4 100644 (file)
--- a/libstdc++-v3/testsuite/23_containers/unordered_multiset/erase/1.cc
+++ b/libstdc++-v3/testsuite/23_containers/unordered_multiset/erase/1.cc
@@ -1,8 +1,8 @@
-// { dg-options "-std=gnu++0x" }
+// { dg-do run { target c++11 } }
 
 // 2010-02-10  Paolo Carlini  <paolo.carlini@oracle.com> 
 //
-// Copyright (C) 2010 Free Software Foundation, Inc.
+// Copyright (C) 2010-2024 Free Software Foundation, Inc.
 //
 // This file is part of the GNU ISO C++ Library.  This library is free
 // software; you can redistribute it and/or modify it under the
@@ -37,8 +37,6 @@ namespace
 
 void test01()
 {
-  bool test __attribute__((unused)) = true;
-  
   typedef std::unordered_multiset<std::string> Mset;
   typedef Mset::iterator       iterator;
   typedef Mset::const_iterator const_iterator;
@@ -58,19 +56,19 @@ void test01()
   ms1.insert("because to why");
   VERIFY( ms1.size() == 11 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
 
   VERIFY( ms1.erase("eeilo") == 1 );
   VERIFY( ms1.size() == 10 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   iterator it1 = ms1.find("eeilo");
   VERIFY( it1 == ms1.end() );
 
   VERIFY( ms1.erase("tillsammans") == 1 );
   VERIFY( ms1.size() == 9 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   iterator it2 = ms1.find("tillsammans");
   VERIFY( it2 == ms1.end() );
 
@@ -80,14 +78,14 @@ void test01()
   VERIFY( ms1.erase(*it3) == 1 );
   VERIFY( ms1.size() == 8 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   it3 = ms1.find("belonging (no longer mix)");
   VERIFY( it3 == ms1.end() );
 
   VERIFY( !ms1.erase("abra") );
   VERIFY( ms1.size() == 8 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
 
   VERIFY( !ms1.erase("eeilo") );
   VERIFY( ms1.size() == 8 );
@@ -95,7 +93,7 @@ void test01()
   VERIFY( ms1.erase("because to why") == 2 );
   VERIFY( ms1.size() == 6 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   iterator it4 = ms1.find("because to why");
   VERIFY( it4 == ms1.end() );
 
@@ -112,14 +110,14 @@ void test01()
   VERIFY( ms1.erase(*it5) == 1 );
   VERIFY( ms1.size() == 5 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   it5 = ms1.find("umbra/penumbra");
   VERIFY( it5 == ms1.end() );
 
   VERIFY( ms1.erase(*it6) == 1 );
   VERIFY( ms1.size() == 4 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   it6 = ms1.find("one line behind");
   VERIFY( it6 == ms1.end() );
 
@@ -132,7 +130,7 @@ void test01()
   VERIFY( ms1.erase(*it8) == 1 );
   VERIFY( ms1.size() == 3 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   VERIFY( ++it7 == it9 );
 
   iterator it10 = it9;
@@ -141,20 +139,20 @@ void test01()
 
   VERIFY( ms1.erase(*it9) == 1 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   VERIFY( ms1.size() == 2 );
   VERIFY( ++it10 == ms1.end() );
 
   VERIFY( ms1.erase(ms1.begin()) != ms1.end() );  
   VERIFY( ms1.size() == 1 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   VERIFY( ms1.begin() == it11 );
 
   VERIFY( ms1.erase(*ms1.begin()) == 1 );  
   VERIFY( ms1.size() == 0 );
   VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
-  VERIFY( distance(ms1.begin(), ms1.end()) == ms1.size() );
+  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
   VERIFY( ms1.begin() == ms1.end() );
 }