| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_InvTransformDequant_LumaDC.c | 58 OMX_S32 m1[4][4], m2[4][4], Value; local
79 m2[i][0] = m1[i][0] + m1[i][1]; /* a+b+c+d */
80 m2[i][1] = m1[i][2] + m1[i][3]; /* a+b-c-d */
81 m2[i][2] = m1[i][2] - m1[i][3]; /* a-b-c+d */
82 m2[i][3] = m1[i][0] - m1[i][1]; /* a-b+c-d */
89 m1[0][i] = m2[0][i] + m2[2][i];
90 m1[1][i] = m2[1][i] + m2[3][i];
91 m1[2][i] = m2[0][i] - m2[2][i]
[all...] |
| omxVCM4P10_SATD_4x4.c | 64 OMX_S32 d [4][4], m1[4][4], m2[4][4]; local
94 m2[i][0] = m1[i][0] + m1[i][1]; /* a+b+c+d */
95 m2[i][1] = m1[i][2] + m1[i][3]; /* a+b-c-d */
96 m2[i][2] = m1[i][2] - m1[i][3]; /* a-b-c+d */
97 m2[i][3] = m1[i][0] - m1[i][1]; /* a-b+c-d */
104 m1[0][i] = m2[0][i] + m2[2][i];
105 m1[1][i] = m2[1][i] + m2[3][i];
106 m1[2][i] = m2[0][i] - m2[2][i]
[all...] |
| /external/eigen/doc/examples/ |
| TemplateKeyword_flexible.cpp | 16 MatrixXi m2 = MatrixXi::Random(4,4); local
17 std::cout << "m2 before copy:" << std::endl;
18 std::cout << m2 << std::endl << std::endl;
19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
20 std::cout << "m2 after copy:" << std::endl;
21 std::cout << m2 << std::endl << std::endl;
|
| TemplateKeyword_simple.cpp | 14 MatrixXf m2 = MatrixXf::Random(4,4); local
15 std::cout << "m2 before copy:" << std::endl;
16 std::cout << m2 << std::endl << std::endl;
17 copyUpperTriangularPart(m2, m1);
18 std::cout << "m2 after copy:" << std::endl;
19 std::cout << m2 << std::endl << std::endl;
|
| class_CwiseBinaryOp.cpp | 15 Matrix4d m1 = Matrix4d::Random(), m2 = Matrix4d::Random(); local
16 cout << m1.binaryExpr(m2, MakeComplexOp<double>()) << endl;
|
| /external/eigen/test/eigen2/ |
| eigen2_linearstructure.cpp | 27 m2 = MatrixType::Random(rows, cols), local
39 VERIFY_IS_APPROX(m1+m2-m1, m2);
40 VERIFY_IS_APPROX(-m2+m1+m2, m1);
42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2);
44 m3 = m2; m3 += m1
[all...] |
| eigen2_sparse_basic.cpp | 169 SparseMatrixType m2(rows,cols);
170 m2.startFill();
177 m2.fillrand(i,j) = m1(i,j) = ei_random<Scalar>();
180 m2.endFill();
181 VERIFY_IS_APPROX(m2,m1);
186 SparseMatrixType m1(rows,cols), m2(rows,cols);
190 Eigen::RandomSetter<SparseMatrixType > setter(m2);
195 VERIFY_IS_APPROX(m1, m2);
207 SparseMatrixType m2(rows, rows);
211 initSparse<Scalar>(density, refM2, m2);
[all...] |
| eigen2_inverse.cpp | 27 m2(rows, cols),
36 m2 = m1.inverse();
37 VERIFY_IS_APPROX(m1, m2.inverse() );
39 m1.computeInverse(&m2);
40 VERIFY_IS_APPROX(m1, m2.inverse() );
42 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
|
| product.h | 15 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1::RealScalar epsilon = precision<typename Derived1::RealScalar>())
17 return !((m1-m2).cwise().abs2().maxCoeff() < epsilon * epsilon
18 * std::max(m1.cwise().abs2().maxCoeff(), m2.cwise().abs2().maxCoeff()));
42 m2 = MatrixType::Random(rows, cols), local
66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
68 m3 *= m1.transpose() * m2;
69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2));
73 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2)
[all...] |
| eigen2_sparse_solvers.cpp | 48 SparseMatrix<Scalar> m2(rows, cols);
52 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonzeroCoords);
54 m2.template marked<LowerTriangular>().solveTriangular(vec3));
57 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeLowerTriangular, &zeroCoords, &nonzeroCoords);
59 m2.template marked<LowerTriangular>().transpose().solveTriangular(vec3));
62 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonzeroCoords);
64 m2.template marked<UpperTriangular>().solveTriangular(vec3));
67 initSparse<Scalar>(density, refMat2, m2, ForceNonZeroDiag|MakeUpperTriangular, &zeroCoords, &nonzeroCoords);
69 m2.template marked<UpperTriangular>().transpose().solveTriangular(vec3));
75 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| /external/eigen/test/ |
| linearstructure.cpp | 26 m2 = MatrixType::Random(rows, cols), local
37 VERIFY_IS_APPROX(m1+m2-m1, m2);
38 VERIFY_IS_APPROX(-m2+m1+m2, m1);
40 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
41 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2);
42 m3 = m2; m3 += m1
[all...] |
| sparse_basic.cpp | 97 SparseMatrixType m2(rows,cols);
99 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
106 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>();
109 m2.finalize();
110 VERIFY_IS_APPROX(m2,m1);
117 SparseMatrixType m2(rows,cols);
119 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
125 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>()
[all...] |
| nomalloc.cpp | 39 m2 = MatrixType::Random(rows, cols), local
47 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
48 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c)));
50 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
52 m2.col(0).noalias() = m1 * m1.col(0);
53 m2.col(0).noalias() -= m1.adjoint() * m1.col(0);
54 m2.col(0).noalias() -= m1 * m1.row(0).adjoint()
[all...] |
| triangular.cpp | 26 m2 = MatrixType::Random(rows, cols), local
34 MatrixType m2up = m2.template triangularView<Upper>();
40 VERIFY(!m2.isLowerTriangular());
43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
55 m3 = m2.transpose() + m2;
60 m1.template triangularView<Lower>() = m2.transpose() + m2
134 m2 = MatrixType::Random(rows, cols), local
[all...] |
| inverse.cpp | 28 m2(rows, cols),
31 m2 = m1.inverse();
32 VERIFY_IS_APPROX(m1, m2.inverse() );
34 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
50 m2.setZero();
51 m1.computeInverseAndDetWithCheck(m2, det, invertible);
53 VERIFY_IS_APPROX(identity, m1*m2);
56 m2.setZero();
57 m1.computeInverseWithCheck(m2, invertible)
[all...] |
| integer_types.cpp | 31 m2 = MatrixType::Random(rows, cols), local
36 } while(m1 == mzero || m1 == m2);
46 VERIFY_IS_EQUAL(-m2+m1+m2, m1);
47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2);
67 m2 = MatrixType::Random(rows, cols), local
80 } while(m1 == mzero || m1 == m2);
103 VERIFY(m1!=m2);
104 VERIFY(!(m1==m2));
[all...] |
| diagonal.cpp | 24 m2 = MatrixType::Random(rows, cols); local
28 m2.diagonal() = 2 * m1.diagonal();
29 m2.diagonal()[0] *= 3;
48 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>();
49 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1));
50 m2.template diagonal<N1>()[0] *= 3;
51 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[0]);
54 m2.template diagonal<N2>() = 2 * m1.template diagonal<N2>();
55 m2.template diagonal<N2>()[0] *= 3;
56 VERIFY_IS_APPROX(m2.template diagonal<N2>()[0], static_cast<Scalar>(6) * m1.template diagonal<N2>()[0])
[all...] |
| product.h | 14 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1::RealScalar epsilon = NumTraits<typename Derived1::RealScalar>::dummy_precision())
16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon
17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff()));
41 m2 = MatrixType::Random(rows, cols), local
62 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
64 m3 *= m1.transpose() * m2;
65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
66 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
69 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2)
[all...] |
| product_syrk.cpp | 25 m2 = MatrixType::Random(rows, cols); local
35 m2.setZero();
36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
39 m2.setZero();
40 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(),
43 m2.setZero();
44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
47 m2.setZero();
48 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(),
51 m2.setZero()
[all...] |
| product_notemporary.cpp | 45 m2 = MatrixType::Random(rows, cols), local
60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1);
61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0);
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);
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0)
[all...] |
| /bionic/libc/bionic/ |
| memswap.c | 30 void memswap(void *m1, void *m2, size_t n)
34 char* q = m2;
|
| /external/icu4c/test/perf/ubrkperf/ |
| UBrkPerf.pl | 31 my $m2 = "-- -m word";
81 "TestForwardWord", ["$p1 $m2 TestICUForward", "$p2 $m2 TestICUForward", "$p3 $m2 TestICUForward"],
86 "TestIsBoundWord", ["$p1 $m2 TestICUIsBound", "$p2 $m2 TestICUIsBound", "$p3 $m2 TestICUIsBound"],
|
| UBrkPerf_r.pl | 30 my $m2 = "-- -m word";
73 "TestForwardWord", ["$p1 $m2 TestICUForward", "$p2 $m2 TestICUForward"],
78 "TestIsBoundWord", ["$p1 $m2 TestICUIsBound", "$p2 $m2 TestICUIsBound"],
|
| /ndk/sources/cxx-stl/llvm-libc++/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
| message.pass.cpp | 27 std::string m2 = e_cat2.message(5); local
30 assert(!m2.empty());
32 assert(m1 == m2);
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CameraTest.java | 47 Matrix m2 = new Matrix(); local
48 mCamera.getMatrix(m2);
49 assertFalse(m1.equals(m2));
52 m2.getValues(f);
69 Matrix m2 = new Matrix(); local
70 mCamera.getMatrix(m2);
71 assertFalse(m1.equals(m2));
74 m2.getValues(f);
91 Matrix m2 = new Matrix(); local
92 mCamera.getMatrix(m2);
113 Matrix m2 = new Matrix(); local
[all...] |
