Lines Matching full:suffix
26 // that the suffix pattern[i+1:] matches, but the byte pattern[i] does
29 // 1. The matched suffix occurs elsewhere in pattern (with a different
31 // shift the matching frame to align with the next suffix chunk. For
32 // example, the pattern "mississi" has the suffix "issi" next occurring
34 // shift+len(suffix) == 3+4 == 7.
36 // 2. If the matched suffix does not occur elsewhere in pattern, then the
38 // matching suffix. In this case, goodSuffixSkip[i] will contain how far
40 // suffix. For example, in the pattern "abcxxxabc", when the first
42 // suffix "xxabc" is not found elsewhere in the pattern. However, its
44 // goodSuffixSkip[3] == shift+len(suffix) == 6+5 == 11.
68 // Build good suffix table.
76 // lastPrefix is the shift, and (last-i) is len(suffix).
79 // Second pass: find repeats of pattern's suffix starting from the front.
83 // (last-i) is the shift, and lenSuffix is len(suffix).
