Lines Matching refs:nlen
317 let nlen = needle.len();
319 let mut shift = nlen;
320 while pos >= nlen {
321 if !self.0.byteset.contains(haystack[pos - nlen]) {
322 pos -= nlen;
323 shift = nlen;
327 while i > 0 && needle[i - 1] == haystack[pos - nlen + i - 1] {
330 if i > 0 || needle[0] != haystack[pos - nlen] {
332 shift = nlen;
335 while j < shift && needle[j] == haystack[pos - nlen + j] {
339 return Some(pos - nlen);
355 let nlen = needle.len();
357 while pos >= nlen {
358 if !self.0.byteset.contains(haystack[pos - nlen]) {
359 pos -= nlen;
363 while i > 0 && needle[i - 1] == haystack[pos - nlen + i - 1] {
366 if i > 0 || needle[0] != haystack[pos - nlen] {
370 while j < nlen && needle[j] == haystack[pos - nlen + j] {
373 if j == nlen {
374 return Some(pos - nlen);