libstdc++-v3/testsuite/tr1/6_containers/unordered/insert/multimap_single.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.6 unordered_multimap
  24 // Single-element insert
  25
  26 #include <string>
  27 #include <iterator>
  28 #include <tr1/unordered_map>
  29 #include "testsuite_hooks.h"
  30
  31 bool test __attribute__((unused)) = true;
  32
  33 void test01()
  34 {
  35   typedef std::tr1::unordered_multimap<std::string, int> Map;
  36   typedef std::pair<const std::string, int> Pair;
  37
  38   Map m;
  39   VERIFY(m.empty());
  40
  41   Map::iterator i = m.insert(Pair("abcde", 3));
  42   VERIFY(m.size() == 1);
  43   VERIFY(std::distance(m.begin(), m.end()) == 1);
  44   VERIFY(i == m.begin());
  45   VERIFY(i->first == "abcde");
  46   VERIFY(i->second == 3);
  47 }
  48
  49 void test02()
  50 {
  51   typedef std::tr1::unordered_multimap<std::string, int> Map;
  52   typedef std::pair<const std::string, int> Pair;
  53
  54   Map m;
  55   VERIFY(m.empty());
  56
  57   m.insert(Pair("abcde", 3));
  58   m.insert(Pair("abcde", 7));
  59
  60   VERIFY(m.size() == 2);
  61   VERIFY(std::distance(m.begin(), m.end()) == 2);
  62
  63   Map::iterator i1 = m.begin();
  64   Map::iterator i2 = i1;
  65   ++i2;
  66
  67   VERIFY(i1->first == "abcde");
  68   VERIFY(i2->first == "abcde");
  69   VERIFY((i1->second == 3 && i2->second == 7) ||
  70          (i1->second == 7 && i2->second == 3));
  71 }
  72
  73 int main()
  74 {
  75   test01();
  76   test02();
  77   return 0;
  78 }