Package org.tinspin.index.covertree

Class CoverTreeQueryKnn<T>

java.lang.Object

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

Type Parameters:

T - Type

All Implemented Interfaces:

Iterator<Index.PointEntryKnn<T>>, Index.PointIteratorKnn<T>, Index.QueryIteratorKnn<Index.PointEntryKnn<T>>

public class CoverTreeQueryKnn<T>
extends Object
implements Index.PointIteratorKnn<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	Description
CoverTreeQueryKnn(CoverTree<T> tree, double[] center, int k, PointDistance dist)

Method Summary

Modifier and Type	Method	Description
boolean	hasNext()
Index.PointEntryKnn<T>	next()
CoverTreeQueryKnn<T>	reset(double[] center, int k)
void	reset(double[] center, int k, PointDistance 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,
                         PointDistance dist)

Method Detail

reset

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

Specified by:

reset in interface Index.QueryIteratorKnn<T>

reset

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

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<T>

next

public Index.PointEntryKnn<T> next()

Specified by:

next in interface Iterator<T>