Lines Matching defs:shift
43 // Cap on the maximal shift in the Boyer-Moore implementation. By setting a
59 // Bad-char shift table stored in the state. It's length is the alphabet size.
173 // Store for the BoyerMoore(Horspool) bad char shift table.
180 // Store for the BoyerMoore good suffix shift table.
188 // shift table.
319 int shift =
321 index += shift;
331 // Fall back on BMH shift.
339 int shift = j - bc_occ;
340 if (gs_shift > shift) {
341 shift = gs_shift;
343 index += shift;
404 // Build shift table using suffixes.
443 int shift = j - bc_occ;
444 index += shift;
445 badness += 1 - shift; // at most zero, so badness cannot increase.