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