Struct parry3d_f64::bounding_volume::SimdAABB [−][src]
Expand description
Four AABB represented as a single SoA AABB with SIMD components.
Fields
mins: Point<SimdReal>
Expand description
The min coordinates of the AABBs.
maxs: Point<SimdReal>
Expand description
The max coordinates the AABBs.
Implementations
impl SimdAABB
[src]
impl SimdAABB
[src]pub fn new_invalid() -> Self
[src]
pub fn new_invalid() -> Self
[src]An invalid AABB.
pub fn half_extents(&self) -> Vector<SimdReal>
[src]
pub fn half_extents(&self) -> Vector<SimdReal>
[src]The half-extents of all the AABBs represented by `self``.
pub fn dilate_by_factor(&mut self, factor: SimdReal)
[src]
pub fn dilate_by_factor(&mut self, factor: SimdReal)
[src]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)
[src]
pub fn replace(&mut self, i: usize, aabb: AABB)
[src]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)
[src]
pub fn cast_local_ray(
&self,
ray: &SimdRay,
max_toi: SimdReal
) -> (SimdBool, SimdReal)
[src]Casts a ray on all the AABBs represented by self
.
pub fn distance_to_local_point(&self, point: &Point<SimdReal>) -> SimdReal
[src]
pub fn distance_to_local_point(&self, point: &Point<SimdReal>) -> SimdReal
[src]Computes the distances between a point and all the AABBs represented by self
.
pub fn distance_to_origin(&self) -> SimdReal
[src]
pub fn distance_to_origin(&self) -> SimdReal
[src]Computes the distances between the origin and all the AABBs represented by self
.
pub fn contains_local_point(&self, point: &Point<SimdReal>) -> SimdBool
[src]
pub fn contains_local_point(&self, point: &Point<SimdReal>) -> SimdBool
[src]Check which AABB represented by self
contains the given point
.
pub fn contains(&self, other: &SimdAABB) -> SimdBool
[src]
pub fn contains(&self, other: &SimdAABB) -> SimdBool
[src]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
[src]
pub fn intersects(&self, other: &SimdAABB) -> SimdBool
[src]Check which AABB represented by self
contains the given set of other
aabbs.
The check is performed lane-wise.
pub fn to_merged_aabb(&self) -> AABB
[src]
pub fn to_merged_aabb(&self) -> AABB
[src]Merge all the AABB represented by self
into a single one.
Trait Implementations
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]type Result = (G1::PartId, ClosestPoints)
type Result = (G1::PartId, ClosestPoints)
The result of a best-first traversal.
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for CompositeShapeAgainstAnyDistanceVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for CompositeShapeAgainstAnyDistanceVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for IntersectionCompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for NonlinearTOICompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for NonlinearTOICompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for TOICompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for TOICompositeShapeShapeBestFirstVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
[src]impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for PointCompositeShapeProjBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for PointCompositeShapeProjBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]type Result = (PointProjection, S::PartId)
type Result = (PointProjection, S::PartId)
The result of a best-first traversal.
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,
[src]
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,
[src]type Result = (PointProjection, (S::PartId, <S::PartShape as PointQueryWithLocation>::Location))
type Result = (PointProjection, (S::PartId, <S::PartShape as PointQueryWithLocation>::Location))
The result of a best-first traversal.
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
FeatureId: Copy,
[src]
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
FeatureId: Copy,
[src]impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for RayCompositeShapeToiBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for RayCompositeShapeToiBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for RayCompositeShapeToiAndNormalBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for RayCompositeShapeToiAndNormalBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
[src]type Result = (S::PartId, RayIntersection)
type Result = (S::PartId, RayIntersection)
The result of a best-first traversal.
impl<'a, S: SimdCompositeShape + PointQuery> SimdBestFirstVisitor<u32, SimdAABB> for CompositeClosestPointVisitor<'a, S>
[src]
impl<'a, S: SimdCompositeShape + PointQuery> SimdBestFirstVisitor<u32, SimdAABB> for CompositeClosestPointVisitor<'a, S>
[src]type Result = PointProjection
type Result = PointProjection
The result of a best-first traversal.
impl<'a, T, F> SimdVisitor<T, SimdAABB> for BoundingVolumeIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]
impl<'a, T, F> SimdVisitor<T, SimdAABB> for BoundingVolumeIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]impl<'a, T, F> SimdVisitor<T, SimdAABB> for PointIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]
impl<'a, T, F> SimdVisitor<T, SimdAABB> for PointIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]impl<'a, T, F> SimdVisitor<T, SimdAABB> for RayIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]
impl<'a, T, F> SimdVisitor<T, SimdAABB> for RayIntersectionsVisitor<'a, T, F> where
F: FnMut(&T) -> bool,
[src]impl<'a, S: SimdCompositeShape> SimdVisitor<u32, SimdAABB> for CompositePointContainmentTest<'a, S>
[src]
impl<'a, S: SimdCompositeShape> SimdVisitor<u32, SimdAABB> for CompositePointContainmentTest<'a, S>
[src]impl Copy for SimdAABB
[src]
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
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
[src]
impl<T> Downcast for T where
T: Any,
[src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]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
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]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
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]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
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more