Struct parry3d_f64::partitioning::QBVH [−][src]
pub struct QBVH<T> { /* fields omitted */ }
Expand description
A quaternary bounding-volume-hierarchy.
This is a bounding-volume-hierarchy where each node has either four children or none.
Implementations
impl<T: IndexedData> QBVH<T>
[src]
impl<T: IndexedData> QBVH<T>
[src]pub fn leaf_data(&mut self, node_id: NodeIndex) -> Option<T>
[src]
pub fn leaf_data(&mut self, node_id: NodeIndex) -> Option<T>
[src]Returns the data associated to a given leaf.
Returns None
if the provided node ID does not identify a leaf.
pub fn clear_and_rebuild(
&mut self,
data_gen: impl QBVHDataGenerator<T>,
dilation_factor: Real
)
[src]
pub fn clear_and_rebuild(
&mut self,
data_gen: impl QBVHDataGenerator<T>,
dilation_factor: Real
)
[src]Clears this quad-tree and rebuilds it from a new set of data and AABBs.
pub fn pre_update(&mut self, data: T)
[src]
pub fn pre_update(&mut self, data: T)
[src]Marks a piece of data as dirty so it can be updated during the next
call to self.update
.
pub fn update<F>(&mut self, aabb_builder: F, dilation_factor: Real) where
F: Fn(&T) -> AABB,
[src]
pub fn update<F>(&mut self, aabb_builder: F, dilation_factor: Real) where
F: Fn(&T) -> AABB,
[src]Update all the nodes that have been marked as dirty by self.pre_update
.
pub fn intersect_aabb(&self, aabb: &AABB, out: &mut Vec<T>)
[src]
pub fn intersect_aabb(&self, aabb: &AABB, out: &mut Vec<T>)
[src]Retrieve all the data of the nodes with AABBs intersecting the given AABB:
pub fn traverse_depth_first(&self, visitor: &mut impl SimdVisitor<T, SimdAABB>)
[src]
pub fn traverse_depth_first(&self, visitor: &mut impl SimdVisitor<T, SimdAABB>)
[src]Performs a depth-first traversal on the BVH.
pub fn traverse_depth_first_with_stack(
&self,
visitor: &mut impl SimdVisitor<T, SimdAABB>,
stack: &mut Vec<u32>
)
[src]
pub fn traverse_depth_first_with_stack(
&self,
visitor: &mut impl SimdVisitor<T, SimdAABB>,
stack: &mut Vec<u32>
)
[src]Performs a depth-first traversal on the BVH.
pub fn traverse_best_first<BFS>(
&self,
visitor: &mut BFS
) -> Option<(NodeIndex, BFS::Result)> where
BFS: SimdBestFirstVisitor<T, SimdAABB>,
BFS::Result: Clone,
[src]
pub fn traverse_best_first<BFS>(
&self,
visitor: &mut BFS
) -> Option<(NodeIndex, BFS::Result)> where
BFS: SimdBestFirstVisitor<T, SimdAABB>,
BFS::Result: Clone,
[src]Performs a best-first-search on the BVH.
Returns the content of the leaf with the smallest associated cost, and a result of user-defined type.
Trait Implementations
Auto Trait Implementations
impl<T> RefUnwindSafe for QBVH<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for QBVH<T> where
T: Send,
T: Send,
impl<T> Sync for QBVH<T> where
T: Sync,
T: Sync,
impl<T> Unpin for QBVH<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for QBVH<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
[src]
impl<T> Downcast for T where
T: Any,
[src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[src]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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
[src]Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]
pub fn as_any(&self) -> &(dyn Any + 'static)
[src]Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
[src]Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
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 to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more