org.tinspin.index.rtree

Class RTreeQueryKnnOld<T>

java.lang.Object

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

Type Parameters:

T - Value type.

All Implemented Interfaces:

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

public class RTreeQueryKnnOld<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
RTreeQueryKnnOld(RTree<T> tree, double[] center, int k, RectangleDistanceFunction dist)

Method Summary

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

RTreeQueryKnnOld

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

Method Detail

reset

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

Specified by:

reset in interface QueryIteratorKNN<RectangleEntryDist<T>>

reset

public void reset(double[] center,
                  int k,
                  RectangleDistanceFunction 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>>