A D F G I L M N O P R S T U

A

accept(T) - Method in class org.khelekore.prtree.AcceptAll

accept(T) - Method in interface org.khelekore.prtree.NodeFilter

Check if the given node object is accepted

AcceptAll<T> - Class in org.khelekore.prtree

A filter that accepts all elements

AcceptAll() - Constructor for class org.khelekore.prtree.AcceptAll

D

DistanceCalculator<T> - Interface in org.khelekore.prtree

A class that can calculate the distance to a given object stored in the PRTree

DistanceResult<T> - Class in org.khelekore.prtree

Class to hold object and distance to it

DistanceResult(T, double) - Constructor for class org.khelekore.prtree.DistanceResult

Create a new DistanceResult with a given object and distance

distanceTo(T, PointND) - Method in interface org.khelekore.prtree.DistanceCalculator

Calculate the distance between the given object and the point

F

find(double, double, double, double, List<T>) - Method in class org.khelekore.prtree.PRTree

Finds all objects that intersect the given rectangle and stores the found node in the given list.

find(double, double, double, double, List<T>, NodeFilter<T>) - Method in class org.khelekore.prtree.PRTree

Finds all objects that intersect the given rectangle and stores the found node in the given list.

find(MBR, List<T>) - Method in class org.khelekore.prtree.PRTree

Finds all objects that intersect the given rectangle and stores the found node in the given list.

find(MBR, List<T>, NodeFilter<T>) - Method in class org.khelekore.prtree.PRTree

Finds all objects that intersect the given rectangle and stores the found node in the given list.

find(double, double, double, double) - Method in class org.khelekore.prtree.PRTree

Find all objects that intersect the given rectangle.

find(double, double, double, double, NodeFilter<T>) - Method in class org.khelekore.prtree.PRTree

Find all objects that intersect the given rectangle.

find(MBR) - Method in class org.khelekore.prtree.PRTree

Find all objects that intersect the given rectangle.

find(MBR, NodeFilter<T>) - Method in class org.khelekore.prtree.PRTree

Find all objects that intersect the given rectangle.

G

get() - Method in class org.khelekore.prtree.DistanceResult

Get the object

get(MBR, PointND) - Static method in class org.khelekore.prtree.MinDist

Calculate the MINDIST between the given MBRND and the given point

get(double, double, double, double, double, double) - Static method in class org.khelekore.prtree.MinDist2D

Calculate the MINDIST between the given rectangle and the given point

getDimensions() - Method in interface org.khelekore.prtree.MBR

getDimensions() - Method in interface org.khelekore.prtree.MBRConverter

getDimensions() - Method in interface org.khelekore.prtree.PointND

getDimensions() - Method in class org.khelekore.prtree.SimpleMBR

getDimensions() - Method in class org.khelekore.prtree.SimplePointND

getDistance() - Method in class org.khelekore.prtree.DistanceResult

Get the distance

getHeight() - Method in class org.khelekore.prtree.PRTree

Get the height of this tree.

getMax(int) - Method in interface org.khelekore.prtree.MBR

Get the maximum value for the given axis

getMax(int, T) - Method in interface org.khelekore.prtree.MBRConverter

Get the maximum coordinate value for the given t

getMax(int) - Method in class org.khelekore.prtree.SimpleMBR

getMaxX() - Method in interface org.khelekore.prtree.MBR2D

Get the maximum x value

getMaxX() - Method in class org.khelekore.prtree.SimpleMBR2D

getMaxY() - Method in interface org.khelekore.prtree.MBR2D

Get the maximum y value

getMaxY() - Method in class org.khelekore.prtree.SimpleMBR2D

getMBR() - Method in class org.khelekore.prtree.PRTree

Get an N dimensional minimum bounding box of the data stored in this tree.

getMBR2D() - Method in class org.khelekore.prtree.PRTree

Get a 2 dimensional minimum bounding rectangle of the data stored in this tree.

getMin(int) - Method in interface org.khelekore.prtree.MBR

Get the minimum value for the given axis

getMin(int, T) - Method in interface org.khelekore.prtree.MBRConverter

Get the minimum coordinate value for the given t.

getMin(int) - Method in class org.khelekore.prtree.SimpleMBR

getMinX() - Method in interface org.khelekore.prtree.MBR2D

Get the minimum x value

getMinX() - Method in class org.khelekore.prtree.SimpleMBR2D

getMinY() - Method in interface org.khelekore.prtree.MBR2D

Get the minimum y value

getMinY() - Method in class org.khelekore.prtree.SimpleMBR2D

getNumberOfLeaves() - Method in class org.khelekore.prtree.PRTree

Get the number of data leafs in this tree.

getOrd(int) - Method in interface org.khelekore.prtree.PointND

getOrd(int) - Method in class org.khelekore.prtree.SimplePointND

I

intersects(MBR) - Method in interface org.khelekore.prtree.MBR

Check if the other MBR intersects this one

intersects(T, MBRConverter<T>) - Method in interface org.khelekore.prtree.MBR

Check if this MBR intersects the rectangle given by the object and the MBRConverter.

intersects(MBR2D) - Method in interface org.khelekore.prtree.MBR2D

Check if the other MBR intersects this one

intersects(MBR) - Method in class org.khelekore.prtree.SimpleMBR

intersects(T, MBRConverter<T>) - Method in class org.khelekore.prtree.SimpleMBR

intersects(MBR2D) - Method in class org.khelekore.prtree.SimpleMBR2D

