libstdc++-v3/testsuite/23_containers/multimap/modifiers/insert/3.cc

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // 2010-11-10  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 #include <iterator>
  23 #include <map>
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_rvalref.h>
  26
  27 void test01()
  28 {
  29   bool test __attribute__((unused)) = true;
  30   using __gnu_test::rvalstruct;
  31
  32   typedef std::multimap<int, rvalstruct> Map;
  33   typedef std::pair<const int, rvalstruct> Pair;
  34
  35   Map m;
  36   VERIFY( m.empty() );
  37
  38   Map::iterator i = m.insert(m.begin(), Pair(1, rvalstruct(3)));
  39   VERIFY( m.size() == 1 );
  40   VERIFY( std::distance(m.begin(), m.end()) == 1 );
  41   VERIFY( i == m.begin() );
  42   VERIFY( i->first == 1 );
  43   VERIFY( (i->second).val == 3 );
  44 }
  45
  46 void test02()
  47 {
  48   bool test __attribute__((unused)) = true;
  49   using __gnu_test::rvalstruct;
  50
  51   typedef std::multimap<int, rvalstruct> Map;
  52   typedef std::pair<const int, rvalstruct> Pair;
  53
  54   Map m;
  55   VERIFY( m.empty() );
  56
  57   Map::iterator i0 = m.insert(m.begin(), Pair(2, rvalstruct(3)));
  58   m.insert(i0, Pair(2, rvalstruct(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 == 2 );
  68   VERIFY( i2->first == 2 );
  69   VERIFY( (i1->second).val == 7 && (i2->second).val == 3 );
  70 }
  71
  72 int main()
  73 {
  74   test01();
  75   test02();
  76   return 0;
  77 }