libstdc++-v3/testsuite/23_containers/set/allocator/move_assign.cc

   1 // Copyright (C) 2013-2024 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 3, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING3.  If not see
  16 // <http://www.gnu.org/licenses/>.
  17
  18 // { dg-do run { target c++11 } }
  19 // { dg-require-cstdint "" }
  20
  21 #include <set>
  22 #include <random>
  23
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_allocator.h>
  26
  27 struct T { int i; };
  28
  29 bool operator<(T l, T r) { return l.i < r.i; }
  30
  31 using Cmp = std::less<T>;
  32
  33 using __gnu_test::propagating_allocator;
  34
  35 void test01()
  36 {
  37   typedef propagating_allocator<T, false> alloc_type;
  38   typedef std::set<T, Cmp, alloc_type> test_type;
  39   test_type v1(alloc_type(1));
  40   v1 = { test_type::value_type{} };
  41   test_type v2(alloc_type(2));
  42   v2 = { test_type::value_type{} };
  43   v2 = std::move(v1);
  44   VERIFY(1 == v1.get_allocator().get_personality());
  45   VERIFY(2 == v2.get_allocator().get_personality());
  46 }
  47
  48 void test02()
  49 {
  50   typedef propagating_allocator<T, true> alloc_type;
  51   typedef std::set<T, Cmp, alloc_type> test_type;
  52   test_type v1(alloc_type(1));
  53   v1 = { test_type::value_type{} };
  54   auto it = v1.begin();
  55   test_type v2(alloc_type(2));
  56   v2 = { test_type::value_type{} };
  57   v2 = std::move(v1);
  58   VERIFY(1 == v1.get_allocator().get_personality());
  59   VERIFY(1 == v2.get_allocator().get_personality());
  60   VERIFY( it == v2.begin() );
  61 }
  62
  63 void test03()
  64 {
  65   using namespace __gnu_test;
  66
  67   typedef propagating_allocator<int, false, tracker_allocator<int>> alloc_type;
  68   typedef std::set<int, std::less<int>, alloc_type> test_type;
  69
  70   tracker_allocator_counter::reset();
  71
  72   test_type v1(alloc_type(1));
  73   v1 = { 0, 1 };
  74
  75   test_type v2(alloc_type(2));
  76   v2 = { 2, 3 };
  77
  78   auto allocs = tracker_allocator_counter::get_allocation_count();
  79   auto constructs = tracker_allocator_counter::get_construct_count();
  80
  81   // Check no allocation on move assignment with non propagating allocators.
  82   v1 = std::move(v2);
  83
  84   VERIFY( 1 == v1.get_allocator().get_personality() );
  85   VERIFY( 2 == v2.get_allocator().get_personality() );
  86
  87   VERIFY( tracker_allocator_counter::get_allocation_count() == allocs );
  88   VERIFY( tracker_allocator_counter::get_construct_count() == constructs + 2 );
  89 }
  90
  91 void test04()
  92 {
  93   using namespace __gnu_test;
  94
  95   typedef tracker_allocator<int> alloc_type;
  96   typedef std::set<int, std::less<int>, alloc_type> test_type;
  97
  98   std::mt19937 rng;
  99   std::uniform_int_distribution<int> d;
 100   std::uniform_int_distribution<int>::param_type p{0, 100};
 101   std::uniform_int_distribution<int>::param_type x{0, 1000};
 102
 103   for (int i = 0; i < 10; ++i)
 104   {
 105     test_type l, r;
 106     for (int n = d(rng, p); n > 0; --n)
 107     {
 108       int i = d(rng, x);
 109       l.insert(i);
 110       r.insert(i);
 111
 112       tracker_allocator_counter::reset();
 113
 114       l = r;
 115
 116       VERIFY( tracker_allocator_counter::get_allocation_count() == 0 );
 117     }
 118   }
 119 }
 120
 121 int main()
 122 {
 123   test01();
 124   test02();
 125   test03();
 126   test04();
 127   return 0;
 128 }