15 #ifndef GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H 16 #define GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H 18 #include <geos/export.h> 20 #include <geos/index/strtree/AbstractNode.h> 59 ItemsListItem(
void *item_)
64 ItemsListItem(ItemsList* item_)
70 type get_type()
const {
return t; }
72 void* get_geometry()
const 74 assert(t == item_is_geometry);
77 ItemsList* get_itemslist()
const 79 assert(t == item_is_list);
90 class ItemsList :
public std::vector<ItemsListItem>
93 typedef std::vector<ItemsListItem> base_type;
95 static void delete_item(ItemsListItem& item)
97 if (ItemsListItem::item_is_list == item.t)
104 std::for_each(begin(), end(), &ItemsList::delete_item);
108 void push_back(
void* item)
110 this->base_type::push_back(ItemsListItem(item));
114 void push_back_owned(ItemsList* itemList)
116 this->base_type::push_back(ItemsListItem(itemList));
152 virtual std::auto_ptr<BoundableList> sortBoundables(
const BoundableList* input)=0;
154 bool remove(
const void* searchBounds,
AbstractNode& node,
void* item);
176 virtual bool intersects(
const void* aBounds,
177 const void* bBounds)=0;
184 std::vector <AbstractNode *> *nodes;
193 virtual std::auto_ptr<BoundableList> createParentBoundables(
198 assert(!nodes->empty());
209 virtual void insert(
const void* bounds,
void* item);
212 void query(
const void* searchBounds, std::vector<void*>& foundItems);
215 std::vector<void*>* query(
const void* searchBounds) {
217 vector<void*>* matches =
new vector<void*>();
218 query(searchBounds, *matches);
222 void query(
const void* searchBounds, ItemVisitor& visitor);
225 void query(
const void* searchBounds,
const AbstractNode& node, ItemVisitor& visitor);
228 bool remove(
const void* itemEnv,
void* item);
230 std::auto_ptr<BoundableList> boundablesAtLevel(
int level);
233 std::size_t nodeCapacity;
241 virtual IntersectsOp *getIntersectsOp()=0;
255 nodeCapacity(newNodeCapacity)
257 assert(newNodeCapacity>1);
260 static bool compareDoubles(
double a,
double b) {
265 return ( a < b ) ? true :
false;
268 virtual ~AbstractSTRtree();
276 virtual void build();
283 virtual void query(
const void* searchBounds,
const AbstractNode* node, std::vector<void*>* matches);
295 virtual void boundablesAtLevel(
int level,
AbstractNode* top,
312 ItemsList* itemsTree();
320 #endif // GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H virtual std::size_t getNodeCapacity()
Definition: AbstractSTRtree.h:281
Base class for STRtree and SIRtree.
Definition: AbstractSTRtree.h:132
AbstractSTRtree(std::size_t newNodeCapacity)
Definition: AbstractSTRtree.h:250
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...
Definition: AbstractSTRtree.h:166
A visitor for items in an index.
Definition: ItemVisitor.h:29
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
A node of the STR tree.
Definition: AbstractNode.h:42
std::vector< Boundable * > BoundableList
A list of boundables. TODO: use a list.
Definition: AbstractSTRtree.h:44