use glam::*;
#[derive(Clone, Copy, Debug, Default, PartialEq)]
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 size(&self) -> Vec2 {
vec2(self.w, self.h)
}
pub fn center(&self) -> Vec2 {
vec2(self.x + self.w * 0.5f32, self.y + self.h * 0.5f32)
}
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 combine_with(self, other: Rect) -> Rect {
let x = f32::min(self.x, other.x);
let y = f32::min(self.y, other.y);
let w = f32::max(self.right(), other.right()) - x;
let h = f32::max(self.bottom(), other.bottom()) - y;
Rect { x, y, w, h }
}
pub fn intersect(&self, other: Rect) -> Option<Rect> {
let left = self.x.max(other.x);
let top = self.y.max(other.y);
let right = self.right().min(other.right());
let bottom = self.bottom().min(other.bottom());
if right < left || bottom < top {
return None;
}
Some(Rect {
x: left,
y: top,
w: right - left,
h: bottom - top,
})
}
pub fn offset(self, offset: Vec2) -> Rect {
Rect::new(self.x + offset.x, self.y + offset.y, self.w, self.h)
}
}
#[derive(Clone, Copy, Debug, Default, PartialEq)]
pub struct RectOffset {
pub left: f32,
pub right: f32,
pub bottom: f32,
pub top: f32,
}
impl RectOffset {
pub fn new(left: f32, right: f32, top: f32, bottom: f32) -> RectOffset {
RectOffset {
left,
right,
top,
bottom,
}
}
}