Struct kdvtree::KdvTree

pub struct KdvTree<A, P, B, S> { /* fields omitted */ }

Methods

impl<A, P, B, S> KdvTree<A, P, B, S> where
    A: Axis<P>,
    B: BoundingVolume<Point = P>, 

pub fn build<IA, II, M>(
    axis_it: IA,
    shapes_it: II,
    manager: &mut M
) -> Result<KdvTree<A, P, B, S>, M::Error> where
    IA: IntoIterator<Item = A>,
    II: IntoIterator<Item = S>,
    M: VolumeManager<S, A, BoundingVolume = B>, 

Important traits for IntersectIter<'t, 's, 'm, A, P, SS, BS, SN, BN, M>

impl<'t, 's, 'm, A, P, SS, BS, SN, BN, M> Iterator for IntersectIter<'t, 's, 'm, A, P, SS, BS, SN, BN, M> where
    A: Axis<P>,
    BS: BoundingVolume<Point = P>,
    BN: BoundingVolume<Point = BS::Point> + Clone,
    M: VolumeManager<SN, A, BoundingVolume = BN>,  type Item = Result<Intersection<'t, SS, BS, BN>, M::Error>;

pub fn intersects<'t, 's, 'm, SN, M>(
    &'t self,
    shape: &'s SN,
    manager: &'m mut M
) -> IntersectIter<'t, 's, 'm, A, P, S, B, SN, M::BoundingVolume, M> where
    M: VolumeManager<SN, A>, 

Trait Implementations