HomeSort by relevance Sort by last modified time
    Searched refs:VectorI (Results 1 - 4 of 4) sorted by null

  /external/eigen/Eigen/src/IterativeLinearSolvers/
IncompleteLUT.h 28 template <typename VectorV, typename VectorI>
29 Index QuickSplit(VectorV &row, VectorI &ind, Index ncut)
109 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
265 VectorI ju(n); // column position of the values in u -- maximum size is n
266 VectorI jr(n); // Indicate the position of the nonzero elements in the vector u -- A zero location is indicated by -1
417 typename VectorI::SegmentReturnType jul(ju.segment(0, sizel));
446 typename VectorI::SegmentReturnType juu(ju.segment(ii+1, sizeu-1));
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 58 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
163 //mutable VectorI m_countPerRow;
164 //mutable VectorI m_countPerCol;
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/
SimplicialCholesky.h 70 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
257 VectorI m_parent; // elimination tree
258 VectorI m_nonZerosPerCol;
  /external/eigen/test/
sparse_permutations.cpp 52 typedef Matrix<StorageIndex,Dynamic,1> VectorI;
75 VectorI pi;

Completed in 358 milliseconds