author | unC0Rr |
Fri, 06 Oct 2023 20:34:51 +0200 | |
changeset 15981 | 5ba4d3a0c3eb |
parent 15828 | 44b49f255e31 |
child 16022 | 2003b466b279 |
permissions | -rw-r--r-- |
15214 | 1 |
use fpnum::{fp, integral_sqrt, FPNum, FPPoint}; |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
2 |
use std::{ |
14140 | 3 |
cmp::{max, min}, |
15025
dc4a12a84c92
remove RangeContains in favor of standard contains
alfadur
parents:
14726
diff
changeset
|
4 |
ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign, RangeInclusive, Sub, SubAssign}, |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
5 |
}; |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
6 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
7 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
8 |
pub struct Point { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
9 |
pub x: i32, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
10 |
pub y: i32, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
11 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
12 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
13 |
impl Point { |
14627 | 14 |
pub const ZERO: Self = Self::new(0, 0); |
15 |
||
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
16 |
#[inline] |
14627 | 17 |
pub const fn new(x: i32, y: i32) -> Self { |
13941 | 18 |
Self { x, y } |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
19 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
20 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
21 |
#[inline] |
14627 | 22 |
pub const fn diag(v: i32) -> Self { |
14131 | 23 |
Self::new(v, v) |
24 |
} |
|
25 |
||
26 |
#[inline] |
|
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
27 |
pub const fn signum(self) -> Self { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
28 |
Self::new(self.x.signum(), self.y.signum()) |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
29 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
30 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
31 |
#[inline] |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
32 |
pub const fn abs(self) -> Self { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
33 |
Self::new(self.x.abs(), self.y.abs()) |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
34 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
35 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
36 |
#[inline] |
14627 | 37 |
pub const fn dot(self, other: Point) -> i32 { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
38 |
self.x * other.x + self.y * other.y |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
39 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
40 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
41 |
#[inline] |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
42 |
pub fn max_norm(self) -> i32 { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
43 |
std::cmp::max(self.x.abs(), self.y.abs()) |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
44 |
} |
14031 | 45 |
|
46 |
#[inline] |
|
14081 | 47 |
pub fn integral_norm(self) -> u32 { |
15384 | 48 |
let sqr = (self.x as u64).wrapping_pow(2) + (self.y as u64).wrapping_pow(2); |
15214 | 49 |
integral_sqrt(sqr) as u32 |
14081 | 50 |
} |
51 |
||
52 |
#[inline] |
|
14627 | 53 |
pub const fn transform(self, matrix: &[i32; 4]) -> Self { |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
54 |
Point::new( |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
55 |
matrix[0] * self.x + matrix[1] * self.y, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
56 |
matrix[2] * self.x + matrix[3] * self.y, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
57 |
) |
14031 | 58 |
} |
14106 | 59 |
|
60 |
#[inline] |
|
14627 | 61 |
pub const fn rotate90(self) -> Self { |
15981 | 62 |
Self::new(self.y, -self.x) |
14106 | 63 |
} |
14108 | 64 |
|
65 |
#[inline] |
|
14627 | 66 |
pub const fn cross(self, other: Point) -> i32 { |
14108 | 67 |
self.dot(other.rotate90()) |
68 |
} |
|
14125 | 69 |
|
70 |
#[inline] |
|
15981 | 71 |
pub fn clamp(self, rect: &Rect) -> Self { |
72 |
Self::new(rect.x_range().clamp(self.x), rect.y_range().clamp(self.y)) |
|
14131 | 73 |
} |
74 |
||
75 |
#[inline] |
|
14627 | 76 |
pub const fn line_to(self, end: Point) -> Line { |
14131 | 77 |
Line::new(self, end) |
78 |
} |
|
14125 | 79 |
|
14131 | 80 |
#[inline] |
14627 | 81 |
pub const fn ray_with_dir(self, direction: Point) -> Ray { |
14141 | 82 |
Ray::new(self, direction) |
14131 | 83 |
} |
84 |
||
85 |
#[inline] |
|
14627 | 86 |
pub const fn tangent_mul(self, x: i32) -> i32 { |
14142 | 87 |
x * self.y / self.x |
14131 | 88 |
} |
89 |
||
90 |
#[inline] |
|
14627 | 91 |
pub const fn cotangent_mul(self, y: i32) -> i32 { |
14142 | 92 |
y * self.x / self.y |
14125 | 93 |
} |
14139 | 94 |
|
95 |
#[inline] |
|
14144 | 96 |
pub fn to_fppoint(self) -> FPPoint { |
14139 | 97 |
FPPoint::new(self.x.into(), self.y.into()) |
98 |
} |
|
14144 | 99 |
|
100 |
#[inline] |
|
101 |
pub fn from_fppoint(p: &FPPoint) -> Self { |
|
102 |
Self::new(p.x().round(), p.y().round()) |
|
103 |
} |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
104 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
105 |
|
14032 | 106 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
107 |
pub struct Size { |
|
108 |
pub width: usize, |
|
109 |
pub height: usize, |
|
110 |
} |
|
111 |
||
112 |
impl Size { |
|
14717 | 113 |
pub const EMPTY: Self = Self::square(0); |
114 |
||
14032 | 115 |
#[inline] |
14627 | 116 |
pub const fn new(width: usize, height: usize) -> Self { |
117 |
Self { width, height } |
|
14032 | 118 |
} |
119 |
||
120 |
#[inline] |
|
14627 | 121 |
pub const fn square(size: usize) -> Self { |
122 |
Self { |
|
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
123 |
width: size, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
124 |
height: size, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
125 |
} |
14032 | 126 |
} |
127 |
||
128 |
#[inline] |
|
14627 | 129 |
pub const fn area(&self) -> usize { |
14032 | 130 |
self.width * self.height |
131 |
} |
|
132 |
||
133 |
#[inline] |
|
14627 | 134 |
pub const fn linear_index(&self, x: usize, y: usize) -> usize { |
14032 | 135 |
y * self.width + x |
136 |
} |
|
137 |
||
138 |
#[inline] |
|
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
139 |
pub const fn is_power_of_two(&self) -> bool { |
14032 | 140 |
self.width.is_power_of_two() && self.height.is_power_of_two() |
141 |
} |
|
142 |
||
143 |
#[inline] |
|
15828 | 144 |
pub const fn as_power_of_two(&self) -> Option<PotSize> { |
145 |
PotSize::new(self.width, self.height) |
|
146 |
} |
|
147 |
||
148 |
#[inline] |
|
149 |
pub const fn next_power_of_two(&self) -> PotSize { |
|
150 |
PotSize::new_impl( |
|
151 |
self.width.next_power_of_two(), |
|
152 |
self.height.next_power_of_two(), |
|
153 |
) |
|
14052 | 154 |
} |
155 |
||
156 |
#[inline] |
|
14627 | 157 |
pub const fn transpose(&self) -> Self { |
14175 | 158 |
Self::new(self.height, self.width) |
159 |
} |
|
160 |
||
161 |
#[inline] |
|
14627 | 162 |
pub fn to_square(&self) -> Self { |
163 |
Self::square(max(self.width, self.height)) |
|
14125 | 164 |
} |
165 |
||
14717 | 166 |
#[inline] |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
167 |
pub const fn contains(&self, other: Self) -> bool { |
14717 | 168 |
self.width >= other.width && self.height >= other.height |
169 |
} |
|
15286 | 170 |
|
171 |
#[inline] |
|
172 |
pub fn join(&self, other: Self) -> Self { |
|
15828 | 173 |
Self::new(max(self.width, other.width), max(self.height, other.height)) |
174 |
} |
|
175 |
} |
|
176 |
||
177 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
|
178 |
pub struct PotSize { |
|
179 |
size: Size, |
|
180 |
} |
|
181 |
||
182 |
impl PotSize { |
|
183 |
#[inline] |
|
184 |
const fn new_impl(width: usize, height: usize) -> Self { |
|
185 |
debug_assert!(width.is_power_of_two() && height.is_power_of_two()); |
|
15286 | 186 |
Self { |
15828 | 187 |
size: Size::new(width, height), |
188 |
} |
|
189 |
} |
|
190 |
||
191 |
#[inline] |
|
192 |
pub const fn new(width: usize, height: usize) -> Option<Self> { |
|
193 |
if width.is_power_of_two() && height.is_power_of_two() { |
|
194 |
Some(Self::new_impl(width, height)) |
|
195 |
} else { |
|
196 |
None |
|
197 |
} |
|
198 |
} |
|
199 |
||
200 |
pub const fn size(&self) -> Size { |
|
201 |
self.size |
|
202 |
} |
|
203 |
||
204 |
pub const fn width(&self) -> usize { |
|
205 |
self.size.width |
|
206 |
} |
|
207 |
||
208 |
pub const fn height(&self) -> usize { |
|
209 |
self.size.height |
|
210 |
} |
|
211 |
||
212 |
#[inline] |
|
213 |
pub const fn square(size: usize) -> Option<Self> { |
|
214 |
if size.is_power_of_two() { |
|
215 |
Some(Self::new_impl(size, size)) |
|
216 |
} else { |
|
217 |
None |
|
15286 | 218 |
} |
219 |
} |
|
15828 | 220 |
|
221 |
#[inline] |
|
222 |
pub const fn area(&self) -> usize { |
|
223 |
self.size.area() |
|
224 |
} |
|
225 |
||
226 |
#[inline] |
|
227 |
pub const fn linear_index(&self, x: usize, y: usize) -> usize { |
|
228 |
self.size.linear_index(x, y) |
|
229 |
} |
|
230 |
||
231 |
#[inline] |
|
232 |
pub const fn transpose(&self) -> Self { |
|
233 |
Self::new_impl(self.height(), self.width()) |
|
234 |
} |
|
235 |
||
236 |
#[inline] |
|
237 |
pub fn to_square(&self) -> Self { |
|
238 |
let size = max(self.width(), self.height()); |
|
239 |
Self::new_impl(size, size) |
|
240 |
} |
|
241 |
||
242 |
#[inline] |
|
243 |
pub const fn to_mask(&self) -> SizeMask { |
|
244 |
SizeMask::new(*self) |
|
245 |
} |
|
246 |
||
247 |
pub const fn to_grid_index(&self) -> GridIndex { |
|
248 |
GridIndex::new(*self) |
|
249 |
} |
|
250 |
||
251 |
#[inline] |
|
252 |
pub const fn contains(&self, other: Self) -> bool { |
|
253 |
self.size.contains(other.size) |
|
254 |
} |
|
255 |
||
256 |
#[inline] |
|
257 |
pub fn join(&self, other: Self) -> Self { |
|
258 |
Self::new_impl( |
|
259 |
max(self.width(), other.width()), |
|
260 |
max(self.height(), other.height()), |
|
261 |
) |
|
262 |
} |
|
14032 | 263 |
} |
264 |
||
14148 | 265 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
266 |
pub struct SizeMask { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
267 |
size: Size, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
268 |
} |
14032 | 269 |
|
270 |
impl SizeMask { |
|
271 |
#[inline] |
|
15828 | 272 |
pub const fn new(size: PotSize) -> Self { |
273 |
Self { |
|
274 |
size: Size::new(!(size.width() - 1), !(size.height() - 1)), |
|
275 |
} |
|
14032 | 276 |
} |
277 |
||
278 |
#[inline] |
|
279 |
pub fn contains_x<T: Into<usize>>(&self, x: T) -> bool { |
|
280 |
(self.size.width & x.into()) == 0 |
|
281 |
} |
|
282 |
||
283 |
#[inline] |
|
284 |
pub fn contains_y<T: Into<usize>>(&self, y: T) -> bool { |
|
285 |
(self.size.height & y.into()) == 0 |
|
286 |
} |
|
287 |
||
288 |
#[inline] |
|
289 |
pub fn contains(&self, point: Point) -> bool { |
|
290 |
self.contains_x(point.x as usize) && self.contains_y(point.y as usize) |
|
291 |
} |
|
15828 | 292 |
|
293 |
#[inline] |
|
294 |
pub const fn to_size(&self) -> PotSize { |
|
295 |
PotSize::new_impl(!self.size.width + 1, !self.size.height + 1) |
|
296 |
} |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
297 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
298 |
|
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
299 |
pub struct GridIndex { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
300 |
shift: Point, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
301 |
} |
14059
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
302 |
|
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
303 |
impl GridIndex { |
15828 | 304 |
pub const fn new(size: PotSize) -> Self { |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
305 |
let shift = Point::new( |
15828 | 306 |
size.width().trailing_zeros() as i32, |
307 |
size.height().trailing_zeros() as i32, |
|
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
308 |
); |
14059
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
309 |
Self { shift } |
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
310 |
} |
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
311 |
|
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
312 |
pub const fn map(&self, position: Point) -> Point { |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
313 |
Point::new(position.x >> self.shift.x, position.y >> self.shift.y) |
14059
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
314 |
} |
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
315 |
} |
c6745a1c827a
start a physics engine to try out this data oriented thing everyone seems to be talking about
alfadur
parents:
14054
diff
changeset
|
316 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
317 |
macro_rules! bin_op_impl { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
318 |
($op: ty, $name: tt) => { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
319 |
impl $op for Point { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
320 |
type Output = Self; |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
321 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
322 |
#[inline] |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
323 |
fn $name(self, rhs: Self) -> Self::Output { |
13941 | 324 |
Self::new(self.x.$name(rhs.x), self.y.$name(rhs.y)) |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
325 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
326 |
} |
13941 | 327 |
}; |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
328 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
329 |
|
14088
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
330 |
macro_rules! scalar_bin_op_impl { |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
331 |
($($op: tt)::+, $name: tt) => { |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
332 |
impl $($op)::+<i32> for Point { |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
333 |
type Output = Self; |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
334 |
|
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
335 |
#[inline] |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
336 |
fn $name(self, rhs: i32) -> Self::Output { |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
337 |
Self::new(self.x.$name(rhs), self.y.$name(rhs)) |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
338 |
} |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
339 |
} |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
340 |
}; |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
341 |
} |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
342 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
343 |
macro_rules! bin_assign_op_impl { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
344 |
($op: ty, $name: tt) => { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
345 |
impl $op for Point { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
346 |
#[inline] |
13941 | 347 |
fn $name(&mut self, rhs: Self) { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
348 |
self.x.$name(rhs.x); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
349 |
self.y.$name(rhs.y); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
350 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
351 |
} |
13941 | 352 |
}; |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
353 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
354 |
|
14146 | 355 |
macro_rules! fp_scalar_bin_op_impl { |
356 |
($($op: tt)::+, $name: tt) => { |
|
357 |
impl $($op)::+<FPNum> for Point { |
|
358 |
type Output = FPPoint; |
|
359 |
||
360 |
#[inline] |
|
361 |
fn $name(self, rhs: FPNum) -> Self::Output { |
|
362 |
FPPoint::new(rhs.$name(self.x), rhs.$name(self.y)) |
|
363 |
} |
|
364 |
} |
|
365 |
}; |
|
366 |
} |
|
367 |
||
368 |
macro_rules! left_fp_scalar_bin_op_impl { |
|
369 |
($($op: tt)::+, $name: tt) => { |
|
370 |
impl $($op)::+<Point> for FPNum { |
|
371 |
type Output = FPPoint; |
|
372 |
||
373 |
#[inline] |
|
374 |
fn $name(self, rhs: Point) -> Self::Output { |
|
375 |
FPPoint::new(self.$name(rhs.x), self.$name(rhs.y)) |
|
376 |
} |
|
377 |
} |
|
378 |
}; |
|
379 |
} |
|
380 |
||
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
381 |
bin_op_impl!(Add, add); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
382 |
bin_op_impl!(Sub, sub); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
383 |
bin_op_impl!(Mul, mul); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
384 |
bin_op_impl!(Div, div); |
14088
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
385 |
scalar_bin_op_impl!(Mul, mul); |
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
386 |
scalar_bin_op_impl!(Div, div); |
14146 | 387 |
fp_scalar_bin_op_impl!(Mul, mul); |
388 |
fp_scalar_bin_op_impl!(Div, div); |
|
389 |
left_fp_scalar_bin_op_impl!(Mul, mul); |
|
390 |
left_fp_scalar_bin_op_impl!(Div, div); |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
391 |
bin_assign_op_impl!(AddAssign, add_assign); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
392 |
bin_assign_op_impl!(SubAssign, sub_assign); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
393 |
bin_assign_op_impl!(MulAssign, mul_assign); |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
394 |
bin_assign_op_impl!(DivAssign, div_assign); |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
395 |
|
14051
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
396 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
397 |
pub struct Rect { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
398 |
top_left: Point, |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
399 |
bottom_right: Point, |
14051
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
400 |
} |
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
401 |
|
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
402 |
impl Rect { |
14717 | 403 |
pub const EMPTY: Self = Self { |
404 |
top_left: Point::ZERO, |
|
14725 | 405 |
bottom_right: Point::diag(-1), |
14717 | 406 |
}; |
407 |
||
14051
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
408 |
#[inline] |
15828 | 409 |
pub const fn new(top_left: Point, bottom_right: Point) -> Self { |
14627 | 410 |
debug_assert!(top_left.x <= bottom_right.x + 1); |
411 |
debug_assert!(top_left.y <= bottom_right.y + 1); |
|
14140 | 412 |
Self { |
413 |
top_left, |
|
414 |
bottom_right, |
|
415 |
} |
|
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
416 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
417 |
|
15828 | 418 |
pub const fn from_box(left: i32, right: i32, top: i32, bottom: i32) -> Self { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
419 |
Self::new(Point::new(left, top), Point::new(right, bottom)) |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
420 |
} |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
421 |
|
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
422 |
pub fn from_size(top_left: Point, size: Size) -> Self { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
423 |
Self::new( |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
424 |
top_left, |
14140 | 425 |
top_left + Point::new(size.width as i32 - 1, size.height as i32 - 1), |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
426 |
) |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
427 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
428 |
|
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
429 |
pub fn from_size_coords(x: i32, y: i32, width: usize, height: usize) -> Self { |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
430 |
Self::from_size(Point::new(x, y), Size::new(width, height)) |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
431 |
} |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
432 |
|
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
433 |
pub fn at_origin(size: Size) -> Self { |
14627 | 434 |
Self::from_size(Point::ZERO, size) |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
435 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
436 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
437 |
#[inline] |
14627 | 438 |
pub const fn width(&self) -> usize { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
439 |
(self.right() - self.left() + 1) as usize |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
440 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
441 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
442 |
#[inline] |
14627 | 443 |
pub const fn height(&self) -> usize { |
14207 | 444 |
(self.bottom() - self.top() + 1) as usize |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
445 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
446 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
447 |
#[inline] |
14627 | 448 |
pub const fn size(&self) -> Size { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
449 |
Size::new(self.width(), self.height()) |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
450 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
451 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
452 |
#[inline] |
14627 | 453 |
pub const fn area(&self) -> usize { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
454 |
self.size().area() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
455 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
456 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
457 |
#[inline] |
14627 | 458 |
pub const fn left(&self) -> i32 { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
459 |
self.top_left().x |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
460 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
461 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
462 |
#[inline] |
14627 | 463 |
pub const fn top(&self) -> i32 { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
464 |
self.top_left().y |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
465 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
466 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
467 |
#[inline] |
14627 | 468 |
pub const fn right(&self) -> i32 { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
469 |
self.bottom_right().x |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
470 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
471 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
472 |
#[inline] |
14627 | 473 |
pub const fn bottom(&self) -> i32 { |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
474 |
self.bottom_right().y |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
475 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
476 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
477 |
#[inline] |
14627 | 478 |
pub const fn top_left(&self) -> Point { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
479 |
self.top_left |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
480 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
481 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
482 |
#[inline] |
14627 | 483 |
pub const fn bottom_right(&self) -> Point { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
484 |
self.bottom_right |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
485 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
486 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
487 |
#[inline] |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
488 |
pub fn center(&self) -> Point { |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
489 |
(self.top_left() + self.bottom_right()) / 2 |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
490 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
491 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
492 |
#[inline] |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
493 |
pub fn with_margin(&self, margin: i32) -> Self { |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
494 |
let offset = Point::diag(margin); |
14140 | 495 |
Self::new(self.top_left() + offset, self.bottom_right() - offset) |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
496 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
497 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
498 |
#[inline] |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
499 |
pub const fn x_range(&self) -> RangeInclusive<i32> { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
500 |
self.left()..=self.right() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
501 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
502 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
503 |
#[inline] |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
504 |
pub const fn y_range(&self) -> RangeInclusive<i32> { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
505 |
self.top()..=self.bottom() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
506 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
507 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
508 |
#[inline] |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
509 |
pub fn contains(&self, point: Point) -> bool { |
15025
dc4a12a84c92
remove RangeContains in favor of standard contains
alfadur
parents:
14726
diff
changeset
|
510 |
self.x_range().contains(&point.x) && self.y_range().contains(&point.y) |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
511 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
512 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
513 |
#[inline] |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
514 |
pub const fn contains_inside(&self, point: Point) -> bool { |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
515 |
point.x > self.left() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
516 |
&& point.x < self.right() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
517 |
&& point.y > self.top() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
518 |
&& point.y < self.bottom() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
519 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
520 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
521 |
#[inline] |
14717 | 522 |
pub fn contains_rect(&self, other: &Self) -> bool { |
523 |
self.contains(other.top_left()) && self.contains(other.bottom_right()) |
|
524 |
} |
|
525 |
||
526 |
#[inline] |
|
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
527 |
pub const fn intersects(&self, other: &Rect) -> bool { |
14726 | 528 |
self.left() <= other.right() |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
529 |
&& self.right() >= other.left() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
530 |
&& self.top() <= other.bottom() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
531 |
&& self.bottom() >= other.top() |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
532 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
533 |
|
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
534 |
#[inline] |
15828 | 535 |
pub const fn split_at(&self, point: Point) -> [Rect; 4] { |
15751
a4558e2be08c
add more const qualifiers to maintain a semblance of activity
alfadur
parents:
15384
diff
changeset
|
536 |
debug_assert!(self.contains_inside(point)); |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
537 |
[ |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
538 |
Self::from_box(self.left(), point.x, self.top(), point.y), |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
539 |
Self::from_box(point.x, self.right(), self.top(), point.y), |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
540 |
Self::from_box(point.x, self.right(), point.y, self.bottom()), |
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
541 |
Self::from_box(self.left(), point.x, point.y, self.bottom()), |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
542 |
] |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
543 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
544 |
|
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
545 |
#[inline] |
15828 | 546 |
pub const fn with_margins(&self, left: i32, right: i32, top: i32, bottom: i32) -> Self { |
14717 | 547 |
Self::from_box( |
14725 | 548 |
self.left() - left, |
14717 | 549 |
self.right() + right, |
14725 | 550 |
self.top() - top, |
14717 | 551 |
self.bottom() + bottom, |
552 |
) |
|
553 |
} |
|
554 |
||
555 |
#[inline] |
|
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
556 |
pub fn quotient(self, x: usize, y: usize) -> Point { |
14140 | 557 |
self.top_left() + Point::new((x % self.width()) as i32, (y % self.height()) as i32) |
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
558 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
559 |
} |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
560 |
|
14131 | 561 |
trait RangeClamp<T> { |
562 |
fn clamp(&self, value: T) -> T; |
|
563 |
} |
|
564 |
||
14140 | 565 |
impl<T: Ord + Copy> RangeClamp<T> for RangeInclusive<T> { |
14131 | 566 |
fn clamp(&self, value: T) -> T { |
567 |
if value < *self.start() { |
|
568 |
*self.start() |
|
569 |
} else if value > *self.end() { |
|
570 |
*self.end() |
|
571 |
} else { |
|
572 |
value |
|
573 |
} |
|
574 |
} |
|
14051
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
575 |
} |
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
576 |
|
14094 | 577 |
pub struct Polygon { |
14125 | 578 |
vertices: Vec<Point>, |
14094 | 579 |
} |
580 |
||
581 |
impl Polygon { |
|
582 |
pub fn new(vertices: &[Point]) -> Self { |
|
583 |
let mut v = Vec::with_capacity(vertices.len() + 1); |
|
584 |
v.extend_from_slice(vertices); |
|
585 |
if !v.is_empty() { |
|
586 |
let start = v[0]; |
|
587 |
v.push(start); |
|
588 |
} |
|
589 |
Self { vertices: v } |
|
590 |
} |
|
591 |
||
592 |
pub fn edges_count(&self) -> usize { |
|
15215 | 593 |
self.vertices.len().saturating_sub(1) |
14094 | 594 |
} |
595 |
||
596 |
pub fn get_edge(&self, index: usize) -> Line { |
|
597 |
Line::new(self.vertices[index], self.vertices[index + 1]) |
|
598 |
} |
|
599 |
||
14124 | 600 |
pub fn split_edge(&mut self, edge_index: usize, vertex: Point) { |
601 |
self.vertices.insert(edge_index + 1, vertex); |
|
602 |
} |
|
603 |
||
604 |
pub fn iter<'a>(&'a self) -> impl Iterator<Item = &Point> + 'a { |
|
605 |
(&self.vertices[..self.edges_count()]).iter() |
|
606 |
} |
|
607 |
||
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
608 |
pub fn iter_mut<'a>(&'a mut self) -> impl Iterator<Item = &mut Point> + 'a { |
14155 | 609 |
let edges_count = self.edges_count(); |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
610 |
let start = self.vertices.as_mut_ptr(); |
14155 | 611 |
let end = unsafe { start.add(edges_count) }; |
14140 | 612 |
PolygonPointsIteratorMut { |
613 |
source: self, |
|
614 |
start, |
|
615 |
end, |
|
616 |
} |
|
14094 | 617 |
} |
618 |
||
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
619 |
fn force_close(&mut self) { |
14133 | 620 |
if !self.vertices.is_empty() { |
14208 | 621 |
let edges_count = self.edges_count(); |
622 |
self.vertices[edges_count] = self.vertices[0]; |
|
14133 | 623 |
} |
624 |
} |
|
625 |
||
14094 | 626 |
pub fn iter_edges<'a>(&'a self) -> impl Iterator<Item = Line> + 'a { |
627 |
(&self.vertices[0..self.edges_count()]) |
|
628 |
.iter() |
|
629 |
.zip(&self.vertices[1..]) |
|
630 |
.map(|(s, e)| Line::new(*s, *e)) |
|
631 |
} |
|
14140 | 632 |
|
633 |
pub fn bezierize(&mut self, segments_number: u32) { |
|
634 |
fn calc_point(p1: Point, p2: Point, p3: Point) -> FPPoint { |
|
635 |
let diff13 = (p1 - p3).to_fppoint(); |
|
636 |
let diff13_norm = diff13.distance(); |
|
637 |
||
638 |
if diff13_norm.is_zero() { |
|
639 |
diff13 |
|
640 |
} else { |
|
641 |
let diff12_norm = (p1 - p2).to_fppoint().distance(); |
|
642 |
let diff23_norm = (p2 - p3).to_fppoint().distance(); |
|
643 |
let min_distance = min(diff13_norm, min(diff12_norm, diff23_norm)); |
|
644 |
||
645 |
diff13 * min_distance / diff13_norm / 3 |
|
646 |
} |
|
647 |
} |
|
648 |
||
649 |
if self.vertices.len() < 4 { |
|
650 |
return; |
|
651 |
} |
|
652 |
||
653 |
let delta = fp!(1 / segments_number); |
|
654 |
let mut bezierized_vertices = Vec::new(); |
|
655 |
let mut pi = 0; |
|
656 |
let mut i = 1; |
|
657 |
let mut ni = 2; |
|
658 |
let mut right_point = calc_point(self.vertices[pi], self.vertices[i], self.vertices[ni]); |
|
659 |
let mut left_point; |
|
660 |
||
661 |
pi += 1; |
|
662 |
while pi != 0 { |
|
663 |
pi = i; |
|
664 |
i = ni; |
|
665 |
ni += 1; |
|
666 |
if ni >= self.vertices.len() { |
|
667 |
ni = 0; |
|
668 |
} |
|
669 |
||
670 |
left_point = right_point; |
|
671 |
right_point = calc_point(self.vertices[pi], self.vertices[i], self.vertices[ni]); |
|
672 |
||
673 |
bezierized_vertices.extend(BezierCurveSegments::new( |
|
674 |
Line::new(self.vertices[pi], self.vertices[i]), |
|
675 |
left_point, |
|
676 |
-right_point, |
|
677 |
delta, |
|
678 |
)); |
|
679 |
} |
|
680 |
||
681 |
self.vertices = bezierized_vertices; |
|
682 |
} |
|
14094 | 683 |
} |
684 |
||
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
685 |
struct PolygonPointsIteratorMut<'a> { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
686 |
source: &'a mut Polygon, |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
687 |
start: *mut Point, |
14140 | 688 |
end: *mut Point, |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
689 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
690 |
|
14140 | 691 |
impl<'a> Iterator for PolygonPointsIteratorMut<'a> { |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
692 |
type Item = &'a mut Point; |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
693 |
|
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
694 |
fn next(&mut self) -> Option<<Self as Iterator>::Item> { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
695 |
if self.start == self.end { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
696 |
None |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
697 |
} else { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
698 |
unsafe { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
699 |
let result = &mut *self.start; |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
700 |
self.start = self.start.add(1); |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
701 |
Some(result) |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
702 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
703 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
704 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
705 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
706 |
|
14140 | 707 |
impl<'a> Drop for PolygonPointsIteratorMut<'a> { |
14134
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
708 |
fn drop(&mut self) { |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
709 |
self.source.force_close(); |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
710 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
711 |
} |
09f62bb046ef
actually there is a way to preserve mutable polygon iterator
alfadur
parents:
14133
diff
changeset
|
712 |
|
14094 | 713 |
impl From<Vec<Point>> for Polygon { |
714 |
fn from(mut v: Vec<Point>) -> Self { |
|
715 |
if !v.is_empty() && v[0] != v[v.len() - 1] { |
|
716 |
let start = v[0]; |
|
717 |
v.push(start) |
|
718 |
} |
|
719 |
Self { vertices: v } |
|
720 |
} |
|
721 |
} |
|
722 |
||
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
723 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
14131 | 724 |
pub struct Ray { |
725 |
pub start: Point, |
|
14140 | 726 |
pub direction: Point, |
14131 | 727 |
} |
728 |
||
729 |
impl Ray { |
|
730 |
#[inline] |
|
14627 | 731 |
pub const fn new(start: Point, direction: Point) -> Ray { |
14131 | 732 |
Self { start, direction } |
733 |
} |
|
734 |
||
735 |
#[inline] |
|
14627 | 736 |
pub const fn tangent_mul(&self, x: i32) -> i32 { |
14142 | 737 |
self.direction.tangent_mul(x) |
14131 | 738 |
} |
739 |
||
740 |
#[inline] |
|
14627 | 741 |
pub const fn cotangent_mul(&self, y: i32) -> i32 { |
14142 | 742 |
self.direction.cotangent_mul(y) |
14131 | 743 |
} |
744 |
||
745 |
#[inline] |
|
746 |
pub fn orientation(&self, point: Point) -> i32 { |
|
747 |
(point - self.start).cross(self.direction).signum() |
|
748 |
} |
|
749 |
} |
|
750 |
||
751 |
#[derive(PartialEq, Eq, Clone, Copy, Debug)] |
|
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
752 |
pub struct Line { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
753 |
pub start: Point, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
754 |
pub end: Point, |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
755 |
} |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
756 |
|
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
757 |
impl Line { |
14627 | 758 |
pub const ZERO: Self = Self::new(Point::ZERO, Point::ZERO); |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
759 |
|
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
760 |
#[inline] |
14627 | 761 |
pub const fn new(start: Point, end: Point) -> Self { |
762 |
Self { start, end } |
|
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
763 |
} |
14077 | 764 |
|
765 |
#[inline] |
|
766 |
pub fn center(&self) -> Point { |
|
14088
f483f844da98
component-wise division is actually useful sometimes
alfadur
parents:
14081
diff
changeset
|
767 |
(self.start + self.end) / 2 |
14077 | 768 |
} |
14106 | 769 |
|
770 |
#[inline] |
|
14131 | 771 |
pub fn scaled_direction(&self) -> Point { |
772 |
self.end - self.start |
|
773 |
} |
|
774 |
||
775 |
#[inline] |
|
14106 | 776 |
pub fn scaled_normal(&self) -> Point { |
14131 | 777 |
self.scaled_direction().rotate90() |
778 |
} |
|
779 |
||
780 |
#[inline] |
|
781 |
pub fn to_ray(&self) -> Ray { |
|
782 |
Ray::new(self.start, self.scaled_direction()) |
|
14106 | 783 |
} |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
784 |
} |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
785 |
|
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
786 |
impl IntoIterator for Line { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
787 |
type Item = Point; |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
788 |
type IntoIter = LinePoints; |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
789 |
|
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
790 |
fn into_iter(self) -> Self::IntoIter { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
791 |
LinePoints::new(self) |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
792 |
} |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
793 |
} |
14051
8a0d69c16cad
Implement OutlinePoints for land generators, some ground work for template based landgen
unc0rr
parents:
13950
diff
changeset
|
794 |
|
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
795 |
pub struct LinePoints { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
796 |
accumulator: Point, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
797 |
direction: Point, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
798 |
sign: Point, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
799 |
current: Point, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
800 |
total_steps: i32, |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
801 |
step: i32, |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
802 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
803 |
|
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
804 |
impl LinePoints { |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
805 |
pub fn new(line: Line) -> Self { |
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
806 |
let dir = line.end - line.start; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
807 |
|
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
808 |
Self { |
14627 | 809 |
accumulator: Point::ZERO, |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
810 |
direction: dir.abs(), |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
811 |
sign: dir.signum(), |
14076
e5904ead4864
Introduce OutlineSegmentsIterator, some refactoring
unC0Rr
parents:
14059
diff
changeset
|
812 |
current: line.start, |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
813 |
total_steps: dir.max_norm(), |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
814 |
step: 0, |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
815 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
816 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
817 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
818 |
|
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
819 |
impl Iterator for LinePoints { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
820 |
type Item = Point; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
821 |
|
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
822 |
fn next(&mut self) -> Option<Self::Item> { |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
823 |
if self.step <= self.total_steps { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
824 |
self.accumulator += self.direction; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
825 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
826 |
if self.accumulator.x > self.total_steps { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
827 |
self.accumulator.x -= self.total_steps; |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
828 |
self.current.x += self.sign.x; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
829 |
} |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
830 |
if self.accumulator.y > self.total_steps { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
831 |
self.accumulator.y -= self.total_steps; |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
832 |
self.current.y += self.sign.y; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
833 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
834 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
835 |
self.step += 1; |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
836 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
837 |
Some(self.current) |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
838 |
} else { |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
839 |
None |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
840 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
841 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
842 |
} |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
843 |
|
13941 | 844 |
pub struct ArcPoints { |
845 |
point: Point, |
|
846 |
step: i32, |
|
847 |
} |
|
848 |
||
849 |
impl ArcPoints { |
|
14627 | 850 |
pub const fn new(radius: i32) -> Self { |
13941 | 851 |
Self { |
852 |
point: Point::new(0, radius), |
|
853 |
step: 3 - 2 * radius, |
|
854 |
} |
|
855 |
} |
|
856 |
} |
|
857 |
||
858 |
impl Iterator for ArcPoints { |
|
859 |
type Item = Point; |
|
860 |
||
861 |
fn next(&mut self) -> Option<Self::Item> { |
|
862 |
if self.point.x < self.point.y { |
|
863 |
let result = self.point; |
|
864 |
||
865 |
if self.step < 0 { |
|
866 |
self.step += self.point.x * 4 + 6; |
|
867 |
} else { |
|
868 |
self.step += (self.point.x - self.point.y) * 4 + 10; |
|
869 |
self.point.y -= 1; |
|
870 |
} |
|
871 |
||
872 |
self.point.x += 1; |
|
873 |
||
874 |
Some(result) |
|
875 |
} else if self.point.x == self.point.y { |
|
13947 | 876 |
self.point.x += 1; |
13950 | 877 |
|
13941 | 878 |
Some(self.point) |
879 |
} else { |
|
880 |
None |
|
881 |
} |
|
882 |
} |
|
883 |
} |
|
884 |
||
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
885 |
pub struct EquidistantPoints { |
15182 | 886 |
vector: Vec<Point>, |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
887 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
888 |
|
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
889 |
impl EquidistantPoints { |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
890 |
pub fn new(vector: Point) -> Self { |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
891 |
Self { |
15182 | 892 |
vector: if vector.x == vector.y { |
893 |
vec![ |
|
894 |
Point::new(vector.x, vector.x), |
|
895 |
Point::new(vector.x, -vector.x), |
|
896 |
Point::new(-vector.x, -vector.x), |
|
897 |
Point::new(-vector.x, vector.x), |
|
898 |
] |
|
899 |
} else { |
|
900 |
vec![ |
|
901 |
Point::new(vector.x, vector.y), |
|
902 |
Point::new(vector.x, -vector.y), |
|
903 |
Point::new(-vector.x, -vector.y), |
|
904 |
Point::new(-vector.x, vector.y), |
|
905 |
Point::new(vector.y, vector.x), |
|
906 |
Point::new(vector.y, -vector.x), |
|
907 |
Point::new(-vector.y, -vector.x), |
|
908 |
Point::new(-vector.y, vector.x), |
|
909 |
] |
|
910 |
}, |
|
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
911 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
912 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
913 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
914 |
|
15182 | 915 |
impl IntoIterator for EquidistantPoints { |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
916 |
type Item = Point; |
15182 | 917 |
type IntoIter = std::vec::IntoIter<Point>; |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
918 |
|
15182 | 919 |
fn into_iter(self) -> Self::IntoIter { |
920 |
self.vector.into_iter() |
|
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
921 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
922 |
} |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
923 |
|
14139 | 924 |
pub struct BezierCurveSegments { |
925 |
segment: Line, |
|
14146 | 926 |
control_point1: FPPoint, |
927 |
control_point2: FPPoint, |
|
14139 | 928 |
offset: FPNum, |
14140 | 929 |
max_offset: FPNum, |
14139 | 930 |
delta: FPNum, |
14140 | 931 |
have_finished: bool, |
14139 | 932 |
} |
933 |
||
934 |
impl BezierCurveSegments { |
|
14140 | 935 |
pub fn new(segment: Line, p1: FPPoint, p2: FPPoint, delta: FPNum) -> Self { |
14139 | 936 |
Self { |
937 |
segment, |
|
14146 | 938 |
control_point1: segment.start.to_fppoint() - p1, |
939 |
control_point2: segment.end.to_fppoint() - p2, |
|
14139 | 940 |
offset: fp!(0), |
14140 | 941 |
max_offset: fp!(4095 / 4096), |
14139 | 942 |
delta, |
14140 | 943 |
have_finished: false, |
14139 | 944 |
} |
945 |
} |
|
946 |
} |
|
947 |
||
948 |
impl Iterator for BezierCurveSegments { |
|
949 |
type Item = Point; |
|
950 |
||
951 |
fn next(&mut self) -> Option<Self::Item> { |
|
14140 | 952 |
if self.offset < self.max_offset { |
14139 | 953 |
let offset_sq = self.offset * self.offset; |
954 |
let offset_cub = offset_sq * self.offset; |
|
955 |
||
956 |
let r1 = fp!(1) - self.offset * 3 + offset_sq * 3 - offset_cub; |
|
957 |
let r2 = self.offset * 3 - offset_sq * 6 + offset_cub * 3; |
|
958 |
let r3 = offset_sq * 3 - offset_cub * 3; |
|
959 |
||
14146 | 960 |
let p = r1 * self.segment.start |
961 |
+ r2 * self.control_point1 |
|
962 |
+ r3 * self.control_point2 |
|
963 |
+ offset_cub * self.segment.end; |
|
14139 | 964 |
|
965 |
self.offset += self.delta; |
|
966 |
||
14146 | 967 |
Some(Point::from_fppoint(&p)) |
14140 | 968 |
} else if !self.have_finished { |
969 |
self.have_finished = true; |
|
970 |
||
971 |
Some(self.segment.end) |
|
14139 | 972 |
} else { |
973 |
None |
|
974 |
} |
|
975 |
} |
|
976 |
} |
|
977 |
||
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
978 |
#[cfg(test)] |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
979 |
mod tests { |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
980 |
use super::*; |
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
981 |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
982 |
fn get_points(coords: &[(i32, i32)]) -> Vec<Point> { |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
983 |
coords.iter().map(|(x, y)| Point::new(*x, *y)).collect() |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
984 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
985 |
|
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
986 |
#[test] |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
987 |
fn line_basic() { |
14077 | 988 |
let line: Vec<Point> = Line::new(Point::new(0, 0), Point::new(3, 3)) |
989 |
.into_iter() |
|
990 |
.collect(); |
|
991 |
let v = get_points(&[(0, 0), (1, 1), (2, 2), (3, 3)]); |
|
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
992 |
|
14077 | 993 |
assert_eq!(line, v); |
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
994 |
} |
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
995 |
|
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
996 |
#[test] |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
997 |
fn line_skewed() { |
14077 | 998 |
let line: Vec<Point> = Line::new(Point::new(0, 0), Point::new(5, -7)) |
999 |
.into_iter() |
|
1000 |
.collect(); |
|
13941 | 1001 |
let v = get_points(&[ |
1002 |
(0, 0), |
|
1003 |
(1, -1), |
|
1004 |
(2, -2), |
|
1005 |
(2, -3), |
|
1006 |
(3, -4), |
|
1007 |
(4, -5), |
|
1008 |
(4, -6), |
|
1009 |
(5, -7), |
|
1010 |
]); |
|
13938
1fa905aa4cdb
move point struct into integral-geometry and use it to refactor a bit
alfadur
parents:
13937
diff
changeset
|
1011 |
|
14077 | 1012 |
assert_eq!(line, v); |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
1013 |
} |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1014 |
|
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1015 |
#[test] |
13943
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1016 |
fn equidistant_full() { |
15182 | 1017 |
let n: Vec<Point> = EquidistantPoints::new(Point::new(1, 3)) |
1018 |
.into_iter() |
|
1019 |
.collect(); |
|
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1020 |
let v = get_points(&[ |
15182 | 1021 |
(1, 3), |
1022 |
(1, -3), |
|
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1023 |
(-1, -3), |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1024 |
(-1, 3), |
15182 | 1025 |
(3, 1), |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1026 |
(3, -1), |
15182 | 1027 |
(-3, -1), |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1028 |
(-3, 1), |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1029 |
]); |
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1030 |
|
14077 | 1031 |
assert_eq!(n, v); |
13942
7e7a03e85ac4
Add EquidistantPoints iterator to help iterating over all points of circles
unc0rr
parents:
13941
diff
changeset
|
1032 |
} |
13943
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1033 |
|
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1034 |
#[test] |
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1035 |
fn equidistant_half() { |
15182 | 1036 |
let n: Vec<Point> = EquidistantPoints::new(Point::new(2, 2)) |
1037 |
.into_iter() |
|
1038 |
.collect(); |
|
1039 |
let v = get_points(&[(2, 2), (2, -2), (-2, -2), (-2, 2)]); |
|
14077 | 1040 |
|
1041 |
assert_eq!(n, v); |
|
1042 |
} |
|
13943
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1043 |
|
14077 | 1044 |
#[test] |
1045 |
fn line() { |
|
1046 |
let l = Line::new(Point::new(1, 1), Point::new(5, 6)); |
|
1047 |
||
1048 |
assert_eq!(l.center(), Point::new(3, 3)); |
|
13943
a325ed57ebfe
Don't generate unnecessary duplication in case of equal coordinates
unc0rr
parents:
13942
diff
changeset
|
1049 |
} |
14078 | 1050 |
|
1051 |
#[test] |
|
1052 |
fn rect() { |
|
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
1053 |
let r = Rect::from_box(10, 100, 0, 70); |
14078 | 1054 |
|
14081 | 1055 |
assert!(r.contains_inside(Point::new(99, 69))); |
1056 |
assert!(!r.contains_inside(Point::new(100, 70))); |
|
1057 |
||
14078 | 1058 |
assert_eq!(r.top_left(), Point::new(10, 0)); |
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
1059 |
assert_eq!(r.with_margin(12), Rect::from_box(22, 88, 12, 58)); |
14078 | 1060 |
} |
14125 | 1061 |
|
1062 |
#[test] |
|
1063 |
fn fit() { |
|
14137
3119d665d3c6
collapse rectangle types back together with consistent usage of size
alfadur
parents:
14135
diff
changeset
|
1064 |
let r = Rect::from_box(10, 100, 0, 70); |
14125 | 1065 |
|
14135
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
1066 |
assert_eq!(Point::new(0, -10).clamp(&r), Point::new(10, 0)); |
7f5a591e1c43
separate rectangle types based on right/bottom edge inclusivity
alfadur
parents:
14134
diff
changeset
|
1067 |
assert_eq!(Point::new(1000, 1000).clamp(&r), Point::new(100, 70)); |
14125 | 1068 |
} |
13935
75eaf7c71789
Introduce integral-geometry crate, implement LinePoints iterator
unc0rr
parents:
diff
changeset
|
1069 |
} |