old-autovect-branch/libstdc++-v3/testsuite/tr1/6_containers/unordered/insert/set_range.cc

   1 // { dg-do run }
   2
   3 // 2005-2-17  Matt Austern  <austern@apple.com>
   4 //
   5 // Copyright (C) 2005 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 2, 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 COPYING.  If not, write to the Free
  20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  21 // USA.
  22
  23 // 6.3.4.3 unordered_set
  24 // range insert
  25
  26 #include <string>
  27 #include <iterator>
  28 #include <algorithm>
  29 #include <tr1/unordered_set>
  30 #include "testsuite_hooks.h"
  31
  32 bool test __attribute__((unused)) = true;
  33
  34 void test01()
  35 {
  36   typedef std::tr1::unordered_set<std::string> Set;
  37   Set s;
  38   VERIFY(s.empty());
  39
  40   const int N = 10;
  41   const std::string A[N] = { "red", "green", "blue", "violet", "cyan",
  42                              "magenta", "yellow", "orange", "pink", "gray" };
  43
  44   s.insert(A+0, A+N);
  45   VERIFY(s.size() == N);
  46   VERIFY(std::distance(s.begin(), s.end()) == N);
  47
  48   for (int i = 0; i < N; ++i) {
  49     std::string str = A[i];
  50     Set::iterator it = std::find(s.begin(), s.end(), str);
  51     VERIFY(it != s.end());
  52   }
  53 }
  54
  55 void test02()
  56 {
  57   typedef std::tr1::unordered_set<int> Set;
  58   Set s;
  59   VERIFY(s.empty());
  60
  61   const int N = 8;
  62   const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 };
  63
  64   s.insert(A+0, A+N);
  65   VERIFY(s.size() == 6);
  66   VERIFY(std::distance(s.begin(), s.end()) == 6);
  67
  68   VERIFY(std::count(s.begin(), s.end(), 2) == 1);
  69   VERIFY(std::count(s.begin(), s.end(), 3) == 1);
  70   VERIFY(std::count(s.begin(), s.end(), 4) == 1);
  71   VERIFY(std::count(s.begin(), s.end(), 6) == 1);
  72   VERIFY(std::count(s.begin(), s.end(), 7) == 1);
  73   VERIFY(std::count(s.begin(), s.end(), 8) == 1);
  74 }
  75
  76 int main()
  77 {
  78   test01();
  79   test02();
  80   return 0;
  81 }