libstdc++-v3/testsuite/23_containers/unordered_set/insert/set_range.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // Copyright (C) 2010-2017 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 void test01()
  29 {
  30   typedef std::unordered_set<std::string> Set;
  31   Set s;
  32   VERIFY(s.empty());
  33
  34   const int N = 10;
  35   const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
  36                              "magenta", "yellow", "orange", "pink", "gray" };
  37
  38   s.insert(A+0, A+N);
  39   VERIFY(s.size() == static_cast<unsigned int>(N));
  40   VERIFY(std::distance(s.begin(), s.end()) == N);
  41
  42   for (int i = 0; i < N; ++i) {
  43     std::string str = A[i];
  44     Set::iterator it = std::find(s.begin(), s.end(), str);
  45     VERIFY(it != s.end());
  46   }
  47 }
  48
  49 void test02()
  50 {
  51   typedef std::unordered_set<int> Set;
  52   Set s;
  53   VERIFY(s.empty());
  54
  55   const int N = 8;
  56   const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
  57
  58   s.insert(A+0, A+N);
  59   VERIFY(s.size() == 6);
  60   VERIFY(std::distance(s.begin(), s.end()) == 6);
  61
  62   VERIFY(std::count(s.begin(), s.end(), 2) == 1);
  63   VERIFY(std::count(s.begin(), s.end(), 3) == 1);
  64   VERIFY(std::count(s.begin(), s.end(), 4) == 1);
  65   VERIFY(std::count(s.begin(), s.end(), 6) == 1);
  66   VERIFY(std::count(s.begin(), s.end(), 7) == 1);
  67   VERIFY(std::count(s.begin(), s.end(), 8) == 1);
  68 }
  69
  70 int main()
  71 {
  72   test01();
  73   test02();
  74   return 0;
  75 }