Lines Matching full:sizeu
278 int sizeu = 1; // number of nonzero elements in the upper part of the current row
304 int jpos = ii + sizeu;
308 ++sizeu;
368 newpos = ii + sizeu;
369 sizeu++;
370 eigen_internal_assert(sizeu<=n);
394 for(int k = 0; k <sizeu; k++) jr(ju(ii+k)) = -1;
419 for(int k = 1; k < sizeu; k++)
428 sizeu = len + 1; // +1 to take into account the diagonal element
429 len = (std::min)(sizeu, nnzU);
430 typename Vector::SegmentReturnType uu(u.segment(ii+1, sizeu-1));
431 typename VectorXi::SegmentReturnType juu(ju.segment(ii+1, sizeu-1));
