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>

The min coordinates of the AABBs.

maxs: Point<SimdReal>

The max coordinates the AABBs.

Implementations

An invalid AABB.

Builds an SIMD aabb composed of four identical aabbs.

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

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

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

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

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

Casts a ray on all the AABBs represented by self.

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

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

Check which AABB represented by self contains the given point.

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

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

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

Trait Implementations

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Performs the conversion.

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

The result of a best-first traversal.

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

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

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

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

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

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

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

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

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more

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

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

Performs the conversion.

Performs the conversion.

Should always be Self

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

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

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

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

The resulting type after obtaining ownership.

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

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

recently added

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

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.