Struct ncollide3d::partitioning::DBVT [−][src]
pub struct DBVT<N: RealField, T, BV> { /* fields omitted */ }
A bounding volume hierarchy on which objects can be added or removed after construction.
Implementations
impl<N: RealField, T, BV: BoundingVolume<N>> DBVT<N, T, BV>
[src]
impl<N: RealField, T, BV: BoundingVolume<N>> DBVT<N, T, BV>
[src]pub fn new() -> DBVT<N, T, BV>
[src]
Creates a new empty dynamic bonding volume hierarchy.
pub fn root_bounding_volume(&self) -> Option<&BV>
[src]
The bounding volume of the root of this DBVT.
Returns None
if the DBVT is empty.
pub fn is_empty(&self) -> bool
[src]
Indicates whether this DBVT empty.
pub fn insert(&mut self, leaf: DBVTLeaf<N, T, BV>) -> DBVTLeafId
[src]
Inserts a leaf into this DBVT.
pub fn remove(&mut self, leaf_id: DBVTLeafId) -> DBVTLeaf<N, T, BV>
[src]
Removes a leaf from this DBVT.
Panics if the provided leaf is not attached to this DBVT.
pub fn get(&self, DBVTLeafId: DBVTLeafId) -> Option<&DBVTLeaf<N, T, BV>>
[src]
Gets the given leaf if it exists.
Trait Implementations
impl<'a, N: RealField, T, BV> BVH<T, BV> for DBVT<N, T, BV>
[src]
impl<'a, N: RealField, T, BV> BVH<T, BV> for DBVT<N, T, BV>
[src]type Node = DBVTNodeId
Type of a node identifiers on this BVH.
fn root(&self) -> Option<Self::Node>
[src]
fn num_children(&self, node: Self::Node) -> usize
[src]
fn child(&self, i: usize, node: Self::Node) -> Self::Node
[src]
fn content(&self, node: Self::Node) -> (&BV, Option<&T>)
[src]
fn visit(&self, visitor: &mut impl Visitor<T, BV>)
[src]
fn visit_bvtt(
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
[src]
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
fn best_first_search<N, BFS>(
&self,
visitor: &mut BFS
) -> Option<(Self::Node, BFS::Result)> where
N: RealField,
BFS: BestFirstVisitor<N, T, BV>,
[src]
&self,
visitor: &mut BFS
) -> Option<(Self::Node, BFS::Result)> where
N: RealField,
BFS: BestFirstVisitor<N, T, BV>,
Auto Trait Implementations
impl<N, T, BV> RefUnwindSafe for DBVT<N, T, BV> where
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<N, T, BV> Send for DBVT<N, T, BV> where
BV: Send,
T: Send,
BV: Send,
T: Send,
impl<N, T, BV> Sync for DBVT<N, T, BV> where
BV: Sync,
T: Sync,
BV: Sync,
T: Sync,
impl<N, T, BV> Unpin for DBVT<N, T, BV> where
BV: Unpin,
N: Unpin,
T: Unpin,
BV: Unpin,
N: Unpin,
T: Unpin,
impl<N, T, BV> UnwindSafe for DBVT<N, T, BV> where
BV: UnwindSafe,
N: UnwindSafe,
T: UnwindSafe,
BV: UnwindSafe,
N: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]