/external/eigen/doc/snippets/ |
H A D | IOFormat.cpp | 2 Matrix3d m1; variable 3 m1 << 1.111111, 2, 3.33333, 4, 5, 6, 7, 8.888888, 9; 10 std::cout << m1 << sep; 11 std::cout << m1.format(CommaInitFmt) << sep; 12 std::cout << m1.format(CleanFmt) << sep; 13 std::cout << m1.format(OctaveFmt) << sep; 14 std::cout << m1.format(HeavyFmt) << sep;
|
H A D | MatrixBase_set.cpp | 1 Matrix3i m1; variable 2 m1 << 1, 2, 3, 5 cout << m1 << endl << endl; 12 v1, m1.block(1,1,2,2);
|
/external/eigen/doc/examples/ |
H A D | class_CwiseUnaryOp_ptrfun.cpp | 17 Matrix4d m1 = Matrix4d::Random(); local 18 cout << m1 << endl << "becomes: " << endl << m1.unaryExpr(ptr_fun(ramp)) << endl;
|
H A D | TemplateKeyword_flexible.cpp | 15 MatrixXi m1 = MatrixXi::Ones(5,5); local 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
H A D | TemplateKeyword_simple.cpp | 13 MatrixXf m1 = MatrixXf::Ones(4,4); local 17 copyUpperTriangularPart(m2, m1);
|
H A D | class_CwiseBinaryOp.cpp | 15 Matrix4d m1 = Matrix4d::Random(), m2 = Matrix4d::Random(); local 16 cout << m1.binaryExpr(m2, MakeComplexOp<double>()) << endl;
|
H A D | class_CwiseUnaryOp.cpp | 16 Matrix4d m1 = Matrix4d::Random(); local 17 cout << m1 << endl << "becomes: " << endl << m1.unaryExpr(CwiseClampOp<double>(-0.5,0.5)) << endl;
|
/external/clang/test/CodeGenCXX/ |
H A D | default-constructor-for-members.cpp | 19 M m1; local
|
H A D | constructor-for-array-members.cpp | 38 M m1; local 39 m1.pr();
|
/external/valgrind/main/helgrind/tests/ |
H A D | hg02_deadlock.c | 4 static pthread_mutex_t m1 = PTHREAD_MUTEX_INITIALIZER; variable 9 pthread_mutex_lock(&m1); 11 pthread_mutex_unlock(&m1); 20 pthread_mutex_lock(&m1); 21 pthread_mutex_unlock(&m1); 32 pthread_mutex_lock(&m1); 33 pthread_mutex_unlock(&m1);
|
/external/clang/test/Lexer/ |
H A D | constants.c | 34 int m1 = '\\\''; // expected-warning {{multi-character character constant}} variable
|
/external/clang/test/SemaCXX/ |
H A D | function-type-qual.cpp | 16 void m1() { function in class:C
|
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 52 DenseMatrix m1(rows,cols), m3(rows,cols); 53 eiToDense(sm1, m1); 54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) 70 cs *m1, *m3; local 71 eiToCSparse(sm1, m1); 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); 83 eiToGmm(sm1, m1); 84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) 92 MtlSparse m1(row [all...] |
/external/eigen/test/ |
H A D | diagonal.cpp | 23 MatrixType m1 = MatrixType::Random(rows, cols), local 27 VERIFY_IS_APPROX(m1.diagonal(), m1.transpose().diagonal()); 28 m2.diagonal() = 2 * m1.diagonal(); 39 if(m1.template diagonal<N1>().RowsAtCompileTime!=Dynamic) 41 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N1).size()); 43 if(m1.template diagonal<N2>().RowsAtCompileTime!=Dynamic) 45 VERIFY(m1.template diagonal<N2>().RowsAtCompileTime == m1 [all...] |
H A D | eigen2support.cpp | 22 MatrixType m1 = MatrixType::Random(rows, cols), local 29 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise()); 30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1); 31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) ); 32 m3 = m1; 34 VERIFY_IS_APPROX(m3, m1 [all...] |
H A D | linearstructure.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), local 35 VERIFY_IS_APPROX(-(-m1), m1); 36 VERIFY_IS_APPROX(m1+m1, 2*m1); 37 VERIFY_IS_APPROX(m1+m2-m1, m2); 38 VERIFY_IS_APPROX(-m2+m1+m2, m1); [all...] |
H A D | miscmatrices.cpp | 26 MatrixType m1 = MatrixType::Ones(rows,cols); local 27 VERIFY_IS_APPROX(m1(r,c), static_cast<Scalar>(1));
|
H A D | product_large.cpp | 47 std::ptrdiff_t m1 = internal::random<int>(10,100)*16; local 50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
|
H A D | product_trmv.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local 30 m1 = MatrixType::Random(rows, cols); 33 m3 = m1.template triangularView<Eigen::Lower>(); 34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); 35 m3 = m1.template triangularView<Eigen::Upper>(); 36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); 37 m3 = m1.template triangularView<Eigen::UnitLower>(); 38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); 39 m3 = m1.template triangularView<Eigen::UnitUpper>(); 40 VERIFY((m3 * v1).isApprox(m1 [all...] |
H A D | selfadjoint.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local 27 m1.diagonal() = m1.diagonal().real().template cast<Scalar>(); 30 m3 = m1.template selfadjointView<Upper>(); 31 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); 35 m3 = m1.template selfadjointView<Lower>(); 36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
|
/external/eigen/test/eigen2/ |
H A D | eigen2_inverse.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local 31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8) 33 m1 = MatrixType::Random(rows, cols); 36 m2 = m1.inverse(); 37 VERIFY_IS_APPROX(m1, m2.inverse() ); 39 m1.computeInverse(&m2); 40 VERIFY_IS_APPROX(m1, m2.inverse() ); 44 VERIFY_IS_APPROX(identity, m1.inverse() * m1 ); 45 VERIFY_IS_APPROX(identity, m1 * m [all...] |
H A D | eigen2_linearstructure.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local 37 VERIFY_IS_APPROX(-(-m1), m1); 38 VERIFY_IS_APPROX(m1+m1, 2*m1); 39 VERIFY_IS_APPROX(m1+m2-m1, m2); 40 VERIFY_IS_APPROX(-m2+m1+m2, m1); [all...] |
H A D | eigen2_miscmatrices.cpp | 26 MatrixType m1 = MatrixType::Ones(rows,cols); local 27 VERIFY_IS_APPROX(m1(r,c), static_cast<Scalar>(1));
|
H A D | eigen2_sum.cpp | 19 MatrixType m1 = MatrixType::Random(rows, cols); local 24 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) x += m1(i,j); 25 VERIFY_IS_APPROX(m1.sum(), x);
|
H A D | eigen2_swap.cpp | 35 MatrixType m1 = MatrixType::Random(rows,cols); local 39 MatrixType m1_copy = m1; 44 m1.swap(m2); 45 VERIFY_IS_APPROX(m1,m2_copy); 47 m1 = m1_copy; 51 m1.swap(m3); 52 VERIFY_IS_APPROX(m1,m3_copy); 54 m1 = m1_copy; 58 m1.swap(m2.block(0,0,rows,cols)); 59 VERIFY_IS_APPROX(m1,m2_cop [all...] |