Searched defs:s1 (Results 276 - 300 of 850) sorted by relevance

<<11121314151617181920>>

/external/eigen/test/
H A Dbasicstuff.cpp141 Scalar s1 = internal::random<Scalar>(), local
144 VERIFY(numext::real(s1)==numext::real_ref(s1));
145 VERIFY(numext::imag(s1)==numext::imag_ref(s1));
146 numext::real_ref(s1) = numext::real(s2);
147 numext::imag_ref(s1) = numext::imag(s2);
148 VERIFY(internal::isApprox(s1, s2, NumTraits<RealScalar>::epsilon()));
149 // extended precision in Intel FPUs means that s1 == s2 in the line above is not guaranteed.
H A Dblock.cpp15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { argument
17 VERIFY_IS_APPROX(m1.row(r1).cwiseMax(s1), m1.cwiseMax(s1).row(r1));
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1));
20 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1,c2-c1+1));
21 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1,c2-c1+1));
53 Scalar s1 local
[all...]
H A Dcwiseop.cpp91 Scalar s1 = internal::random<Scalar>(); local
94 m3 = MatrixType::Constant(rows, cols, s1);
100 VERIFY_IS_APPROX(m3(i,j), s1); local
104 VERIFY(m3.isConstant(s1));
106 VERIFY_IS_APPROX(m4.setConstant(s1), m3);
107 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3);
112 m4.fill(s1);
115 VERIFY_IS_APPROX(v3.setConstant(rows, s1), VectorType::Constant(rows,s1));
H A Dgeo_alignedbox.cpp38 RealScalar s1 = internal::random<RealScalar>(0,1); local
50 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1));
H A Dgeo_parametrizedline.cpp37 Scalar s1 = abs(internal::random<Scalar>()); local
43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 ); local
H A Dnomalloc.cpp47 Scalar s1 = internal::random<Scalar>(); local
52 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
H A Dproduct_extra.cpp37 Scalar s1 = internal::random<Scalar>(), local
44 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2);
45 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (numext::conj(s1) * m1.adjoint()).eval() * m2);
46 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval());
47 VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval() * m2);
48 VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m
[all...]
H A Dproduct_notemporary.cpp51 Scalar s1 = internal::random<Scalar>(), local
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1);
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0);
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0);
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0);
72 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() -= s1 * m1.block(r0,c0,r1,c1) * m2.block(c0,r0,c1,r1) ), 0);
75 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() = s1 * m1.block(r0,c0,r1,c1) * (s1*m
[all...]
/external/eigen/test/eigen2/
H A Deigen2_hyperplane.cpp40 Scalar s1 = ei_random<Scalar>(); local
47 VERIFY_IS_MUCH_SMALLER_THAN( pl1.absDistance(p1 + pl1.normal().unitOrthogonal() * s1), Scalar(1) );
H A Deigen2_sparse_basic.cpp61 Scalar s1 = ei_random<Scalar>(); local
218 VERIFY_IS_APPROX(m1*s1-m2, refM1*s1-refM2);
220 VERIFY_IS_APPROX(m1*=s1, refM1*=s1);
221 VERIFY_IS_APPROX(m1/=s1, refM1/=s1);
H A Deigen2_submatrices.cpp65 Scalar s1 = ei_random<Scalar>(); local
76 m1.row(r1) += s1 * m1.row(r2);
77 m1.col(c1) += s1 * m1.col(c2);
87 m1.block(r1,c1,r2-r1+1,c2-c1+1) = s1 * m2.block(0, 0, r2-r1+1,c2-c1+1);
106 m1.template block<BlockRows,BlockCols>(1,1) *= s1;
H A Dproduct.h58 Scalar s1 = ei_random<Scalar>(); local
77 VERIFY_IS_APPROX(s1*(square*m1), (s1*square)*m1);
78 VERIFY_IS_APPROX(s1*(square*m1), square*(m1*s1));
81 s1 += (square.lazy() * m1)(r,c);
/external/iproute2/ip/
H A Dlink_gre.c271 char s1[1024]; local
285 remote = format_host(AF_INET, 4, &addr, s1, sizeof(s1));
294 local = format_host(AF_INET, 4, &addr, s1, sizeof(s1));
/external/libnfc-nxp/src/
H A DphFriNfc_NdefReg.c41 static int16_t phFriNfc_NdefReg_Strncmp (const int8_t *s1, const int8_t *s2, uint32_t count);
45 static int16_t phFriNfc_NdefReg_Strncmp (const int8_t *s1, const int8_t *s2, uint32_t count) argument
47 return (int16_t)strncmp((const char*)s1,(const char*)s2, count);
49 int16_t phFriNfc_NdefReg_Strnicmp(const int8_t *s1, const int8_t *s2, uint32_t count) argument
55 c1 = *s1;
56 s1++;
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_loopfilter_masks_dspr2.h35 uint32_t s1, s2, s3; local
103 "or %[s1], %[r_k], %[c] \n\t"
107 "addu_s.qb %[s3], %[s1], %[s1] \n\t"
114 "addu_s.qb %[s1], %[s2], %[s3] \n\t"
115 "cmpgu.lt.qb %[c], %[flimit], %[s1] \n\t"
122 : [c] "=&r" (c), [r_k] "=&r" (r_k), [s1] "=&r" (s1), [hev1] "=&r" (hev1),
143 uint32_t s1, s2, s3; local
252 "or %[s1],
[all...]
/external/llvm/tools/llvm-symbolizer/
H A DLLVMSymbolize.h115 friend bool operator<(const SymbolDesc &s1, const SymbolDesc &s2) { argument
116 return s1.Addr < s2.Addr;
/external/llvm/unittests/IR/
H A DMetadataTest.cpp33 MDString *s1 = MDString::get(Context, StringRef(&x[0], 3)); local
36 EXPECT_NE(s1, s2);
45 MDString *s1 = MDString::get(Context, StringRef(&x[0], 3)); local
47 EXPECT_EQ(s1, s2);
81 MDString *s1 = MDString::get(Context, StringRef(&x[0], 3)); local
86 V.push_back(s1);
109 EXPECT_EQ(s1, n1->getOperand(0));
/external/lzma/C/
H A DPpmd7Enc.c163 CPpmd_State *s1 = s; local
170 RangeEnc_Encode(rc, low, s1->Freq, sum + escFreq);
172 p->FoundState = s1;
H A DSha256.c28 #define s1(x) (rotrFixed(x,17) ^ rotrFixed(x,19) ^ (x >> 10)) macro
31 #define blk2(i) (W[i&15] += s1(W[(i-2)&15]) + W[(i-7)&15] + s0(W[(i-15)&15]))
145 #undef s1 macro
/external/lzma/CPP/7zip/UI/Common/
H A DUpdatePair.cpp45 static void ThrowError(const UString &message, const UString &s1, const UString &s2) argument
49 m += s1;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_string.h110 util_strcmp(const char *s1, const char *s2) argument
115 u1 = (unsigned char) *s1++;
126 util_strncmp(const char *s1, const char *s2, size_t n) argument
131 u1 = (unsigned char) *s1++;
/external/mesa3d/src/gallium/drivers/i915/
H A Di915_fpc_optimize.c39 static boolean same_src_dst_reg(struct i915_full_src_register* s1, struct i915_full_dst_register* d1) argument
41 return (s1->Register.File == d1->Register.File &&
42 s1->Register.Indirect == d1->Register.Indirect &&
43 s1->Register.Dimension == d1->Register.Dimension &&
44 s1->Register.Index == d1->Register.Index);
/external/openfst/src/include/fst/
H A Dconcat.h78 StateId s1 = fst1->AddState(); local
80 fst1->SetFinal(s1, fst2.Final(s2));
81 fst1->ReserveArcs(s1, fst2.NumArcs(s2));
87 fst1->AddArc(s1, arc);
92 for (StateId s1 = 0; s1 < numstates1; ++s1) {
93 Weight final = fst1->Final(s1);
95 fst1->SetFinal(s1, Weight::Zero());
97 fst1->AddArc(s1, Ar
143 StateId s1 = siter.Value(); local
[all...]
H A Dequivalent.h179 MappedId s1 = Util::MapState(fst1.Start(), FST1); local
186 eq_classes.MakeSet(s1);
204 if (Util::IsFinal(fst1, s1) != Util::IsFinal(fst2, s2)) {
212 for (q.push_back(make_pair(s1, s2)); ret && !q.empty(); q.pop_front()) {
213 s1 = q.front().first;
216 // Representatives of the equivalence classes of s1/s2.
217 MappedId rep1 = Util::FindSet(&eq_classes, s1);
224 // Copy outgoing arcs starting at s1 into the hashtable.
225 if (Util::kDeadState != s1) {
226 ArcIterator<Fst<Arc> > arc_iter(fst1, Util::UnMapState(s1));
[all...]
H A Dunion.h78 StateId s1 = fst1->AddState(); local
80 fst1->SetFinal(s1, fst2.Final(s2));
81 fst1->ReserveArcs(s1, fst2.NumArcs(s2));
87 fst1->AddArc(s1, arc);

Completed in 3581 milliseconds

<<11121314151617181920>>