readnode.html

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

<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/ReadNode.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><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>(package private) &nbsp;void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/ReadNode.html#setDirty(boolean)">setDirty</A></B>(boolean&nbsp;val)</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;void</CODE></FONT></TD>
<TD><CODE><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;<A HREF="../rtree/Node.html" title="class in rtree">Node</A>[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/ReadNode.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>(package private) &nbsp;void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/ReadNode.html#sweepSort()">sweepSort</A></B>()</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method is added to sort the elements in this node to help sweepline algorithm.</TD>
</TR>
</TABLE>
&nbsp;<A NAME="methods_inherited_from_class_rtree.Node"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TD><B>Methods inherited from class rtree.<A HREF="../rtree/Node.html" title="class in rtree">Node</A></B></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><A HREF="../rtree/Node.html#clone()">clone</A>, <A HREF="../rtree/Node.html#toString()">toString</A></CODE></TD>
</TR>
</TABLE>
&nbsp;<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TD><B>Methods inherited from class java.lang.Object</B></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE>equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait</CODE></TD>
</TR>
</TABLE>
&nbsp;
<P>

<!-- ============ FIELD DETAIL =========== -->


<!-- ========= CONSTRUCTOR DETAIL ======== -->

<A NAME="constructor_detail"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Constructor Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="ReadNode()"><!-- --></A><H3>
ReadNode</H3>
<PRE>
<B>ReadNode</B>()</PRE>
<DL>
</DL>

<!-- ============ METHOD DETAIL ========== -->

<A NAME="method_detail"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Method Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="makeReadNode(rtree.Node)"><!-- --></A><H3>
makeReadNode</H3>
<PRE>
public static <A HREF="../rtree/ReadNode.html" title="class in rtree">ReadNode</A> <B>makeReadNode</B>(<A HREF="../rtree/Node.html" title="class in rtree">Node</A>&nbsp;node)</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="deleteElement(int, boolean)"><!-- --></A><H3>
deleteElement</H3>
<PRE>
public void <B>deleteElement</B>(int&nbsp;index,
                          boolean&nbsp;force)
                   throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                          <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>This method delets the element with the given index from the node.
     It rewrites the node.
     This method now also being used to write the whole node to the file.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#deleteElement(int, boolean)">deleteElement</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>index</CODE> - The element to delete. Give -1 if the whole node is to be flushed.<DD><CODE>force</CODE> - Whether to force IO. As this method is also used to write the whole node, this was 
     required.
<DT><B>Returns:</B><DD>thengaa!
     XXX : This is till not correct.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="insertElement(rtree.Element)"><!-- --></A><H3>
insertElement</H3>
<PRE>
public void <B>insertElement</B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)
                   throws <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A>,
                          <A HREF="../rtree/NodeFullException.html" title="class in rtree">NodeFullException</A></PRE>
<DL>
<DD><B>Description copied from class: <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></B></DD>
<DD>to add an element at the end
     As elements are allocated to this node, each allocated 
     element's children node's parent are reset. This is simply because the
     new node index(for <code>elmt</code>) would be different from the old
     ones(if any). 
     <br>Note:-This again is for non leaf node only.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#insertElement(rtree.Element)">insertElement</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE>
<DD><CODE><A HREF="../rtree/NodeFullException.html" title="class in rtree">NodeFullException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="insertElement(rtree.Element[], boolean)"><!-- --></A><H3>
insertElement</H3>
<PRE>
public void <B>insertElement</B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,
                          boolean&nbsp;updateChldrn)
                   throws <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A>,
                          <A HREF="../rtree/NodeFullException.html" title="class in rtree">NodeFullException</A></PRE>
<DL>
<DD><B>Description copied from class: <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></B></DD>
<DD>to add more than onr element at the end.
     As elements are allocated to this node, each allocated element's children node's parent are reset.
     This is simply because the new node index(for <code>elmts</code>) would be different from the old
     ones(if any). none of the element should be null.
     <br><b>Note:-</b> Giving <code>updateChldrn</code> <code>true</code> will not update the parent from
     cache, but would actually update the parent on disk.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#insertElement(rtree.Element[], boolean)">insertElement</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>elmts</CODE> - The elements that are to be entered. None of them should be null.<DD><CODE>updateChldrn</CODE> - Whether to update the children. When we are moving from root to leaves,
     this should be false.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE>
<DD><CODE><A HREF="../rtree/NodeFullException.html" title="class in rtree">NodeFullException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getElementType()"><!-- --></A><H3>
getElementType</H3>
<PRE>
public int <B>getElementType</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#getElementType()">getElementType</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getNodeIndex()"><!-- --></A><H3>
getNodeIndex</H3>
<PRE>
public long <B>getNodeIndex</B>()</PRE>
<DL>
<DD><B>Description copied from class: <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></B></DD>
<DD>will return the index of the node.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#getNodeIndex()">getNodeIndex</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getAllRectangles()"><!-- --></A><H3>
getAllRectangles</H3>
<PRE>
<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>[] <B>getAllRectangles</B>()
                  throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></PRE>
<DL>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#getAllRectangles()">getAllRectangles</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getLeastEnlargement(rtree.Element)"><!-- --></A><H3>
getLeastEnlargement</H3>
<PRE>
public <A HREF="../rtree/Element.html" title="class in rtree">Element</A> <B>getLeastEnlargement</B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)
                            throws <A HREF="../rtree/NodeEmptyException.html" title="class in rtree">NodeEmptyException</A>,
                                   <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                   <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD><B>Description copied from class: <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></B></DD>
<DD>Returns the element(of the current node) whose rectangle needs the least 
     enlargment to include <code>elmt</code>.
     The logic assumes that the elements are not sorted.
     See the documentation for least enlargement logic.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#getLeastEnlargement(rtree.Element)">getLeastEnlargement</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/NodeEmptyException.html" title="class in rtree">NodeEmptyException</A></CODE>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="isInsertPossible()"><!-- --></A><H3>
isInsertPossible</H3>
<PRE>
boolean <B>isInsertPossible</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#isInsertPossible()">isInsertPossible</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>

<DT><B>Returns:</B><DD>a boolean describing whether there is space for another element</DL>
</DD>
</DL>
<HR>

<A NAME="splitNode(rtree.Element, long)"><!-- --></A><H3>
splitNode</H3>
<PRE>
public <A HREF="../rtree/Node.html" title="class in rtree">Node</A>[] <B>splitNode</B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmtM1,
                        long&nbsp;slotIndex)
                 throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                        <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD><B>Description copied from class: <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></B></DD>
<DD>See ./Logic.txt
     Linear split Algo.
     February 1003 - Now quad split algo.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#splitNode(rtree.Element, long)">splitNode</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>slotIndex</CODE> - The index of the slot of this tree if any, else give NOT_DEFINED.
<DT><B>Returns:</B><DD>First node would be the original node.Second would be the new one.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getParent()"><!-- --></A><H3>
getParent</H3>
<PRE>
public long <B>getParent</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../rtree/Node.html#getParent()">getParent</A></CODE> in class <CODE><A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getElementIndex(long)"><!-- --></A><H3>
getElementIndex</H3>
<PRE>