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
pub use glam::*;
#[derive(Clone, Copy, Debug, Default)]
pub struct Rect {
pub x: f32,
pub y: f32,
pub w: f32,
pub h: f32,
}
impl Rect {
pub fn new(x: f32, y: f32, w: f32, h: f32) -> Rect {
Rect { x, y, w, h }
}
pub fn point(&self) -> Vec2 {
vec2(self.x, self.y)
}
pub fn left(&self) -> f32 {
self.x
}
pub fn right(&self) -> f32 {
self.x + self.w
}
pub fn top(&self) -> f32 {
self.y
}
pub fn bottom(&self) -> f32 {
self.y + self.h
}
pub fn move_to(&mut self, destination: Vec2) {
self.x = destination.x;
self.y = destination.y;
}
pub fn scale(&mut self, sx: f32, sy: f32) {
self.w *= sx;
self.h *= sy;
}
pub fn contains(&self, point: Vec2) -> bool {
point.x >= self.left()
&& point.x < self.right()
&& point.y < self.bottom()
&& point.y >= self.top()
}
pub fn overlaps(&self, other: &Rect) -> bool {
self.left() <= other.right()
&& self.right() >= other.left()
&& self.top() <= other.bottom()
&& self.bottom() >= other.top()
}
}
pub fn polar_to_cartesian(rho: f32, theta: f32) -> Vec2 {
vec2(rho * theta.cos(), rho * theta.sin())
}
pub fn cartesian_to_polar(cartesian: Vec2) -> Vec2 {
vec2(
(cartesian.x.powi(2) + cartesian.y.powi(2)).sqrt(),
cartesian.y.atan2(cartesian.x),
)
}