#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include <stdlib.h>
Go to the source code of this file.
|
class | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES > |
|
class | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::Iterator |
| Iterator is not remove safe. More...
|
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::Iterator::StackElement |
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::Rect |
| Minimal bounding rectangle (n-dimensional) More...
|
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::Branch |
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::Node |
| Node for each branch level. More...
|
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::ListNode |
| A link list of nodes for reinsertion after a delete operation. More...
|
|
struct | RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::PartitionVars |
| Variables for finding a split partition. More...
|
|
class | RTFileStream |
|
|
#define | ASSERT assert |
|
#define | RTREE_TEMPLATE template<class DATATYPE, class ELEMTYPE, int NUMDIMS, class ELEMTYPEREAL, int TMAXNODES, int TMINNODES> |
|
#define | RTREE_QUAL RTree<DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES> |
|
#define | RTREE_DONT_USE_MEMPOOLS |
|
#define | RTREE_USE_SPHERICAL_VOLUME |
|
◆ ASSERT
◆ RTREE_DONT_USE_MEMPOOLS
#define RTREE_DONT_USE_MEMPOOLS |
◆ RTREE_QUAL
#define RTREE_QUAL RTree<DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES> |
◆ RTREE_TEMPLATE
#define RTREE_TEMPLATE template<class DATATYPE, class ELEMTYPE, int NUMDIMS, class ELEMTYPEREAL, int TMAXNODES, int TMINNODES> |
◆ RTREE_USE_SPHERICAL_VOLUME
#define RTREE_USE_SPHERICAL_VOLUME |