RTree/rtree.h at master · JasonBrownDeveloper/RTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#ifndef _RTREE_
#define _RTREE_

/*
 * Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching
 * Proc. 1984 ACM SIGMOD International Conference on Management of Data, pp. 47-57.
 * ISBN 0-89791-128-8
 * http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf
 */

#include <stdbool.h> /*bool*/
#include <stddef.h> /*size_t*/
#include <stdint.h> /*uint_fast8_t, int_fast32_t*/

typedef int_fast32_t RTdimension;
typedef uint_fast8_t RTdimensionindex;
typedef uint_fast8_t RTchildindex;

#define RTn 2     /*dimensions; sizeof dimensionindex*/
#define RTPS 4096 /*Pagesize*/

struct RTNodeList {
   struct RTNodeList *Next;
   void *Tuple;
   RTdimension I[RTn*2];
};

struct RTNode;
typedef struct RTNode * RTreePtr;

bool RTNewTree(RTreePtr *T, struct RTNodeList *list);
bool RTSelectTuple(RTreePtr *T, RTdimension S[], struct RTNodeList **list, size_t *count);
bool RTSelectDimensions(RTreePtr *T, RTdimension I[]);
bool RTInsertTuple(RTreePtr *T, RTdimension I[], void *Tuple);
bool RTDeleteTuple(RTreePtr *T, RTdimension I[], void *Tuple);
bool RTUpdateTuple(RTreePtr *T, RTdimension I[], void *Tuple, void *New);
bool RTUpdateDimensions(RTreePtr *T, RTdimension I[], void *Tuple, RTdimension New[]);
bool RTFreeTree(RTreePtr *T);

#ifdef RTREE_DEBUG
bool RTTrace(struct RTNode *Start, size_t Level, size_t AbsChild, struct RTNode **Out);
bool RTDump(struct RTNode *Start, const char *filename);
#endif

#endif /* _RTREE_ */