Struct parry3d::bounding_volume::SimdAABB

source · [−]

pub struct SimdAABB {
    pub mins: Point<SimdReal>,
    pub maxs: Point<SimdReal>,
}

Expand description

Four AABB represented as a single SoA AABB with SIMD components.

Fields

mins: Point<SimdReal>

The min coordinates of the AABBs.

maxs: Point<SimdReal>

The max coordinates the AABBs.

Implementations

source

impl SimdAABB

source

pub fn new_invalid() -> Self

An invalid AABB.

source

pub fn splat(aabb: AABB) -> Self

Builds an SIMD aabb composed of four identical aabbs.

source

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

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

source

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

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

source

pub fn radius(&self) -> SimdReal

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

source

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

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

source

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

Returns a scaled version of this AABB.

source

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`.

source

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

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

source

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

Casts a ray on all the AABBs represented by self.

source

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

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

source

pub fn distance_to_origin(&self) -> SimdReal

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

source

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

Check which AABB represented by self contains the given point.

source

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.

source

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

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

source

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).

source

pub fn to_merged_aabb(&self) -> AABB

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

source

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

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

Trait Implementations

source

impl Clone for SimdAABB

source

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

source

impl Debug for SimdAABB

source

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

Formats the value using the given formatter. Read more

source

impl From<[AABB ; 4]> for SimdAABB

source

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

Converts to this type from the input type.

source

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

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

The result of a best-first traversal.

source

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.

source

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

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

The result of a best-first traversal.

source

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.

source

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

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

The result of a best-first traversal.

source

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.

source

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

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

The result of a best-first traversal.

source

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.

source

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

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

The result of a best-first traversal.

source

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.

source

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.

source

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.

source

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,
 S::PartShape: Copy,

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

The result of a best-first traversal.

source

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.

source

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.

source

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.

source

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.

source

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.

source

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.

source

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.

source

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

type Result = PointProjection

The result of a best-first traversal.

source

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.

source

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

source

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

source

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

source

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

source

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

source

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

source

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

source

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

source

impl<'a, S: SimdCompositeShape> SimdVisitor<u32, SimdAABB> for CompositePointContainmentTest<'a, S>

source

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

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

source

impl Copy for SimdAABB

Auto Trait Implementations

impl RefUnwindSafe for SimdAABB

impl Send for SimdAABB

impl Sync for SimdAABB

impl Unpin for SimdAABB

impl UnwindSafe for SimdAABB

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> Downcast for T where
T: Any,

source

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

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. Read more

source

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

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

source

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. Read more

source

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. Read more

source

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

source

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

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

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

fn into(self) -> U

Calls U::from(self).

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

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

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

source

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

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

source

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

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

source

fn from_subset(element: &SS) -> SP

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

source

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

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

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

source

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

🔬 This is a nightly-only experimental API. (toowned_clone_into)

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct parry3d::bounding_volume::SimdAABB

Fields

Implementations

impl SimdAABB

pub fn new_invalid() -> Self

pub fn splat(aabb: AABB) -> Self

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

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

pub fn radius(&self) -> SimdReal

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

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

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

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

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

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

pub fn distance_to_origin(&self) -> SimdReal

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

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

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

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

pub fn to_merged_aabb(&self) -> AABB

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

Trait Implementations

impl Clone for SimdAABB

fn clone(&self) -> SimdAABB

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

impl Debug for SimdAABB

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

impl From<[AABB; 4]> for SimdAABB

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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, S::PartShape: Copy,

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

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

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))

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

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

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

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

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

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

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

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

type Result = PointProjection

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

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

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

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

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

impl<'a, S: SimdCompositeShape> SimdVisitor<u32, SimdAABB> for CompositePointContainmentTest<'a, S>

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

impl Copy for SimdAABB

Auto Trait Implementations

impl RefUnwindSafe for SimdAABB

impl Send for SimdAABB

impl Sync for SimdAABB

impl Unpin for SimdAABB

impl UnwindSafe for SimdAABB

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

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

impl From<[AABB ; 4]> for SimdAABB

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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,
S::PartShape: Copy,

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

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

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 ))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<T> Downcast for T where
T: Any,

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

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

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

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

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

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