| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 275 int i133[] = {0, 0, 0, 1, 1, 0, 1}; local
402 assert(std::is_heap_until(i133, i133+7) == i133+3);
|
| is_heap.pass.cpp | 275 int i133[] = {0, 0, 0, 1, 1, 0, 1}; local
402 assert(std::is_heap(i133, i133+7) == (std::is_heap_until(i133, i133+7) == i133+7));
|
| is_heap_until_comp.pass.cpp | 276 int i133[] = {0, 0, 0, 1, 1, 0, 1}; local
403 assert(std::is_heap_until(i133, i133+7, std::greater<int>()) == i133+7);
|
| is_heap_comp.pass.cpp | 276 int i133[] = {0, 0, 0, 1, 1, 0, 1}; local
403 assert(std::is_heap(i133, i133+7, std::greater<int>()) == (std::is_heap_until(i133, i133+7, std::greater<int>()) == i133+7));
[all...] |
