pub type Tree<'a, T> = TreeInner<Node<'a, T>, DefaultSorter>;
Expand description
TreeInner
type with default node and sorter.
Trait Implementations
sourceimpl<'a, T: Aabb> KnearestApi<T> for Tree<'a, T>
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>
sourcefn k_nearest_mut_aabb(
&mut self,
point: Vec2<T::Num>,
num: usize
) -> KResult<'_, T> where
T::Num: Signed + Zero,
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>
sourceimpl<'a, T: Aabb> RaycastApi<T> for Tree<'a, T>
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>>
sourcefn raycast_mut_aabb(
&mut self,
ray: Ray<T::Num>
) -> CastResult<CastAnswer<'_, T>> where
T::Num: Debug + Signed,
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