| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 291 int i149[] = {0, 0, 1, 1, 1, 0, 1}; local
418 assert(std::is_heap_until(i149, i149+7) == i149+2);
|
| is_heap.pass.cpp | 291 int i149[] = {0, 0, 1, 1, 1, 0, 1}; local
418 assert(std::is_heap(i149, i149+7) == (std::is_heap_until(i149, i149+7) == i149+7));
|
| is_heap_until_comp.pass.cpp | 292 int i149[] = {0, 0, 1, 1, 1, 0, 1}; local
419 assert(std::is_heap_until(i149, i149+7, std::greater<int>()) == i149+5);
|
| is_heap_comp.pass.cpp | 292 int i149[] = {0, 0, 1, 1, 1, 0, 1}; local
419 assert(std::is_heap(i149, i149+7, std::greater<int>()) == (std::is_heap_until(i149, i149+7, std::greater<int>()) == i149+7));
[all...] |
