Struct tetra::graphics::Rectangle [−][src]
A rectangle, represented by a top-left position, a width and a height.
Serde
Serialization and deserialization of this type (via Serde)
can be enabled via the serde_support
feature.
Fields
x: T
The X co-ordinate of the rectangle.
y: T
The Y co-ordinate of the rectangle.
width: T
The width of the rectangle.
height: T
The height of the rectangle.
Implementations
impl<T> Rectangle<T>
[src]
impl<T> Rectangle<T> where
T: Copy,
[src]
T: Copy,
pub fn row(
x: T,
y: T,
width: T,
height: T
) -> impl Iterator<Item = Rectangle<T>> where
T: AddAssign,
[src]
x: T,
y: T,
width: T,
height: T
) -> impl Iterator<Item = Rectangle<T>> where
T: AddAssign,
Returns an infinite iterator of horizontally adjecent rectangles, starting at the specified point and increasing along the X axis.
This can be useful when slicing spritesheets.
Examples
let rects: Vec<Rectangle> = Rectangle::row(0.0, 0.0, 16.0, 16.0).take(3).collect(); assert_eq!(Rectangle::new(0.0, 0.0, 16.0, 16.0), rects[0]); assert_eq!(Rectangle::new(16.0, 0.0, 16.0, 16.0), rects[1]); assert_eq!(Rectangle::new(32.0, 0.0, 16.0, 16.0), rects[2]);
pub fn column(
x: T,
y: T,
width: T,
height: T
) -> impl Iterator<Item = Rectangle<T>> where
T: AddAssign,
[src]
x: T,
y: T,
width: T,
height: T
) -> impl Iterator<Item = Rectangle<T>> where
T: AddAssign,
Returns an infinite iterator of vertically adjecent rectangles, starting at the specified point and increasing along the Y axis.
This can be useful when slicing spritesheets.
Examples
let rects: Vec<Rectangle> = Rectangle::column(0.0, 0.0, 16.0, 16.0).take(3).collect(); assert_eq!(Rectangle::new(0.0, 0.0, 16.0, 16.0), rects[0]); assert_eq!(Rectangle::new(0.0, 16.0, 16.0, 16.0), rects[1]); assert_eq!(Rectangle::new(0.0, 32.0, 16.0, 16.0), rects[2]);
pub fn intersects(&self, other: &Rectangle<T>) -> bool where
T: Add<Output = T> + PartialOrd,
[src]
T: Add<Output = T> + PartialOrd,
Returns true
if the other
rectangle intersects with self
.
pub fn contains(&self, other: &Rectangle<T>) -> bool where
T: Add<Output = T> + PartialOrd,
[src]
T: Add<Output = T> + PartialOrd,
Returns true
if the other
rectangle is fully contained within self
.
pub fn contains_point(&self, point: Vec2<T>) -> bool where
T: Add<Output = T> + PartialOrd,
[src]
T: Add<Output = T> + PartialOrd,
Returns true
if the provided point is within the bounds of self
.
pub fn left(&self) -> T
[src]
Returns the X co-ordinate of the left side of the rectangle.
You can also obtain this via the x
field - this method is provided for
symmetry with the right
method.
pub fn right(&self) -> T where
T: Add<Output = T>,
[src]
T: Add<Output = T>,
Returns the X co-ordinate of the right side of the rectangle.
pub fn top(&self) -> T
[src]
Returns the Y co-ordinate of the top of the rectangle.
You can also obtain this via the y
field - this method is provided for
symmetry with the bottom
method.
pub fn bottom(&self) -> T where
T: Add<Output = T>,
[src]
T: Add<Output = T>,
Returns the Y co-ordinate of the bottom of the rectangle.
pub fn center(&self) -> Vec2<T> where
T: One + Add<Output = T> + Div<Output = T>,
[src]
T: One + Add<Output = T> + Div<Output = T>,
Returns the co-ordinates of the center point of the rectangle.
pub fn top_left(&self) -> Vec2<T>
[src]
Returns the co-ordinates of the top-left point of the rectangle.
pub fn top_right(&self) -> Vec2<T> where
T: Add<Output = T>,
[src]
T: Add<Output = T>,
Returns the co-ordinates of the top-right point of the rectangle.
pub fn bottom_left(&self) -> Vec2<T> where
T: Add<Output = T>,
[src]
T: Add<Output = T>,
Returns the co-ordinates of the bottom-left point of the rectangle.
pub fn bottom_right(&self) -> Vec2<T> where
T: Add<Output = T>,
[src]
T: Add<Output = T>,
Returns the co-ordinates of the bottom-right point of the rectangle.
Trait Implementations
impl<T: Clone> Clone for Rectangle<T>
[src]
impl<T: Copy> Copy for Rectangle<T>
[src]
impl<T: Debug> Debug for Rectangle<T>
[src]
impl<T: Default> Default for Rectangle<T>
[src]
impl<T: Eq> Eq for Rectangle<T>
[src]
impl<T: Hash> Hash for Rectangle<T>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T: PartialEq> PartialEq<Rectangle<T>> for Rectangle<T>
[src]
impl<T> StructuralEq for Rectangle<T>
[src]
impl<T> StructuralPartialEq for Rectangle<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for Rectangle<T> where
T: RefUnwindSafe,
[src]
T: RefUnwindSafe,
impl<T> Send for Rectangle<T> where
T: Send,
[src]
T: Send,
impl<T> Sync for Rectangle<T> where
T: Sync,
[src]
T: Sync,
impl<T> Unpin for Rectangle<T> where
T: Unpin,
[src]
T: Unpin,
impl<T> UnwindSafe for Rectangle<T> where
T: UnwindSafe,
[src]
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> CallHasher for T where
T: Hash,
T: Hash,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,