/external/eigen/Eigen/src/SparseCore/ |
D | SparseCompressedBase.h | 58 if(Derived::IsVectorAtCompileTime && outerIndexPtr()==0) 61 return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0]; 90 inline const StorageIndex* outerIndexPtr() const { return derived().outerIndexPtr(); } 95 inline StorageIndex* outerIndexPtr() { return derived().outerIndexPtr(); } 160 if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0) 167 m_id = mat.outerIndexPtr()[outer]; 169 m_end = mat.outerIndexPtr()[outer+1]; 220 if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0) 227 m_start = mat.outerIndexPtr()[outer]; 229 m_id = mat.outerIndexPtr()[outer+1]; [all …]
|
D | SparseMap.h | 99 inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; } 124 …inline SparseMapBase(Index rows, Index cols, Index nnz, IndexPointer outerIndexPtr, IndexPointer i… 126 …?cols:rows), m_zero_nnz(0,internal::convert_index<StorageIndex>(nnz)), m_outerIndex(outerIndexPtr), 167 using Base::outerIndexPtr; 174 inline StorageIndex* outerIndexPtr() { return Base::m_outerIndex; } 195 …inline SparseMapBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex*… 197 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) 245 inline Map(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, 247 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) 270 inline Map(Index rows, Index cols, Index nnz, const StorageIndex* outerIndexPtr, [all …]
|
D | SparseTranspose.h | 35 …inline const StorageIndex* outerIndexPtr() const { return derived().nestedExpression().outerIndexP… in outerIndexPtr() function 40 inline StorageIndex* outerIndexPtr() { return derived().nestedExpression().outerIndexPtr(); } in outerIndexPtr() function
|
D | SparseBlock.h | 133 …Index start = m_outerStart==0 ? 0 : m_matrix.outerIndexPtr()[m_outerStart]; // starting po… 134 …Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()]; // ending positi… 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 in outerIndexPtr() function 230 { return m_matrix.outerIndexPtr() + m_outerStart; } in outerIndexPtr() [all …]
|
D | MappedSparseMatrix.h | 42 …inline MappedSparseMatrix(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageI… 43 : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZeroPtr)
|
D | SparseSelfAdjointView.h | 470 dest.outerIndexPtr()[0] = 0; 472 dest.outerIndexPtr()[j+1] = dest.outerIndexPtr()[j] + count[j]; 474 count[j] = dest.outerIndexPtr()[j]; 551 dest.outerIndexPtr()[0] = 0; 553 dest.outerIndexPtr()[j+1] = dest.outerIndexPtr()[j] + count[j]; 554 dest.resizeNonZeros(dest.outerIndexPtr()[size]); 556 count[j] = dest.outerIndexPtr()[j];
|
D | SparseVector.h | 92 inline const StorageIndex* outerIndexPtr() const { return 0; } 93 inline StorageIndex* outerIndexPtr() { return 0; }
|
D | SparseRef.h | 100 if(expr.outerIndexPtr()==0) 103 …st<Base*>(this)) Base(expr.rows(), expr.cols(), expr.nonZeros(), expr.outerIndexPtr(), expr.innerI…
|
D | SparseAssign.h | 196 Map<ArrayXI>(dst.outerIndexPtr(), size+1).setLinSpaced(0,StorageIndex(size));
|
/external/eigen/Eigen/src/SparseLU/ |
D | SparseLU.h | 428 …nstructed_variable(StorageIndex,outerIndexPtr,mat.cols()+1,mat.isCompressed()?const_cast<StorageIn… in analyzePattern() 432 …IndexVector::Map(outerIndexPtr, mat.cols()+1) = IndexVector::Map(m_mat.outerIndexPtr(),mat.cols()+… in analyzePattern() 437 m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i]; in analyzePattern() 438 m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i]; in analyzePattern() 514 const StorageIndex * outerIndexPtr; in factorize() local 515 if (matrix.isCompressed()) outerIndexPtr = matrix.outerIndexPtr(); in factorize() 519 for(Index i = 0; i <= matrix.cols(); i++) outerIndexPtr_t[i] = m_mat.outerIndexPtr()[i]; in factorize() 520 outerIndexPtr = outerIndexPtr_t; in factorize() 524 m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i]; in factorize() 525 m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i]; in factorize() [all …]
|
/external/eigen/Eigen/src/UmfPackSupport/ |
D | UmfPackSupport.h | 325 … mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), in analyzePattern_impl() 337 …m_fact_errorCode = umfpack_numeric(mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix… in factorize_impl() 406 umfpack_get_numeric(m_l.outerIndexPtr(), m_l.innerIndexPtr(), m_l.valuePtr(), in extractData() 407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData() 444 mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), in _solve_impl()
|
/external/eigen/Eigen/src/PaStiXSupport/ |
D | PaStiXSupport.h | 99 if ( !(mat.outerIndexPtr()[0]) ) 103 ++mat.outerIndexPtr()[i]; 114 if ( mat.outerIndexPtr()[0] == 1 ) 118 --mat.outerIndexPtr()[i]; 321 …internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexP… 346 …internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexP…
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
D | RandomSetter.h | 256 mp_target->outerIndexPtr()[j] = count; in ~RandomSetter() 261 mp_target->outerIndexPtr()[mp_target->outerSize()] = count; in ~RandomSetter() 276 Index posStart = mp_target->outerIndexPtr()[outer]; in ~RandomSetter()
|
D | BlockSparseMatrix.h | 868 inline StorageIndex *outerIndexPtr() {return m_outerIndex; } 869 inline const StorageIndex* outerIndexPtr() const {return m_outerIndex; }
|
/external/eigen/Eigen/src/SparseCholesky/ |
D | SimplicialCholesky_impl.h | 85 StorageIndex* Lp = m_matrix.outerIndexPtr(); in analyzePattern_preordered() 111 const StorageIndex* Lp = m_matrix.outerIndexPtr(); in factorize_preordered()
|
/external/eigen/Eigen/src/PardisoSupport/ |
D | PardisoSupport.h | 270 … 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/SuperLUSupport/ |
D | SuperLUSupport.h | 215 res.storage.outerInd = mat.outerIndexPtr(); in Map() 274 res.storage.outerInd = mat.outerIndexPtr(); 725 int* Lcol = m_l.outerIndexPtr(); 729 int* Ucol = m_u.outerIndexPtr(); 803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0) 805 int lastId = m_u.outerIndexPtr()[j+1]-1;
|
/external/eigen/test/ |
D | sparse_basic.cpp | 401 …Map<SparseMatrixType> mapMat2(m2.rows(), m2.cols(), m2.nonZeros(), m2.outerIndexPtr(), m2.innerInd… in sparse_basic() 402 …Map<SparseMatrixType> mapMat3(m3.rows(), m3.cols(), m3.nonZeros(), m3.outerIndexPtr(), m3.innerInd… in sparse_basic() 407 …Options,StorageIndex> mapMat2(m2.rows(), m2.cols(), m2.nonZeros(), m2.outerIndexPtr(), m2.innerInd… in sparse_basic() 408 …Options,StorageIndex> mapMat3(m3.rows(), m3.cols(), m3.nonZeros(), m3.outerIndexPtr(), m3.innerInd… in sparse_basic() 418 …Map<SparseMatrixType> mapMat2(rows, cols, m2.nonZeros(), m2.outerIndexPtr(), m2.innerIndexPtr(), m… in sparse_basic()
|
D | sparse_solvers.cpp | 65 …MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(… in sparse_solvers()
|
/external/eigen/Eigen/src/OrderingMethods/ |
D | Ordering.h | 143 for(StorageIndex i=0; i <= n; i++) p(i) = mat.outerIndexPtr()[i]; in operator()
|
D | Amd.h | 124 StorageIndex* Cp = C.outerIndexPtr(); in minimum_degree_ordering()
|
/external/eigen/doc/ |
D | SparseQuickReference.dox | 248 sm1.outerIndexPtr(); // Pointer to the beginning of each inner vector 260 int outerIndexPtr[cols+1]; 263 Map<SparseMatrix<double> > sm1(rows,cols,nnz,outerIndexPtr, // read-write
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
D | IncompleteCholesky.h | 220 Map<VectorIx> colPtr( m_L.outerIndexPtr(), n+1); // Pointer to the beginning of each row in factorize() 331 colPtr = Map<const VectorIx>(L_save.outerIndexPtr(), n+1); in factorize()
|
/external/eigen/Eigen/src/SparseQR/ |
D | SparseQR.h | 380 const StorageIndex *originalOuterIndices = mat.outerIndexPtr(); 383 originalOuterIndicesCpy = IndexVector::Map(m_pmat.outerIndexPtr(),n+1); 390 m_pmat.outerIndexPtr()[p] = originalOuterIndices[i];
|
/external/eigen/Eigen/src/CholmodSupport/ |
D | CholmodSupport.h | 64 res.p = mat.outerIndexPtr();
|