Struct parry2d :: bounding_volume :: SimdAabb Copy item path

impl SimdAabb

pub fn new_invalid() -> Self

An invalid Aabb.

pub fn splat(aabb: Aabb) -> Self

Builds an SIMD aabb composed of four identical aabbs.

pub fn center(&self) -> Point<SimdReal>

The center of all the Aabbs represented by `self``.

pub fn half_extents(&self) -> Vector<SimdReal>

The half-extents of all the Aabbs represented by `self``.

pub fn radius(&self) -> SimdReal

The radius of all the Aabbs represented by `self``.

pub fn transform_by(&self, transform: &Isometry<SimdReal>) -> Self

Return the Aabb of the self transformed by the given isometry.

pub fn scaled(self, scale: &Vector<SimdReal>) -> Self

Returns a scaled version of this Aabb.

pub fn loosen(&mut self, margin: SimdReal)

Enlarges this bounding volume by the given margin.

pub fn dilate_by_factor(&mut self, factor: SimdReal)

Dilate all the Aabbs represented by self`` by their extents multiplied by the given scale factor`.

pub fn replace(&mut self, i: usize, aabb: Aabb)

Replace the i-th Aabb of this SIMD AAAB by the given value.

pub fn cast_local_ray( &self, ray: &SimdRay, max_toi: SimdReal ) -> (SimdBool, SimdReal)

Casts a ray on all the Aabbs represented by self.

pub fn distance_to_local_point(&self, point: &Point<SimdReal>) -> SimdReal

Computes the distances between a point and all the Aabbs represented by self.

pub fn distance_to_origin(&self) -> SimdReal

Computes the distances between the origin and all the Aabbs represented by self.

pub fn contains_local_point(&self, point: &Point<SimdReal>) -> SimdBool

Check which Aabb represented by self contains the given point.

pub fn contains(&self, other: &SimdAabb) -> SimdBool

Lanewise check which Aabb represented by self contains the given set of other aabbs. The check is performed lane-wise.

pub fn intersects(&self, other: &SimdAabb) -> SimdBool

Lanewise check which Aabb represented by self intersects the given set of other aabbs. The check is performed lane-wise.

pub fn intersects_permutations(&self, other: &SimdAabb) -> [SimdBool; 4]

Checks intersections between all the lanes combination between self and other.

The result is an array such that result[i].extract(j) contains the intersection result between self.extract(i) and other.extract(j).

pub fn to_merged_aabb(&self) -> Aabb

Merge all the Aabb represented by self into a single one.

pub fn extract(&self, lane: usize) -> Aabb

Extracts the Aabb stored in the given SIMD lane of the SIMD Aabb:

Trait Implementations§

impl Clone for SimdAabb

fn clone(&self) -> SimdAabb

Returns a copy of the value. Read more

1.0.0 · source§

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

Performs copy-assignment from source. Read more

impl Debug for SimdAabb

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

Formats the value using the given formatter. Read more

impl From<[Aabb; 4]> for SimdAabb

fn from(aabbs: [Aabb; 4]) -> Self

Converts to this type from the input type.

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for CompositeShapeAgainstAnyDistanceVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

type Result = (<G1 as TypedSimdCompositeShape>::PartId, f32)

The result of a best-first traversal.

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

type Result = (<G1 as TypedSimdCompositeShape>::PartId, ClosestPoints)

The result of a best-first traversal.

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

type Result = (<G1 as TypedSimdCompositeShape>::PartId, bool)

The result of a best-first traversal.

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for NonlinearTOICompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

type Result = (<G1 as TypedSimdCompositeShape>::PartId, TOI)

The result of a best-first traversal.

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, D, G1> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for TOICompositeShapeShapeBestFirstVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

type Result = (<G1 as TypedSimdCompositeShape>::PartId, TOI)

The result of a best-first traversal.

