Struct ncollide2d::query::PointInterferencesCollector [−][src]
pub struct PointInterferencesCollector<'a, N: 'a + Real, B: 'a> { /* fields omitted */ }
Bounding Volume Tree visitor collecting nodes that may contain a given point.
Methods
impl<'a, N: Real, B> PointInterferencesCollector<'a, N, B>[src]
impl<'a, N: Real, B> PointInterferencesCollector<'a, N, B>pub fn new(
point: &'a Point<N>,
buffer: &'a mut Vec<B>
) -> PointInterferencesCollector<'a, N, B>[src]
pub fn new(
point: &'a Point<N>,
buffer: &'a mut Vec<B>
) -> PointInterferencesCollector<'a, N, B>Creates a new PointInterferencesCollector.
Trait Implementations
impl<'a, N, B, BV> BVTVisitor<B, BV> for PointInterferencesCollector<'a, N, B> where
N: Real,
B: Clone,
BV: PointQuery<N>, [src]
impl<'a, N, B, BV> BVTVisitor<B, BV> for PointInterferencesCollector<'a, N, B> where
N: Real,
B: Clone,
BV: PointQuery<N>, fn visit_internal(&mut self, bv: &BV) -> bool[src]
fn visit_internal(&mut self, bv: &BV) -> boolVisits an internal node. Returns true if the internal node children have to be visited too. Read more
fn visit_leaf(&mut self, b: &B, bv: &BV)[src]
fn visit_leaf(&mut self, b: &B, bv: &BV)Visits a leaf.
Auto Trait Implementations
impl<'a, N, B> Send for PointInterferencesCollector<'a, N, B> where
B: Send,
impl<'a, N, B> Send for PointInterferencesCollector<'a, N, B> where
B: Send, impl<'a, N, B> Sync for PointInterferencesCollector<'a, N, B> where
B: Sync,
impl<'a, N, B> Sync for PointInterferencesCollector<'a, N, B> where
B: Sync,