- <init>
default constructor.
- SWAP
Swap two nodes in a cover set.
- batch_insert
Creates a cover tree recursively using batch insert method.
- batch_nearest_neighbor
Performs k-NN search for a batch of queries provided in the form of a cover
tree. P.S.: Outside clas
- brute_nearest
Does a brute force NN search on the nodes in the given zero set. A zero set
might have some nodes ad
- checkMissing
Checks if there is any instance with missing values. Throws an exception if
there is, as KDTree does
- compare
Returns the difference of two given nodes distance to the query. It is used in
half-sorting a cover
- copy_cover_sets
Copies the contents of one set of cover sets to the other. It is required if we
are going to inspect
- copy_zero_set
Copies the contents of one zero set to the other. This is required if we are
going to inspect child
- descend
This functions adds nodes for inspection at the next level during NN search. The
internal nodes are
- dist_of_scale
Returns the distance/value of a given scale/level. I.e. the value of base^i
(e.g. 2^i).
- dist_split
Moves all the points in point_set covered by (the ball of) new_point into
new_point_set, based on th