| /external/eigen/doc/snippets/ |
| D | MatrixBase_template_int_bottomRows.cpp | 4 cout << a.bottomRows<2>() << endl;
5 a.bottomRows<2>().setZero();
|
| D | MatrixBase_bottomRows_int.cpp | 4 cout << a.bottomRows(2) << endl;
5 a.bottomRows(2).setZero();
|
| /external/eigen/test/ |
| D | corners.cpp | 40 COMPARE_CORNER(bottomRows(r), block(rows-r,0,r,cols)); in corners()
77 VERIFY_IS_EQUAL((matrix.template bottomRows<r>()), (matrix.template block<r,cols>(rows-r,0))); in corners_fixedsize()
99 …VERIFY_IS_EQUAL((const_matrix.template bottomRows<r>()), (const_matrix.template block<r,cols>(rows… 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 | evaluators.cpp | 302 copy_using_evaluator(m4.block(1, 1, 2, 3), m3.bottomRows(2)); in test_evaluators()
303 m4ref.block(1, 1, 2, 3) = m3.bottomRows(2); in test_evaluators()
|
| D | sparse_basic.cpp | 550 if (incRows > 0) refMat1.bottomRows(incRows).setZero(); in sparse_basic()
|
| /external/eigen/doc/examples/ |
| D | Tutorial_BlockOperations_corner.cpp | 14 cout << "m.bottomRows<2>() =" << endl << m.bottomRows<2>() << endl << endl; in main()
|
| /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());
|
| D | PlainObjectBase.h | 961 _this.bottomRightCorner(new_rows, other.cols()) = other.bottomRows(new_rows);
|
| /external/eigen/Eigen/src/SVD/ |
| D | UpperBidiagonalization.h | 241 x_k.noalias() -= X_k1.bottomRows(remainingRows-1) * tmp0; in upperbidiagonalization_blocked_helper()
269 A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint(); in upperbidiagonalization_blocked_helper()
270 A11.noalias() -= X.topLeftCorner(brows,bs).bottomRows(brows-bs) * A01; in upperbidiagonalization_blocked_helper()
|
| D | BDCSVD.h | 277 m_computed.template bottomRows<1>().setZero();
370 A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2);
|
| /external/eigen/Eigen/src/plugins/ |
| D | BlockMethods.h | 488 inline RowsBlockXpr bottomRows(Index n) in bottomRows() function
495 inline ConstRowsBlockXpr bottomRows(Index n) const in bottomRows() function
517 inline typename NRowsBlockXpr<N>::Type bottomRows(Index n = N)
525 inline typename ConstNRowsBlockXpr<N>::Type bottomRows(Index n = N) const
|
| /external/eigen/doc/ |
| D | TutorialBlockOperations.dox | 150 \link DenseBase::bottomRows() * \endlink</td>
152 matrix.bottomRows(q);\endcode </td>
154 matrix.bottomRows<q>();\endcode </td>
|
| D | AsciiQuickReference.txt | 74 P.bottomRows<rows>() // P(end-rows+1:end, :)
75 P.bottomRows(rows) // P(end-rows+1:end, :)
|
| D | QuickReference.dox | 564 mat1.bottomRows(rows)
569 mat1.bottomRows<rows>()
|
| D | A05_PortingFrom2To3.dox | 72 Notice that Eigen3 also provides these new convenience methods: topRows(), bottomRows(), leftCols()…
|
| D | TutorialSparse.dox | 329 sm2.bottomRows(nrows) = ...;
|
| /external/eigen/Eigen/src/LU/ |
| D | FullPivLU.h | 779 c.bottomRows(rows-cols) -= m_lu.bottomRows(rows-cols) * c.topRows(cols);
|
| /external/eigen/Eigen/src/QR/ |
| D | HouseholderQR.h | 368 dst.bottomRows(cols()-rank).setZero(); in _solve_impl()
|
| D | CompleteOrthogonalDecomposition.h | 519 dst.bottomRows(cols - rank).setZero();
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| D | RealQZ.h | 484 essential2 = hr.template bottomRows<2>(); in step()
496 essential2 = hr.template bottomRows<2>(); in step()
|
| /external/eigen/Eigen/src/Householder/ |
| D | HouseholderSequence.h | 342 dst.bottomRows(rows()-m_shift-actual_k)
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixPower.h | 524 m_fT.bottomRows(m_nulls).fill(RealScalar(0)); in initialize()
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 207 y.bottomRows(y.rows()-rank).setZero();
|