25 #ifndef EIGEN_SPARSE_BLOCKFORDYNAMICMATRIX_H
26 #define EIGEN_SPARSE_BLOCKFORDYNAMICMATRIX_H
34 template<
typename _Scalar,
int _Options,
typename _Index,
int Size>
35 class SparseInnerVectorSet<DynamicSparseMatrix<_Scalar, _Options, _Index>, Size>
36 :
public SparseMatrixBase<SparseInnerVectorSet<DynamicSparseMatrix<_Scalar, _Options, _Index>, Size> >
38 typedef DynamicSparseMatrix<_Scalar, _Options, _Index> MatrixType;
41 enum { IsRowMajor = internal::traits<SparseInnerVectorSet>::IsRowMajor };
43 EIGEN_SPARSE_PUBLIC_INTERFACE(SparseInnerVectorSet)
44 class InnerIterator: public MatrixType::InnerIterator
47 inline InnerIterator(
const SparseInnerVectorSet& xpr, Index outer)
48 : MatrixType::InnerIterator(xpr.m_matrix, xpr.m_outerStart + outer), m_outer(outer)
50 inline Index
row()
const {
return IsRowMajor ? m_outer : this->index(); }
51 inline Index
col()
const {
return IsRowMajor ? this->index() : m_outer; }
56 inline SparseInnerVectorSet(
const MatrixType& matrix, Index outerStart, Index outerSize)
57 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize)
59 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) );
62 inline SparseInnerVectorSet(
const MatrixType& matrix, Index outer)
63 : m_matrix(matrix), m_outerStart(outer), m_outerSize(Size)
65 eigen_assert(Size!=Dynamic);
66 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
69 template<
typename OtherDerived>
70 inline SparseInnerVectorSet& operator=(
const SparseMatrixBase<OtherDerived>& other)
72 if (IsRowMajor != ((OtherDerived::Flags&RowMajorBit)==RowMajorBit))
75 DynamicSparseMatrix<Scalar,IsRowMajor?RowMajorBit:0> aux(other);
76 *
this = aux.markAsRValue();
81 for (Index j=0; j<m_outerSize.value(); ++j)
83 SparseVector<Scalar,IsRowMajor ? RowMajorBit : 0> aux(other.innerVector(j));
84 m_matrix.const_cast_derived()._data()[m_outerStart+j].swap(aux._data());
90 inline SparseInnerVectorSet& operator=(
const SparseInnerVectorSet& other)
92 return operator=<SparseInnerVectorSet>(other);
95 Index nonZeros()
const
98 for (Index j=0; j<m_outerSize.value(); ++j)
99 count += m_matrix._data()[m_outerStart+j].size();
103 const Scalar& lastCoeff()
const
105 EIGEN_STATIC_ASSERT_VECTOR_ONLY(SparseInnerVectorSet);
106 eigen_assert(m_matrix.data()[m_outerStart].size()>0);
107 return m_matrix.data()[m_outerStart].vale(m_matrix.data()[m_outerStart].size()-1);
116 EIGEN_STRONG_INLINE Index rows()
const {
return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
117 EIGEN_STRONG_INLINE Index cols()
const {
return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
121 const typename MatrixType::Nested m_matrix;
123 const internal::variable_if_dynamic<Index, Size> m_outerSize;
129 #endif // EIGEN_SPARSE_BLOCKFORDYNAMICMATRIX_H