rtree.html

一个java实现的R树

<DL>
<DD>Returns the percentage between 0 and 0.5, used to calculate minimum number of entries
 present in each node.</DL>
<HR>

<A NAME="getDimension()"><!-- --></A><H3>
getDimension</H3>
<PRE>
public int <B>getDimension</B>()</PRE>
<DL>
<DD>Returns the data dimension.</DL>
<HR>

<A NAME="getPageSize()"><!-- --></A><H3>
getPageSize</H3>
<PRE>
public int <B>getPageSize</B>()</PRE>
<DL>
<DD>Returns the page length.</DL>
<HR>

<A NAME="getTreeLevel()"><!-- --></A><H3>
getTreeLevel</H3>
<PRE>
public int <B>getTreeLevel</B>()</PRE>
<DL>
<DD>Returns the level of the root Node, which signifies the level of the whole tree. Loads one
 page into main memory.</DL>
<HR>

<A NAME="getTreeType()"><!-- --></A><H3>
getTreeType</H3>
<PRE>
public int <B>getTreeType</B>()</PRE>
<DL>
<DD>Returns the RTree variant used.</DL>
<HR>

<A NAME="insert(rtree.HyperCube, int)"><!-- --></A><H3>
insert</H3>
<PRE>
public int <B>insert</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h,
                  int&nbsp;page)</PRE>
<DL>
<DD>Inserts a HyperCube into the tree, pointing to the data stored at the given page number.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The hypercube to insert.<DD><CODE>page</CODE> - The page where the real data is stored.<DT><B>Returns:</B><DD>The page number of the Leaf where the hypercube was inserted (the parent of the
         data entry.)</DL>
</DD>
</DL>
<HR>

<A NAME="delete(rtree.HyperCube)"><!-- --></A><H3>
delete</H3>
<PRE>
public int <B>delete</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD>Deletes a HyperCube from the leaf level of the tree. If there is no leaf containg a hypercube
 that matches the given hypercube, the tree is left intact.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The HyperCube to delete.<DT><B>Returns:</B><DD>The data pointer of the deleted entry, NIL if no matching entry was found.</DL>
</DD>
</DL>
<HR>

