/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU_Structs.h | 76 template <typename IndexVector, typename ScalarVector> 78 typedef typename IndexVector::Scalar Index; 79 IndexVector xsup; //First supernode column ... xsup(s) points to the beginning of the s-th supernode 80 IndexVector supno; // Supernode number corresponding to this column (column to supernode mapping) 82 IndexVector lsub; // Compressed row indices of L rectangular supernodes. 83 IndexVector xlusup; // pointers to the beginning of each column in lusup 84 IndexVector xlsub; // pointers to the beginning of each column in lsub 88 IndexVector usub; // row indices of U columns in ucol 89 IndexVector xusub; // Pointers to the beginning of each column of U in ucol
|
H A D | SparseLUImpl.h | 24 typedef Matrix<Index,Dynamic,1> IndexVector; typedef in class:Eigen::internal::SparseLUImpl 28 typedef LU_GlobalLU_t<IndexVector, ScalarVector> GlobalLU_t; 37 void heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); 38 void relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); 39 Index snode_dfs(const Index jcol, const Index kcol,const MatrixType& mat, IndexVector& xprune, IndexVector [all...] |
H A D | SparseLU_panel_dfs.h | 37 template<typename IndexVector> 40 typedef typename IndexVector::Scalar Index; 53 void mem_expand(IndexVector& /*glu.lsub*/, Index /*nextl*/, Index /*chmark*/) {} 62 void SparseLUImpl<Scalar,Index>::dfs_kernel(const Index jj, IndexVector& perm_r, 63 Index& nseg, IndexVector& panel_lsub, IndexVector& segrep, 64 Ref<IndexVector> repfnz_col, IndexVector& xprune, Ref<IndexVector> marker, IndexVector [all...] |
H A D | SparseLU_heap_relax_snode.h | 46 void SparseLUImpl<Scalar,Index>::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end) 50 IndexVector post; 52 IndexVector inv_post(n+1); 57 IndexVector iwork(n); 58 IndexVector et_save(n+1);
|
H A D | SparseLU_relax_snode.h | 47 void SparseLUImpl<Scalar,Index>::relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end)
|
H A D | SparseLU_column_dfs.h | 38 template<typename IndexVector, typename ScalarVector> 42 typedef typename IndexVector::Scalar Index; 50 void mem_expand(IndexVector& lsub, Index& nextl, Index chmark) 93 Index SparseLUImpl<Scalar,Index>::column_dfs(const Index m, const Index jcol, IndexVector& perm_r, Index maxsuper, Index& nseg, BlockIndexVector lsub_col, IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu) 98 VectorBlock<IndexVector> marker [all...] |
H A D | SparseLU_SupernodalMatrix.h | 38 typedef Matrix<Index,Dynamic,1> IndexVector; typedef in class:Eigen::internal::MappedSuperNodalMatrix 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 [all...] |
H A D | SparseLU_copy_to_ucol.h | 50 Index SparseLUImpl<Scalar,Index>::copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu) 79 mem = memXpand<IndexVector>(glu.usub, glu.nzumax, nextu, USUB, glu.num_expansions);
|
H A D | SparseLU_pruneL.h | 53 void SparseLUImpl<Scalar,Index>::pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu)
|
H A D | SparseLU_kernel_bmod.h | 33 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index> 35 const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); 39 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index> 41 const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) 94 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index> 96 const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); 100 template <typename BlockScalarVector, typename ScalarVector, typename IndexVector, typename Index> 102 const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) 108 const /*typename IndexVector::Scalar*/Index* irow(lsub.data()+lptr + no_zeros + 1);
|
H A D | SparseLU_panel_bmod.h | 58 IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu) 91 VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row 112 VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row 159 VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row 194 VectorBlock<IndexVector> repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row
|
H A D | SparseLU_pivotL.h | 60 Index SparseLUImpl<Scalar,Index>::pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu)
|
H A D | SparseLU.h | 84 typedef Matrix<Index,Dynamic,1> IndexVector; typedef in class:Eigen::SparseLU 339 IndexVector m_etree; // Column elimination tree 400 IndexVector firstRowElt; 405 IndexVector post, iwork; 459 typedef typename IndexVector::Scalar Index; 505 IndexVector segrep(m); segrep.setZero(); 506 IndexVector parent(m); parent.setZero(); 507 IndexVector xplore(m); xplore.setZero(); 508 IndexVector repfnz(maxpanel); 509 IndexVector panel_lsu [all...] |
H A D | SparseLU_Utils.h | 52 void SparseLUImpl<Scalar,Index>::fixupL(const Index n, const IndexVector& perm_r, GlobalLU_t& glu)
|
H A D | SparseLU_Memory.h | 183 || (expand<IndexVector> (glu.lsub, glu.nzlmax, 0, 0, num_expansions)<0) 184 || (expand<IndexVector> (glu.usub, glu.nzumax, 0, 1, num_expansions)<0) )
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseColEtree.h | 39 template<typename Index, typename IndexVector> 40 Index etree_find (Index i, IndexVector& pp) 60 template <typename MatrixType, typename IndexVector> 61 int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowElt, typename MatrixType::Index *perm=0) 67 IndexVector root(nc); // root of subtree of etree 69 IndexVector pp(nc); // disjoint sets 130 template <typename Index, typename IndexVector> 131 void nr_etdfs (Index n, IndexVector& parent, IndexVector [all...] |
/external/eigen/Eigen/src/MetisSupport/ |
H A D | MetisSupport.h | 26 typedef Matrix<Index,Dynamic,1> IndexVector; typedef in class:Eigen::MetisOrdering 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/OrderingMethods/ |
H A D | Ordering.h | 119 typedef Matrix<Index, Dynamic, 1> IndexVector; typedef in class:Eigen::COLAMDOrdering 139 IndexVector p(n+1), A(Alen);
|
/external/eigen/Eigen/src/SparseQR/ |
H A D | SparseQR.h | 74 typedef Matrix<Index, Dynamic, 1> IndexVector; typedef in class:Eigen::SparseQR 262 IndexVector m_etree; // Column elimination tree 263 IndexVector m_firstRowElt; // First element in each row 332 IndexVector mark((std::max)(m,n)); mark.setConstant(-1); // Record the visited nodes 333 IndexVector Ridx(n), Qidx(m); // Store temporarily the row indexes for the current column of R and Q 355 IndexVector originalOuterIndicesCpy; 359 originalOuterIndicesCpy = IndexVector::Map(m_pmat.outerIndexPtr(),n+1);
|
/external/llvm/lib/Analysis/ |
H A D | LoopAccessAnalysis.cpp | 871 auto &IndexVector = Accesses.find(Access)->second; 874 std::transform(IndexVector.begin(), IndexVector.end(),
|
/external/lldb/source/Expression/ |
H A D | IRInterpreter.cpp | 947 typedef SmallVector <Value *, 8> IndexVector; typedef 948 typedef IndexVector::iterator IndexIterator;
|