pub struct BoundingVolumeInterferencesCollector<'a, N: 'a, T: 'a, BV: 'a> {
pub bv: &'a BV,
pub collector: &'a mut Vec<T>,
/* private fields */
}
Expand description
Spatial partitioning data structure visitor collecting interferences with a given bounding volume.
Fields§
§bv: &'a BV
The bounding volume used for interference tests.
collector: &'a mut Vec<T>
The data contained by the nodes with bounding volumes intersecting self.bv
.
Implementations§
Source§impl<'a, N, T, BV> BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> BoundingVolumeInterferencesCollector<'a, N, T, BV>
Sourcepub fn new(
bv: &'a BV,
buffer: &'a mut Vec<T>,
) -> BoundingVolumeInterferencesCollector<'a, N, T, BV>
pub fn new( bv: &'a BV, buffer: &'a mut Vec<T>, ) -> BoundingVolumeInterferencesCollector<'a, N, T, BV>
Creates a new BoundingVolumeInterferencesCollector
.
Trait Implementations§
Source§impl<'a, N, T, BV> Visitor<T, BV> for BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> Visitor<T, BV> for BoundingVolumeInterferencesCollector<'a, N, T, BV>
Auto Trait Implementations§
impl<'a, N, T, BV> Freeze for BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> RefUnwindSafe for BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> Send for BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> Sync for BoundingVolumeInterferencesCollector<'a, N, T, BV>
impl<'a, N, T, BV> Unpin for BoundingVolumeInterferencesCollector<'a, N, T, BV>where
N: Unpin,
impl<'a, N, T, BV> !UnwindSafe for BoundingVolumeInterferencesCollector<'a, N, T, BV>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn 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
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
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§fn to_subset_unchecked(&self) -> SS
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.