/external/chromium_org/chrome/browser/safe_browsing/ |
H A D | prefix_set.h | 107 typedef std::vector<IndexPair> IndexVector; typedef in class:safe_browsing::PrefixSet 127 PrefixSet(IndexVector* index, 135 IndexVector index_;
|
/external/eigen/Eigen/src/SparseLU/ |
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_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.h | 84 typedef Matrix<Index,Dynamic,1> IndexVector; typedef in class:Eigen::SparseLU 340 IndexVector m_etree; // Column elimination tree 401 IndexVector firstRowElt; 406 IndexVector post, iwork; 460 typedef typename IndexVector::Scalar Index; 506 IndexVector segrep(m); segrep.setZero(); 507 IndexVector parent(m); parent.setZero(); 508 IndexVector xplore(m); xplore.setZero(); 509 IndexVector repfnz(maxpanel); 510 IndexVector panel_lsu [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 328 IndexVector mark((std::max)(m,n)); mark.setConstant(-1); // Record the visited nodes 329 IndexVector Ridx(n), Qidx(m); // Store temporarily the row indexes for the current column of R and Q
|
/external/lldb/source/Expression/ |
H A D | IRInterpreter.cpp | 947 typedef SmallVector <Value *, 8> IndexVector; typedef 948 typedef IndexVector::iterator IndexIterator;
|