index-all.html

一个java实现的R树

</DL>
<HR>
<A NAME="_G_"><!-- --></A><H2>
<B>G</B></H2>
<DL>
<DT><A HREF="rtree/HyperCube.html#getArea()"><B>getArea()</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>Returns the area of this HyperCube.
<DT><A HREF="rtree/Index.html#getChild(int)"><B>getChild(int)</B></A> - 
Method in class rtree.<A HREF="rtree/Index.html">Index</A>
<DD>Retrieves the <B>i-th</B> child node. 
<DT><A HREF="rtree/Leaf.html#getDataPointer(int)"><B>getDataPointer(int)</B></A> - 
Method in class rtree.<A HREF="rtree/Leaf.html">Leaf</A>
<DD>Returns the pointer of the <i>i-th</i> data entry.
<DT><A HREF="rtree/HyperCube.html#getDimension()"><B>getDimension()</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>&nbsp;
<DT><A HREF="rtree/Point.html#getDimension()"><B>getDimension()</B></A> - 
Method in class rtree.<A HREF="rtree/Point.html">Point</A>
<DD>&nbsp;
<DT><A HREF="rtree/RTree.html#getDimension()"><B>getDimension()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the data dimension.
<DT><A HREF="rtree/RTree.html#getFillFactor()"><B>getFillFactor()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the percentage between 0 and 0.5, used to calculate minimum number of entries
 present in each node.
