Lines Matching full:suffix
25 // search will not be optimal, since we only build tables for a suffix
168 // Store for the BoyerMoore good suffix shift table.
175 // Table used temporarily while building the BoyerMoore good suffix
384 int suffix = pattern_length + 1;
389 while (suffix <= pattern_length && c != pattern[suffix - 1]) {
390 if (shift_table[suffix] == length) {
391 shift_table[suffix] = suffix - i;
393 suffix = suffix_table[suffix];
395 suffix_table[--i] = --suffix;
396 if (suffix == pattern_length) {
397 // No suffix to extend, so we check against last_char only.
405 suffix_table[--i] = --suffix;
411 if (suffix < pattern_length) {
414 shift_table[i] = suffix - start;
416 if (i == suffix) {
417 suffix = suffix_table[suffix];
438 // How bad we are doing without a good-suffix table.
