/external/eigen/Eigen/src/SparseCore/ |
H A D | MappedSparseMatrix.h | 61 inline const Index* innerIndexPtr() const { return m_innerIndices; } function in class:Eigen::MappedSparseMatrix 62 inline Index* innerIndexPtr() { return m_innerIndices; } function in class:Eigen::MappedSparseMatrix 108 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr) argument 110 m_innerIndices(innerIndexPtr), m_values(valuePtr) 134 inline Index index() const { return m_matrix.innerIndexPtr()[m_id]; } 165 inline Index index() const { return m_matrix.innerIndexPtr()[m_id-1]; }
|
H A D | SparseSelfAdjointView.h | 376 dest.innerIndexPtr()[k] = StorageOrderMatch ? ip : jp; 382 dest.innerIndexPtr()[k] = ip; 390 dest.innerIndexPtr()[k] = ip; 393 dest.innerIndexPtr()[k] = jp; 451 dest.innerIndexPtr()[k] = int(DstUpLo)==int(Lower) ? (std::max)(ip,jp) : (std::min)(ip,jp);
|
H A D | SparseBlock.h | 219 inline const Index* innerIndexPtr() const function in class:Eigen::BlockImpl 220 { return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; } 221 inline Index* innerIndexPtr() function in class:Eigen::BlockImpl 222 { return m_matrix.const_cast_derived().innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; } 325 inline const Index* innerIndexPtr() const function in class:Eigen::BlockImpl 326 { return m_matrix.innerIndexPtr() + m_matrix.outerIndexPtr()[m_outerStart]; }
|
H A D | SparseVector.h | 90 EIGEN_STRONG_INLINE const Index* innerIndexPtr() const { return &m_data.index(0); } function in class:Eigen::SparseVector 91 EIGEN_STRONG_INLINE Index* innerIndexPtr() { return &m_data.index(0); } function in class:Eigen::SparseVector
|
H A D | SparseMatrix.h | 130 * \sa innerIndexPtr(), outerIndexPtr() */ 134 * \sa innerIndexPtr(), outerIndexPtr() */ 140 inline const Index* innerIndexPtr() const { return &m_data.index(0); } function in class:Eigen::SparseMatrix 144 inline Index* innerIndexPtr() { return &m_data.index(0); } function in class:Eigen::SparseMatrix 148 * \sa valuePtr(), innerIndexPtr() */ 152 * \sa valuePtr(), innerIndexPtr() */ 873 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer), m_id(mat.m_outerIndex[outer]) 906 : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer), m_start(mat.m_outerIndex[outer])
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
H A D | RandomSetter.h | 278 while ( (i >= posStart) && (mp_target->innerIndexPtr()[i] > inner) ) 281 mp_target->innerIndexPtr()[i+1] = mp_target->innerIndexPtr()[i]; 284 mp_target->innerIndexPtr()[i+1] = inner;
|
/external/eigen/Eigen/src/UmfPackSupport/ |
H A D | UmfPackSupport.h | 309 m_innerIndexPtr = m_copyMatrix.innerIndexPtr(); 315 m_innerIndexPtr = mat.innerIndexPtr(); 325 m_innerIndexPtr = m_copyMatrix.innerIndexPtr(); 403 umfpack_get_numeric(m_l.outerIndexPtr(), m_l.innerIndexPtr(), m_l.valuePtr(), 404 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(),
|
/external/eigen/Eigen/src/OrderingMethods/ |
H A D | Ordering.h | 141 for(Index i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i];
|
H A D | Amd.h | 122 Index* Ci = C.innerIndexPtr();
|
/external/eigen/Eigen/src/PaStiXSupport/ |
H A D | PaStiXSupport.h | 97 ++mat.innerIndexPtr()[i]; 112 --mat.innerIndexPtr()[i]; 342 internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(), 367 internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(),
|
/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 297 m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), 320 m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), 340 m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), 384 m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(),
|
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky_impl.h | 112 Index* Li = m_matrix.innerIndexPtr();
|
/external/eigen/Eigen/src/SuperLUSupport/ |
H A D | SuperLUSupport.h | 188 res.storage.innerInd = mat.derived().innerIndexPtr(); 247 res.storage.innerInd = mat.innerIndexPtr(); 709 int* Lrow = m_l.innerIndexPtr(); 713 int* Urow = m_u.innerIndexPtr(); 789 eigen_assert(m_u.innerIndexPtr()[lastId]<=j); 790 if (m_u.innerIndexPtr()[lastId]==j)
|
/external/eigen/test/ |
H A D | sparse_solvers.cpp | 64 //Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr 65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteCholesky.h | 149 Map<IndexType> rowIdx(m_L.innerIndexPtr(), nnz); //Row indices
|
/external/ceres-solver/internal/ceres/ |
H A D | covariance_impl.cc | 731 qr_solver.matrixR().innerIndexPtr(),
|
/external/eigen/Eigen/src/CholmodSupport/ |
H A D | CholmodSupport.h | 59 res.i = mat.innerIndexPtr();
|