187 …inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const…
220   Map<VectorIx> colPtr( m_L.outerIndexPtr(), n+1); // Pointer to the beginning of each row  in factorize()
234     for (Index k = colPtr[j]; k < colPtr[j+1]; k++)  in factorize()
255     for (Index k = colPtr[j]; k < colPtr[j+1]; k++)  in factorize()
257 …eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part …  in factorize()
258     mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag);  in factorize()
275       vals[colPtr[j]] += shift;  in factorize()
283       Scalar diag = vals[colPtr[j]];  // It is assumed that only the lower part is stored  in factorize()
285       for (Index i = colPtr[j] + 1; i < colPtr[j+1]; i++)  in factorize()
303           for (Index i = jk; i < colPtr[*k+1]; i++)  in factorize()
316           updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol);  in factorize()
331         colPtr = Map<const VectorIx>(L_save.outerIndexPtr(), n+1);  in factorize()
340       vals[colPtr[j]] = rdiag;  in factorize()
347         vals[colPtr[i]] -= numext::abs2(col_vals(k));  in factorize()
351       Index p = colPtr[j+1] - colPtr[j] - 1 ;  in factorize()
357       for (Index i = colPtr[j]+1; i < colPtr[j+1]; i++)  in factorize()
366       Index jk = colPtr(j)+1;  in factorize()
367       updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol);  in factorize()
379 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, …  in updateList()  argument
381   if (jk < colPtr(col+1) )  in updateList()
383     Index p = colPtr(col+1) - jk;  in updateList()