Struct fyrox_math::Rect
source · pub struct Rect<T> {
pub position: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
pub size: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
}
Expand description
A rectangle defined by position and size.
Fields§
§position: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Position of the rectangle.
size: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Size of the rectangle, where X - width, Y - height.
Implementations§
source§impl<T> Rect<T>where
T: Number,
impl<T> Rect<T>where
T: Number,
sourcepub fn new(x: T, y: T, w: T, h: T) -> Rect<T>
pub fn new(x: T, y: T, w: T, h: T) -> Rect<T>
Creates a new rectangle from X, Y, width, height.
sourcepub fn with_position(
self,
position: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
) -> Rect<T>
pub fn with_position( self, position: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>> ) -> Rect<T>
Sets the new position of the rectangle.
sourcepub fn with_size(
self,
size: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
) -> Rect<T>
pub fn with_size( self, size: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>> ) -> Rect<T>
Sets the new size of the rectangle.
sourcepub fn inflate(&self, dw: T, dh: T) -> Rect<T>
pub fn inflate(&self, dw: T, dh: T) -> Rect<T>
Inflates the rectangle by the given amounts. It offsets the rectangle by (-dw, -dh)
and
increases its size by (2 * dw, 2 * dh)
.
sourcepub fn deflate(&self, dw: T, dh: T) -> Rect<T>
pub fn deflate(&self, dw: T, dh: T) -> Rect<T>
Deflates the rectangle by the given amounts. It offsets the rectangle by (dw, dh)
and
decreases its size by (2 * dw, 2 * dh)
.
sourcepub fn contains(
&self,
pt: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
) -> bool
pub fn contains( &self, pt: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>> ) -> bool
Checks if the given point lies within the bounds of the rectangle.
sourcepub fn center(&self) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
pub fn center(&self) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Returns center point of the rectangle.
sourcepub fn push(&mut self, p: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>)
pub fn push(&mut self, p: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>)
Extends the rectangle to contain the given point.
§Notes
To build bounding rectangle you should correctly initialize initial rectangle:
let vertices = [Vector2::new(1.0, 2.0), Vector2::new(-3.0, 5.0)];
// This is important part, it must have "invalid" state to correctly
// calculate bounding rect. Rect::default will give invalid result!
let mut bounding_rect = Rect::new(f32::MAX, f32::MAX, 0.0, 0.0);
for &v in &vertices {
bounding_rect.push(v);
}
sourcepub fn clip_by(&self, other: Rect<T>) -> Rect<T>
pub fn clip_by(&self, other: Rect<T>) -> Rect<T>
Clips the rectangle by some other rectangle and returns a new rectangle that corresponds to the intersection of both rectangles. If the rectangles does not intersects, the method returns this rectangle.
sourcepub fn intersects(&self, other: Rect<T>) -> bool
pub fn intersects(&self, other: Rect<T>) -> bool
Checks if the rectangle intersects with some other rectangle.
sourcepub fn translate(
&self,
translation: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
) -> Rect<T>
pub fn translate( &self, translation: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>> ) -> Rect<T>
Offsets the given rectangle and returns a new rectangle.
sourcepub fn intersects_circle(
&self,
center: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
radius: T
) -> bool
pub fn intersects_circle( &self, center: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>, radius: T ) -> bool
Checks if the rectangle intersects a circle represented by a center point and a radius.
sourcepub fn extend_to_contain(&mut self, other: Rect<T>)
pub fn extend_to_contain(&mut self, other: Rect<T>)
Extends the rectangle so it will contain the other rectangle.
sourcepub fn left_top_corner(
&self
) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
pub fn left_top_corner( &self ) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Returns the top left corner of the rectangle.
sourcepub fn right_top_corner(
&self
) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
pub fn right_top_corner( &self ) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Returns the top right corner of the rectangle.
sourcepub fn right_bottom_corner(
&self
) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
pub fn right_bottom_corner( &self ) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Returns the bottom right corner of the rectangle.
sourcepub fn left_bottom_corner(
&self
) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
pub fn left_bottom_corner( &self ) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>
Returns the bottom left corner of the rectangle.
Trait Implementations§
source§impl<T> PartialEq for Rect<T>where
T: PartialEq,
impl<T> PartialEq for Rect<T>where
T: PartialEq,
impl<T> Copy for Rect<T>where
T: Copy,
impl<T> Eq for Rect<T>where
T: Eq,
impl<T> StructuralPartialEq for Rect<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for Rect<T>where
T: RefUnwindSafe,
impl<T> Send for Rect<T>where
T: Send,
impl<T> Sync for Rect<T>where
T: Sync,
impl<T> Unpin for Rect<T>where
T: Unpin,
impl<T> UnwindSafe for Rect<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.