org.tinspin.index.phtree

Class PHTreeR<T>

java.lang.Object

org.tinspin.index.phtree.PHTreeR<T>

All Implemented Interfaces:

Index<T>, RectangleIndex<T>

public class PHTreeR<T>
extends Object
implements RectangleIndex<T>

Method Summary

Modifier and Type	Method and Description
void	clear() Clear all entries.
static <T> PHTreeR<T>	createPHTree(int dims)
int	getDepth()
int	getDims()
int	getNodeCount()
Object	getStats()
void	insert(double[] lower, double[] upper, T value) Insert a rectangle.
QueryIterator<RectangleEntry<T>>	iterator()
T	queryExact(double[] lower, double[] upper) Lookup an entry, using exact match.
QueryIterator<RectangleEntry<T>>	queryIntersect(double[] min, double[] max)
QueryIteratorKNN<RectangleEntryDist<T>>	queryKNN(double[] center, int k) Finds the nearest neighbor.
T	remove(double[] lower, double[] upper) Remove an entry.
int	size()
String	toStringTree()
T	update(double[] lo1, double[] up1, double[] lo2, double[] up2) Update the position of an entry.

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.tinspin.index.RectangleIndex

query1NN

Method Detail

createPHTree

public static <T> PHTreeR<T> createPHTree(int dims)

getDims

public int getDims()

Specified by:

getDims in interface Index<T>

Returns:

the number of dimensions

size

public int size()

Specified by:

size in interface Index<T>

Returns:

the number of entries

clear

public void clear()

Description copied from interface: Index

Clear all entries.

Specified by:

clear in interface Index<T>

getStats

public Object getStats()

Specified by:

getStats in interface Index<T>

getNodeCount

public int getNodeCount()

Specified by:

getNodeCount in interface Index<T>

getDepth

public int getDepth()

Specified by:

getDepth in interface Index<T>

toStringTree

public String toStringTree()

Specified by:

toStringTree in interface Index<T>

Returns:

a full string output of the tree structure with all entries

insert

public void insert(double[] lower,
                   double[] upper,
                   T value)

Description copied from interface: RectangleIndex

Insert a rectangle.

Specified by:

insert in interface RectangleIndex<T>

Parameters:

lower - minimum corner

upper - maximum corner

value - value

remove

public T remove(double[] lower,
                double[] upper)

Description copied from interface: RectangleIndex

Remove an entry.

Specified by:

remove in interface RectangleIndex<T>

Parameters:

lower - minimum corner

upper - maximum corner

Returns:

the value of the entry or null if the entry was not found

update

public T update(double[] lo1,
                double[] up1,
                double[] lo2,
                double[] up2)

Description copied from interface: RectangleIndex

Update the position of an entry.

Specified by:

update in interface RectangleIndex<T>

Parameters:

lo1 - old min

up1 - old max

lo2 - new min

up2 - new max

Returns:

the value, or null if the entries was not found

queryExact

public T queryExact(double[] lower,
                    double[] upper)

Description copied from interface: RectangleIndex

Lookup an entry, using exact match.

Specified by:

queryExact in interface RectangleIndex<T>

Parameters:

lower - minimum corner

upper - maximum corner

Returns:

the value of the entry or null if the entry was not found

iterator

public QueryIterator<RectangleEntry<T>> iterator()

Specified by:

iterator in interface RectangleIndex<T>

Returns:

An iterator over all entries.

queryIntersect

public QueryIterator<RectangleEntry<T>> queryIntersect(double[] min,
                                                       double[] max)

Specified by:

queryIntersect in interface RectangleIndex<T>

Returns:

All rectangles that intersect with the query rectangle.

queryKNN

public QueryIteratorKNN<RectangleEntryDist<T>> queryKNN(double[] center,
                                                        int k)

Description copied from interface: RectangleIndex

Finds the nearest neighbor. This uses euclidean 'edge distance', i.e. the distance to the edge of rectangle. Distance is 0 is the rectangle overlaps with the search point. Other distance types can only be specified directly on the index implementations.

Specified by:

queryKNN in interface RectangleIndex<T>

Parameters:

center - center point

k - number of neighbors

Returns:

list of nearest neighbors