isEmpty() - Method in class org.khelekore.prtree.PRTree

Check if this tree is empty

L

load(Collection<? extends T>) - Method in class org.khelekore.prtree.PRTree

Bulk load data into this tree.

M

main(String[]) - Static method in class org.khelekore.prtree.junit.RunTests

MBR - Interface in org.khelekore.prtree

A minimum bounding box for n dimensions.

MBR2D - Interface in org.khelekore.prtree

A minimum bounding rectangle

MBRConverter<T> - Interface in org.khelekore.prtree

A class that given a T can tell the minimum and maximum ordinates for that object.

MinDist - Class in org.khelekore.prtree

Class that can calculate the MINDIST between a point and a rectangle

MinDist2D - Class in org.khelekore.prtree

Class that can calculate the MINDIST between a point and a rectangle

N

nearestNeighbour(DistanceCalculator<T>, NodeFilter<T>, int, PointND) - Method in class org.khelekore.prtree.PRTree

Get the nearest neighbour of the given point

NodeFilter<T> - Interface in org.khelekore.prtree

A node object filterer.

O

org.khelekore.prtree - package org.khelekore.prtree

The classes for PRTree, a Priority R-Tree.

org.khelekore.prtree.junit - package org.khelekore.prtree.junit

Tests of PRTree

P

PointND - Interface in org.khelekore.prtree

A description of an N-dimensional point

PRTree<T> - Class in org.khelekore.prtree

A Priority R-Tree, a spatial index, for N dimensions.

PRTree(MBRConverter<T>, int) - Constructor for class org.khelekore.prtree.PRTree

Create a new PRTree using the specified branch factor.

R

RunTests - Class in org.khelekore.prtree.junit

RunTests() - Constructor for class org.khelekore.prtree.junit.RunTests

S

setUp() - Method in class org.khelekore.prtree.junit.TestPRTree

SimpleMBR - Class in org.khelekore.prtree

An implementation of MBRND that keeps a double array with the max and min values

SimpleMBR(double...) - Constructor for class org.khelekore.prtree.SimpleMBR

Create a new SimpleMBR using the given double values for max and min.

SimpleMBR(T, MBRConverter<T>) - Constructor for class org.khelekore.prtree.SimpleMBR

Create a new SimpleMBR from a given object and a MBRConverter

SimpleMBR2D - Class in org.khelekore.prtree

An implementation of MBR that keeps 4 double values for the actual min and max values needed.

SimpleMBR2D(double, double, double, double) - Constructor for class org.khelekore.prtree.SimpleMBR2D

Create a 2D minimum bounding box

SimplePointND - Class in org.khelekore.prtree

One implementatoin of a point

SimplePointND(double...) - Constructor for class org.khelekore.prtree.SimplePointND

Create a new SimplePointND using the given ordinates.

T

testAcceptingFilter() - Method in class org.khelekore.prtree.junit.TestPRTree

testBadQueryRectX() - Method in class org.khelekore.prtree.junit.TestPRTree

testBadQueryRectY() - Method in class org.khelekore.prtree.junit.TestPRTree

testCreate() - Method in class org.khelekore.prtree.junit.TestSimpleMBR

testEmpty() - Method in class org.khelekore.prtree.junit.TestPRTree

testFilter() - Method in class org.khelekore.prtree.junit.TestPRTree

testFindSpeed() - Method in class org.khelekore.prtree.junit.TestPRTree

testHeight() - Method in class org.khelekore.prtree.junit.TestPRTree

testMany() - Method in class org.khelekore.prtree.junit.TestPRTree

testMultiLoad() - Method in class org.khelekore.prtree.junit.TestPRTree

testNNDuplicates() - Method in class org.khelekore.prtree.junit.TestPRTree

testNNEmpty() - Method in class org.khelekore.prtree.junit.TestPRTree

testNNMany() - Method in class org.khelekore.prtree.junit.TestPRTree

testNNSingle() - Method in class org.khelekore.prtree.junit.TestPRTree

testNullFilterIterator() - Method in class org.khelekore.prtree.junit.TestPRTree

testNullFilterList() - Method in class org.khelekore.prtree.junit.TestPRTree

TestPRTree - Class in org.khelekore.prtree.junit

Tests for PRTree.

TestPRTree() - Constructor for class org.khelekore.prtree.junit.TestPRTree

testRandom() - Method in class org.khelekore.prtree.junit.TestPRTree

TestSimpleMBR - Class in org.khelekore.prtree.junit

Tests for SimpleMBRND

TestSimpleMBR() - Constructor for class org.khelekore.prtree.junit.TestSimpleMBR

testSingle() - Method in class org.khelekore.prtree.junit.TestPRTree

testUnion() - Method in class org.khelekore.prtree.junit.TestSimpleMBR

toString() - Method in class org.khelekore.prtree.SimpleMBR

toString() - Method in class org.khelekore.prtree.SimpleMBR2D

Get a string representation of this mbr.

U

union(MBR) - Method in interface org.khelekore.prtree.MBR

Return a new MBR that is the union of this mbr and the other

union(MBR2D) - Method in interface org.khelekore.prtree.MBR2D

Return a new MBR that is the union of this mbr and the other

union(MBR) - Method in class org.khelekore.prtree.SimpleMBR

union(MBR2D) - Method in class org.khelekore.prtree.SimpleMBR2D

A D F G I L M N O P R S T U