Struct TreeInner 

pub struct TreeInner<N, S> { /* private fields */ }

The main tree struct

Implementations

impl<'a, T: Aabb> TreeInner<Node<'a, T>, DefaultSorter>

pub fn assert_tree_invariants(&self)

where T::Num: Debug,

panics if a broken broccoli tree invariant is detected. For debugging purposes only.

impl<N, Y> TreeInner<N, Y>

pub fn into_sorter<X>(self) -> TreeInner<N, X>

where X: From<Y>,

impl<'a, T: Aabb + 'a, S: Sorter<T>> TreeInner<Node<'a, T>, S>

pub fn into_node_data_tree(self) -> TreeInner<NodeData<T::Num>, S>

impl<S, H: HasElem> TreeInner<H, S>

pub fn iter_mut(&mut self) -> impl Iterator<Item = AabbPin<&mut H::T>>

impl<S, H> TreeInner<H, S>

pub fn node_map<K>(self, func: impl FnMut(H) -> K) -> TreeInner<K, S>

pub fn num_levels(&self) -> usize

pub fn into_nodes(self) -> Vec<H>

pub fn num_nodes(&self) -> usize

pub fn total_num_elem(&self) -> usize

pub fn get_nodes(&self) -> &[H]

pub fn get_nodes_mut(&mut self) -> AabbPin<&mut [H]>

pub fn vistr_mut(&mut self) -> VistrMutPin<'_, H>

pub fn vistr_mut_raw(&mut self) -> VistrMut<'_, H, PreOrder>

pub fn vistr(&self) -> Vistr<'_, H>

pub fn sorter(&self) -> S

where S: Copy,

impl<N: Num, S> TreeInner<NodeData<N>, S>

pub fn into_tree<T: Aabb<Num = N>>( self, bots: AabbPin<&mut [T]>, ) -> TreeInner<Node<'_, T>, S>

Trait Implementations

impl<N: Clone, S: Clone> Clone for TreeInner<N, S>

fn clone(&self) -> TreeInner<N, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.