HomeSort by relevance Sort by last modified time
    Searched refs:a3 (Results 151 - 175 of 840) sorted by null

1 2 3 4 5 67 8 91011>>

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.binary/
and_valarray_valarray.pass.cpp 25 T a3[] = {0, 2, 0, 0, 0}; local
33 assert(v3[i] == a3[i]);
divide_valarray_valarray.pass.cpp 25 T a3[] = {1, 2, 3, 4, 5}; local
33 assert(v3[i] == a3[i]);
minus_valarray_valarray.pass.cpp 25 T a3[] = {1, 2, 3, 4, 5}; local
33 assert(v3[i] == a3[i]);
modulo_valarray_valarray.pass.cpp 25 T a3[] = {0, 1, 2, 1, 0}; local
33 assert(v3[i] == a3[i]);
or_valarray_valarray.pass.cpp 25 T a3[] = {7, 7, 11, 13, 15}; local
33 assert(v3[i] == a3[i]);
plus_valarray_valarray.pass.cpp 25 T a3[] = {7, 9, 11, 13, 15}; local
33 assert(v3[i] == a3[i]);
shift_left_valarray_valarray.pass.cpp 25 T a3[] = {64, 256, 768, 2048, 5120}; local
33 assert(v3[i] == a3[i]);
shift_right_valarray_valarray.pass.cpp 25 T a3[] = { 1, 2, 3, 4, 5}; local
33 assert(v3[i] == a3[i]);
times_valarray_valarray.pass.cpp 25 T a3[] = {6, 14, 24, 36, 50}; local
33 assert(v3[i] == a3[i]);
xor_valarray_valarray.pass.cpp 25 T a3[] = {7, 5, 11, 13, 15}; local
33 assert(v3[i] == a3[i]);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/valarray.nonmembers/valarray.comparison/
and_valarray_valarray.pass.cpp 27 bool a3[] = {true, true, false, true, false}; local
35 assert(v3[i] == a3[i]);
equal_valarray_valarray.pass.cpp 27 bool a3[] = {false, false, true, false, true}; local
35 assert(v3[i] == a3[i]);
greater_equal_valarray_valarray.pass.cpp 27 bool a3[] = {false, false, true, true, true}; local
35 assert(v3[i] == a3[i]);
greater_valarray_valarray.pass.cpp 27 bool a3[] = {false, false, false, true, true}; local
35 assert(v3[i] == a3[i]);
less_equal_valarray_valarray.pass.cpp 27 bool a3[] = {true, true, true, false, false}; local
35 assert(v3[i] == a3[i]);
less_valarray_valarray.pass.cpp 27 bool a3[] = {true, true, false, false, false}; local
35 assert(v3[i] == a3[i]);
not_equal_valarray_valarray.pass.cpp 27 bool a3[] = {true, true, false, true, false}; local
35 assert(v3[i] == a3[i]);
or_valarray_valarray.pass.cpp 27 bool a3[] = {true, true, false, true, true}; local
35 assert(v3[i] == a3[i]);
  /ndk/sources/third_party/googletest/googletest/test/
gtest-linked_ptr_test.cc 91 linked_ptr<A> a3(new A);
92 a0 = a3;
93 ASSERT_TRUE(a0 == a3);
95 ASSERT_TRUE(a0.get() == a3);
96 ASSERT_TRUE(a0 == a3.get());
100 ASSERT_TRUE(a5.get() != a3);
101 ASSERT_TRUE(a5 != a3.get());
110 a3->Use();
147 "A3 ctor\n"
149 "A3 dtor\n
    [all...]
  /external/chromium-trace/trace-viewer/third_party/gl-matrix/src/gl-matrix/
mat2.js 118 var a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3],
121 det = a0 * a3 - a2 * a1;
128 out[0] = a3 * det;
173 var a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3];
177 out[2] = a2 * b0 + a3 * b2;
178 out[3] = a2 * b1 + a3 * b3;
197 var a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3],
202 out[2] = a2 * c + a3 * s;
203 out[3] = a2 * -s + a3 * c;
216 var a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3]
    [all...]
  /dalvik/vm/compiler/template/mips/
TEMPLATE_INVOKE_METHOD_NO_OPT.S 11 move a3, a1 # a3<- returnCell
22 # a1 = newFP, a0 = methodToCall, a3 = returnCell, rPC = dalvikCallsite
31 sw a3, (offStackSaveArea_returnAddr - sizeofStackSaveArea)(a1)
49 lw a3, offClassObject_pDvmDex(t9) # a3<- method->clazz->pDvmDex
53 sw a3, offThread_methodClassDex(rSELF) # self->methodClassDex = ...
57 # preserve rTEMP,a1-a3
61 SCRATCH_STORE(a3, 12)
69 # restore rTEMP,a1-a3
    [all...]
  /cts/tools/vm-tests-tf/src/dot/junit/verify/a3/
Test_a3.java 17 package dot.junit.verify.a3;
25 * @constraint A3
31 Class.forName("dot.junit.verify.a3.d.T_a3_1");
  /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.aggr/
p4.cpp 10 T a3[] = { 1, 3, 5 }; local
  /external/clang/test/CodeGen/
asm-variable.c 5 unsigned long long a3, unsigned long long a4,
18 b3 = a3;
31 double a3, double a4,
47 b3 = a3;
  /external/clang/test/Sema/
generic-selection.c 22 int a3[_Generic(0L, int: 1, short: 2, float: 3, default: 4) == 4 ? 1 : -1]; local

Completed in 288 milliseconds

1 2 3 4 5 67 8 91011>>