1 // { dg-options "-std=gnu++0x" }
3 // Copyright (C) 2005, 2007 Free Software Foundation, Inc.
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)
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.
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,
21 // { dg-options "-std=gnu++0x -DITERATIONS=5" { target simulator } }
23 // 25.3.6 Heap operations [lib.alg.heap.operations]
25 #undef _GLIBCXX_CONCEPT_CHECKS
26 #define _GLIBCXX_TESTSUITE_ALLOW_RVALREF_ALIASING
29 #include <testsuite_hooks.h>
30 #include <testsuite_iterators.h>
31 #include <testsuite_rvalref.h>
37 using __gnu_test::test_container;
38 using __gnu_test::random_access_iterator_wrapper;
39 using __gnu_test::rvalstruct;
41 typedef test_container<rvalstruct, random_access_iterator_wrapper> container;
42 typedef test_container<int, random_access_iterator_wrapper> container_ref;
44 bool test __attribute__((unused)) = true;
47 check_make(int* array, int length)
49 rvalstruct makeheap[9];
51 std::copy(array, array + length, makeheap);
52 std::copy(array, array + length, makeheap_ref);
53 container makecon(makeheap, makeheap + length);
54 container_ref makecon_ref(makeheap_ref, makeheap_ref + length);
55 std::make_heap(makecon.begin(), makecon.end());
56 std::make_heap(makecon_ref.begin(), makecon_ref.end());
57 for (int z = 0; z < length; ++z)
58 VERIFY( makeheap[z] == makeheap_ref[z] );
59 VERIFY( std::__is_heap(makecon.begin(), makecon.end()) );
60 for (int z = 0; z < length; ++z)
61 VERIFY( makeheap[z].valid );
65 check_pop(int* array, int length)
67 rvalstruct popheap[9];
69 std::copy(array, array + length, popheap);
70 std::copy(array, array + length, popheap_ref);
71 container popcon(popheap, popheap + length);
72 container_ref popcon_ref(popheap_ref, popheap_ref + length);
73 std::pop_heap(popcon.begin(), popcon.end());
74 std::pop_heap(popcon_ref.begin(), popcon_ref.end());
75 for (int z = 0; z < length; ++z)
76 VERIFY( popheap[z] == popheap_ref[z] );
77 VERIFY( (std::__is_heap(popheap, popheap + length - 1)) );
78 for (int z = 0; z < length; ++z)
79 VERIFY( popheap[z].val <= popheap[length-1].val && popheap[z].valid );
83 check_sort(int* array, int length)
85 rvalstruct sortheap[9];
87 std::copy(array, array + length, sortheap);
88 std::copy(array, array + length, sortheap_ref);
89 container sortcon(sortheap, sortheap + length);
90 container_ref sortcon_ref(sortheap_ref, sortheap_ref + length);
91 std::sort_heap(sortcon.begin(), sortcon.end());
92 std::sort_heap(sortcon_ref.begin(), sortcon_ref.end());
93 for (int z = 0; z < length; ++z)
94 VERIFY( sortheap[z] == sortheap_ref[z] );
95 for (int z = 0; z < length - 1; ++z)
96 VERIFY( sortheap[z].val <= sortheap[z + 1].val && sortheap[z].valid );
97 VERIFY( sortheap[length - 1].valid );
101 check_push(int* array, int pushval, int length)
103 rvalstruct pushheap[10];
104 int pushheap_ref[10];
105 std::copy(array, array + length, pushheap);
106 std::copy(array, array + length, pushheap_ref);
107 pushheap[length] = pushval;
108 pushheap_ref[length] = pushval;
109 container pushcon(pushheap, pushheap + length + 1);
110 container_ref pushcon_ref(pushheap_ref, pushheap_ref + length + 1);
111 std::push_heap(pushcon.begin(), pushcon.end());
112 std::push_heap(pushcon_ref.begin(), pushcon_ref.end());
113 for (int z = 0; z < length + 1; ++z)
114 VERIFY( pushheap[z] == pushheap_ref[z] );
115 VERIFY( std::__is_heap(pushheap, pushheap + length + 1) );
116 for (int z = 0; z < length + 1; ++z)
117 VERIFY( pushheap[z].valid );
124 for (int i = 1; i < ITERATIONS; ++i)
126 for(int z = 0; z < i; ++z)
128 while (std::next_permutation(array, array + i))
130 check_make(array, i);
131 if (std::__is_heap(array, array + i))
134 check_sort(array, i);
135 for (int pushval = -1; pushval <= i; ++pushval)
136 check_push(array, pushval, i);