Struct ncollide2d::query::PointInterferencesCollector
source · pub struct PointInterferencesCollector<'a, N: 'a + Real, B: 'a> { /* private fields */ }
Expand description
Bounding Volume Tree visitor collecting nodes that may contain a given point.
Implementations§
source§impl<'a, N: Real, B> PointInterferencesCollector<'a, N, B>
impl<'a, N: Real, B> PointInterferencesCollector<'a, N, B>
sourcepub fn new(
point: &'a Point<N>,
buffer: &'a mut Vec<B>
) -> PointInterferencesCollector<'a, N, B>
pub fn new(
point: &'a Point<N>,
buffer: &'a mut Vec<B>
) -> PointInterferencesCollector<'a, N, B>
Creates a new PointInterferencesCollector
.
Trait Implementations§
source§impl<'a, N, B, BV> BVTVisitor<B, BV> for PointInterferencesCollector<'a, N, B>where
N: Real,
B: Clone,
BV: PointQuery<N>,
impl<'a, N, B, BV> BVTVisitor<B, BV> for PointInterferencesCollector<'a, N, B>where
N: Real,
B: Clone,
BV: PointQuery<N>,
Auto Trait Implementations§
impl<'a, N, B> RefUnwindSafe for PointInterferencesCollector<'a, N, B>where
B: RefUnwindSafe,
N: RefUnwindSafe,
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> Unpin for PointInterferencesCollector<'a, N, B>
impl<'a, N, B> !UnwindSafe for PointInterferencesCollector<'a, N, B>
Blanket Implementations§
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.