Library
Module
Module type
Parameter
Class
Class type
Quality of the constructed tree. Tree construction takes more time with higher quality. Tree query time takes less time with higher tree quality. If you have 100k or more points, use a Good or Random tree.
create quality points
create a vantage point tree of given quality containing all points.
nearest_neighbor p vpt
return the distance along with the nearest neighbor to query point p
in vpt
. Warning: there may be several points at this distance from p
in vpt
, but a single (arbitrary) one is returned.
neighbors p tol vpt
return all points in vpt
within tol
distance from query point p
. I.e. all points returned are within (d <= tol)
distance from p
.
val is_empty : t -> bool
is_empty vpt
test if vpt
is empty.
mem query tree
return true if query
can be found in tree
; false otherwise.
val check : t -> bool
check tree
test the tree invariant. Should always be true. If invariant doesn't hold, then this library has a bug.