| /external/v8/test/mjsunit/regress/ |
| regress-2110.js | 32 function test() { function
37 test();
38 test();
39 test();
40 %OptimizeFunctionOnNextCall(test);
41 test();
|
| regress-294.js | 33 function test(x) { function
43 test("hund");
|
| regress-grow-store-smi-check.js | 30 // The below test function was generated from part of a WebKit layout
31 // test library setup routine: fast/canvas/webgl/resources/pnglib.js
33 function test(crc32) { function
50 test([0.5]);
51 test(a);
52 %OptimizeFunctionOnNextCall(test);
53 test(a);
|
| /external/v8/test/mjsunit/ |
| string-externalize.js | 32 function test() { function
92 // Run the test many times to ensure IC-s don't break things.
94 test();
|
| sum-0-plus-undefined-is-NaN.js | 31 * @fileoverview Test addition of 0 and undefined.
36 function test(x, y, expectNaN) { function
44 test(0, 1, false);
45 test(0, undefined, true);
|
| value-wrapper-accessor.js | 33 function test(object, prototype) { function
91 test(1, Number.prototype);
92 test("string", String.prototype);
93 test(true, Boolean.prototype);
|
| /external/v8/test/webkit/ |
| sort-large-array.js | 26 var test = []; variable
28 test.push(10009 - i);
29 test.sort(function(a, b) {return a - b;});
31 shouldBe("test.length", "10010");
32 shouldBe("test[9999]", "9999");
33 shouldBe("test[10000]", "10000");
34 shouldBe("test.slice(0, 20).join(', ')", "'0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19'");
35 shouldBe("test.slice(9990, 10010).join(', ')", "'9990, 9991, 9992, 9993, 9994, 9995, 9996, 9997, 9998, 9999, 10000, 10001, 10002, 10003, 10004, 10005, 10006, 10007, 10008, 10009'");
|
| /libcore/luni/src/test/etc/loading-test-jar/ |
| Test1.java | 17 package test; package
23 public static String test() { method in class:Test1
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 26 test(Iter first, Iter last, const T& value) function
41 test()
55 test(Iter(v.data()), Iter(v.data()+v.size()), x);
63 test(d, e, x);
65 test<forward_iterator<const int*> >();
66 test<bidirectional_iterator<const int*> >();
67 test<random_access_iterator<const int*> >();
68 test<const int*>();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 25 test(Iter first, Iter last, const T& value) function
36 test()
50 test(Iter(v.data()), Iter(v.data()+v.size()), x);
58 test(d, e, x);
60 test<forward_iterator<const int*> >();
61 test<bidirectional_iterator<const int*> >();
62 test<random_access_iterator<const int*> >();
63 test<const int*>();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 25 test(Iter first, Iter last, const T& value) function
36 test()
50 test(Iter(v.data()), Iter(v.data()+v.size()), x);
58 test(d, e, x);
60 test<forward_iterator<const int*> >();
61 test<bidirectional_iterator<const int*> >();
62 test<random_access_iterator<const int*> >();
63 test<const int*>();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| alloc.pass.cpp | 23 test(const Allocator& a) function
32 test<int>(std::allocator<int>());
33 test<NotConstructible>(test_allocator<NotConstructible>(3));
35 test<int>(min_allocator<int>());
36 test<NotConstructible>(min_allocator<NotConstructible>{});
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_size_value.pass.cpp | 23 test(typename C::size_type n, const typename C::value_type& x) function
35 test<std::vector<int> >(50, 3);
36 test<std::vector<int, stack_allocator<int, 50> > >(50, 5);
38 test<std::vector<int, min_allocator<int>> >(50, 3);
|
| construct_size_value_alloc.pass.cpp | 21 test(typename C::size_type n, const typename C::value_type& x, function
35 test<std::vector<int> >(50, 3, std::allocator<int>());
37 test<std::vector<int, min_allocator<int>> >(50, 3, min_allocator<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| construct_size_value.pass.cpp | 22 test(typename C::size_type n, const typename C::value_type& x) function
33 test<std::vector<bool> >(50, 3);
35 test<std::vector<bool, min_allocator<bool>> >(50, 3);
|
| construct_size_value_alloc.pass.cpp | 22 test(typename C::size_type n, const typename C::value_type& x, function
35 test<std::vector<bool> >(50, 3, std::allocator<bool>());
37 test<std::vector<bool, min_allocator<bool>> >(50, 3, min_allocator<bool>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/back.insert.iter.ops/back.insert.iter.cons/ |
| container.pass.cpp | 22 test(C c) function
29 test(std::vector<int>());
30 test(nasty_vector<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/back.insert.iter.ops/back.insert.iter.op=/ |
| rv_value.pass.cpp | 28 test(C c) function
40 test(std::vector<std::unique_ptr<int> >());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
| container.pass.cpp | 22 test(C c) function
29 test(std::list<int>());
30 test(nasty_list<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op=/ |
| rv_value.pass.cpp | 27 test(C c) function
39 test(std::list<std::unique_ptr<int> >());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.cons/ |
| test.pass.cpp | 22 test(C c) function
29 test(std::vector<int>());
30 test(nasty_vector<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/language.support/support.limits/limits/ |
| is_specialized.pass.cpp | 10 // test numeric_limits
25 // More convenient to test it here.
31 void test() function
45 test<bool>();
46 test<char>();
47 test<wchar_t>();
49 test<char16_t>();
50 test<char32_t>();
52 test<signed char>();
53 test<unsigned char>()
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/language.support/support.limits/limits/numeric.limits.members/ |
| denorm_min.pass.cpp | 10 // test numeric_limits
19 test(T expected) function
29 test<bool>(false);
30 test<char>(0);
31 test<signed char>(0);
32 test<unsigned char>(0);
33 test<wchar_t>(0);
35 test<char16_t>(0);
36 test<char32_t>(0);
38 test<short>(0)
[all...] |
| digits.pass.cpp | 10 // test numeric_limits
19 test() function
21 static_assert(std::numeric_limits<T>::digits == expected, "digits test 1");
22 static_assert(std::numeric_limits<const T>::digits == expected, "digits test 2");
23 static_assert(std::numeric_limits<volatile T>::digits == expected, "digits test 3");
24 static_assert(std::numeric_limits<const volatile T>::digits == expected, "digits test 4");
29 test<bool, 1>();
30 test<char, std::numeric_limits<char>::is_signed ? 7 : 8>();
31 test<signed char, 7>();
32 test<unsigned char, 8>()
[all...] |
| digits10.pass.cpp | 10 // test numeric_limits
19 test() function
21 static_assert(std::numeric_limits<T>::digits10 == expected, "digits10 test 1");
22 static_assert(std::numeric_limits<T>::is_bounded, "digits10 test 5");
23 static_assert(std::numeric_limits<const T>::digits10 == expected, "digits10 test 2");
24 static_assert(std::numeric_limits<const T>::is_bounded, "digits10 test 6");
25 static_assert(std::numeric_limits<volatile T>::digits10 == expected, "digits10 test 3");
26 static_assert(std::numeric_limits<volatile T>::is_bounded, "digits10 test 7");
27 static_assert(std::numeric_limits<const volatile T>::digits10 == expected, "digits10 test 4");
28 static_assert(std::numeric_limits<const volatile T>::is_bounded, "digits10 test 8")
[all...] |
