| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 90 int i42[] = {1, 0, 0, 0, 0}; local
121 assert(std::is_heap(i42, i42+5) == (std::is_heap_until(i42, i42+5) == i42+5));
|
| is_heap_comp.pass.cpp | 91 int i42[] = {1, 0, 0, 0, 0}; local
122 assert(std::is_heap(i42, i42+5, std::greater<int>()) == (std::is_heap_until(i42, i42+5, std::greater<int>()) == i42+5));
[all...] |
| is_heap_until.pass.cpp | 90 int i42[] = {1, 0, 0, 0, 0}; local
121 assert(std::is_heap_until(i42, i42+5) == i42+5);
|
| is_heap_until_comp.pass.cpp | 91 int i42[] = {1, 0, 0, 0, 0}; local
122 assert(std::is_heap_until(i42, i42+5, std::greater<int>()) == i42+1);
|
