Struct ncollide2d::partitioning::DBVTLeaf
source · pub struct DBVTLeaf<N: Real, B, BV> {
pub bounding_volume: BV,
pub center: Point<N>,
pub data: B,
/* private fields */
}
Expand description
Leaf of a Dynamic Bounding Volume Tree.
Fields§
§bounding_volume: BV
The bounding volume of this node.
center: Point<N>
The center of this node bounding volume.
data: B
An user-defined data.
Implementations§
source§impl<N: Real, B, BV: BoundingVolume<N>> DBVTLeaf<N, B, BV>
impl<N: Real, B, BV: BoundingVolume<N>> DBVTLeaf<N, B, BV>
Trait Implementations§
Auto Trait Implementations§
impl<N, B, BV> RefUnwindSafe for DBVTLeaf<N, B, BV>where
B: RefUnwindSafe,
BV: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, B, BV> Send for DBVTLeaf<N, B, BV>where
B: Send,
BV: Send,
impl<N, B, BV> Sync for DBVTLeaf<N, B, BV>where
B: Sync,
BV: Sync,
impl<N, B, BV> Unpin for DBVTLeaf<N, B, BV>where
B: Unpin,
BV: Unpin,
N: Unpin,
impl<N, B, BV> UnwindSafe for DBVTLeaf<N, B, BV>where
B: UnwindSafe,
BV: UnwindSafe,
N: UnwindSafe,
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.