📄 rtreeexception.html
字号:
<BR>
Find all index records whose MBR are enclosed by the 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>RTree.</B><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> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><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>RTree.</B><B><A HREF="../../rtree/RTree.html#contains(rtree.Rect)">contains</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR enclose/contain the 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>RTree.</B><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> void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><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> void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><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> <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#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>private <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> 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>protected void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><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>RTree.</B><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/Node.html" title="class in rtree">Node</A>[]</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#splitNode(rtree.Element, long)">splitNode</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A> elmtM1, long slotIndex)</CODE>
<BR>
</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>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> elmtM1, long slotIndex)</CODE>
<BR>
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) void</CODE></FONT></TD>
<TD><CODE><B>FileHdr.</B><B><A HREF="../../rtree/FileHdr.html#update(java.lang.String)">update</A></B>(java.lang.String fileName)</CODE>
<BR>
This method will be used by the Pack class to update this header from the file again.</TD>
</TR>
</TABLE>
<P>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Constructors in <A HREF="../../rtree/package-summary.html">rtree</A> that throw <A HREF="../../rtree/RTreeException.html" title="class in rtree">RTreeException</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../rtree/RTree.html#RTree(java.lang.String)">RTree</A></B>(java.lang.String fileName)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../rtree/FileHdr.html#FileHdr(int, java.lang.String)">FileHdr</A></B>(int stkLimit, java.lang.String fileName)</CODE>
<BR>
Although this 'stack' is part of the file header but it acts totally independently of the rest of the file header.</TD>
</TR>
</TABLE>
<P>
<A NAME="rtree.seeded"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=2><FONT SIZE="+2">
Uses of <A HREF="../../rtree/RTreeException.html" title="class in rtree">RTreeException</A> in <A HREF="../../rtree/seeded/package-summary.html">rtree.seeded</A></FONT></TD>
</TR>
</TABLE>
<P>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in <A HREF="../../rtree/seeded/package-summary.html">rtree.seeded</A> that throw <A HREF="../../rtree/RTreeException.html" title="class in rtree">RTreeException</A></FONT></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>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#seed()">seed</A></B>()</CODE>
<BR>
Start seeding - take the root node, copy it to this tree, keep on copying until the slot level.</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>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#growLeaf(rtree.Element)">growLeaf</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A> elmt)</CODE>
<BR>
</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>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#chooseLeaf(rtree.Element, rtree.seeded.SdTree.LongWraper)">chooseLeaf</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A> elmt, <A HREF="../../rtree/seeded/SdTree.LongWraper.html" title="class in rtree.seeded">SdTree.LongWraper</A> slotIndex)</CODE>
<BR>
This method is a copy of <code>RTree.chooseLeaf</code> with minor modifications.</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>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#adjustSlot(rtree.Node, long)">adjustSlot</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, long childIndex)</CODE>
<BR>
This method will adjust the slot's only elements's child pointer.</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>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#cleanUp()">cleanUp</A></B>()</CODE>
<BR>
The clean up pahse is the last method that should be called after all the data have been grown.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B>SdTree.</B><B><A HREF="../../rtree/seeded/SdTree.html#cleanUpRec(rtree.Node, int)">cleanUpRec</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, int level)</CODE>
<BR>
This method adjusts all the seed node MBRs to the grown subtrees.</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>SdNode.</B><B><A HREF="../../rtree/seeded/SdNode.html#splitNode(rtree.Element, long)">splitNode</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A> param1, long slotIndex)</CODE>
<BR>
Overriden so that this package can use it.</TD>
</TR>
</TABLE>
<P>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Constructors in <A HREF="../../rtree/seeded/package-summary.html">rtree.seeded</A> that throw <A HREF="../../rtree/RTreeException.html" title="class in rtree">RTreeException</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../rtree/seeded/SdTree.html#SdTree(java.lang.String, rtree.RTree)">SdTree</A></B>(java.lang.String fileName, <A HREF="../../rtree/RTree.html" title="class in rtree">RTree</A> sdingTree)</CODE>
<BR>
</TD>
</TR>
</TABLE>
<P>
<HR>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A><A HREF="#skip-navbar_bottom" title="Skip navigation links"></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=3 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../rtree/RTreeException.html" title="class in rtree"><FONT CLASS="NavBarFont1"><B>Class</B></FONT></A> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Use</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
PREV
NEXT</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../index.html" target="_top"><B>FRAMES</B></A>
<A HREF="RTreeException.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A><!-- ======== END OF BOTTOM NAVBAR ======= -->
<HR>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -