imgthin 0.1.1

A fast parallel algorithm for thinning digital patterns
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
52
53
54
55
56

// Common methods to improved and default algorithm
#[derive(Clone, Debug)]
pub enum SubIter {
    First,
    Second,
}

pub fn calculate_ap_and_bp(
    p2: bool,
    p3: bool,
    p4: bool,
    p5: bool,
    p6: bool,
    p7: bool,
    p8: bool,
    p9: bool,
) -> (usize, usize) {
    let mut arr = vec![p2, p3, p4, p5, p6, p7, p8, p9];
    let b_p = arr.iter().map(|p| if *p { 1 } else { 0 }).sum::<usize>();

    arr.push(p2);

    let mut a_p = 0;
    let mut prev_p = true;

    for p in arr.iter() {
        if !prev_p && p.to_owned() {
            a_p += 1;
        }
        prev_p = p.to_owned();
    }

    (a_p, b_p)
}

#[cfg(test)]
mod test {

    use super::*;

    #[test]
    fn test_calculate_ap_bp() {
        assert_eq!(
            calculate_ap_and_bp(true, true, true, true, true, true, true, true),
            (0, 8)
        );
        assert_eq!(
            calculate_ap_and_bp(true, true, false, false, true, false, true, true),
            (2, 5)
        );
        assert_eq!(
            calculate_ap_and_bp(false, false, false, false, false, false, false, false),
            (0, 0)
        );
    }
}