Struct parry3d::bounding_volume::SimdAABB[−][src]

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>
Expand description

The min coordinates of the AABBs.

maxs: Point<SimdReal>
Expand description

The max coordinates the AABBs.

Implementations

impl SimdAABB[src]

pub fn new_invalid() -> Self[src]

An invalid AABB.

pub fn splat(aabb: AABB) -> Self[src]

Builds an SIMD aabb composed of four identical aabbs.

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

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

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

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

pub fn radius(&self) -> SimdReal[src]

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

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]

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]

Casts a ray on all the AABBs represented by self.

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]

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

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]

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]

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]

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

Trait Implementations

impl Clone for SimdAABB[src]

fn clone(&self) -> SimdAABB[src]

Returns a copy of the value. Read more

fn clone_from(&mut self, source: &Self)1.0.0[src]

Performs copy-assignment from source. Read more

impl Debug for SimdAABB[src]

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

Formats the value using the given formatter. Read more

impl From<[AABB; 4]> for SimdAABB[src]

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

Performs the conversion.

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)

The result of a best-first traversal.

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

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

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

type Result = (G1::PartId, Real)

The result of a best-first traversal.

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

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

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

type Result = (G1::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>[src]

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

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

type Result = (G1::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>[src]

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

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

type Result = (G1::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>[src]

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, [src]

type Result = (PointProjection, S::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>[src]

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

type Result = (PointProjection, (S::PartId, <S::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>[src]

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, [src]

type Result = (PointProjection, (S::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>[src]

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, [src]

type Result = (S::PartId, Real)

The result of a best-first traversal.

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

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, [src]

type Result = (S::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>[src]

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>[src]

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>[src]

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

impl<'a, T, F> SimdVisitor<T, SimdAABB> for BoundingVolumeIntersectionsVisitor<'a, T, F> where
    F: FnMut(&T) -> bool, [src]

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

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, [src]

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

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, [src]

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

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

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

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

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

impl Copy for SimdAABB[src]

Auto Trait Implementations

Blanket Implementations

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

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized, [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]

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]

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]

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]

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]

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

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

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, [src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, [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]

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

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]

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

impl<T> ToOwned for T where
    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

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]

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

recently added

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

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

Performs the conversion.