Struct broccoli::NotSortedTree
source · [−]pub struct NotSortedTree<'a, T: Aabb> { /* private fields */ }
Expand description
A tree where the elements in a node are not sorted.
Implementations
sourceimpl<'a, T: Aabb> NotSortedTree<'a, T>
impl<'a, T: Aabb> NotSortedTree<'a, T>
sourceimpl<T: Aabb> NotSortedTree<'_, T>
impl<T: Aabb> NotSortedTree<'_, T>
pub fn find_colliding_pairs_from_args<S: Splitter>(
&mut self,
args: QueryArgs<S>,
func: impl FnMut(AabbPin<&mut T>, AabbPin<&mut T>)
) -> S
pub fn par_find_colliding_pairs_from_args<S: Splitter, F>(
&mut self,
args: QueryArgs<S>,
func: F
) -> S where
F: FnMut(AabbPin<&mut T>, AabbPin<&mut T>),
F: Send + Clone,
S: Send,
T: Send,
T::Num: Send,
sourceimpl<'a, T: Aabb> NotSortedTree<'a, T>
impl<'a, T: Aabb> NotSortedTree<'a, T>
pub fn from_build_args<P: Splitter>(
bots: &'a mut [T],
args: BuildArgs<P>
) -> (Self, P) where
T: ManySwappable,
pub fn par_from_build_args<P: Splitter>(
bots: &'a mut [T],
args: BuildArgs<P>
) -> (Self, P) where
T: ManySwappable,
T: Send,
T::Num: Send,
P: Send,
pub fn new(bots: &'a mut [T]) -> Self where
T: ManySwappable,
pub fn par_new(bots: &'a mut [T]) -> Self where
T: ManySwappable,
T: Send,
T::Num: Send,
pub fn vistr_mut(&mut self) -> VistrMutPin<'_, Node<'a, T>>
pub fn vistr(&self) -> Vistr<'_, Node<'a, T>>
pub fn num_nodes(&self) -> usize
Auto Trait Implementations
impl<'a, T> RefUnwindSafe for NotSortedTree<'a, T> where
T: RefUnwindSafe,
<T as Aabb>::Num: RefUnwindSafe,
impl<'a, T> Send for NotSortedTree<'a, T> where
T: Send,
<T as Aabb>::Num: Send,
impl<'a, T> Sync for NotSortedTree<'a, T> where
T: Sync,
<T as Aabb>::Num: Sync,
impl<'a, T> Unpin for NotSortedTree<'a, T> where
<T as Aabb>::Num: Unpin,
impl<'a, T> !UnwindSafe for NotSortedTree<'a, T>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more