11 #ifndef EIGEN_SPARSEVIEW_H 12 #define EIGEN_SPARSEVIEW_H 18 template<
typename MatrixType>
21 typedef typename MatrixType::Index Index;
22 typedef Sparse StorageKind;
30 template<
typename MatrixType>
33 typedef typename MatrixType::Nested MatrixTypeNested;
40 : m_matrix(mat), m_reference(reference), m_epsilon(epsilon) {}
44 inline Index rows()
const {
return m_matrix.rows(); }
45 inline Index cols()
const {
return m_matrix.cols(); }
47 inline Index innerSize()
const {
return m_matrix.innerSize(); }
48 inline Index outerSize()
const {
return m_matrix.outerSize(); }
51 MatrixTypeNested m_matrix;
56 template<
typename MatrixType>
59 typedef typename SparseView::Index Index;
61 typedef typename _MatrixTypeNested::InnerIterator IterBase;
63 IterBase(view.m_matrix, outer), m_view(view)
70 IterBase::operator++();
75 using IterBase::value;
81 void incrementToNonZero()
83 while((
bool(*
this)) && internal::isMuchSmallerThan(value(), m_view.m_reference, m_view.m_epsilon))
85 IterBase::operator++();
90 template<
typename Derived>
Definition: SparseView.h:57
iterative scaling algorithm to equilibrate rows and column norms in matrices
Definition: TestIMU_Common.h:87
Holds information about the various numeric (i.e.
Definition: NumTraits.h:88
const unsigned int RowMajorBit
for a matrix, this means that the storage order is row-major.
Definition: Constants.h:53
Base class of any sparse matrices or sparse expressions.
Definition: ForwardDeclarations.h:239
Definition: ForwardDeclarations.h:116
Definition: BandTriangularSolver.h:13
An InnerIterator allows to loop over the element of a sparse (or dense) matrix or expression...
Base class for all dense matrices, vectors, and expressions.
Definition: MatrixBase.h:48
Definition: ForwardDeclarations.h:17
double Scalar
Common scalar type.
Definition: FlexibleKalmanBase.h:48