Struct broccoli::container::TreeIndBase

pub struct TreeIndBase<'a, N: Num, T> { /* fields omitted */ }

This is a Vec<BBox<N,&'a mut T>> under the hood with the added guarentee that all the &'a mut T point to the same slice.

From this struct a user can create a TreeInd.

Implementations

impl<'a, N: Num, T> TreeIndBase<'a, N, T>

pub fn new(
    bots: &'a mut [T],
    mut func: impl FnMut(&mut T) -> Rect<N>
) -> TreeIndBase<'a, N, T>

Create a TreeIndBase.

Examples

 let mut aabbs = [
    broccoli::bbox(broccoli::rect(0isize, 10, 0, 10), 0),
 ];

 let mut base=broccoli::container::TreeIndBase::new(&mut aabbs,|a|a.rect); 
 let mut tree = base.build();

pub fn into_inner(self) -> Box<[BBox<N, &'a mut T>]>

Extra the internals of a TreeIndBase.

Examples

 let mut aabbs = [
    broccoli::bbox(broccoli::rect(0isize, 10, 0, 10), 0),
 ];

 let mut base=broccoli::container::TreeIndBase::new(&mut aabbs,|a|a.rect); 
 let mut inner=base.into_inner();
 let mut tree = broccoli::new(&mut inner);
 //We can make a tree using the internals, but we lost the guarentee
 //that all the `&'a mut T` belong to the same slice.

pub fn build<'b>(&'b mut self) -> TreeInd<'a, 'b, N, T>

Build a TreeInd.

Examples

 let mut aabbs = [
    broccoli::bbox(broccoli::rect(0isize, 10, 0, 10), 0),
 ];

 let mut base=broccoli::container::TreeIndBase::new(&mut aabbs,|a|a.rect); 
 let mut tree = base.build();

pub fn build_par<'b>(
    &'b mut self,
    joiner: impl Joinable
) -> TreeInd<'a, 'b, N, T> where
    N: Send + Sync,
    T: Send + Sync, 

Build a TreeInd.

Examples

 let mut aabbs = [
    broccoli::bbox(broccoli::rect(0isize, 10, 0, 10), 0),
 ];

 let mut base=broccoli::container::TreeIndBase::new(&mut aabbs,|a|a.rect); 
 let mut tree = base.build_par(broccoli::RayonJoin);