Lines Matching refs:positions

66    where Pos is a set of byte positions,
86 Step 1 (Finding good byte positions):
182 /* ====================== Finding good byte positions ====================== */
215 Search::init_selchars_tuple (const Positions& positions, const unsigned int *alpha_unify) const
218 temp->first()->init_selchars_tuple(positions, alpha_unify);
229 /* Count the duplicate keywords that occur with a given set of positions.
234 Search::count_duplicates_tuple (const Positions& positions, const unsigned int *alpha_unify) const
239 init_selchars_tuple (positions, alpha_unify);
257 /* Find good key positions. */
262 /* If the user gave the key positions, we use them. */
272 /* 1. Find positions that must occur in order to distinguish duplicates. */
334 /* 2. Add positions, as long as this decreases the duplicates count. */
364 /* Stop adding positions when it gives no improvement. */
372 /* 3. Remove positions, as long as this doesn't increase the duplicates
398 /* Stop removing positions when it gives no improvement. */
406 /* 4. Replace two positions by one, as long as this doesn't increase the
439 /* Stop removing positions when it gives no improvement. */
453 fprintf (stderr, "\nComputed positions: ");
482 /* Count the duplicate keywords that occur with the found set of positions.
510 Search::compute_alpha_unify (const Positions& positions, const unsigned int *alpha_inc) const
538 /* Iterate through the selected character positions. */
539 PositionIterator iter = positions.iterator(keyword->_allchars_length);
573 Search::init_selchars_multiset (const Positions& positions, const unsigned int *alpha_unify, const unsigned int *alpha_inc) const
576 temp->first()->init_selchars_multiset(positions, alpha_unify, alpha_inc);
579 /* Count the duplicate keywords that occur with the given set of positions
810 fprintf (stderr, "try different key positions or use option -D.\n");
1589 /* Step 1: Finding good byte positions. */
1611 fprintf (stderr, "try options -m or -r, or use new key positions.\n\n");