| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 150 int i71[] = {0, 0, 1, 1, 1, 0}; local
213 assert(std::is_heap_until(i71, i71+6) == i71+2);
|
| is_heap.pass.cpp | 150 int i71[] = {0, 0, 1, 1, 1, 0}; local
213 assert(std::is_heap(i71, i71+6) == (std::is_heap_until(i71, i71+6) == i71+6));
|
| is_heap_until_comp.pass.cpp | 151 int i71[] = {0, 0, 1, 1, 1, 0}; local
214 assert(std::is_heap_until(i71, i71+6, std::greater<int>()) == i71+5);
|
| is_heap_comp.pass.cpp | 151 int i71[] = {0, 0, 1, 1, 1, 0}; local
214 assert(std::is_heap(i71, i71+6, std::greater<int>()) == (std::is_heap_until(i71, i71+6, std::greater<int>()) == i71+6));
[all...] |
