Home
last modified time | relevance | path

Searched refs:topRows (Results 1 – 20 of 20) sorted by relevance

/external/eigen/doc/snippets/
DMatrixBase_template_int_topRows.cpp4 cout << a.topRows<2>() << endl;
5 a.topRows<2>().setZero();
DMatrixBase_topRows_int.cpp4 cout << a.topRows(2) << endl;
5 a.topRows(2).setZero();
/external/eigen/Eigen/src/Eigenvalues/
DRealQZ.h253 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()
DComplexSchur.h432 m_matT.topRows((std::min)(il+2,iu)+1).applyOnTheRight(il, il+1, rot);
440 m_matT.topRows((std::min)(i+2,iu)+1).applyOnTheRight(i, i+1, rot);
DRealSchur.h387 m_matT.topRows(iu+1).applyOnTheRight(iu-1, iu, rot); in splitOffTwoRows()
/external/eigen/Eigen/src/SPQRSupport/
DSuiteSparseQRSupport.h154 …y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y.top…
157 dest.topRows(cols()) = colsPermutation() * y.topRows(cols());
/external/eigen/test/
Dcorners.cpp38 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()
Dproduct.h149 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/QR/
DHouseholderQR.h328 .solveInPlace(c.topRows(rank));
330 dst.topRows(rank) = c.topRows(rank);
DColPivHouseholderQR.h549 .solveInPlace(c.topRows(nonzero_pivots));
DFullPivHouseholderQR.h524 .solveInPlace(c.topRows(dec().rank()));
/external/eigen/Eigen/src/LU/
DFullPivLU.h527 * m_lu.topRows(smalldim) in reconstructedMatrix()
702 .solveInPlace(c.topRows(smalldim));
707 * c.topRows(cols);
714 .solveInPlace(c.topRows(nonzero_pivots));
/external/eigen/Eigen/src/plugins/
DBlockMethods.h380 inline RowsBlockXpr topRows(Index n) in topRows() function
386 inline ConstRowsBlockXpr topRows(Index n) const in topRows() function
405 inline typename NRowsBlockXpr<N>::Type topRows(Index n = N)
412 inline typename ConstNRowsBlockXpr<N>::Type topRows(Index n = N) const
/external/eigen/Eigen/src/SparseQR/
DSparseQR.h179 …y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve…
183 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
184 else dest = y.topRows(cols());
/external/eigen/doc/
DTutorialBlockOperations.dox143 \link DenseBase::topRows() * \endlink</td>
145 matrix.topRows(q);\endcode </td>
147 matrix.topRows<q>();\endcode </td>
DAsciiQuickReference.txt68 P.topRows<rows>() // P(1:rows, :)
69 P.topRows(rows) // P(1:rows, :)
DQuickReference.dox505 mat1.topRows(rows)
510 mat1.topRows<rows>()
DA05_PortingFrom2To3.dox77 Notice that Eigen3 also provides these new convenience methods: topRows(), bottomRows(), leftCols()…
/external/skia/src/utils/
DSkTextureCompressor_R11EAC.cpp354 static inline uint64_t interleave6(uint64_t topRows, uint64_t bottomRows) { in interleave6() argument
383 uint64_t x = (static_cast<uint64_t>(topRows) << 32) | static_cast<uint64_t>(bottomRows); in interleave6()
/external/eigen/Eigen/src/Geometry/
DTransform.h824 m_matrix.template topRows<Dim>() *= s; in prescale()
1383 res.matrix().template topRows<Dim>().noalias()
1384 = other * tr.matrix().template topRows<Dim>();
1431 res.matrix().template topRows<Dim>() = lhs.matrix() * rhs.matrix();