i_overlay 6.0.0

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
140
141
142

use crate::geom::v_segment::VSegment;
use crate::vector::edge::{VectorEdge, VectorPath};
use alloc::vec::Vec;
use i_float::int::point::IntPoint;
use i_shape::int::path::IntPath;

#[derive(Debug, Clone, Copy)]
pub(crate) struct ContourIndex {
    data: usize,
}

impl ContourIndex {
    pub(crate) const EMPTY: ContourIndex = ContourIndex { data: usize::MAX };

    #[inline]
    pub(crate) fn is_hole(&self) -> bool {
        self.data & 1 == 1
    }

    #[inline]
    pub(crate) fn index(&self) -> usize {
        self.data >> 1
    }

    #[inline]
    pub(crate) fn new_hole(index: usize) -> Self {
        Self {
            data: (index << 1) | 1,
        }
    }

    #[inline]
    pub(crate) fn new_shape(index: usize) -> Self {
        Self { data: index << 1 }
    }
}

#[derive(Debug, Clone, Copy)]
pub(crate) struct IdSegment {
    pub(crate) contour_index: ContourIndex,
    pub(crate) v_segment: VSegment,
}

impl IdSegment {
    #[inline]
    fn new(data: ContourIndex, a: IntPoint, b: IntPoint) -> Self {
        Self {
            contour_index: data,
            v_segment: VSegment { a, b },
        }
    }

    #[inline]
    pub(crate) fn with_segment(data: ContourIndex, v_segment: VSegment) -> Self {
        Self {
            contour_index: data,
            v_segment,
        }
    }
}

pub(crate) trait IdSegments {
    fn append_id_segments(
        &self,
        buffer: &mut Vec<IdSegment>,
        id_data: ContourIndex,
        x_min: i32,
        x_max: i32,
        clockwise: bool,
    );
}

impl IdSegments for IntPath {
    #[inline]
    fn append_id_segments(
        &self,
        buffer: &mut Vec<IdSegment>,
        id_data: ContourIndex,
        x_min: i32,
        x_max: i32,
        clockwise: bool,
    ) {
        fn inner<I: Iterator<Item = IntPoint>>(
            mut iter: I,
            buffer: &mut Vec<IdSegment>,
            id_data: ContourIndex,
            x_min: i32,
            x_max: i32,
        ) {
            let first = iter.next().unwrap();
            let mut b = first;
            for a in iter {
                if a.x < b.x && x_min < b.x && a.x <= x_max {
                    buffer.push(IdSegment::new(id_data, a, b));
                }
                b = a;
            }
            let a = first;
            if a.x < b.x && x_min < b.x && a.x <= x_max {
                buffer.push(IdSegment::new(id_data, a, b));
            }
        }

        if clockwise {
            inner(self.iter().copied(), buffer, id_data, x_min, x_max);
        } else {
            inner(self.iter().rev().copied(), buffer, id_data, x_min, x_max);
        }
    }
}

impl IdSegments for VectorPath {
    #[inline]
    fn append_id_segments(
        &self,
        buffer: &mut Vec<IdSegment>,
        id_data: ContourIndex,
        x_min: i32,
        x_max: i32,
        clockwise: bool,
    ) {
        fn inner<I: Iterator<Item = VectorEdge>>(
            iter: I,
            buffer: &mut Vec<IdSegment>,
            id_data: ContourIndex,
            x_min: i32,
            x_max: i32,
        ) {
            for vec in iter {
                if vec.a.x < vec.b.x && x_min < vec.b.x && vec.a.x <= x_max {
                    buffer.push(IdSegment::new(id_data, vec.a, vec.b));
                }
            }
        }

        if clockwise {
            inner(self.iter().copied(), buffer, id_data, x_min, x_max);
        } else {
            inner(self.iter().rev().copied(), buffer, id_data, x_min, x_max);
        }
    }
}