HomeSort by relevance Sort by last modified time
    Searched refs:i65 (Results 1 - 6 of 6) sorted by null

  /external/llvm/unittests/ADT/
APIntTest.cpp 59 APInt i65(65, 0, true);
60 EXPECT_EQ(65u, i65.countLeadingZeros());
61 EXPECT_EQ(0u, i65.countLeadingOnes());
62 EXPECT_EQ(0u, i65.getActiveBits());
63 EXPECT_EQ(1u, i65.getActiveWords());
64 EXPECT_EQ(65u, i65.countTrailingZeros());
65 EXPECT_EQ(0u, i65.countPopulation());
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap_until.pass.cpp 144 int i65[] = {0, 0, 1, 0, 0, 0}; local
207 assert(std::is_heap_until(i65, i65+6) == i65+2);
is_heap.pass.cpp 144 int i65[] = {0, 0, 1, 0, 0, 0}; local
207 assert(std::is_heap(i65, i65+6) == (std::is_heap_until(i65, i65+6) == i65+6));
is_heap_until_comp.pass.cpp 145 int i65[] = {0, 0, 1, 0, 0, 0}; local
208 assert(std::is_heap_until(i65, i65+6, std::greater<int>()) == i65+5);
is_heap_comp.pass.cpp 145 int i65[] = {0, 0, 1, 0, 0, 0}; local
208 assert(std::is_heap(i65, i65+6, std::greater<int>()) == (std::is_heap_until(i65, i65+6, std::greater<int>()) == i65+6));
    [all...]
  /art/test/083-compiler-regressions/src/
Main.java 380 int i65 = 65; local
    [all...]

Completed in 434 milliseconds