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)
78 template<
typename _Scalar,
int _Options,
typename _Index,
int BlockRows,
int BlockCols>
79 class BlockImpl<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true,Sparse>
80 :
public SparseMatrixBase<Block<SparseMatrix<_Scalar, _Options, _Index>,BlockRows,BlockCols,true> >
82 typedef SparseMatrix<_Scalar, _Options, _Index> SparseMatrixType;
83 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
84 typedef Block<SparseMatrixType, BlockRows, BlockCols, true> BlockType;
86 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
87 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
89 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
92 class InnerIterator:
public SparseMatrixType::InnerIterator
95 inline InnerIterator(
const BlockType& xpr, Index outer)
96 : SparseMatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
98 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
99 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
103 class ReverseInnerIterator:
public SparseMatrixType::ReverseInnerIterator
106 inline ReverseInnerIterator(
const BlockType& xpr, Index outer)
107 : SparseMatrixType::ReverseInnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
109 inline Index row()
const {
return IsRowMajor ? m_outer : this->index(); }
110 inline Index col()
const {
return IsRowMajor ? this->index() : m_outer; }
115 inline BlockImpl(
const SparseMatrixType& xpr,
int i)
116 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
119 inline BlockImpl(
const SparseMatrixType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
120 : m_matrix(xpr), m_outerStart(IsRowMajor ? startRow : startCol), m_outerSize(IsRowMajor ? blockRows : blockCols)
123 template<
typename OtherDerived>
124 inline BlockType& operator=(
const SparseMatrixBase<OtherDerived>& other)
126 typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _NestedMatrixType;
127 _NestedMatrixType& matrix =
const_cast<_NestedMatrixType&
>(m_matrix);;
132 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
135 Index nnz = tmp.nonZeros();
136 Index start = m_outerStart==0 ? 0 : matrix.outerIndexPtr()[m_outerStart];
137 Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()];
138 Index block_size = end - start;
139 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
141 Index free_size = m_matrix.isCompressed()
142 ? Index(matrix.data().allocatedSize()) + block_size
148 typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
150 std::memcpy(&newdata.value(0), &m_matrix.data().value(0), start*
sizeof(Scalar));
151 std::memcpy(&newdata.index(0), &m_matrix.data().index(0), start*
sizeof(Index));
153 std::memcpy(&newdata.value(start), &tmp.data().value(0), nnz*
sizeof(Scalar));
154 std::memcpy(&newdata.index(start), &tmp.data().index(0), nnz*
sizeof(Index));
156 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*
sizeof(Scalar));
157 std::memcpy(&newdata.index(start+nnz), &matrix.data().index(end), tail_size*
sizeof(Index));
159 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
161 matrix.data().swap(newdata);
166 matrix.data().resize(start + nnz + tail_size);
168 std::memmove(&matrix.data().value(start+nnz), &matrix.data().value(end), tail_size*
sizeof(Scalar));
169 std::memmove(&matrix.data().index(start+nnz), &matrix.data().index(end), tail_size*
sizeof(Index));
171 std::memcpy(&matrix.data().value(start), &tmp.data().value(0), nnz*
sizeof(Scalar));
172 std::memcpy(&matrix.data().index(start), &tmp.data().index(0), nnz*
sizeof(Index));
176 if(!m_matrix.isCompressed())
177 for(Index j=0; j<m_outerSize.value(); ++j)
178 matrix.innerNonZeroPtr()[m_outerStart+j] = tmp.innerVector(j).nonZeros();
182 for(Index k=0; k<m_outerSize.value(); ++k)
184 matrix.outerIndexPtr()[m_outerStart+k] = p;
185 p += tmp.innerVector(k).nonZeros();
187 std::ptrdiff_t offset = nnz - block_size;
188 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
190 matrix.outerIndexPtr()[k] += offset;
196 inline BlockType& operator=(
const BlockType& other)
198 return operator=<BlockType>(other);
201 inline const Scalar* valuePtr()
const
202 {
return m_matrix.valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
203 inline Scalar* valuePtr()
204 {
return m_matrix.const_cast_derived().valuePtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
206 inline const Index* innerIndexPtr()
const
207 {
return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
208 inline Index* innerIndexPtr()
209 {
return m_matrix.const_cast_derived().innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
211 inline const Index* outerIndexPtr()
const
212 {
return m_matrix.outerIndexPtr() + m_outerStart; }
213 inline Index* outerIndexPtr()
214 {
return m_matrix.const_cast_derived().outerIndexPtr() + m_outerStart; }
216 Index nonZeros()
const
218 if(m_matrix.isCompressed())
219 return std::size_t(m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()])
220 - std::size_t(m_matrix.outerIndexPtr()[m_outerStart]);
221 else if(m_outerSize.value()==0)
224 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
227 const Scalar& lastCoeff()
const
229 EIGEN_STATIC_ASSERT_VECTOR_ONLY(BlockImpl);
230 eigen_assert(nonZeros()>0);
231 if(m_matrix.isCompressed())
232 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
234 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
237 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
238 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
242 typename SparseMatrixType::Nested m_matrix;
244 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
253 template<
typename Derived>
260 template<
typename Derived>
267 template<
typename Derived>
271 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
272 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
279 template<
typename Derived>
283 IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart,
284 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
291 template<
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
292 class BlockImpl<XprType,BlockRows,BlockCols,InnerPanel,
Sparse>
293 :
public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,InnerPanel> >, internal::no_assignment_operator
295 typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
298 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
303 inline BlockImpl(const XprType& xpr,
int i)
305 m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0),
306 m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0),
307 m_blockRows(xpr.rows()),
308 m_blockCols(xpr.cols())
313 inline BlockImpl(
const XprType& xpr,
int startRow,
int startCol,
int blockRows,
int blockCols)
314 : m_matrix(xpr), m_startRow(startRow), m_startCol(startCol), m_blockRows(blockRows), m_blockCols(blockCols)
317 inline int rows()
const {
return m_blockRows.value(); }
318 inline int cols()
const {
return m_blockCols.value(); }
320 inline Scalar& coeffRef(
int row,
int col)
322 return m_matrix.const_cast_derived()
323 .coeffRef(row + m_startRow.value(), col + m_startCol.value());
326 inline const Scalar coeff(
int row,
int col)
const
328 return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value());
331 inline Scalar& coeffRef(
int index)
333 return m_matrix.const_cast_derived()
334 .coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
335 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
338 inline const Scalar coeff(
int index)
const
341 .coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
342 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
345 inline const _MatrixTypeNested& nestedExpression()
const {
return m_matrix; }
347 class InnerIterator :
public _MatrixTypeNested::InnerIterator
349 typedef typename _MatrixTypeNested::InnerIterator Base;
350 const BlockType& m_block;
354 EIGEN_STRONG_INLINE InnerIterator(
const BlockType& block, Index outer)
355 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
357 m_end(IsRowMajor ? block.m_startCol.value()+block.m_blockCols.value() : block.m_startRow.value()+block.m_blockRows.value())
359 while( (Base::operator
bool()) && (Base::index() < (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value())) )
363 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
364 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
365 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
366 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
368 inline operator bool()
const {
return Base::operator bool() && Base::index() < m_end; }
370 class ReverseInnerIterator :
public _MatrixTypeNested::ReverseInnerIterator
372 typedef typename _MatrixTypeNested::ReverseInnerIterator Base;
373 const BlockType& m_block;
377 EIGEN_STRONG_INLINE ReverseInnerIterator(
const BlockType& block, Index outer)
378 : Base(block.derived().nestedExpression(), outer + (IsRowMajor ? block.m_startRow.value() : block.m_startCol.value())),
380 m_begin(IsRowMajor ? block.m_startCol.value() : block.m_startRow.value())
382 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())) )
386 inline Index index()
const {
return Base::index() - (IsRowMajor ? m_block.m_startCol.value() : m_block.m_startRow.value()); }
387 inline Index outer()
const {
return Base::outer() - (IsRowMajor ? m_block.m_startRow.value() : m_block.m_startCol.value()); }
388 inline Index row()
const {
return Base::row() - m_block.m_startRow.value(); }
389 inline Index col()
const {
return Base::col() - m_block.m_startCol.value(); }
391 inline operator bool()
const {
return Base::operator bool() && Base::index() >= m_begin; }
394 friend class InnerIterator;
395 friend class ReverseInnerIterator;
397 EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl)
399 typename XprType::Nested m_matrix;
400 const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 :
Dynamic> m_startRow;
401 const internal::variable_if_dynamic<Index, XprType::ColsAtCompileTime == 1 ? 0 :
Dynamic> m_startCol;
402 const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_blockRows;
403 const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_blockCols;
409 #endif // EIGEN_SPARSE_BLOCK_H
BlockImpl(const XprType &xpr, int startRow, int startCol, int blockRows, int blockCols)
Definition: SparseBlock.h:313
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:268
InnerVectorReturnType innerVector(Index outer)
Definition: SparseBlock.h:254