Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest.  
 More...
#include <hpp/fcl/broadphase/detail/simple_interval.h>
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest. 
 
◆ ~SimpleInterval()
  
  
      
        
          | hpp::fcl::detail::SimpleInterval::~SimpleInterval  | 
          ( | 
           | ) | 
           | 
         
       
   | 
  
virtual   | 
  
 
 
◆ print()
  
  
      
        
          | void hpp::fcl::detail::SimpleInterval::print  | 
          ( | 
           | ) | 
           | 
         
       
   | 
  
virtual   | 
  
 
 
◆ high
      
        
          | FCL_REAL hpp::fcl::detail::SimpleInterval::high | 
        
      
 
 
◆ low
      
        
          | FCL_REAL hpp::fcl::detail::SimpleInterval::low | 
        
      
 
interval is defined as [low, high] 
 
 
The documentation for this struct was generated from the following files: