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