libstdc++-v3/testsuite/tr1/6_containers/unordered_set/erase/1.cc

   1 // 2007-02-22  Paolo Carlini  <pcarlini@suse.de>
   2 //
   3 // Copyright (C) 2007 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10 //
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15 //
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  19 // USA.
  20
  21 // 6.3.4.3  Class template unordered_set
  22
  23 #include <tr1/unordered_set>
  24 #include <string>
  25 #include <testsuite_hooks.h>
  26
  27 // In the occasion of libstdc++/25896
  28 void test01()
  29 {
  30   bool test __attribute__((unused)) = true;
  31
  32   typedef std::tr1::unordered_set<std::string> Set;
  33   typedef Set::iterator       iterator;
  34   typedef Set::const_iterator const_iterator;
  35
  36   Set s1;
  37
  38   s1.insert("because to why");
  39   s1.insert("the stockholm syndrome");
  40   s1.insert("a cereous night");
  41   s1.insert("eeilo");
  42   s1.insert("protean");
  43   s1.insert("the way you are when");
  44   s1.insert("tillsammans");
  45   s1.insert("umbra/penumbra");
  46   s1.insert("belonging (no longer mix)");
  47   s1.insert("one line behind");
  48   VERIFY( s1.size() == 10 );
  49
  50   VERIFY( s1.erase("eeilo") == 1 );
  51   VERIFY( s1.size() == 9 );
  52   iterator it1 = s1.find("eeilo");
  53   VERIFY( it1 == s1.end() );
  54
  55   VERIFY( s1.erase("tillsammans") == 1 );
  56   VERIFY( s1.size() == 8 );
  57   iterator it2 = s1.find("tillsammans");
  58   VERIFY( it2 == s1.end() );
  59
  60   // Must work (see DR 526)
  61   iterator it3 = s1.find("belonging (no longer mix)");
  62   VERIFY( it3 != s1.end() );
  63   VERIFY( s1.erase(*it3) == 1 );
  64   VERIFY( s1.size() == 7 );
  65   it3 = s1.find("belonging (no longer mix)");
  66   VERIFY( it3 == s1.end() );
  67
  68   VERIFY( !s1.erase("abra") );
  69   VERIFY( s1.size() == 7 );
  70
  71   VERIFY( !s1.erase("eeilo") );
  72   VERIFY( s1.size() == 7 );
  73
  74   VERIFY( s1.erase("because to why") == 1 );
  75   VERIFY( s1.size() == 6 );
  76   iterator it4 = s1.find("because to why");
  77   VERIFY( it4 == s1.end() );
  78
  79   iterator it5 = s1.find("umbra/penumbra");
  80   iterator it6 = s1.find("one line behind");
  81   VERIFY( it5 != s1.end() );
  82   VERIFY( it6 != s1.end() );
  83
  84   VERIFY( s1.find("the stockholm syndrome") != s1.end() );
  85   VERIFY( s1.find("a cereous night") != s1.end() );
  86   VERIFY( s1.find("the way you are when") != s1.end() );
  87   VERIFY( s1.find("a cereous night") != s1.end() );
  88
  89   VERIFY( s1.erase(*it5) == 1 );
  90   VERIFY( s1.size() == 5 );
  91   it5 = s1.find("umbra/penumbra");
  92   VERIFY( it5 == s1.end() );
  93
  94   VERIFY( s1.erase(*it6) == 1 );
  95   VERIFY( s1.size() == 4 );
  96   it6 = s1.find("one line behind");
  97   VERIFY( it6 == s1.end() );
  98
  99   iterator it7 = s1.begin();
 100   iterator it8 = it7;
 101   ++it8;
 102   iterator it9 = it8;
 103   ++it9;
 104
 105   VERIFY( s1.erase(*it8) == 1 );
 106   VERIFY( s1.size() == 3 );
 107   VERIFY( ++it7 == it9 );
 108
 109   iterator it10 = it9;
 110   ++it10;
 111   iterator it11 = it10;
 112
 113   VERIFY( s1.erase(*it9) == 1 );
 114   VERIFY( s1.size() == 2 );
 115   VERIFY( ++it10 == s1.end() );
 116
 117   VERIFY( s1.erase(s1.begin()) != s1.end() );
 118   VERIFY( s1.size() == 1 );
 119   VERIFY( s1.begin() == it11 );
 120
 121   VERIFY( s1.erase(*s1.begin()) == 1 );
 122   VERIFY( s1.size() == 0 );
 123   VERIFY( s1.begin() == s1.end() );
 124 }
 125
 126 int main()
 127 {
 128   test01();
 129   return 0;
 130 }