📄 illegalvalueexception.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--NewPage-->
<HTML>
<HEAD>
<!-- Generated by javadoc (build 1.4.2_04) on Wed Sep 08 18:10:22 IST 2004 -->
<TITLE>
Uses of Class rtree.IllegalValueException
</TITLE>
<LINK REL ="stylesheet" TYPE="text/css" HREF="../../stylesheet.css" TITLE="Style">
<SCRIPT type="text/javascript">
function windowTitle()
{
parent.document.title="Uses of Class rtree.IllegalValueException";
}
</SCRIPT>
</HEAD>
<BODY BGCOLOR="white" onload="windowTitle();">
<!-- ========= START OF TOP NAVBAR ======= -->
<A NAME="navbar_top"><!-- --></A><A HREF="#skip-navbar_top" 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_top_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> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../rtree/IllegalValueException.html" title="class in rtree"><FONT CLASS="NavBarFont1"><B>Class</B></FONT></A> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Use</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../index-files/index-1.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
</EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
PREV
NEXT</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../index.html" target="_top"><B>FRAMES</B></A>
<A HREF="IllegalValueException.html" target="_top"><B>NO FRAMES</B></A>
<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>
</TABLE>
<A NAME="skip-navbar_top"></A><!-- ========= END OF TOP NAVBAR ========= -->
<HR>
<CENTER>
<H2>
<B>Uses of Class<br>rtree.IllegalValueException</B></H2>
</CENTER>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TD COLSPAN=2><FONT SIZE="+2">
Packages that use <A HREF="../../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><A HREF="#rtree"><B>rtree</B></A></TD>
<TD> </TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><A HREF="#rtree.seeded"><B>rtree.seeded</B></A></TD>
<TD> </TD>
</TR>
</TABLE>
<P>
<A NAME="rtree"><!-- --></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/IllegalValueException.html" title="class in rtree">IllegalValueException</A> in <A HREF="../../rtree/package-summary.html">rtree</A></FONT></TD>
</TR>
</TABLE>
<P>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableSubHeadingColor">
<TD COLSPAN=2>Methods in <A HREF="../../rtree/package-summary.html">rtree</A> that throw <A HREF="../../rtree/IllegalValueException.html" title="class in rtree">IllegalValueException</A></FONT></TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <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> elmt)</CODE>
<BR>
See <b>Guttman the Great</b>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <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#findLeaf(rtree.Node, rtree.LeafElement)">findLeaf</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/LeafElement.html" title="class in rtree">LeafElement</A> elmt)</CODE>
<BR>
Basically it returns the node that <b>may</b> contain the required element.</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>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>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>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>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>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>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>private java.util.Vector</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#trvsRPost(rtree.Node, boolean)">trvsRPost</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, boolean del)</CODE>
<BR>
Traverses the tree recursively in post order.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private void</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#trvsRPrePrint(rtree.Node)">trvsRPrePrint</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node)</CODE>
<BR>
Traverses the tree recursively in post order.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="../../rtree/ABL.html" title="class in rtree">ABL</A>[]</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#nearestSearch(rtree.Point, long, int)">nearestSearch</A></B>(<A HREF="../../rtree/Point.html" title="class in rtree">Point</A> pt, long range, int n)</CODE>
<BR>
<b>Read Me Well.</b><br> The Nearest Neighbour(NN) search from Roussopoulos and Cheung.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>private <A HREF="../../rtree/ABL.html" title="class in rtree">ABL</A>[]</CODE></FONT></TD>
<TD><CODE><B>RTree.</B><B><A HREF="../../rtree/RTree.html#INNSearch(rtree.Node, rtree.Point, rtree.ABL[], rtree.RTree.Nearest)">INNSearch</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Point.html" title="class in rtree">Point</A> pt, <A HREF="../../rtree/ABL.html" title="class in rtree">ABL</A>[] nrstElements, <A HREF="../../rtree/RTree.Nearest.html" title="class in rtree">RTree.Nearest</A> nrstDist)</CODE>
<BR>
Improved Nearest Neighbour Search - Cheung, theory Roussopoulos</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#nearestSearch(rtree.Point, long)">nearestSearch</A></B>(<A HREF="../../rtree/Point.html" title="class in rtree">Point</A> pt, long range)</CODE>
<BR>
Another version of the <code>nearestSearch</code> method(not overloaded).</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#INNSearch(rtree.Node, rtree.Point, java.util.Vector, long)">INNSearch</A></B>(<A HREF="../../rtree/Node.html" title="class in rtree">Node</A> node, <A HREF="../../rtree/Point.html" title="class in rtree">Point</A> pt, java.util.Vector nrstElements, long nrstDist)</CODE>
<BR>
</TD>
</TR>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -