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

   1 // { dg-do run { target c++11 } }
   2
   3 // 2010-10-27  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 // Array version of 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   using __gnu_test::rvalstruct;
  32
  33   typedef std::unordered_map<rvalstruct, rvalstruct> Map;
  34
  35   Map m;
  36   VERIFY( m.empty() );
  37
  38   m[rvalstruct(1)] = rvalstruct(17);
  39   VERIFY( m.size() == 1 );
  40   VERIFY( (m.begin()->first).val == 1 );
  41   VERIFY( (m.begin()->second).val == 17 );
  42   VERIFY( m[rvalstruct(1)].val == 17 );
  43
  44   m[rvalstruct(2)] = rvalstruct(9);
  45   VERIFY( m.size() == 2 );
  46   VERIFY( m[rvalstruct(2)].val == 9 );
  47
  48   m[rvalstruct(1)] = rvalstruct(5);
  49   VERIFY( m.size() == 2 );
  50   VERIFY( m[rvalstruct(1)].val == 5 );
  51   VERIFY( m[rvalstruct(2)].val == 9 );
  52 }
  53
  54 int main()
  55 {
  56   test01();
  57   return 0;
  58 }