📄 node.html
字号:
<TD><CODE><B><A HREF="../rtree/Node.html#toString()">toString</A></B>()</CODE>
<BR>
Obvious, isn't it?</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/Node.html#writeLastElement(rtree.Element)">writeLastElement</A></B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A> elmt)</CODE>
<BR>
This func.</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/Node.html#writeLastElements(rtree.Element[])">writeLastElements</A></B>(<A HREF="../rtree/Element.html" title="class in rtree">Element</A>[] elmts)</CODE>
<BR>
This method helps in bulk loading.</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/Node.html#writeNodeHeader(long, int, long, int, int)">writeNodeHeader</A></B>(long nodeIdx, int totElmt, long prnt, int elmtSz, int elmtTp)</CODE>
<BR>
this func.</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/Node.html#writeNodeHeader(long, int, long, int, int, java.io.DataOutputStream)">writeNodeHeader</A></B>(long nodeIdx, int totElmt, long prnt, int elmtSz, int elmtTp, java.io.DataOutputStream ds)</CODE>
<BR>
This method will write the node header into the <code>ds</code>.</TD>
</TR>
</TABLE>
<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TD><B>Methods inherited from class java.lang.Object</B></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE>equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait</CODE></TD>
</TR>
</TABLE>
<P>
<!-- ============ FIELD DETAIL =========== -->
<A NAME="field_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Field Detail</B></FONT></TD>
</TR>
</TABLE>
<A NAME="MAX"><!-- --></A><H3>
MAX</H3>
<PRE>
public static final int <B>MAX</B></PRE>
<DL>
<DD>max no. of entries in a node
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.MAX">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="MIN"><!-- --></A><H3>
MIN</H3>
<PRE>
public static final int <B>MIN</B></PRE>
<DL>
<DD>min. no. of entries in a node
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.MIN">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="CACHE_SIZE"><!-- --></A><H3>
CACHE_SIZE</H3>
<PRE>
public static final int <B>CACHE_SIZE</B></PRE>
<DL>
<DD>The size of the cache.<br> Minimum cache size is 50% of total no. of elements (1lakh records has 597 nodes). <br>Maximum cache size should be 70%, beyound that there may not be major improvements but the overheads will increase. <br>Eg: 1 lakh packed records - Total nodes in tree - 597: Height 3, 1 root,4 nonleaf, 129 leaf and should have a cache size of 250(sufficient for normal casses) to 400(good for queries). <br>Multiply the cache size by 4kbytes and you get the cache size in MBytes. <br><b>These observations are for a packed tree only. An unpacked tree needs a 100% buffer size - thererore don't use unpacked tree.</b> <br>For unpacked tree <br>1 lakh records - Total nodes in tree - 991( Height 3: 1 root, 10 NonLeaf, 981 Leaf These observations shold hold good for query building as well. But it is no harm to give large caches for query building.
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.CACHE_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NODE_HDR_SIZE"><!-- --></A><H3>
NODE_HDR_SIZE</H3>
<PRE>
static final int <B>NODE_HDR_SIZE</B></PRE>
<DL>
<DD>bytes
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NODE_HDR_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="FILE_HDR_SIZE"><!-- --></A><H3>
FILE_HDR_SIZE</H3>
<PRE>
static final int <B>FILE_HDR_SIZE</B></PRE>
<DL>
<DD>2 kBytes - will include the file header and the stack
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.FILE_HDR_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NODE_SIZE"><!-- --></A><H3>
NODE_SIZE</H3>
<PRE>
static final int <B>NODE_SIZE</B></PRE>
<DL>
<DD>2 kByte
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NODE_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NODE_BODY_SIZE"><!-- --></A><H3>
NODE_BODY_SIZE</H3>
<PRE>
static final int <B>NODE_BODY_SIZE</B></PRE>
<DL>
<DD>2048-16=2032 then 2048-20=2028 NOW 4096-20=4076
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NODE_BODY_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="FREE_LIST_LIMIT"><!-- --></A><H3>
FREE_LIST_LIMIT</H3>
<PRE>
static final int <B>FREE_LIST_LIMIT</B></PRE>
<DL>
<DD>can be increased by increasing file header size
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.FREE_LIST_LIMIT">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="INTEGER_SIZE"><!-- --></A><H3>
INTEGER_SIZE</H3>
<PRE>
static final int <B>INTEGER_SIZE</B></PRE>
<DL>
<DD>So that I don't forget
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.INTEGER_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="LONG_SIZE"><!-- --></A><H3>
LONG_SIZE</H3>
<PRE>
static final int <B>LONG_SIZE</B></PRE>
<DL>
<DD>So that I don't forget
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.LONG_SIZE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="LEAF_NODE"><!-- --></A><H3>
LEAF_NODE</H3>
<PRE>
public static final int <B>LEAF_NODE</B></PRE>
<DL>
<DD>node elements type - LEAF
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.LEAF_NODE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NONLEAF_NODE"><!-- --></A><H3>
NONLEAF_NODE</H3>
<PRE>
public static final int <B>NONLEAF_NODE</B></PRE>
<DL>
<DD>node elements type - NON LEAF
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NONLEAF_NODE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NOT_DEFINED"><!-- --></A><H3>
NOT_DEFINED</H3>
<PRE>
public static final int <B>NOT_DEFINED</B></PRE>
<DL>
<DD>node elements type - NONE
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NOT_DEFINED">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NOT_DEFINED_LONG"><!-- --></A><H3>
NOT_DEFINED_LONG</H3>
<PRE>
public static final long <B>NOT_DEFINED_LONG</B></PRE>
<DL>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NOT_DEFINED_LONG">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="READ"><!-- --></A><H3>
READ</H3>
<PRE>
static final int <B>READ</B></PRE>
<DL>
<DD>for thread which reads the tree
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.READ">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="WRITE"><!-- --></A><H3>
WRITE</H3>
<PRE>
static final int <B>WRITE</B></PRE>
<DL>
<DD>for threads which writes the reads
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.WRITE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="NONE"><!-- --></A><H3>
NONE</H3>
<PRE>
static final int <B>NONE</B></PRE>
<DL>
<DD>No threads reading or writing
<P>
<DL>
<DT><B>See Also:</B><DD><A HREF="../constant-values.html#rtree.Node.NONE">Constant Field Values</A></DL>
</DL>
<HR>
<A NAME="file"><!-- --></A><H3>
file</H3>
<PRE>
protected java.io.RandomAccessFile <B>file</B></PRE>
<DL>
<DD>-------------local variables-----------------------
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="fileName"><!-- --></A><H3>
fileName</H3>
<PRE>
protected java.lang.String <B>fileName</B></PRE>
<DL>
<DL>
</DL>
</DL>
<HR>
<A NAME="dirty"><!-- --></A><H3>
dirty</H3>
<PRE>
protected boolean <B>dirty</B></PRE>
<DL>
<DL>
</DL>
</DL>
<HR>
<A NAME="nodeIndex"><!-- --></A><H3>
nodeIndex</H3>
<PRE>
protected long <B>nodeIndex</B></PRE>
<DL>
<DD>will contain the index of the node in the file
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="sorted"><!-- --></A><H3>
sorted</H3>
<PRE>
protected boolean <B>sorted</B></PRE>
<DL>
<DD>a flag to see whether a node is empty
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="elements"><!-- --></A><H3>
elements</H3>
<PRE>
protected <A HREF="../rtree/Element.html" title="class in rtree">Element</A>[] <B>elements</B></PRE>
<DL>
<DD>will contain all the elements.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="fileHdr"><!-- --></A><H3>
fileHdr</H3>
<PRE>
protected <A HREF="../rtree/FileHdr.html" title="class in rtree">FileHdr</A> <B>fileHdr</B></PRE>
<DL>
<DD>the file header and the free nodes stack
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="nodeMBR"><!-- --></A><H3>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -