plottery_lib 0.12.0

Core geometry library of Plottery, a creative coding framework for generative vector graphics and pen plotting.
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259

#[cfg(test)]
mod test_line {
    #[cfg(test)]
    mod tests {
        use crate::{Line, LineIntersection, PointLineRelation, V2};

        #[test]
        fn point_relation() {
            let line = Line::new(V2::new(0.0, 0.0), V2::new(5.0, 5.0));

            let point_on_line = V2::new(3.0, 3.0);
            assert_eq!(
                line.point_relation(point_on_line),
                PointLineRelation::OnLine
            );

            let point_left = V2::new(-1.0, 2.0);
            assert_eq!(line.point_relation(point_left), PointLineRelation::Left);

            let point_right = V2::new(6.0, 3.0);
            assert_eq!(line.point_relation(point_right), PointLineRelation::Right);
        }

        #[test]
        fn intersection() {
            // non-parallel lines with intersection
            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(5.0, 5.0));
            let line2 = Line::new(V2::new(0.0, 5.0), V2::new(5.0, 0.0));
            assert_eq!(
                line1.intersection(line2),
                LineIntersection::Intersection(V2 { x: 2.5, y: 2.5 })
            );
        }

        #[test]
        fn intersection_colinear() {
            // colinear lines with no intersection
            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(5.0, 5.0));
            let line2 = Line::new(V2::new(6.0, 6.0), V2::new(8.0, 8.0));
            assert_eq!(line1.intersection(line2), LineIntersection::NoIntersection);
        }

        #[test]
        fn intersection_lines_intersect_outside() {
            // lines without intersection
            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(1.0, 1.0));
            let line2 = Line::new(V2::new(3.5, 0.0), V2::new(0.0, 3.5));
            assert_eq!(line1.intersection(line2), LineIntersection::NoIntersection);

            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(1.0, 0.0));
            let line2 = Line::new(V2::new(1.0, -1.0), V2::new(3.0, 1.0));
            assert_eq!(line1.intersection(line2), LineIntersection::NoIntersection);

            let line1 = Line::new(V2::new(5.0, 5.0), V2::new(5.0, -3.0));
            let line2 = Line::new(V2::new(4.0, -7.0), V2::new(6.0, -5.0));
            assert_eq!(line1.intersection(line2), LineIntersection::NoIntersection);
        }

        #[test]
        fn intersection_lines_end_to_end() {
            // lines end to end
            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(1.0, 1.0));
            let line2 = Line::new(V2::new(1.0, 1.0), V2::new(2.0, 2.0));
            assert_eq!(
                line1.intersection(line2),
                LineIntersection::Intersection(line1.to)
            );
        }

        #[test]
        fn intersection_lines_t() {
            // lines in a T formation
            let line1 = Line::new(V2::new(0.0, 0.0), V2::new(1.0, 0.0));
            let line2 = Line::new(V2::new(1.0, 1.0), V2::new(1.0, -1.0));
            assert_eq!(
                line1.intersection(line2),
                LineIntersection::Intersection(line1.to)
            );
        }

        #[test]
        fn intersection_lines_t_2() {
            // lines in a diagonal T formation
            let line1 = Line::new(V2::new(1.0, 1.0), V2::new(0.0, 0.0));
            let line2 = Line::new(V2::new(0.0, 2.0), V2::new(2.0, 0.0));
            assert_eq!(
                line1.intersection(line2),
                LineIntersection::Intersection(line1.from)
            );
        }

        #[test]
        fn intersection_inf_lines() {
            // non-parallel lines with intersection
            let line1 = Line::new(V2::xy(0.0), V2::xy(1.0));
            let line2 = Line::new(V2::new(0.0, 5.0), V2::new(1.0, 4.0));
            assert_eq!(
                line1.intersection_as_inf_lines(&line2),
                LineIntersection::Intersection(V2 { x: 2.5, y: 2.5 })
            );
        }

        #[test]
        fn intersection_inf_lines_parallel() {
            // parallel lines
            let line1 = Line::new(V2::xy(0.0), V2::xy(1.0));
            let line2 = Line::new(V2::new(0.0, -1.0), V2::new(1.0, 0.0));
            assert_eq!(
                line1.intersection_as_inf_lines(&line2),
                LineIntersection::NoIntersection
            );
        }

        #[test]
        fn intersection_inf_lines_colinear() {
            // colinear lines
            let line1 = Line::new(V2::xy(0.0), V2::xy(1.0));
            let line2 = Line::new(V2::xy(5.0), V2::xy(4.0));
            assert_eq!(
                line1.intersection_as_inf_lines(&line2),
                LineIntersection::NoIntersection
            );
        }

        #[test]
        fn closest_point() {
            let line = Line::new(V2::new(0.0, 0.0), V2::new(3.0, 3.0));

            let point = V2::new(3.0, 3.0);
            assert_eq!(line.closest_point(point), point);

            let point = V2::new(5.0, 5.0);
            assert_eq!(line.closest_point(point), line.to.clone());

            let point = V2::new(1.5, 1.5);
            assert_eq!(line.closest_point(point), point);

            let point = V2::new(0.0, 3.0);
            assert_eq!(line.closest_point(point), V2::new(1.5, 1.5));

            let point = V2::new(3.0, 0.0);
            assert_eq!(line.closest_point(point), V2::new(1.5, 1.5));

            let point = V2::new(100.0, 0.0);
            assert_eq!(line.closest_point(point), V2::new(3.0, 3.0));

            let point = V2::new(0.0, 5.0);
            assert_eq!(line.closest_point(point), V2::new(2.5, 2.5));

            let point = V2::new(5.0, 0.0);
            assert_eq!(line.closest_point(point), V2::new(2.5, 2.5));
        }

        #[test]
        fn closest_point_line_points_coincident() {
            // special case where line starts and ends at the same point
            let line = Line::new(V2::new(0.0, 0.0), V2::new(0.0, 0.0));

            let point = V2::new(1.0, 1.0);
            assert_eq!(line.closest_point(point), V2::new(0.0, 0.0));
        }

        #[test]
        fn project() {
            let line = Line::new(V2::new(0.0, 1.0), V2::new(1.0, 2.0));

            let point = V2::new(0.0, 2.0);
            assert_eq!(line.project(point), V2::new(0.5, 1.5));
        }

        #[test]
        fn contains_point_on_segment() {
            let line = Line::new(V2::new(0.0, 0.0), V2::new(2.0, 2.0));

            assert!(line.contains_point_on_segment(V2::new(1.0, 1.0)));
            assert!(line.contains_point_on_segment(V2::new(0.0, 0.0)));
            assert!(line.contains_point_on_segment(V2::new(2.0, 2.0)));

            assert!(!line.contains_point_on_segment(V2::new(3.0, 3.0)));
            assert!(!line.contains_point_on_segment(V2::new(1.0, 1.2)));
        }

        #[test]
        fn intersect_multiple_sorted() {
            let a = Line::new(V2::new(0.0, 0.0), V2::new(1.0, 1.0));

            let i1 = Line::new(V2::new(0.0, 0.25), V2::new(1.0, 0.25));
            let i2 = Line::new(V2::new(0.0, 0.5), V2::new(1.0, 0.5));
            let i3 = Line::new(V2::new(0.0, 0.75), V2::new(1.0, 0.75));

            let order1 = vec![i1, i2, i3];
            let order2 = vec![i1, i3, i2];
            let order3 = vec![i2, i1, i3];
            let order4 = vec![i2, i3, i1];
            let order5 = vec![i3, i1, i2];
            let order6 = vec![i3, i2, i1];

            for order in [order1, order2, order3, order4, order5, order6] {
                let r = a.intersect_multiple_sorted_by_dist(&order);
                assert_eq!(r.len(), 3);
                assert_eq!(r[0], V2::xy(0.25));
                assert_eq!(r[1], V2::xy(0.5));
                assert_eq!(r[2], V2::xy(0.75));
            }
        }
    }

    mod traits {
        use crate::{
            Angle, BoundingBox, Layer, Line, Path, Plottable, Rect, Rotate, SampleSettings,
            Translate, LARGE_EPSILON, V2,
        };

        #[test]
        fn helpers() {
            let line = Line::new(V2::new(0.0, 0.0), V2::new(4.0, 0.0));
            assert_eq!(line.length(), 4.0);
            assert_eq!(line.point_at(0.25), V2::new(1.0, 0.0));
            assert_eq!(line.normal_right(), V2::new(0.0, -1.0));
            assert_eq!(line.offset_left(2.0).from, V2::new(0.0, 2.0));
        }

        #[test]
        fn transforms() {
            let line = Line::new(V2::new(1.0, 0.0), V2::new(2.0, 0.0));
            assert_eq!(line.translate(V2::new(0.0, 1.0)).to, V2::new(2.0, 1.0));

            let rotated = line.rotate_around(V2::new(1.0, 0.0), Angle::quarter_rotation());
            assert!(rotated.to.dist(V2::new(1.0, 1.0)) < LARGE_EPSILON);

            let bb = Line::new(V2::new(3.0, 1.0), V2::new(0.0, 2.0)).bounding_box();
            assert_eq!(bb, Some(Rect::new(V2::new(0.0, 1.0), V2::new(3.0, 2.0))));
        }

        #[test]
        fn into_path_shape_layer() {
            let lines = vec![
                Line::new(V2::new(0.0, 0.0), V2::new(1.0, 0.0)),
                Line::new(V2::new(1.0, 0.0), V2::new(1.0, 1.0)),
            ];
            let layer: Layer = lines.iter().copied().collect();
            assert_eq!(layer.len(), 2);

            let path: Path = lines[0].into();
            assert_eq!(path.len(), 2);
            assert_eq!(path.length(), 1.0);

            let segments: Vec<Line> = Path::new_from(vec![
                V2::new(0.0, 0.0),
                V2::new(1.0, 0.0),
                V2::new(1.0, 1.0),
            ])
            .segments()
            .collect();
            assert_eq!(segments, lines);
            let _ = SampleSettings::default();
        }
    }
}