diff options
Diffstat (limited to 'libcxx/test/algorithms/alg.sorting/alg.heap.operations')
12 files changed, 32 insertions, 39 deletions
diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp index 776111437bb..0e7a19cb890 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires LessThanComparable<Iter::value_type> // bool // is_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp index a6719840900..631d7a8f616 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires LessThanComparable<Iter::value_type> // bool // is_heap(Iter first, Iter last); @@ -18,7 +18,6 @@ #include <functional> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp index 4807b1faf23..1908d70c4e7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until.pass.cpp @@ -17,7 +17,6 @@ #include <algorithm> #include <cassert> - void test() { int i1[] = {0, 0}; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp index 42d31913ea3..960d60eff7f 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/is_heap_until_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires CopyConstructible<Compare> // Iter // is_heap_until(Iter first, Iter last, Compare comp); diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp index 9a4b84fefcd..611583a15aa 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // make_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp index d8dbdfbda47..70b1b81549e 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/make_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // make_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -60,5 +60,5 @@ int main() assert(std::is_heap(ia, ia+N, indirect_less())); delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp index 849be36bb10..96e6a648e6f 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // pop_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp index 9c06650992a..cc093a54083 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/pop_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // pop_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -64,5 +64,5 @@ int main() } delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp index fe9876b8b47..5e845aa9d87 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap.pass.cpp @@ -9,16 +9,15 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // push_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp index e60f077a26a..87126298bf9 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/push_heap_comp.pass.cpp @@ -9,9 +9,9 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> -// && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> +// && LessThanComparable<Iter::value_type> // void // push_heap(Iter first, Iter last); @@ -28,7 +28,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -62,5 +62,5 @@ int main() } delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp index 2e91333754c..303c8b04685 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap.pass.cpp @@ -9,15 +9,14 @@ // <algorithm> -// template<RandomAccessIterator Iter> -// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> +// template<RandomAccessIterator Iter> +// requires ShuffleIterator<Iter> && LessThanComparable<Iter::value_type> // void // sort_heap(Iter first, Iter last); #include <algorithm> #include <cassert> - void test(unsigned N) { int* ia = new int [N]; diff --git a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp index 882a6247496..8cac3b6cdc7 100644 --- a/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp +++ b/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/sort_heap_comp.pass.cpp @@ -9,8 +9,8 @@ // <algorithm> -// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> -// requires ShuffleIterator<Iter> && CopyConstructible<Compare> +// template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> +// requires ShuffleIterator<Iter> && CopyConstructible<Compare> // void // sort_heap(Iter first, Iter last, Compare comp); @@ -27,7 +27,7 @@ struct indirect_less {return *x < *y;} }; -#endif +#endif // _LIBCPP_MOVE void test(unsigned N) { @@ -62,5 +62,5 @@ int main() assert(std::is_sorted(ia, ia+N, indirect_less())); delete [] ia; } -#endif +#endif // _LIBCPP_MOVE } |
