/external/eigen/doc/examples/ |
H A D | class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) function 15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) function 23 cout << topLeftCorner(4*m, 2, 3) << endl; // calls the const version 24 topLeftCorner(m, 2, 3) *= 5; // calls the non-const version
|
H A D | Tutorial_BlockOperations_corner.cpp | 15 m.topLeftCorner(1,3) = m.bottomRightCorner(3,1).transpose();
|
H A D | TemplateKeyword_flexible.cpp | 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
/external/eigen/doc/snippets/ |
H A D | TopicAliasing_block.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2);
|
H A D | TopicAliasing_block_correct.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2).eval();
|
H A D | 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();
|
H A D | 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();
|
H A D | 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/unsupported/Eigen/src/NonLinearOptimization/ |
H A D | 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));
|
H A D | covar.h | 63 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
|
H A D | lmpar.h | 198 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank)); 220 qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1); 268 // qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
H A D | LevenbergMarquardt.h | 536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
|
/external/eigen/test/ |
H A D | 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))); 72 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template block<r,c>(0,0)));
|
/external/eigen/Eigen/src/plugins/ |
H A D | BlockMethods.h | 124 inline Block<Derived> topLeftCorner(Index cRows, Index cCols) function 129 /** This is the const version of topLeftCorner(Index, Index).*/ 130 inline const Block<const Derived> topLeftCorner(Index cRows, Index cCols) const function 145 inline Block<Derived, CRows, CCols> topLeftCorner() function 150 /** This is the const version of topLeftCorner<int, int>().*/ 152 inline const Block<const Derived, CRows, CCols> topLeftCorner() const function
|
/external/eigen/Eigen/src/Geometry/ |
H A D | Umeyama.h | 163 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
|
H A D | Transform.h | 1135 res.matrix().template topLeftCorner<Dim,Dim>() = linear().transpose(); 1139 res.matrix().template topLeftCorner<Dim,Dim>() = linear().inverse(); 1147 = - res.matrix().template topLeftCorner<Dim,Dim>() * translation();
|
/external/eigen/Eigen/src/LU/ |
H A D | FullPivLU.h | 604 m.topLeftCorner(rank(), rank()) 693 .topLeftCorner(smalldim,smalldim) 705 .topLeftCorner(nonzero_pivots, nonzero_pivots)
|
/external/eigen/Eigen/src/QR/ |
H A D | ColPivHouseholderQR.h | 479 .topLeftCorner(nonzero_pivots, nonzero_pivots) 487 .topLeftCorner(nonzero_pivots, nonzero_pivots)
|
H A D | HouseholderQR.h | 301 .topLeftCorner(rank, rank)
|
H A D | FullPivHouseholderQR.h | 503 .topLeftCorner(dec().rank(), dec().rank())
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | GMRES.h | 153 H.topLeftCorner(k, k).template triangularView < Eigen::Upper > ().solveInPlace(y);
|
/external/eigen/unsupported/test/ |
H A D | NonLinearOptimization.cpp | 234 cov = covfac*lm.fjac.topLeftCorner<n,n>(); 237 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref); 625 cov = covfac*lm.fjac.topLeftCorner<n,n>(); 628 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
|