Struct kdvtree::KdvTree

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

Methods

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

pub fn build<IA, II, CMF, BVF, CPF, CBF>(     axis_it: IA,     shapes_it: II,     cmp_p: CMF,     get_bv: BVF,     get_cp: CPF,     cut_bv: CBF ) -> Result<KdvTree<A, P, B, S>, CBF::Error> where     IA: IntoIterator<Item = A>,     II: IntoIterator<Item = S>,     CMF: CmpPoints<A, P>,     BVF: GetBoundingVolume<B, S>,     CPF: GetCutPoint<A, P>,     CBF: BoundingVolumesCutter<A, P, B, S>,

Important traits for IntersectIter<'t, 's, A, P, SS, BS, SN, BN, CMF, CPF, CBF>

impl<'t, 's, A, P, SS, BS, SN, BN, CMF, CPF, CBF> Iterator for IntersectIter<'t, 's, A, P, SS, BS, SN, BN, CMF, CPF, CBF> where
    BS: BoundingVolume<P>,
    BN: BoundingVolume<P> + Clone,
    CMF: CmpPoints<A, P>,
    CPF: GetCutPoint<A, P>,
    CBF: BoundingVolumesCutter<A, P, BN, SN>,  type Item = Result<Intersection<'t, SS, BS, BN>, CBF::Error>;

pub fn intersects<'t, 's, SN, BN, CMF, BVF, CPF, CBF>(     &'t self,     shape: &'s SN,     cmp_p: CMF,     get_bv: BVF,     get_cp: CPF,     cut_bv: CBF ) -> IntersectIter<'t, 's, A, P, S, B, SN, BN, CMF, CPF, CBF> where     CMF: CmpPoints<A, P>,     BVF: GetBoundingVolume<BN, SN>,     CPF: GetCutPoint<A, P>,     CBF: BoundingVolumesCutter<A, P, BN, SN>,

Important traits for NearestIter<'t, 's, A, P, S, B, SN, BN, D, CMF, CBF, DPF, DVF>

impl<'t, 's, A, P, S, B, SN, BN, D, CMF, CBF, DPF, DVF> Iterator for NearestIter<'t, 's, A, P, S, B, SN, BN, D, CMF, CBF, DPF, DVF> where
    B: BoundingVolume<P>,
    BN: BoundingVolume<P> + Clone,
    D: PartialEq + PartialOrd,
    CMF: CmpPoints<A, P>,
    CBF: BoundingVolumesCutter<A, P, BN, SN>,
    DPF: DistanceBVCP<A, P, BN, Dist = D>,
    DVF: DistanceBVBV<B, BN, Dist = D>,  type Item = Result<NearestShape<'t, B, S, D>, CBF::Error>;

pub fn nearest<'t, 's, SN, BN, D, CMF, BVF, CBF, DPF, DVF>(     &'t self,     shape: &'s SN,     cmp_p: CMF,     get_bv: BVF,     cut_bv: CBF,     dist_cp: DPF,     dist_bv: DVF ) -> NearestIter<'t, 's, A, P, S, B, SN, BN, D, CMF, CBF, DPF, DVF> where     CMF: CmpPoints<A, P>,     BVF: GetBoundingVolume<BN, SN>,     CBF: BoundingVolumesCutter<A, P, BN, SN>,     DPF: DistanceBVCP<A, P, BN, Dist = D>,     DVF: DistanceBVBV<B, BN, Dist = D>,     D: PartialEq + PartialOrd,

Important traits for Iter<'t, P, B, S>

impl<'t, P, B, S> Iterator for Iter<'t, P, B, S> type Item = KdvNodeRef<'t, B, S>;

pub fn iter<'t>(&'t self) -> Iter<'t, P, B, S>