kiddo 5.0.3

A high-performance, flexible, ergonomic k-d tree library. Ideal for geo- and astro- nearest-neighbour and k-nearest-neighbor queries
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

//! Iterator object returned by within_unsorted_iter
use crate::nearest_neighbour::NearestNeighbour;
use generator::Generator;

/// Iterator object returned by within_unsorted_iter
pub struct WithinUnsortedIter<'a, A, T>(Generator<'a, (), NearestNeighbour<A, T>>);

impl<'a, A, T> WithinUnsortedIter<'a, A, T> {
    pub(crate) fn new(gen: Generator<'a, (), NearestNeighbour<A, T>>) -> Self {
        WithinUnsortedIter(gen)
    }
}

impl<A, T> Iterator for WithinUnsortedIter<'_, A, T> {
    type Item = NearestNeighbour<A, T>;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next()
    }
}