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_radians(&self) -> Radians {
32 Radians(self.y.atan2(self.x))
35 pub fn to_degrees(&self) -> Degrees {
36 self.to_radians().to_degrees()
39 pub fn to_i32(self) -> Point<i32> {
47 macro_rules! point_op {
48 ($op:tt, $trait:ident($fn:ident), $trait_assign:ident($fn_assign:ident), $rhs:ident = $Rhs:ty => $x:expr, $y:expr) => {
49 impl<T: $trait<Output = T>> $trait<$Rhs> for Point<T> {
52 fn $fn(self, $rhs: $Rhs) -> Self {
60 impl<T: $trait<Output = T> + Copy> $trait_assign<$Rhs> for Point<T> {
61 fn $fn_assign(&mut self, $rhs: $Rhs) {
71 point_op!(+, Add(add), AddAssign(add_assign), rhs = Point<T> => rhs.x, rhs.y);
72 point_op!(-, Sub(sub), SubAssign(sub_assign), rhs = Point<T> => rhs.x, rhs.y);
73 point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = Point<T> => rhs.x, rhs.y);
74 point_op!(/, Div(div), DivAssign(div_assign), rhs = Point<T> => rhs.x, rhs.y);
75 point_op!(+, Add(add), AddAssign(add_assign), rhs = (T, T) => rhs.0, rhs.1);
76 point_op!(-, Sub(sub), SubAssign(sub_assign), rhs = (T, T) => rhs.0, rhs.1);
77 point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = (T, T) => rhs.0, rhs.1);
78 point_op!(/, Div(div), DivAssign(div_assign), rhs = (T, T) => rhs.0, rhs.1);
80 ////////// multiply point with scalar //////////////////////////////////////////
81 impl<T: Mul<Output = T> + Copy> Mul<T> for Point<T> {
84 fn mul(self, rhs: T) -> Self {
92 impl<T: Mul<Output = T> + Copy> MulAssign<T> for Point<T> {
93 fn mul_assign(&mut self, rhs: T) {
101 ////////// divide point with scalar ////////////////////////////////////////////
102 impl<T: Div<Output = T> + Copy> Div<T> for Point<T> {
105 fn div(self, rhs: T) -> Self {
113 impl<T: Div<Output = T> + Copy> DivAssign<T> for Point<T> {
114 fn div_assign(&mut self, rhs: T) {
122 impl<T: Neg<Output = T>> Neg for Point<T> {
125 fn neg(self) -> Self {
133 impl<T> From<(T, T)> for Point<T> {
134 fn from(item: (T, T)) -> Self {
142 impl<T> From<Point<T>> for (T, T) {
143 fn from(item: Point<T>) -> Self {
148 impl From<Degrees> for Point<f64> {
149 fn from(item: Degrees) -> Self {
150 let r = item.0.to_radians();
158 impl From<Radians> for Point<f64> {
159 fn from(item: Radians) -> Self {
167 #[derive(Debug, Default, PartialEq, Clone, Copy)]
168 pub struct Degrees(pub f64);
169 #[derive(Debug, Default, PartialEq, Clone, Copy)]
170 pub struct Radians(pub f64);
174 fn to_radians(&self) -> Radians {
175 Radians(self.0.to_radians())
181 fn to_degrees(&self) -> Degrees {
182 Degrees(self.0.to_degrees())
186 ////////// INTERSECTION ////////////////////////////////////////////////////////
189 pub enum Intersection {
191 //Line(Point<f64>, Point<f64>), // TODO: overlapping collinear
196 pub fn lines(p1: Point<f64>, p2: Point<f64>, p3: Point<f64>, p4: Point<f64>) -> Intersection {
200 let denomimator = -s2.x * s1.y + s1.x * s2.y;
201 if denomimator != 0.0 {
202 let s = (-s1.y * (p1.x - p3.x) + s1.x * (p1.y - p3.y)) / denomimator;
203 let t = ( s2.x * (p1.y - p3.y) - s2.y * (p1.x - p3.x)) / denomimator;
205 if s >= 0.0 && s <= 1.0 && t >= 0.0 && t <= 1.0 {
206 return Intersection::Point(p1 + (s1 * t))
214 ////////// DIMENSION ///////////////////////////////////////////////////////////
218 ( $w:expr, $h:expr ) => {
219 Dimension { width: $w, height: $h }
223 #[derive(Debug, Default, Copy, Clone, PartialEq)]
224 pub struct Dimension<T> {
229 impl<T: Mul<Output = T> + Copy> Dimension<T> {
231 pub fn area(&self) -> T {
232 self.width * self.height
236 impl<T> From<(T, T)> for Dimension<T> {
237 fn from(item: (T, T)) -> Self {
245 impl<T> From<Dimension<T>> for (T, T) {
246 fn from(item: Dimension<T>) -> Self {
247 (item.width, item.height)
251 ////////////////////////////////////////////////////////////////////////////////
254 pub fn supercover_line_int(p1: Point<isize>, p2: Point<isize>) -> Vec<Point<isize>> {
256 let n = point!(d.x.abs(), d.y.abs());
258 if d.x > 0 { 1 } else { -1 },
259 if d.y > 0 { 1 } else { -1 }
262 let mut p = p1.clone();
263 let mut points = vec!(point!(p.x as isize, p.y as isize));
264 let mut i = point!(0, 0);
265 while i.x < n.x || i.y < n.y {
266 let decision = (1 + 2 * i.x) * n.y - (1 + 2 * i.y) * n.x;
267 if decision == 0 { // next step is diagonal
272 } else if decision < 0 { // next step is horizontal
275 } else { // next step is vertical
279 points.push(point!(p.x as isize, p.y as isize));
285 /// Calculates all points a line crosses, unlike Bresenham's line algorithm.
286 /// There might be room for a lot of improvement here.
287 pub fn supercover_line(mut p1: Point<f64>, mut p2: Point<f64>) -> Vec<Point<isize>> {
288 let mut delta = p2 - p1;
289 if (delta.x.abs() > delta.y.abs() && delta.x.is_sign_negative()) || (delta.x.abs() <= delta.y.abs() && delta.y.is_sign_negative()) {
290 std::mem::swap(&mut p1, &mut p2);
294 let mut last = point!(p1.x as isize, p1.y as isize);
295 let mut coords: Vec<Point<isize>> = vec!();
298 if delta.x.abs() > delta.y.abs() {
299 let k = delta.y / delta.x;
300 let m = p1.y as f64 - p1.x as f64 * k;
301 for x in (p1.x as isize + 1)..=(p2.x as isize) {
302 let y = (k * x as f64 + m).floor();
303 let next = point!(x as isize - 1, y as isize);
307 let next = point!(x as isize, y as isize);
312 let k = delta.x / delta.y;
313 let m = p1.x as f64 - p1.y as f64 * k;
314 for y in (p1.y as isize + 1)..=(p2.y as isize) {
315 let x = (k * y as f64 + m).floor();
316 let next = point!(x as isize, y as isize - 1);
320 let next = point!(x as isize, y as isize);
326 let next = point!(p2.x as isize, p2.y as isize);
334 ////////// TESTS ///////////////////////////////////////////////////////////////
341 fn immutable_copy_of_point() {
342 let a = point!(0, 0);
343 let mut b = a; // Copy
344 assert_eq!(a, b); // PartialEq
346 assert_ne!(a, b); // PartialEq
351 let mut a = point!(1, 0);
352 assert_eq!(a + point!(2, 2), point!(3, 2)); // Add
353 a += point!(2, 2); // AddAssign
354 assert_eq!(a, point!(3, 2));
355 assert_eq!(point!(1, 0) + (2, 3), point!(3, 3));
360 let mut a = point!(1, 0);
361 assert_eq!(a - point!(2, 2), point!(-1, -2));
363 assert_eq!(a, point!(-1, -2));
364 assert_eq!(point!(1, 0) - (2, 3), point!(-1, -3));
369 let mut a = point!(1, 2);
370 assert_eq!(a * 2, point!(2, 4));
371 assert_eq!(a * point!(2, 3), point!(2, 6));
373 assert_eq!(a, point!(2, 4));
375 assert_eq!(a, point!(6, 4));
376 assert_eq!(point!(1, 0) * (2, 3), point!(2, 0));
381 let mut a = point!(4, 8);
382 assert_eq!(a / 2, point!(2, 4));
383 assert_eq!(a / point!(2, 4), point!(2, 2));
385 assert_eq!(a, point!(2, 4));
387 assert_eq!(a, point!(1, 1));
388 assert_eq!(point!(6, 3) / (2, 3), point!(3, 1));
393 assert_eq!(point!(1, 1), -point!(-1, -1));
398 assert_eq!(Radians(0.0).to_degrees(), Degrees(0.0));
399 assert_eq!(Radians(std::f64::consts::PI).to_degrees(), Degrees(180.0));
400 assert_eq!(Degrees(180.0).to_radians(), Radians(std::f64::consts::PI));
401 assert!((Point::from(Degrees(90.0)) - point!(0.0, 1.0)).length() < 0.001);
402 assert!((Point::from(Radians(std::f64::consts::FRAC_PI_2)) - point!(0.0, 1.0)).length() < 0.001);
406 fn area_for_dimension_of_multipliable_type() {
407 let r: Dimension<_> = (30, 20).into(); // the Into trait uses the From trait
408 assert_eq!(r.area(), 30 * 20);
409 // let a = Dimension::from(("a".to_string(), "b".to_string())).area(); // this doesn't work, because area() is not implemented for String
413 fn intersection_of_lines() {
414 let p1 = point!(0.0, 0.0);
415 let p2 = point!(2.0, 2.0);
416 let p3 = point!(0.0, 2.0);
417 let p4 = point!(2.0, 0.0);
418 let r = Intersection::lines(p1, p2, p3, p4);
419 if let Intersection::Point(p) = r {
420 assert_eq!(p, point!(1.0, 1.0));
427 fn some_coordinates_on_line() {
429 let coords = supercover_line(point!(0.0, 0.0), point!(3.3, 2.2));
430 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(1, 1), point!(2, 1), point!(2, 2), point!(3, 2)]);
433 let coords = supercover_line(point!(0.0, 5.0), point!(3.3, 2.2));
434 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)]);
437 let coords = supercover_line(point!(0.0, 0.0), point!(2.2, 3.3));
438 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(0, 1), point!(1, 1), point!(1, 2), point!(2, 2), point!(2, 3)]);
441 let coords = supercover_line(point!(5.0, 0.0), point!(3.0, 3.0));
442 assert_eq!(coords.as_slice(), &[point!(5, 0), point!(4, 0), point!(4, 1), point!(3, 1), point!(3, 2), point!(3, 3)]);
445 let coords = supercover_line(point!(0.0, 0.0), point!(-3.0, -2.0));
446 assert_eq!(coords.as_slice(), &[point!(-3, -2), point!(-2, -2), point!(-2, -1), point!(-1, -1), point!(-1, 0), point!(0, 0)]);
449 let coords = supercover_line(point!(0.0, 0.0), point!(2.3, 1.1));
450 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(2, 0), point!(2, 1)]);