[−][src]Struct acap::kd::FlatKdTree
A k-d tree stored as a flat array.
A FlatKdTree is always balanced and usually more efficient than a KdTree
, but doesn't
support dynamic updates.
Implementations
impl<T: Coordinates> FlatKdTree<T>
[src]
pub fn balanced<I: IntoIterator<Item = T>>(items: I) -> Self
[src]
Create a balanced tree out of a sequence of items.
Trait Implementations
impl<T: Debug> Debug for FlatKdTree<T>
[src]
impl<K, V> ExactNeighbors<K, V> for FlatKdTree<V> where
K: KdMetric<V>,
V: Coordinates,
[src]
K: KdMetric<V>,
V: Coordinates,
impl<T: Coordinates> FromIterator<T> for FlatKdTree<T>
[src]
fn from_iter<I: IntoIterator<Item = T>>(items: I) -> Self
[src]
impl<T> IntoIterator for FlatKdTree<T>
[src]
type Item = T
The type of the elements being iterated over.
type IntoIter = FlatIntoIter<T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<K, V> NearestNeighbors<K, V> for FlatKdTree<V> where
K: KdProximity<V>,
V: Coordinates,
[src]
K: KdProximity<V>,
V: Coordinates,
fn search<'k, 'v, N>(&'v self, neighborhood: N) -> N where
K: 'k,
V: 'v,
N: Neighborhood<&'k K, &'v V>,
[src]
K: 'k,
V: 'v,
N: Neighborhood<&'k K, &'v V>,
fn nearest(&self, target: &K) -> Option<Neighbor<&V, K::Distance>>
[src]
fn nearest_within<D>(
&self,
target: &K,
threshold: D
) -> Option<Neighbor<&V, K::Distance>> where
D: TryInto<K::Distance>,
[src]
&self,
target: &K,
threshold: D
) -> Option<Neighbor<&V, K::Distance>> where
D: TryInto<K::Distance>,
fn k_nearest(&self, target: &K, k: usize) -> Vec<Neighbor<&V, K::Distance>>
[src]
fn k_nearest_within<D>(
&self,
target: &K,
k: usize,
threshold: D
) -> Vec<Neighbor<&V, K::Distance>> where
D: TryInto<K::Distance>,
[src]
&self,
target: &K,
k: usize,
threshold: D
) -> Vec<Neighbor<&V, K::Distance>> where
D: TryInto<K::Distance>,
Auto Trait Implementations
impl<T> RefUnwindSafe for FlatKdTree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for FlatKdTree<T> where
T: Send,
T: Send,
impl<T> Sync for FlatKdTree<T> where
T: Sync,
T: Sync,
impl<T> Unpin for FlatKdTree<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for FlatKdTree<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,