Struct oxygengine_physics_2d::prelude::ncollide2d::partitioning::DBVT

pub struct DBVT<N, T, BV>where
    N: RealField + Copy,{ /* private fields */ }

A bounding volume hierarchy on which objects can be added or removed after construction.

Implementations

impl<N, T, BV> DBVT<N, T, BV>where N: RealField + Copy, BV: BoundingVolume<N>,

pub fn new() -> DBVT<N, T, BV>

Creates a new empty dynamic bonding volume hierarchy.

pub fn root_bounding_volume(&self) -> Option<&BV>

The bounding volume of the root of this DBVT.

Returns None if the DBVT is empty.

pub fn is_empty(&self) -> bool

Indicates whether this DBVT empty.

pub fn insert(&mut self, leaf: DBVTLeaf<N, T, BV>) -> DBVTLeafId

Inserts a leaf into this DBVT.

pub fn remove(&mut self, leaf_id: DBVTLeafId) -> DBVTLeaf<N, T, BV>

Removes a leaf from this DBVT.

Panics if the provided leaf is not attached to this DBVT.

pub fn get(&self, _: DBVTLeafId) -> Option<&DBVTLeaf<N, T, BV>>

Gets the given leaf if it exists.

Trait Implementations

impl<'a, N, T, BV> BVH<T, BV> for DBVT<N, T, BV>where N: RealField + Copy,

type Node = DBVTNodeId

Type of a node identifiers on this BVH.

fn root(&self) -> Option<<DBVT<N, T, BV> as BVH<T, BV>>::Node>

The root of the BVH.

fn num_children(&self, node: <DBVT<N, T, BV> as BVH<T, BV>>::Node) -> usize

The number of children of the given node.

fn child( &self, i: usize, node: <DBVT<N, T, BV> as BVH<T, BV>>::Node ) -> <DBVT<N, T, BV> as BVH<T, BV>>::Node

The i-th child of the given node.

fn content( &self, node: <DBVT<N, T, BV> as BVH<T, BV>>::Node ) -> (&BV, Option<&T>)

The bounding volume and data contained by the given node.

fn visit(&self, visitor: &mut impl Visitor<T, BV>)

Traverses this BVH using a visitor.

fn visit_bvtt( &self, other: &impl BVH<T, BV>, visitor: &mut impl SimultaneousVisitor<T, BV> )

Visits the bounding volume test tree implicitly formed with other.

fn best_first_search<N, BFS>( &self, visitor: &mut BFS ) -> Option<(Self::Node, <BFS as BestFirstVisitor<N, T, BV>>::Result)>where N: RealField + Copy, BFS: BestFirstVisitor<N, T, BV>,

Performs a best-first-search on the BVH.

impl<N, T, BV> Clone for DBVT<N, T, BV>where N: Clone + RealField + Copy, T: Clone, BV: Clone,

fn clone(&self) -> DBVT<N, T, BV>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N, T, BV> Index<DBVTLeafId> for DBVT<N, T, BV>where N: RealField + Copy,

type Output = DBVTLeaf<N, T, BV>

The returned type after indexing.

fn index(&self, _: DBVTLeafId) -> &<DBVT<N, T, BV> as Index<DBVTLeafId>>::Output

Performs the indexing (container[index]) operation.