Lines Matching refs:Index
63 typedef typename MatrixType::Index Index;
66 typedef Matrix<Index, 1,
94 FullPivHouseholderQR(Index rows, Index cols)
218 inline Index rank() const
223 Index result = 0;
224 for(Index i = 0; i < m_nonzero_pivots; ++i)
235 inline Index dimensionOfKernel() const
292 inline Index rows() const { return m_qr.rows(); }
293 inline Index cols() const { return m_qr.cols(); }
359 inline Index nonzeroPivots() const
385 Index m_nonzero_pivots;
387 Index m_det_pq;
419 Index rows = matrix.rows();
420 Index cols = matrix.cols();
421 Index size = (std::min)(rows,cols);
432 Index number_of_transpositions = 0;
439 for (Index k = 0; k < size; ++k)
441 Index row_of_biggest_in_corner, col_of_biggest_in_corner;
455 for(Index i = k; i < size; i++)
487 for(Index k = 0; k < size; ++k)
506 const Index rows = dec().rows(), cols = dec().cols();
520 for (Index k = 0; k < dec().rank(); ++k)
522 Index remainingSize = rows-k;
534 for(Index i = 0; i < dec().rank(); ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
535 for(Index i = dec().rank(); i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
549 typedef typename MatrixType::Index Index;
566 const Index rows = m_qr.rows();
578 const Index rows = m_qr.rows();
579 const Index cols = m_qr.cols();
580 const Index size = (std::min)(rows, cols);
583 for (Index k = size-1; k >= 0; k--)
591 Index rows() const { return m_qr.rows(); }
592 Index cols() const { return m_qr.rows(); }
