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);
79 point_op!(*, Mul(mul), MulAssign(mul_assign), rhs = Dimension<T> => rhs.width, rhs.height);
80 point_op!(/, Div(div), DivAssign(div_assign), rhs = Dimension<T> => rhs.width, rhs.height);
82 ////////// multiply point with scalar //////////////////////////////////////////
83 impl<T: Mul<Output = T> + Copy> Mul<T> for Point<T> {
86 fn mul(self, rhs: T) -> Self {
94 impl<T: Mul<Output = T> + Copy> MulAssign<T> for Point<T> {
95 fn mul_assign(&mut self, rhs: T) {
103 ////////// divide point with scalar ////////////////////////////////////////////
104 impl<T: Div<Output = T> + Copy> Div<T> for Point<T> {
107 fn div(self, rhs: T) -> Self {
115 impl<T: Div<Output = T> + Copy> DivAssign<T> for Point<T> {
116 fn div_assign(&mut self, rhs: T) {
124 impl<T: Neg<Output = T>> Neg for Point<T> {
127 fn neg(self) -> Self {
135 impl<T> From<(T, T)> for Point<T> {
136 fn from(item: (T, T)) -> Self {
144 impl<T> From<Point<T>> for (T, T) {
145 fn from(item: Point<T>) -> Self {
150 impl From<Degrees> for Point<f64> {
151 fn from(item: Degrees) -> Self {
152 let r = item.0.to_radians();
160 impl From<Radians> for Point<f64> {
161 fn from(item: Radians) -> Self {
169 #[derive(Debug, Default, PartialEq, Clone, Copy)]
170 pub struct Degrees(pub f64);
171 #[derive(Debug, Default, PartialEq, Clone, Copy)]
172 pub struct Radians(pub f64);
176 fn to_radians(&self) -> Radians {
177 Radians(self.0.to_radians())
183 fn to_degrees(&self) -> Degrees {
184 Degrees(self.0.to_degrees())
188 ////////// INTERSECTION ////////////////////////////////////////////////////////
191 pub enum Intersection {
193 //Line(Point<f64>, Point<f64>), // TODO: overlapping collinear
198 pub fn lines(p1: Point<f64>, p2: Point<f64>, p3: Point<f64>, p4: Point<f64>) -> Intersection {
202 let denomimator = -s2.x * s1.y + s1.x * s2.y;
203 if denomimator != 0.0 {
204 let s = (-s1.y * (p1.x - p3.x) + s1.x * (p1.y - p3.y)) / denomimator;
205 let t = ( s2.x * (p1.y - p3.y) - s2.y * (p1.x - p3.x)) / denomimator;
207 if s >= 0.0 && s <= 1.0 && t >= 0.0 && t <= 1.0 {
208 return Intersection::Point(p1 + (s1 * t))
216 ////////// DIMENSION ///////////////////////////////////////////////////////////
220 ( $w:expr, $h:expr ) => {
221 Dimension { width: $w, height: $h }
225 #[derive(Debug, Default, Copy, Clone, PartialEq)]
226 pub struct Dimension<T> {
231 impl<T: Mul<Output = T> + Copy> Dimension<T> {
233 pub fn area(&self) -> T {
234 self.width * self.height
238 impl<T> From<(T, T)> for Dimension<T> {
239 fn from(item: (T, T)) -> Self {
247 impl<T> From<Dimension<T>> for (T, T) {
248 fn from(item: Dimension<T>) -> Self {
249 (item.width, item.height)
253 ////////////////////////////////////////////////////////////////////////////////
256 pub fn supercover_line_int(p1: Point<isize>, p2: Point<isize>) -> Vec<Point<isize>> {
258 let n = point!(d.x.abs(), d.y.abs());
260 if d.x > 0 { 1 } else { -1 },
261 if d.y > 0 { 1 } else { -1 }
264 let mut p = p1.clone();
265 let mut points = vec!(point!(p.x as isize, p.y as isize));
266 let mut i = point!(0, 0);
267 while i.x < n.x || i.y < n.y {
268 let decision = (1 + 2 * i.x) * n.y - (1 + 2 * i.y) * n.x;
269 if decision == 0 { // next step is diagonal
274 } else if decision < 0 { // next step is horizontal
277 } else { // next step is vertical
281 points.push(point!(p.x as isize, p.y as isize));
287 /// Calculates all points a line crosses, unlike Bresenham's line algorithm.
288 /// There might be room for a lot of improvement here.
289 pub fn supercover_line(mut p1: Point<f64>, mut p2: Point<f64>) -> Vec<Point<isize>> {
290 let mut delta = p2 - p1;
291 if (delta.x.abs() > delta.y.abs() && delta.x.is_sign_negative()) || (delta.x.abs() <= delta.y.abs() && delta.y.is_sign_negative()) {
292 std::mem::swap(&mut p1, &mut p2);
296 let mut last = point!(p1.x as isize, p1.y as isize);
297 let mut coords: Vec<Point<isize>> = vec!();
300 if delta.x.abs() > delta.y.abs() {
301 let k = delta.y / delta.x;
302 let m = p1.y as f64 - p1.x as f64 * k;
303 for x in (p1.x as isize + 1)..=(p2.x as isize) {
304 let y = (k * x as f64 + m).floor();
305 let next = point!(x as isize - 1, y as isize);
309 let next = point!(x as isize, y as isize);
314 let k = delta.x / delta.y;
315 let m = p1.x as f64 - p1.y as f64 * k;
316 for y in (p1.y as isize + 1)..=(p2.y as isize) {
317 let x = (k * y as f64 + m).floor();
318 let next = point!(x as isize, y as isize - 1);
322 let next = point!(x as isize, y as isize);
328 let next = point!(p2.x as isize, p2.y as isize);
336 ////////// TESTS ///////////////////////////////////////////////////////////////
343 fn immutable_copy_of_point() {
344 let a = point!(0, 0);
345 let mut b = a; // Copy
346 assert_eq!(a, b); // PartialEq
348 assert_ne!(a, b); // PartialEq
353 let mut a = point!(1, 0);
354 assert_eq!(a + point!(2, 2), point!(3, 2)); // Add
355 a += point!(2, 2); // AddAssign
356 assert_eq!(a, point!(3, 2));
357 assert_eq!(point!(1, 0) + (2, 3), point!(3, 3));
362 let mut a = point!(1, 0);
363 assert_eq!(a - point!(2, 2), point!(-1, -2));
365 assert_eq!(a, point!(-1, -2));
366 assert_eq!(point!(1, 0) - (2, 3), point!(-1, -3));
371 let mut a = point!(1, 2);
372 assert_eq!(a * 2, point!(2, 4));
373 assert_eq!(a * point!(2, 3), point!(2, 6));
375 assert_eq!(a, point!(2, 4));
377 assert_eq!(a, point!(6, 4));
378 assert_eq!(point!(1, 0) * (2, 3), point!(2, 0));
383 let mut a = point!(4, 8);
384 assert_eq!(a / 2, point!(2, 4));
385 assert_eq!(a / point!(2, 4), point!(2, 2));
387 assert_eq!(a, point!(2, 4));
389 assert_eq!(a, point!(1, 1));
390 assert_eq!(point!(6, 3) / (2, 3), point!(3, 1));
395 assert_eq!(point!(1, 1), -point!(-1, -1));
400 assert_eq!(Radians(0.0).to_degrees(), Degrees(0.0));
401 assert_eq!(Radians(std::f64::consts::PI).to_degrees(), Degrees(180.0));
402 assert_eq!(Degrees(180.0).to_radians(), Radians(std::f64::consts::PI));
403 assert!((Point::from(Degrees(90.0)) - point!(0.0, 1.0)).length() < 0.001);
404 assert!((Point::from(Radians(std::f64::consts::FRAC_PI_2)) - point!(0.0, 1.0)).length() < 0.001);
408 fn area_for_dimension_of_multipliable_type() {
409 let r: Dimension<_> = (30, 20).into(); // the Into trait uses the From trait
410 assert_eq!(r.area(), 30 * 20);
411 // let a = Dimension::from(("a".to_string(), "b".to_string())).area(); // this doesn't work, because area() is not implemented for String
415 fn intersection_of_lines() {
416 let p1 = point!(0.0, 0.0);
417 let p2 = point!(2.0, 2.0);
418 let p3 = point!(0.0, 2.0);
419 let p4 = point!(2.0, 0.0);
420 let r = Intersection::lines(p1, p2, p3, p4);
421 if let Intersection::Point(p) = r {
422 assert_eq!(p, point!(1.0, 1.0));
429 fn some_coordinates_on_line() {
431 let coords = supercover_line(point!(0.0, 0.0), point!(3.3, 2.2));
432 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(1, 1), point!(2, 1), point!(2, 2), point!(3, 2)]);
435 let coords = supercover_line(point!(0.0, 5.0), point!(3.3, 2.2));
436 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)]);
439 let coords = supercover_line(point!(0.0, 0.0), point!(2.2, 3.3));
440 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(0, 1), point!(1, 1), point!(1, 2), point!(2, 2), point!(2, 3)]);
443 let coords = supercover_line(point!(5.0, 0.0), point!(3.0, 3.0));
444 assert_eq!(coords.as_slice(), &[point!(5, 0), point!(4, 0), point!(4, 1), point!(3, 1), point!(3, 2), point!(3, 3)]);
447 let coords = supercover_line(point!(0.0, 0.0), point!(-3.0, -2.0));
448 assert_eq!(coords.as_slice(), &[point!(-3, -2), point!(-2, -2), point!(-2, -1), point!(-1, -1), point!(-1, 0), point!(0, 0)]);
451 let coords = supercover_line(point!(0.0, 0.0), point!(2.3, 1.1));
452 assert_eq!(coords.as_slice(), &[point!(0, 0), point!(1, 0), point!(2, 0), point!(2, 1)]);