📄 rtree.html
字号:
<CODE> int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#getTreeLevel()">getTreeLevel</A></B>()</CODE>
<BR>
Returns the level of the root Node, which signifies the level of the whole tree. </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#getTreeType()">getTreeType</A></B>()</CODE>
<BR>
Returns the RTree variant used.</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#insert(rtree.HyperCube, int)">insert</A></B>(<A HREF="../rtree/HyperCube.html">HyperCube</A> h, int page)</CODE>
<BR>
Inserts a HyperCube into the tree, pointing to the data stored at the given page number.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Enumeration</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#intersection(rtree.HyperCube)">intersection</A></B>(<A HREF="../rtree/HyperCube.html">HyperCube</A> h)</CODE>
<BR>
Returns an Enumeration with all nodes present in the tree 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><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>static void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#main(java.lang.String[])">main</A></B>(java.lang.String[] args)</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#nearestNeighbor(rtree.Point)">nearestNeighbor</A></B>(<A HREF="../rtree/Point.html">Point</A> p)</CODE>
<BR>
Returns the nearest HyperCube to the given point. </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><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>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Enumeration</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#traverseByLevel()">traverseByLevel</A></B>()</CODE>
<BR>
Returns an Enumeration 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><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.Enumeration</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#traversePostOrder()">traversePostOrder</A></B>()</CODE>
<BR>
Post order traverse of all tree nodes, begging with root. </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#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.Enumeration</CODE></FONT></TD>
<TD><CODE><B><A HREF="../rtree/RTree.html#traversePreOrder()">traversePreOrder</A></B>()</CODE>
<BR>
Pre order traverse of all tree nodes, begging with root. </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#traversePreOrder(rtree.AbstractNode)">traversePreOrder</A></B>(<A HREF="../rtree/AbstractNode.html">AbstractNode</A> root)</CODE>
<BR>
Pre order traverse of tree nodes. </TD>
</TR>
</TABLE>
<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TD><B>Methods inherited from class java.lang.Object</B></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE>clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait</CODE></TD>
</TR>
</TABLE>
<P>
<!-- ============ FIELD DETAIL =========== -->
<A NAME="field_detail"><!-- --></A><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Field Detail</B></FONT></TD>
</TR>
</TABLE>
<A NAME="version"><!-- --></A><H3>
version</H3>
<PRE>
public final java.lang.String <B>version</B></PRE>
<DL>
</DL>
<HR>
<A NAME="date"><!-- --></A><H3>
date</H3>
<PRE>
public final java.lang.String <B>date</B></PRE>
<DL>
</DL>
<HR>
<A NAME="file"><!-- --></A><H3>
file</H3>
<PRE>
protected <A HREF="../rtree/PageFile.html">PageFile</A> <B>file</B></PRE>
<DL>
<DD>Page file where data is stored.</DL>
<HR>
<A NAME="NIL"><!-- --></A><H3>
NIL</H3>
<PRE>
public static final int <B>NIL</B></PRE>
<DL>
<DD>static identifier used for the parent of the root node.</DL>
<HR>
<A NAME="RTREE_LINEAR"><!-- --></A><H3>
RTREE_LINEAR</H3>
<PRE>
public static final int <B>RTREE_LINEAR</B></PRE>
<DL>
<DD>Available RTree variants.</DL>
<HR>
<A NAME="RTREE_QUADRATIC"><!-- --></A><H3>
RTREE_QUADRATIC</H3>
<PRE>
public static final int <B>RTREE_QUADRATIC</B></PRE>
<DL>
</DL>
<HR>
<A NAME="RTREE_EXPONENTIAL"><!-- --></A><H3>
RTREE_EXPONENTIAL</H3>
<PRE>
public static final int <B>RTREE_EXPONENTIAL</B></PRE>
<DL>
</DL>
<HR>
<A NAME="RSTAR"><!-- --></A><H3>
RSTAR</H3>
<PRE>
public static final int <B>RSTAR</B></PRE>
<DL>
</DL>
<!-- ========= CONSTRUCTOR DETAIL ======== -->
<A NAME="constructor_detail"><!-- --></A><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Constructor Detail</B></FONT></TD>
</TR>
</TABLE>
<A NAME="RTree(int, float, int, int)"><!-- --></A><H3>
RTree</H3>
<PRE>
public <B>RTree</B>(int dimension, float fillFactor, int capacity, int type)</PRE>
<DL>
<DD>Creates a memory resident RTree with an empty root node, which is stored in page 0 and has a parent identifier equal to NIL. A new memory page file is created and used as a storage manager by default.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>dimension</CODE> - The data dimension.<DD><CODE>fillFactor</CODE> - A percentage between 0 and 0.5. Used to calculate minimum number of entries present in each node.<DD><CODE>capacity</CODE> - The maximun number of entries that each node can hold.<DD><CODE>type</CODE> - The RTree variant to use.</DL>
</DD>
</DL>
<HR>
<A NAME="RTree(int, float, int, rtree.PageFile, int)"><!-- --></A><H3>
RTree</H3>
<PRE>
public <B>RTree</B>(int dimension, float fillFactor, int capacity, <A HREF="../rtree/PageFile.html">PageFile</A> file, int type)</PRE>
<DL>
<DD>Creates a new RTree with an empty root node, which is stored in page 0 and has a parent identifier equal to NIL. The given page file is used for storing the rtree nodes. If the page file is not empty, than all entries will be overwritten.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>dimension</CODE> - The data dimension.<DD><CODE>fillFactor</CODE> - A percentage between 0 and 0.5. Used to calculate minimum number of entries present in each node.<DD><CODE>capacity</CODE> - The maximun number of entries that each node can hold.<DD><CODE>file</CODE> - The page file to use for storing the nodes of the rtree.<DD><CODE>type</CODE> - The RTree variant to use.</DL>
</DD>
</DL>
<HR>
<A NAME="RTree(rtree.PageFile)"><!-- --></A><H3>
RTree</H3>
<PRE>
public <B>RTree</B>(<A HREF="../rtree/PageFile.html">PageFile</A> file)</PRE>
<DL>
<DD>Creates an rtree from an already initialized page file, probably stored into persistent storage.</DL>
<!-- ============ METHOD DETAIL ========== -->
<A NAME="method_detail"><!-- --></A><TABLE BORDER="1" CELLPADDING="3" CELLSPACING="0" WIDTH="100%">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Method Detail</B></FONT></TD>
</TR>
</TABLE>
<A NAME="getNodeCapacity()"><!-- --></A><H3>
getNodeCapacity</H3>
<PRE>
public int <B>getNodeCapacity</B>()</PRE>
<DL>
<DD>Retruns the maximun capacity of each Node.</DL>
<HR>
<A NAME="getFillFactor()"><!-- --></A><H3>
getFillFactor</H3>
<PRE>
public float <B>getFillFactor</B>()</PRE>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -