Uses of Class
org.tinspin.index.rtree.Entry

Packages that use Entry

Package	Description
org.tinspin.index
org.tinspin.index.rtree

Uses of Entry in org.tinspin.index

Methods in org.tinspin.index with parameters of type Entry

Modifier and Type	Method and Description
void	PointIndexWrapper.load(Entry<T>[] entries)

Uses of Entry in org.tinspin.index.rtree

Subclasses of Entry in org.tinspin.index.rtree

Modifier and Type	Class and Description
class	DistEntry<T>

Methods in org.tinspin.index.rtree that return Entry

Modifier and Type	Method and Description
Entry<T>	RTreeIterator.next()
<T> Entry<T>[]	RTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e)
<T> Entry<T>[]	RStarTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e)

Methods in org.tinspin.index.rtree with parameters of type Entry

Modifier and Type	Method and Description
double	KnnResult.add(Entry<T> e, double distance)
static void	Entry.calcBoundingBox(Entry<?>[] entries, int start, int end, double[] minOut, double[] maxOut)
static double	Entry.calcCenterDistance(Entry<?> e1, Entry<?> e2)
static double	Entry.calcCenterDistance(Entry<?> e1, Entry<?> e2)
static double	Entry.calcDeadspace(Entry<?>[] entries, int start, int end, double[] minOut, double[] maxOut) Calculates the bounding boxes and the estimated dead space.
static double	Entry.calcVolume(Entry<?> e)
static boolean	Entry.checkOverlap(double[] min, double[] max, Entry<?> e)
<T> org.tinspin.index.rtree.RTreeNode<T>	RTreeLogic.chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root, Entry<T> e, int desiredInsertionLevel, int nLevels)
<T> org.tinspin.index.rtree.RTreeNode<T>	RStarTreeLogic.chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root, Entry<T> e, int desiredInsertionLevel, int nLevels) Choose subtree as described in the paper.
int	Entry.compareTo(Entry<T> o)
void	RTree.insert(Entry<T> e) Insert an entry.
void	STRLoader.load(Entry<T>[] entries)
void	RTree.load(Entry<T>[] entries)
<T> Entry<T>[]	RTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e)
<T> Entry<T>[]	RStarTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e)
protected void	Entry.set(Entry<T> e)
protected void	DistEntry.set(Entry<T> e, double distance)
void	Entry.setToCover(Entry<T> e1, Entry<T> e2)
void	Entry.setToCover(Entry<T> e1, Entry<T> e2)
<T> org.tinspin.index.rtree.RTreeNode<T>	RTreeLogic.split(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e)
<T> org.tinspin.index.rtree.RTreeNode<T>	RStarTreeLogic.split(org.tinspin.index.rtree.RTreeNode<T> node, Entry<T> e) Choose subtree as described in the paper.