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> >
19 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
20 typedef Block<XprType, BlockRows, BlockCols, true> BlockType;
22 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
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 BlockType& 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 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
62 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
66 typename XprType::Nested m_matrix;
68 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
70 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
72 Index nonZeros() const;
80 template<typename _Scalar,
int _Options, typename _Index,
int BlockRows,
int BlockCols>
81 class BlockImpl<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
82 : public SparseMatrixBase<Block<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true> >
84 typedef SparseMatrix<_Scalar, _Options, _Index> SparseMatrixType;
85 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
86 typedef Block<SparseMatrixType, BlockRows, BlockCols, true> BlockType;
87 typedef Block<const SparseMatrixType, BlockRows, BlockCols, true> ConstBlockType;
89 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
90 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
92 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
95 class InnerIterator:
public SparseMatrixType::InnerIterator
98 inline InnerIterator(
const BlockType& xpr, Index outer)
99 : SparseMatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
101 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
102 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
106 class ReverseInnerIterator:
public SparseMatrixType::ReverseInnerIterator
109 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
110 : SparseMatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
112 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
113 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
118 inline BlockImpl(
const SparseMatrixType& xpr,
int i)
119 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
122 inline BlockImpl(
const SparseMatrixType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
123 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
126 template<
typename OtherDerived>
127 inline BlockType& operator=(
const SparseMatrixBase<OtherDerived>& other)
129 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _NestedMatrixType;
130 _NestedMatrixType& matrix =
const_cast<_NestedMatrixType&
>(m_matrix);;
135 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
138 Index nnz = tmp.nonZeros();
139 Index start = m_outerStart==0 ? 0 : matrix.outerIndexPtr()[m_outerStart];
140 Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()];
141 Index block_size = end - start;
142 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
144 Index free_size = m_matrix.isCompressed()
145 ? Index(matrix.data().allocatedSize()) + block_size
151 typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
153 std::memcpy(&newdata.value(0), &m_matrix.data().value(0), start*
sizeof(Scalar));
154 std::memcpy(&newdata.index(0), &m_matrix.data().index(0), start*
sizeof(Index));
156 std::memcpy(&newdata.value(start), &tmp.data().value(0), nnz*
sizeof(Scalar));
157 std::memcpy(&newdata.index(start), &tmp.data().index(0), nnz*
sizeof(Index));
159 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*
sizeof(Scalar));
160 std::memcpy(&newdata.index(start+nnz), &matrix.data().index(end), tail_size*
sizeof(Index));
162 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
164 matrix.data().swap(newdata);
169 matrix.data().resize(start + nnz + tail_size);
171 std::memmove(&matrix.data().value(start+nnz), &matrix.data().value(end), tail_size*
sizeof(Scalar));
172 std::memmove(&matrix.data().index(start+nnz), &matrix.data().index(end), tail_size*
sizeof(Index));
174 std::memcpy(&matrix.data().value(start), &tmp.data().value(0), nnz*
sizeof(Scalar));
175 std::memcpy(&matrix.data().index(start), &tmp.data().index(0), nnz*
sizeof(Index));
179 if(!m_matrix.isCompressed())
180 for(Index j=0; j<m_outerSize.value(); ++j)
181 matrix.innerNonZeroPtr()[m_outerStart+j] = tmp.innerVector(j).nonZeros();
185 for(Index k=0; k<m_outerSize.value(); ++k)
187 matrix.outerIndexPtr()[m_outerStart+k] = p;
188 p += tmp.innerVector(k).nonZeros();
190 std::ptrdiff_t offset = nnz - block_size;
191 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
193 matrix.outerIndexPtr()[k] += offset;
199 inline BlockType& operator=(
const BlockType& other)
201 return operator=<BlockType>(other);
204 inline const Scalar* valuePtr()
const
205 {
return m_matrix.valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
206 inline Scalar* valuePtr()
207 {
return m_matrix.const_cast_derived().valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
209 inline const Index* innerIndexPtr()
const
210 {
return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
211 inline Index* innerIndexPtr()
212 {
return m_matrix.const_cast_derived().innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
214 inline const Index* outerIndexPtr()
const
215 {
return m_matrix.outerIndexPtr() + m_outerStart; }
216 inline Index* outerIndexPtr()
217 {
return m_matrix.const_cast_derived().outerIndexPtr() + m_outerStart; }
219 Index nonZeros()
const
221 if(m_matrix.isCompressed())
222 return std::size_t(m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()])
223 - std::size_t(m_matrix.outerIndexPtr()[m_outerStart]);
224 else if(m_outerSize.value()==0)
227 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
230 const Scalar& lastCoeff()
const
232 EIGEN_STATIC_ASSERT_VECTOR_ONLY(BlockImpl);
233 eigen_assert(nonZeros()>0);
234 if(m_matrix.isCompressed())
235 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
237 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
240 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
241 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
245 typename SparseMatrixType::Nested m_matrix;
247 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
252 template<
typename _Scalar,
int _Options,
typename _Index,
int BlockRows,
int BlockCols>
253 class BlockImpl<const SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
254 :
public SparseMatrixBase<Block<const SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true> >
256 typedef SparseMatrix<_Scalar, _Options, _Index> SparseMatrixType;
257 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
258 typedef Block<const SparseMatrixType, BlockRows, BlockCols, true> BlockType;
260 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
261 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
263 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
266 class InnerIterator:
public SparseMatrixType::InnerIterator
269 inline InnerIterator(
const BlockType& xpr, Index outer)
270 : SparseMatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
272 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
273 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
277 class ReverseInnerIterator:
public SparseMatrixType::ReverseInnerIterator
280 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
281 : SparseMatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
283 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
284 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
289 inline BlockImpl(
const SparseMatrixType& xpr,
int i)
290 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
293 inline BlockImpl(
const SparseMatrixType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
294 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
297 inline const Scalar* valuePtr()
const
298 {
return m_matrix.valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
300 inline const Index* innerIndexPtr()
const
301 {
return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
303 inline const Index* outerIndexPtr()
const
304 {
return m_matrix.outerIndexPtr() + m_outerStart; }
306 Index nonZeros()
const
308 if(m_matrix.isCompressed())
309 return std::size_t(m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()])
310 - std::size_t(m_matrix.outerIndexPtr()[m_outerStart]);
311 else if(m_outerSize.value()==0)
314 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
317 const Scalar& lastCoeff()
const
319 EIGEN_STATIC_ASSERT_VECTOR_ONLY(BlockImpl);
320 eigen_assert(nonZeros()>0);
321 if(m_matrix.isCompressed())
322 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
324 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
327 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
328 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
332 typename SparseMatrixType::Nested m_matrix;
334 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
343 template<
typename Derived>
350 template<
typename Derived>
357 template<
typename Derived>
361 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
362 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
369 template<
typename Derived>
373 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
374 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
381 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
382 class BlockImpl<XprType,BlockRows,BlockCols,InnerPanel,
Sparse>
383 :
public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,InnerPanel> >, internal::no_assignment_operator
385 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
388 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
389 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
393 inline BlockImpl(const XprType& xpr,
int i)
395 m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0),
396 m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0),
397 m_blockRows(xpr.rows()),
398 m_blockCols(xpr.cols())
403 inline BlockImpl(
const XprType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
404 : m_matrix(xpr), m_startRow(startRow), m_startCol(startCol), m_blockRows(blockRows), m_blockCols(blockCols)
407 inline int rows()
const {
return m_blockRows.value(); }
408 inline int cols()
const {
return m_blockCols.value(); }
410 inline Scalar& coeffRef(
int row,
int col)
412 return m_matrix.const_cast_derived()
413 .coeffRef(row + m_startRow.value(), col + m_startCol.value());
416 inline const Scalar coeff(
int row,
int col)
const
418 return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value());
421 inline Scalar& coeffRef(
int index)
423 return m_matrix.const_cast_derived()
424 .coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
425 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
428 inline const Scalar coeff(
int index)
const
431 .coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
432 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
435 inline const _MatrixTypeNested& nestedExpression()
const {
return m_matrix; }
437 class InnerIterator :
public _MatrixTypeNested::InnerIterator
439 typedef typename _MatrixTypeNested::InnerIterator Base;
440 const BlockType& m_block;
444 EIGEN_STRONG_INLINE InnerIterator(
const BlockType& block, Index outer)
445 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
447 m_end(IsRowMajor ? block.m_startCol.value()+block.m_blockCols.value() : block.m_startRow.value()+block.m_blockRows.value())
449 while( (Base::operator
bool()) && (Base::index() < (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value())) )
453 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
454 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
455 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
456 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
458 inline operator bool()
const {
return Base::operator bool() && Base::index() < m_end; }
460 class ReverseInnerIterator :
public _MatrixTypeNested::ReverseInnerIterator
462 typedef typename _MatrixTypeNested::ReverseInnerIterator Base;
463 const BlockType& m_block;
467 EIGEN_STRONG_INLINE ReverseInnerIterator(
const BlockType& block, Index outer)
468 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
470 m_begin(IsRowMajor ? block.m_startCol.value() : block.m_startRow.value())
472 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())) )
476 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
477 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
478 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
479 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
481 inline operator bool()
const {
return Base::operator bool() && Base::index() >= m_begin; }
484 friend class InnerIterator;
485 friend class ReverseInnerIterator;
487 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
489 typename XprType::Nested m_matrix;
490 const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 :
Dynamic> m_startRow;
491 const internal::variable_if_dynamic<Index, XprType::ColsAtCompileTime == 1 ? 0 :
Dynamic> m_startCol;
492 const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_blockRows;
493 const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_blockCols;
499 #endif // EIGEN_SPARSE_BLOCK_H
BlockImpl(const XprType &xpr, int startRow, int startCol, int blockRows, int blockCols)
Definition: SparseBlock.h:403
const int Dynamic
Definition: Constants.h:21
Base class of any sparse matrices or sparse expressions.
Definition: SparseMatrixBase.h:26
Definition: SparseCore:32
Expression of a fixed-size or dynamic-size block.
Definition: Block.h:102
Block< Derived, Dynamic, Dynamic, true > innerVectors(Index outerStart, Index outerSize)
Definition: SparseBlock.h:358
InnerVectorReturnType innerVector(Index outer)
Definition: SparseBlock.h:344