📄 rect.html
字号:
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTreeClient.</B><B><A HREF="../../rtree/RTreeClient.html#containedBy(rtree.Rect)">containedBy</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTreeClient.</B><B><A HREF="../../rtree/RTreeClient.html#equal(rtree.Rect)">equal</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTreeClient.</B><B><A HREF="../../rtree/RTreeClient.html#meet(rtree.Rect)">meet</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTreeClient.</B><B><A HREF="../../rtree/RTreeClient.html#contains(rtree.Rect)">contains</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#overlaps(rtree.Rect)">overlaps</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR overlap a search MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostOvrlap(rtree.Node, rtree.Rect)">getRPostOvrlap</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all overlaping elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#overlapsSweep(rtree.Rect)">overlapsSweep</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostOvrlapSweep(rtree.Node, rtree.Rect)">getRPostOvrlapSweep</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#nonDisjoint(rtree.Rect)">nonDisjoint</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR intsersect a search MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostIntsect(rtree.Node, rtree.Rect)">getRPostIntsect</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all intersecting elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#containedBy(rtree.Rect)">containedBy</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR are enclosed by the MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostContBy(rtree.Node, rtree.Rect)">getRPostContBy</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#equal(rtree.Rect)">equal</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR are geometrically equal to MBR 'rect' An Vector is returned.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostEqual(rtree.Node, rtree.Rect)">getRPostEqual</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#meet(rtree.Rect)">meet</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR meet on the sides of MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostMeet(rtree.Node, rtree.Rect)">getRPostMeet</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#contains(rtree.Rect)">contains</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Find all index records whose MBR enclose/contain the MBR 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#getRPostContains(rtree.Node, rtree.Rect)">getRPostContains</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Given any node it traverses a tree in a recursive post order manner fetching all the enclosed(inside 'rect') elements in the leaves.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#expandToInclude(rtree.Rect)">expandToInclude</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Include the given Rectangle.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#getResultingMBR(rtree.Rect)">getResultingMBR</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rectangle)</CODE>
<BR>
return the minimum bounding rectangle of this rectangle and the passed rectangle.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#getResultingMBR(rtree.Rect, rtree.Rect)">getResultingMBR</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> source, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> dest)</CODE>
<BR>
Overloaded type of the previous function - but static</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#getResultingMBR(rtree.Rect[])">getResultingMBR</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>[] rects)</CODE>
<BR>
Another overloaded version - but static</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A></CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#getResultingMBR(rtree.Rect[], rtree.Rect)">getResultingMBR</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A>[] rects, <A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Another overloaded version - but static</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#contains(rtree.Rect)">contains</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Checks if this rectangle contains 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#encloses(rtree.Rect)">encloses</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
The difference betn.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#containedBy(rtree.Rect)">containedBy</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Check if this rectangle is contained by 'rect'</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#overlaps(rtree.Rect)">overlaps</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
This method also gives whether one point is over another, if you do not want that much precision then comment the line.This will improve performance.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#disjoint(rtree.Rect)">disjoint</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Saperate or not(Egenhofer).</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#meet(rtree.Rect)">meet</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Checks if both the rectangles meet or not.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#covers(rtree.Rect)">covers</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Checks if this rectangle contains 'rect'.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B>Rect.</B><B><A HREF="../../rtree/Rect.html#equals(rtree.Rect)">equals</A></B>(<A HREF="../../rtree/Rect.html" title="class in rtree">Rect</A> rect)</CODE>
<BR>
Checks if this rectangle is equal to 'rect'</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>static long</CODE></FONT></TD>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -