org.tinspin.index.covertree

Class CoverTreeQueryKnn<T>

java.lang.Object

org.tinspin.index.covertree.CoverTreeQueryKnn<T>

Type Parameters:

T - Type

All Implemented Interfaces:

Iterator<PointEntryDist<T>>, QueryIteratorKNN<PointEntryDist<T>>

public class CoverTreeQueryKnn<T>
extends Object
implements QueryIteratorKNN<PointEntryDist<T>>

kNN search. Implementation after Hjaltason and Samet. G. R. Hjaltason and H. Samet., "Distance browsing in spatial databases.", ACM TODS 24(2):265--318. 1999

Author:

Tilmann Zäschke

Constructor Summary

Constructors

Constructor and Description
CoverTreeQueryKnn(CoverTree<T> tree, double[] center, int k, PointDistanceFunction dist)

Method Summary

Modifier and Type	Method and Description
boolean	hasNext()
PointDist<T>	next()
CoverTreeQueryKnn<T>	reset(double[] center, int k)
void	reset(double[] center, int k, PointDistanceFunction dist)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Iterator

forEachRemaining, remove

Constructor Detail

CoverTreeQueryKnn

public CoverTreeQueryKnn(CoverTree<T> tree,
                         double[] center,
                         int k,
                         PointDistanceFunction dist)

Method Detail

reset

public CoverTreeQueryKnn<T> reset(double[] center,
                                  int k)

Specified by:

reset in interface QueryIteratorKNN<PointEntryDist<T>>

reset

public void reset(double[] center,
                  int k,
                  PointDistanceFunction dist)

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<PointEntryDist<T>>

next

public PointDist<T> next()

Specified by:

next in interface Iterator<PointEntryDist<T>>