Type Definition broccoli::tree::Tree

pub type Tree<'a, T> = TreeInner<Node<'a, T>, DefaultSorter>;

TreeInner type with default node and sorter.

Implementations

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

pub fn assert_tree_invariants(&self) where
    T::Num: Debug, 

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

Trait Implementations

impl<'a, T: Aabb> KnearestApi<T> for Tree<'a, T>

fn k_nearest_mut(
    &mut self,
    point: Vec2<T::Num>,
    num: usize,
    ktrait: impl Knearest<T>
) -> KResult<'_, T>

fn k_nearest_mut_aabb(
    &mut self,
    point: Vec2<T::Num>,
    num: usize
) -> KResult<'_, T> where
    T::Num: Signed + Zero, 

Find knearest using aabb only.

fn k_nearest_mut_closure(
    &mut self,
    point: Vec2<T::Num>,
    num: usize,
    broad: impl FnMut(Vec2<T::Num>, AabbPin<&mut T>) -> Option<T::Num>,
    fine: impl FnMut(Vec2<T::Num>, AabbPin<&mut T>) -> T::Num,
    xline: impl FnMut(Vec2<T::Num>, T::Num) -> T::Num,
    yline: impl FnMut(Vec2<T::Num>, T::Num) -> T::Num
) -> KResult<'_, T>

impl<'a, N: Nbody> NbodyApi<N> for Tree<'a, N::T>

fn nbody(self, no: &mut N) -> Self

impl<'a, T: Aabb> RaycastApi<T> for Tree<'a, T>

fn raycast_mut<R: RayCast<T>>(
    &mut self,
    ray: Ray<T::Num>,
    rtrait: R
) -> CastResult<CastAnswer<'_, T>>

fn raycast_mut_aabb(
    &mut self,
    ray: Ray<T::Num>
) -> CastResult<CastAnswer<'_, T>> where
    T::Num: Debug + Signed, 

Create a handler that just casts directly to the axis aligned rectangle

fn raycast_mut_closure(
    &mut self,
    ray: Ray<T::Num>,
    broad: impl FnMut(&Ray<T::Num>, AabbPin<&mut T>) -> Option<CastResult<T::Num>>,
    fine: impl FnMut(&Ray<T::Num>, AabbPin<&mut T>) -> CastResult<T::Num>,
    xline: impl FnMut(&Ray<T::Num>, T::Num) -> CastResult<T::Num>,
    yline: impl FnMut(&Ray<T::Num>, T::Num) -> CastResult<T::Num>
) -> CastResult<CastAnswer<'_, T>>

impl<'a, 'b, T: Aabb> RectApi<'b, T> for &'b mut Tree<'a, T>

fn for_all_not_in_rect_mut<K: Aabb<Num = T::Num>>(
    self,
    rect: AabbPin<&mut K>,
    closure: impl FnMut(AabbPin<&mut K>, AabbPin<&'b mut T>)
)

fn for_all_in_rect_mut<K: Aabb<Num = T::Num>>(
    self,
    rect: AabbPin<&mut K>,
    closure: impl FnMut(AabbPin<&mut K>, AabbPin<&'b mut T>)
)

fn for_all_intersect_rect_mut<K: Aabb<Num = T::Num>>(
    self,
    rect: AabbPin<&mut K>,
    closure: impl FnMut(AabbPin<&mut K>, AabbPin<&'b mut T>)
)