📄 rtree.html
字号:
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#deleteAllElements()">deleteAllElements</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#equal(rtree.Rect)">equal</A></B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR are geometrically equal to MBR 'rect' An Vector is returned.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/LeafElement.html" title="class in rtree">LeafElement</A> elmt)</CODE>
<BR>
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> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#flush()">flush</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getAllElements()">getAllElements</A></B>()</CODE>
<BR>
Returns all the elements traversing the tree recursively in <b>postorder</b></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../rtree/FileHdr.html" title="class in rtree">FileHdr</A></CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getFileHdr()">getFileHdr</A></B>()</CODE>
<BR>
Another package private method for getting the file header</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.lang.String</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getFileName()">getFileName</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getHeight()">getHeight</A></B>()</CODE>
<BR>
Upto 5 lakh objectes we can have a maximum height of 3 TODO : Calculate other levels as well.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getReadNode(long)">getReadNode</A></B>(long index)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getTreeMBR()">getTreeMBR</A></B>()</CODE>
<BR>
This method will return MBR of the whole tree.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <A HREF="../rtree/ABL.html" title="class in rtree">ABL</A>[]</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Point.html" title="class in rtree">Point</A> pt, <A HREF="../rtree/ABL.html" title="class in rtree">ABL</A>[] nrstElements, <A HREF="../rtree/RTree.Nearest.html" title="class in rtree">RTree.Nearest</A> nrstDist)</CODE>
<BR>
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 java.util.Vector</CODE></FONT></TD>
<TD><CODE><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> node, <A HREF="../rtree/Point.html" title="class in rtree">Point</A> pt, java.util.Vector nrstElements, long nrstDist)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#insert(rtree.Element)">insert</A></B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A> elmt)</CODE>
<BR>
Pass a <code>LeafElement</code>object.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#insertArray(rtree.ABL[], rtree.ABL, rtree.RTree.Nearest)">insertArray</A></B>(<A HREF="../rtree/ABL.html" title="class in rtree">ABL</A>[] arr, <A HREF="../rtree/ABL.html" title="class in rtree">ABL</A> elmt, <A HREF="../rtree/RTree.Nearest.html" title="class in rtree">RTree.Nearest</A> nrstDist)</CODE>
<BR>
A utility method for the search algorithm that inserts an element into the the correct position and adjusts the array accordingly.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#meet(rtree.Rect)">meet</A></B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR meet on the sides of MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#nearestSearch(rtree.Point, long)">nearestSearch</A></B>(<A HREF="../rtree/Point.html" title="class in rtree">Point</A> pt, long range)</CODE>
<BR>
Another version of the <code>nearestSearch</code> method(not overloaded).</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../rtree/ABL.html" title="class in rtree">ABL</A>[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#nearestSearch(rtree.Point, long, int)">nearestSearch</A></B>(<A HREF="../rtree/Point.html" title="class in rtree">Point</A> pt, long range, int n)</CODE>
<BR>
<b>Read Me Well.</b><br> The Nearest Neighbour(NN) search from Roussopoulos and Cheung.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#nonDisjoint(rtree.Rect)">nonDisjoint</A></B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR intsersect a search MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#overlaps(rtree.Rect)">overlaps</A></B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR overlap a search MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#overlapsSweep(rtree.Rect)">overlapsSweep</A></B>(<A HREF="../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#printTree()">printTree</A></B>()</CODE>
<BR>
Prints the tree in recursively <b>preorder</b> manner.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#trvsRPost(rtree.Node, boolean)">trvsRPost</A></B>(<A HREF="../rtree/Node.html" title="class in rtree">Node</A> node, boolean del)</CODE>
<BR>
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 void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#trvsRPrePrint(rtree.Node)">trvsRPrePrint</A></B>(<A HREF="../rtree/Node.html" title="class in rtree">Node</A> node)</CODE>
<BR>
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>(package private) void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#updateHdr()">updateHdr</A></B>()</CODE>
<BR>
This method is used to ask the fileHdr to update itself.</TD>
</TR>
</TABLE>
<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -