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 longest_border<T: PartialEq>(a: &[T]) -> Vec<isize> {
    let n = a.len();

    let mut lb = vec![0; n + 1];

    let mut d = -1;

    lb[0] = d;

    for i in 0..n {
        while d != -1 && a[d as usize] != a[i] {
            d = lb[d as usize]
        }

        d += 1;

        lb[i + 1] = d;
    }

    lb
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        // refs: en-wiki
        let cases = [
            ("aaaaa", vec![-1, 0, 1, 2, 3, 4]),
            ("abcdabd", vec![-1, 0, 0, 0, 0, 1, 2, 0]),
            ("abacababc", vec![-1, 0, 0, 1, 0, 1, 2, 3, 2, 0]),
            ("abacababa", vec![-1, 0, 0, 1, 0, 1, 2, 3, 2, 3]),
            (
                "participate in parachute",
                vec![
                    -1, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 1, 2, 3,
                    0, 0, 0, 0, 0, 0,
                ],
            ),
        ];

        for (s, ans) in cases {
            assert_eq!(longest_border(s.as_bytes()), ans);
        }
    }
}