Struct VpTree 

pub struct VpTree { /* private fields */ }

Vantage-point tree for approximate nearest-neighbor search.

Implementations

impl VpTree

pub fn new() -> Self

Create an empty VP-tree.

pub fn build(entries: Vec<(String, Vec<f32>)>) -> Self

Build a VP-tree from a list of (id, embedding) pairs.

pub fn query(&self, point: &[f32], k: usize) -> Vec<KnnResult>

Query the tree for the k nearest neighbors to point.

Returns a list of (id, distance) pairs sorted by ascending distance.

pub fn len(&self) -> usize

Number of embeddings in the tree.

pub fn is_empty(&self) -> bool

Whether the tree is empty.

Trait Implementations

impl Clone for VpTree

fn clone(&self) -> VpTree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for VpTree

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

Formats the value using the given formatter.

impl Default for VpTree

fn default() -> Self

Returns the “default value” for a type.