libstdc++-v3/testsuite/23_containers/unordered_multiset/insert/multiset_range.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // Copyright (C) 2010-2018 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 3, 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 COPYING3.  If not see
  18 // <http://www.gnu.org/licenses/>.
  19
  20 // range insert
  21
  22 #include <string>
  23 #include <iterator>
  24 #include <algorithm>
  25 #include <unordered_set>
  26 #include <testsuite_hooks.h>
  27
  28 namespace
  29 {
  30   template <typename _Tp>
  31     std::size_t
  32     get_nb_bucket_elems(const std::unordered_multiset<_Tp>& us)
  33     {
  34       std::size_t nb = 0;
  35       for (std::size_t b = 0; b != us.bucket_count(); ++b)
  36         nb += us.bucket_size(b);
  37       return nb;
  38     }
  39 }
  40
  41 void test01()
  42 {
  43   typedef std::unordered_multiset<std::string> Set;
  44   Set s;
  45   VERIFY(s.empty());
  46
  47   const int N = 10;
  48   const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
  49                              "magenta", "yellow", "orange", "pink", "gray" };
  50
  51   s.insert(A + 0, A + N);
  52   VERIFY( s.size() == static_cast<unsigned int>(N) );
  53   VERIFY( std::distance(s.begin(), s.end()) - N == 0 );
  54   VERIFY( get_nb_bucket_elems(s) - N == 0 );
  55
  56   for (int i = 0; i < N; ++i)
  57     {
  58       std::string str = A[i];
  59       Set::iterator it = std::find(s.begin(), s.end(), str);
  60       VERIFY(it != s.end());
  61     }
  62 }
  63
  64 void test02()
  65 {
  66   typedef std::unordered_multiset<int> Set;
  67   Set s;
  68   VERIFY(s.empty());
  69
  70   const int N = 8;
  71   const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
  72
  73   s.insert(A+0, A+N);
  74   VERIFY( s.size() == static_cast<unsigned int>(N) );
  75   VERIFY( std::distance(s.begin(), s.end()) - N == 0 );
  76   VERIFY( get_nb_bucket_elems(s) - N == 0 );
  77
  78   VERIFY( std::count(s.begin(), s.end(), 2) == 1 );
  79   VERIFY( std::count(s.begin(), s.end(), 3) == 1 );
  80   VERIFY( std::count(s.begin(), s.end(), 4) == 2 );
  81   VERIFY( std::count(s.begin(), s.end(), 6) == 1 );
  82   VERIFY( std::count(s.begin(), s.end(), 7) == 2 );
  83   VERIFY( std::count(s.begin(), s.end(), 8) == 1 );
  84 }
  85
  86 int main()
  87 {
  88   test01();
  89   test02();
  90   return 0;
  91 }