Searched refs:sizeu (Results 1 – 1 of 1) sorted by relevance
280 Index sizeu = 1; // number of nonzero elements in the upper part of the current row in factorize() local306 Index jpos = ii + sizeu; in factorize()310 ++sizeu; in factorize()370 newpos = ii + sizeu; in factorize()371 sizeu++; in factorize()372 eigen_internal_assert(sizeu<=n); in factorize()396 for(Index k = 0; k <sizeu; k++) jr(ju(ii+k)) = -1; in factorize()421 for(Index k = 1; k < sizeu; k++) in factorize()430 sizeu = len + 1; // +1 to take into account the diagonal element in factorize()431 len = (std::min)(sizeu, nnzU); in factorize()[all …]