Struct broccoli::build::NotSorted

pub struct NotSorted<'a, T: Aabb>(pub Tree<'a, T>);

A version of Tree where the elements are not sorted along each axis, like a KD Tree. For comparison, a normal kd-tree is provided by NotSorted. In this tree, the elements are not sorted along an axis at each level. Construction of NotSorted is faster than Tree since it does not have to sort bots that belong to each node along an axis. But most query algorithms can usually take advantage of this extra property to be faster.

Implementations

impl<'a, T: Aabb> NotSorted<'a, T>

pub fn new(bots: &'a mut [T]) -> NotSorted<'a, T>

pub fn new_par(joiner: impl Joinable, bots: &'a mut [T]) -> NotSorted<'a, T> where
    T: Send + Sync,
    T::Num: Send + Sync, 

pub fn vistr_mut(&mut self) -> VistrMut<'_, Node<'a, T>>

pub fn vistr(&self) -> Vistr<'_, Node<'a, T>>

pub fn get_height(&self) -> usize

pub fn new_colfind_builder<'c>(&'c mut self) -> NotSortedQueryBuilder<'c, 'a, T>

pub fn find_colliding_pairs_mut(
    &mut self,
    func: impl FnMut(PMut<'_, T>, PMut<'_, T>)
)

pub fn find_colliding_pairs_mut_par(
    &mut self,
    joiner: impl Joinable,
    func: impl Fn(PMut<'_, T>, PMut<'_, T>) + Clone + Send + Sync
) where
    T: Send + Sync,
    T::Num: Send + Sync,