rtree.html

来自「本程序是由JAVA实现的R-树新建、结点增加、删除功能。」· HTML 代码 · 共 1,386 行 · 第 1/5 页

<A NAME="overlaps(rtree.Rect)"><!-- --></A><H3>
overlaps</H3>
<PRE>
public java.util.Vector <B>overlaps</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                          throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                                 java.io.FileNotFoundException</PRE>
<DL>
<DD>Find all index records whose MBR overlap a search MBR 'rect'. - <b>Guttman the Great</b>.
 An vector is returned. The tree is traversed recusively in post order.
<P>
<DD><DL>

<DT><B>Returns:</B><DD>If the file is empty or search rect. is out of scope then the method returns a zero size vector.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getRPostOvrlap(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostOvrlap</H3>
<PRE>
private java.util.Vector <B>getRPostOvrlap</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)
                                 throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                        java.io.FileNotFoundException,
                                        <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                        java.io.IOException,
                                        <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>Given any node it traverses a tree in a recursive post order manner
     fetching all overlaping elements in the leaves.
<P>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="overlapsSweep(rtree.Rect)"><!-- --></A><H3>
overlapsSweep</H3>
<PRE>
public java.util.Vector <B>overlapsSweep</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                               throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                                      java.io.FileNotFoundException</PRE>
<DL>
<DD><DL>

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

<A NAME="getRPostOvrlapSweep(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostOvrlapSweep</H3>
<PRE>
private java.util.Vector <B>getRPostOvrlapSweep</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)
                                      throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                             java.io.FileNotFoundException,
                                             <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                             java.io.IOException,
                                             <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="nonDisjoint(rtree.Rect)"><!-- --></A><H3>
nonDisjoint</H3>
<PRE>
public java.util.Vector <B>nonDisjoint</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                             throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                                    java.io.FileNotFoundException</PRE>
<DL>
<DD>Find all index records whose MBR intsersect a search MBR 'rect'.
     The diff. betn. this method and 'overlap' method is that this method returns
     all rectangle that is in any way in touch with the test rectangle 'rect'.
     In method 'overlap' only the rects that have common area with 'rect'
     are returned but unlike this method it does not return rects that have
     common side with 'rect'.
     An vector is returned. The tree is traversed recusively in post order.
<P>
<DD><DL>

<DT><B>Returns:</B><DD>If the file is empty or search rect. is out of scope then the method returns a zero size vector.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getRPostIntsect(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostIntsect</H3>
<PRE>
private java.util.Vector <B>getRPostIntsect</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)
                                  throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                         java.io.FileNotFoundException,
                                         <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                         java.io.IOException,
                                         <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>Given any node it traverses a tree in a recursive post order manner
     fetching all intersecting elements in the leaves.
<P>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="containedBy(rtree.Rect)"><!-- --></A><H3>
containedBy</H3>
<PRE>
public java.util.Vector <B>containedBy</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                             throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                                    java.io.FileNotFoundException</PRE>
<DL>
<DD>Find all index records whose MBR are enclosed by the MBR 'rect'.
     An Vector is returned. The tree is traversed recusively in post order.
<P>
<DD><DL>

<DT><B>Returns:</B><DD>If the file is empty or search rect. is out of scope then the 
     method returns a zero size vector.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getRPostContBy(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostContBy</H3>
<PRE>
private java.util.Vector <B>getRPostContBy</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)
                                 throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                        java.io.FileNotFoundException,
                                        <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                        java.io.IOException,
                                        <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.
<P>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="equal(rtree.Rect)"><!-- --></A><H3>
equal</H3>
<PRE>
public java.util.Vector <B>equal</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                       throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                              java.io.FileNotFoundException</PRE>
<DL>
<DD>Find all index records whose MBR are geometrically equal to MBR 'rect'
     An Vector is returned. The tree is traversed recusively in post order.
<P>
<DD><DL>

<DT><B>Returns:</B><DD>If the file is empty or search rect. is out of scope then the 
     method returns a zero size vector.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getRPostEqual(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostEqual</H3>
<PRE>
private java.util.Vector <B>getRPostEqual</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)
                                throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                       java.io.FileNotFoundException,
                                       <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                       java.io.IOException,
                                       <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.
<P>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="meet(rtree.Rect)"><!-- --></A><H3>
meet</H3>
<PRE>
public java.util.Vector <B>meet</B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)
                      throws <A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A>,
                             java.io.FileNotFoundException</PRE>
<DL>
<DD>Find all index records whose MBR meet on the sides of MBR 'rect'.
     An Vector is returned. The tree is traversed recusively in post order.
<P>
<DD><DL>

<DT><B>Returns:</B><DD>If the file is empty or search rect. is out of scope then the 
     method returns a zero size vector.
<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/RTreeException.html" title="class in rtree">RTreeException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE></DL>
</DD>
</DL>
<HR>

<A NAME="getRPostMeet(rtree.Node, rtree.Rect)"><!-- --></A><H3>
getRPostMeet</H3>
<PRE>
private java.util.Vector <B>getRPostMeet</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)
                               throws <A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A>,
                                      java.io.FileNotFoundException,
                                      <A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A>,
                                      java.io.IOException,
                                      <A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></PRE>
<DL>
<DD>Given any node it traverses a tree in a recursive post order manner
     fetching all the enclosed(inside 'rect') elements in the leaves.
<P>
<DD><DL>

<DT><B>Throws:</B>
<DD><CODE><A HREF="../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></CODE>
<DD><CODE>java.io.FileNotFoundException</CODE>
<DD><CODE><A HREF="../rtree/NodeReadException.html" title="class in rtree">NodeReadException</A></CODE>
<DD><CODE>java.io.IOException</CODE>
<DD><CODE><A HREF="../rtree/NodeWriteException.html" title="class in rtree">NodeWriteException</A></CODE></DL>
</DD>
</DL>
<HR>

<A NAME="contains(rtree.Rect)"><!-- --></A><H3>