<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>GEOS: IntervalRTreeNode.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<h1>IntervalRTreeNode.h</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/**********************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> * $Id: IntervalRTreeNode.h 2554 2009-06-06 21:14:51Z strk $</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * GEOS - Geometry Engine Open Source</span>
<a name="l00005"></a>00005 <span class="comment"> * http://geos.refractions.net</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Copyright (C) 2006 Refractions Research Inc.</span>
<a name="l00008"></a>00008 <span class="comment"> *</span>
<a name="l00009"></a>00009 <span class="comment"> * This is free software; you can redistribute and/or modify it under</span>
<a name="l00010"></a>00010 <span class="comment"> * the terms of the GNU Lesser General Public Licence as published</span>
<a name="l00011"></a>00011 <span class="comment"> * by the Free Software Foundation. </span>
<a name="l00012"></a>00012 <span class="comment"> * See the COPYING file for more information.</span>
<a name="l00013"></a>00013 <span class="comment"> *</span>
<a name="l00014"></a>00014 <span class="comment"> *</span>
<a name="l00015"></a>00015 <span class="comment"> **********************************************************************/</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="preprocessor">#ifndef GEOS_INDEX_INTERVALRTREE_INTERVALRTREENODE_H</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="preprocessor">#define GEOS_INDEX_INTERVALRTREE_INTERVALRTREENODE_H</span>
<a name="l00019"></a>00019 <span class="preprocessor"></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <geos/platform.h></span>
<a name="l00021"></a>00021 <span class="preprocessor">#include <vector></span>
<a name="l00022"></a>00022 <span class="preprocessor">#include <limits></span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="comment">// forward declarations</span>
<a name="l00025"></a>00025 <span class="keyword">namespace </span>geos {
<a name="l00026"></a>00026 <span class="keyword">namespace </span>index {
<a name="l00027"></a>00027 <span class="keyword">class </span>ItemVisitor;
<a name="l00028"></a>00028 }
<a name="l00029"></a>00029 }
<a name="l00030"></a>00030
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="keyword">namespace </span>geos {
<a name="l00033"></a>00033 <span class="keyword">namespace </span>index {
<a name="l00034"></a>00034 <span class="keyword">namespace </span>intervalrtree {
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="keyword">class </span>IntervalRTreeNode
<a name="l00037"></a>00037 {
<a name="l00038"></a>00038 <span class="keyword">private</span>:
<a name="l00039"></a>00039 <span class="keyword">protected</span>:
<a name="l00040"></a>00040 <span class="keywordtype">double</span> min;
<a name="l00041"></a>00041 <span class="keywordtype">double</span> max;
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keywordtype">bool</span> intersects( <span class="keywordtype">double</span> queryMin, <span class="keywordtype">double</span> queryMax)<span class="keyword"> const</span>
<a name="l00044"></a>00044 <span class="keyword"> </span>{
<a name="l00045"></a>00045 <span class="keywordflow">if</span> (min > queryMax || max < queryMin)
<a name="l00046"></a>00046 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keyword">public</span>:
<a name="l00052"></a>00052 <span class="keyword">typedef</span> std::vector<const IntervalRTreeNode *> ConstVect;
<a name="l00053"></a>00053
<a name="l00054"></a>00054 IntervalRTreeNode()
<a name="l00055"></a>00055 : min( DoubleInfinity ),
<a name="l00056"></a>00056 max( DoubleNegInfinity )
<a name="l00057"></a>00057 { }
<a name="l00058"></a>00058
<a name="l00059"></a>00059 IntervalRTreeNode( <span class="keywordtype">double</span> min, <span class="keywordtype">double</span> max)
<a name="l00060"></a>00060 : min( min ),
<a name="l00061"></a>00061 max( max )
<a name="l00062"></a>00062 { }
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">virtual</span> ~IntervalRTreeNode()
<a name="l00065"></a>00065 { }
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keywordtype">double</span> getMin()<span class="keyword"> const</span>
<a name="l00068"></a>00068 <span class="keyword"> </span>{
<a name="l00069"></a>00069 <span class="keywordflow">return</span> min;
<a name="l00070"></a>00070 }
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keywordtype">double</span> getMax()<span class="keyword"> const </span>
<a name="l00073"></a>00073 <span class="keyword"> </span>{
<a name="l00074"></a>00074 <span class="keywordflow">return</span> max;
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="keyword">virtual</span> <span class="keywordtype">void</span> query( <span class="keywordtype">double</span> queryMin, <span class="keywordtype">double</span> queryMax, ItemVisitor * visitor) <span class="keyword">const</span> =0;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="comment">//std::string toString()</span>
<a name="l00080"></a>00080 <span class="comment">//{</span>
<a name="l00081"></a>00081 <span class="comment">// return WKTWriter.toLineString(new Coordinate(min, 0), new Coordinate(max, 0));</span>
<a name="l00082"></a>00082 <span class="comment">//}</span>
<a name="l00083"></a>00083
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="comment">//class NodeComparator </span>
<a name="l00086"></a>00086 <span class="comment">//{</span>
<a name="l00087"></a>00087 <span class="comment">//public:</span>
<a name="l00088"></a>00088 <span class="keyword">static</span> <span class="keywordtype">bool</span> compare( <span class="keyword">const</span> IntervalRTreeNode * n1, <span class="keyword">const</span> IntervalRTreeNode * n2)
<a name="l00089"></a>00089 {
<a name="l00090"></a>00090 <span class="comment">//IntervalRTreeNode * n1 = dynamic_cast<IntervalRTreeNode *>( o1);</span>
<a name="l00091"></a>00091 <span class="comment">//IntervalRTreeNode * n2 = dynamic_cast<IntervalRTreeNode *>( o2);</span>
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="keywordtype">double</span> mid1 = (n1->getMin() + n1->getMax()) / 2;
<a name="l00094"></a>00094 <span class="keywordtype">double</span> mid2 = (n2->getMin() + n2->getMax()) / 2;
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="comment">//if (mid1 < mid2) return -1;</span>
<a name="l00097"></a>00097 <span class="comment">//if (mid1 > mid2) return 1;</span>
<a name="l00098"></a>00098 <span class="comment">//return 0;</span>
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <span class="keywordflow">return</span> mid1 > mid2;
<a name="l00101"></a>00101 }
<a name="l00102"></a>00102 <span class="comment">//};</span>
<a name="l00103"></a>00103
<a name="l00104"></a>00104 };
<a name="l00105"></a>00105
<a name="l00106"></a>00106 } <span class="comment">// geos::index::intervalrtree</span>
<a name="l00107"></a>00107 } <span class="comment">// geos::index</span>
<a name="l00108"></a>00108 } <span class="comment">// geos</span>
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <span class="preprocessor">#endif // GEOS_INDEX_INTERVALRTREE_INTERVALRTREENODE_H</span>
<a name="l00111"></a>00111 <span class="preprocessor"></span><span class="comment">/**********************************************************************</span>
<a name="l00112"></a>00112 <span class="comment"> * $Log$</span>
<a name="l00113"></a>00113 <span class="comment"> **********************************************************************/</span>
<a name="l00114"></a>00114
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Thu Jul 22 2010 for GEOS by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.1 </small></address>
</body>
</html>
