63#include "fastjet/PseudoJet.hh"
64#include "fastjet/ClusterSequence.hh"
73void print_jets (
const vector<fastjet::PseudoJet> &);
78 vector<fastjet::PseudoJet> input_particles;
81 double px, py , pz, E;
82 while (cin >> px >> py >> pz >> E) {
100 cout <<
"Strategy adopted by FastJet was "<<
105 vector<fastjet::PseudoJet> inclusive_jets = clust_seq.
inclusive_jets(ptmin);
108 cout <<
"Printing inclusive jets with pt > "<< ptmin<<
" GeV\n";
109 cout <<
"---------------------------------------\n";
115 vector<fastjet::PseudoJet> exclusive_jets = clust_seq.
exclusive_jets(dcut);
118 cout <<
"Printing exclusive jets with dcut = "<< dcut<<
" GeV^2\n";
119 cout <<
"--------------------------------------------\n";
131 vector<fastjet::PseudoJet> sorted_jets = sorted_by_pt(jets);
134 printf(
"%5s %15s %15s %15s %15s\n",
"jet #",
"rapidity",
135 "phi",
"pt",
"n constituents");
138 for (
unsigned int i = 0; i < sorted_jets.size(); i++) {
141 int n_constituents = sorted_jets[i].constituents().size();
142 printf(
"%5u %15.8f %15.8f %15.8f %8u\n",
143 i, sorted_jets[i].rap(), sorted_jets[i].phi(),
144 sorted_jets[i].perp(), n_constituents);
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.
std::string strategy_string() const
return the name of the strategy used to cluster the event
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...
class that is intended to hold a full definition of the jet clusterer
std::string description() const
return a textual description of the current jet definition
Class to contain pseudojets, including minimal information of use to jet-clustering routines.
void print_jets(const vector< fastjet::PseudoJet > &)
a function that pretty prints a list of jets
int main()
an example program showing how to use fastjet
Strategy
the various options for the algorithmic strategy to adopt in clustering events with kt and cambridge ...
@ Best
automatic selection of the best (based on N), including the LazyTiled strategies that are new to FJ3....
RecombinationScheme
The various recombination schemes.
@ E_scheme
summing the 4-momenta
@ kt_algorithm
the longitudinally invariant kt algorithm