Struct acap::vp::VpTree [−][src]
pub struct VpTree<T: Proximity> { /* fields omitted */ }
Expand description
Implementations
Create a balanced tree out of a sequence of items.
Iterate over the items stored in this tree.
Push a new item into the tree.
Inserting elements individually tends to unbalance the tree. Use VpTree::balanced if possible to create a balanced tree from a batch of items.
Trait Implementations
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Creates a value from an iterator. Read more
fn search<'k, 'v, N>(&'v self, neighborhood: N) -> N where
K: 'k,
V: 'v,
N: Neighborhood<&'k K, &'v V>,
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.
Returns the nearest neighbor to target
(or None
if this index is empty).
Returns the nearest neighbor to target
within the distance threshold
, if one exists.
Returns the up to k
nearest neighbors to target
. Read more
Returns the up to k
nearest neighbors to target
within the distance threshold
. Read more
Merges up to k
nearest neighbors into an existing sorted vector.