org.tinspin.index.rtree

Class RTreeQueryKnn<T>

java.lang.Object

org.tinspin.index.rtree.RTreeQueryKnn<T>

Type Parameters:

T -

All Implemented Interfaces:

Iterator<RectangleEntryDist<T>>, QueryIteratorKNN<RectangleEntryDist<T>>

public class RTreeQueryKnn<T>
extends Object
implements QueryIteratorKNN<RectangleEntryDist<T>>

kNN search with EDGE distance and presorting of entries.

Author:

Tilmann Zäschke

Constructor Summary

Constructors

Constructor and Description
RTreeQueryKnn(RTree<T> tree, double[] center, int k, DistanceFunction dist)

Method Summary

Modifier and Type	Method and Description
boolean	hasNext()
DistEntry<T>	next()
void	reset(double[] center, int k)
void	reset(double[] center, int k, DistanceFunction 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

RTreeQueryKnn

public RTreeQueryKnn(RTree<T> tree,
                     double[] center,
                     int k,
                     DistanceFunction dist)

Method Detail

reset

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

Specified by:

reset in interface QueryIteratorKNN<RectangleEntryDist<T>>

reset

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

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<RectangleEntryDist<T>>

next

public DistEntry<T> next()

Specified by:

next in interface Iterator<RectangleEntryDist<T>>