#include "fastjet/ClusterSequence.hh"Include dependency graph for FjClusterSequence.hh:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.
Typedefs | |
| typedef fastjet::ClusterSequence | FjClusterSequence | 
| typedef which provides backwards compatibility for user programs based on the v1 interface   | |
| typedef fastjet::Strategy | FjStrategy | 
| typedef which provides backwards compatibility for user programs based on the v1 interface   | |
Variables | |
| const FjStrategy | N2MinHeapTiled = fastjet::N2MinHeapTiled | 
| experimental ...   | |
| const FjStrategy | N2Tiled = fastjet::N2Tiled | 
| fastest from about 50..10^4   | |
| const FjStrategy | N2PoorTiled = fastjet::N2PoorTiled | 
| legacy   | |
| const FjStrategy | N2Plain = fastjet::N2Plain | 
| fastest below 50   | |
| const FjStrategy | N3Dumb = fastjet::N3Dumb | 
| worse even than the usual N^3 algorithms   | |
| const FjStrategy | Best = fastjet::Best | 
| automatic selection of the best (based on N)   | |
| const FjStrategy | NlnN = fastjet::NlnN | 
| best of the NlnN variants -- best overall for N>10^4   | |
| const FjStrategy | NlnN3pi = fastjet::NlnN3pi | 
| legacy N ln N using 3pi coverage of cylinder   | |
| const FjStrategy | NlnN4pi = fastjet::NlnN4pi | 
| legacy N ln N using 4pi coverage of cylinder   | |
| const FjStrategy | NlnNCam4pi = fastjet::NlnNCam4pi | 
| Chan's closest pair method (in a variant with 4pi coverage), for use exclusively with the Cambridge algorithm.   | |
| const FjStrategy | NlnNCam2pi2R = fastjet::NlnNCam2pi2R | 
| const FjStrategy | NlnNCam = fastjet::NlnNCam | 
      
  | 
  
| 
 typedef which provides backwards compatibility for user programs based on the v1 interface 
 Definition at line 40 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 typedef which provides backwards compatibility for user programs based on the v1 interface 
 Definition at line 44 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 automatic selection of the best (based on N) 
 Definition at line 62 of file FjClusterSequence.hh. Referenced by main().  | 
  
      
  | 
  
| 
 experimental ... 
 Definition at line 52 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 fastest below 50 
 Definition at line 58 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 legacy 
 Definition at line 56 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 fastest from about 50..10^4 
 Definition at line 54 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 worse even than the usual N^3 algorithms 
 Definition at line 60 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 best of the NlnN variants -- best overall for N>10^4 
 Definition at line 64 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 legacy N ln N using 3pi coverage of cylinder 
 Definition at line 66 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 legacy N ln N using 4pi coverage of cylinder 
 Definition at line 68 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 
 Definition at line 73 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 
 Definition at line 72 of file FjClusterSequence.hh.  | 
  
      
  | 
  
| 
 Chan's closest pair method (in a variant with 4pi coverage), for use exclusively with the Cambridge algorithm. 
 Definition at line 71 of file FjClusterSequence.hh.  | 
  
 1.4.2