HomeSort by relevance Sort by last modified time
    Searched defs:outerIndexPtr (Results 1 - 7 of 7) sorted by null

  /external/eigen/Eigen/src/SparseCore/
SparseTranspose.h 35 inline const StorageIndex* outerIndexPtr() const { return derived().nestedExpression().outerIndexPtr(); }
40 inline StorageIndex* outerIndexPtr() { return derived().nestedExpression().outerIndexPtr(); }
SparseCompressedBase.h 58 if(Derived::IsVectorAtCompileTime && outerIndexPtr()==0)
61 return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0];
70 * \sa innerIndexPtr(), outerIndexPtr() */
74 * \sa innerIndexPtr(), outerIndexPtr() */
79 * \sa valuePtr(), outerIndexPtr() */
83 * \sa valuePtr(), outerIndexPtr() */
90 inline const StorageIndex* outerIndexPtr() const { return derived().outerIndexPtr(); }
95 inline StorageIndex* outerIndexPtr() { return derived().outerIndexPtr();
    [all...]
SparseMap.h 98 /** \copydoc SparseMatrix::outerIndexPtr */
99 inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; }
124 inline SparseMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer innerIndexPtr,
126 : m_outerSize(IsRowMajor?rows:cols), m_innerSize(IsRowMajor?cols:rows), m_zero_nnz(0,internal::convert_index<StorageIndex>(nnz)), m_outerIndex(outerIndexPtr),
167 using Base::outerIndexPtr;
173 /** \copydoc SparseMatrix::outerIndexPtr */
174 inline StorageIndex* outerIndexPtr() { return Base::m_outerIndex; }
195 inline SparseMapBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr,
197 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr)
238 * stored as a sparse format as defined by the pointers \a outerIndexPtr, \a innerIndexPtr, and \a valuePtr
    [all...]
SparseBlock.h 133 Index start = m_outerStart==0 ? 0 : m_matrix.outerIndexPtr()[m_outerStart]; // starting position of the current block
134 Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()]; // ending position of the current block
136 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
142 Index tmp_start = tmp.outerIndexPtr()[0];
159 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
187 matrix.outerIndexPtr()[m_outerStart] = StorageIndex(start);
197 matrix.outerIndexPtr()[m_outerStart+k] = p;
207 matrix.outerIndexPtr()[k] += offset;
229 inline const StorageIndex* outerIndexPtr() const
230 { return m_matrix.outerIndexPtr() + m_outerStart;
    [all...]
SparseVector.h 92 inline const StorageIndex* outerIndexPtr() const { return 0; }
93 inline StorageIndex* outerIndexPtr() { return 0; }
SparseMatrix.h 147 * \sa innerIndexPtr(), outerIndexPtr() */
151 * \sa innerIndexPtr(), outerIndexPtr() */
156 * \sa valuePtr(), outerIndexPtr() */
160 * \sa valuePtr(), outerIndexPtr() */
166 inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; }
170 inline StorageIndex* outerIndexPtr() { return m_outerIndex; }
    [all...]
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 428 ei_declare_aligned_stack_constructed_variable(StorageIndex,outerIndexPtr,mat.cols()+1,mat.isCompressed()?const_cast<StorageIndex*>(mat.outerIndexPtr()):0);
432 IndexVector::Map(outerIndexPtr, mat.cols()+1) = IndexVector::Map(m_mat.outerIndexPtr(),mat.cols()+1);
437 m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i];
438 m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i];
514 const StorageIndex * outerIndexPtr;
515 if (matrix.isCompressed()) outerIndexPtr = matrix.outerIndexPtr()
    [all...]

Completed in 86 milliseconds