| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| D | is_heap.pass.cpp | 26 return std::is_heap(std::begin(ia), std::end(ia)) in test_constexpr()
27 && !std::is_heap(std::begin(ib), std::end(ib)); in test_constexpr()
35 assert(std::is_heap(i1, i1)); in test()
36 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1)); in test()
37 assert(std::is_heap(RI(i1), RI(i1))); in test()
38 assert(std::is_heap(RI(i1), RI(i1+1)) == (std::is_heap_until(RI(i1), RI(i1+1)) == RI(i1+1))); in test()
42 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2)); in test()
43 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2)); in test()
44 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2)); in test()
52 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3)); in test()
[all …]
|
| D | is_heap_comp.pass.cpp | 27 return std::is_heap(std::begin(ia), std::end(ia), std::greater<int>()) in test_constexpr()
28 && !std::is_heap(std::begin(ib), std::end(ib), std::greater<int>()); in test_constexpr()
36 assert(std::is_heap(i1, i1, std::greater<int>())); in test()
37 …assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<i… in test()
38 assert(std::is_heap(RI(i1), RI(i1), std::greater<int>())); in test()
39 …assert(std::is_heap(RI(i1), RI(i1+1), std::greater<int>()) == (std::is_heap_until(RI(i1), RI(i1+1)… in test()
43 …assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<i… in test()
44 …assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<i… in test()
45 …assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<i… in test()
53 …assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<i… in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| D | is_heap.pass.cpp | 26 return std::is_heap(std::begin(ia), std::end(ia)) in test_constexpr()
27 && !std::is_heap(std::begin(ib), std::end(ib)); in test_constexpr()
34 assert(std::is_heap(i1, i1)); in test()
35 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1)); in test()
38 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2)); in test()
39 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2)); in test()
40 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2)); in test()
48 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3)); in test()
49 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3)); in test()
50 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3)); in test()
[all …]
|
| D | is_heap_comp.pass.cpp | 27 return std::is_heap(std::begin(ia), std::end(ia), std::greater<int>()) in test_constexpr()
28 && !std::is_heap(std::begin(ib), std::end(ib), std::greater<int>()); in test_constexpr()
35 assert(std::is_heap(i1, i1, std::greater<int>())); in test()
36 …assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<i… in test()
39 …assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<i… in test()
40 …assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<i… in test()
41 …assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<i… in test()
49 …assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<i… in test()
50 …assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<i… in test()
51 …assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<i… in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| D | make_heap_comp.pass.cpp | 43 assert(std::is_heap(ia, ia+N, std::greater<int>())); in test()
48 assert(std::is_heap(ia, ia+N, std::greater<int>())); in test()
58 assert(std::is_heap(ia, ia+N, pred)); in test()
68 assert(std::is_heap(ia, ia+N, pred)); in test()
77 assert(std::is_heap(ia, ia+N, pred)); in test()
102 assert(std::is_heap(ia, ia+N, indirect_less())); in main()
|
| D | make_heap.pass.cpp | 32 assert(std::is_heap(ia, ia+N)); in test()
37 assert(std::is_heap(RI(ia), RI(ia+N))); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| D | make_heap_comp.pass.cpp | 43 assert(std::is_heap(ia, ia+N, std::greater<int>())); in test()
53 assert(std::is_heap(ia, ia+N, pred)); in test()
63 assert(std::is_heap(ia, ia+N, pred)); in test()
72 assert(std::is_heap(ia, ia+N, pred)); in test()
97 assert(std::is_heap(ia, ia+N, indirect_less())); in main()
|
| D | make_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+N)); in test()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.heap.operations/ |
| D | is_heap.pass.cpp | 59 bool expected = is_heap(first, last); in operator ()()
60 bool actual = is_heap(exec, first, last); in operator ()()
65 bool expected = is_heap(first, last, pred); in operator ()()
66 bool actual = is_heap(exec, first, last, pred); in operator ()()
129 is_heap(exec, iter, iter, non_const(std::less<T>())); in operator ()()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| D | push_heap_comp.pass.cpp | 44 assert(std::is_heap(ia, ia+i, std::greater<int>())); in test()
52 assert(std::is_heap(RI(ia), RI(ia+i), std::greater<int>())); in test()
72 assert(std::is_heap(ia, ia+i, indirect_less())); in main()
|
| D | push_heap.pass.cpp | 35 assert(std::is_heap(ia, ia+i)); in test()
43 assert(std::is_heap(RI(ia), RI(ia+i))); in test()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 45 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); in test()
55 assert(std::is_heap(RI(ia), RI(ia+i-1), std::greater<int>())); in test()
77 assert(std::is_heap(ia, ia+i-1, indirect_less())); in main()
|
| D | pop_heap.pass.cpp | 35 assert(std::is_heap(ia, ia+i-1)); in test()
46 assert(std::is_heap(RI(ia), RI(ia+i-1))); in test()
|
| /external/llvm-project/libcxx/test/libcxx/fuzzing/ |
| D | push_heap.pass.cpp | 26 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
33 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
|
| D | make_heap.pass.cpp | 22 if (!std::is_heap(working.begin(), working.end())) in LLVMFuzzerTestOneInput()
|
| D | pop_heap.pass.cpp | 28 if (!std::is_heap(working.begin(), --iter)) in LLVMFuzzerTestOneInput()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| D | push_heap_comp.pass.cpp | 44 assert(std::is_heap(ia, ia+i, std::greater<int>())); in test()
63 assert(std::is_heap(ia, ia+i, indirect_less())); in main()
|
| D | push_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i)); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 45 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); in test()
66 assert(std::is_heap(ia, ia+i-1, indirect_less())); in main()
|
| D | pop_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i-1)); in test()
|
| /external/libcxx/fuzzing/ |
| D | fuzzing.cpp | 509 if (!std::is_heap(working.begin(), working.end())) return 1; in make_heap()
522 if (!std::is_heap(working.begin(), iter)) return 1; in push_heap()
528 if (!std::is_heap(working.begin(), iter)) return 2; in push_heap()
545 if (!std::is_heap(working.begin(), --iter)) return 2; in pop_heap()
|
| /external/llvm-project/libcxx/test/libcxx/diagnostics/ |
| D | nodiscard_extensions.verify.cpp | 134 std::is_heap(std::begin(arr), std::end(arr)); in main()
137 std::is_heap(std::begin(arr), std::end(arr), std::greater<int>()); in main()
|
| D | nodiscard_extensions.pass.cpp | 77 std::is_heap(std::begin(arr), std::end(arr)); in main()
78 std::is_heap(std::begin(arr), std::end(arr), std::greater<int>()); in main()
|
| /external/llvm-project/clang-tools-extra/clangd/ |
| D | Quality.h | 203 assert(std::is_heap(Heap.begin(), Heap.end(), Greater)); in push()
|
| /external/rust/crates/tinyvec/tests/ |
| D | tinyvec.rs | 328 assert!(tv.is_heap()); in TinyVec_move_to_heap_and_shrink()
337 assert!(tv.is_heap()); in TinyVec_move_to_heap_and_shrink()
|