pub type Box2D<T> = Box2D<T, UnknownUnit>;
Aliased Type§
struct Box2D<T> {
pub min: Point2D<T, UnknownUnit>,
pub max: Point2D<T, UnknownUnit>,
}
Fields§
§min: Point2D<T, UnknownUnit>
§max: Point2D<T, UnknownUnit>
Implementations§
source§impl<T, U> Box2D<T, U>
impl<T, U> Box2D<T, U>
source§impl<T, U> Box2D<T, U>where
T: PartialOrd,
impl<T, U> Box2D<T, U>where T: PartialOrd,
sourcepub fn is_negative(&self) -> bool
pub fn is_negative(&self) -> bool
Returns true if the box has a negative area.
The common interpretation for a negative box is to consider it empty. It can be obtained by calculating the intersection of two boxes that do not intersect.
sourcepub fn intersects(&self, other: &Self) -> bool
pub fn intersects(&self, other: &Self) -> bool
Returns true
if the two boxes intersect.
sourcepub fn contains(&self, p: Point2D<T, U>) -> bool
pub fn contains(&self, p: Point2D<T, U>) -> bool
Returns true
if this box contains the point. Points are considered
in the box if they are on the front, left or top faces, but outside if they
are on the back, right or bottom faces.
sourcepub fn contains_box(&self, other: &Self) -> bool
pub fn contains_box(&self, other: &Self) -> bool
Returns true
if this box contains the interior of the other box. Always
returns true
if other is empty, and always returns false
if other is
nonempty but this box is empty.
source§impl<T, U> Box2D<T, U>where
T: Copy + PartialOrd,
impl<T, U> Box2D<T, U>where T: Copy + PartialOrd,
pub fn to_non_empty(&self) -> Option<Self>
sourcepub fn intersection(&self, other: &Self) -> Option<Self>
pub fn intersection(&self, other: &Self) -> Option<Self>
Computes the intersection of two boxes, returning None
if the boxes do not intersect.
sourcepub fn intersection_unchecked(&self, other: &Self) -> Self
pub fn intersection_unchecked(&self, other: &Self) -> Self
Computes the intersection of two boxes without check whether they do intersect.
The result is a negative box if the boxes do not intersect. This can be useful for computing the intersection of more than two boxes, as it is possible to chain multiple intersection_unchecked calls and check for empty/negative result at the end.
source§impl<T, U> Box2D<T, U>where
T: Copy + Add<T, Output = T> + Sub<T, Output = T>,
impl<T, U> Box2D<T, U>where T: Copy + Add<T, Output = T> + Sub<T, Output = T>,
sourcepub fn inflate(&self, width: T, height: T) -> Self
pub fn inflate(&self, width: T, height: T) -> Self
Inflates the box by the specified sizes on each side respectively.
sourcepub fn inner_box(&self, offsets: SideOffsets2D<T, U>) -> Self
pub fn inner_box(&self, offsets: SideOffsets2D<T, U>) -> Self
Calculate the size and position of an inner box.
Subtracts the side offsets from all sides. The horizontal, vertical and applicate offsets must not be larger than the original side length.
sourcepub fn outer_box(&self, offsets: SideOffsets2D<T, U>) -> Self
pub fn outer_box(&self, offsets: SideOffsets2D<T, U>) -> Self
Calculate the b and position of an outer box.
Add the offsets to all sides. The expanded box is returned.
source§impl<T, U> Box2D<T, U>where
T: Copy + Zero + PartialOrd,
impl<T, U> Box2D<T, U>where T: Copy + Zero + PartialOrd,
sourcepub fn from_points<I>(points: I) -> Selfwhere
I: IntoIterator,
I::Item: Borrow<Point2D<T, U>>,
pub fn from_points<I>(points: I) -> Selfwhere I: IntoIterator, I::Item: Borrow<Point2D<T, U>>,
Returns the smallest box containing all of the provided points.
source§impl<T, U> Box2D<T, U>where
T: Copy + One + Add<Output = T> + Sub<Output = T> + Mul<Output = T>,
impl<T, U> Box2D<T, U>where T: Copy + One + Add<Output = T> + Sub<Output = T> + Mul<Output = T>,
source§impl<T, U> Box2D<T, U>where
T: Copy,
impl<T, U> Box2D<T, U>where T: Copy,
pub fn x_range(&self) -> Range<T>
pub fn y_range(&self) -> Range<T>
sourcepub fn to_untyped(&self) -> Box2D<T, UnknownUnit>
pub fn to_untyped(&self) -> Box2D<T, UnknownUnit>
Drop the units, preserving only the numeric value.
sourcepub fn from_untyped(c: &Box2D<T, UnknownUnit>) -> Box2D<T, U>
pub fn from_untyped(c: &Box2D<T, UnknownUnit>) -> Box2D<T, U>
Tag a unitless value with units.
pub fn scale<S: Copy>(&self, x: S, y: S) -> Selfwhere T: Mul<S, Output = T>,
source§impl<T: NumCast + Copy, U> Box2D<T, U>
impl<T: NumCast + Copy, U> Box2D<T, U>
sourcepub fn cast<NewT: NumCast>(&self) -> Box2D<NewT, U>
pub fn cast<NewT: NumCast>(&self) -> Box2D<NewT, U>
Cast from one numeric representation to another, preserving the units.
When casting from floating point to integer coordinates, the decimals are truncated as one would expect from a simple cast, but this behavior does not always make sense geometrically. Consider using round(), round_in or round_out() before casting.
sourcepub fn try_cast<NewT: NumCast>(&self) -> Option<Box2D<NewT, U>>
pub fn try_cast<NewT: NumCast>(&self) -> Option<Box2D<NewT, U>>
Fallible cast from one numeric representation to another, preserving the units.
When casting from floating point to integer coordinates, the decimals are truncated as one would expect from a simple cast, but this behavior does not always make sense geometrically. Consider using round(), round_in or round_out() before casting.
sourcepub fn to_usize(&self) -> Box2D<usize, U>
pub fn to_usize(&self) -> Box2D<usize, U>
Cast into an usize
box, truncating decimals if any.
When casting from floating point boxes, it is worth considering whether
to round()
, round_in()
or round_out()
before the cast in order to
obtain the desired conversion behavior.
sourcepub fn to_u32(&self) -> Box2D<u32, U>
pub fn to_u32(&self) -> Box2D<u32, U>
Cast into an u32
box, truncating decimals if any.
When casting from floating point boxes, it is worth considering whether
to round()
, round_in()
or round_out()
before the cast in order to
obtain the desired conversion behavior.
source§impl<T, U> Box2D<T, U>where
T: Round,
impl<T, U> Box2D<T, U>where T: Round,
sourcepub fn round(&self) -> Self
pub fn round(&self) -> Self
Return a box with edges rounded to integer coordinates, such that the returned box has the same set of pixel centers as the original one. Values equal to 0.5 round up. Suitable for most places where integral device coordinates are needed, but note that any translation should be applied first to avoid pixel rounding errors. Note that this is not rounding to nearest integer if the values are negative. They are always rounding as floor(n + 0.5).
Trait Implementations§
source§impl<'de, T, U> Deserialize<'de> for Box2D<T, U>where
T: Deserialize<'de>,
impl<'de, T, U> Deserialize<'de> for Box2D<T, U>where T: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
source§impl<T: Copy + DivAssign, U> DivAssign<Scale<T, U, U>> for Box2D<T, U>
impl<T: Copy + DivAssign, U> DivAssign<Scale<T, U, U>> for Box2D<T, U>
source§fn div_assign(&mut self, scale: Scale<T, U, U>)
fn div_assign(&mut self, scale: Scale<T, U, U>)
/=
operation. Read moresource§impl<T: Copy + DivAssign, U> DivAssign<T> for Box2D<T, U>
impl<T: Copy + DivAssign, U> DivAssign<T> for Box2D<T, U>
source§fn div_assign(&mut self, scale: T)
fn div_assign(&mut self, scale: T)
/=
operation. Read moresource§impl<T: Copy + MulAssign, U> MulAssign<Scale<T, U, U>> for Box2D<T, U>
impl<T: Copy + MulAssign, U> MulAssign<Scale<T, U, U>> for Box2D<T, U>
source§fn mul_assign(&mut self, scale: Scale<T, U, U>)
fn mul_assign(&mut self, scale: Scale<T, U, U>)
*=
operation. Read moresource§impl<T: Copy + MulAssign, U> MulAssign<T> for Box2D<T, U>
impl<T: Copy + MulAssign, U> MulAssign<T> for Box2D<T, U>
source§fn mul_assign(&mut self, scale: T)
fn mul_assign(&mut self, scale: T)
*=
operation. Read more