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 from_points(
p0: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
p1: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
) -> Rect<T>where
T: SimdPartialOrd,
pub fn from_points(
p0: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
p1: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>,
) -> Rect<T>where
T: SimdPartialOrd,
Create a new rectangle from two diagonally opposite corner points. In other words, create the smallest rectangle containing both given points.
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>>)where
T: SimdPartialOrd,
pub fn push(&mut self, p: Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>)where
T: SimdPartialOrd,
Extends the rectangle to contain the given point.
§Notes
To build bounding rectangle you should use OptionRect.
Sourcepub fn clip_by(&self, other: Rect<T>) -> OptionRect<T>
pub fn clip_by(&self, other: Rect<T>) -> OptionRect<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 none.
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>)where
T: SimdPartialOrd,
pub fn extend_to_contain(&mut self, other: Rect<T>)where
T: SimdPartialOrd,
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> From<Rect<T>> for OptionRect<T>
impl<T> From<Rect<T>> for OptionRect<T>
Source§fn from(source: Rect<T>) -> OptionRect<T>
fn from(source: Rect<T>) -> OptionRect<T>
Source§impl<V: Number + SimdPartialOrd + Add + AddAssign + Neg<Output = V> + Scalar> OrthoTransform for Rect<V>
impl<V: Number + SimdPartialOrd + Add + AddAssign + Neg<Output = V> + Scalar> OrthoTransform for Rect<V>
Source§fn transformed(self, amount: OrthoTransformation) -> Self
fn transformed(self, amount: OrthoTransformation) -> Self
Source§impl<T> Reflect for Rect<T>
impl<T> Reflect for Rect<T>
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<Rect<T>>) -> 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 + 'static)))
fn as_any_mut(&mut self, func: &mut dyn FnMut(&mut (dyn Any + 'static)))
fn as_reflect(&self, func: &mut dyn FnMut(&(dyn Reflect + 'static)))
fn as_reflect_mut(&mut self, func: &mut dyn FnMut(&mut (dyn Reflect + 'static)))
fn fields(&self, func: &mut dyn FnMut(&[&(dyn Reflect + 'static)]))
fn fields_mut( &mut self, func: &mut dyn FnMut(&mut [&mut (dyn Reflect + 'static)]), )
fn field( &self, name: &str, func: &mut dyn FnMut(Option<&(dyn Reflect + 'static)>), )
fn field_mut( &mut self, name: &str, func: &mut dyn FnMut(Option<&mut (dyn Reflect + 'static)>), )
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_mut
fn as_array(&self, func: &mut dyn FnMut(Option<&(dyn ReflectArray + 'static)>))
fn as_array_mut( &mut self, func: &mut dyn FnMut(Option<&mut (dyn ReflectArray + 'static)>), )
fn as_list(&self, func: &mut dyn FnMut(Option<&(dyn ReflectList + 'static)>))
fn as_list_mut( &mut self, func: &mut dyn FnMut(Option<&mut (dyn ReflectList + 'static)>), )
fn as_inheritable_variable( &self, func: &mut dyn FnMut(Option<&(dyn ReflectInheritableVariable + 'static)>), )
fn as_inheritable_variable_mut( &mut self, func: &mut dyn FnMut(Option<&mut (dyn ReflectInheritableVariable + 'static)>), )
fn as_hash_map( &self, func: &mut dyn FnMut(Option<&(dyn ReflectHashMap + 'static)>), )
fn as_hash_map_mut( &mut self, func: &mut dyn FnMut(Option<&mut (dyn ReflectHashMap + 'static)>), )
Source§impl<T> TypeUuidProvider for Rect<T>where
T: TypeUuidProvider,
impl<T> TypeUuidProvider for Rect<T>where
T: TypeUuidProvider,
Source§impl<T> Visit for Rect<T>
impl<T> Visit for Rect<T>
Source§fn visit(&mut self, name: &str, visitor: &mut Visitor) -> Result<(), VisitError>
fn visit(&mut self, name: &str, visitor: &mut Visitor) -> Result<(), VisitError>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Any
. Could be used to downcast a trait object
to a particular type.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Any
. Could be used to downcast a trait object
to a particular type.fn into_any(self: Box<T>) -> Box<dyn Any>
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> MessageData for T
impl<T> MessageData for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
ReadEndian::read_from_little_endian()
.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>(
&self,
path: &'p str,
func: &mut dyn FnMut(Result<&T, ReflectPathError<'p>>),
)where
T: Reflect,
fn get_resolve_path_mut<'p, T>(
&mut self,
path: &'p str,
func: &mut dyn FnMut(Result<&mut T, ReflectPathError<'p>>),
)where
T: Reflect,
Source§impl<T> ScriptMessagePayload for T
impl<T> ScriptMessagePayload for T
Source§fn as_any_ref(&self) -> &(dyn Any + 'static)
fn as_any_ref(&self) -> &(dyn Any + 'static)
self
as &dyn Any
Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
self
as &dyn Any
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.