11#ifndef EIGEN_SPARSE_BLOCK_H
12#define EIGEN_SPARSE_BLOCK_H
15#include "./InternalHeaderCheck.h"
20template <
typename XprType,
int BlockRows,
int BlockCols>
21class BlockImpl<XprType, BlockRows, BlockCols, true,
Sparse>
23 using BlockType = Block<XprType, BlockRows, BlockCols, true>;
26 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
29 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
30 using Base = SparseCompressedBase<BlockType>;
31 using Base::convert_index;
34 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
36 inline BlockImpl(XprType& xpr, Index i) : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize) {}
38 inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
40 m_outerStart(convert_index(IsRowMajor ? startRow : startCol)),
41 m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols)) {}
43 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
44 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
46 Index nonZeros()
const {
47 return nonZerosImpl(std::integral_constant<
bool, (internal::traits<XprType>::Flags &
CompressedAccessBit) != 0>());
51 Index nonZerosImpl(std::true_type)
const {
52 if (m_outerSize.value() == 0)
return 0;
53 const StorageIndex* outer = m_matrix.outerIndexPtr();
54 if (!outer)
return m_matrix.nonZeros();
55 const StorageIndex* innerNonZeros = m_matrix.innerNonZeroPtr();
56 if (!innerNonZeros)
return outer[m_outerStart + m_outerSize.value()] - outer[m_outerStart];
58 for (Index j = m_outerStart; j < m_outerStart + m_outerSize.value(); ++j) nnz += innerNonZeros[j];
62 Index nonZerosImpl(std::false_type)
const {
63 using EvaluatorType = internal::evaluator<XprType>;
64 EvaluatorType matEval(m_matrix);
66 Index end = m_outerStart + m_outerSize.value();
67 for (Index j = m_outerStart; j < end; ++j)
68 for (
typename EvaluatorType::InnerIterator it(matEval, j); it; ++it) ++nnz;
73 inline const Scalar coeff(Index row, Index col)
const {
74 return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
77 inline const Scalar coeff(Index index)
const {
78 return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
81 inline const XprType& nestedExpression()
const {
return m_matrix; }
82 inline XprType& nestedExpression() {
return m_matrix; }
83 Index startRow()
const {
return IsRowMajor ? m_outerStart : 0; }
84 Index startCol()
const {
return IsRowMajor ? 0 : m_outerStart; }
85 Index blockRows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
86 Index blockCols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
88 inline const Scalar* valuePtr()
const {
return m_matrix.valuePtr(); }
89 inline Scalar* valuePtr() {
return m_matrix.valuePtr(); }
91 inline const StorageIndex* innerIndexPtr()
const {
return m_matrix.innerIndexPtr(); }
92 inline StorageIndex* innerIndexPtr() {
return m_matrix.innerIndexPtr(); }
94 inline const StorageIndex* outerIndexPtr()
const {
95 const StorageIndex* p = m_matrix.outerIndexPtr();
96 return p ? p + m_outerStart : 0;
98 inline StorageIndex* outerIndexPtr() {
99 StorageIndex* p = m_matrix.outerIndexPtr();
100 return p ? p + m_outerStart : 0;
103 inline const StorageIndex* innerNonZeroPtr()
const {
104 const StorageIndex* p = m_matrix.innerNonZeroPtr();
105 return p ? p + m_outerStart : 0;
107 inline StorageIndex* innerNonZeroPtr() {
108 StorageIndex* p = m_matrix.innerNonZeroPtr();
109 return p ? p + m_outerStart : 0;
112 bool isCompressed()
const {
return m_matrix.innerNonZeroPtr() == 0; }
115 typename internal::ref_selector<XprType>::non_const_type m_matrix;
117 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
122 template <
typename T>
123 BlockImpl& operator=(
const T&) {
124 EIGEN_STATIC_ASSERT(
sizeof(T) == 0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY);
135template <
typename SparseMatrixType,
int BlockRows,
int BlockCols>
136class sparse_matrix_block_impl :
public SparseCompressedBase<Block<SparseMatrixType, BlockRows, BlockCols, true> > {
137 using BlockType = Block<SparseMatrixType, BlockRows, BlockCols, true>;
139 using Base::convert_index;
142 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
143 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
145 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
148 inline sparse_matrix_block_impl(SparseMatrixType& xpr,
Index i)
149 : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize) {}
151 inline sparse_matrix_block_impl(SparseMatrixType& xpr,
Index startRow,
Index startCol,
Index blockRows,
154 m_outerStart(convert_index(IsRowMajor ? startRow : startCol)),
155 m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols)) {}
157 template <
typename OtherDerived>
158 inline BlockType& operator=(
const SparseMatrixBase<OtherDerived>& other) {
159 using NestedMatrixType_ = internal::remove_all_t<typename SparseMatrixType::Nested>;
160 NestedMatrixType_& matrix = m_matrix;
166 Ref<const SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, StorageIndex>, StandardCompressedFormat> tmp(
168 eigen_internal_assert(tmp.outerSize() == m_outerSize.value());
170 const Scalar* first = matrix.valuePtr();
171 if (tmp.nonZeros() > 0 && std::less_equal<const Scalar*>()(first, tmp.valuePtr()) &&
172 std::less<const Scalar*>()(tmp.valuePtr(), first + matrix.data().allocatedSize()))
173 return operator=(SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, StorageIndex>(tmp));
176 Index nnz = tmp.nonZeros();
178 m_outerStart == 0 ? 0 : m_matrix.outerIndexPtr()[m_outerStart];
179 Index end = m_matrix.outerIndexPtr()[m_outerStart + m_outerSize.value()];
180 Index block_size = end - start;
181 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
183 Index free_size = m_matrix.isCompressed() ?
Index(matrix.data().allocatedSize()) + block_size : block_size;
185 Index tmp_start = tmp.outerIndexPtr()[0];
187 bool update_trailing_pointers =
false;
188 if (nnz > free_size) {
190 typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
192 internal::move_or_copy(matrix.valuePtr(), matrix.valuePtr() + start, newdata.valuePtr());
193 internal::smart_copy(m_matrix.innerIndexPtr(), m_matrix.innerIndexPtr() + start, newdata.indexPtr());
195 internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, newdata.valuePtr() + start);
196 internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz,
197 newdata.indexPtr() + start);
199 internal::move_or_copy(matrix.valuePtr() + end, matrix.valuePtr() + end + tail_size,
200 newdata.valuePtr() + start + nnz);
201 internal::smart_copy(matrix.innerIndexPtr() + end, matrix.innerIndexPtr() + end + tail_size,
202 newdata.indexPtr() + start + nnz);
204 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
206 matrix.data().swap(newdata);
208 update_trailing_pointers =
true;
210 if (m_matrix.isCompressed() && nnz != block_size) {
212 matrix.data().resize(start + nnz + tail_size);
214 Scalar* values = matrix.valuePtr();
216 const Index tail_end = end + tail_size;
217 if (nnz < block_size) {
218 internal::move_or_copy(values + end, values + tail_end, values + start + nnz);
219 std::move(indices + end, indices + tail_end, indices + start + nnz);
221 internal::move_or_copy_backward(values + end, values + tail_end, values + start + nnz + tail_size);
222 std::move_backward(indices + end, indices + tail_end, indices + start + nnz + tail_size);
225 update_trailing_pointers =
true;
228 internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, matrix.valuePtr() + start);
229 internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz,
230 matrix.innerIndexPtr() + start);
235 if (!m_matrix.isCompressed()) matrix.innerNonZeroPtr()[m_outerStart] =
StorageIndex(nnz);
236 matrix.outerIndexPtr()[m_outerStart] =
StorageIndex(start);
239 for (
Index k = 0; k < m_outerSize.value(); ++k) {
240 StorageIndex nnz_k = internal::convert_index<StorageIndex>(tmp.innerVector(k).nonZeros());
241 if (!m_matrix.isCompressed()) matrix.innerNonZeroPtr()[m_outerStart + k] = nnz_k;
242 matrix.outerIndexPtr()[m_outerStart + k] = p;
247 if (update_trailing_pointers) {
248 StorageIndex offset = internal::convert_index<StorageIndex>(nnz - block_size);
249 for (
Index k = m_outerStart + m_outerSize.value(); k <= matrix.outerSize(); ++k) {
250 matrix.outerIndexPtr()[k] += offset;
257 inline BlockType& operator=(
const BlockType& other) {
return operator= <BlockType>(other); }
259 inline const Scalar* valuePtr()
const {
return m_matrix.valuePtr(); }
260 inline Scalar* valuePtr() {
return m_matrix.valuePtr(); }
262 inline const StorageIndex* innerIndexPtr()
const {
return m_matrix.innerIndexPtr(); }
263 inline StorageIndex* innerIndexPtr() {
return m_matrix.innerIndexPtr(); }
265 inline const StorageIndex* outerIndexPtr()
const {
return m_matrix.outerIndexPtr() + m_outerStart; }
266 inline StorageIndex* outerIndexPtr() {
return m_matrix.outerIndexPtr() + m_outerStart; }
269 return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr() + m_outerStart);
271 inline StorageIndex* innerNonZeroPtr() {
return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr() + m_outerStart); }
273 bool isCompressed()
const {
return m_matrix.innerNonZeroPtr() == 0; }
276 return m_matrix.coeffRef(
row + (IsRowMajor ? m_outerStart : 0),
col + (IsRowMajor ? 0 : m_outerStart));
280 return m_matrix.coeff(
row + (IsRowMajor ? m_outerStart : 0),
col + (IsRowMajor ? 0 : m_outerStart));
283 inline const Scalar coeff(
Index index)
const {
284 return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
287 const Scalar& lastCoeff()
const {
288 EIGEN_STATIC_ASSERT_VECTOR_ONLY(sparse_matrix_block_impl);
290 if (m_matrix.isCompressed())
291 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart + 1] - 1];
293 return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart] + m_matrix.innerNonZeroPtr()[m_outerStart] - 1];
296 EIGEN_STRONG_INLINE
Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
297 EIGEN_STRONG_INLINE
Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
299 inline const SparseMatrixType& nestedExpression()
const {
return m_matrix; }
300 inline SparseMatrixType& nestedExpression() {
return m_matrix; }
301 Index startRow()
const {
return IsRowMajor ? m_outerStart : 0; }
302 Index startCol()
const {
return IsRowMajor ? 0 : m_outerStart; }
303 Index blockRows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
304 Index blockCols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
307 typename internal::ref_selector<SparseMatrixType>::non_const_type m_matrix;
309 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
314template <
typename Scalar_,
int Options_,
typename StorageIndex_,
int BlockRows,
int BlockCols>
315class BlockImpl<
SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true,
Sparse>
316 :
public internal::sparse_matrix_block_impl<SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols> {
318 using StorageIndex = StorageIndex_;
319 using SparseMatrixType = SparseMatrix<Scalar_, Options_, StorageIndex_>;
320 using Base = internal::sparse_matrix_block_impl<SparseMatrixType, BlockRows, BlockCols>;
321 inline BlockImpl(SparseMatrixType& xpr, Index i) : Base(xpr, i) {}
323 inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
324 : Base(xpr, startRow, startCol, blockRows, blockCols) {}
326 using Base::operator=;
329template <
typename Scalar_,
int Options_,
typename StorageIndex_,
int BlockRows,
int BlockCols>
330class BlockImpl<const
SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true,
Sparse>
331 :
public internal::sparse_matrix_block_impl<const SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows,
334 using StorageIndex = StorageIndex_;
335 using SparseMatrixType =
const SparseMatrix<Scalar_, Options_, StorageIndex_>;
336 using Base = internal::sparse_matrix_block_impl<SparseMatrixType, BlockRows, BlockCols>;
337 inline BlockImpl(SparseMatrixType& xpr, Index i) : Base(xpr, i) {}
339 inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
340 : Base(xpr, startRow, startCol, blockRows, blockCols) {}
342 using Base::operator=;
345 template <
typename Derived>
346 BlockImpl(
const SparseMatrixBase<Derived>& xpr, Index i);
347 template <
typename Derived>
348 BlockImpl(
const SparseMatrixBase<Derived>& xpr);
356template <
typename XprType,
int BlockRows,
int BlockCols,
bool InnerPanel>
358 :
public SparseMatrixBase<Block<XprType, BlockRows, BlockCols, InnerPanel> >, internal::no_assignment_operator {
360 using Base = SparseMatrixBase<BlockType>;
361 using Base::convert_index;
364 enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
365 EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
367 using MatrixTypeNested_ = internal::remove_all_t<typename XprType::Nested>;
373 m_startRow((BlockRows == 1) && (BlockCols == XprType::
ColsAtCompileTime) ? convert_index(i) : 0),
374 m_startCol((BlockRows == XprType::
RowsAtCompileTime) && (BlockCols == 1) ? convert_index(i) : 0),
375 m_blockRows(BlockRows == 1 ? 1 : xpr.rows()),
376 m_blockCols(BlockCols == 1 ? 1 : xpr.cols()) {}
380 inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
382 m_startRow(convert_index(startRow)),
383 m_startCol(convert_index(startCol)),
384 m_blockRows(convert_index(blockRows)),
385 m_blockCols(convert_index(blockCols)) {}
387 inline Index rows()
const {
return m_blockRows.value(); }
388 inline Index cols()
const {
return m_blockCols.value(); }
390 inline Scalar& coeffRef(Index row, Index col) {
391 return m_matrix.coeffRef(row + m_startRow.value(), col + m_startCol.value());
394 inline const Scalar coeff(Index row, Index col)
const {
395 return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value());
398 inline Scalar& coeffRef(Index index) {
399 return m_matrix.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
400 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
403 inline const Scalar coeff(Index index)
const {
404 return m_matrix.coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
405 m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
408 inline const XprType& nestedExpression()
const {
return m_matrix; }
409 inline XprType& nestedExpression() {
return m_matrix; }
410 Index startRow()
const {
return m_startRow.value(); }
411 Index startCol()
const {
return m_startCol.value(); }
412 Index blockRows()
const {
return m_blockRows.value(); }
413 Index blockCols()
const {
return m_blockCols.value(); }
416 friend struct internal::unary_evaluator<Block<XprType, BlockRows, BlockCols, InnerPanel>, internal::IteratorBased,
419 Index nonZeros() const {
return Dynamic; }
421 typename internal::ref_selector<XprType>::non_const_type m_matrix;
422 const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 : Dynamic> m_startRow;
423 const internal::variable_if_dynamic<Index, XprType::ColsAtCompileTime == 1 ? 0 : Dynamic> m_startCol;
424 const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_blockRows;
425 const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_blockCols;
430 template <
typename T>
431 BlockImpl& operator=(
const T&) {
432 EIGEN_STATIC_ASSERT(
sizeof(T) == 0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY);
439template <
typename ArgType,
int BlockRows,
int BlockCols,
bool InnerPanel>
440struct unary_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel>, IteratorBased>
441 :
public evaluator_base<Block<ArgType, BlockRows, BlockCols, InnerPanel> > {
442 class InnerVectorInnerIterator;
443 class OuterVectorInnerIterator;
446 using XprType = Block<ArgType, BlockRows, BlockCols, InnerPanel>;
447 using StorageIndex =
typename XprType::StorageIndex;
448 using Scalar =
typename XprType::Scalar;
451 IsRowMajor = XprType::IsRowMajor,
452 OuterVector = (BlockCols == 1 && ArgType::IsRowMajor) || (BlockRows == 1 && !ArgType::IsRowMajor),
453 CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
454 Flags = XprType::Flags
457 using InnerIterator = std::conditional_t<OuterVector, OuterVectorInnerIterator, InnerVectorInnerIterator>;
459 explicit unary_evaluator(
const XprType& op) : m_argImpl(op.nestedExpression()), m_block(op) {}
461 inline Index nonZerosEstimate()
const {
462 const Index nnz = m_block.nonZeros();
466 const Index nested_sz = m_block.nestedExpression().size();
467 return nested_sz == 0 ? 0 : m_argImpl.nonZerosEstimate() * m_block.size() / nested_sz;
473 using EvalIterator =
typename evaluator<ArgType>::InnerIterator;
475 evaluator<ArgType> m_argImpl;
476 const XprType& m_block;
479template <
typename ArgType,
int BlockRows,
int BlockCols,
bool InnerPanel>
480class unary_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel>, IteratorBased>::InnerVectorInnerIterator
481 :
public EvalIterator {
485 enum { XprIsRowMajor = unary_evaluator::IsRowMajor };
486 const XprType& m_block;
490 EIGEN_STRONG_INLINE InnerVectorInnerIterator(
const unary_evaluator& aEval, Index outer)
491 : EvalIterator(aEval.m_argImpl, outer + (XprIsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol())),
492 m_block(aEval.m_block),
493 m_end(XprIsRowMajor ? aEval.m_block.startCol() + aEval.m_block.blockCols()
494 : aEval.m_block.startRow() + aEval.m_block.blockRows()) {
495 while ((EvalIterator::operator
bool()) &&
496 (EvalIterator::index() < (XprIsRowMajor ? m_block.startCol() : m_block.startRow())))
497 EvalIterator::operator++();
500 inline StorageIndex index()
const {
501 return EvalIterator::index() - convert_index<StorageIndex>(XprIsRowMajor ? m_block.startCol() : m_block.startRow());
503 inline Index outer()
const {
504 return EvalIterator::outer() - (XprIsRowMajor ? m_block.startRow() : m_block.startCol());
506 inline Index row()
const {
return EvalIterator::row() - m_block.startRow(); }
507 inline Index col()
const {
return EvalIterator::col() - m_block.startCol(); }
509 inline operator bool()
const {
return EvalIterator::operator bool() && EvalIterator::index() < m_end; }
512template <
typename ArgType,
int BlockRows,
int BlockCols,
bool InnerPanel>
513class unary_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel>, IteratorBased>::OuterVectorInnerIterator {
515 enum { XprIsRowMajor = int(ArgType::IsRowMajor) == 0 };
522 ItStorage() : unused() {}
525 const unary_evaluator& m_eval;
527 const Index m_innerIndex;
532 void openIterator() {
533 if (m_hasIt) internal::destroy_at(&m_storage.it);
535 internal::construct_at(&m_storage.it, m_eval.m_argImpl, m_outerPos);
540 EIGEN_STRONG_INLINE OuterVectorInnerIterator(
const unary_evaluator& aEval, Index outer)
542 m_outerPos((XprIsRowMajor ? aEval.m_block.startCol() : aEval.m_block.startRow())),
543 m_innerIndex(XprIsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol()),
544 m_end(XprIsRowMajor ? aEval.m_block.startCol() + aEval.m_block.blockCols()
545 : aEval.m_block.startRow() + aEval.m_block.blockRows()),
547 EIGEN_UNUSED_VARIABLE(outer);
548 eigen_assert(outer == 0);
550 if (m_outerPos >= m_end)
return;
552 while (m_storage.it && m_storage.it.index() < m_innerIndex) ++m_storage.it;
553 if ((!m_storage.it) || (m_storage.it.index() != m_innerIndex)) ++(*this);
556 OuterVectorInnerIterator(
const OuterVectorInnerIterator& other)
557 : m_eval(other.m_eval),
558 m_outerPos(other.m_outerPos),
559 m_innerIndex(other.m_innerIndex),
561 m_hasIt(other.m_hasIt) {
562 if (m_hasIt) internal::construct_at(&m_storage.it, other.m_storage.it);
565 ~OuterVectorInnerIterator() {
566 if (m_hasIt) internal::destroy_at(&m_storage.it);
569 inline StorageIndex index()
const {
570 return convert_index<StorageIndex>(m_outerPos -
571 (XprIsRowMajor ? m_eval.m_block.startCol() : m_eval.m_block.startRow()));
573 inline Index outer()
const {
return 0; }
574 inline Index row()
const {
return XprIsRowMajor ? 0 : index(); }
575 inline Index col()
const {
return XprIsRowMajor ? index() : 0; }
577 inline Scalar value()
const {
return m_storage.it.value(); }
578 inline Scalar& valueRef() {
return m_storage.it.valueRef(); }
580 inline OuterVectorInnerIterator& operator++() {
582 while (++m_outerPos < m_end) {
586 while (m_storage.it && m_storage.it.index() < m_innerIndex) ++m_storage.it;
587 if (m_storage.it && m_storage.it.index() == m_innerIndex)
break;
592 inline operator bool()
const {
return m_outerPos < m_end; }
595template <
typename Scalar_,
int Options_,
typename StorageIndex_,
int BlockRows,
int BlockCols>
596struct unary_evaluator<Block<SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true>, IteratorBased>
598 SparseCompressedBase<Block<SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true> > > {
599 using XprType = Block<SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols,
true>;
600 using Base = evaluator<SparseCompressedBase<XprType>>;
601 explicit unary_evaluator(
const XprType& xpr) : Base(xpr) {}
604template <
typename Scalar_,
int Options_,
typename StorageIndex_,
int BlockRows,
int BlockCols>
605struct unary_evaluator<Block<const SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true>,
607 : evaluator<SparseCompressedBase<
608 Block<const SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols, true> > > {
609 using XprType = Block<const SparseMatrix<Scalar_, Options_, StorageIndex_>, BlockRows, BlockCols,
true>;
610 using Base = evaluator<SparseCompressedBase<XprType>>;
611 explicit unary_evaluator(
const XprType& xpr) : Base(xpr) {}
BlockImpl(XprType &xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
Definition SparseBlock.h:380
BlockImpl(XprType &xpr, Index i)
Definition SparseBlock.h:371
Expression of a fixed-size or dynamic-size block.
Definition Block.h:111
Common base class for sparse [compressed]-{row|column}-storage format.
Definition SparseCompressedBase.h:44
Index nonZeros() const
Definition SparseCompressedBase.h:65
SparseCompressedBase()=default
constexpr RowXpr row(Index i)
Definition SparseMatrixBase.h:1095
typename internal::traits< Derived >::StorageIndex StorageIndex
Definition SparseMatrixBase.h:45
constexpr ColXpr col(Index i)
Definition SparseMatrixBase.h:1082
@ IsVectorAtCompileTime
Definition SparseMatrixBase.h:82
@ ColsAtCompileTime
Definition SparseMatrixBase.h:66
@ RowsAtCompileTime
Definition SparseMatrixBase.h:60
A versatile sparse matrix representation.
Definition SparseMatrix.h:121
constexpr unsigned int CompressedAccessBit
Definition Constants.h:196
constexpr Derived & derived()
Definition EigenBase.h:50
Eigen::Index Index
The interface type of indices.
Definition EigenBase.h:44
Definition Constants.h:545