Struct bktree::BkTree

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

A BK-tree datastructure

Implementations

impl<T> BkTree<T>

pub fn new(dist: impl Fn(&T, &T) -> isize + 'static) -> Self

Create a new BK-tree with a given distance function

pub fn insert_all<I: IntoIterator<Item = T>>(&mut self, iter: I)

Insert every element from a given iterator in the BK-tree

pub fn insert(&mut self, val: T)

Insert a new element in the BK-tree

pub fn find(&self, val: T, max_dist: isize) -> Vec<(&T, isize)>

Find the closest elements to a given value present in the BK-tree

Returns pairs of element references and distances

pub fn into_iter(self) -> IntoIter<T>

Convert the BK-tree into an iterator over its elements, in no particular order

pub fn iter(&self) -> Iter<'_, T>

Create an iterator over references of BK-tree elements, in no particular order

Trait Implementations

impl<T> IntoIterator for BkTree<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.