node.html

本程序是由JAVA实现的R-树新建、结点增加、删除功能。

        int&nbsp;type)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getNode(java.io.RandomAccessFile, java.lang.String, long, rtree.FileHdr)">getNode</A></B>(java.io.RandomAccessFile&nbsp;file,
        java.lang.String&nbsp;fileName,
        long&nbsp;lndIndex,
        <A HREF="../../rtree/FileHdr.html" title="class in rtree">FileHdr</A>&nbsp;flHdr)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This one returns an existing <code>Node</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getNode(java.io.RandomAccessFile, java.lang.String, long, int, rtree.FileHdr)">getNode</A></B>(java.io.RandomAccessFile&nbsp;file,
        java.lang.String&nbsp;fileName,
        long&nbsp;parentIndex,
        int&nbsp;elmtType,
        <A HREF="../../rtree/FileHdr.html" title="class in rtree">FileHdr</A>&nbsp;flHdr)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This one returns an new <code>SdNode</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getNode(java.io.RandomAccessFile, java.lang.String, long, int, rtree.FileHdr, rtree.Node)">getNode</A></B>(java.io.RandomAccessFile&nbsp;file,
        java.lang.String&nbsp;fileName,
        long&nbsp;parentIndex,
        int&nbsp;elmtType,
        <A HREF="../../rtree/FileHdr.html" title="class in rtree">FileHdr</A>&nbsp;flHdr,
        <A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;type)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This one returns an new <code>Node</code>.</TD>
</TR>
</TABLE>
&nbsp;
<P>

<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in <A HREF="../../rtree/package-summary.html">rtree</A> with parameters of type <A HREF="../../rtree/Node.html" title="class in rtree">Node</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected &nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#adjustTree(rtree.Node[], long)">adjustTree</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>[]&nbsp;nodes,
           long&nbsp;slotIndex)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Adjust Tree from <b>Guttman the Great</b>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#condenseTree(rtree.Node, java.util.Stack)">condenseTree</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
             java.util.Stack&nbsp;stack)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#findLeaf(rtree.Node, rtree.LeafElement)">findLeaf</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
         <A HREF="../../rtree/LeafElement.html" title="class in rtree">LeafElement</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Basically it returns the node that <b>may</b> contain the required element.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostOvrlap(rtree.Node, rtree.Rect)">getRPostOvrlap</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
               <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all overlaping elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostOvrlapSweep(rtree.Node, rtree.Rect)">getRPostOvrlapSweep</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
                    <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostIntsect(rtree.Node, rtree.Rect)">getRPostIntsect</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
                <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all intersecting elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostContBy(rtree.Node, rtree.Rect)">getRPostContBy</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
               <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostEqual(rtree.Node, rtree.Rect)">getRPostEqual</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
              <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostMeet(rtree.Node, rtree.Rect)">getRPostMeet</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
             <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostContains(rtree.Node, rtree.Rect)">getRPostContains</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
                 <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#trvsRPost(rtree.Node, boolean)">trvsRPost</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
          boolean&nbsp;del)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Traverses the tree recursively in post order.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#trvsRPrePrint(rtree.Node)">trvsRPrePrint</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Traverses the tree recursively in post order.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;<A HREF="../../rtree/ABL.html" title="class in rtree">ABL</A>[]</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#INNSearch(rtree.Node, rtree.Point, rtree.ABL[], rtree.RTree.Nearest)">INNSearch</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
          <A HREF="../../rtree/Point.html" title="class in rtree">Point</A>&nbsp;pt,
          <A HREF="../../rtree/ABL.html" title="class in rtree">ABL</A>[]&nbsp;nrstElements,
          <A HREF="../../rtree/RTree.Nearest.html" title="class in rtree">RTree.Nearest</A>&nbsp;nrstDist)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Improved Nearest Neighbour Search - Cheung, theory Roussopoulos</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#INNSearch(rtree.Node, rtree.Point, java.util.Vector, long)">INNSearch</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node,
          <A HREF="../../rtree/Point.html" title="class in rtree">Point</A>&nbsp;pt,
          java.util.Vector&nbsp;nrstElements,
          long&nbsp;nrstDist)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static&nbsp;<A HREF="../../rtree/ReadNode.html" title="class in rtree">ReadNode</A></CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#makeReadNode(rtree.Node)">makeReadNode</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getNode(java.io.RandomAccessFile, java.lang.String, long, int, rtree.FileHdr, rtree.Node)">getNode</A></B>(java.io.RandomAccessFile&nbsp;file,
        java.lang.String&nbsp;fileName,
        long&nbsp;parentIndex,
        int&nbsp;elmtType,
        <A HREF="../../rtree/FileHdr.html" title="class in rtree">FileHdr</A>&nbsp;flHdr,
        <A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;type)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This one returns an new <code>Node</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>(package private) &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>BufferHeader.</B><B><A HREF="../../rtree/BufferHeader.html#put(int, rtree.Node)">put</A></B>(int&nbsp;key,
    <A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>(package private) &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>BufferHeader.</B><B><A HREF="../../rtree/BufferHeader.html#replace(int, rtree.Node)">replace</A></B>(int&nbsp;key,
        <A HREF="../../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node)</CODE>