| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 179 int i100[] = {1, 0, 1, 0, 1, 1}; local
242 assert(std::is_heap_until(i100, i100+6) == i100+4);
|
| is_heap.pass.cpp | 179 int i100[] = {1, 0, 1, 0, 1, 1}; local
242 assert(std::is_heap(i100, i100+6) == (std::is_heap_until(i100, i100+6) == i100+6));
|
| is_heap_until_comp.pass.cpp | 180 int i100[] = {1, 0, 1, 0, 1, 1}; local
243 assert(std::is_heap_until(i100, i100+6, std::greater<int>()) == i100+1);
|
| is_heap_comp.pass.cpp | 180 int i100[] = {1, 0, 1, 0, 1, 1}; local
243 assert(std::is_heap(i100, i100+6, std::greater<int>()) == (std::is_heap_until(i100, i100+6, std::greater<int>()) == i100+6));
[all...] |
