| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 15 // is_heap(Iter first, Iter last);
23 assert(std::is_heap(i1, i1));
24 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1));
27 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2));
28 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2));
29 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
37 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3));
38 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3));
39 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3));
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3))
[all...] |
| is_heap_comp.pass.cpp | 15 // is_heap(Iter first, Iter last);
24 assert(std::is_heap(i1, i1, std::greater<int>()));
25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3));
39 assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3));
40 assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3));
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3))
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 15 // is_heap(Iter first, Iter last);
23 assert(std::is_heap(i1, i1));
24 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1));
27 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2));
28 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2));
29 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
37 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3));
38 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3));
39 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3));
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3))
[all...] |
| is_heap_comp.pass.cpp | 15 // is_heap(Iter first, Iter last);
24 assert(std::is_heap(i1, i1, std::greater<int>()));
25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3));
39 assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3));
40 assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3));
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3))
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 15 // is_heap(Iter first, Iter last);
23 assert(std::is_heap(i1, i1));
24 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1));
27 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2));
28 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2));
29 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
37 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3));
38 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3));
39 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3));
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3))
[all...] |
| is_heap_comp.pass.cpp | 15 // is_heap(Iter first, Iter last);
24 assert(std::is_heap(i1, i1, std::greater<int>()));
25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3));
39 assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3));
40 assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3));
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3))
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i));
|
| push_heap_comp.pass.cpp | 45 assert(std::is_heap(ia, ia+i, std::greater<int>()));
64 assert(std::is_heap(ia, ia+i, indirect_less()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap.pass.cpp | 27 assert(std::is_heap(ia, ia+N));
|
| make_heap_comp.pass.cpp | 39 assert(std::is_heap(ia, ia+N, std::greater<int>()));
60 assert(std::is_heap(ia, ia+N, indirect_less()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+i));
|
| push_heap_comp.pass.cpp | 42 assert(std::is_heap(ia, ia+i, std::greater<int>()));
61 assert(std::is_heap(ia, ia+i, indirect_less()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap.pass.cpp | 27 assert(std::is_heap(ia, ia+N));
|
| make_heap_comp.pass.cpp | 43 assert(std::is_heap(ia, ia+N, std::greater<int>()));
53 assert(std::is_heap(ia, ia+N, pred));
63 assert(std::is_heap(ia, ia+N, pred));
72 assert(std::is_heap(ia, ia+N, pred));
97 assert(std::is_heap(ia, ia+N, indirect_less()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+i));
|
| push_heap_comp.pass.cpp | 42 assert(std::is_heap(ia, ia+i, std::greater<int>()));
61 assert(std::is_heap(ia, ia+i, indirect_less()));
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap_comp.pass.cpp | 43 assert(std::is_heap(ia, ia+N, std::greater<int>()));
53 assert(std::is_heap(ia, ia+N, pred));
63 assert(std::is_heap(ia, ia+N, pred));
72 assert(std::is_heap(ia, ia+N, pred));
97 assert(std::is_heap(ia, ia+N, indirect_less()));
|
| make_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+N));
|
| /art/runtime/gc/collector/ |
| immune_spaces.cc | 42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
62 intervals.push_back(Interval(space_begin, space_end, /*is_heap*/true));
73 const bool is_heap = std::get<2>(interval); local
75 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap;
81 if (!is_heap) {
89 if (is_heap) {
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap.pass.cpp | 33 assert(std::is_heap(ia, ia+i-1));
|
| pop_heap_comp.pass.cpp | 46 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
67 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+i-1));
|
| pop_heap_comp.pass.cpp | 42 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
63 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap.pass.cpp | 30 assert(std::is_heap(ia, ia+i-1));
|
| pop_heap_comp.pass.cpp | 42 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
63 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
