/external/eigen/Eigen/src/MetisSupport/ |
MetisSupport.h | 26 typedef Matrix<StorageIndex,Dynamic,1> IndexVector; 37 IndexVector visited(m); 106 IndexVector perm(m),iperm(m); 132 IndexVector m_indexPtr; // Pointer to the adjacenccy list of each row/column 133 IndexVector m_innerIndices; // Adjacency list
|
/external/eigen/Eigen/src/SparseLU/ |
SparseLUImpl.h | 24 typedef Matrix<StorageIndex,Dynamic,1> IndexVector; 30 typedef LU_GlobalLU_t<IndexVector, ScalarVector> GlobalLU_t; 39 void heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); 40 void relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); 41 Index snode_dfs(const Index jcol, const Index kcol,const MatrixType& mat, IndexVector& xprune, IndexVector& marker, GlobalLU_t& glu); [all...] |
SparseLU_SupernodalMatrix.h | 38 typedef Matrix<StorageIndex,Dynamic,1> IndexVector; 45 MappedSuperNodalMatrix(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowind, 46 IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col ) 61 void setInfos(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowind, 62 IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col [all...] |
SparseLU.h | 90 typedef Matrix<StorageIndex,Dynamic,1> IndexVector; 380 IndexVector m_etree; // Column elimination tree 432 IndexVector::Map(outerIndexPtr, mat.cols()+1) = IndexVector::Map(m_mat.outerIndexPtr(),mat.cols()+1); 443 IndexVector firstRowElt; 448 IndexVector post, iwork; 502 typedef typename IndexVector::Scalar StorageIndex; 550 IndexVector segrep(m); segrep.setZero(); 551 IndexVector parent(m); parent.setZero(); 552 IndexVector xplore(m); xplore.setZero() [all...] |
/external/vulkan-validation-layers/layers/ |
parameter_name.h | 42 * validate_stype(ParameterName("pCreateInfo[%i].sType", IndexVector{ i }), pCreateInfo[i].sType); 47 typedef std::vector<size_t> IndexVector; 90 ParameterName(const std::string &source, const IndexVector &args) : source_(source), args_(args) { assert(IsValid()); } 101 ParameterName(const std::string &&source, const IndexVector &&args) : source_(std::move(source)), args_(std::move(args)) { 145 IndexVector args_; ///< Array index values for formatting.
|
/external/eigen/Eigen/src/OrderingMethods/ |
Ordering.h | 122 typedef Matrix<StorageIndex, Dynamic, 1> IndexVector; 142 IndexVector p(n+1), A(Alen);
|
/external/eigen/Eigen/src/SparseCore/ |
SparseCompressedBase.h | 49 typedef typename Base::IndexVector IndexVector; 50 Eigen::Map<IndexVector> innerNonZeros() { return Eigen::Map<IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); } 51 const Eigen::Map<const IndexVector> innerNonZeros() const { return Eigen::Map<const IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
|
SparseBlock.h | 107 typedef typename Base::IndexVector IndexVector;
|
SparseMatrixBase.h | 51 typedef Matrix<StorageIndex,Dynamic,1> IndexVector;
|
SparseMatrix.h | 122 typedef typename Base::IndexVector IndexVector; 748 Eigen::Map<IndexVector>(this->m_data.indexPtr(), rows()).setLinSpaced(0, StorageIndex(rows()-1)); 750 Eigen::Map<IndexVector>(this->m_outerIndex, rows()+1).setLinSpaced(0, StorageIndex(rows())); [all...] |
/external/eigen/Eigen/src/SparseQR/ |
SparseQR.h | 84 typedef Matrix<StorageIndex, Dynamic, 1> IndexVector; 288 IndexVector m_etree; // Column elimination tree 289 IndexVector m_firstRowElt; // First element in each row 356 IndexVector mark((std::max)(m,n)); mark.setConstant(-1); // Record the visited nodes 357 IndexVector Ridx(n), Qidx(m); // Store temporarily the row indexes for the current column of R and Q 379 IndexVector originalOuterIndicesCpy; 383 originalOuterIndicesCpy = IndexVector::Map(m_pmat.outerIndexPtr(),n+1);
|
/external/llvm/lib/Analysis/ |
LoopAccessAnalysis.cpp | [all...] |