1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99

use crate::serde_derive::{Deserialize, Serialize};

#[cfg(test)]
mod tests {
    use crate::geometry::{BoundingBox, Point, Polygon};

    #[test]
    fn point_tests() {
        let p = Point(0, 0);
        let p2 = Point(2, 0);

        assert!(p.left_of(p2));
        assert!(!p.right_of(p2));
        assert!(!p2.left_of(p));
        assert!(p2.right_of(p));

        let p3 = Point(0, 2);

        assert!(p3.above(p));
        assert!(p.below(p3));
    }
}

#[derive(Debug, Copy, Clone, Deserialize, Serialize)]
pub struct Point(u32, u32);

impl Point {
    pub const fn new(x: u32, y: u32) -> Point {
        Point(x, y)
    }

    pub fn x(&self) -> &u32 {
        &self.0
    }

    pub fn y(&self) -> &u32 {
        &self.1
    }

    pub fn inside(self, poly: impl Polygon<u32>) -> bool {
        poly.contains(self)
    }

    pub fn above(self, point: Point) -> bool {
        self.y() > point.y()
    }

    pub fn below(self, point: Point) -> bool {
        self.y() < point.y()
    }

    pub fn right_of(self, point: Point) -> bool {
        self.x() > point.x()
    }

    pub fn left_of(self, point: Point) -> bool {
        self.x() < point.x()
    }
}

#[derive(Debug, Copy, Clone, Deserialize, Serialize)]
pub struct BoundingBox(Point, Point);

pub trait Polygon<T> {
    fn area(&self) -> T;
    fn contains(&self, point: Point) -> bool;
}

pub trait Location {
    fn get_center_point(&self) -> Point;
}

impl BoundingBox {
    pub const fn new(ll: Point, ur: Point) -> BoundingBox {
        BoundingBox(ll, ur)
    }

    pub fn lower_left(&self) -> Point {
        self.0
    }

    pub fn upper_right(&self) -> Point {
        self.1
    }
}

impl Polygon<u32> for BoundingBox {
    fn area(&self) -> u32 {
        (self.upper_right().x() - self.lower_left().x())
            * (self.upper_right().y() - self.lower_left().y())
    }

    fn contains(&self, point: Point) -> bool {
        point.above(self.lower_left())
            && point.right_of(self.lower_left())
            && point.below(self.upper_right())
            && point.left_of(self.upper_right())
    }
}