Lines Matching refs:positions
64 where Pos is a set of byte positions,
84 Step 1 (Finding good byte positions):
183 /* ====================== Finding good byte positions ====================== */
216 Search::init_selchars_tuple (const Positions& positions, const unsigned int *alpha_unify) const
219 temp->first()->init_selchars_tuple(positions, alpha_unify);
230 /* Count the duplicate keywords that occur with a given set of positions.
235 Search::count_duplicates_tuple (const Positions& positions, const unsigned int *alpha_unify) const
240 init_selchars_tuple (positions, alpha_unify);
258 /* Find good key positions. */
263 /* If the user gave the key positions, we use them. */
273 /* 1. Find positions that must occur in order to distinguish duplicates. */
335 /* 2. Add positions, as long as this decreases the duplicates count. */
365 /* Stop adding positions when it gives no improvement. */
373 /* 3. Remove positions, as long as this doesn't increase the duplicates
399 /* Stop removing positions when it gives no improvement. */
407 /* 4. Replace two positions by one, as long as this doesn't increase the
440 /* Stop removing positions when it gives no improvement. */
454 fprintf (stderr, "\nComputed positions: ");
483 /* Count the duplicate keywords that occur with the found set of positions.
511 Search::compute_alpha_unify (const Positions& positions, const unsigned int *alpha_inc) const
539 /* Iterate through the selected character positions. */
540 PositionIterator iter = positions.iterator(keyword->_allchars_length);
574 Search::init_selchars_multiset (const Positions& positions, const unsigned int *alpha_unify, const unsigned int *alpha_inc) const
577 temp->first()->init_selchars_multiset(positions, alpha_unify, alpha_inc);
580 /* Count the duplicate keywords that occur with the given set of positions
811 fprintf (stderr, "try different key positions or use option -D.\n");
1590 /* Step 1: Finding good byte positions. */
1612 fprintf (stderr, "try options -m or -r, or use new key positions.\n\n");