Struct fyrox_core::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,
source§impl<T: Debug> Reflect for Rect<T>where
Self: 'static,
impl<T: Debug> Reflect for Rect<T>where
Self: 'static,
fn source_path() -> &'static str
fn type_name(&self) -> &'static str
fn doc(&self) -> &'static str
source§fn assembly_name(&self) -> &'static str
fn assembly_name(&self) -> &'static str
#[derive(Reflect)]) to ensure that this method will return correct assembly
name. In other words - there’s no guarantee, that any implementation other than proc-macro
will return a correct name of the assembly. Alternatively, you can use env!("CARGO_PKG_NAME")
as an implementation.source§fn type_assembly_name() -> &'static str
fn type_assembly_name() -> &'static str
#[derive(Reflect)]) to ensure that this method will return correct assembly
name. In other words - there’s no guarantee, that any implementation other than proc-macro
will return a correct name of the assembly. Alternatively, you can use env!("CARGO_PKG_NAME")
as an implementation.fn fields_info(&self, func: &mut dyn FnMut(&[FieldInfo<'_, '_>]))
fn into_any(self: Box<Self>) -> Box<dyn Any>
fn set( &mut self, value: Box<dyn Reflect> ) -> Result<Box<dyn Reflect>, Box<dyn Reflect>>
fn as_any(&self, func: &mut dyn FnMut(&dyn Any))
fn as_any_mut(&mut self, func: &mut dyn FnMut(&mut dyn Any))
fn as_reflect(&self, func: &mut dyn FnMut(&dyn Reflect))
fn as_reflect_mut(&mut self, func: &mut dyn FnMut(&mut dyn Reflect))
fn fields(&self, func: &mut dyn FnMut(&[&dyn Reflect]))
fn fields_mut(&mut self, func: &mut dyn FnMut(&mut [&mut dyn Reflect]))
fn field(&self, name: &str, func: &mut dyn FnMut(Option<&dyn Reflect>))
fn field_mut( &mut self, name: &str, func: &mut dyn FnMut(Option<&mut dyn Reflect>) )
source§fn set_field(
&mut self,
field: &str,
value: Box<dyn Reflect>,
func: &mut dyn FnMut(Result<Box<dyn Reflect>, Box<dyn Reflect>>)
)
fn set_field( &mut self, field: &str, value: Box<dyn Reflect>, func: &mut dyn FnMut(Result<Box<dyn Reflect>, Box<dyn Reflect>>) )
#[reflect(setter = ..)] or falls back to
Reflect::field_mutfn as_array(&self, func: &mut dyn FnMut(Option<&dyn ReflectArray>))
fn as_array_mut(&mut self, func: &mut dyn FnMut(Option<&mut dyn ReflectArray>))
fn as_list(&self, func: &mut dyn FnMut(Option<&dyn ReflectList>))
fn as_list_mut(&mut self, func: &mut dyn FnMut(Option<&mut dyn ReflectList>))
fn as_inheritable_variable( &self, func: &mut dyn FnMut(Option<&dyn ReflectInheritableVariable>) )
fn as_inheritable_variable_mut( &mut self, func: &mut dyn FnMut(Option<&mut dyn ReflectInheritableVariable>) )
fn as_hash_map(&self, func: &mut dyn FnMut(Option<&dyn ReflectHashMap>))
fn as_hash_map_mut( &mut self, func: &mut dyn FnMut(Option<&mut dyn ReflectHashMap>) )
source§impl<T> Visit for Rect<T>
impl<T> Visit for Rect<T>
source§fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult
fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult
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> Freeze for Rect<T>where
T: Freeze,
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> AsyncTaskResult for T
impl<T> AsyncTaskResult for T
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<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
source§impl<T> ReflectBase for Twhere
T: Reflect,
impl<T> ReflectBase for Twhere
T: Reflect,
fn as_any_raw(&self) -> &(dyn Any + 'static)
fn as_any_raw_mut(&mut self) -> &mut (dyn Any + 'static)
source§impl<T> ResolvePath for Twhere
T: Reflect,
impl<T> ResolvePath for Twhere
T: Reflect,
fn resolve_path<'p>( &self, path: &'p str, func: &mut dyn FnMut(Result<&(dyn Reflect + 'static), ReflectPathError<'p>>) )
fn resolve_path_mut<'p>( &mut self, path: &'p str, func: &mut dyn FnMut(Result<&mut (dyn Reflect + 'static), ReflectPathError<'p>>) )
fn get_resolve_path<'p, T: Reflect>( &self, path: &'p str, func: &mut dyn FnMut(Result<&T, ReflectPathError<'p>>) )
fn get_resolve_path_mut<'p, T: Reflect>( &mut self, path: &'p str, func: &mut dyn FnMut(Result<&mut T, ReflectPathError<'p>>) )
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.