1 use std::ops::{Add, AddAssign, Sub, SubAssign, Mul, MulAssign, Div, DivAssign, Neg};
3 ////////// POINT ///////////////////////////////////////////////////////////////
7 ( $x:expr, $y:expr ) => {
12 #[derive(Debug, Default, Copy, Clone, PartialEq)]
19 pub fn length(&self) -> f64 {
20 ((self.x * self.x) + (self.y * self.y)).sqrt()
23 pub fn normalized(&self) -> Self {
24 let l = self.length();
31 pub fn to_angle(&self) -> Angle {
32 self.y.atan2(self.x).radians()
35 pub fn to_i32(self) -> Point<i32> {
42 pub fn cross_product(&self, p: Self) -> f64 {
43 return self.x * p.y - self.y * p.x;
46 /// Returns the perpendicular projection of this vector on a line with the specified angle.
47 pub fn project_onto(&self, angle: Angle) -> Point<f64> {
48 let dot_product = self.length() * (self.to_angle() - angle).to_radians().cos();
49 Point::from(angle) * dot_product
53 macro_rules! impl_point_op {
54 ($op:tt, $trait:ident($fn:ident), $trait_assign:ident($fn_assign:ident), $rhs:ident = $Rhs:ty => $x:expr, $y:expr) => {
55 impl<T: $trait<Output = T>> $trait<$Rhs> for Point<T> {
58 fn $fn(self, $rhs: $Rhs) -> Self {
66 impl<T: $trait<Output = T> + Copy> $trait_assign<$Rhs> for Point<T> {
67 fn $fn_assign(&mut self, $rhs: $Rhs) {
77 impl_point_op!(+, Add(add), AddAssign(add_assign), rhs = Point<T> => rhs.x, rhs.y);
78 impl_point_op!(-, Sub(sub), SubAssign(sub_assign), rhs = Point<T> => rhs.x, rhs.y);
79 impl_point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = Point<T> => rhs.x, rhs.y);
80 impl_point_op!(/, Div(div), DivAssign(div_assign), rhs = Point<T> => rhs.x, rhs.y);
81 impl_point_op!(+, Add(add), AddAssign(add_assign), rhs = (T, T) => rhs.0, rhs.1);
82 impl_point_op!(-, Sub(sub), SubAssign(sub_assign), rhs = (T, T) => rhs.0, rhs.1);
83 impl_point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = (T, T) => rhs.0, rhs.1);
84 impl_point_op!(/, Div(div), DivAssign(div_assign), rhs = (T, T) => rhs.0, rhs.1);
85 impl_point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = Dimension<T> => rhs.width, rhs.height);
86 impl_point_op!(/, Div(div), DivAssign(div_assign), rhs = Dimension<T> => rhs.width, rhs.height);
88 ////////// multiply point with scalar //////////////////////////////////////////
89 impl<T: Mul<Output = T> + Copy> Mul<T> for Point<T> {
92 fn mul(self, rhs: T) -> Self {
100 impl<T: Mul<Output = T> + Copy> MulAssign<T> for Point<T> {
101 fn mul_assign(&mut self, rhs: T) {
109 ////////// divide point with scalar ////////////////////////////////////////////
110 impl<T: Div<Output = T> + Copy> Div<T> for Point<T> {
113 fn div(self, rhs: T) -> Self {
121 impl<T: Div<Output = T> + Copy> DivAssign<T> for Point<T> {
122 fn div_assign(&mut self, rhs: T) {
130 impl<T: Neg<Output = T>> Neg for Point<T> {
133 fn neg(self) -> Self {
141 impl<T> From<(T, T)> for Point<T> {
142 fn from(item: (T, T)) -> Self {
150 impl<T> From<Point<T>> for (T, T) {
151 fn from(item: Point<T>) -> Self {
156 impl From<Angle> for Point<f64> {
157 fn from(item: Angle) -> Self {
165 ////////// ANGLE ///////////////////////////////////////////////////////////////
167 #[derive(Debug, Default, Clone, Copy)]
168 pub struct Angle(pub f64);
171 fn radians(self) -> Angle;
172 fn degrees(self) -> Angle;
175 macro_rules! impl_angle {
178 impl ToAngle for $type {
179 fn radians(self) -> Angle {
183 fn degrees(self) -> Angle {
184 Angle((self as f64).to_radians())
188 impl Mul<$type> for Angle {
191 fn mul(self, rhs: $type) -> Self {
192 Angle(self.0 * (rhs as f64))
196 impl MulAssign<$type> for Angle {
197 fn mul_assign(&mut self, rhs: $type) {
198 self.0 *= rhs as f64;
202 impl Div<$type> for Angle {
205 fn div(self, rhs: $type) -> Self {
206 Angle(self.0 / (rhs as f64))
210 impl DivAssign<$type> for Angle {
211 fn div_assign(&mut self, rhs: $type) {
212 self.0 /= rhs as f64;
219 impl_angle!(f32, f64, i8, i16, i32, i64, isize, u8, u16, u32, u64, usize);
222 pub fn to_radians(self) -> f64 {
226 pub fn to_degrees(self) -> f64 {
230 /// Returns the reflection of the incident when mirrored along this angle.
231 pub fn mirror(&self, incidence: Angle) -> Angle {
232 Angle((std::f64::consts::PI + self.0 * 2.0 - incidence.0) % std::f64::consts::TAU)
235 pub fn reverse(&self) -> Angle {
236 Angle((self.0 + std::f64::consts::PI) % std::f64::consts::TAU)
240 impl PartialEq for Angle {
241 fn eq(&self, rhs: &Angle) -> bool {
242 self.0 % std::f64::consts::TAU == rhs.0 % std::f64::consts::TAU
246 // addition and subtraction of angles
248 impl Add<Angle> for Angle {
251 fn add(self, rhs: Angle) -> Self {
252 Angle(self.0 + rhs.0)
256 impl AddAssign<Angle> for Angle {
257 fn add_assign(&mut self, rhs: Angle) {
262 impl Sub<Angle> for Angle {
265 fn sub(self, rhs: Angle) -> Self {
266 Angle(self.0 - rhs.0)
270 impl SubAssign<Angle> for Angle {
271 fn sub_assign(&mut self, rhs: Angle) {
276 ////////// INTERSECTION ////////////////////////////////////////////////////////
279 pub enum Intersection {
281 //Line(Point<f64>, Point<f64>), // TODO: overlapping collinear
286 pub fn lines(p1: Point<f64>, p2: Point<f64>, p3: Point<f64>, p4: Point<f64>) -> Intersection {
290 let denomimator = -s2.x * s1.y + s1.x * s2.y;
291 if denomimator != 0.0 {
292 let s = (-s1.y * (p1.x - p3.x) + s1.x * (p1.y - p3.y)) / denomimator;
293 let t = ( s2.x * (p1.y - p3.y) - s2.y * (p1.x - p3.x)) / denomimator;
295 if (0.0..=1.0).contains(&s) && (0.0..=1.0).contains(&t) {
296 return Intersection::Point(p1 + (s1 * t))
304 ////////// DIMENSION ///////////////////////////////////////////////////////////
308 ( $w:expr, $h:expr ) => {
309 Dimension { width: $w, height: $h }
313 #[derive(Debug, Default, Copy, Clone, PartialEq)]
314 pub struct Dimension<T> {
319 impl<T: Mul<Output = T> + Copy> Dimension<T> {
321 pub fn area(&self) -> T {
322 self.width * self.height
326 impl<T> From<(T, T)> for Dimension<T> {
327 fn from(item: (T, T)) -> Self {
335 impl<T> From<Dimension<T>> for (T, T) {
336 fn from(item: Dimension<T>) -> Self {
337 (item.width, item.height)
341 ////////////////////////////////////////////////////////////////////////////////
344 pub fn supercover_line_int(p1: Point<isize>, p2: Point<isize>) -> Vec<Point<isize>> {
346 let n = point!(d.x.abs(), d.y.abs());
347 let step = point!(d.x.signum(), d.y.signum());
350 let mut points = vec!(point!(p.x as isize, p.y as isize));
351 let mut i = point!(0, 0);
352 while i.x < n.x || i.y < n.y {
353 let decision = (1 + 2 * i.x) * n.y - (1 + 2 * i.y) * n.x;
354 if decision == 0 { // next step is diagonal
359 } else if decision < 0 { // next step is horizontal
362 } else { // next step is vertical
366 points.push(point!(p.x as isize, p.y as isize));
372 /// Calculates all points a line crosses, unlike Bresenham's line algorithm.
373 /// There might be room for a lot of improvement here.
374 pub fn supercover_line(mut p1: Point<f64>, mut p2: Point<f64>) -> Vec<Point<isize>> {
375 let mut delta = p2 - p1;
376 if (delta.x.abs() > delta.y.abs() && delta.x.is_sign_negative()) || (delta.x.abs() <= delta.y.abs() && delta.y.is_sign_negative()) {
377 std::mem::swap(&mut p1, &mut p2);
381 let mut last = point!(p1.x as isize, p1.y as isize);
382 let mut coords: Vec<Point<isize>> = vec!();
385 if delta.x.abs() > delta.y.abs() {
386 let k = delta.y / delta.x;
387 let m = p1.y as f64 - p1.x as f64 * k;
388 for x in (p1.x as isize + 1)..=(p2.x as isize) {
389 let y = (k * x as f64 + m).floor();
390 let next = point!(x as isize - 1, y as isize);
394 let next = point!(x as isize, y as isize);
399 let k = delta.x / delta.y;
400 let m = p1.x as f64 - p1.y as f64 * k;
401 for y in (p1.y as isize + 1)..=(p2.y as isize) {
402 let x = (k * y as f64 + m).floor();
403 let next = point!(x as isize, y as isize - 1);
407 let next = point!(x as isize, y as isize);
413 let next = point!(p2.x as isize, p2.y as isize);
421 ////////// TESTS ///////////////////////////////////////////////////////////////
428 fn immutable_copy_of_point() {
429 let a = point!(0, 0);
430 let mut b = a; // Copy
431 assert_eq!(a, b); // PartialEq
433 assert_ne!(a, b); // PartialEq
438 let mut a = point!(1, 0);
439 assert_eq!(a + point!(2, 2), point!(3, 2)); // Add
440 a += point!(2, 2); // AddAssign
441 assert_eq!(a, point!(3, 2));
442 assert_eq!(point!(1, 0) + (2, 3), point!(3, 3));
447 let mut a = point!(1, 0);
448 assert_eq!(a - point!(2, 2), point!(-1, -2));
450 assert_eq!(a, point!(-1, -2));
451 assert_eq!(point!(1, 0) - (2, 3), point!(-1, -3));
456 let mut a = point!(1, 2);
457 assert_eq!(a * 2, point!(2, 4));
458 assert_eq!(a * point!(2, 3), point!(2, 6));
460 assert_eq!(a, point!(2, 4));
462 assert_eq!(a, point!(6, 4));
463 assert_eq!(point!(1, 0) * (2, 3), point!(2, 0));
468 let mut a = point!(4, 8);
469 assert_eq!(a / 2, point!(2, 4));
470 assert_eq!(a / point!(2, 4), point!(2, 2));
472 assert_eq!(a, point!(2, 4));
474 assert_eq!(a, point!(1, 1));
475 assert_eq!(point!(6, 3) / (2, 3), point!(3, 1));
480 assert_eq!(point!(1, 1), -point!(-1, -1));
485 assert_eq!(0.radians(), 0.degrees());
486 assert_eq!(0.degrees(), 360.degrees());
487 assert_eq!(180.degrees(), std::f64::consts::PI.radians());
488 assert_eq!(std::f64::consts::PI.radians().to_degrees(), 180.0);
489 assert!((Point::from(90.degrees()) - point!(0.0, 1.0)).length() < 0.001);
490 assert!((Point::from(std::f64::consts::FRAC_PI_2.radians()) - point!(0.0, 1.0)).length() < 0.001);
494 fn area_for_dimension_of_multipliable_type() {
495 let r: Dimension<_> = (30, 20).into(); // the Into trait uses the From trait
496 assert_eq!(r.area(), 30 * 20);
497 // let a = Dimension::from(("a".to_string(), "b".to_string())).area(); // this doesn't work, because area() is not implemented for String
501 fn intersection_of_lines() {
502 let p1 = point!(0.0, 0.0);
503 let p2 = point!(2.0, 2.0);
504 let p3 = point!(0.0, 2.0);
505 let p4 = point!(2.0, 0.0);
506 let r = Intersection::lines(p1, p2, p3, p4);
507 if let Intersection::Point(p) = r {
508 assert_eq!(p, point!(1.0, 1.0));
515 fn some_coordinates_on_line() {
517 let coords = supercover_line(point!(0.0, 0.0), point!(3.3, 2.2));
518 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(1, 1), point!(2, 1), point!(2, 2), point!(3, 2)]);
521 let coords = supercover_line(point!(0.0, 5.0), point!(3.3, 2.2));
522 assert_eq!(coords.as_slice(), &[point!(0, 5), point!(0, 4), point!(1, 4), point!(1, 3), point!(2, 3), point!(2, 2), point!(3, 2)]);
525 let coords = supercover_line(point!(0.0, 0.0), point!(2.2, 3.3));
526 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(0, 1), point!(1, 1), point!(1, 2), point!(2, 2), point!(2, 3)]);
529 let coords = supercover_line(point!(5.0, 0.0), point!(3.0, 3.0));
530 assert_eq!(coords.as_slice(), &[point!(5, 0), point!(4, 0), point!(4, 1), point!(3, 1), point!(3, 2), point!(3, 3)]);
533 let coords = supercover_line(point!(0.0, 0.0), point!(-3.0, -2.0));
534 assert_eq!(coords.as_slice(), &[point!(-3, -2), point!(-2, -2), point!(-2, -1), point!(-1, -1), point!(-1, 0), point!(0, 0)]);
537 let coords = supercover_line(point!(0.0, 0.0), point!(2.3, 1.1));
538 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(2, 0), point!(2, 1)]);