HomeSort by relevance Sort by last modified time
    Searched defs:m3 (Results 1 - 25 of 78) sorted by null

1 2 3 4

  /external/eigen/doc/examples/
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"
  /art/test/ProtoCompare/
ProtoCompare.java 20 int m3(long x, int y, short z) { return (int)x + y + z; } method in class:ProtoCompare
  /art/test/ProtoCompare2/
ProtoCompare2.java 20 int m3(long x, int y, short z) { return (int)x + y + z; } method in class:ProtoCompare2
  /external/eigen/doc/
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 << "\nm4:\n" << m4 << std::endl
    [all...]
  /external/eigen/test/
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 = Matrix3d::Random()
    [all...]
inverse.cpp 63 MatrixType m3 = v3*v3.transpose(), m4(rows,cols); local
64 m3.computeInverseAndDetWithCheck(m4, det, invertible);
66 VERIFY_IS_MUCH_SMALLER_THAN(internal::abs(det-m3.determinant()), RealScalar(1));
67 m3.computeInverseWithCheck(m4, invertible);
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;
product_symm.cpp 27 m2 = MatrixType::Random(rows, cols), m3; local
39 m3 = m2.template selfadjointView<Lower>();
40 VERIFY_IS_EQUAL(m1, m3);
45 m3 = m2.template selfadjointView<Upper>();
46 VERIFY_IS_EQUAL(m1, m3);
product_selfadjoint.cpp 27 m3; local
58 m3 = m1;
59 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();
60 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
qr.cpp 48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; local
50 m2 = qr.solve(m3);
51 VERIFY_IS_APPROX(m3, m1*m2);
61 MatrixType m1(size, size), m2(size, size), m3(size, size);
72 m3 = MatrixType::Random(size,size);
73 m2 = qr.solve(m3);
74 VERIFY_IS_APPROX(m3, m1*m2);
80 m3 = qr.householderQ(); // get a unitary
81 m1 = m3 * m1 * m3;
    [all...]
qr_colpivoting.cpp 42 MatrixType m3 = m1*m2; local
44 m2 = qr.solve(m3);
45 VERIFY_IS_APPROX(m3, m1*m2);
67 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; local
69 m2 = qr.solve(m3);
70 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, m1*m2)
    [all...]
qr_fullpivoting.cpp 46 MatrixType m3 = m1*m2; local
48 m2 = qr.solve(m3);
49 VERIFY_IS_APPROX(m3, m1*m2);
59 MatrixType m1(size, size), m2(size, size), m3(size, size);
74 m3 = MatrixType::Random(size,size);
75 m2 = qr.solve(m3);
76 VERIFY_IS_APPROX(m3, m1*m2);
82 m3 = qr.matrixQ(); // get a unitary
83 m1 = m3 * m1 * m3;
    [all...]
  /external/eigen/test/eigen2/
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 = Matrix3d::Random()
    [all...]
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;
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.transpose().template marked<Eigen::UpperTriangular>(
132 Matrix2i m3 = Matrix2i::Zero(); local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/
message.pass.cpp 28 std::string m3 = e_cat2.message(6); local
31 assert(!m3.empty());
33 assert(m1 != m3);
  /external/skia/tests/
MessageBusTest.cpp 39 const TestMessage m3 = { 1, 0.3f }; local
40 SkMessageBus<TestMessage>::Post(m3);
  /external/clang/test/Lexer/
constants.c 36 int m3 = '\\\ variable
  /external/eigen/bench/
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);)
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 = m1 * m2.transpose();
228 cs *m1, *m2, *m3; local
    [all...]
  /external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
p12.cpp 67 auto m3 = [this,m] { // expected-note 3{{lambda expression begins here}} local
  /external/clang/test/Preprocessor/
pragma_diagnostic_sections.cpp 12 void m3() { int b; while (b==b); } // expected-warning {{always evaluates to true}} function in struct:S
  /external/chromium/chrome/browser/autocomplete/
history_contents_provider_unittest.cc 157 const ACMatches& m3 = matches(); local
158 EXPECT_EQ(2U, m3.size());
193 const ACMatches& m3 = matches(); local
194 ASSERT_EQ(2U, m3.size());
195 if (bookmark_url == m3[0].destination_url) {
196 EXPECT_EQ("http://www.google.com/3", m3[1].destination_url.spec());
198 EXPECT_EQ(bookmark_url, m3[1].destination_url);
199 EXPECT_EQ("http://www.google.com/3", m3[0].destination_url.spec());
  /external/jmonkeyengine/engine/src/core/com/jme3/shader/
Uniform.java 275 Matrix3f m3 = (Matrix3f) value; local
279 m3.fillFloatBuffer(multiData, true);
  /cts/suite/cts/deviceTests/opengl/test/
MatrixTest.cpp 113 Matrix m3; local
117 m3.multiply(m1, m2);
119 ASSERT_TRUE(m3.equals(m1));
126 m3.multiply(m1, m2);
134 checkValues(m3.mData, expected, Matrix::MATRIX_SIZE);

Completed in 333 milliseconds

1 2 3 4