Enum ncollide3d::partitioning::BVHImpl [−][src]
pub enum BVHImpl<'a, N: 'a + RealField, T: 'a, BV: 'a> { BVT(&'a BVT<T, BV>), DBVT(&'a DBVT<N, T, BV>), }
An enum grouping references to all the BVH implementations on ncollide.
Variants
BVT(&'a BVT<T, BV>)
A static binary bounding volume tree.
DBVT(&'a DBVT<N, T, BV>)
A dynamic binary bounding volume tree.
Implementations
impl<'a, N: RealField, T, BV> BVHImpl<'a, N, T, BV>
[src]
impl<'a, N: RealField, T, BV> BVHImpl<'a, N, T, BV>
[src]pub fn unwrap_bvt(self) -> &'a BVT<T, BV>
[src]
Gets the underlying reference to a BVT, or panics if this is not a BVTImpl::BVT
.
pub fn unwrap_dbvt(self) -> &'a DBVT<N, T, BV>
[src]
Gets the underlying reference to a DBVT, or panics if this is not a BVTImpl::DBVT
.
pub fn visit(self, visitor: &mut impl Visitor<T, BV>)
[src]
Traverses this tree using a visitor.
pub fn visit_bvtt(
self,
other: BVHImpl<'_, N, T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
[src]
self,
other: BVHImpl<'_, N, T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
Visits the bounding volume traversal tree implicitly formed with other
.
pub fn best_first_search<BFS>(
self,
visitor: &mut BFS
) -> Option<(BVHNodeId, BFS::Result)> where
BFS: BestFirstVisitor<N, T, BV>,
[src]
self,
visitor: &mut BFS
) -> Option<(BVHNodeId, BFS::Result)> where
BFS: BestFirstVisitor<N, T, BV>,
Performs a best-fist-search on the tree.
Returns the content of the leaf with the smallest associated cost, and a result of user-defined type.
Trait Implementations
impl<'a, N: Clone + 'a + RealField, T: Clone + 'a, BV: Clone + 'a> Clone for BVHImpl<'a, N, T, BV>
[src]
impl<'a, N: Clone + 'a + RealField, T: Clone + 'a, BV: Clone + 'a> Clone for BVHImpl<'a, N, T, BV>
[src]impl<'a, N: Copy + 'a + RealField, T: Copy + 'a, BV: Copy + 'a> Copy for BVHImpl<'a, N, T, BV>
[src]
Auto Trait Implementations
impl<'a, N, T, BV> RefUnwindSafe for BVHImpl<'a, N, T, BV> where
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, N, T, BV> Send for BVHImpl<'a, N, T, BV> where
BV: Sync,
T: Sync,
BV: Sync,
T: Sync,
impl<'a, N, T, BV> Sync for BVHImpl<'a, N, T, BV> where
BV: Sync,
T: Sync,
BV: Sync,
T: Sync,
impl<'a, N, T, BV> Unpin for BVHImpl<'a, N, T, BV>
impl<'a, N, T, BV> UnwindSafe for BVHImpl<'a, N, T, BV> where
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
BV: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
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]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<T> Slottable for T where
T: Copy,
[src]
T: Copy,