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

  /external/chromium_org/base/
values_unittest.cc 552 scoped_ptr<Value> i42(new FundamentalValue(42));
555 EXPECT_TRUE(Value::Equals(i42.get(), i42.get()));
556 EXPECT_TRUE(Value::Equals(j42.get(), i42.get()));
557 EXPECT_TRUE(Value::Equals(i42.get(), j42.get()));
558 EXPECT_FALSE(Value::Equals(i42.get(), i17.get()));
559 EXPECT_FALSE(Value::Equals(i42.get(), NULL));
560 EXPECT_FALSE(Value::Equals(NULL, i42.get()));
    [all...]
  /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
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.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_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);
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...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
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.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_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);
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...]
  /art/test/083-compiler-regressions/src/
Main.java 1401 int i42 = 42; local
    [all...]

Completed in 363 milliseconds