libstdc++-v3/testsuite/23_containers/unordered_map/insert/map_single.cc

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // Copyright (C) 2010-2013 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 // Single-element insert
  21
  22 #include <string>
  23 #include <iterator>
  24 #include <unordered_map>
  25 #include <testsuite_hooks.h>
  26
  27 void test01()
  28 {
  29   bool test __attribute__((unused)) = true;
  30
  31   typedef std::unordered_map<std::string, int> Map;
  32   typedef std::pair<const std::string, int> Pair;
  33
  34   Map m;
  35   VERIFY(m.empty());
  36
  37   std::pair<Map::iterator, bool> p = m.insert(Pair("abcde", 3));
  38   VERIFY(p.second);
  39   VERIFY(m.size() == 1);
  40   VERIFY(std::distance(m.begin(), m.end()) == 1);
  41   VERIFY(p.first == m.begin());
  42   VERIFY(p.first->first == "abcde");
  43   VERIFY(p.first->second == 3);
  44 }
  45
  46 void test02()
  47 {
  48   bool test __attribute__((unused)) = true;
  49
  50   typedef std::unordered_map<std::string, int> Map;
  51   typedef std::pair<const std::string, int> Pair;
  52
  53   Map m;
  54   VERIFY(m.empty());
  55
  56   std::pair<Map::iterator, bool> p1 = m.insert(Pair("abcde", 3));
  57   std::pair<Map::iterator, bool> p2 = m.insert(Pair("abcde", 7));
  58
  59   VERIFY(p1.second);
  60   VERIFY(!p2.second);
  61   VERIFY(m.size() == 1);
  62   VERIFY(p1.first == p2.first);
  63   VERIFY(p1.first->first == "abcde");
  64   VERIFY(p2.first->second == 3);
  65 }
  66
  67 int main()
  68 {
  69   test01();
  70   test02();
  71   return 0;
  72 }