i_overlay 4.5.1

Boolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139

#[cfg(test)]
pub mod overlay {
    use i_float::int::point::IntPoint;
    use i_shape::int::count::IntShapes;
    use i_shape::int::path::{IntPath, IntPaths};
    use i_shape::int::shape::IntShape;

    pub trait CircleCompare {
        fn are_equal(&self, other: &Self) -> bool;
    }

    impl CircleCompare for Vec<IntPoint> {
        fn are_equal(&self, other: &Self) -> bool {
            if self.len() != other.len() {
                return false;
            }

            let len = other.len();

            for shift in 0..len {
                let mut is_equal = true;
                for i in 0..len {
                    if self[(i + shift) % len] != other[i] {
                        is_equal = false;
                        break;
                    }
                }
                if is_equal {
                    return true;
                }
            }

            false
        }
    }

    impl CircleCompare for Vec<IntShape> {
        fn are_equal(&self, other: &Self) -> bool {
            if self.len() != other.len() {
                return false;
            }

            for i in 0..self.len() {
                let shape_0 = &self[i];
                let shape_1 = &other[i];
                if shape_0.len() != shape_1.len() {
                    return false;
                }

                for j in 0..shape_0.len() {
                    let path_0 = &shape_0[j];
                    let path_1 = &shape_1[j];
                    if !path_0.are_equal(path_1) {
                        return false;
                    }
                }
            }

            true
        }
    }

    #[allow(dead_code)]
    pub fn is_group_of_shapes_one_of(group: &Vec<IntShape>, groups: &Vec<Vec<IntShape>>) -> bool {
        for item in groups.iter() {
            if item.are_equal(group) {
                return true;
            }
        }

        false
    }

    #[allow(dead_code)]
    pub fn is_paths_one_of(paths: &IntPaths, groups: &Vec<IntPaths>) -> bool {
        for item in groups.iter() {
            if item.eq(paths) {
                return true;
            }
        }

        false
    }

    pub trait JsonPrint {
        fn json_print(&self) -> String;
    }

    impl JsonPrint for IntPoint {
        fn json_print(&self) -> String {
            format!("[{}, {}]", self.x, self.y)
        }
    }

    impl JsonPrint for IntPath {
        fn json_print(&self) -> String {
            let mut s = String::with_capacity(16 * self.len());
            s.push('[');
            for (i, p) in self.iter().enumerate() {
                s.push_str(&p.json_print());
                if i + 1 < self.len() {
                    s.push_str(", ");
                }
            }
            s.push(']');
            s
        }
    }

    impl JsonPrint for IntPaths {
        fn json_print(&self) -> String {
            let mut s = String::with_capacity(100 * self.len());
            s.push('[');
            for (i, p) in self.iter().enumerate() {
                s.push_str(&p.json_print());
                if i + 1 < self.len() {
                    s.push_str(", ");
                }
            }
            s.push(']');
            s
        }
    }

    impl JsonPrint for IntShapes {
        fn json_print(&self) -> String {
            let mut s = String::with_capacity(200 * self.len());
            s.push('[');
            for (i, p) in self.iter().enumerate() {
                s.push_str(&p.json_print());
                if i + 1 < self.len() {
                    s.push_str(", ");
                }
            }
            s.push(']');
            s
        }
    }
}