Trait ncollide3d::partitioning::BestFirstVisitor

pub trait BestFirstVisitor<N, T, BV> {
    type Result;
    fn visit_bv(&mut self, bv: &BV) -> BestFirstBVVisitStatus<N>;
    fn visit_data(
        &mut self, 
        data: &T
    ) -> BestFirstDataVisitStatus<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-fist traversal.

Loading content...

Required methods

fn visit_bv(&mut self, bv: &BV) -> BestFirstBVVisitStatus<N>

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

fn visit_data(&mut self, data: &T) -> BestFirstDataVisitStatus<N, Self::Result>

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

Loading content...

Implementors

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

type Result = PointProjection<N>

fn visit_bv(&mut self, aabb: &AABB<N>) -> BestFirstBVVisitStatus<N>

fn visit_data(
    &mut self,
    b: &usize
) -> BestFirstDataVisitStatus<N, PointProjection<N>>

Loading content...