Struct broccoli::DinoTree

#[repr(transparent)]
pub struct DinoTree<'a, A: Axis, T: Aabb> { /* private fields */ }

The data structure this crate revoles around.

Implementations

impl<'a, T: Aabb> DinoTree<'a, DefaultA, T>

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

Examples

let mut bots = [axgeom::rect(0,10,0,10)];
let tree = dinotree_alg::DinoTree::new(&mut bots);

impl<'a, T: Aabb + Send + Sync> DinoTree<'a, DefaultA, T>

pub fn new_par(bots: &'a mut [T]) -> DinoTree<'a, DefaultA, T>

Examples

let mut bots = [axgeom::rect(0,10,0,10)];
let tree = dinotree_alg::DinoTree::new_par(&mut bots);

impl<'a, A: Axis, T: Aabb> DinoTree<'a, A, T>

pub fn with_axis(axis: A, bots: &'a mut [T]) -> DinoTree<'a, A, T>

Examples

let mut bots = [axgeom::rect(0,10,0,10)];
let tree = dinotree_alg::DinoTree::with_axis(axgeom::XAXIS,&mut bots);

impl<'a, A: Axis, T: Aabb + Send + Sync> DinoTree<'a, A, T>

pub fn with_axis_par(axis: A, bots: &'a mut [T]) -> DinoTree<'a, A, T>

Examples

let mut bots = [axgeom::rect(0,10,0,10)];
let tree = dinotree_alg::DinoTree::with_axis(axgeom::XAXIS,&mut bots);

impl<'a, 'b, A: Axis, N: Num, T> DinoTree<'a, A, BBox<N, &'b mut T>>

pub fn collect_intersections_list<'c, D: Send + Sync>(
    &mut self,
    func: impl FnMut(&mut T, &mut T) -> Option<D> + Send + Sync
) -> IntersectionList<'b, T, D>

impl<'a, A: Axis, T: Aabb> DinoTree<'a, A, T>

pub fn get_height(&self) -> usize

Examples

use dinotree_alg::*;
let mut bots = vec![axgeom::rect(0,10,0,10);400];
let mut tree = DinoTree::new(&mut bots);

assert_eq!(tree.get_height(),analyze::compute_tree_height_heuristic(400,analyze::DEFAULT_NUMBER_ELEM_PER_NODE));

pub fn num_nodes(&self) -> usize

Examples

use dinotree_alg::*;
let mut bots = vec![axgeom::rect(0,10,0,10);400];
let mut tree = DinoTree::new(&mut bots);

assert_eq!(tree.num_nodes(),analyze::nodes_left(0,tree.get_height() ));

Trait Implementations

impl<'a, A: Axis, T: Aabb> Queries<'a> for DinoTree<'a, A, T>

TODO use this insead

type A = A

type T = T

type Num = T::Num

fn axis(&self) -> Self::A

Examples

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

Examples

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

Examples

fn new_colfind_builder(
    &mut self
) -> QueryBuilder<'_, Self::A, NodeMut<'a, Self::T>>

fn draw_divider(
    &self,
    drawer: &mut impl DividerDrawer<N = Self::Num>,
    rect: &Rect<Self::Num>
)

Examples

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

Find all aabb intersections and return a PMut of it. Unlike the regular find_intersections_mut, this allows the user to access a read only reference of the AABB.

fn multi_rect(&mut self) -> MultiRectMut<'_, Self::A, NodeMut<'a, Self::T>>

Examples

fn for_all_intersect_rect<'b>(
    &'b self,
    rect: &Rect<Self::Num>,
    func: impl FnMut(&'b Self::T)
) where
    'a: 'b, 

Examples

fn for_all_in_rect<'b>(
    &'b self,
    rect: &Rect<Self::Num>,
    func: impl FnMut(&'b Self::T)
) where
    'a: 'b, 

Examples

fn nbody_mut<X: NodeMassTrait<Num = Self::Num, Item = Self::T> + Send + Sync>(
    &mut self,
    ncontext: &X,
    rect: Rect<Self::Num>
) where
    X::No: Send,
    Self::T: HasInner + Send + Sync, 

fn nbody_mut_par<X: NodeMassTrait<Num = Self::Num, Item = Self::T> + Sync + Send>(
    &mut self,
    ncontext: &X,
    rect: Rect<Self::Num>
) where
    X::No: Send,
    Self::T: HasInner + Send + Sync, 

impl<'a, A: Axis, T: Aabb + HasInner> QueriesInner<'a> for DinoTree<'a, A, T>

type Inner = T::Inner

fn find_intersections_mut(
    &mut self,
    func: impl FnMut(&mut Self::Inner, &mut Self::Inner)
)

Find all aabb intersections

fn find_intersections_mut_par(
    &mut self,
    func: impl Fn(&mut Self::Inner, &mut Self::Inner) + Clone + Send + Sync
) where
    Self::T: Send + Sync, 

Find all intersections in parallel

fn find_intersections_par_ext<B: Send + Sync>(
    &mut self,
    split: impl Fn(&mut B) -> B + Send + Sync + Copy,
    fold: impl Fn(&mut B, B) + Send + Sync + Copy,
    collision: impl Fn(&mut B, &mut Self::Inner, &mut Self::Inner) + Send + Sync + Copy,
    acc: B
) -> B where
    Self::T: Send + Sync, 

Allows the user to potentially collect some aspect of every intersection in parallel.

fn for_all_not_in_rect_mut<'b>(
    &'b mut self,
    rect: &Rect<Self::Num>,
    func: impl FnMut(&'b mut Self::Inner)
) where
    'a: 'b, 

Examples

fn for_all_intersect_rect_mut<'b>(
    &'b mut self,
    rect: &Rect<Self::Num>,
    func: impl FnMut(&'b mut Self::Inner)
) where
    'a: 'b, 

Examples

fn for_all_in_rect_mut<'b>(
    &'b mut self,
    rect: &Rect<Self::Num>,
    func: impl FnMut(&'b mut Self::Inner)
) where
    'a: 'b, 

Examples

fn raycast_mut<'b, Acc>(
    &'b mut self,
    ray: Ray<Self::Num>,
    start: &mut Acc,
    broad: impl FnMut(&mut Acc, &Ray<Self::Num>, &Rect<Self::Num>) -> CastResult<Self::Num>,
    fine: impl FnMut(&mut Acc, &Ray<Self::Num>, &Self::T) -> CastResult<Self::Num>,
    border: Rect<Self::Num>
) -> RayCastResult<'b, Self::Inner, Self::Num> where
    'a: 'b, 

Examples

fn k_nearest_mut<'b, Acc>(
    &'b mut self,
    point: Vec2<Self::Num>,
    num: usize,
    start: &mut Acc,
    broad: impl FnMut(&mut Acc, Vec2<Self::Num>, &Rect<Self::Num>) -> Self::Num,
    fine: impl FnMut(&mut Acc, Vec2<Self::Num>, &Self::T) -> Self::Num,
    border: Rect<Self::Num>
) -> Vec<KnearestResult<'b, Self::Inner, Self::Num>> where
    'a: 'b, 

Examples

fn intersect_with_mut<X: Aabb<Num = Self::Num> + HasInner>(
    &mut self,
    other: &mut [X],
    func: impl Fn(&mut Self::Inner, &mut X::Inner)
)

Examples