#[repr(C)]pub struct Aabb<const D: usize> {
pub min: Point<D>,
pub max: Point<D>,
}Expand description
An axis-aligned bounding box (AABB)
Fields§
§min: Point<D>The minimum coordinates of the AABB
max: Point<D>The maximum coordinates of the AABB
Implementations§
Source§impl Aabb<2>
impl Aabb<2>
Sourcepub fn from_points(
points: impl IntoIterator<Item = impl Into<Point<2>>>,
) -> Self
pub fn from_points( points: impl IntoIterator<Item = impl Into<Point<2>>>, ) -> Self
Construct a 2-dimensional AABB from a list of points
The resulting AABB will contain all the points.
Sourcepub fn from_parry(aabb: Aabb) -> Self
pub fn from_parry(aabb: Aabb) -> Self
Construct a 2-dimensional AABB from a Parry AABB
Source§impl Aabb<3>
impl Aabb<3>
Sourcepub fn from_points(
points: impl IntoIterator<Item = impl Into<Point<3>>>,
) -> Self
pub fn from_points( points: impl IntoIterator<Item = impl Into<Point<3>>>, ) -> Self
Construct a 3-dimensional AABB from a list of points
The resulting AABB will contain all the points.
Sourcepub fn from_parry(aabb: Aabb) -> Self
pub fn from_parry(aabb: Aabb) -> Self
Construct a 3-dimensional AABB from a Parry AABB
Sourcepub fn include_point(self, point: &Point<3>) -> Self
pub fn include_point(self, point: &Point<3>) -> Self
Compute an AABB that includes an additional point
Trait Implementations§
Source§impl<const D: usize> Ord for Aabb<D>
impl<const D: usize> Ord for Aabb<D>
Source§impl<const D: usize> PartialOrd for Aabb<D>
impl<const D: usize> PartialOrd for Aabb<D>
impl<const D: usize> Copy for Aabb<D>
impl<const D: usize> Eq for Aabb<D>
impl<const D: usize> StructuralPartialEq for Aabb<D>
Auto Trait Implementations§
impl<const D: usize> Freeze for Aabb<D>
impl<const D: usize> RefUnwindSafe for Aabb<D>
impl<const D: usize> Send for Aabb<D>
impl<const D: usize> Sync for Aabb<D>
impl<const D: usize> Unpin for Aabb<D>
impl<const D: usize> UnwindSafe for Aabb<D>
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
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>
Convert
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>
Convert
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)
Convert
&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)
Convert
&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> DowncastSync for T
impl<T> DowncastSync for T
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>
Converts
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>
Converts
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<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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.