Struct Rect 

pub struct Rect<N = f64> { /* private fields */ }

Rectangle in 2d cartesian coordinate space.

Implementations

impl<N> Rect<N>

where N: Num + Copy + PartialOrd + Scalar + FromPrimitive,

pub fn new(x_min: N, y_min: N, x_max: N, y_max: N) -> Self

Creates a new rectangle.

pub fn x_min(&self) -> N

X min.

pub fn x_max(&self) -> N

X max.

pub fn y_min(&self) -> N

Y min.

pub fn y_max(&self) -> N

Y max.

pub fn width(&self) -> N

Width of the rectangle. Guaranteed to be non-negative.

pub fn height(&self) -> N

Height of the rectangle. Guaranteed to be non-negative.

pub fn half_width(&self) -> N

Half of the width of the rectangle. Guaranteed to be non-negative.

pub fn half_height(&self) -> N

Half of the height of the rectangle. Guaranteed to be non-negative.

pub fn into_contour(self) -> ClosedContour<Point2<N>>

Converts the rectangle into a closed contour of points.

pub fn shrink(&self, amount: N) -> Self

Moves the boundaries of the rectangle by amount inside (outside, if the amount is negative). If the width or height of the resulting rectangle are negative, they are set to 0.

pub fn shift(&self, dx: N, dy: N) -> Self

Adds the given amount to the coordinates of the rectangle.

pub fn merge(&self, other: Self) -> Self

Creates a new rectangle with the boundaries of this and other one.

pub fn from_point(p: &impl CartesianPoint2d<Num = N>) -> Self

Creates a zero-area rectangle from the point.

pub fn from_points<'a, P: CartesianPoint2d<Num = N> + 'a>( points: impl IntoIterator<Item = P>, ) -> Option<Self>

Returns a minimum rectangle that contains all the points in the iterator.

Returns None if the iterator is empty.

pub fn contains(&self, point: &impl CartesianPoint2d<Num = N>) -> bool

Returns true if the point is inside (or on a side) of the rectagle.

pub fn magnify(&self, factor: N) -> Self

Changes the width and height of the rectangle by the factor of factor, keeping the center of the rectangle at the same place.

pub fn limit(&self, other: Self) -> Self

Returns a new rectangle, boundaries of which are inside of boundaries of this and the other rectangles.

pub fn center(&self) -> Point2<N>

Returns the center point of the rectangle.

pub fn into_quadrangle(self) -> [Point2<N>; 4]

Returns a set of 4 points - corners of the rectangle.

The order of points is:

1. Left bottom
2. Left top
3. Right top
4. Right bottom

pub fn intersects(&self, other: Rect<N>) -> bool

Returns true if two rectangle have at least one common point.

Trait Implementations

impl<N> Add<Vector2<N>> for Rect<N>

where N: Num + Copy + PartialOrd + Scalar + FromPrimitive,

type Output = Rect<N>

The resulting type after applying the + operator.

fn add(self, rhs: Vector2<N>) -> Self::Output

Performs the + operation.

impl<N: Clone> Clone for Rect<N>

fn clone(&self) -> Rect<N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug> Debug for Rect<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Default> Default for Rect<N>

fn default() -> Rect<N>

Returns the “default value” for a type.

impl<'de, N> Deserialize<'de> for Rect<N>

where N: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N: Num + Copy + PartialOrd + Scalar + FromPrimitive> FromIterator<Rect<N>> for Option<Rect<N>>

fn from_iter<T: IntoIterator<Item = Rect<N>>>(iter: T) -> Self

Creates a value from an iterator.

impl<N: Hash> Hash for Rect<N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: PartialEq> PartialEq for Rect<N>

fn eq(&self, other: &Rect<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N: PartialOrd> PartialOrd for Rect<N>

fn partial_cmp(&self, other: &Rect<N>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<N> Serialize for Rect<N>

where N: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N> Sub<Vector2<N>> for Rect<N>

where N: Num + Copy + PartialOrd + Scalar + FromPrimitive,

type Output = Rect<N>

The resulting type after applying the - operator.

fn sub(self, rhs: Vector2<N>) -> Self::Output

Performs the - operation.

impl<N: Copy> Copy for Rect<N>

impl<N> StructuralPartialEq for Rect<N>