Home
last modified time | relevance | path

Searched refs:minrow (Results 1 – 2 of 2) sorted by relevance

/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteLUT.h344 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment in factorize() local
346 if (minrow != ju(jj)) in factorize()
351 jr(minrow) = convert_index<StorageIndex>(jj); in factorize()
356 jr(minrow) = -1; in factorize()
359 typename FactorType::InnerIterator ki_it(m_lu, minrow); in factorize()
360 while (ki_it && ki_it.index() < minrow) ++ki_it; in factorize()
361 eigen_internal_assert(ki_it && ki_it.col()==minrow); in factorize()
402 ju(len) = convert_index<StorageIndex>(minrow); in factorize()
/external/eigen/test/
Dvisitor.cpp29 Index minrow=0,mincol=0,maxrow=0,maxcol=0; in matrixVisitor() local
36 minrow = i; in matrixVisitor()
50 VERIFY(minrow == eigen_minrow); in matrixVisitor()