| /external/eigen/doc/snippets/ |
| D | MatrixBase_topRows_int.cpp | 4 cout << a.topRows(2) << endl;
5 a.topRows(2).setZero();
|
| D | MatrixBase_template_int_topRows.cpp | 4 cout << a.topRows<2>() << endl;
5 a.topRows<2>().setZero();
|
| /external/eigen/test/ |
| D | diagonalmatrices.cpp | 71 DynMatrixType tmp = m1.topRows(rows/2), res; in diagonalmatrices()
72 VERIFY_IS_APPROX( (res = m1.topRows(rows/2) * rv1.asDiagonal()), tmp * rv1.asDiagonal() ); in diagonalmatrices()
73 …VERIFY_IS_APPROX( (res = v1.head(rows/2).asDiagonal()*m1.topRows(rows/2)), v1.head(rows/2).asDiago… in diagonalmatrices()
109 Matrix2Xd tmp1 = points.topRows<2>(), res1, res2; in bug987()
110 …VERIFY_IS_APPROX( res1 = diag.asDiagonal() * points.topRows<2>(), res2 = diag.asDiagonal() * tmp1 … in bug987()
|
| D | inplace_decomposition.cpp | 33 A.topRows(cols) = A.topRows(cols).adjoint() * A.topRows(cols); in inplace()
|
| D | corners.cpp | 38 COMPARE_CORNER(topRows(r), block(0,0,r,cols)); in corners()
75 VERIFY_IS_EQUAL((matrix.template topRows<r>()), (matrix.template block<r,cols>(0,0))); in corners_fixedsize()
97 VERIFY_IS_EQUAL((const_matrix.template topRows<r>()), (const_matrix.template block<r,cols>(0,0))); in corners_fixedsize()
|
| D | product_small.cpp | 196 …C.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>(… in test_linear_but_not_vectorizable()
197 …R.noalias() = A.template topLeftCorner<1,M>() * (B.template topRows<M>()+B.template bottomRows<M>(… in test_linear_but_not_vectorizable()
|
| D | nomalloc.cpp | 228 CALL_SUBTEST_8(Ref<MatrixXd> R2 = M1.topRows<2>(); test_reference(R2)); in test_nomalloc()
|
| D | product.h | 207 VERIFY_IS_APPROX(m1.col(c) * m1.topRows(1), m1.block(0,c,rows,1) * m1.block(0,0,1,cols)); in product()
|
| /external/eigen/Eigen/src/LU/ |
| D | FullPivLU.h | 603 * m_lu.topRows(smalldim)
777 .solveInPlace(c.topRows(smalldim));
779 c.bottomRows(rows-cols) -= m_lu.bottomRows(rows-cols) * c.topRows(cols);
784 .solveInPlace(c.topRows(nonzero_pivots));
829 .solveInPlace(c.topRows(nonzero_pivots));
834 .solveInPlace(c.topRows(smalldim));
840 .solveInPlace(c.topRows(nonzero_pivots));
845 .solveInPlace(c.topRows(smalldim));
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | RealQZ.h | 253 m_T.topRows(i).applyOnTheRight(i,i-1,G); in hessenbergTriangular()
343 m_S.topRows(i+2).applyOnTheRight(i+1,i,G); in splitOffTwoRows()
344 m_T.topRows(i+2).applyOnTheRight(i+1,i,G); in splitOffTwoRows()
380 m_S.topRows(zz+2).applyOnTheRight(zz, zz-1,G); in pushDownZero()
381 m_T.topRows(zz+1).applyOnTheRight(zz, zz-1,G); in pushDownZero()
501 tmp = m_S.template middleCols<2>(k).topRows(lr) * essential2; in step()
504 m_S.template middleCols<2>(k).topRows(lr) -= (tau*tmp) * essential2.adjoint(); in step()
506 tmp = m_T.template middleCols<2>(k).topRows(lr) * essential2; in step()
509 m_T.template middleCols<2>(k).topRows(lr) -= (tau*tmp) * essential2.adjoint(); in step()
|
| D | ComplexSchur.h | 435 m_matT.topRows((std::min)(il+2,iu)+1).applyOnTheRight(il, il+1, rot);
443 m_matT.topRows((std::min)(i+2,iu)+1).applyOnTheRight(i, i+1, rot);
|
| /external/eigen/Eigen/src/Core/ |
| D | Reverse.h | 154 topRows(half).swap(bottomRows(half).reverse());
175 xpr.topRows(half).swap(xpr.bottomRows(half).colwise().reverse());
|
| /external/eigen/Eigen/src/QR/ |
| D | HouseholderQR.h | 365 .solveInPlace(c.topRows(rank)); in _solve_impl()
367 dst.topRows(rank) = c.topRows(rank); in _solve_impl()
|
| D | CompleteOrthogonalDecomposition.h | 510 dst.topRows(rank) = matrixT()
513 .solve(c.topRows(rank));
|
| D | ColPivHouseholderQR.h | 607 .solveInPlace(c.topRows(nonzero_pivots));
|
| D | FullPivHouseholderQR.h | 569 .solveInPlace(c.topRows(l_rank));
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 206 …y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve…
210 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
211 else dest = y.topRows(cols());
|
| /external/eigen/Eigen/src/plugins/ |
| D | BlockMethods.h | 432 inline RowsBlockXpr topRows(Index n) in topRows() function
439 inline ConstRowsBlockXpr topRows(Index n) const in topRows() function
461 inline typename NRowsBlockXpr<N>::Type topRows(Index n = N)
469 inline typename ConstNRowsBlockXpr<N>::Type topRows(Index n = N) const
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| D | SuiteSparseQRSupport.h | 163 …y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.to…
|
| /external/eigen/doc/ |
| D | TutorialBlockOperations.dox | 143 \link DenseBase::topRows() * \endlink</td>
145 matrix.topRows(q);\endcode </td>
147 matrix.topRows<q>();\endcode </td>
|
| D | AsciiQuickReference.txt | 70 P.topRows<rows>() // P(1:rows, :)
71 P.topRows(rows) // P(1:rows, :)
|
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU_SupernodalMatrix.h | 279 work.topRows(nrow).noalias() = A * U; in solveInPlace()
|
| /external/eigen/Eigen/src/Geometry/ |
| D | Homogeneous.h | 361 …dst.template topRows<ArgType::RowsAtCompileTime>(src.nestedExpression().rows()) = src.nestedExpres…
419 …: Base( xpr.lhs().nestedExpression() .lazyProduct( xpr.rhs().template topRows<helper::Dim>(xpr.l…
|
| D | Transform.h | 887 m_matrix.template topRows<Dim>() *= s;
1470 res.matrix().template topRows<Dim>().noalias()
1471 = other * tr.matrix().template topRows<Dim>();
1518 res.matrix().template topRows<Dim>() = lhs.matrix() * rhs.matrix();
|
| /external/eigen/Eigen/src/SVD/ |
| D | BDCSVD.h | 276 m_computed.topRows(m_diagSize) = bid.bidiagonal().toDenseMatrix().transpose();
369 A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1);
370 A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
|