37 fprintf(stdout,
"Hit data rect %d\n",
id - 1);
46 fprintf(stdout,
"nrects = %d\n",
nrects);
57 for (i = 0; i <
nrects; i++)
60 fprintf(stdout,
"Search resulted in %d hits\n", nhits);
int RTreeSearch(struct Node *N, struct Rect *R, SearchHitCallback shcb, void *cbarg)
int RTreeInsertRect(struct Rect *R, int Tid, struct Node **Root, int Level)
struct Node * RTreeNewIndex(void)
int MySearchCallback(int id, void *arg)