Searched refs:VectorI (Results 1 – 4 of 4) sorted by relevance
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | IncompleteLUT.h | 28 template <typename VectorV, typename VectorI>
29 Index QuickSplit(VectorV &row, VectorI &ind, Index ncut) in QuickSplit()
109 typedef Matrix<StorageIndex,Dynamic,1> VectorI; typedef
265 VectorI ju(n); // column position of the values in u -- maximum size is n in factorize()
266 …VectorI jr(n); // Indicate the position of the nonzero elements in the vector u -- A zero locati… in factorize()
417 typename VectorI::SegmentReturnType jul(ju.segment(0, sizel)); in factorize()
446 typename VectorI::SegmentReturnType juu(ju.segment(ii+1, sizeu-1)); in factorize()
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseSelfAdjointView.h | 58 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
432 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
443 VectorI count;
522 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
536 VectorI count(size);
609 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| D | SimplicialCholesky.h | 70 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
257 VectorI m_parent; // elimination tree
258 VectorI m_nonZerosPerCol;
|
| /external/eigen/test/ |
| D | sparse_permutations.cpp | 52 typedef Matrix<StorageIndex,Dynamic,1> VectorI; in sparse_permutations() typedef
75 VectorI pi; in sparse_permutations()
|