<DT><A HREF="rtree/Point.html#getFloatCoordinate(int)"><B>getFloatCoordinate(int)</B></A> - 
Method in class rtree.<A HREF="rtree/Point.html">Point</A>
<DD>&nbsp;
<DT><A HREF="rtree/AbstractNode.html#getHyperCubes()"><B>getHyperCubes()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Return a copy of the HyperCubes present in this node.
<DT><A HREF="rtree/Node.html#getHyperCubes()"><B>getHyperCubes()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/Point.html#getIntCoordinate(int)"><B>getIntCoordinate(int)</B></A> - 
Method in class rtree.<A HREF="rtree/Point.html">Point</A>
<DD>&nbsp;
<DT><A HREF="rtree/AbstractNode.html#getLevel()"><B>getLevel()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns the node level. 
<DT><A HREF="rtree/Node.html#getLevel()"><B>getLevel()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/HyperCube.html#getMinDist(rtree.Point)"><B>getMinDist(Point)</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>&nbsp;
<DT><A HREF="rtree/RTree.html#getNodeCapacity()"><B>getNodeCapacity()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Retruns the maximun capacity of each Node.
<DT><A HREF="rtree/AbstractNode.html#getNodeMbb()"><B>getNodeMbb()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns the mbb of all HyperCubes present in this node.
<DT><A HREF="rtree/Node.html#getNodeMbb()"><B>getNodeMbb()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/HyperCube.html#getP1()"><B>getP1()</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>&nbsp;
<DT><A HREF="rtree/HyperCube.html#getP2()"><B>getP2()</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>&nbsp;
<DT><A HREF="rtree/RTree.html#getPageSize()"><B>getPageSize()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the page length.
<DT><A HREF="rtree/AbstractNode.html#getParent()"><B>getParent()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns the parent of this node. 
<DT><A HREF="rtree/Node.html#getParent()"><B>getParent()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/RTree.html#getTreeLevel()"><B>getTreeLevel()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the level of the root Node, which signifies the level of the whole tree. 
<DT><A HREF="rtree/RTree.html#getTreeType()"><B>getTreeType()</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the RTree variant used.
<DT><A HREF="rtree/HyperCube.html#getUnionMbb(rtree.HyperCube)"><B>getUnionMbb(HyperCube)</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>Return a new HyperCube representing the mbb of the union of this HyperCube and <B>h</B>
<DT><A HREF="rtree/HyperCube.html#getUnionMbb(rtree.HyperCube[])"><B>getUnionMbb(HyperCube[])</B></A> - 
Static method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>Static impementation. 
<DT><A HREF="rtree/AbstractNode.html#getUniqueId()"><B>getUniqueId()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns a unique id for this node. 
<DT><A HREF="rtree/Node.html#getUniqueId()"><B>getUniqueId()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
</DL>
<HR>
<A NAME="_H_"><!-- --></A><H2>
<B>H</B></H2>
<DL>
<DT><A HREF="rtree/HyperCube.html"><B>HyperCube</B></A> - class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>.<DD>A HyperCube in the n-dimensional space. <DT><A HREF="rtree/HyperCube.html#HyperCube(rtree.Point, rtree.Point)"><B>HyperCube(Point, Point)</B></A> - 
Constructor for class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>&nbsp;
</DL>
<HR>
<A NAME="_I_"><!-- --></A><H2>
<B>I</B></H2>
<DL>
<DT><A HREF="rtree/Index.html"><B>Index</B></A> - class rtree.<A HREF="rtree/Index.html">Index</A>.<DD>Internal node of the RTree. <DT><A HREF="rtree/Index.html#Index(rtree.RTree, int, int, int)"><B>Index(RTree, int, int, int)</B></A> - 
Constructor for class rtree.<A HREF="rtree/Index.html">Index</A>
<DD>&nbsp;
<DT><A HREF="rtree/MemoryPageFile.html#initialize(rtree.RTree, int, float, int, int)"><B>initialize(RTree, int, float, int, int)</B></A> - 
Method in class rtree.<A HREF="rtree/MemoryPageFile.html">MemoryPageFile</A>
<DD>&nbsp;
<DT><A HREF="rtree/PageFile.html#initialize(rtree.RTree, int, float, int, int)"><B>initialize(RTree, int, float, int, int)</B></A> - 
Method in class rtree.<A HREF="rtree/PageFile.html">PageFile</A>
<DD>&nbsp;
<DT><A HREF="rtree/PersistentPageFile.html#initialize(rtree.RTree, int, float, int, int)"><B>initialize(RTree, int, float, int, int)</B></A> - 
Method in class rtree.<A HREF="rtree/PersistentPageFile.html">PersistentPageFile</A>
<DD>&nbsp;
<DT><A HREF="rtree/Index.html#insert(rtree.AbstractNode)"><B>insert(AbstractNode)</B></A> - 
Method in class rtree.<A HREF="rtree/Index.html">Index</A>
<DD>Inserts a new node into the tree. 
<DT><A HREF="rtree/Leaf.html#insert(rtree.HyperCube, int)"><B>insert(HyperCube, int)</B></A> - 
Method in class rtree.<A HREF="rtree/Leaf.html">Leaf</A>
<DD>Inserts a new HyperCube into the Leaf. 
<DT><A HREF="rtree/RTree.html#insert(rtree.HyperCube, int)"><B>insert(HyperCube, int)</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Inserts a HyperCube into the tree, pointing to the data stored at the given page number.
<DT><A HREF="rtree/HyperCube.html#intersectingArea(rtree.HyperCube)"><B>intersectingArea(HyperCube)</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>Returns the area of the intersecting region between this HyperCube and the argument.
 
 
<DT><A HREF="rtree/HyperCube.html#intersection(rtree.HyperCube)"><B>intersection(HyperCube)</B></A> - 
Method in class rtree.<A HREF="rtree/HyperCube.html">HyperCube</A>
<DD>Tests to see whether <B>h</B> has any common points with this HyperCube. 
<DT><A HREF="rtree/RTree.html#intersection(rtree.HyperCube)"><B>intersection(HyperCube)</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns an Enumeration with all nodes present in the tree that intersect with the given
 HyperCube. 
<DT><A HREF="rtree/RTree.html#intersection(rtree.HyperCube, rtree.AbstractNode)"><B>intersection(HyperCube, AbstractNode)</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns a Vector with all nodes that intersect with the given HyperCube.
 
