#include <beam.h>
◆ beam()
template<class T > 
  
  
      
        
          | Beam::beam< T >::beam  | 
          ( | 
          size_t  | 
          beam_size,  | 
         
        
           | 
           | 
          float  | 
          prune_coeff = FLT_MAX,  | 
         
        
           | 
           | 
          bool(*)(T *, T *)  | 
          test_equiv = nullptr,  | 
         
        
           | 
           | 
          bool  | 
          kbest = false  | 
         
        
           | 
          ) | 
           |  | 
         
       
   | 
  
inline   | 
  
 
 
◆ ~beam()
◆ begin()
◆ compact()
template<class T > 
  
  
      
        
          | void Beam::beam< T >::compact  | 
          ( | 
          void(*)(T *)  | 
          free_data = nullptr | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
 
◆ do_recombination()
◆ empty()
◆ end()
◆ erase()
template<class T > 
  
  
      
        
          | void Beam::beam< T >::erase  | 
          ( | 
          void(*)(T *)  | 
          free_data = nullptr | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
 
◆ get_beam_size()
◆ get_best_item()
◆ insert()
template<class T > 
  
  
      
        
          | bool Beam::beam< T >::insert  | 
          ( | 
          T *  | 
          data,  | 
         
        
           | 
           | 
          float  | 
          cost,  | 
         
        
           | 
           | 
          uint32_t  | 
          hash  | 
         
        
           | 
          ) | 
           |  | 
         
       
   | 
  
inline   | 
  
 
 
◆ maybe_compact()
template<class T > 
  
  
      
        
          | void Beam::beam< T >::maybe_compact  | 
          ( | 
          void(*)(T *)  | 
          free_data = nullptr | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
 
◆ might_insert()
◆ pop_best_item()
◆ size()
The documentation for this class was generated from the following file:
- /__w/vowpal_wabbit/vowpal_wabbit/vowpalwabbit/beam.h