![]() |
Analysis Software
Documentation for sPHENIX simulation software
|
#include "fastjet/ClusterSequence.hh"#include <vector>#include <iostream>#include <fstream>#include <cstdio>#include <cstdlib>#include <cassert>#include "TTree.h"#include "TFile.h"#include "eicsmear/erhic/EventBase.h"#include "eicsmear/erhic/EventPythia.h"#include "eicsmear/erhic/Particle.h"#include "eicsmear/erhic/ParticleMC.h"#include "eicsmear/smear/EventSmear.h"#include "eicsmear/smear/ParticleMCS.h"
Include dependency graph for fill_jet_tree.C:Go to the source code of this file.
Functions | |
| PseudoJet * | find_matching_jet (const PseudoJet *refjet, vector< PseudoJet > *vjets) |
| int | main (int argc, char *argv[]) |
Find jet in given vector of jets that's closest in eta-phi to reference jet
Definition at line 26 of file fill_jet_tree.C.
View newest version in sPHENIX GitHub at line 26 of file fill_jet_tree.C
References eta, and ActsTests::PropagationDatasets::phi.
Referenced by main().
Here is the caller graph for this function:| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Main function
Definition at line 64 of file fill_jet_tree.C.
View newest version in sPHENIX GitHub at line 64 of file fill_jet_tree.C
References antikt_algorithm, assert, E, eta, find_matching_jet(), j, ofile, writeMapConfig::outFileName, ActsTests::PropagationDatasets::phi, graph_fancy::pT, and sorted_by_pt().
Here is the call graph for this function: