1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
mod tests;
pub trait Haystack {
fn pattern_table(needle: &[u8]) -> Vec<usize> {
let mut i = 0;
let mut j = 1;
let mut arr = vec![0; needle.len()];
while j < needle.len() {
if needle[i] == needle[j] {
i += 1;
arr[j] = i;
j += 1;
} else {
if i != 0 {
i = arr[i - 1];
} else {
arr[j] = i;
j += 1;
}
}
}
arr
}
fn contains_needle<N: AsRef<[u8]>>(&self, needle: N) -> bool;
}
impl<H: AsRef<[u8]>> Haystack for H {
fn contains_needle<N: AsRef<[u8]>>(&self, needle: N) -> bool {
let needle = needle.as_ref();
let pattern_table = Self::pattern_table(needle);
let haystack = &self.as_ref();
let mut haystack_c = 0usize;
let mut needle_c = 0usize;
let haystack_len = haystack.len();
let needle_len = needle.len();
while haystack_c < haystack_len {
if haystack[haystack_c] == needle[needle_c] {
haystack_c += 1;
needle_c += 1;
}
if needle_c == needle_len {
return true;
} else {
if haystack_c < haystack_len && haystack[haystack_c] != needle[needle_c] {
if needle_c != 0 {
needle_c = pattern_table[needle_c - 1];
} else {
haystack_c += 1;
}
}
}
}
false
}
}