Trait ncollide2d::partitioning::BestFirstVisitor

pub trait BestFirstVisitor<N, T, BV> {
    type Result;
    fn visit(
        &mut self, 
        best_cost_so_far: N, 
        bv: &BV, 
        value: Option<&T>
    ) -> BestFirstVisitStatus<N, Self::Result>;
}

Trait implemented by cost functions used by the best-first search on a BVT.

Associated Types

type Result

The result of a best-first traversal.

Loading content...

Required methods

fn visit(
    &mut self,
    best_cost_so_far: N,
    bv: &BV,
    value: Option<&T>
) -> BestFirstVisitStatus<N, Self::Result>

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

Loading content...

Implementors

impl<'a, 'b, N, BV, T> BestFirstVisitor<N, BroadPhaseProxyHandle, BV> for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV> where
    N: RealField,
    BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone,
    T: Any + Send + Sync + Clone, 

type Result = (T, RayIntersection<N>)

fn visit(
    &mut self,
    best_cost_so_far: N,
    bv: &BV,
    data: Option<&BroadPhaseProxyHandle>
) -> BestFirstVisitStatus<N, Self::Result>

impl<'a, N: RealField, S: CompositeShape<N> + PointQuery<N>> BestFirstVisitor<N, usize, AABB<N>> for CompositeClosestPointVisitor<'a, N, S>

type Result = PointProjection<N>

fn visit(
    &mut self,
    best: N,
    aabb: &AABB<N>,
    data: Option<&usize>
) -> BestFirstVisitStatus<N, Self::Result>

Loading content...