HomeSort by relevance Sort by last modified time
    Searched refs:A1 (Results 26 - 50 of 133) sorted by null

12 3 4 5 6

  /frameworks/av/media/libeffects/lvm/lib/Common/src/
FO_1I_D16F16Css_TRC_WRA_01_Init.c 49 temp=pCoef->A1;
FO_1I_D32F32Cll_TRC_WRA_01_Init.c 48 temp=pCoef->A1;
FO_2I_D16F32Css_LShx_TRC_WRA_01_Init.c 48 temp=pCoef->A1;
BQ_1I_D16F16Css_TRC_WRA_01_Init.c 50 temp=pCoef->A1;
BQ_1I_D16F32Css_TRC_WRA_01_init.c 51 temp=pCoef->A1;
BQ_2I_D16F16Css_TRC_WRA_01_Init.c 51 temp=pCoef->A1;
BQ_2I_D16F32Css_TRC_WRA_01_init.c 50 temp=pCoef->A1;
BQ_2I_D32F32Cll_TRC_WRA_01_Init.c 50 temp=pCoef->A1;
  /external/chromium/testing/gmock/include/gmock/
gmock-generated-function-mockers.h 80 template <typename R, typename A1>
81 class FunctionMocker<R(A1)> : public
82 internal::FunctionMockerBase<R(A1)> {
84 typedef R F(A1);
87 MockSpec<F>& With(const Matcher<A1>& m1) {
92 R Invoke(A1 a1) {
97 return this->InvokeWith(ArgumentTuple(a1));
101 template <typename R, typename A1, typename A2>
102 class FunctionMocker<R(A1, A2)> : publi
    [all...]
  /external/clang/test/CXX/special/class.dtor/
p5-0x.cpp 17 union A1 {
18 A1();
19 NonTrivDtor n; // expected-note {{destructor of union 'A1' is implicitly deleted because field 'n' has a non-trivial destructor}}
21 A1 a1; // expected-error {{deleted function}} variable
  /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/
traversal-reject.js 5 testElement.innerHTML='<div id="A1"> <div id="B1"> <div id="C1"></div> </div> <div id="B2"></div><div id="B3"></div> </div>';
27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
33 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
38 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
45 shouldBe("walker.parentNode(); walker.currentNode.id", "'A1'");
56 shouldBe("walker.previousNode(); walker.currentNode.id", "'A1'");
traversal-skip.js 5 testElement.innerHTML='<div id="A1"> <div id="B1"> <div id="C1"></div> </div> <div id="B2"></div><div id="B3"></div> </div>';
27 shouldBe("walker.nextNode(); walker.currentNode.id", "'A1'");
34 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
39 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
46 shouldBe("walker.parentNode(); walker.currentNode.id", "'A1'");
58 shouldBe("walker.previousNode(); walker.currentNode.id", "'A1'");
acceptNode-filter.js 6 testElement.innerHTML='<div id="A1"><div id="B1"></div><div id="B2"></div></div>';
18 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
31 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
37 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
43 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
67 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
79 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
previousNodeLastChildReject.js 4 testElement.innerHTML='<div id="A1"><div id="B1"><div id="C1"></div><div id="C2"><div id="D1"></div><div id="D2"></div></div></div><div id="B2"><div id="C3"></div><div id="C4"></div></div></div>';
15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
previousSiblingLastChildSkip.js 4 testElement.innerHTML='<div id="A1"><div id="B1"><div id="C1"></div><div id="C2"><div id="D1"></div><div id="D2"></div></div></div><div id="B2"><div id="C3"></div><div id="C4"></div></div></div>';
15 shouldBe("walker.firstChild(); walker.currentNode.id", "'A1'");
  /dalvik/tests/091-deep-interface-hierarchy/src/
Main.java 22 interface A1 {}
28 interface B1 extends A1, A2, A3, A4, A5 {}
29 interface B2 extends A1, A2, A3, A4, A5 {}
30 interface B3 extends A1, A2, A3, A4, A5 {}
31 interface B4 extends A1, A2, A3, A4, A5 {}
32 interface B5 extends A1, A2, A3, A4, A5 {}
  /external/clang/test/SemaCXX/
conversion-function.cpp 121 struct A1 {
122 A1(const char *);
123 ~A1();
126 A1(const A1&); // expected-note 2 {{declared private here}}
129 A1 f() {
389 A& a1(c);
  /external/opencv/cxcore/src/
cxjacobieigens.cpp 106 float *V1 = V, *A1 = A;
109 for( p = 0; p < n - 1; p++, A1 += n, V1 += n )
116 float *A3, Apq = A1[q], App, Aqq, Aip, Aiq, Vpi, Vqi;
124 App = A1[p];
151 Aip = A1[i];
155 A1[i] = (float) (Aip * c - Aiq * s);
162 Aip = A1[i];
166 A1[i] = (float) (Aip * c - Aiq * s);
171 A1[p] = (float) (App * c2 + Aqq * s2 - a);
173 A1[q] = A2[p] = 0.0f
    [all...]
  /external/clang/test/CXX/temp/temp.param/
p4.cpp 7 template<int N> struct A1;
p9-0x.cpp 31 template<typename T> struct A1 { template<typename U> struct B; };
32 template<typename T> template<typename U = int> struct A1<T>::B { }; // expected-error{{cannot add a default template argument to the definition of a member of a class template}}
  /external/openfst/src/include/fst/
add-on.h 65 template <class A1, class A2>
69 AddOnPair(A1 *a1, A2 *a2)
70 : a1_(a1), a2_(a2) {
84 A1 *First() const { return a1_; }
87 static AddOnPair<A1, A2> *Read(istream &istrm) {
88 A1 *a1 = 0; local
92 a1 = A1::Read(istrm)
    [all...]
  /external/nist-sip/java/gov/nist/javax/sip/clientauthutils/
MessageDigestAlgorithm.java 133 String A1 = null;
137 A1 = username_value + ":" + realm_value + ":" + passwd;
143 A1 = H(username_value + ":" + realm_value + ":" + passwd) + ":" + nonce_value + ":"
163 request_digest = KD(H(A1), nonce_value + ":" + nc_value + ":" + cnonce_value + ":"
167 request_digest = KD(H(A1), nonce_value + ":" + H(A2));
  /external/clang/test/CodeGenCXX/
vtable-layout.cpp 300 struct A1 {
313 // CHECK-13-NEXT: -- (Test6::A1, 0) vtable address --
321 struct C : A1, A2 {
392 struct A1 { int a1; }; member in struct:Test9::A1
402 struct B : virtual A1, virtual A2 {
417 struct A1 { virtual void a1(); };
423 // CHECK-17-NEXT: -- (Test10::A1, 0) vtable address --
426 // CHECK-17-NEXT: 2 | void Test10::A1::a1(
    [all...]
destructors.cpp 57 class A1 {
58 ~A1();
61 template<> A1<char>::~A1();
  /external/openssl/crypto/bn/
bn_prime.c 129 static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
249 BIGNUM *A1, *A1_odd, *check; /* taken from ctx */
290 A1 = BN_CTX_get(ctx);
295 /* compute A1 := A - 1 */
296 if (!BN_copy(A1, A))
298 if (!BN_sub_word(A1, 1))
300 if (BN_is_zero(A1))
306 /* write A1 as A1_odd * 2^k */
308 while (!BN_is_bit_set(A1, k))
310 if (!BN_rshift(A1_odd, A1, k)
    [all...]

Completed in 799 milliseconds

12 3 4 5 6