libstdc++-v3/testsuite/23_containers/map/modifiers/insert/2.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // 2010-11-10  Paolo Carlini  <paolo.carlini@oracle.com>
   4 //
   5 // Copyright (C) 2010-2023 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 #include <iterator>
  23 #include <map>
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_rvalref.h>
  26
  27 void test01()
  28 {
  29   using __gnu_test::rvalstruct;
  30
  31   typedef std::map<int, rvalstruct> Map;
  32   typedef std::pair<const int, rvalstruct> Pair;
  33
  34   Map m;
  35   VERIFY( m.empty());
  36
  37   std::pair<Map::iterator, bool> p = m.insert(Pair(1, rvalstruct(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 == 1 );
  43   VERIFY( (p.first->second).val == 3 );
  44 }
  45
  46 void test02()
  47 {
  48   using __gnu_test::rvalstruct;
  49
  50   typedef std::map<int, rvalstruct> Map;
  51   typedef std::pair<const int, rvalstruct> Pair;
  52
  53   Map m;
  54   VERIFY( m.empty() );
  55
  56   std::pair<Map::iterator, bool> p1 = m.insert(Pair(2, rvalstruct(3)));
  57   std::pair<Map::iterator, bool> p2 = m.insert(Pair(2, rvalstruct(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 == 2 );
  64   VERIFY( (p2.first->second).val == 3 );
  65 }
  66
  67 int main()
  68 {
  69   test01();
  70   test02();
  71   return 0;
  72 }