Home | History | Annotate | Download | only in SparseCholesky

Lines Matching refs:pattern

62     /* L(k,:) pattern: all nodes reachable in etree from nz in A(0:k-1,k) */
116 ei_declare_aligned_stack_constructed_variable(StorageIndex, pattern, size, 0);
124 // compute nonzero pattern of kth row of L, in topological order
126 StorageIndex top = size; // stack for pattern is empty
138 pattern[len++] = i; /* L(k,i) is nonzero */
142 pattern[--top] = pattern[--len];
152 Index i = pattern[top]; /* pattern[top:n-1] is pattern of L(:,k) */