| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| math-partial-sums.js | 6 var a1 = a2 = a3 = a4 = a5 = a6 = a7 = a8 = a9 = 0.0;
19 a2 += Math.pow(k,-0.5);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-crbug-162085.js | 43 var a2 = [1.3]; variable
44 grow_store(a2,1,1.4);
45 a2.length = 0;
46 grow_store(a2,0,1.5);
47 assertEquals(1.5, a2[0]);
48 assertEquals(undefined, a2[1]);
49 assertEquals(undefined, a2[2]);
50 assertEquals(undefined, a2[3]);
|
| /external/clang/test/SemaCXX/ |
| class-names.cpp | 22 class A * a2; variable in typeref:class:A
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/depr/depr.function.objects/depr.adaptors/depr.member.pointer.adaptors/ |
| const_mem_fun1_ref_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| const_mem_fun1_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| const_mem_fun_ref_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| const_mem_fun_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| mem_fun_ref_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| mem_fun_t.pass.cpp | 21 short a2(int i) {return short(i+1);} function in struct:A
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.gslice.array/gslice.array.assign/ |
| gslice_array.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local
30 const std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| valarray.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.gslice.array/gslice.array.comp.assign/ |
| addition.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| and.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| divide.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| modulo.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| multiply.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| or.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| shift_left.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| shift_right.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| subtraction.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| xor.pass.cpp | 25 int a2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| indirect_array.pass.cpp | 26 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local
30 const std::size_t N2 = sizeof(a2)/sizeof(a2[0]);
35 const std::valarray<int> v2(a2, N2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| gslice_const.pass.cpp | 25 int a2[] = { -0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, local
28 std::valarray<int> v2(a2, sizeof(a2)/sizeof(a2[0]));
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/bind/ |
| mem_fn_template.hpp | 253 template<class R, class T, class A1, class A2 BOOST_MEM_FN_CLASS_F> class BOOST_MEM_FN_NAME(mf2)
261 BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2))
278 R operator()(T * p, A1 a1, A2 a2) const
280 BOOST_MEM_FN_RETURN (p->*f_)(a1, a2);
283 template<class U> R operator()(U & u, A1 a1, A2 a2) const
286 BOOST_MEM_FN_RETURN call(u, p, a1, a2);
291 template<class U> R operator()(U const & u, A1 a1, A2 a2) cons
[all...] |
| /art/runtime/arch/mips/ |
| jni_entrypoints_mips.S | 28 addiu $sp, $sp, -32 # leave room for $a0, $a1, $a2, $a3, and $ra
34 sw $a2, 8($sp)
44 lw $a2, 8($sp)
71 sw $a2, 20($sp)
83 lw $a2, 20($sp)
|
