vpsearch 2.1.0

Vantage Point Tree search algorithm for fast nearest neighbour search in multi-dimensional metric spaces.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

use super::{Tree, MetricSpace, Node, NO_NODE};

use std::fmt::{Debug,Formatter,Error};
impl<Item: Debug + Clone + MetricSpace<UserImpl>, UserImpl, Ownership> Debug for Tree<Item, UserImpl, Ownership> {
    fn fmt(&self, f:&mut Formatter<'_>) -> Result<(),Error> {
        write!(f, "digraph \"vp tree.dot\" {{\n{:?}}}", self.root)
    }
}

impl<Item: Debug + Clone + MetricSpace<UserImpl>, UserImpl> Debug for Node<Item, UserImpl> {
    fn fmt(&self, f:&mut Formatter<'_>) -> Result<(),Error> {
        if self.near != NO_NODE {
            writeln!(f, "\"{:?}\" -> \"{:?}\"", self.vantage_point, self.near)?;
        }
        if self.far != NO_NODE {
            writeln!(f, "\"{:?}\" -> \"{:?}\"", self.vantage_point, self.far)?;
        }
        Ok(())
    }
}