#include <TumbleTree.hpp>
|  | 
| Cell * | buildTree (vector< Cell * > &cells, int start, int end) | 
|  | 
| Cell * | find (double sc, VertexHandle vH, Cell *c, double alpha=1) | 
|  | 
| Cell * | findMax (Cell *c) | 
|  | 
| Cell * | findMin (Cell *c) | 
|  | 
| void | getCellsAsVector (Cell *c, vector< Cell * > &cells) | 
|  | 
| void | inorder (Cell *c) | 
|  | 
| Cell * | insert (Cell *c, double sc, VertexHandle vH) | 
|  | 
| Cell * | makeEmpty (Cell *c) | 
|  | 
| int | maxDepth (Cell *cell) | 
|  | 
| int | minDepth (Cell *cell) | 
|  | 
| int | numLeafes (Cell *c) | 
|  | 
| Cell * | remove (double sc, VertexHandle vH, Cell *c, bool removeWhole=false) | 
|  | 
| int | size (Cell *c) | 
|  | 
| int | sumDepth (Cell *c, int currentDepth=1) | 
|  | 
| void | update (double alpha) | 
|  | 
Definition at line 24 of file TumbleTree.hpp.
 
◆ TumbleTree()
      
        
          | lvr2::TumbleTree::TumbleTree | ( |  | ) |  | 
      
 
 
◆ ~TumbleTree()
      
        
          | lvr2::TumbleTree::~TumbleTree | ( |  | ) |  | 
      
 
 
◆ avgDepth()
      
        
          | int lvr2::TumbleTree::avgDepth | ( |  | ) |  | 
      
 
 
◆ balance()
      
        
          | void lvr2::TumbleTree::balance | ( |  | ) |  | 
      
 
 
◆ buildTree()
  
  | 
        
          | Cell* lvr2::TumbleTree::buildTree | ( | vector< Cell * > & | cells, |  
          |  |  | int | start, |  
          |  |  | int | end |  
          |  | ) |  |  |  | private | 
 
 
◆ display()
      
        
          | void lvr2::TumbleTree::display | ( |  | ) |  | 
      
 
 
◆ find() [1/2]
◆ find() [2/2]
◆ findMax()
  
  | 
        
          | Cell* lvr2::TumbleTree::findMax | ( | Cell * | c | ) |  |  | private | 
 
 
◆ findMin()
  
  | 
        
          | Cell* lvr2::TumbleTree::findMin | ( | Cell * | c | ) |  |  | private | 
 
 
◆ getCellsAsVector()
  
  | 
        
          | void lvr2::TumbleTree::getCellsAsVector | ( | Cell * | c, |  
          |  |  | vector< Cell * > & | cells |  
          |  | ) |  |  |  | private | 
 
 
◆ inorder()
  
  | 
        
          | void lvr2::TumbleTree::inorder | ( | Cell * | c | ) |  |  | private | 
 
 
◆ insert() [1/2]
◆ insert() [2/2]
◆ makeCell()
◆ makeEmpty()
  
  | 
        
          | Cell* lvr2::TumbleTree::makeEmpty | ( | Cell * | c | ) |  |  | private | 
 
 
◆ max()
      
        
          | Cell* lvr2::TumbleTree::max | ( |  | ) |  | 
      
 
 
◆ maxDepth() [1/2]
      
        
          | int lvr2::TumbleTree::maxDepth | ( |  | ) |  | 
      
 
 
◆ maxDepth() [2/2]
  
  | 
        
          | int lvr2::TumbleTree::maxDepth | ( | Cell * | cell | ) |  |  | private | 
 
 
◆ min()
      
        
          | Cell* lvr2::TumbleTree::min | ( |  | ) |  | 
      
 
 
◆ minDepth() [1/2]
      
        
          | int lvr2::TumbleTree::minDepth | ( |  | ) |  | 
      
 
 
◆ minDepth() [2/2]
  
  | 
        
          | int lvr2::TumbleTree::minDepth | ( | Cell * | cell | ) |  |  | private | 
 
 
◆ numLeafes()
  
  | 
        
          | int lvr2::TumbleTree::numLeafes | ( | Cell * | c | ) |  |  | private | 
 
 
◆ remove() [1/2]
◆ remove() [2/2]
◆ size() [1/2]
      
        
          | int lvr2::TumbleTree::size | ( |  | ) |  | 
      
 
 
◆ size() [2/2]
  
  | 
        
          | int lvr2::TumbleTree::size | ( | Cell * | c | ) |  |  | private | 
 
 
◆ sumDepth()
  
  | 
        
          | int lvr2::TumbleTree::sumDepth | ( | Cell * | c, |  
          |  |  | int | currentDepth = 1 |  
          |  | ) |  |  |  | private | 
 
 
◆ update()
  
  | 
        
          | void lvr2::TumbleTree::update | ( | double | alpha | ) |  |  | private | 
 
 
◆ updateSC()
      
        
          | void lvr2::TumbleTree::updateSC | ( | double | alpha | ) |  | 
      
 
 
◆ notDeleted
      
        
          | int lvr2::TumbleTree::notDeleted = 0 | 
      
 
 
◆ root
  
  | 
        
          | Cell* lvr2::TumbleTree::root |  | private | 
 
 
The documentation for this class was generated from the following file: