dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
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

pub fn z_algorithm<T: PartialEq>(a: &[T]) -> Vec<usize> {
    let n = a.len();

    let mut lcp = vec![0; n];

    let mut l = 0;

    for i in 1..n {
        let r = l + lcp[l];

        let mut d = if r <= i { 0 } else { lcp[i - l].min(r - i) };

        while i + d < n && a[i + d] == a[d] {
            d += 1;
        }

        lcp[i] = d;

        if i + d > r {
            l = i;
        }
    }

    lcp[0] = n;

    lcp
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let cases = [
            ("aabcaabxaaaz", vec![12, 1, 0, 0, 3, 1, 0, 0, 2, 2, 1, 0]),
            ("aaaaaa", vec![6, 5, 4, 3, 2, 1]),
            ("aabaacd", vec![7, 1, 0, 2, 1, 0, 0]),
            ("abababab", vec![8, 0, 6, 0, 4, 0, 2, 0]),
        ];

        for (s, ans) in cases {
            let s = s.chars().collect::<Vec<_>>();

            assert_eq!(z_algorithm(&s), ans);
        }
    }
}