- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for center (0.13 sec)
-
src/bytes/bytes.go
} if s[i+1] == c1 && Equal(s[i:i+n], sep) { return i } i++ fails++ if fails >= 4+i>>4 && i < t { // Give up on IndexByte, it isn't skipping ahead // far enough to be better than Rabin-Karp. // Experiments (using IndexPeriodic) suggest // the cutover is about 16 byte skips. // TODO: if large prefixes of sep are matching // we should cutover at even larger average skips,
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Feb 19 19:51:15 GMT 2024 - 33.8K bytes - Viewed (0)