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