| /external/eigen/test/ |
| product_notemporary.cpp | 44 ColMajorMatrixType m1 = 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)
[all...] |
| product_symm.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
29 m1 = (m1+m1.adjoint()).eval();
38 m2 = m1.template triangularView<Lower>();
40 VERIFY_IS_EQUAL(m1, m3);
42 rhs13 = (s1*m1) * (s2*rhs1));
44 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
46 VERIFY_IS_EQUAL(m1, m3);
48 rhs13 += (s1*m1) * (s2*rhs1))
[all...] |
| block.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
27 m1_copy = m1,
41 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1));
43 m1 = m1_copy;
44 m1.row(r1) += s1 * m1_copy.row(r2);
45 VERIFY_IS_APPROX(m1.row(r1), m1_copy.row(r1) + s1 * m1_copy.row(r2));
47 m1.row(r1).row(0) += s1 * m1_copy.row(r2);
48 VERIFY_IS_APPROX(m1.row(r1), m1_copy.row(r1) + Scalar(2) * s1 * m1_copy.row(r2));
49 m1 = m1_copy
196 MatrixType m1 = MatrixType::Random(rows, cols); local
[all...] |
| diagonalmatrices.cpp | 27 MatrixType m1 = MatrixType::Random(rows, cols), local
57 VERIFY_IS_APPROX( ((ldm1 * m1)(i,j)) , ldm1.diagonal()(i) * m1(i,j) );
58 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) );
59 VERIFY_IS_APPROX( ((m1 * rdm1)(i,j)) , rdm1.diagonal()(j) * m1(i,j) );
60 VERIFY_IS_APPROX( ((v1.asDiagonal() * m1)(i,j)) , v1(i) * m1(i,j) );
61 VERIFY_IS_APPROX( ((m1 * rv1.asDiagonal())(i,j)) , rv1(j) * m1(i,j) )
[all...] |
| lu.cpp | 57 MatrixType m1(rows, cols), m3(rows, cols2);
59 createRandomPIMatrixOfRank(rank, rows, cols, m1);
67 lu.compute(m1);
75 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u);
78 ImageMatrixType m1image = lu.image(m1);
80 VERIFY_IS_APPROX(m1, lu.reconstructedMatrix());
86 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1));
88 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image)
[all...] |
| qr_colpivoting.cpp | 25 MatrixType m1; local
26 createRandomPIMatrixOfRank(rank,rows,cols,m1);
27 ColPivHouseholderQR<MatrixType> qr(m1);
39 VERIFY_IS_APPROX(m1, c);
42 MatrixType m3 = m1*m2;
45 VERIFY_IS_APPROX(m3, m1*m2);
53 Matrix<Scalar,Rows,Cols> m1; local
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
55 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
64 VERIFY_IS_APPROX(m1, c)
[all...] |
| adjoint.cpp | 28 MatrixType m1 = MatrixType::Random(rows, cols), local
41 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1);
42 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1);
45 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1);
46 VERIFY_IS_APPROX((s1 * m1).adjoint(), internal::conj(s1) * m1.adjoint());
76 VERIFY_IS_APPROX(m1.conjugate()(r,c), internal::conj(m1(r,c)))
[all...] |
| product_syrk.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
61 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
64 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()),
65 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
68 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expression()),
69 ((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()))
[all...] |
| product_selfadjoint.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), local
39 m1 = (m1.adjoint() + m1).eval();
42 m2 = m1.template triangularView<Lower>();
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
46 m2 = m1.template triangularView<Upper>();
48 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+internal::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
50 m2 = m1.template triangularView<Upper>();
52 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + internal::conj(s1)*(r2.adjoint()*s3) * (-s2* (…)
[all...] |
| householder.cpp | 54 MatrixType m1(rows, cols),
59 m1.colwise() = v1;
60 m2 = m1;
61 m1.col(0).makeHouseholder(essential, beta, alpha);
62 m1.applyHouseholderOnTheLeft(essential,beta,tmp);
63 VERIFY_IS_APPROX(m1.norm(), m2.norm());
64 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm());
65 VERIFY_IS_MUCH_SMALLER_THAN(internal::imag(m1(0,0)), internal::real(m1(0,0)))
[all...] |
| qr_fullpivoting.cpp | 24 MatrixType m1; local
25 createRandomPIMatrixOfRank(rank,rows,cols,m1);
26 FullPivHouseholderQR<MatrixType> qr(m1);
43 VERIFY_IS_APPROX(m1, c);
46 MatrixType m3 = m1*m2;
49 VERIFY_IS_APPROX(m3, m1*m2);
59 MatrixType m1(size, size), m2(size, size), m3(size, size);
60 m1 = MatrixType::Random(size,size);
66 m1 += a * a.adjoint();
69 FullPivHouseholderQR<MatrixType> qr(m1);
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 29 MatrixType m1 = MatrixType::Random(rows, cols), local
44 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1);
45 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1);
48 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1);
49 VERIFY_IS_APPROX((s1 * m1).adjoint(), ei_conj(s1) * m1.adjoint());
69 VERIFY_IS_APPROX(m1.conjugate()(r,c), ei_conj(m1(r,c)))
[all...] |
| eigen2_triangular.cpp | 23 MatrixType m1 = MatrixType::Random(rows, cols), local
39 MatrixType m1up = m1.template part<Eigen::UpperTriangular>();
49 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
54 r1.template part<Eigen::UpperTriangular>() += m1;
59 m1.setZero();
60 m1.template part<Eigen::UpperTriangular>() = (m2.transpose() * m2).lazy();
62 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1);
65 m1.setZero();
66 m1.template part<Eigen::LowerTriangular>() = (m2.transpose() * m2).lazy();
67 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1);
118 Matrix2i m1 = Matrix2i::Zero(); local
[all...] |
| /external/eigen/doc/examples/ |
| class_CwiseBinaryOp.cpp | 15 Matrix4d m1 = Matrix4d::Random(), m2 = Matrix4d::Random(); local
16 cout << m1.binaryExpr(m2, MakeComplexOp<double>()) << endl;
|
| TemplateKeyword_flexible.cpp | 15 MatrixXi m1 = MatrixXi::Ones(5,5); local
19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
| TemplateKeyword_simple.cpp | 13 MatrixXf m1 = MatrixXf::Ones(4,4); local
17 copyUpperTriangularPart(m2, m1);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.lock/thread.lock.unique/thread.lock.unique.cons/ |
| copy_assign.fail.cpp | 20 std::mutex m1; variable
25 std::unique_lock<std::mutex> lk1(m1);
|
| move_assign.pass.cpp | 20 std::mutex m1; variable
26 std::unique_lock<std::mutex> lk1(m1);
|
| /external/openssl/crypto/des/ |
| ede_cbcm_enc.c | 82 register DES_LONG tout0,tout1,xor0,xor1,m0,m1; local
93 c2l(iv1,m1);
99 tin[1]=m1;
102 m1=tin[1];
120 tin[1]^=m1;
123 tin[1]^=m1;
133 l2c(m1,iv1);
144 c2l(iv1,m1);
150 tin[1]=m1;
153 m1=tin[1]
[all...] |
| /external/valgrind/main/none/tests/ |
| map_unmap.c | 60 void *m1, *m2; local
62 m1 = domap();
63 if (m1 != expect1) {
64 printf("FAIL i=%d: m1=%p expect1=%p\n",
65 i, m1, expect1);
77 munmap(m1, LEN);
|
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CameraTest.java | 43 Matrix m1 = new Matrix(); local
44 preCompare(m1);
49 assertFalse(m1.equals(m2));
65 Matrix m1 = new Matrix(); local
66 preCompare(m1);
71 assertFalse(m1.equals(m2));
87 Matrix m1 = new Matrix(); local
88 preCompare(m1);
93 assertFalse(m1.equals(m2));
109 Matrix m1 = new Matrix() local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| TemplateSubPatternAssociation.java | 117 * @param m1 mode to match
121 boolean matchMode(QName m1)
123 return matchModes(m1, m_template.getMode());
129 * @param m1 First mode to match
134 private boolean matchModes(QName m1, QName m2)
136 return (((null == m1) && (null == m2))
137 || ((null != m1) && (null != m2) && m1.equals(m2)));
|
| /external/eigen/bench/ |
| sparse_product.cpp | 119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols);
120 eiToDense(sm1, m1);
126 m3 = m1 * m2;
133 m3 = m1.transpose() * m2;
140 m3 = m1.transpose() * m2.transpose();
147 m3 = m1 * m2.transpose();
188 DynamicSparseMatrix<Scalar> m1(sm1), m2(sm2), m3(sm3);
189 std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/(float(m1.rows())*float(m1.cols()))*100 << "% *
228 cs *m1, *m2, *m3; local
[all...] |
| /external/clang/test/SemaCXX/ |
| function-type-qual.cpp | 16 void m1() { function in class:C
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 41 void MatrixXd_add (const struct C_MatrixXd *m1,
44 void MatrixXd_multiply (const struct C_MatrixXd *m1,
62 void Map_MatrixXd_add (const struct C_Map_MatrixXd *m1,
65 void Map_MatrixXd_multiply (const struct C_Map_MatrixXd *m1,
|
