Lines Matching full:candidate
69 int* s; //for selected candidate
200 finder->s = new int[N+1]; //for selected candidate
241 delete finder->s; //for selected candidate
276 int* s = finder->s; //for selected candidate
317 /* Save position of potential candidate */
329 s[k] = pos; //s - selected candidate
333 s[k] = i; //selected candidate is fixed point itself
345 //here we will look for candidate to translate into not
346 //s[k] now contains index of choosen candidate
351 //swap selected and first candidate
367 //fill new set 'candidate'
369 i++;//skip selected candidate
464 //select next candidate
507 int* s = new int[N]; //for selected candidate
564 /* Save position of potential candidate */
576 s[k] = pos; //s - selected candidate
580 s[k] = i; //selected candidate is fixed point itself
592 //here we will look for candidate to translate into not
593 //s[k] now contains index of choosen candidate
598 //swap selected and first candidate
614 //fill new set 'candidate'
616 i++;//skip selected candidate
687 //select next candidate
