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

use nalgebra as na;

use super::Rect;

impl<T: na::RealField> Rect<T> {
    /// Check if a point is contained within this rectangle.
    ///
    /// # Returns
    ///
    /// - `true` when the point is contained within the rectangle. Comparison
    ///   is inclusive, so the edges of the rectangle are considered 'inside'.
    pub fn contains(&self, vec: &na::Vector2<T>) -> bool {
        if vec.x >= self.left
            && vec.x <= self.right
            && vec.y >= self.bottom
            && vec.y <= self.top
        {
            true
        } else {
            false
        }
    }

    pub fn width(&self) -> T {
        (self.right - self.left).abs()
    }

    pub fn height(&self) -> T {
        (self.top - self.bottom).abs()
    }
}

#[cfg(test)]
mod test {
    use super::super::*;

    use nalgebra as na;

    #[test]
    fn not_inside() {
        let rect = Rect {
            left: -1.0,
            right: 1.0,
            bottom: -1.0,
            top: 1.0,
        };
        let point = na::Point2::new(-2.0, 2.0);
        assert!(
            rect.contains(&point.coords) == false,
            "the rectangle {:#?} should not contain the point {}",
            rect,
            point
        );
    }

    #[test]
    fn inside() {
        let rect = Rect {
            left: -1.0,
            right: 1.0,
            bottom: -1.0,
            top: 1.0,
        };
        let point = na::Point2::new(0.5, -0.5);
        assert!(
            rect.contains(&point.coords) == true,
            "the rectangle {:#?} should contain the point {}",
            rect,
            point
        );
    }
}