- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for longestCommonSuffix (0.17 sec)
-
src/strings/search.go
for i := 0; i < last; i++ { lenSuffix := longestCommonSuffix(pattern, pattern[1:i+1]) if pattern[i-lenSuffix] != pattern[last-lenSuffix] { // (last-i) is the shift, and lenSuffix is len(suffix). f.goodSuffixSkip[last-lenSuffix] = lenSuffix + last - i } } return f } func longestCommonSuffix(a, b string) (i int) { for ; i < len(a) && i < len(b); i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 07 18:49:51 UTC 2023 - 4.1K bytes - Viewed (0)