Struct heron::rapier_plugin::rapier3d::parry::query::details::PointCompositeShapeProjWithFeatureBestFirstVisitor [−][src]
pub struct PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> { /* fields omitted */ }
Expand description
A visitor for the projection of a point on a composite shape.
Implementations
Trait Implementations
impl<'a, S> SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB> for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: TypedSimdCompositeShape,
FeatureId: Copy,
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))
type Result = (PointProjection, (<S as TypedSimdCompositeShape>::PartId, FeatureId))
The result of a best-first traversal.
pub fn visit(
&mut self,
best: f32,
aabb: &SimdAABB,
data: Option<[Option<&<S as TypedSimdCompositeShape>::PartId>; 4]>
) -> SimdBestFirstVisitStatus<<PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> as SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB>>::Result>
pub fn visit(
&mut self,
best: f32,
aabb: &SimdAABB,
data: Option<[Option<&<S as TypedSimdCompositeShape>::PartId>; 4]>
) -> SimdBestFirstVisitStatus<<PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> as SimdBestFirstVisitor<<S as TypedSimdCompositeShape>::PartId, SimdAABB>>::Result>
Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.
Auto Trait Implementations
impl<'a, S> RefUnwindSafe for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: RefUnwindSafe,
impl<'a, S> Send for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: Sync,
impl<'a, S> Sync for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: Sync,
impl<'a, S> Unpin for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S>
impl<'a, S> UnwindSafe for PointCompositeShapeProjWithFeatureBestFirstVisitor<'a, S> where
S: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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>
pub 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
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)
pub 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
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more