📄 abstractnode.html
字号:
</TABLE>
<P>
<TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in rtree with parameters of type <A HREF="../../rtree/AbstractNode.html">AbstractNode</A></FONT></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>AbstractNode.<A HREF="../../rtree/AbstractNode.html#addData(rtree.AbstractNode)">addData</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n)</CODE>
<BR>
Adds a child node into this node. </TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B>CachedPersistentPageFile.<A HREF="../../rtree/CachedPersistentPageFile.html#writeNode(rtree.AbstractNode)">writeNode</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B>Index.<A HREF="../../rtree/Index.html#insert(rtree.AbstractNode)">insert</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> node)</CODE>
<BR>
Inserts a new node into the tree. </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>Index.<A HREF="../../rtree/Index.html#adjustTree(rtree.AbstractNode, rtree.AbstractNode)">adjustTree</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n1, <A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n2)</CODE>
<BR>
Called by insert to adjust the parents of the node that was modified by the insertion. </TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B>MemoryPageFile.<A HREF="../../rtree/MemoryPageFile.html#writeNode(rtree.AbstractNode)">writeNode</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected abstract int</CODE></FONT></TD>
<TD><CODE><B>PageFile.<A HREF="../../rtree/PageFile.html#writeNode(rtree.AbstractNode)">writeNode</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> o)</CODE>
<BR>
Writes the node into the first available page and returns that page.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B>PersistentPageFile.<A HREF="../../rtree/PersistentPageFile.html#writeNode(rtree.AbstractNode)">writeNode</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n)</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>RTree.<A HREF="../../rtree/RTree.html#traverseByLevel(rtree.AbstractNode)">traverseByLevel</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Returns a Vector containing all tree nodes from bottom to top, left to right. </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.<A HREF="../../rtree/RTree.html#traversePostOrder(rtree.AbstractNode)">traversePostOrder</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Post order traverse of tree nodes. </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.<A HREF="../../rtree/RTree.html#traversePreOrder(rtree.AbstractNode)">traversePreOrder</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Pre order traverse of tree nodes. </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.<A HREF="../../rtree/RTree.html#intersection(rtree.HyperCube, rtree.AbstractNode)">intersection</A></B>(<A HREF="../../rtree/HyperCube.html">HyperCube</A> h, <A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Returns a Vector with all nodes that intersect with the given HyperCube. </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.<A HREF="../../rtree/RTree.html#enclosure(rtree.HyperCube, rtree.AbstractNode)">enclosure</A></B>(<A HREF="../../rtree/HyperCube.html">HyperCube</A> h, <A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Returns a Vector with all Hypercubes that completely contain HyperCube <B>h</B>. </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.<A HREF="../../rtree/RTree.html#enclosure(rtree.Point, rtree.AbstractNode)">enclosure</A></B>(<A HREF="../../rtree/Point.html">Point</A> p, <A HREF="../../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Returns a Vector with all Hypercubes that completely contain point <B>p</B>. </TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.<A HREF="../../rtree/RTree.html#nearestNeighborSearch(rtree.AbstractNode, rtree.Point, float)">nearestNeighborSearch</A></B>(<A HREF="../../rtree/AbstractNode.html">AbstractNode</A> n, <A HREF="../../rtree/Point.html">Point</A> p, float nearest)</CODE>
<BR>
Used for nearest neighbor recursive search into the RTree structure. </TD>
</TR>
</TABLE>
<P>
<HR>
<!-- ========== START OF NAVBAR ========== -->
<A NAME="navbar_bottom"><!-- --></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../rtree/AbstractNode.html"><FONT ID="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="../../overview-tree.html"><FONT ID="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../deprecated-list.html"><FONT ID="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../index-all.html"><FONT ID="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../help-doc.html"><FONT ID="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="AbstractNode.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->
<HR>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -