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

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // 2010-10-27  Paolo Carlini  <paolo.carlini@oracle.com>
   4 //
   5 // Copyright (C) 2010-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 // Single-element insert
  23
  24 #include <iterator>
  25 #include <unordered_map>
  26 #include <testsuite_hooks.h>
  27 #include <testsuite_rvalref.h>
  28
  29 void test01()
  30 {
  31   bool test __attribute__((unused)) = true;
  32   using __gnu_test::rvalstruct;
  33
  34   typedef std::unordered_map<int, rvalstruct> Map;
  35   typedef std::pair<const int, rvalstruct> Pair;
  36
  37   Map m;
  38   VERIFY( m.empty());
  39
  40   std::pair<Map::iterator, bool> p = m.insert(Pair(1, rvalstruct(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 == 1 );
  46   VERIFY( (p.first->second).val == 3 );
  47 }
  48
  49 void test02()
  50 {
  51   bool test __attribute__((unused)) = true;
  52   using __gnu_test::rvalstruct;
  53
  54   typedef std::unordered_map<int, rvalstruct> Map;
  55   typedef std::pair<const int, rvalstruct> Pair;
  56
  57   Map m;
  58   VERIFY( m.empty() );
  59
  60   std::pair<Map::iterator, bool> p1 = m.insert(Pair(2, rvalstruct(3)));
  61   std::pair<Map::iterator, bool> p2 = m.insert(Pair(2, rvalstruct(7)));
  62
  63   VERIFY( p1.second );
  64   VERIFY( !p2.second );
  65   VERIFY( m.size() == 1 );
  66   VERIFY( p1.first == p2.first );
  67   VERIFY( p1.first->first == 2 );
  68   VERIFY( (p2.first->second).val == 3 );
  69 }
  70
  71 int main()
  72 {
  73   test01();
  74   test02();
  75   return 0;
  76 }