<DT><A HREF="rtree/AbstractNode.html#isIndex()"><B>isIndex()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns true if this node is an Index. 
<DT><A HREF="rtree/Node.html#isIndex()"><B>isIndex()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/AbstractNode.html#isLeaf()"><B>isLeaf()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns true if this node is a Leaf. 
<DT><A HREF="rtree/Node.html#isLeaf()"><B>isLeaf()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
<DT><A HREF="rtree/AbstractNode.html#isRoot()"><B>isRoot()</B></A> - 
Method in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Returns true if this node is the root node.
<DT><A HREF="rtree/Node.html#isRoot()"><B>isRoot()</B></A> - 
Method in interface rtree.<A HREF="rtree/Node.html">Node</A>
<DD>&nbsp;
</DL>
<HR>
<A NAME="_L_"><!-- --></A><H2>
<B>L</B></H2>
<DL>
<DT><A HREF="rtree/Leaf.html"><B>Leaf</B></A> - class rtree.<A HREF="rtree/Leaf.html">Leaf</A>.<DD>A Leaf node. <DT><A HREF="rtree/Leaf.html#Leaf(rtree.RTree, int)"><B>Leaf(RTree, int)</B></A> - 
Constructor for class rtree.<A HREF="rtree/Leaf.html">Leaf</A>
<DD>&nbsp;
<DT><A HREF="rtree/Leaf.html#Leaf(rtree.RTree, int, int)"><B>Leaf(RTree, int, int)</B></A> - 
Constructor for class rtree.<A HREF="rtree/Leaf.html">Leaf</A>
<DD>&nbsp;
<DT><A HREF="rtree/AbstractNode.html#level"><B>level</B></A> - 
Variable in class rtree.<A HREF="rtree/AbstractNode.html">AbstractNode</A>
<DD>Level of this node. 
</DL>
<HR>
<A NAME="_M_"><!-- --></A><H2>
<B>M</B></H2>
<DL>
<DT><A HREF="rtree/RTree.html#main(java.lang.String[])"><B>main(String[])</B></A> - 
Static method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>&nbsp;
<DT><A HREF="rtree/Data.html#mbb"><B>mbb</B></A> - 
Variable in class rtree.<A HREF="rtree/Data.html">Data</A>
<DD>&nbsp;
<DT><A HREF="rtree/MemoryPageFile.html"><B>MemoryPageFile</B></A> - class rtree.<A HREF="rtree/MemoryPageFile.html">MemoryPageFile</A>.<DD>Implements a memory page file. <DT><A HREF="rtree/MemoryPageFile.html#MemoryPageFile()"><B>MemoryPageFile()</B></A> - 
Constructor for class rtree.<A HREF="rtree/MemoryPageFile.html">MemoryPageFile</A>
<DD>&nbsp;
<DT><A HREF="rtree/Sort.html#mergeSort(java.lang.Object[], rtree.Comparator)"><B>mergeSort(Object[], Comparator)</B></A> - 
Static method in class rtree.<A HREF="rtree/Sort.html">Sort</A>
<DD>&nbsp;
</DL>
<HR>
<A NAME="_N_"><!-- --></A><H2>
<B>N</B></H2>
<DL>
<DT><A HREF="rtree/RTree.html#nearestNeighbor(rtree.Point)"><B>nearestNeighbor(Point)</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Returns the nearest HyperCube to the given point.
 
<DT><A HREF="rtree/RTree.html#nearestNeighborSearch(rtree.AbstractNode, rtree.Point, float)"><B>nearestNeighborSearch(AbstractNode, Point, float)</B></A> - 
Method in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>Used for nearest neighbor recursive search into the RTree structure. 
<DT><A HREF="rtree/RTree.html#NIL"><B>NIL</B></A> - 
Static variable in class rtree.<A HREF="rtree/RTree.html">RTree</A>
<DD>static identifier used for the parent of the root node.
<DT><A HREF="rtree/Node.html"><B>Node</B></A> - interface rtree.<A HREF="rtree/Node.html">Node</A>.<DD>Interface for easy access to common Node information.
 <DT><A HREF="rtree/PageFile.html#nodeCapacity"><B>nodeCapacity</B></A> - 
Variable in class rtree.<A HREF="rtree/PageFile.html">PageFile</A>
<DD>Maximum node capacity. 
</DL>
<HR>
<A NAME="_P_"><!-- --></A><H2>
<B>P</B></H2>
<DL>
<DT><A HREF="rtree/PageFaultError.html"><B>PageFaultError</B></A> - error rtree.<A HREF="rtree/PageFaultError.html">PageFaultError</A>.<DD>Created: Sat May 22 00:19:29 1999
 <DT><A HREF="rtree/PageFaultError.html#PageFaultError()"><B>PageFaultError()</B></A> - 
Constructor for class rtree.<A HREF="rtree/PageFaultError.html">PageFaultError</A>