element.html

本程序是由JAVA实现的R-树新建、结点增加、删除功能。

     java.lang.String fileName,
     long nodeIndex,
     boolean sorted,
     <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,
     <A HREF="../../rtree/FileHdr.html" title="class in rtree">FileHdr</A>&nbsp;fileHdr,
     int&nbsp;totalElements,
     long&nbsp;parent,
     int&nbsp;elmtSize,
     int&nbsp;elmtType,
     boolean&nbsp;dirty,
     <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;nodeMBR)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;A stupid internal constructor for the clone method.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../rtree/ABL.html#ABL(rtree.Element, long)">ABL</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;element,
    long&nbsp;minDist)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
</TABLE>
&nbsp;
<P>
<A NAME="rtree.join"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=2><FONT SIZE="+2">
Uses of <A HREF="../../rtree/Element.html" title="class in rtree">Element</A> in <A HREF="../../rtree/join/package-summary.html">rtree.join</A></FONT></TD>
</TR>
</TABLE>
&nbsp;
<P>

<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Fields in <A HREF="../../rtree/join/package-summary.html">rtree.join</A> declared as <A HREF="../../rtree/Element.html" title="class in rtree">Element</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A></CODE></FONT></TD>
<TD><CODE><B>PairElmt.</B><B><A HREF="../../rtree/join/PairElmt.html#ltElmt">ltElmt</A></B></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;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A></CODE></FONT></TD>
<TD><CODE><B>PairElmt.</B><B><A HREF="../../rtree/join/PairElmt.html#rtElmt">rtElmt</A></B></CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD>
</TR>
</TABLE>
&nbsp;
<P>

<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in <A HREF="../../rtree/join/package-summary.html">rtree.join</A> that return <A HREF="../../rtree/Element.html" title="class in rtree">Element</A></FONT></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>PairElmt.</B><B><A HREF="../../rtree/join/PairElmt.html#getLtElmt()">getLtElmt</A></B>()</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>PairElmt.</B><B><A HREF="../../rtree/join/PairElmt.html#getRtElmt()">getRtElmt</A></B>()</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;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]</CODE></FONT></TD>
<TD><CODE><B>Join.</B><B><A HREF="../../rtree/join/Join.html#filterRect(rtree.Element[], rtree.Rect)">filterRect</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,
           <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method removes those elements from <code>elmts</code> that do not intersect <code>rect</code>.</TD>
</TR>
</TABLE>
&nbsp;
<P>

<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in <A HREF="../../rtree/join/package-summary.html">rtree.join</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 ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;void</CODE></FONT></TD>
<TD><CODE><B>SweepLine.</B><B><A HREF="../../rtree/join/SweepLine.html#sort(rtree.Element[])">sort</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;&nbsp;</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;java.util.List</CODE></FONT></TD>
<TD><CODE><B>SweepLine.</B><B><A HREF="../../rtree/join/SweepLine.html#intersects(rtree.Rect, rtree.Element[])">intersects</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect,
           <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 will return all the pointers of <code>elmts</code> which intersect with
 <code>rect</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;java.util.List</CODE></FONT></TD>
<TD><CODE><B>SweepLine.</B><B><A HREF="../../rtree/join/SweepLine.html#intersects(rtree.Element[], rtree.Element[])">intersects</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;ltElmts,
           <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;rtElmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method applies the sweep line algorithm to the two given set of elements.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;java.util.List</CODE></FONT></TD>
<TD><CODE><B>SweepLine.</B><B><A HREF="../../rtree/join/SweepLine.html#sortedIntersectionTest(rtree.Element[], rtree.Element[])">sortedIntersectionTest</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;ltElmts,
                       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;rtElmts)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Does the sweep sort on the two sets.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>abstract &nbsp;void</CODE></FONT></TD>
<TD><CODE><B>Predicate.</B><B><A HREF="../../rtree/join/Predicate.html#relate(rtree.Element, int, rtree.Element[], java.util.List, int)">relate</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;event,
       int&nbsp;from,
       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;others,
       java.util.List&nbsp;pairs,
       int&nbsp;evtSide)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Do the appropriate rtree operation.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>abstract &nbsp;boolean</CODE></FONT></TD>
<TD><CODE><B>Predicate.</B><B><A HREF="../../rtree/join/Predicate.html#relateMismatch(rtree.Element, rtree.Element, int)">relateMismatch</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;nlElmt,
               <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;lfElmt,
               int&nbsp;side)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This one is specifically for the case where one tree is longer then the other.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>&nbsp;<A HREF="../../rtree/join/Pair.html" title="class in rtree.join">Pair</A></CODE></FONT></TD>
<TD><CODE><B>PairElmt.</B><B><A HREF="../../rtree/join/PairElmt.html#paired(rtree.Element, rtree.Element)">paired</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;ltElmt,
       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;rtElmt)</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/join/Pair.html" title="class in rtree.join">Pair</A></CODE></FONT></TD>
<TD><CODE><B>Pair.</B><B><A HREF="../../rtree/join/Pair.html#paired(rtree.Element, rtree.Element)">paired</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;ltElmt,
       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;rtElmt)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns an object <code>this</code> type.</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>MeetPred.</B><B><A HREF="../../rtree/join/MeetPred.html#relate(rtree.Element, int, rtree.Element[], java.util.List, int)">relate</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;event,
       int&nbsp;from,
       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;others,
       java.util.List&nbsp;pairs,
       int&nbsp;evtSide)</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;boolean</CODE></FONT></TD>
<TD><CODE><B>MeetPred.</B><B><A HREF="../../rtree/join/MeetPred.html#relateMismatch(rtree.Element, rtree.Element, int)">relateMismatch</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;nlElmt,
               <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;lfElmt,
               int&nbsp;side)</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;java.util.List</CODE></FONT></TD>
<TD><CODE><B>Join.</B><B><A HREF="../../rtree/join/Join.html#joinMismatch(rtree.Element[], rtree.Element[], int)">joinMismatch</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;nlElmts,
             <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;lfElmts,
             int&nbsp;side)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Joins two nodes of different types.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private &nbsp;<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]</CODE></FONT></TD>
<TD><CODE><B>Join.</B><B><A HREF="../../rtree/join/Join.html#filterRect(rtree.Element[], rtree.Rect)">filterRect</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts,
           <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>&nbsp;rect)</CODE>

<BR>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method removes those elements from <code>elmts</code> that do not intersect <code>rect</code>.</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>IntersectPred.</B><B><A HREF="../../rtree/join/IntersectPred.html#relate(rtree.Element, int, rtree.Element[], java.util.List, int)">relate</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;event,
       int&nbsp;from,
       <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;others,
       java.util.List&nbsp;pairs,
       int&nbsp;evtSide)</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;boolean</CODE></FONT></TD>
<TD><CODE><B>IntersectPred.</B><B><A HREF="../../rtree/join/IntersectPred.html#relateMismatch(rtree.Element, rtree.Element, int)">relateMismatch</A></B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;ltElmt,
               <A HREF="../../rtree/Element.html" title="class in rtree">Element</A>&nbsp;rtElmt,