1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
12 // template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare>
13 // requires ShuffleIterator<Iter> && CopyConstructible<Compare>
15 // make_heap(Iter first, Iter last, Compare comp);
21 #include "counting_predicates.hpp"
23 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
29 bool operator()(const P& x, const P& y)
33 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
37 int* ia = new int [N];
39 for (int i = 0; i < N; ++i)
41 std::random_shuffle(ia, ia+N);
42 std::make_heap(ia, ia+N, std::greater<int>());
43 assert(std::is_heap(ia, ia+N, std::greater<int>()));
48 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>()));
49 for (int i = 0; i < N; ++i)
51 std::make_heap(ia, ia+N, std::ref(pred));
52 assert(pred.count() <= 3*N);
53 assert(std::is_heap(ia, ia+N, pred));
58 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>()));
59 for (int i = 0; i < N; ++i)
61 std::make_heap(ia, ia+N, std::ref(pred));
62 assert(pred.count() <= 3*N);
63 assert(std::is_heap(ia, ia+N, pred));
68 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>()));
69 std::random_shuffle(ia, ia+N);
70 std::make_heap(ia, ia+N, std::ref(pred));
71 assert(pred.count() <= 3*N);
72 assert(std::is_heap(ia, ia+N, pred));
89 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
92 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N];
93 for (int i = 0; i < N; ++i)
94 ia[i].reset(new int(i));
95 std::random_shuffle(ia, ia+N);
96 std::make_heap(ia, ia+N, indirect_less());
97 assert(std::is_heap(ia, ia+N, indirect_less()));
100 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES