{
Node_t *x = RTreeNewNode(rtp);
x->level = 0; /* leaf */
- rtp->LeafCount++;
return x;
}
}
Node_t *newroot = RTreeNewNode(rtp); /* grow a new root, make tree taller */
- rtp->NonLeafCount++;
newroot->level = (*n)->level + 1;
b.rect = NodeCover(*n);
b.child = *n;
/* counters used even when StatFlag not set */
int RectCount;
int NodeCount;
- int LeafCount, NonLeafCount;
int EntryCount;
int SearchCount;
int HitCount;
}
assert(new);
SplitNode(rtp, n, b, new);
- if (n->level == 0)
- rtp->LeafCount++;
- else
- rtp->NonLeafCount++;
return 1;
}
}