| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
23 cout << topLeftCorner(4*m, 2, 3) << endl; // calls the const version
24 topLeftCorner(m, 2, 3) *= 5; // calls the non-const version
|
| Tutorial_BlockOperations_corner.cpp | 15 m.topLeftCorner(1,3) = m.bottomRightCorner(3,1).transpose();
|
| TemplateKeyword_flexible.cpp | 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
| function_taking_ref.cpp | 17 cout << "inv_cond(m(1:3,1:3)): " << inv_cond(m.topLeftCorner(3,3)) << endl;
|
| /external/eigen/doc/snippets/ |
| TopicAliasing_block.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2);
|
| TopicAliasing_block_correct.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2).eval();
|
| MatrixBase_template_int_int_topLeftCorner.cpp | 3 cout << "Here is m.topLeftCorner<2,2>():" << endl;
4 cout << m.topLeftCorner<2,2>() << endl;
5 m.topLeftCorner<2,2>().setZero();
|
| MatrixBase_template_int_int_topLeftCorner_int_int.cpp | 3 cout << "Here is m.topLeftCorner<2,Dynamic>(2,2):" << endl;
4 cout << m.topLeftCorner<2,Dynamic>(2,2) << endl;
5 m.topLeftCorner<2,Dynamic>(2,2).setZero();
|
| MatrixBase_topLeftCorner_int_int.cpp | 3 cout << "Here is m.topLeftCorner(2, 2):" << endl;
4 cout << m.topLeftCorner(2, 2) << endl;
5 m.topLeftCorner(2, 2).setZero();
|
| Tutorial_AdvancedInitialization_ThreeWays.cpp | 3 mat1.topLeftCorner(size/2, size/2) = MatrixXd::Zero(size/2, size/2);
10 mat2.topLeftCorner(size/2, size/2).setZero();
|
| /external/eigen/test/ |
| corners.cpp | 28 COMPARE_CORNER(topLeftCorner(r,c), block(0,0,r,c));
60 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template block<r,c>(0,0)));
65 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<r,Dynamic>(r,c)));
70 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<Dynamic,c>(r,c)));
82 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template block<r,c>(0,0)));
87 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template topLeftCorner<r,Dynamic>(r,c)));
92 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template topLeftCorner<Dynamic,c>(r,c)))
[all...] |
| inverse.cpp | 76 m5.topLeftCorner(rows,rows) = m1;
77 m2 = m5.template topLeftCorner<MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime>().inverse();
78 VERIFY_IS_APPROX( (m5.template topLeftCorner<MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime>()), m2.inverse() );
|
| commainitializer.cpp | 28 VERIFY_IS_EQUAL((m_fixed.template topLeftCorner<M1,N1>()), mat11);
|
| product_small.cpp | 196 C.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>());
197 R.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>()).eval();
207 C.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()) * A.template topLeftCorner<M,1>();
208 R.noalias() = (B.template leftCols<M>()+B.template rightCols<M>()).eval() * A.template topLeftCorner<M,1>();
|
| diagonalmatrices.cpp | 111 Matrix2d tmp2 = points.topLeftCorner<2,2>();
112 VERIFY_IS_APPROX(( res1 = points.topLeftCorner<2,2>()*diag.asDiagonal()) , res2 = tmp2*diag.asDiagonal() );
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 35 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
|
| covar.h | 64 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
|
| lmpar.h | 202 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
224 qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
272 // qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 76 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
|
| LMqrsolv.h | 48 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
91 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
178 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
|
| LMpar.h | 65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
87 s.topLeftCorner(n,n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
| /external/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 152 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
158 Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean;
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 686 m.topLeftCorner(rank(), rank())
775 m_lu.topLeftCorner(smalldim,smalldim)
782 m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
826 m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
831 m_lu.topLeftCorner(smalldim, smalldim)
837 m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots)
842 m_lu.topLeftCorner(smalldim, smalldim)
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 267 A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint();
268 A11.noalias() -= X.topLeftCorner(brows,bs).bottomRows(brows-bs) * A01;
349 X.topLeftCorner(brows,bs),
350 Y.topLeftCorner(bcols,bs)
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 111 Matrix<double, 6, 6> DM_fix_ab = kroneckerProduct(DM_a.topLeftCorner<2,3>(),DM_b);
114 CALL_SUBTEST(check_kronecker_product(kroneckerProduct(DM_a.topLeftCorner<2,3>(),DM_b)));
|
