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

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