sweepline.html

来自「本程序是由JAVA实现的R-树新建、结点增加、删除功能。」· HTML 代码 · 共 451 行 · 第 1/2 页

HTML
451
字号
<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>
&nbsp;
<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="intPred"><!-- --></A><H3>
intPred</H3>
<PRE>
<A HREF="../../rtree/join/IntersectPred.html" title="class in rtree.join">IntersectPred</A> <B>intPred</B></PRE>
<DL>
<DL>
</DL>
</DL>
<HR>

<A NAME="pred"><!-- --></A><H3>
pred</H3>
<PRE>
<A HREF="../../rtree/join/Predicate.html" title="class in rtree.join">Predicate</A> <B>pred</B></PRE>
<DL>
<DL>
</DL>
</DL>

<!-- ========= CONSTRUCTOR DETAIL ======== -->

<A NAME="constructor_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Constructor Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="SweepLine()"><!-- --></A><H3>
SweepLine</H3>
<PRE>
public <B>SweepLine</B>()</PRE>
<DL>
</DL>
<HR>

<A NAME="SweepLine(rtree.join.Predicate)"><!-- --></A><H3>
SweepLine</H3>
<PRE>
public <B>SweepLine</B>(<A HREF="../../rtree/join/Predicate.html" title="class in rtree.join">Predicate</A>&nbsp;pred)</PRE>
<DL>
</DL>

<!-- ============ METHOD DETAIL ========== -->

<A NAME="method_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=1><FONT SIZE="+2">
<B>Method Detail</B></FONT></TD>
</TR>
</TABLE>

<A NAME="setPredicate(rtree.join.Predicate)"><!-- --></A><H3>
setPredicate</H3>
<PRE>
public void <B>setPredicate</B>(<A HREF="../../rtree/join/Predicate.html" title="class in rtree.join">Predicate</A>&nbsp;pred)</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getPredicate()"><!-- --></A><H3>
getPredicate</H3>
<PRE>
public <A HREF="../../rtree/join/Predicate.html" title="class in rtree.join">Predicate</A> <B>getPredicate</B>()</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="sort(rtree.Rect[])"><!-- --></A><H3>
sort</H3>
<PRE>
public void <B>sort</B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>[]&nbsp;rects)</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="sort(rtree.Element[])"><!-- --></A><H3>
sort</H3>
<PRE>
public void <B>sort</B>(<A HREF="../../rtree/Element.html" title="class in rtree">Element</A>[]&nbsp;elmts)</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="intersects(rtree.Rect, rtree.Element[])"><!-- --></A><H3>
intersects</H3>
<PRE>
public java.util.List <B>intersects</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)</PRE>
<DL>
<DD>This method will return all the pointers of <code>elmts</code> which intersect with <code>rect</code>. It is expected that <code>elmts</code> are sorted acording to <code>minX</code>
<P>
<DD><DL>
<DT><B>Returns:</B><DD>either a <code>List</code> of eithers pointers or ehole elements depending upon <code>p</code>.</DL>
</DD>
</DL>
<HR>

<A NAME="intersects(rtree.Element[], rtree.Element[])"><!-- --></A><H3>
intersects</H3>
<PRE>
public java.util.List <B>intersects</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)</PRE>
<DL>
<DD>This method applies the sweep line algorithm to the two given set of elements. It is not necessary to have the two arrays sorted (by minX).
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="sortedIntersectionTest(rtree.Element[], rtree.Element[])"><!-- --></A><H3>
sortedIntersectionTest</H3>
<PRE>
public java.util.List <B>sortedIntersectionTest</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)</PRE>
<DL>
<DD>Does the sweep sort on the two sets. Assumes that both the set of elements are of the same type.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>ltElmts</CODE> - The sorted elements(by minX) of the left node.<DD><CODE>rtElmts</CODE> - The sorted elements(by minX) of the right node.<DT><B>Returns:</B><DD>A <code>List</code> of <code>Pair</code> of elements</DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<HR>

<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A><A HREF="#skip-navbar_bottom" title="Skip navigation links"></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=3 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
  <TR ALIGN="center" VALIGN="top">
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="class-use/SweepLine.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../help-doc.html"><FONT CLASS="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/join/Predicate.html" title="class in rtree.join"><B>PREV CLASS</B></A>&nbsp;
&nbsp;NEXT CLASS</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../../index.html" target="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="SweepLine.html" target="_top"><B>NO FRAMES</B></A>  &nbsp;
&nbsp;<SCRIPT type="text/javascript">
  <!--
  if(window==top) {
    document.writeln('<A HREF="../../allclasses-noframe.html"><B>All Classes</B></A>');
  }
  //-->
</SCRIPT>
<NOSCRIPT>
  <A HREF="../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
  SUMMARY:&nbsp;NESTED&nbsp;|&nbsp;<A HREF="#field_summary">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;<A HREF="#field_detail">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A><!-- ======== END OF BOTTOM NAVBAR ======= -->

<HR>

</BODY>
</HTML>

⌨️ 快捷键说明

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