nodewriteexception.html

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

              long&nbsp;pointer)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Overloaded</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#modifyElement(int, rtree.Rect)">modifyElement</A></B>(int&nbsp;index,
              <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;Overloaded</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#setParent(long)">setParent</A></B>(long&nbsp;prnt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;No error echecking at all.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#deleteNode()">deleteNode</A></B>()</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Adds the node to the free stack.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;boolean</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#flush()">flush</A></B>()</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This is a new methos that will help the phylosophy where one should write to tbe cache only when
     required.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#deleteElement(int, boolean)">deleteElement</A></B>(int&nbsp;index,
              boolean&nbsp;force)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method delets the element with the given index from the node.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#insertElement(rtree.Element)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;to add an element at the end
     As elements are allocated to this node, each allocated 
     element's children node's parent are reset.</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>Node.</B><B><A HREF="../../rtree/Node.html#writeLastElement(rtree.Element)">writeLastElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This func.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#insertElement(rtree.Element[], boolean)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,
              boolean&nbsp;updateChldrn)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;to add more than onr element at the end.</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>Node.</B><B><A HREF="../../rtree/Node.html#writeLastElements(rtree.Element[])">writeLastElements</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method helps in bulk loading.</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>Node.</B><B><A HREF="../../rtree/Node.html#writeNodeHeader(long, int, long, int, int)">writeNodeHeader</A></B>(long&nbsp;nodeIdx,
                int&nbsp;totElmt,
                long&nbsp;prnt,
                int&nbsp;elmtSz,
                int&nbsp;elmtTp)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;this func.</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>Node.</B><B><A HREF="../../rtree/Node.html#writeNodeHeader(long, int, long, int, int, java.io.DataOutputStream)">writeNodeHeader</A></B>(long&nbsp;nodeIdx,
                int&nbsp;totElmt,
                long&nbsp;prnt,
                int&nbsp;elmtSz,
                int&nbsp;elmtTp,
                java.io.DataOutputStream&nbsp;ds)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method will write the node header into the <code>ds</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A></CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#getLeastEnlargement(rtree.Element)">getLeastEnlargement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns the element(of the current node) whose rectangle needs the least 
     enlargment to include <code>elmt</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>Node.</B><B><A HREF="../../rtree/Node.html#splitNode(rtree.Element, long)">splitNode</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmtM1,
          long&nbsp;slotIndex)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;See ./Logic.txt
     Linear split Algo.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#modifyElement(int, rtree.Element)">modifyElement</A></B>(int&nbsp;index,
              <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Used to overwrite the old Element with the new one.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#modifyElement(int, long)">modifyElement</A></B>(int&nbsp;index,
              long&nbsp;pointer)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Overloaded</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#modifyElement(int, rtree.Rect)">modifyElement</A></B>(int&nbsp;index,
              <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;Overloaded</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#setParent(long)">setParent</A></B>(long&nbsp;prnt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;No error echecking at all.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#deleteNode()">deleteNode</A></B>()</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Adds the node to the free stack.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;boolean</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#flush()">flush</A></B>()</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This is a new methos that will help the phylosophy where one should write to tbe cache only when
     required.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#setCacheSize(int)">setCacheSize</A></B>(int&nbsp;size)</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>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getNode(java.io.RandomAccessFile, java.lang.String, long, rtree.FileHdr, int)">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,
        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>private &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, int)">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,
        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/seeded/SdNode.html" title="class in rtree.seeded">SdNode</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getSdNode(java.io.RandomAccessFile, java.lang.String, long, rtree.FileHdr)">getSdNode</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>SdNode</code></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/seeded/SdNode.html" title="class in rtree.seeded">SdNode</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getSdNode(java.io.RandomAccessFile, java.lang.String, long, int, rtree.FileHdr)">getSdNode</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 existing <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, 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>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/ReadNode.html" title="class in rtree">ReadNode</A></CODE></FONT></TD>
<TD><CODE><B>CachedNodes.</B><B><A HREF="../../rtree/CachedNodes.html#getReadNode(java.io.RandomAccessFile, java.lang.String, long, rtree.FileHdr)">getReadNode</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>