Home
last modified time | relevance | path

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

/external/eigen/Eigen/src/IterativeLinearSolvers/
DIncompleteLUT.h293 Index sizel = 0; // number of nonzero elements in the lower part of the current row in factorize() local
306 ju(sizel) = convert_index<StorageIndex>(k); in factorize()
307 u(sizel) = j_it.value(); in factorize()
308 jr(k) = convert_index<StorageIndex>(sizel); in factorize()
309 ++sizel; in factorize()
339 while (jj < sizel) in factorize()
344 Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment in factorize()
389 newpos = sizel; in factorize()
390 sizel++; in factorize()
391 eigen_internal_assert(sizel<=ii); in factorize()
[all …]
/external/doclava/src/com/google/doclava/
DClearPage.java186 long sizel = from.length(); in copyFile() local
188 int size = sizel > maxsize ? maxsize : (int) sizel; in copyFile()