Home
last modified time | relevance | path

Searched refs:innerIndexPtr (Results 1 – 24 of 24) sorted by relevance

/external/eigen/Eigen/src/SparseCore/
DSparseMap.h97 inline const StorageIndex* innerIndexPtr() const { return m_innerIndices; }
124 …eMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer innerIndexPtr,
127 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(innerNonZerosPtr)
131 inline SparseMapBase(Index size, Index nnz, IndexPointer innerIndexPtr, ScalarPointer valuePtr)
133 m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(0)
166 using Base::innerIndexPtr;
172 inline StorageIndex* innerIndexPtr() { return Base::m_innerIndices; }
195 …apBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr,
197 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr)
201 inline SparseMapBase(Index size, Index nnz, StorageIndex* innerIndexPtr, Scalar* valuePtr)
[all …]
DSparseCompressedBase.h80 inline const StorageIndex* innerIndexPtr() const { return derived().innerIndexPtr(); }
84 inline StorageIndex* innerIndexPtr() { return derived().innerIndexPtr(); }
158 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer)
176 …: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_id(0), m_end(mat.nonZero…
218 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer)
236 …: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_start(0), m_id(mat.nonZe…
328 …ex p = std::lower_bound(m_matrix->innerIndexPtr()+start, m_matrix->innerIndexPtr()+end,inner) - m_…
330 return ((p<end) && (m_matrix->innerIndexPtr()[p]==inner)) ? p : Dynamic;
DSparseTranspose.h34 …inline const StorageIndex* innerIndexPtr() const { return derived().nestedExpression().innerIndexP… in innerIndexPtr() function
39 inline StorageIndex* innerIndexPtr() { return derived().nestedExpression().innerIndexPtr(); } in innerIndexPtr() function
DSparseBlock.h151 …internal::smart_copy(m_matrix.innerIndexPtr(), m_matrix.innerIndexPtr() + start, newdata.indexPtr…
154 …internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, newd…
157 …internal::smart_copy(matrix.innerIndexPtr()+end, matrix.innerIndexPtr()+end + tail_size, newdata.…
173 …internal::smart_memmove(matrix.innerIndexPtr()+end, matrix.innerIndexPtr() + end+tail_size, matrix…
179 …internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, matr…
224 inline const StorageIndex* innerIndexPtr() const in innerIndexPtr() function
225 { return m_matrix.innerIndexPtr(); } in innerIndexPtr()
226 inline StorageIndex* innerIndexPtr() in innerIndexPtr() function
227 { return m_matrix.innerIndexPtr(); } in innerIndexPtr()
DMappedSparseMatrix.h42 …ws, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr, Scalar* value…
43 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZeroPtr)
DSparseSelfAdjointView.h492 dest.innerIndexPtr()[k] = StorageOrderMatch ? ip : jp;
498 dest.innerIndexPtr()[k] = ip;
506 dest.innerIndexPtr()[k] = ip;
509 dest.innerIndexPtr()[k] = jp;
572 dest.innerIndexPtr()[k] = int(DstMode)==int(Lower) ? (std::max)(ip,jp) : (std::min)(ip,jp);
DSparseVector.h89 EIGEN_STRONG_INLINE const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
90 EIGEN_STRONG_INLINE StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
DSparseRef.h101 …::new (static_cast<Base*>(this)) Base(expr.size(), expr.nonZeros(), expr.innerIndexPtr(), expr.val…
103 …expr.rows(), expr.cols(), expr.nonZeros(), expr.outerIndexPtr(), expr.innerIndexPtr(), expr.valueP…
DSparseAssign.h195 Map<ArrayXI>(dst.innerIndexPtr(), size).setLinSpaced(0,StorageIndex(size)-1);
DSparseMatrix.h157 inline const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
161 inline StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
/external/eigen/unsupported/Eigen/src/SparseExtra/
DRandomSetter.h278 while ( (i >= posStart) && (mp_target->innerIndexPtr()[i] > inner) ) in ~RandomSetter()
281 mp_target->innerIndexPtr()[i+1] = mp_target->innerIndexPtr()[i]; in ~RandomSetter()
284 mp_target->innerIndexPtr()[i+1] = inner; in ~RandomSetter()
DBlockSparseMatrix.h866 inline StorageIndex *innerIndexPtr() {return m_indices; }
867 inline const StorageIndex *innerIndexPtr() const {return m_indices; }
/external/eigen/Eigen/src/UmfPackSupport/
DUmfPackSupport.h372 … mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), in analyzePattern_impl()
385 …m_fact_errorCode = umfpack_numeric(mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix… in factorize_impl()
455 umfpack_get_numeric(m_l.outerIndexPtr(), m_l.innerIndexPtr(), m_l.valuePtr(), in extractData()
456 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
493 mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), in _solve_impl()
/external/eigen/Eigen/src/PardisoSupport/
DPardisoSupport.h270 … m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(),
291 … m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(),
311 … m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(),
358 … m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(),
/external/eigen/Eigen/src/PaStiXSupport/
DPaStiXSupport.h105 ++mat.innerIndexPtr()[i];
120 --mat.innerIndexPtr()[i];
321 …rnal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(),
346 …rnal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(),
/external/eigen/Eigen/src/SuperLUSupport/
DSuperLUSupport.h214 res.storage.innerInd = mat.innerIndexPtr(); in Map()
273 res.storage.innerInd = mat.innerIndexPtr();
726 int* Lrow = m_l.innerIndexPtr();
730 int* Urow = m_u.innerIndexPtr();
806 eigen_assert(m_u.innerIndexPtr()[lastId]<=j);
807 if (m_u.innerIndexPtr()[lastId]==j)
/external/eigen/Eigen/src/OrderingMethods/
DOrdering.h144 for(StorageIndex i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i]; in operator()
DAmd.h125 StorageIndex* Ci = C.innerIndexPtr(); in minimum_degree_ordering()
/external/eigen/test/
Dsparse_basic.cpp401 …> mapMat2(m2.rows(), m2.cols(), m2.nonZeros(), m2.outerIndexPtr(), m2.innerIndexPtr(), m2.valuePtr… in sparse_basic()
402 …> mapMat3(m3.rows(), m3.cols(), m3.nonZeros(), m3.outerIndexPtr(), m3.innerIndexPtr(), m3.valuePtr… in sparse_basic()
407 …> mapMat2(m2.rows(), m2.cols(), m2.nonZeros(), m2.outerIndexPtr(), m2.innerIndexPtr(), m2.valuePtr… in sparse_basic()
408 …> mapMat3(m3.rows(), m3.cols(), m3.nonZeros(), m3.outerIndexPtr(), m3.innerIndexPtr(), m3.valuePtr… in sparse_basic()
418 …Map<SparseMatrixType> mapMat2(rows, cols, m2.nonZeros(), m2.outerIndexPtr(), m2.innerIndexPtr(), m… in sparse_basic()
Dsparse_solvers.cpp65 …trix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePt… in sparse_solvers()
Dsparse_solver.h86 …t_cast<StorageIndex*>(A.outerIndexPtr()), const_cast<StorageIndex*>(A.innerIndexPtr()), const_cast… in check_sparse_solving()
/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteCholesky.h219 Map<VectorIx> rowIdx(m_L.innerIndexPtr(), nnz); //Row indices in factorize()
330 rowIdx = Map<const VectorIx>(L_save.innerIndexPtr(), nnz); in factorize()
/external/eigen/Eigen/src/SparseCholesky/
DSimplicialCholesky_impl.h112 StorageIndex* Li = m_matrix.innerIndexPtr(); in factorize_preordered()
/external/eigen/Eigen/src/CholmodSupport/
DCholmodSupport.h65 res.i = mat.innerIndexPtr();