| /external/libchrome/base/ |
| values_unittest.cc | 596 scoped_ptr<Value> i42(new FundamentalValue(42));
599 EXPECT_TRUE(Value::Equals(i42.get(), i42.get()));
600 EXPECT_TRUE(Value::Equals(j42.get(), i42.get()));
601 EXPECT_TRUE(Value::Equals(i42.get(), j42.get()));
602 EXPECT_FALSE(Value::Equals(i42.get(), i17.get()));
603 EXPECT_FALSE(Value::Equals(i42.get(), NULL));
604 EXPECT_FALSE(Value::Equals(NULL, i42.get()));
[all...] |
| /external/libweave/third_party/chromium/base/ |
| values_unittest.cc | 562 scoped_ptr<Value> i42(new FundamentalValue(42));
565 EXPECT_TRUE(Value::Equals(i42.get(), i42.get()));
566 EXPECT_TRUE(Value::Equals(j42.get(), i42.get()));
567 EXPECT_TRUE(Value::Equals(i42.get(), j42.get()));
568 EXPECT_FALSE(Value::Equals(i42.get(), i17.get()));
569 EXPECT_FALSE(Value::Equals(i42.get(), NULL));
570 EXPECT_FALSE(Value::Equals(NULL, i42.get()));
[all...] |
| /external/libcxx/test/std/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...] |
| /external/v8/test/mjsunit/asm/embenchen/ |
| box2d.js | [all...] |
| zlib.js | [all...] |
| /art/test/083-compiler-regressions/src/ |
| Main.java | 1420 int i42 = 42; local
[all...] |
