⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 element.html

📁 本程序是由JAVA实现的R-树新建、结点增加、删除功能。
💻 HTML
📖 第 1 页 / 共 4 页
字号:
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>RTreeClient.</B><B><A HREF="../../rtree/RTreeClient.html#insert(rtree.Element)">insert</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;element)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#insert(rtree.Element)">insert</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Pass a <code>LeafElement</code>object.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;<A HREF="../../rtree/Node.html" title="class in rtree">Node</A></CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#chooseLeaf(rtree.Element)">chooseLeaf</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;See <b>Guttman the Great</b>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#insertElement(rtree.Element)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#insertElement(rtree.Element[], boolean)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,              boolean&nbsp;updateChldrn)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A></CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#getLeastEnlargement(rtree.Element)">getLeastEnlargement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<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>&nbsp;elmtM1,          long&nbsp;slotIndex)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>ReadNode.</B><B><A HREF="../../rtree/ReadNode.html#modifyElement(int, rtree.Element)">modifyElement</A></B>(int&nbsp;index,              <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Used to overwrite the old Element with the new one.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;int</CODE></FONT></TD>
<TD><CODE><B>Pack.</B><B><A HREF="../../rtree/Pack.html#packTree(rtree.Element[], rtree.RTree, java.lang.String)">packTree</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,         <A HREF="../../rtree/RTree.html" title="class in rtree">RTree</A>&nbsp;rtree,         java.lang.String&nbsp;newFile)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Pack.</B><B><A HREF="../../rtree/Pack.html#packRec(java.io.RandomAccessFile, java.io.File, rtree.Element[], int)">packRec</A></B>(java.io.RandomAccessFile&nbsp;rFile,        java.io.File&nbsp;tmpPckFile,        <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,        int&nbsp;length)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;int</CODE></FONT></TD>
<TD><CODE><B>Pack.</B><B><A HREF="../../rtree/Pack.html#writePckFile(java.io.RandomAccessFile, java.io.File, rtree.Element[], rtree.Pack.Slice[])">writePckFile</A></B>(java.io.RandomAccessFile&nbsp;rFile,             java.io.File&nbsp;tmpPckFile,             <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,             <A HREF="../../rtree/Pack.Slice.html" title="class in rtree">Pack.Slice</A>[]&nbsp;sls)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Method that handles the low level details of nodes, leaves, file headers etc.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>NonLeafElement.</B><B><A HREF="../../rtree/NonLeafElement.html#sort(rtree.Element[], int)">sort</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,     int&nbsp;on)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;A merge-sort routine for the Packing algo.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>(package private) static&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>NonLeafElement.</B><B><A HREF="../../rtree/NonLeafElement.html#twoWayMerge(rtree.Element[], int, int, int)">twoWayMerge</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,            int&nbsp;start,            int&nbsp;finish,            int&nbsp;on)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private static&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>NonLeafElement.</B><B><A HREF="../../rtree/NonLeafElement.html#simpleMerge(rtree.Element[], int, int, int, int)">simpleMerge</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,            int&nbsp;first,            int&nbsp;second,            int&nbsp;third,            int&nbsp;on)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private static&nbsp;int</CODE></FONT></TD>
<TD><CODE><B>NonLeafElement.</B><B><A HREF="../../rtree/NonLeafElement.html#getMid(rtree.Element, int)">getMid</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt,       int&nbsp;on)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;A private class to calculate the mid value in given dimension</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#insertElement(rtree.Element)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;to add an element at the end     As elements are allocated to this node, each allocated      element's children node's parent are reset.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#writeLastElement(rtree.Element)">writeLastElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This func.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#insertElement(rtree.Element[], boolean)">insertElement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,              boolean&nbsp;updateChldrn)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;to add more than onr element at the end.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#writeLastElements(rtree.Element[])">writeLastElements</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method helps in bulk loading.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A></CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#getLeastEnlargement(rtree.Element)">getLeastEnlargement</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns the element(of the current node) whose rectangle needs the least      enlargment to include <code>elmt</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<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>&nbsp;elmtM1,          long&nbsp;slotIndex)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;See ./Logic.txt     Linear split Algo.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;int[]</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#lnrPickSeeds(rtree.Element[])">lnrPickSeeds</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The linear Pick Seed method from Guttman.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;int[]</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#quadPickSeeds(rtree.Element[])">quadPickSeeds</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The quadratic Pick Seed method from Guttman.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Node.</B><B><A HREF="../../rtree/Node.html#modifyElement(int, rtree.Element)">modifyElement</A></B>(int&nbsp;index,              <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;elmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Used to overwrite the old Element with the new one.</TD>
</TR>
</TABLE>
&nbsp;
<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> with parameters of type <A HREF="../../rtree/Element.html" title="class in rtree">Element</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../rtree/Node.html#Node(java.io.RandomAccessFile, java.lang.String, long, boolean, rtree.Element[], rtree.FileHdr, int, long, int, int, boolean, rtree.Rect)">Node</A></B>(java.io.RandomAccessFile&nbsp;file,

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -