187 …inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const…
219   Map<VectorIx> rowIdx(m_L.innerIndexPtr(), nnz);  //Row indices  in factorize()
237       if(rowIdx[k]!=j)  in factorize()
238         m_scale(rowIdx[k]) += numext::abs2(vals(k));  in factorize()
256       vals[k] *= (m_scale(j)*m_scale(rowIdx[k]));  in factorize()
257 …eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part …  in factorize()
287         StorageIndex l = rowIdx[i];  in factorize()
299           eigen_internal_assert(rowIdx[jk]==j);  in factorize()
305             StorageIndex l = rowIdx[i];  in factorize()
316           updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol);  in factorize()
330         rowIdx = Map<const VectorIx>(L_save.innerIndexPtr(), nnz);  in factorize()
360         rowIdx[i] = col_irow(cpt);  in factorize()
367       updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol);  in factorize()
379 …pLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> val…  in updateList()  argument
385     rowIdx.segment(jk,p).minCoeff(&minpos);  in updateList()
387     if (rowIdx(minpos) != rowIdx(jk))  in updateList()
390       std::swap(rowIdx(jk),rowIdx(minpos));  in updateList()
394     listCol[rowIdx(jk)].push_back(internal::convert_index<StorageIndex,Index>(col));  in updateList()