Struct broccoli::queries::knearest::KnearestClosure

pub struct KnearestClosure<B, C, D, E> {
    pub broad: B,
    pub fine: C,
    pub xline: D,
    pub yline: E,
}

Construct an object that implements Knearest from closures. We pass the tree so that we can infer the type of T.

fine is a function that gives the true distance between the point and the specified tree element.

broad is a function that gives the distance between the point and the closest point of a axis aligned rectangle. This function is used as a conservative estimate to prune out elements which minimizes how often the fine function gets called.

xline is a function that gives the distance between the point and a axis aligned line that was a fixed x value and spans the y values.

yline is a function that gives the distance between the point and a axis aligned line that was a fixed x value and spans the y values.

acc is a user defined object that is passed to every call to either the fine or broad functions.

Container of closures that implements Knearest

Fields

broad: B

fine: C

xline: D

yline: E

Trait Implementations

impl<'a, T: Aabb, B, C, D, E> Knearest<T> for KnearestClosure<B, C, D, E> where
    B: FnMut(Vec2<T::Num>, AabbPin<&mut T>) -> Option<T::Num>,
    C: FnMut(Vec2<T::Num>, AabbPin<&mut T>) -> T::Num,
    D: FnMut(Vec2<T::Num>, T::Num) -> T::Num,
    E: FnMut(Vec2<T::Num>, T::Num) -> T::Num, 

fn distance_to_aaline<A: Axis>(
    &mut self,
    point: Vec2<T::Num>,
    axis: A,
    val: T::Num
) -> T::Num

User define distance function from a point to an axis aligned line of infinite length.

fn distance_to_broad(
    &mut self,
    point: Vec2<T::Num>,
    rect: AabbPin<&mut T>
) -> Option<T::Num>

User defined inexpensive distance function that that can be overly conservative. It may be that the precise distance function is fast enough, in which case you can simply return None. If None is desired, every call to this function for a particular element must always return None.

fn distance_to_fine(
    &mut self,
    point: Vec2<T::Num>,
    bot: AabbPin<&mut T>
) -> T::Num

User defined expensive distance function. Here the user can return fine-grained distance of the shape contained in T instead of its bounding box.