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> 57 ItemsListItem(
void* item_)
62 ItemsListItem(ItemsList* item_)
77 assert(t == item_is_geometry);
83 assert(t == item_is_list);
94 class ItemsList :
public std::vector<ItemsListItem> {
96 typedef std::vector<ItemsListItem> base_type;
99 delete_item(ItemsListItem& item)
101 if(ItemsListItem::item_is_list == item.t) {
109 std::for_each(begin(), end(), &ItemsList::delete_item);
114 push_back(
void* item)
116 this->base_type::push_back(ItemsListItem(item));
121 push_back_owned(ItemsList* itemList)
123 this->base_type::push_back(ItemsListItem(itemList));
143 BoundableList* itemBoundables;
156 BoundableList* boundablesOfALevel,
159 std::unique_ptr<BoundableList> sortBoundablesY(
const BoundableList* input);
161 bool remove(
const void* searchBounds,
AbstractNode& node,
void* item);
186 virtual bool intersects(
const void* aBounds,
187 const void* bBounds) = 0;
195 std::vector <AbstractNode*>* nodes;
204 virtual std::unique_ptr<BoundableList> createParentBoundables(
205 BoundableList* childBoundables,
int newLevel);
208 lastNode(BoundableList* nodeList)
210 assert(!nodeList->empty());
223 virtual void insert(
const void* bounds,
void* item);
226 void query(
const void* searchBounds, std::vector<void*>& foundItems);
229 void query(
const void* searchBounds,
ItemVisitor& visitor);
234 bool remove(
const void* itemEnv,
void* item);
236 std::unique_ptr<BoundableList> boundablesAtLevel(
int level);
239 std::size_t nodeCapacity;
259 itemBoundables(new BoundableList()),
261 nodeCapacity(newNodeCapacity)
263 assert(newNodeCapacity > 1);
276 virtual void build();
287 virtual void query(
const void* searchBounds,
const AbstractNode* node, std::vector<void*>* matches);
301 virtual void boundablesAtLevel(
int level,
AbstractNode* top,
302 BoundableList* boundables);
318 ItemsList* itemsTree();
326 #endif // GEOS_INDEX_STRTREE_ABSTRACTSTRTREE_H virtual std::size_t getNodeCapacity()
Returns the maximum number of child nodes that a node may have.
Definition: AbstractSTRtree.h:282
Base class for STRtree and SIRtree.
Definition: AbstractSTRtree.h:139
AbstractSTRtree(std::size_t newNodeCapacity)
Constructs an AbstractSTRtree with the specified maximum number of child nodes that a node may have...
Definition: AbstractSTRtree.h:256
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...
Definition: AbstractSTRtree.h:176
A visitor for items in an index.
Definition: ItemVisitor.h:29
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:26
A node of the STR tree.
Definition: AbstractNode.h:44
std::vector< Boundable * > BoundableList
A list of boundables. TODO: use a list.
Definition: AbstractSTRtree.h:44