/*
* Add a node to the reinsertion list. All its branches will later
* be reinserted into the index structure.
*/
static void RTreeReInsert(struct Node *n, struct ListNode **ee)
{
register struct ListNode *l;
l = RTreeNewListNode();
l->node = n;
l->next = *ee;
*ee = l;
}
/* Add a node to the reinsertion list. All its branches will later
* be reinserted into the index structure.
*/
static int RTreeReInsert(RTree_t * rtp, Node_t * n, struct ListNode **ee)
{
register struct ListNode *l;
if (!(l = RTreeNewListNode()))
return -1;
l->node = n;
l->next = *ee;
*ee = l;
return 0;
}