AnalysisMisc.h File Reference

#include <math.h>
#include <vector>
#include <algorithm>
#include "CxxUtils/fpcompare.h"
#include "AthContainers/DataVector.h"
#include "TruthUtils/MagicNumbers.h"
#include <type_traits>
#include "CLHEP/Vector/LorentzVector.h"
#include "EventKernel/INavigable4Momentum.h"

Include dependency graph for AnalysisMisc.h:

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

Go to the source code of this file.

Classes
struct	AnalysisUtils::Sort::Private::dosort_imp< b >
struct	AnalysisUtils::Sort::Private::dosort_imp< true >

Namespaces
namespace	AnalysisUtils
	utility class to select combination of elements in a collection
namespace	AnalysisUtils::Delta
	compute \( \Delta \)
namespace	AnalysisUtils::Imass
	compute Invariant mass
namespace	AnalysisUtils::Match
	find the closest element in a collection to an INavigable4Momentum
namespace	AnalysisUtils::Sort
	sort
namespace	AnalysisUtils::Sort::Private
namespace	AnalysisUtils::Classify
	classify

Functions
double	AnalysisUtils::Delta::phi (const INavigable4Momentum *p1, const INavigable4Momentum *p2)
	\( \Delta\phi \)
double	AnalysisUtils::Delta::R (const INavigable4Momentum *p1, const double v_eta, const double v_phi)
	\( \Delta{R} \)
double	AnalysisUtils::Delta::R (const INavigable4Momentum *p1, const INavigable4Momentum *p2)
	\( \Delta{R} \)
double	AnalysisUtils::Imass::two (const INavigable4Momentum *p1, const INavigable4Momentum *p2)
double	AnalysisUtils::Imass::four (const INavigable4Momentum *p1, const INavigable4Momentum *p2, const INavigable4Momentum *p3, const INavigable4Momentum *p4)
template<class COLL>
bool	AnalysisUtils::Match::R (const double eta, const double phi, COLL *coll, int &index, double &deltaR, const int pdg)
	find the closest element in R
template<class COLL>
bool	AnalysisUtils::Match::R (const double eta, const double phi, const double e, COLL *coll, int &index, double &deltaR, const int pdg, double &deltaE)
	find the closest element in R - with a condition on E
template<class COLL>
bool	AnalysisUtils::Match::R (const INavigable4Momentum *t, COLL *coll, int &index, double &deltaR, const int pdg)
	find the closest element in R
template<class COLL>
bool	AnalysisUtils::Match::R (const INavigable4Momentum *t, COLL *coll, int &index, double &deltaR, const int pdg, double &deltaE)
	find the closest element in R - with a condition on E
template<class COLL>
bool	AnalysisUtils::Match::R (const double eta, const double phi, COLL *coll, int &index, double &deltaR)
	find the closest element in R (not check PDG ID)
template<class COLL>
bool	AnalysisUtils::Match::R (const double eta, const double phi, const double e, COLL *coll, int &index, double &deltaR, double &deltaE)
	find the closest element in R (not check PDG ID) - with a condition on E
template<class COLL>
bool	AnalysisUtils::Match::R (const INavigable4Momentum *t, COLL *coll, int &index, double &deltaR)
	find the closest element in R (not check PDG ID)
template<class COLL>
bool	AnalysisUtils::Match::R (const INavigable4Momentum *t, COLL *coll, int &index, double &deltaR, double &deltaE)
	find the closest element in R (not check PDG ID) - with a condition on E
template<class T>
bool	AnalysisUtils::Sort::Private::compPt (T a, T b)
template<class T>
bool	AnalysisUtils::Sort::Private::compE (T a, T b)
template<class T>
bool	AnalysisUtils::Sort::Private::compEta (T a, T b)
template<class T>
bool	AnalysisUtils::Sort::Private::compPhi (T a, T b)
template<class COLL, class COMP>
void	AnalysisUtils::Sort::Private::dosort (COLL &coll, COMP comp)
template<class COLL>
void	AnalysisUtils::Sort::pT (COLL *coll)
	sort by pT
template<class COLL>
void	AnalysisUtils::Sort::e (COLL *coll)
	sort by e
template<class COLL>
void	AnalysisUtils::Sort::eta (COLL *coll)
	sort by eta
template<class COLL>
void	AnalysisUtils::Sort::phi (COLL *coll)
	sort by phi
template<class COLL>
void	AnalysisUtils::Classify::charge (COLL *coll, std::vector< typename COLL::value_type > &pos, std::vector< typename COLL::value_type > &neg)
	classify by charge