| BestBinarySplit(vector< BB_container * > *D, unsigned int m) | RTGS_tree< base_tree > | [inline, protected] |
| bulkLoad() | RTGS_tree< base_tree > | [inline] |
| BulkLoadChunk(vector< BB_container * > *D, unsigned int h) | RTGS_tree< base_tree > | [inline, protected] |
| cache | RTGS_tree< base_tree > | [protected] |
| containedIn(BB_type box) const | RTGS_tree< base_tree > | [inline, virtual] |
| cost_function(const BB_type *x, const BB_type *y) const | RTGS_tree< base_tree > | [inline, protected, virtual] |
| ensureReady() | RTGS_tree< base_tree > | [inline, virtual] |
| insert(BB_container *element) | RTGS_tree< base_tree > | [inline, virtual] |
| intersects(const vector< double > begin, const vector< double > end) const | RTGS_tree< base_tree > | [inline, virtual] |
| intersects(Point point) const | RTGS_tree< base_tree > | [inline, virtual] |
| intersects(vector< double > a, double b) const | RTGS_tree< base_tree > | [inline, virtual] |
| loaded | RTGS_tree< base_tree > | [protected] |
| neighboursOf(BB_container *item) const | RTGS_tree< base_tree > | [inline, virtual] |
| Partition(vector< BB_container * > *D, unsigned int m) | RTGS_tree< base_tree > | [inline, protected] |
| remove(BB_container *element) | RTGS_tree< base_tree > | [inline, virtual] |
| RHTGS_tree() | RHTGS_tree< base_tree > | [inline] |
| RHTGS_tree(R_tree_props *props) | RHTGS_tree< base_tree > | [inline] |
| RTGS_tree(double skip) | RTGS_tree< base_tree > | [inline] |
| RTGS_tree(R_tree_props *props, double skip) | RTGS_tree< base_tree > | [inline] |
| RTGS_tree() | RTGS_tree< base_tree > | [inline] |
| RTGS_tree(R_tree_props *props) | RTGS_tree< base_tree > | [inline] |
| search(BB_container *element) | RTGS_tree< base_tree > | [inline, virtual] |
| SKIP_PROBABILITY | RTGS_tree< base_tree > | [protected] |
| useOrderings() const | RHTGS_tree< base_tree > | [inline, protected, virtual] |
| ~RTGS_tree() | RTGS_tree< base_tree > | [inline, virtual] |
