38 int hitCount = 0, notfound;
55 for (i = s[top].
branch_id; i <
t->nodecard; i++) {
73 for (i = 0; i <
t->leafcard; i++) {
110 int top = 0, down = 0;
119 while (s[top].
sn->
level > level) {
148 else if (result == 2) {
152 else if (result == 1) {
199 result = RTreeInsertRect2M(
r,
child, level, &newnode,
t,
200 &reInsertList, overflow);
206 newroot->
level =
t->rootlevel;
209 b->child.ptr =
t->root;
213 b->child.ptr = newnode;
223 while (reInsertList) {
226 level = reInsertList->
level;
228 reInsertList = reInsertList->
next;
232 RTreeInsertRect2M(&(
b->rect),
b->child, level, &newnode,
t,
233 &reInsertList, overflow);
239 newroot->
level =
t->rootlevel;
242 b->child.ptr =
t->root;
246 b->child.ptr = newnode;
270 int top = 0, down = 0;
281 while (notfound && top >= 0) {
285 for (i = s[top].
branch_id; i <
t->nodecard; i++) {
306 for (i = 0; i <
t->leafcard; i++) {
308 s[top].sn->branch[i].child.id == child.
id) {
331 minfill = (s[down].
sn->
level ?
t->min_node_fill :
t->min_leaf_fill);
332 if (s[down].
sn->
count >= minfill) {
361 if (!RTreeDeleteRect2M(
r, child,
t, &reInsertList)) {
365 while (reInsertList) {
367 n = reInsertList->
node;
369 for (i = 0; i <
t->nodecard; i++) {
377 for (i = 0; i <
t->leafcard; i++) {
385 reInsertList = reInsertList->
next;
394 for (i = 0; i <
t->nodecard; i++) {
int RTreeAddBranch(struct RTree_Branch *, struct RTree_Node *, struct RTree_Node **, struct RTree_ListBranch **, struct RTree_Rect *, char *, struct RTree *)
void RTreeDisconnectBranch(struct RTree_Node *, int, struct RTree *)
void RTreeNodeCover(struct RTree_Node *, struct RTree_Rect *, struct RTree *)
void RTreeCopyBranch(struct RTree_Branch *, struct RTree_Branch *, struct RTree *)
int RTreePickBranch(struct RTree_Rect *, struct RTree_Node *, struct RTree *)
int RTreeExpandRect(struct RTree_Rect *, struct RTree_Rect *, struct RTree *)
#define RTreeCopyRect(r1, r2, t)
int RTreeDeleteRectM(struct RTree_Rect *r, union RTree_Child child, struct RTree *t)
int RTreeSearchM(struct RTree *t, struct RTree_Rect *r, SearchHitCallback *shcb, void *cbarg)
int RTreeValidChildM(union RTree_Child *child)
int RTreeInsertRectM(struct RTree_Rect *r, union RTree_Child child, int level, struct RTree *t)
#define assert(condition)
void RTreeFreeNode(struct RTree_Node *n)
struct RTree_Node * RTreeAllocNode(struct RTree *t, int level)
int RTreeOverlap(struct RTree_Rect *r, struct RTree_Rect *s, struct RTree *t)
int SearchHitCallback(int id, const struct RTree_Rect *rect, void *arg)
struct RTree_ListBranch * next
struct RTree_ListNode * next
struct RTree_Branch * branch
void RTreeFreeListNode(struct RTree_ListNode *p)
void RTreeReInsertNode(struct RTree_Node *n, struct RTree_ListNode **ee)
void RTreeFreeListBranch(struct RTree_ListBranch *p)
#define MAXLEVEL
Maximum verbosity level.