libstdc++-v3/testsuite/23_containers/unordered_multimap/insert/multimap_range.cc

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // Copyright (C) 2010 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_map>
  26 #include <testsuite_hooks.h>
  27
  28 void test01()
  29 {
  30   bool test __attribute__((unused)) = true;
  31
  32   typedef std::unordered_multimap<std::string, int> Map;
  33   typedef std::pair<const std::string, int> Pair;
  34
  35   Map m;
  36   VERIFY(m.empty());
  37
  38   Pair A[5] =
  39     {
  40       Pair("red", 5),
  41       Pair("green", 9),
  42       Pair("blue", 3),
  43       Pair("cyan", 8),
  44       Pair("magenta", 7)
  45     };
  46
  47   m.insert(A+0, A+5);
  48   VERIFY(m.size() == 5);
  49   VERIFY(std::distance(m.begin(), m.end()) == 5);
  50
  51   for (int i = 0; i < 5; ++i)
  52     VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end());
  53 }
  54
  55 void test02()
  56 {
  57   bool test __attribute__((unused)) = true;
  58
  59   typedef std::unordered_multimap<std::string, int> Map;
  60   typedef std::pair<const std::string, int> Pair;
  61
  62   Map m;
  63   VERIFY(m.empty());
  64
  65   Pair A[9] =
  66     {
  67       Pair("red", 5),
  68       Pair("green", 9),
  69       Pair("red", 19),
  70       Pair("blue", 3),
  71       Pair("blue", 60),
  72       Pair("cyan", 8),
  73       Pair("magenta", 7),
  74       Pair("blue", 99),
  75       Pair("green", 33)
  76     };
  77
  78   m.insert(A+0, A+9);
  79   VERIFY(m.size() == 9);
  80   VERIFY(std::distance(m.begin(), m.end()) == 9);
  81
  82   for (int i = 0; i < 9; ++i)
  83     VERIFY(std::find(m.begin(), m.end(), A[i]) != m.end());
  84 }
  85
  86 int main()
  87 {
  88   test01();
  89   test02();
  90   return 0;
  91 }