Lines Matching defs:next
66 uint next = _uf_map[cur];
67 while( next != cur ) { // Scan chain of equivalences
68 assert( next < cur, "always union smaller" );
69 cur = next; // until find a fixed-point
70 next = _uf_map[cur];
74 while( lrg != next ) {
76 _uf_map.map(lrg, next);
97 uint next = _uf_map[lrg];
98 while( next != lrg ) { // Scan chain of equivalences
99 assert( next < lrg, "always union smaller" );
100 lrg = next; // until find a fixed-point
101 next = _uf_map[lrg];
103 return next;
159 // The Find() call chases the chains & shortens them for the next Find call.
719 while ((neighbor = one.next()) != 0)
729 while ((neighbor = two.next()) != 0)
736 while ((neighbor = three.next()) != 0)
871 // n_lr1's old memory on the next iteration. n_lr2 is cleared to