61 #include "fastjet/PseudoJet.hh" 
   62 #include "fastjet/ClusterSequence.hh" 
   71 void print_jets (
const vector<fastjet::PseudoJet> &);
 
   76   vector<fastjet::PseudoJet> input_particles;
 
   79   double px, py , pz, E;
 
   80   while (cin >> px >> py >> pz >> E) {
 
   98   cout << 
"Strategy adopted by FastJet was "<<
 
  103   vector<fastjet::PseudoJet> inclusive_jets = clust_seq.
inclusive_jets(ptmin);
 
  106   cout << 
"Printing inclusive jets with pt > "<< ptmin<<
" GeV\n";
 
  107   cout << 
"---------------------------------------\n";
 
  113   vector<fastjet::PseudoJet> exclusive_jets = clust_seq.
exclusive_jets(dcut);
 
  116   cout << 
"Printing exclusive jets with dcut = "<< dcut<<
" GeV^2\n";
 
  117   cout << 
"--------------------------------------------\n";
 
  129   vector<fastjet::PseudoJet> sorted_jets = sorted_by_pt(jets);  
 
  132   printf(
"%5s %15s %15s %15s %15s\n",
"jet #", 
"rapidity", 
 
  133          "phi", 
"pt", 
"n constituents");
 
  136   for (
unsigned int i = 0; i < sorted_jets.size(); i++) {
 
  139     int n_constituents = sorted_jets[i].constituents().size();
 
  140     printf(
"%5u %15.8f %15.8f %15.8f %8u\n",
 
  141            i, sorted_jets[i].rap(), sorted_jets[i].phi(),
 
  142            sorted_jets[i].perp(), n_constituents);
 
std::vector< PseudoJet > exclusive_jets(const double dcut) const 
return a vector of all jets (in the sense of the exclusive algorithm) that would be obtained when run...
 
int main()
an example program showing how to use fastjet 
 
std::vector< PseudoJet > inclusive_jets(const double ptmin=0.0) const 
return a vector of all jets (in the sense of the inclusive algorithm) with pt >= ptmin. 
 
the longitudinally invariant kt algorithm 
 
std::string description() const 
return a textual description of the current jet definition 
 
void print_jets(const vector< fastjet::PseudoJet > &)
a function that pretty prints a list of jets 
 
RecombinationScheme
The various recombination schemes. 
 
automatic selection of the best (based on N), including the LazyTiled strategies that are new to FJ3...
 
Strategy
the various options for the algorithmic strategy to adopt in clustering events with kt and cambridge ...
 
Class to contain pseudojets, including minimal information of use to jet-clustering routines...
 
class that is intended to hold a full definition of the jet clusterer 
 
std::string strategy_string() const 
return the name of the strategy used to cluster the event