fn visit( &mut self, best: Real, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for PointCompositeShapeProjBestFirstVisitor<'a, S>
where S: TypedSimdCompositeShape,

type Result = (PointProjection, <S as TypedSimdCompositeShape>::PartId)

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&S::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S>
where S: TypedSimdCompositeShape, FeatureId: Copy,

type Result = (PointProjection, (<S as TypedSimdCompositeShape>::PartId, FeatureId))

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&S::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for PointCompositeShapeProjWithLocationBestFirstVisitor<'a, S>
where S: TypedSimdCompositeShape, <S::PartShape as PointQueryWithLocation>::Location: Copy, S::PartShape: PointQueryWithLocation + Copy,

type Result = (PointProjection, (<S as TypedSimdCompositeShape>::PartId, <<S as TypedSimdCompositeShape>::PartShape as PointQueryWithLocation>::Location))

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&S::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for RayCompositeShapeToiAndNormalBestFirstVisitor<'a, S>
where S: TypedSimdCompositeShape,

type Result = (<S as TypedSimdCompositeShape>::PartId, RayIntersection)

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&S::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for RayCompositeShapeToiBestFirstVisitor<'a, S>
where S: TypedSimdCompositeShape,

type Result = (<S as TypedSimdCompositeShape>::PartId, f32)

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&S::PartId>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<'a, S: SimdCompositeShape + PointQuery> SimdBestFirstVisitor<u32, SimdAabb> for CompositeClosestPointVisitor<'a, S>

type Result = PointProjection

The result of a best-first traversal.

fn visit( &mut self, best: Real, aabb: &SimdAabb, data: Option<[Option<&u32>; 4]> ) -> SimdBestFirstVisitStatus<Self::Result>

Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.

impl<T1, T2, F> SimdSimultaneousVisitor<T1, T2, SimdAabb> for BoundingVolumeIntersectionsSimultaneousVisitor<T1, T2, F>
where F: FnMut(&T1, &T2) -> bool,

fn visit( &mut self, left_bv: &SimdAabb, left_data: Option<[Option<&T1>; 4]>, right_bv: &SimdAabb, right_data: Option<[Option<&T2>; 4]> ) -> SimdSimultaneousVisitStatus

Execute an operation on the content of two nodes, one from each structure. Read more

impl<'a, D, G1> SimdVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAabb> for IntersectionCompositeShapeShapeVisitor<'a, D, G1>
where D: QueryDispatcher + ?Sized, G1: TypedSimdCompositeShape + ?Sized,

fn visit( &mut self, bv: &SimdAabb, data: Option<[Option<&G1::PartId>; 4]> ) -> SimdVisitStatus

Execute an operation on the content of a node of the spatial partitioning structure. Read more

impl<'a, S: TypedSimdCompositeShape> SimdVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAabb> for CompositePointContainmentTest<'a, S>

fn visit( &mut self, bv: &SimdAabb, b: Option<[Option<&S::PartId>; 4]> ) -> SimdVisitStatus

Execute an operation on the content of a node of the spatial partitioning structure. Read more

impl<T, F> SimdVisitor<T, SimdAabb> for BoundingVolumeIntersectionsVisitor<T, F>
where F: FnMut(&T) -> bool,

fn visit( &mut self, bv: &SimdAabb, b: Option<[Option<&T>; 4]> ) -> SimdVisitStatus

Execute an operation on the content of a node of the spatial partitioning structure. Read more

impl<'a, T, F> SimdVisitor<T, SimdAabb> for PointIntersectionsVisitor<'a, T, F>
where F: FnMut(&T) -> bool,

fn visit( &mut self, bv: &SimdAabb, b: Option<[Option<&T>; 4]> ) -> SimdVisitStatus

Execute an operation on the content of a node of the spatial partitioning structure. Read more

impl<'a, T, F> SimdVisitor<T, SimdAabb> for RayIntersectionsVisitor<'a, T, F>
where F: FnMut(&T) -> bool,

fn visit( &mut self, bv: &SimdAabb, b: Option<[Option<&T>; 4]> ) -> SimdVisitStatus

Execute an operation on the content of a node of the spatial partitioning structure. Read more

impl Copy for SimdAabb

Auto Trait Implementations§

impl UnwindSafe for SimdAabb

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Downcast for T
where T: 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.

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.

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.

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.

impl<T> DowncastSync for T
where T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> IntoEither for T

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 more

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

impl<T> ToOwned for T
where T: Clone,

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for T
where U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.