10 #ifndef EIGEN_SPARSE_BLOCK_H 11 #define EIGEN_SPARSE_BLOCK_H 15 template<
typename XprType,
int BlockRows,
int BlockCols>
16 class BlockImpl<XprType,BlockRows,BlockCols,true,Sparse>
17 :
public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,true> >
20 typedef Block<XprType, BlockRows, BlockCols, true> BlockType;
21 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
23 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
24 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
26 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
28 class InnerIterator: public XprType::InnerIterator
30 typedef typename BlockImpl::Index Index;
32 inline InnerIterator(
const Block<XprType, BlockRows, BlockCols, true>& xpr, Index outer)
33 : XprType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
35 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
36 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
40 class ReverseInnerIterator:
public XprType::ReverseInnerIterator
42 typedef typename BlockImpl::Index Index;
44 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
45 : XprType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
47 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
48 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
53 inline BlockImpl(
const XprType& xpr,
int i)
54 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
57 inline BlockImpl(
const XprType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
58 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
61 inline const Scalar coeff(
int row,
int col)
const 63 return m_matrix.coeff(row + IsRowMajor ? m_outerStart : 0, col +IsRowMajor ? 0 : m_outerStart);
66 inline const Scalar coeff(
int index)
const 68 return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
71 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
72 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
76 typename XprType::Nested m_matrix;
78 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
80 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
82 Index nonZeros() const;
90 template<typename _Scalar,
int _Options, typename _Index,
int BlockRows,
int BlockCols>
91 class BlockImpl<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
92 : public SparseMatrixBase<Block<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true> >
94 typedef SparseMatrix<_Scalar, _Options, _Index> SparseMatrixType;
95 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
96 typedef Block<const SparseMatrixType, BlockRows, BlockCols, true> ConstBlockType;
98 typedef Block<SparseMatrixType, BlockRows, BlockCols, true> BlockType;
99 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
100 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
102 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
105 class InnerIterator:
public SparseMatrixType::InnerIterator
108 inline InnerIterator(
const BlockType& xpr, Index outer)
109 : SparseMatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
111 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
112 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
116 class ReverseInnerIterator:
public SparseMatrixType::ReverseInnerIterator
119 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
120 : SparseMatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
122 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
123 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
128 inline BlockImpl(
const SparseMatrixType& xpr,
int i)
129 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
132 inline BlockImpl(
const SparseMatrixType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
133 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
136 template<
typename OtherDerived>
137 inline BlockType& operator=(
const SparseMatrixBase<OtherDerived>& other)
139 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _NestedMatrixType;
140 _NestedMatrixType& matrix =
const_cast<_NestedMatrixType&
>(m_matrix);;
145 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
148 Index nnz = tmp.nonZeros();
149 Index start = m_outerStart==0 ? 0 : matrix.outerIndexPtr()[m_outerStart];
150 Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()];
151 Index block_size = end - start;
152 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
154 Index free_size = m_matrix.isCompressed()
155 ? Index(matrix.data().allocatedSize()) + block_size
161 typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
163 std::memcpy(newdata.valuePtr(), m_matrix.data().valuePtr(), start*
sizeof(Scalar));
164 std::memcpy(newdata.indexPtr(), m_matrix.data().indexPtr(), start*
sizeof(Index));
166 std::memcpy(newdata.valuePtr() + start, tmp.data().valuePtr(), nnz*
sizeof(Scalar));
167 std::memcpy(newdata.indexPtr() + start, tmp.data().indexPtr(), nnz*
sizeof(Index));
169 std::memcpy(newdata.valuePtr()+start+nnz, matrix.data().valuePtr()+end, tail_size*
sizeof(Scalar));
170 std::memcpy(newdata.indexPtr()+start+nnz, matrix.data().indexPtr()+end, tail_size*
sizeof(Index));
172 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
174 matrix.data().swap(newdata);
179 matrix.data().resize(start + nnz + tail_size);
181 std::memmove(matrix.data().valuePtr()+start+nnz, matrix.data().valuePtr()+end, tail_size*
sizeof(Scalar));
182 std::memmove(matrix.data().indexPtr()+start+nnz, matrix.data().indexPtr()+end, tail_size*
sizeof(Index));
184 std::memcpy(matrix.data().valuePtr()+start, tmp.data().valuePtr(), nnz*
sizeof(Scalar));
185 std::memcpy(matrix.data().indexPtr()+start, tmp.data().indexPtr(), nnz*
sizeof(Index));
189 if(!m_matrix.isCompressed())
190 for(Index j=0; j<m_outerSize.value(); ++j)
191 matrix.innerNonZeroPtr()[m_outerStart+j] = tmp.innerVector(j).nonZeros();
195 for(Index k=0; k<m_outerSize.value(); ++k)
197 matrix.outerIndexPtr()[m_outerStart+k] = p;
198 p += tmp.innerVector(k).nonZeros();
200 std::ptrdiff_t offset = nnz - block_size;
201 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
203 matrix.outerIndexPtr()[k] += offset;
209 inline BlockType& operator=(
const BlockType& other)
211 return operator=<BlockType>(other);
214 inline const Scalar* valuePtr()
const 215 {
return m_matrix.valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
216 inline Scalar* valuePtr()
217 {
return m_matrix.const_cast_derived().valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
219 inline const Index* innerIndexPtr()
const 220 {
return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
221 inline Index* innerIndexPtr()
222 {
return m_matrix.const_cast_derived().innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
224 inline const Index* outerIndexPtr()
const 225 {
return m_matrix.outerIndexPtr() + m_outerStart; }
226 inline Index* outerIndexPtr()
227 {
return m_matrix.const_cast_derived().outerIndexPtr() + m_outerStart; }
229 Index nonZeros()
const 231 if(m_matrix.isCompressed())
232 return std::size_t(m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()])
233 - std::size_t(m_matrix.outerIndexPtr()[m_outerStart]);
234 else if(m_outerSize.value()==0)
237 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
240 inline Scalar& coeffRef(
int row,
int col)
242 return m_matrix.const_cast_derived().coeffRef(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
245 inline const Scalar coeff(
int row,
int col)
const 247 return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
250 inline const Scalar coeff(
int index)
const 252 return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
255 const Scalar& lastCoeff()
const 257 EIGEN_STATIC_ASSERT_VECTOR_ONLY(BlockImpl);
258 eigen_assert(nonZeros()>0);
259 if(m_matrix.isCompressed())
260 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
262 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
265 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
266 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
270 typename SparseMatrixType::Nested m_matrix;
272 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
277 template<
typename _Scalar,
int _Options,
typename _Index,
int BlockRows,
int BlockCols>
278 class BlockImpl<const SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
279 :
public SparseMatrixBase<Block<const SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true> >
281 typedef SparseMatrix<_Scalar, _Options, _Index> SparseMatrixType;
282 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
284 typedef Block<const SparseMatrixType, BlockRows, BlockCols, true> BlockType;
285 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
286 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
288 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
291 class InnerIterator:
public SparseMatrixType::InnerIterator
294 inline InnerIterator(
const BlockType& xpr, Index outer)
295 : SparseMatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
297 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
298 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
302 class ReverseInnerIterator:
public SparseMatrixType::ReverseInnerIterator
305 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
306 : SparseMatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
308 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
309 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
314 inline BlockImpl(
const SparseMatrixType& xpr,
int i)
315 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
318 inline BlockImpl(
const SparseMatrixType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
319 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
322 inline const Scalar* valuePtr()
const 323 {
return m_matrix.valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
325 inline const Index* innerIndexPtr()
const 326 {
return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
328 inline const Index* outerIndexPtr()
const 329 {
return m_matrix.outerIndexPtr() + m_outerStart; }
331 Index nonZeros()
const 333 if(m_matrix.isCompressed())
334 return std::size_t(m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()])
335 - std::size_t(m_matrix.outerIndexPtr()[m_outerStart]);
336 else if(m_outerSize.value()==0)
339 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
342 inline const Scalar coeff(
int row,
int col)
const 344 return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
347 inline const Scalar coeff(
int index)
const 349 return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
352 const Scalar& lastCoeff()
const 354 EIGEN_STATIC_ASSERT_VECTOR_ONLY(BlockImpl);
355 eigen_assert(nonZeros()>0);
356 if(m_matrix.isCompressed())
357 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
359 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
362 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
363 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
367 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
369 typename SparseMatrixType::Nested m_matrix;
371 const
internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
379 template<typename Derived>
386 template<
typename Derived>
393 template<
typename Derived>
398 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
399 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
406 template<
typename Derived>
411 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
412 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
418 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel,
419 bool OuterVector = (BlockCols==1 && XprType::IsRowMajor) || (BlockRows==1 && !XprType::IsRowMajor)>
420 class GenericSparseBlockInnerIteratorImpl;
427 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
428 class BlockImpl<XprType,BlockRows,BlockCols,InnerPanel,Sparse>
429 :
public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,InnerPanel> >, internal::no_assignment_operator
431 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
434 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
435 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
439 inline BlockImpl(const XprType& xpr,
int i)
441 m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0),
442 m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0),
443 m_blockRows(BlockRows==1 ? 1 : xpr.rows()),
444 m_blockCols(BlockCols==1 ? 1 : xpr.cols())
449 inline BlockImpl(
const XprType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
450 : m_matrix(xpr), m_startRow(startRow), m_startCol(startCol), m_blockRows(blockRows), m_blockCols(blockCols)
453 inline int rows()
const {
return m_blockRows.value(); }
454 inline int cols()
const {
return m_blockCols.value(); }
456 inline Scalar& coeffRef(
int row,
int col)
458 return m_matrix.const_cast_derived()
459 .coeffRef(row + m_startRow.value(), col + m_startCol.value());
462 inline const Scalar coeff(
int row,
int col)
const 464 return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value());
467 inline Scalar& coeffRef(
int index)
469 return m_matrix.const_cast_derived()
470 .coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
471 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
474 inline const Scalar coeff(
int index)
const 477 .coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
478 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
481 inline const _MatrixTypeNested& nestedExpression()
const {
return m_matrix; }
483 typedef internal::GenericSparseBlockInnerIteratorImpl<XprType,BlockRows,BlockCols,InnerPanel> InnerIterator;
485 class ReverseInnerIterator :
public _MatrixTypeNested::ReverseInnerIterator
487 typedef typename _MatrixTypeNested::ReverseInnerIterator Base;
488 const BlockType& m_block;
492 EIGEN_STRONG_INLINE ReverseInnerIterator(
const BlockType& block, Index outer)
493 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
495 m_begin(IsRowMajor ? block.m_startCol.value() : block.m_startRow.value())
497 while( (Base::operator
bool()) && (Base::index() >= (IsRowMajor ? m_block.m_startCol.value()+block.m_blockCols.value() : m_block.m_startRow.value()+block.m_blockRows.value())) )
501 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
502 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
503 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
504 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
506 inline operator bool()
const {
return Base::operator bool() && Base::index() >= m_begin; }
509 friend class internal::GenericSparseBlockInnerIteratorImpl<XprType,BlockRows,BlockCols,InnerPanel>;
510 friend class ReverseInnerIterator;
512 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
514 typename XprType::Nested m_matrix;
515 const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 : Dynamic> m_startRow;
516 const internal::variable_if_dynamic<Index, XprType::ColsAtCompileTime == 1 ? 0 : Dynamic> m_startCol;
517 const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_blockRows;
518 const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_blockCols;
520 Index nonZeros()
const;
524 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
525 class GenericSparseBlockInnerIteratorImpl<XprType,BlockRows,BlockCols,InnerPanel,false> :
public internal::remove_all<typename XprType::Nested>::type::InnerIterator
530 IsRowMajor = BlockType::IsRowMajor
532 typedef typename BlockType::Index Index;
534 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
535 typedef typename _MatrixTypeNested::InnerIterator Base;
536 const BlockType& m_block;
540 EIGEN_STRONG_INLINE GenericSparseBlockInnerIteratorImpl(
const BlockType& block, Index outer)
541 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
543 m_end(IsRowMajor ? block.m_startCol.value()+block.m_blockCols.value() : block.m_startRow.value()+block.m_blockRows.value())
545 while( (Base::operator
bool()) && (Base::index() < (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value())) )
549 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
550 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
551 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
552 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
554 inline operator bool()
const {
return Base::operator bool() && Base::index() < m_end; }
558 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
559 class GenericSparseBlockInnerIteratorImpl<XprType,BlockRows,BlockCols,InnerPanel,true>
564 IsRowMajor = BlockType::IsRowMajor
566 typedef typename BlockType::Index Index;
567 typedef typename BlockType::Scalar Scalar;
569 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
570 const BlockType& m_block;
577 EIGEN_STRONG_INLINE GenericSparseBlockInnerIteratorImpl(
const BlockType& block, Index outer = 0)
580 m_outerPos( (IsRowMajor ? block.m_startCol.value() : block.m_startRow.value()) - 1),
581 m_innerIndex(IsRowMajor ? block.m_startRow.value() : block.m_startCol.value()),
582 m_end(IsRowMajor ? block.m_startCol.value()+block.m_blockCols.value() : block.m_startRow.value()+block.m_blockRows.value())
584 EIGEN_UNUSED_VARIABLE(outer);
585 eigen_assert(outer==0);
590 inline Index index()
const {
return m_outerPos - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
591 inline Index outer()
const {
return 0; }
592 inline Index row()
const {
return IsRowMajor ? 0 : index(); }
593 inline Index col()
const {
return IsRowMajor ? index() : 0; }
595 inline Scalar value()
const {
return m_value; }
597 inline GenericSparseBlockInnerIteratorImpl& operator++()
600 while(m_outerPos<m_end)
603 typename XprType::InnerIterator it(m_block.m_matrix, m_outerPos);
605 while(it && it.index() < m_innerIndex) ++it;
606 if(it && it.index()==m_innerIndex)
608 m_value = it.value();
615 inline operator bool()
const {
return m_outerPos < m_end; }
623 #endif // EIGEN_SPARSE_BLOCK_H BlockImpl(const XprType &xpr, int startRow, int startCol, int blockRows, int blockCols)
Definition: SparseBlock.h:449
Base class of any sparse matrices or sparse expressions.
Definition: ForwardDeclarations.h:239
Definition: Eigen_Colamd.h:50
Expression of a fixed-size or dynamic-size block.
Definition: Block.h:102
InnerVectorReturnType innerVector(Index outer)
Definition: SparseBlock.h:380
InnerVectorsReturnType innerVectors(Index outerStart, Index outerSize)
Definition: SparseBlock.h:395