Struct acap::kd::KdTree

pub struct KdTree<T> { /* fields omitted */ }

A k-d tree.

Implementations

impl<T: Coordinates> KdTree<T>

pub fn new() -> Self

Create an empty tree.

pub fn balanced<I: IntoIterator<Item = T>>(items: I) -> Self

Create a balanced tree out of a sequence of items.

pub fn balance(&mut self)

Rebalance this k-d tree.

pub fn push(&mut self, item: T)

Push a new item into the tree.

Inserting elements individually tends to unbalance the tree. Use KdTree::balanced() if possible to create a balanced tree from a batch of items.

Trait Implementations

impl<T: Debug> Debug for KdTree<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: Coordinates> Default for KdTree<T>

fn default() -> Self

Returns the "default value" for a type.

impl<K, V> ExactNeighbors<K, V> for KdTree<V> where
    K: KdMetric<V>,
    V: Coordinates, 

impl<T: Coordinates> Extend<T> for KdTree<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, items: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T: Coordinates> FromIterator<T> for KdTree<T>

fn from_iter<I: IntoIterator<Item = T>>(items: I) -> Self

Creates a value from an iterator.

impl<T> IntoIterator for KdTree<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V> NearestNeighbors<K, V> for KdTree<V> where
    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>, 

Search for nearest neighbors and add them to a neighborhood.

fn nearest(&self, target: &K) -> Option<Neighbor<&V, K::Distance>>

Returns the nearest neighbor to target (or None if this index is empty).

fn nearest_within<D>(
    &self,
    target: &K,
    threshold: D
) -> Option<Neighbor<&V, K::Distance>> where
    D: TryInto<K::Distance>, 

Returns the nearest neighbor to target within the distance threshold, if one exists.

fn k_nearest(&self, target: &K, k: usize) -> Vec<Neighbor<&V, K::Distance>>

Returns the up to k nearest neighbors to target.

fn k_nearest_within<D>(
    &self,
    target: &K,
    k: usize,
    threshold: D
) -> Vec<Neighbor<&V, K::Distance>> where
    D: TryInto<K::Distance>, 

Returns the up to k nearest neighbors to target within the distance threshold.