/external/eigen/doc/examples/ |
H A D | Tutorial_simple_example_fixed_size.cpp | 8 Matrix3f m3; local 9 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 13 std::cout << "m3\n" << m3 << "\nm4:\n"
|
/external/eigen/test/ |
H A D | commainitializer.cpp | 14 Matrix3d m3; local 17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); 20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); 26 m3 = Matrix3d::Random(); 27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 28 VERIFY_IS_APPROX(m3, ref ); 34 m3 = Matrix3d::Random(); 35 m3 << vec[0], vec[1], vec[2]; 36 VERIFY_IS_APPROX(m3, ref); 41 m3 [all...] |
H A D | inverse.cpp | 65 MatrixType m3 = v3*v3.transpose(), m4(rows,cols); local 66 m3.computeInverseAndDetWithCheck(m4, det, invertible); 68 VERIFY_IS_MUCH_SMALLER_THAN(abs(det-m3.determinant()), RealScalar(1)); 69 m3.computeInverseWithCheck(m4, invertible);
|
H A D | swap.cpp | 37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols); local 41 OtherMatrixType m3_copy = m3; 51 m1.swap(m3); 53 VERIFY_IS_APPROX(m3,m1_copy); 55 m3 = m3_copy; 65 m1.transpose().swap(m3.transpose()); 67 VERIFY_IS_APPROX(m3,m1_copy); 69 m3 = m3_copy;
|
H A D | product_symm.cpp | 25 m2 = MatrixType::Random(rows, cols), m3; local 37 m3 = m2.template selfadjointView<Lower>(); 38 VERIFY_IS_EQUAL(m1, m3); 43 m3 = m2.template selfadjointView<Upper>(); 44 VERIFY_IS_EQUAL(m1, m3);
|
H A D | product_selfadjoint.cpp | 26 m3; local 57 m3 = m1; 58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint(); 59 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
|
H A D | product_syrk.cpp | 26 m3 = MatrixType::Random(rows, cols); local 87 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * m3.col(c) * m1.col(c).adjoint()).nestedExpression(), 88 ((s1 * m3.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix())); 90 VERIFY_IS_APPROX((rm2.template triangularView<Upper>() += s1 * m1.col(c) * m3.col(c).adjoint()).nestedExpression(), 91 ((s1 * m1.col(c) * m3.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix())); 109 VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).nestedExpression(), 110 ((s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 112 VERIFY_IS_APPROX((rm2.template triangularView<Lower>() += s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).nestedExpression(), 113 ((s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
|
H A D | qr.cpp | 47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; local 49 m2 = qr.solve(m3); 50 VERIFY_IS_APPROX(m3, m1*m2); 62 MatrixType m1(size, size), m2(size, size), m3(size, size); 73 m3 = MatrixType::Random(size,size); 74 m2 = qr.solve(m3); 75 VERIFY_IS_APPROX(m3, m1*m2); 81 m3 = qr.householderQ(); // get a unitary 82 m1 = m3 * m1 * m3; [all...] |
H A D | qr_colpivoting.cpp | 40 MatrixType m3 = m1*m2; local 42 m2 = qr.solve(m3); 43 VERIFY_IS_APPROX(m3, m1*m2); 65 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; local 67 m2 = qr.solve(m3); 68 VERIFY_IS_APPROX(m3, m1*m2); 80 MatrixType m1(size, size), m2(size, size), m3(size, size); 91 m3 = MatrixType::Random(size,size); 92 m2 = qr.solve(m3); 93 //VERIFY_IS_APPROX(m3, m [all...] |
H A D | qr_fullpivoting.cpp | 45 MatrixType m3 = m1*m2; local 47 m2 = qr.solve(m3); 48 VERIFY_IS_APPROX(m3, m1*m2); 60 MatrixType m1(size, size), m2(size, size), m3(size, size); 75 m3 = MatrixType::Random(size,size); 76 m2 = qr.solve(m3); 77 VERIFY_IS_APPROX(m3, m1*m2); 83 m3 = qr.matrixQ(); // get a unitary 84 m1 = m3 * m1 * m3; [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_commainitializer.cpp | 14 Matrix3d m3; local 17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); 20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); 26 m3 = Matrix3d::Random(); 27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 28 VERIFY_IS_APPROX(m3, ref ); 34 m3 = Matrix3d::Random(); 35 m3 << vec[0], vec[1], vec[2]; 36 VERIFY_IS_APPROX(m3, ref); 41 m3 [all...] |
H A D | eigen2_swap.cpp | 37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols); local 41 OtherMatrixType m3_copy = m3; 51 m1.swap(m3); 53 VERIFY_IS_APPROX(m3,m1_copy); 55 m3 = m3_copy; 65 m1.transpose().swap(m3.transpose()); 67 VERIFY_IS_APPROX(m3,m1_copy); 69 m3 = m3_copy;
|
H A D | eigen2_triangular.cpp | 25 m3(rows, cols), 61 m3 = m2.transpose() * m2; 62 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1); 67 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1); 69 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal()); 77 m3 = m1.template part<Eigen::LowerTriangular>(); 78 VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>())); 79 VERIFY(m3 132 Matrix2i m3 = Matrix2i::Zero(); local [all...] |
/external/libcxx/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
H A D | message.pass.cpp | 28 std::string m3 = e_cat2.message(6); local 31 assert(!m3.empty()); 33 assert(m1 != m3);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | MessageBusTest.cpp | 35 const TestMessage m3 = { 1, 0.3f }; local 36 SkMessageBus<TestMessage>::Post(m3);
|
/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | mirror-promises.js | 87 var m3 = debug.MakeMirror(new Promise(function(resolve, reject) { })); variable 88 ip = m3.internalProperties();
|
/external/eigen/doc/ |
H A D | tutorial.cpp | 8 Eigen::Matrix3f m3 = Eigen::Matrix3f::Random(); local 11 std::cout << "*** Step 1 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 15 m3.diagonal().setOnes(); 17 std::cout << "*** Step 2 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 20 m4.block<3,3>(0,1) = m3; 21 m3.row(2) = m4.block<1,3>(2,0); 23 std::cout << "*** Step 3 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 39 m3 = m3.cwise().cos(); 40 std::cout << "*** Step 6 ***\nm3:\n" << m3 << "\nm [all...] |
/external/skia/tests/ |
H A D | MessageBusTest.cpp | 35 const TestMessage m3 = { 1, 0.3f }; local 36 SkMessageBus<TestMessage>::Post(m3);
|
/external/clang/test/Lexer/ |
H A D | constants.c | 36 int m3 = '\\\ variable
|
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 52 DenseMatrix m1(rows,cols), m3(rows,cols); 54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) 70 cs *m1, *m3; local 73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) 82 GmmSparse m1(rows,cols), m3(rows,cols); 84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) 92 MtlSparse m1(rows,cols), m3(rows,cols); 94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);)
|
H A D | sparse_product.cpp | 119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols); 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); 194 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1 * m2;) 207 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose() * m2;) 213 BENCH( for (int k=0; k<REPEAT; ++k) m3 = m1.transpose() * m2.transpose(); ) 219 BENCH( for (int k=0; k<REPEAT; ++k) m3 228 cs *m1, *m2, *m3; local [all...] |
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p12.cpp | 67 auto m3 = [this,m] { // expected-note 3{{lambda expression begins here}} local
|
/external/clang/test/Preprocessor/ |
H A D | pragma_diagnostic_sections.cpp | 12 void m3() { int b; while (b==b); } // expected-warning {{always evaluates to true}} function in struct:S
|
/external/eigen/unsupported/test/ |
H A D | matrix_power.cpp | 86 MatrixType m1, m2, m3, m4, m5; local 96 m3 = mpow(y); 99 m5.noalias() = m2 * m3; 107 m5 = std::pow(std::abs(x), y) * m3;
|
/external/clang/test/Headers/ |
H A D | stddefneeds.cpp | 34 max_align_t m3; // expected-error{{unknown}} variable
|