Lines Matching refs:candidates

49 		Finding candidates.
64 subtrees of U, in which case we'd end up examining the same candidates
68 number of candidates.
102 Note that there can be no absolute roots among the extra candidates -
271 S that do not belong to U.  That set ('candidates') is all we need
273 consisting of all list elements that are marked as candidates (initially -
319 if it belongs to candidates.
336 iterate through the candidates anyway.
371 // to unmount) and a set of candidates, represented as a subset of list
374 // In the end candidates becomes empty and maximal non-revealing non-shifting
385 	for (p = m; p in candidates; p = parent(p)) {
439 	* find all candidates
448 ("candidates").  It means that for the output of the 1st step we'd like
449 the extra candidates separated from the stuff already in the original set.
455 	* undecided candidates ("candidates").  Subset of a list,
462 candidates will gradually be either discarded or moved there.  In other
463 words, it's the candidates we have already decided to unmount.	Its role
467 For gather_candidates() we'll need to maintain both candidates (S -
470 set into the list of candidates.  When we are done, strip that flag from
472 if element belongs to S (in gather_candidates) and to candidates
483 Removals from the candidates list should strip both T_MARKED and