#[derive(Clone, Copy, Debug, Default, PartialEq)]
pub struct Point {
pub x: f32,
pub y: f32,
}
#[derive(Clone, Copy, Debug, Default, PartialEq)]
pub struct Size {
pub width: f32,
pub height: f32,
}
impl Size {
pub const fn new(width: f32, height: f32) -> Self {
Self { width, height }
}
}
#[derive(Clone, Copy, Debug, Default, PartialEq)]
pub struct Rect {
pub x: f32,
pub y: f32,
pub width: f32,
pub height: f32,
}
impl Rect {
pub const fn new(x: f32, y: f32, width: f32, height: f32) -> Self {
Self {
x,
y,
width,
height,
}
}
pub fn contains(self, point: Point) -> bool {
self.width > 0.0
&& self.height > 0.0
&& point.x >= self.x
&& point.y >= self.y
&& point.x < self.x + self.width
&& point.y < self.y + self.height
}
pub fn intersect(self, other: Self) -> Self {
let x = self.x.max(other.x);
let y = self.y.max(other.y);
Self::new(
x,
y,
(self.x + self.width).min(other.x + other.width).max(x) - x,
(self.y + self.height).min(other.y + other.height).max(y) - y,
)
}
pub fn inset(self, amount: f32) -> Self {
let x = amount.min(self.width * 0.5);
let y = amount.min(self.height * 0.5);
Self::new(
self.x + x,
self.y + y,
(self.width - 2.0 * x).max(0.0),
(self.height - 2.0 * y).max(0.0),
)
}
pub fn scaled(self, scale: f32) -> Self {
Self::new(
self.x * scale,
self.y * scale,
self.width * scale,
self.height * scale,
)
}
}