D E I K N R S T

D

delete(double[]) - Method in class edu.wlu.cs.levy.CG.KDTree
 
delete(double[], boolean) - Method in class edu.wlu.cs.levy.CG.KDTree
Delete a node from a KD-tree.

E

edit(double[], Editor<T>) - Method in class edu.wlu.cs.levy.CG.KDTree
Edit a node in a KD-tree
edu.wlu.cs.levy.CG - package edu.wlu.cs.levy.CG
 

I

insert(double[], T) - Method in class edu.wlu.cs.levy.CG.KDTree
Insert a node in a KD-tree.

K

KDTree<T> - Class in edu.wlu.cs.levy.CG
KDTree is a class supporting KD-tree insertion, deletion, equality search, range search, and nearest neighbor(s) using double-precision floating-point keys.
KDTree(int) - Constructor for class edu.wlu.cs.levy.CG.KDTree
Creates a KD-tree with specified number of dimensions.
KDTree(int, long) - Constructor for class edu.wlu.cs.levy.CG.KDTree
 
KeyDuplicateException - Exception in edu.wlu.cs.levy.CG
KeyDuplicateException is thrown when the KDTree.insert method is invoked on a key already in the KDTree.
KeyMissingException - Exception in edu.wlu.cs.levy.CG
 
KeyMissingException() - Constructor for exception edu.wlu.cs.levy.CG.KeyMissingException
 
KeySizeException - Exception in edu.wlu.cs.levy.CG
KeySizeException is thrown when a KDTree method is invoked on a key whose size (array length) mismatches the one used in the that KDTree's constructor.

N

nearest(double[]) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree node whose key is nearest neighbor to key.
nearest(double[], int) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree nodes whose keys are n nearest neighbors to key.
nearest(double[], int, Checker<T>) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree nodes whose keys are n nearest neighbors to key.
nearestEuclidean(double[], double) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree nodes whose keys are within a given Euclidean distance of a given key.
nearestHamming(double[], double) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree nodes whose keys are within a given Hamming distance of a given key.

R

range(double[], double[]) - Method in class edu.wlu.cs.levy.CG.KDTree
Range search in a KD-tree.

S

search(double[]) - Method in class edu.wlu.cs.levy.CG.KDTree
Find KD-tree node whose key is identical to key.
serialVersionUID - Static variable in exception edu.wlu.cs.levy.CG.KeyDuplicateException
 
serialVersionUID - Static variable in exception edu.wlu.cs.levy.CG.KeyMissingException
 
serialVersionUID - Static variable in exception edu.wlu.cs.levy.CG.KeySizeException
 
size() - Method in class edu.wlu.cs.levy.CG.KDTree
 

T

toString() - Method in class edu.wlu.cs.levy.CG.KDTree
 

D E I K N R S T