<A NAME="traverseByLevel(rtree.AbstractNode)"><!-- --></A><H3>
traverseByLevel</H3>
<PRE>
public java.util.Vector <B>traverseByLevel</B>(<A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Returns a Vector containing all tree nodes from bottom to top, left to right.
 CAUTION: If the tree is not memory resident, all nodes will be loaded into main memory.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>root</CODE> - The node from which the traverse should begin.<DT><B>Returns:</B><DD>A Vector containing all Nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="traverseByLevel()"><!-- --></A><H3>
traverseByLevel</H3>
<PRE>
public java.util.Enumeration <B>traverseByLevel</B>()</PRE>
<DL>
<DD>Returns an Enumeration containing all tree nodes from bottom to top, left to right.<DD><DL>
<DT><B>Returns:</B><DD>An Enumeration containing all Nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="traversePostOrder(rtree.AbstractNode)"><!-- --></A><H3>
traversePostOrder</H3>
<PRE>
public java.util.Vector <B>traversePostOrder</B>(<A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Post order traverse of tree nodes. 
 CAUTION: If the tree is not memory resident, all nodes will be loaded into main memory.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>root</CODE> - The node where the traversing should begin.<DT><B>Returns:</B><DD>A Vector containing all tree nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="traversePostOrder()"><!-- --></A><H3>
traversePostOrder</H3>
<PRE>
public java.util.Enumeration <B>traversePostOrder</B>()</PRE>
<DL>
<DD>Post order traverse of all tree nodes, begging with root.
 CAUTION: If the tree is not memory resident, all nodes will be loaded into main memory.<DD><DL>
<DT><B>Returns:</B><DD>An Enumeration containing all tree nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="traversePreOrder(rtree.AbstractNode)"><!-- --></A><H3>
traversePreOrder</H3>
<PRE>
public java.util.Vector <B>traversePreOrder</B>(<A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Pre order traverse of tree nodes.
 CAUTION: If the tree is not memory resident, all nodes will be loaded into main memory.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>root</CODE> - The node where the traversing should begin.<DT><B>Returns:</B><DD>A Vector containing all tree nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="traversePreOrder()"><!-- --></A><H3>
traversePreOrder</H3>
<PRE>
public java.util.Enumeration <B>traversePreOrder</B>()</PRE>
<DL>
<DD>Pre order traverse of all tree nodes, begging with root.
 CAUTION: If the tree is not memory resident, all nodes will be loaded into main memory.<DD><DL>
<DT><B>Returns:</B><DD>An Enumeration containing all tree nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="intersection(rtree.HyperCube, rtree.AbstractNode)"><!-- --></A><H3>
intersection</H3>
<PRE>
public java.util.Vector <B>intersection</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h,
                                     <A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Returns a Vector with all nodes that intersect with the given HyperCube.
 The nodes are returned in post order traversing<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The given HyperCube that is tested for overlapping.<DD><CODE>root</CODE> - The node where the search should begin.<DT><B>Returns:</B><DD>A Vector containing the appropriate nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="intersection(rtree.HyperCube)"><!-- --></A><H3>
intersection</H3>
<PRE>
public java.util.Enumeration <B>intersection</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD>Returns an Enumeration with all nodes present in the tree that intersect with the given
 HyperCube. The nodes are returned in post order traversing<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The given HyperCube that is tested for overlapping.<DT><B>Returns:</B><DD>An Enumeration containing the appropriate nodes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="enclosure(rtree.HyperCube, rtree.AbstractNode)"><!-- --></A><H3>
enclosure</H3>
<PRE>
public java.util.Vector <B>enclosure</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h,
                                  <A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Returns a Vector with all Hypercubes that completely contain HyperCube <B>h</B>.
 The HyperCubes are returned in post order traversing, according to the Nodes where
 they belong.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The given HyperCube.<DD><CODE>root</CODE> - The node where the search should begin.<DT><B>Returns:</B><DD>A Vector containing the appropriate HyperCubes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="enclosure(rtree.HyperCube)"><!-- --></A><H3>
enclosure</H3>
<PRE>
public java.util.Enumeration <B>enclosure</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD>Returns an Enumeration with all Hypercubes present in the tree that contain the given
 HyperCube. The HyperCubes are returned in post order traversing, according to the Nodes where
 they belong.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The given HyperCube.<DD><CODE>root</CODE> - The node where the search should begin.<DT><B>Returns:</B><DD>An Enumeration containing the appropriate HyperCubes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="enclosure(rtree.Point, rtree.AbstractNode)"><!-- --></A><H3>
enclosure</H3>
<PRE>
public java.util.Vector <B>enclosure</B>(<A HREF="../rtree/Point.html">Point</A>&nbsp;p,
                                  <A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;root)</PRE>
<DL>
<DD>Returns a Vector with all Hypercubes that completely contain point <B>p</B>.
 The HyperCubes are returned in post order traversing, according to the Nodes where
 they belong.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>p</CODE> - The given point.<DD><CODE>root</CODE> - The node where the search should begin.<DT><B>Returns:</B><DD>A Vector containing the appropriate HyperCubes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="enclosure(rtree.Point)"><!-- --></A><H3>
enclosure</H3>
<PRE>
public java.util.Enumeration <B>enclosure</B>(<A HREF="../rtree/Point.html">Point</A>&nbsp;p)</PRE>
<DL>
<DD>Returns an Enumeration with all Hypercubes present in the tree that contain the given
 point. The HyperCubes are returned in post order traversing, according to the Nodes where
 they belong.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>p</CODE> - The query point.<DD><CODE>root</CODE> - The node where the search should begin.<DT><B>Returns:</B><DD>An Enumeration containing the appropriate HyperCubes in the correct order.</DL>
</DD>
</DL>
<HR>

<A NAME="nearestNeighbor(rtree.Point)"><!-- --></A><H3>
nearestNeighbor</H3>
<PRE>
public java.util.Vector <B>nearestNeighbor</B>(<A HREF="../rtree/Point.html">Point</A>&nbsp;p)</PRE>
<DL>
<DD>Returns the nearest HyperCube to the given point.
 [King Lum Cheung and Ada Wai-chee Fu: Enhanced Nearest Neighbor Search on the R-Tree]<DD><DL>
<DT><B>Parameters:</B><DD><CODE>p</CODE> - The query point.<DT><B>Returns:</B><DD>A vector containing all the nodes lying in the search path until the nearest hypercube
         is found. Elements are instances of AbstractNode and Data classes. The last Data instance
         in the vector is the answer to the query.</DL>
</DD>
</DL>
<HR>

<A NAME="nearestNeighborSearch(rtree.AbstractNode, rtree.Point, float)"><!-- --></A><H3>
nearestNeighborSearch</H3>
<PRE>
protected java.util.Vector <B>nearestNeighborSearch</B>(<A HREF="../rtree/AbstractNode.html">AbstractNode</A>&nbsp;n,
                                                 <A HREF="../rtree/Point.html">Point</A>&nbsp;p,
                                                 float&nbsp;nearest)</PRE>
<DL>
<DD>Used for nearest neighbor recursive search into the RTree structure. <B>n</B> is the current
 node of the active branch list, searched. <B>p</B> is the query point. <B>nearest</B> is the 
 distance of <B>p</B> from current nearest hypercube <B>h</B>.</DL>
<HR>

<A NAME="main(java.lang.String[])"><!-- --></A><H3>
main</H3>
<PRE>
public static void <B>main</B>(java.lang.String[]&nbsp;args)</PRE>
<DL>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<HR>

<!-- ========== START OF NAVBAR ========== -->
<A NAME="navbar_bottom"><!-- --></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3">
  <TR ALIGN="center" VALIGN="top">
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="class-use/RTree.html"><FONT ID="NavBarFont1"><B>Use</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../overview-tree.html"><FONT ID="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../deprecated-list.html"><FONT ID="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../index-all.html"><FONT ID="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../help-doc.html"><FONT ID="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>
  </TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>

<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
&nbsp;<A HREF="../rtree/Point.html"><B>PREV CLASS</B></A>&nbsp;
&nbsp;<A HREF="../rtree/Sort.html"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../index.html" TARGET="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="RTree.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
  SUMMARY: &nbsp;INNER&nbsp;|&nbsp;<A HREF="#field_summary">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: &nbsp;<A HREF="#field_detail">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->

<HR>

</BODY>
</HTML>