leaf.html

一个java实现的R树

<A HREF="../rtree/AbstractNode.html#condenseTree(java.util.Vector)">condenseTree</A>, 
<A HREF="../rtree/AbstractNode.html#deleteData(int)">deleteData</A>, 
<A HREF="../rtree/AbstractNode.html#getHyperCubes()">getHyperCubes</A>, 
<A HREF="../rtree/AbstractNode.html#getLevel()">getLevel</A>, 
<A HREF="../rtree/AbstractNode.html#getNodeMbb()">getNodeMbb</A>, 
<A HREF="../rtree/AbstractNode.html#getParent()">getParent</A>, 
<A HREF="../rtree/AbstractNode.html#getUniqueId()">getUniqueId</A>, 
<A HREF="../rtree/AbstractNode.html#isIndex()">isIndex</A>, 
<A HREF="../rtree/AbstractNode.html#isLeaf()">isLeaf</A>, 
<A HREF="../rtree/AbstractNode.html#isRoot()">isRoot</A>, 
<A HREF="../rtree/AbstractNode.html#pickSeeds()">pickSeeds</A>, 
<A HREF="../rtree/AbstractNode.html#quadraticSplit(rtree.HyperCube, int)">quadraticSplit</A>, 
<A HREF="../rtree/AbstractNode.html#toString()">toString</A></CODE></TD>
</TR>
</TABLE>
&nbsp;<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, 
wait, 
wait, 
wait</CODE></TD>
</TR>
</TABLE>
&nbsp;
<P>

<!-- ============ FIELD DETAIL =========== -->


<!-- ========= 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="Leaf(rtree.RTree, int, int)"><!-- --></A><H3>
Leaf</H3>
<PRE>
protected <B>Leaf</B>(<A HREF="../rtree/RTree.html">RTree</A>&nbsp;tree,
               int&nbsp;parent,
               int&nbsp;pageNumber)</PRE>
<DL>
</DL>
<HR>

<A NAME="Leaf(rtree.RTree, int)"><!-- --></A><H3>
Leaf</H3>
<PRE>
protected <B>Leaf</B>(<A HREF="../rtree/RTree.html">RTree</A>&nbsp;tree,
               int&nbsp;parent)</PRE>
<DL>
</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="chooseLeaf(rtree.HyperCube)"><!-- --></A><H3>
chooseLeaf</H3>
<PRE>
protected <A HREF="../rtree/Leaf.html">Leaf</A> <B>chooseLeaf</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD><B>Description copied from class: <A HREF="../rtree/AbstractNode.html">AbstractNode</A></B></DD>
<DD>chooseLeaf finds the most appropriate leaf where the given HyperCube should be stored.<DD><DL>
<DT><B>Overrides:</B><DD><A HREF="../rtree/AbstractNode.html#chooseLeaf(rtree.HyperCube)">chooseLeaf</A> in class <A HREF="../rtree/AbstractNode.html">AbstractNode</A></DL>
</DD>
<DD><B>Tags copied from class: <A HREF="../rtree/AbstractNode.html">AbstractNode</A></B></DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The new HyperCube.<DT><B>Returns:</B><DD>The leaf where the new HyperCube should be inserted.</DL>
</DD>
</DL>
<HR>

<A NAME="findLeaf(rtree.HyperCube)"><!-- --></A><H3>
findLeaf</H3>
<PRE>
protected <A HREF="../rtree/Leaf.html">Leaf</A> <B>findLeaf</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD><B>Description copied from class: <A HREF="../rtree/AbstractNode.html">AbstractNode</A></B></DD>
<DD>findLeaf returns the leaf that contains the given hypercube, null if the hypercube is not
 contained in any of the leaves of this node.<DD><DL>
<DT><B>Overrides:</B><DD><A HREF="../rtree/AbstractNode.html#findLeaf(rtree.HyperCube)">findLeaf</A> in class <A HREF="../rtree/AbstractNode.html">AbstractNode</A></DL>
</DD>
<DD><B>Tags copied from class: <A HREF="../rtree/AbstractNode.html">AbstractNode</A></B></DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The HyperCube to search for.<DT><B>Returns:</B><DD>The leaf where the HyperCube is contained, null if such a leaf is not found.</DL>
</DD>
</DL>
<HR>

<A NAME="insert(rtree.HyperCube, int)"><!-- --></A><H3>
insert</H3>
<PRE>
protected int <B>insert</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h,
                     int&nbsp;page)</PRE>
<DL>
<DD>Inserts a new HyperCube into the Leaf. If there is space left, then the insertion is straightforward and
 adjustTree must be called. Otherwise, a split must occur and two new leaves must be created.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The HyperCube that represents the MBB of the data.<DD><CODE>page</CODE> - The page number where the real data resides.<DT><B>Returns:</B><DD>The page number of the Leaf where the hypercube was inserted.</DL>
</DD>
</DL>
<HR>

<A NAME="delete(rtree.HyperCube)"><!-- --></A><H3>
delete</H3>
<PRE>
protected int <B>delete</B>(<A HREF="../rtree/HyperCube.html">HyperCube</A>&nbsp;h)</PRE>
<DL>
<DD>Deletes an entry for the leaf.
 [A. Guttman 'R-trees a dynamic index structure for spatial searching']
 3.3. Deletion<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h</CODE> - The hypercube that corresponds to the entry to be deleted.<DT><B>Returns:</B><DD>The data pointer of the deleted entry.</DL>
</DD>
</DL>
<HR>

<A NAME="getDataPointer(int)"><!-- --></A><H3>
getDataPointer</H3>
<PRE>
public int <B>getDataPointer</B>(int&nbsp;i)</PRE>
<DL>
<DD>Returns the pointer of the <i>i-th</i> data entry.<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - The index of the child in the data array.<DT><B>Returns:</B><DD>The pointer of the <i>i-th</i> child.</DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<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="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="class-use/Leaf.html"><FONT ID="NavBarFont1"><B>Use</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../overview-tree.html"><FONT ID="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../deprecated-list.html"><FONT ID="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../index-all.html"><FONT ID="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../help-doc.html"><FONT ID="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>
  </TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>

<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
&nbsp;<A HREF="../rtree/Index.html"><B>PREV CLASS</B></A>&nbsp;
&nbsp;<A HREF="../rtree/MemoryPageFile.html"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../index.html" TARGET="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="Leaf.html" TARGET="_top"><B>NO FRAMES</B></A></FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
  SUMMARY: &nbsp;INNER&nbsp;|&nbsp;<A HREF="#fields_inherited_from_class_rtree.AbstractNode">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: &nbsp;FIELD&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<!-- =========== END OF NAVBAR =========== -->

<HR>

</BODY>
</HTML>