45#include "fastjet/PseudoJet.hh"
46#include "fastjet/ClusterSequenceArea.hh"
47#include "fastjet/ClusterSequencePassiveArea.hh"
50#include "fastjet/config.h"
52#ifdef ENABLE_PLUGIN_SISCONE
53#include "fastjet/SISConePlugin.hh"
63void print_jets (
const vector<fastjet::PseudoJet> &);
68 vector<fastjet::PseudoJet> input_particles;
71 double px, py , pz, E;
72 while (cin >> px >> py >> pz >> E) {
89 bool use_voronoi =
false;
91 double ghost_etamax = 6.0;
92 double ghost_area = 0.01;
93 int active_area_repeats = 1;
102 double effective_Rfact = 1.0;
120 cout <<
"Jet definition was: " << jet_def.description() << endl;
121 cout <<
"Area definition was: " << area_def.
description() << endl;
122 cout <<
"Strategy adopted by FastJet was "<<
123 clust_seq.strategy_string()<<endl<<endl;
127 vector<fastjet::PseudoJet> inclusive_jets = clust_seq.inclusive_jets(ptmin);
130 cout <<
"Printing inclusive jets with pt > "<< ptmin<<
" GeV\n";
131 cout <<
"---------------------------------------\n";
132 print_jets(inclusive_jets);
136 cout <<
"Number of unclustered particles: "
137 << clust_seq.unclustered_particles().size() << endl;
145void print_jets (
const vector<fastjet::PseudoJet> & unsorted_jets) {
148 vector<fastjet::PseudoJet> jets =
sorted_by_pt(unsorted_jets);
150 printf(
" ijet rap phi Pt area +- err\n");
151 for (
unsigned int j = 0; j < jets.size(); j++) {
153 double area = jets[j].area();
154 double area_error = jets[j].area_error();
156 printf(
"%5u %9.5f %8.5f %10.3f %8.3f +- %6.3f\n",j,jets[j].rap(),
157 jets[j].phi(),jets[j].perp(), area, area_error);
int main()
an example program showing how to use fastjet
class that holds a generic area definition
std::string description() const
return a description of the current area definition
General class for user to obtain ClusterSequence with additional area information.
Parameters to configure the computation of jet areas using ghosts.
class that is intended to hold a full definition of the jet clusterer
Class to contain pseudojets, including minimal information of use to jet-clustering routines.
Specification for the computation of the Voronoi jet area.
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....
@ E_scheme
summing the 4-momenta
@ kt_algorithm
the longitudinally invariant kt algorithm
vector< PseudoJet > sorted_by_pt(const vector< PseudoJet > &jets)
return a vector of jets sorted into decreasing kt2