Struct parry3d::query::closest_points::CompositeShapeAgainstShapeClosestPointsVisitor [−][src]
pub struct CompositeShapeAgainstShapeClosestPointsVisitor<'a, D: ?Sized, G1: ?Sized + 'a> { /* fields omitted */ }
Expand description
A visitor for computing the closest points between a composite-shape and a shape.
Implementations
impl<'a, D: ?Sized, G1: ?Sized> CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
impl<'a, D: ?Sized, G1: ?Sized> CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
Trait Implementations
impl<'a, D: ?Sized, G1: ?Sized> SimdBestFirstVisitor<<G1 as TypedSimdCompositeShape>::PartId, SimdAABB> for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: QueryDispatcher,
G1: TypedSimdCompositeShape,
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::PartId, ClosestPoints)
type Result = (G1::PartId, ClosestPoints)
The result of a best-first traversal.
Auto Trait Implementations
impl<'a, D, G1> !RefUnwindSafe for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1>
impl<'a, D: ?Sized, G1: ?Sized> Send for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: Sync,
G1: Sync,
impl<'a, D: ?Sized, G1: ?Sized> Sync for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1> where
D: Sync,
G1: Sync,
impl<'a, D: ?Sized, G1: ?Sized> Unpin for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1>
impl<'a, D, G1> !UnwindSafe for CompositeShapeAgainstShapeClosestPointsVisitor<'a, D, G1>
Blanket Implementations
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
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.