<!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: AbstractSTRtree.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>AbstractSTRtree.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: AbstractSTRtree.h 2685 2009-10-20 16:59:30Z 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
<a name="l00016"></a>00016 <span class="preprocessor">#ifndef GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H</span>
<a name="l00017"></a>00017 <span class="preprocessor"></span><span class="preprocessor">#define GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span>
<a name="l00019"></a>00019 <span class="preprocessor">#include <geos/export.h></span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="preprocessor">#include <geos/index/strtree/AbstractNode.h></span> <span class="comment">// for inlines</span>
<a name="l00022"></a>00022
<a name="l00023"></a>00023 <span class="preprocessor">#include <vector></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include <list></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include <memory></span> <span class="comment">// for auto_ptr</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <cassert></span> <span class="comment">// for inlines</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include <algorithm></span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="comment">// Forward declarations</span>
<a name="l00030"></a>00030 <span class="keyword">namespace </span>geos {
<a name="l00031"></a>00031 <span class="keyword">namespace </span>index {
<a name="l00032"></a>00032 <span class="keyword">class </span>ItemVisitor;
<a name="l00033"></a>00033 <span class="keyword">namespace </span>strtree {
<a name="l00034"></a>00034 <span class="keyword">class </span>Boundable;
<a name="l00035"></a>00035 <span class="keyword">class </span>AbstractNode;
<a name="l00036"></a>00036 }
<a name="l00037"></a>00037 }
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="keyword">namespace </span>geos {
<a name="l00041"></a>00041 <span class="keyword">namespace </span>index { <span class="comment">// geos::index</span>
<a name="l00042"></a>00042 <span class="keyword">namespace </span>strtree { <span class="comment">// geos::index::strtree</span>
<a name="l00043"></a>00043
<a name="l00045"></a><a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe">00045</a> <span class="keyword">typedef</span> std::vector<Boundable*> BoundableList;
<a name="l00046"></a>00046 <span class="comment">//typedef std::list<Boundable*> BoundableList;</span>
<a name="l00047"></a>00047
<a name="l00050"></a>00050 <span class="keyword">class </span>ItemsList;
<a name="l00051"></a>00051
<a name="l00052"></a>00052 <span class="keyword">class </span>ItemsListItem
<a name="l00053"></a>00053 {
<a name="l00054"></a>00054 <span class="keyword">public</span>:
<a name="l00055"></a>00055 <span class="keyword">enum</span> type {
<a name="l00056"></a>00056 item_is_geometry,
<a name="l00057"></a>00057 item_is_list
<a name="l00058"></a>00058 };
<a name="l00059"></a>00059
<a name="l00060"></a>00060 ItemsListItem(<span class="keywordtype">void</span> *item_)
<a name="l00061"></a>00061 : t(item_is_geometry)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 item.g = item_;
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065 ItemsListItem(ItemsList* item_)
<a name="l00066"></a>00066 : t(item_is_list)
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068 item.l = item_;
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070
<a name="l00071"></a>00071 type get_type()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> t; }
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keywordtype">void</span>* get_geometry()<span class="keyword"> const</span>
<a name="l00074"></a>00074 <span class="keyword"> </span>{
<a name="l00075"></a>00075 assert(t == item_is_geometry);
<a name="l00076"></a>00076 <span class="keywordflow">return</span> item.g;
<a name="l00077"></a>00077 }
<a name="l00078"></a>00078 ItemsList* get_itemslist()<span class="keyword"> const</span>
<a name="l00079"></a>00079 <span class="keyword"> </span>{
<a name="l00080"></a>00080 assert(t == item_is_list);
<a name="l00081"></a>00081 <span class="keywordflow">return</span> item.l;
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083
<a name="l00084"></a>00084 type t;
<a name="l00085"></a>00085 <span class="keyword">union </span>{
<a name="l00086"></a>00086 <span class="keywordtype">void</span>* g;
<a name="l00087"></a>00087 ItemsList* l;
<a name="l00088"></a>00088 } item;
<a name="l00089"></a>00089 };
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="keyword">class </span>ItemsList : <span class="keyword">public</span> std::vector<ItemsListItem>
<a name="l00092"></a>00092 {
<a name="l00093"></a>00093 <span class="keyword">private</span>:
<a name="l00094"></a>00094 <span class="keyword">typedef</span> std::vector<ItemsListItem> base_type;
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="keyword">static</span> <span class="keywordtype">void</span> delete_item(ItemsListItem& item)
<a name="l00097"></a>00097 {
<a name="l00098"></a>00098 <span class="keywordflow">if</span> (ItemsListItem::item_is_list == item.t)
<a name="l00099"></a>00099 <span class="keyword">delete</span> <span class="keyword">reinterpret_cast<</span>ItemsList*<span class="keyword">></span>(item.item.l);
<a name="l00100"></a>00100 }
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keyword">public</span>:
<a name="l00103"></a>00103 ~ItemsList()
<a name="l00104"></a>00104 {
<a name="l00105"></a>00105 std::for_each(begin(), end(), &ItemsList::delete_item);
<a name="l00106"></a>00106 }
<a name="l00107"></a>00107
<a name="l00108"></a>00108 <span class="comment">// lists of items need to be deleted in the end</span>
<a name="l00109"></a>00109 <span class="keywordtype">void</span> push_back(<span class="keywordtype">void</span>* item)
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 this->base_type::push_back(ItemsListItem(item));
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="comment">// lists of items need to be deleted in the end</span>
<a name="l00115"></a>00115 <span class="keywordtype">void</span> push_back_owned(ItemsList* itemList)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 this->base_type::push_back(ItemsListItem(itemList));
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119 };
<a name="l00120"></a>00120
<a name="l00133"></a><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html">00133</a> <span class="keyword">class </span>GEOS_DLL <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html" title="Base class for STRtree and SIRtree.">AbstractSTRtree</a> {
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <span class="keyword">private</span>:
<a name="l00136"></a>00136 <span class="keywordtype">bool</span> built;
<a name="l00137"></a>00137 <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* itemBoundables;
<a name="l00138"></a>00138
<a name="l00149"></a>00149 <span class="keyword">virtual</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* createHigherLevels(
<a name="l00150"></a>00150 <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* boundablesOfALevel,
<a name="l00151"></a>00151 <span class="keywordtype">int</span> level);
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keyword">virtual</span> std::auto_ptr<BoundableList> sortBoundables(<span class="keyword">const</span> <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* input)=0;
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <span class="keywordtype">bool</span> <span class="keyword">remove</span>(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds, <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>& node, <span class="keywordtype">void</span>* item);
<a name="l00156"></a>00156 <span class="keywordtype">bool</span> removeItem(<a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>& node, <span class="keywordtype">void</span>* item);
<a name="l00157"></a>00157
<a name="l00158"></a>00158 ItemsList* itemsTree(<a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* node);
<a name="l00159"></a>00159
<a name="l00160"></a>00160 <span class="keyword">protected</span>:
<a name="l00161"></a>00161
<a name="l00167"></a><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree_1_1IntersectsOp.html">00167</a> <span class="keyword">class </span><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree_1_1IntersectsOp.html" title="A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...">IntersectsOp</a> {
<a name="l00168"></a>00168 <span class="keyword">public</span>:
<a name="l00177"></a>00177 <span class="keyword">virtual</span> <span class="keywordtype">bool</span> intersects(<span class="keyword">const</span> <span class="keywordtype">void</span>* aBounds,
<a name="l00178"></a>00178 <span class="keyword">const</span> <span class="keywordtype">void</span>* bBounds)=0;
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keyword">virtual</span> ~<a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree_1_1IntersectsOp.html" title="A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...">IntersectsOp</a>() {}
<a name="l00181"></a>00181 };
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a> *root;
<a name="l00184"></a>00184
<a name="l00185"></a>00185 std::vector <AbstractNode *> *nodes;
<a name="l00186"></a>00186
<a name="l00187"></a>00187 <span class="comment">// Ownership to caller (TODO: return by auto_ptr)</span>
<a name="l00188"></a>00188 <span class="keyword">virtual</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* createNode(<span class="keywordtype">int</span> level)=0;
<a name="l00189"></a>00189
<a name="l00194"></a>00194 <span class="keyword">virtual</span> std::auto_ptr<BoundableList> createParentBoundables(
<a name="l00195"></a>00195 <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* childBoundables, <span class="keywordtype">int</span> newLevel);
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="keyword">virtual</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* lastNode(<a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* nodes)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 assert(!nodes->empty());
<a name="l00200"></a>00200 <span class="comment">// Cast from Boundable to AbstractNode</span>
<a name="l00201"></a>00201 <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>*<span class="keyword">></span>( nodes->back() );
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="keyword">virtual</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* getRoot() {
<a name="l00205"></a>00205 assert(built);
<a name="l00206"></a>00206 <span class="keywordflow">return</span> root;
<a name="l00207"></a>00207 }
<a name="l00208"></a>00208
<a name="l00210"></a>00210 <span class="keyword">virtual</span> <span class="keywordtype">void</span> insert(<span class="keyword">const</span> <span class="keywordtype">void</span>* bounds,<span class="keywordtype">void</span>* item);
<a name="l00211"></a>00211
<a name="l00213"></a>00213 <span class="keywordtype">void</span> query(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds, std::vector<void*>& foundItems);
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="preprocessor">#if 0</span>
<a name="l00216"></a>00216 <span class="preprocessor"></span>
<a name="l00217"></a>00217 std::vector<void*>* query(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds) {
<a name="l00218"></a>00218 vector<void*>* matches = <span class="keyword">new</span> vector<void*>();
<a name="l00219"></a>00219 query(searchBounds, *matches);
<a name="l00220"></a>00220 <span class="keywordflow">return</span> matches;
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 <span class="preprocessor">#endif</span>
<a name="l00223"></a>00223 <span class="preprocessor"></span>
<a name="l00224"></a>00224 <span class="keywordtype">void</span> query(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds, ItemVisitor& visitor);
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keywordtype">void</span> query(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds, <span class="keyword">const</span> AbstractNode& node, ItemVisitor& visitor);
<a name="l00227"></a>00227
<a name="l00229"></a>00229 <span class="keywordtype">bool</span> <span class="keyword">remove</span>(<span class="keyword">const</span> <span class="keywordtype">void</span>* itemEnv, <span class="keywordtype">void</span>* item);
<a name="l00230"></a>00230
<a name="l00231"></a>00231 std::auto_ptr<BoundableList> boundablesAtLevel(<span class="keywordtype">int</span> level);
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="comment">// @@ should be size_t, probably</span>
<a name="l00234"></a>00234 <span class="keywordtype">size_t</span> nodeCapacity;
<a name="l00235"></a>00235
<a name="l00242"></a>00242 <span class="keyword">virtual</span> IntersectsOp *getIntersectsOp()=0;
<a name="l00243"></a>00243
<a name="l00244"></a>00244
<a name="l00245"></a>00245 <span class="keyword">public</span>:
<a name="l00246"></a>00246
<a name="l00251"></a><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html#a97bd6064fc952332d9b533b583f7fc4a">00251</a> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html" title="Base class for STRtree and SIRtree.">AbstractSTRtree</a>(<span class="keywordtype">size_t</span> newNodeCapacity)
<a name="l00252"></a>00252 :
<a name="l00253"></a>00253 built(false),
<a name="l00254"></a>00254 itemBoundables(new <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>()),
<a name="l00255"></a>00255 nodes(new std::vector<<a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a> *>()),
<a name="l00256"></a>00256 nodeCapacity(newNodeCapacity)
<a name="l00257"></a>00257 {
<a name="l00258"></a>00258 assert(newNodeCapacity>1);
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="keyword">static</span> <span class="keywordtype">bool</span> compareDoubles(<span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b) {
<a name="l00262"></a>00262 <span class="comment">// NOTE - strk:</span>
<a name="l00263"></a>00263 <span class="comment">// Ternary operation is a workaround for</span>
<a name="l00264"></a>00264 <span class="comment">// a probable MingW bug, see</span>
<a name="l00265"></a>00265 <span class="comment">// http://trac.osgeo.org/geos/ticket/293</span>
<a name="l00266"></a>00266 <span class="keywordflow">return</span> ( a < b ) ? <span class="keyword">true</span> : <span class="keyword">false</span>;
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keyword">virtual</span> ~AbstractSTRtree();
<a name="l00270"></a>00270
<a name="l00277"></a>00277 <span class="keyword">virtual</span> <span class="keywordtype">void</span> build();
<a name="l00278"></a>00278
<a name="l00282"></a><a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html#a6c8aaed8897c85483e5254c75902fb95">00282</a> <span class="keyword">virtual</span> <span class="keywordtype">size_t</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html#a6c8aaed8897c85483e5254c75902fb95">getNodeCapacity</a>() { <span class="keywordflow">return</span> nodeCapacity; }
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="keyword">virtual</span> <span class="keywordtype">void</span> query(<span class="keyword">const</span> <span class="keywordtype">void</span>* searchBounds, <span class="keyword">const</span> <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* node, std::vector<void*>* matches);
<a name="l00285"></a>00285
<a name="l00290"></a>00290 <span class="keywordtype">void</span> iterate(<a class="code" href="classgeos_1_1index_1_1ItemVisitor.html" title="A visitor for items in an index.">ItemVisitor</a>& visitor);
<a name="l00291"></a>00291
<a name="l00292"></a>00292
<a name="l00296"></a>00296 <span class="keyword">virtual</span> <span class="keywordtype">void</span> boundablesAtLevel(<span class="keywordtype">int</span> level, <a class="code" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html" title="A node of the STR tree.">AbstractNode</a>* top,
<a name="l00297"></a>00297 <a class="code" href="namespacegeos_1_1index_1_1strtree.html#add68ce1c4a60ff15e78bb77f47605dbe" title="A list of boundables. TODO: use a list.">BoundableList</a>* boundables);
<a name="l00298"></a>00298
<a name="l00313"></a>00313 ItemsList* itemsTree();
<a name="l00314"></a>00314 };
<a name="l00315"></a>00315
<a name="l00316"></a>00316
<a name="l00317"></a>00317 } <span class="comment">// namespace geos::index::strtree</span>
<a name="l00318"></a>00318 } <span class="comment">// namespace geos::index</span>
<a name="l00319"></a>00319 } <span class="comment">// namespace geos</span>
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="preprocessor">#endif // GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H</span>
<a name="l00322"></a>00322 <span class="preprocessor"></span>
<a name="l00323"></a>00323 <span class="comment">/**********************************************************************</span>
<a name="l00324"></a>00324 <span class="comment"> * $Log$</span>
<a name="l00325"></a>00325 <span class="comment"> * Revision 1.3 2006/06/12 10:49:43 strk</span>
<a name="l00326"></a>00326 <span class="comment"> * unsigned int => size_t</span>
<a name="l00327"></a>00327 <span class="comment"> *</span>
<a name="l00328"></a>00328 <span class="comment"> * Revision 1.2 2006/06/08 11:20:24 strk</span>
<a name="l00329"></a>00329 <span class="comment"> * Added missing virtual destructor to abstract classes.</span>
<a name="l00330"></a>00330 <span class="comment"> *</span>
<a name="l00331"></a>00331 <span class="comment"> * Revision 1.1 2006/03/21 10:47:34 strk</span>
<a name="l00332"></a>00332 <span class="comment"> * indexStrtree.h split</span>
<a name="l00333"></a>00333 <span class="comment"> *</span>
<a name="l00334"></a>00334 <span class="comment"> **********************************************************************/</span>
<a name="l00335"></a>00335
</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>
