| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 15 // is_heap(Iter first, Iter last);
26 return std::is_heap(std::begin(ia), std::end(ia))
27 && !std::is_heap(std::begin(ib), std::end(ib));
34 assert(std::is_heap(i1, i1));
35 assert(std::is_heap(i1, i1+1) == (std::is_heap_until(i1, i1+1) == i1+1));
38 assert(std::is_heap(i1, i1+2) == (std::is_heap_until(i1, i1+2) == i1+2));
39 assert(std::is_heap(i2, i2+2) == (std::is_heap_until(i2, i2+2) == i2+2));
40 assert(std::is_heap(i3, i3+2) == (std::is_heap_until(i3, i3+2) == i3+2));
48 assert(std::is_heap(i4, i4+3) == (std::is_heap_until(i4, i4+3) == i4+3));
49 assert(std::is_heap(i5, i5+3) == (std::is_heap_until(i5, i5+3) == i5+3))
[all...] |
| is_heap_comp.pass.cpp | 15 // is_heap(Iter first, Iter last);
27 return std::is_heap(std::begin(ia), std::end(ia), std::greater<int>())
28 && !std::is_heap(std::begin(ib), std::end(ib), std::greater<int>());
35 assert(std::is_heap(i1, i1, std::greater<int>()));
36 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
39 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
40 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
41 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
49 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3));
50 assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3))
[all...] |
| /prebuilts/ndk/r16/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 | 44 assert(std::is_heap(ia, ia+i, std::greater<int>()));
63 assert(std::is_heap(ia, ia+i, indirect_less()));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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 | 44 assert(std::is_heap(ia, ia+i, std::greater<int>()));
63 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));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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 | 43 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
63 intervals.push_back(Interval(space_begin, space_end, /*is_heap*/true));
74 const bool is_heap = std::get<2>(interval); local
76 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap;
82 if (!is_heap) {
90 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 | 45 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
66 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/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 | 45 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
66 assert(std::is_heap(ia, ia+i-1, indirect_less()));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/ |
| binary_heap_.hpp | 269 _GLIBCXX_DEBUG_ASSERT(is_heap());
275 if (!is_heap())
294 is_heap() function in class:__gnu_pbds::detail::binary_heap
|
| insert_fn_imps.hpp | 106 _GLIBCXX_DEBUG_ASSERT(is_heap());
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/ |
| binary_heap_.hpp | 269 _GLIBCXX_DEBUG_ASSERT(is_heap());
275 if (!is_heap())
294 is_heap() function in class:__gnu_pbds::detail::binary_heap
|
| insert_fn_imps.hpp | 106 _GLIBCXX_DEBUG_ASSERT(is_heap());
|
| /external/libcxx/fuzzing/ |
| fuzzing.cpp | 496 if (!std::is_heap(working.begin(), working.end())) return 1;
509 if (!std::is_heap(working.begin(), iter)) return 1;
515 if (!std::is_heap(working.begin(), iter)) return 2;
532 if (!std::is_heap(working.begin(), --iter)) return 2;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_heap.h | 127 // + is_heap and is_heap_until in C++0x.
571 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function
584 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, function
|
| algorithmfwd.h | 71 is_heap (C++0x)
290 is_heap(_RAIter, _RAIter);
294 is_heap(_RAIter, _RAIter, _Compare);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_heap.h | 127 // + is_heap and is_heap_until in C++0x.
571 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) function
584 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, function
|
