i_shape 3.0.0

iShape is a compact and efficient library specifically designed for representing 2D data structures using IntPoint.
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
57
58
59
60
61
62

use crate::int::shape::IntContour;
use i_float::int::number::int::IntNumber;

/// Trait for removing redundant points from a contour.
pub trait DedupContour {
    /// Removes consecutive duplicate points and a duplicated closing point
    /// (if the last point is equal to the first).
    ///
    /// Returns `true` if the contour was modified, `false` otherwise.
    fn dedup_contour(&mut self) -> bool;
}

impl<I: IntNumber> DedupContour for IntContour<I> {
    fn dedup_contour(&mut self) -> bool {
        let n = self.len();
        self.dedup();

        if let (Some(&first), Some(&last)) = (self.first(), self.last())
            && last == first
        {
            self.pop();
        }

        self.len() < n
    }
}

#[cfg(test)]
mod tests {
    use crate::int::dedup::DedupContour;
    use crate::int_path;

    #[test]
    fn test_0() {
        let mut contour = int_path![[0, 0], [1, 0],];

        let modified = contour.dedup_contour();

        assert_eq!(contour.len(), 2);
        assert_eq!(modified, false);
    }

    #[test]
    fn test_1() {
        let mut contour = int_path![[0, 0], [1, 0], [0, 0],];

        let modified = contour.dedup_contour();

        assert_eq!(contour.len(), 2);
        assert_eq!(modified, true);
    }

    #[test]
    fn test_2() {
        let mut contour = int_path![[0, 0], [0, 0], [1, 0],];

        let modified = contour.dedup_contour();

        assert_eq!(contour.len(), 2);
        assert_eq!(modified, true);
    }
}