Lines Matching refs:ne
196 finder->ne = new int[N+1];
217 finder->ne[0] = 0;
237 delete finder->ne;
272 int* ne = finder->ne;
288 if( (!finder->weighted) && (k + ce[k] - ne[k] < finder->best_score) )
312 for (int j = ne[k]; j < ce[k] && (count < minnod); j++)
327 if (i < ne[k]) //if current fixed point belongs to 'not'
353 old[s[k]] = old[ne[k]];
354 int sel = old[ne[k]] = p;
358 for ( i = 0; i < ne[k]; i++)
439 ne[k] = newne;
460 ne[k]++;
465 for( s[k] = ne[k]; s[k] < ce[k]; s[k]++ )
503 int* ne = new int[N];
526 ne[0] = 0;
542 if( k + ce[k] - ne[k] < best_score )
559 for (int j = ne[k]; j < ce[k] && (count < minnod); j++)
574 if (i < ne[k]) //if current fixed point belongs to 'not'
600 old[s[k]] = old[ne[k]];
601 int sel = old[ne[k]] = p;
605 for ( i = 0; i < ne[k]; i++)
662 ne[k] = newne;
683 ne[k]++;
688 for( s[k] = ne[k]; s[k] < ce[k]; s[k]++ )