libstdc++-v3/testsuite/25_algorithms/heap/moveable.cc

   1 // { dg-options "-std=gnu++0x" }
   2
   3 // Copyright (C) 2005, 2007 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without Pred the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING.  If not, write to the Free
  18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  19 // USA.
  20
  21 // 25.3.6 Heap operations [lib.alg.heap.operations]
  22
  23 #undef _GLIBCXX_CONCEPT_CHECKS
  24 #define  _GLIBCXX_TESTSUITE_ALLOW_RVALREF_ALIASING
  25
  26 #include <algorithm>
  27 #include <testsuite_hooks.h>
  28 #include <testsuite_iterators.h>
  29 #include <testsuite_rvalref.h>
  30
  31 using __gnu_test::test_container;
  32 using __gnu_test::random_access_iterator_wrapper;
  33 using __gnu_test::rvalstruct;
  34
  35 typedef test_container<rvalstruct, random_access_iterator_wrapper> container;
  36 typedef test_container<int, random_access_iterator_wrapper> container_ref;
  37
  38 bool test __attribute__((unused)) = true;
  39
  40 void
  41 check_make(int* array, int length)
  42 {
  43   rvalstruct makeheap[9];
  44   int        makeheap_ref[9];
  45   std::copy(array, array + length, makeheap);
  46   std::copy(array, array + length, makeheap_ref);
  47   container makecon(makeheap, makeheap + length);
  48   container_ref makecon_ref(makeheap_ref, makeheap_ref + length);
  49   std::make_heap(makecon.begin(), makecon.end());
  50   std::make_heap(makecon_ref.begin(), makecon_ref.end());
  51   for (int z = 0; z < length; ++z)
  52     VERIFY( makeheap[z] == makeheap_ref[z] );
  53   VERIFY( std::__is_heap(makecon.begin(), makecon.end()) );
  54   for (int z = 0; z < length; ++z)
  55     VERIFY( makeheap[z].valid );
  56 }
  57
  58 void
  59 check_pop(int* array, int length)
  60 {
  61   rvalstruct popheap[9];
  62   int        popheap_ref[9];
  63   std::copy(array, array + length, popheap);
  64   std::copy(array, array + length, popheap_ref);
  65   container popcon(popheap, popheap + length);
  66   container_ref popcon_ref(popheap_ref, popheap_ref + length);
  67   std::pop_heap(popcon.begin(), popcon.end());
  68   std::pop_heap(popcon_ref.begin(), popcon_ref.end());
  69   for (int z = 0; z < length; ++z)
  70     VERIFY( popheap[z] == popheap_ref[z] );
  71   VERIFY( (std::__is_heap(popheap, popheap + length - 1)) );
  72   for (int z = 0; z < length; ++z)
  73     VERIFY( popheap[z].val <= popheap[length-1].val && popheap[z].valid );
  74 }
  75
  76 void
  77 check_sort(int* array, int length)
  78 {
  79   rvalstruct sortheap[9];
  80   int        sortheap_ref[9];
  81   std::copy(array, array + length, sortheap);
  82   std::copy(array, array + length, sortheap_ref);
  83   container sortcon(sortheap, sortheap + length);
  84   container_ref sortcon_ref(sortheap_ref, sortheap_ref + length);
  85   std::sort_heap(sortcon.begin(), sortcon.end());
  86   std::sort_heap(sortcon_ref.begin(), sortcon_ref.end());
  87   for (int z = 0; z < length; ++z)
  88     VERIFY( sortheap[z] == sortheap_ref[z] );
  89   for (int z = 0; z < length - 1; ++z)
  90     VERIFY( sortheap[z].val <= sortheap[z + 1].val && sortheap[z].valid );
  91   VERIFY( sortheap[length - 1].valid );
  92 }
  93
  94 void
  95 check_push(int* array, int pushval, int length)
  96 {
  97   rvalstruct pushheap[10];
  98   int        pushheap_ref[10];
  99   std::copy(array, array + length, pushheap);
 100   std::copy(array, array + length, pushheap_ref);
 101   pushheap[length] = pushval;
 102   pushheap_ref[length] = pushval;
 103   container pushcon(pushheap, pushheap + length + 1);
 104   container_ref pushcon_ref(pushheap_ref, pushheap_ref + length + 1);
 105   std::push_heap(pushcon.begin(), pushcon.end());
 106   std::push_heap(pushcon_ref.begin(), pushcon_ref.end());
 107   for (int z = 0; z < length + 1; ++z)
 108     VERIFY( pushheap[z] == pushheap_ref[z] );
 109   VERIFY( std::__is_heap(pushheap, pushheap + length + 1) );
 110   for (int z = 0; z < length + 1; ++z)
 111     VERIFY( pushheap[z].valid );
 112 }
 113
 114 void
 115 test01()
 116 {
 117   int array[9];
 118   for (int i = 1; i < 9; ++i)
 119     {
 120       for(int z = 0; z < i; ++z)
 121         array[z] = z;
 122       while (std::next_permutation(array, array + i))
 123         {
 124           check_make(array, i);
 125           if (std::__is_heap(array, array + i))
 126             {
 127               check_pop(array, i);
 128               check_sort(array, i);
 129               for (int pushval = -1; pushval <= i; ++pushval)
 130                 check_push(array, pushval, i);
 131             }
 132         }
 133     }
 134 }
 135
 136 int
 137 main()
 138 {
 139   test01();
 140   return 0;
 141 }