Lines Matching defs:shift
23 // Cap on the maximal shift in the Boyer-Moore implementation. By setting a
39 // Bad-char shift table stored in the state. It's length is the alphabet size.
155 // Store for the BoyerMoore(Horspool) bad char shift table.
160 // Store for the BoyerMoore good suffix shift table.
168 // shift table.
315 int shift = j - CharOccurrence(bad_char_occurence, c);
316 index += shift;
326 // Fall back on BMH shift.
333 int shift = j - bc_occ;
334 if (gs_shift > shift) {
335 shift = gs_shift;
337 index += shift;
397 // Build shift table using suffixes.
436 int shift = j - bc_occ;
437 index += shift;
438 badness += 1 - shift; // at most zero, so badness cannot increase.