main/libstdc++-v3/testsuite/23_containers/unordered_multimap/erase/1.cc

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // 2010-02-10  Paolo Carlini  <paolo.carlini@oracle.com>
   4 //
   5 // Copyright (C) 2010-2013 Free Software Foundation, Inc.
   6 //
   7 // This file is part of the GNU ISO C++ Library.  This library is free
   8 // software; you can redistribute it and/or modify it under the
   9 // terms of the GNU General Public License as published by the
  10 // Free Software Foundation; either version 3, or (at your option)
  11 // any later version.
  12 //
  13 // This library is distributed in the hope that it will be useful,
  14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 // GNU General Public License for more details.
  17 //
  18 // You should have received a copy of the GNU General Public License along
  19 // with this library; see the file COPYING3.  If not see
  20 // <http://www.gnu.org/licenses/>.
  21
  22 #include <unordered_map>
  23 #include <string>
  24 #include <testsuite_hooks.h>
  25
  26 namespace
  27 {
  28   std::size_t
  29   get_nb_bucket_elems(const std::unordered_multimap<std::string, int>& us)
  30   {
  31     std::size_t nb = 0;
  32     for (std::size_t b = 0; b != us.bucket_count(); ++b)
  33       nb += us.bucket_size(b);
  34     return nb;
  35   }
  36 }
  37
  38 void test01()
  39 {
  40   bool test __attribute__((unused)) = true;
  41
  42   typedef std::unordered_multimap<std::string, int> Mmap;
  43   typedef Mmap::iterator       iterator;
  44   typedef Mmap::const_iterator const_iterator;
  45   typedef Mmap::value_type     value_type;
  46
  47   Mmap mm1;
  48
  49   mm1.insert(value_type("because to why", 1));
  50   mm1.insert(value_type("the stockholm syndrome", 2));
  51   mm1.insert(value_type("a cereous night", 3));
  52   mm1.insert(value_type("eeilo", 4));
  53   mm1.insert(value_type("protean", 5));
  54   mm1.insert(value_type("the way you are when", 6));
  55   mm1.insert(value_type("tillsammans", 7));
  56   mm1.insert(value_type("umbra/penumbra", 8));
  57   mm1.insert(value_type("belonging (no longer mix)", 9));
  58   mm1.insert(value_type("one line behind", 10));
  59   mm1.insert(value_type("because to why", 11));
  60   VERIFY( mm1.size() == 11 );
  61   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  62   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
  63
  64   VERIFY( mm1.erase("eeilo") == 1 );
  65   VERIFY( mm1.size() == 10 );
  66   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  67   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
  68   iterator it1 = mm1.find("eeilo");
  69   VERIFY( it1 == mm1.end() );
  70
  71   VERIFY( mm1.erase("tillsammans") == 1 );
  72   VERIFY( mm1.size() == 9 );
  73   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  74   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
  75   iterator it2 = mm1.find("tillsammans");
  76   VERIFY( it2 == mm1.end() );
  77
  78   // Must work (see DR 526)
  79   iterator it3 = mm1.find("belonging (no longer mix)");
  80   VERIFY( it3 != mm1.end() );
  81   VERIFY( mm1.erase(it3->first) == 1 );
  82   VERIFY( mm1.size() == 8 );
  83   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  84   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
  85   it3 = mm1.find("belonging (no longer mix)");
  86   VERIFY( it3 == mm1.end() );
  87
  88   VERIFY( !mm1.erase("abra") );
  89   VERIFY( mm1.size() == 8 );
  90   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  91   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
  92
  93   VERIFY( !mm1.erase("eeilo") );
  94   VERIFY( mm1.size() == 8 );
  95
  96   VERIFY( mm1.erase("because to why") == 2 );
  97   VERIFY( mm1.size() == 6 );
  98   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
  99   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 100   iterator it4 = mm1.find("because to why");
 101   VERIFY( it4 == mm1.end() );
 102
 103   iterator it5 = mm1.find("umbra/penumbra");
 104   iterator it6 = mm1.find("one line behind");
 105   VERIFY( it5 != mm1.end() );
 106   VERIFY( it6 != mm1.end() );
 107
 108   VERIFY( mm1.find("the stockholm syndrome") != mm1.end() );
 109   VERIFY( mm1.find("a cereous night") != mm1.end() );
 110   VERIFY( mm1.find("the way you are when") != mm1.end() );
 111   VERIFY( mm1.find("a cereous night") != mm1.end() );
 112
 113   VERIFY( mm1.erase(it5->first) == 1 );
 114   VERIFY( mm1.size() == 5 );
 115   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 116   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 117   it5 = mm1.find("umbra/penumbra");
 118   VERIFY( it5 == mm1.end() );
 119
 120   VERIFY( mm1.erase(it6->first) == 1 );
 121   VERIFY( mm1.size() == 4 );
 122   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 123   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 124   it6 = mm1.find("one line behind");
 125   VERIFY( it6 == mm1.end() );
 126
 127   iterator it7 = mm1.begin();
 128   iterator it8 = it7;
 129   ++it8;
 130   iterator it9 = it8;
 131   ++it9;
 132
 133   VERIFY( mm1.erase(it8->first) == 1 );
 134   VERIFY( mm1.size() == 3 );
 135   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 136   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 137   VERIFY( ++it7 == it9 );
 138
 139   iterator it10 = it9;
 140   ++it10;
 141   iterator it11 = it10;
 142
 143   VERIFY( mm1.erase(it9->first) == 1 );
 144   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 145   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 146   VERIFY( mm1.size() == 2 );
 147   VERIFY( ++it10 == mm1.end() );
 148
 149   VERIFY( mm1.erase(mm1.begin()) != mm1.end() );
 150   VERIFY( mm1.size() == 1 );
 151   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 152   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 153   VERIFY( mm1.begin() == it11 );
 154
 155   VERIFY( mm1.erase(mm1.begin()->first) == 1 );
 156   VERIFY( mm1.size() == 0 );
 157   VERIFY( get_nb_bucket_elems(mm1) == mm1.size() );
 158   VERIFY( distance(mm1.begin(), mm1.end()) - mm1.size() == 0 );
 159   VERIFY( mm1.begin() == mm1.end() );
 160 }
 161
 162 int main()
 163 {
 164   test01();
 165   return 0;
 166 }