Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:i26 (Results 1 - 9 of 9) sorted by null

/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap_until.pass.cpp	74 int i26[] = {0, 0, 0, 0, 0}; local 105 assert(std::is_heap_until(i26, i26+5) == i26+5);
is_heap.pass.cpp	74 int i26[] = {0, 0, 0, 0, 0}; local 105 assert(std::is_heap(i26, i26+5) == (std::is_heap_until(i26, i26+5) == i26+5));
is_heap_until_comp.pass.cpp	75 int i26[] = {0, 0, 0, 0, 0}; local 106 assert(std::is_heap_until(i26, i26+5, std::greater<int>()) == i26+5);
is_heap_comp.pass.cpp	75 int i26[] = {0, 0, 0, 0, 0}; local 106 assert(std::is_heap(i26, i26+5, std::greater<int>()) == (std::is_heap_until(i26, i26+5, std::greater<int>()) == i26+5));     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap_until.pass.cpp	74 int i26[] = {0, 0, 0, 0, 0}; local 105 assert(std::is_heap_until(i26, i26+5) == i26+5);
is_heap.pass.cpp	74 int i26[] = {0, 0, 0, 0, 0}; local 105 assert(std::is_heap(i26, i26+5) == (std::is_heap_until(i26, i26+5) == i26+5));
is_heap_until_comp.pass.cpp	75 int i26[] = {0, 0, 0, 0, 0}; local 106 assert(std::is_heap_until(i26, i26+5, std::greater<int>()) == i26+5);
is_heap_comp.pass.cpp	75 int i26[] = {0, 0, 0, 0, 0}; local 106 assert(std::is_heap(i26, i26+5, std::greater<int>()) == (std::is_heap_until(i26, i26+5, std::greater<int>()) == i26+5));     [all...]