CP::LhoodMM_tools Class Reference

#include <LhoodMM_tools.h>

Inheritance diagram for CP::LhoodMM_tools:

Public Member Functions
	LhoodMM_tools (const std::string &name)
	~LhoodMM_tools ()
virtual StatusCode	initialize () override
	Dummy implementation of the initialisation function.
virtual StatusCode	getTotalYield (float &yield, float &statErrUp, float &statErrDown) override final
	returns the accumulated fake lepton background yield (or compute it, in the case of the likelihood matrix method), and fills the registered histograms (if any) The 'selection' and 'process' settings used for these operations can be chosen with the 'Selection' and 'Process' properties.
virtual StatusCode	register1DHistogram (TH1 *h1, const float *val) override
	associates a 1D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'val' argument points to a variable corresponding to the X axis of the histogram and that needs to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime
virtual StatusCode	register2DHistogram (TH2 *h2, const float *xval, const float *yval) override
	associates a 2D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'xval' / 'yval' arguments point to variables corresponding to the X/Y axis of the histogram and that need to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime
virtual StatusCode	register3DHistogram (TH3 *h3, const float *xval, const float *yval, const float *zval) override
	associates a 3D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'xval' / 'yval' / 'zval' arguments point to variables corresponding to the X/Y/Z axis of the histogram and that need to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime
double	nfakes (Double_t *poserr, Double_t *negerr)
double	nfakes_std (double *error)
double	nfakes_std_perEventWeight (double *error)
StatusCode	setFitType (const std::string &ft)
Int_t	getFitStatus ()
void	setPrintLevel (Int_t printLevel)
void	set_do_std_perEventWeight (bool val)
virtual StatusCode	saveProgress (TDirectory *dir) override
StatusCode	mergeSubJobs ()
bool	perfectFit ()
virtual StatusCode	addEvent (const xAOD::IParticleContainer &particles, float extraWeight=1.f) override final
	supply list of leptons / global variables, internal counters incremented Does not return anything; event weight(s) must be retrieved by subsequent call(s) to getEventWeight() (for tools inheriting from ILinearFakeBkgTool)
virtual StatusCode	addEvent (const ConstDataVector< xAOD::IParticleContainer > &particles, float extraWeight=1.f) override final
	supply list of leptons / global variables, internal counters incremented Does not return anything; event weight(s) must be retrieved by subsequent call(s) to getEventWeight() (for tools inheriting from ILinearFakeBkgTool)
virtual bool	isAffectedBySystematic (const CP::SystematicVariation &systematic) const override
	Declare the interface that this class provides.
virtual CP::SystematicSet	affectingSystematics () const override
	the list of all systematics this tool can be affected by
virtual CP::SystematicSet	recommendedSystematics () const override
	the list of all systematics this tool recommends to use
virtual StatusCode	applySystematicVariation (const CP::SystematicSet &systConfig) override
	effects: configure this tool for the given list of systematic variations.
virtual CP::SystematicSet	affectingSystematicsFor (const std::string &nuisanceParameter) const override
	These functions are slow, don't use them in the tools implementations.
virtual std::string	getUncertaintyDescription (const CP::SystematicVariation &systematic) const override final
	returns a human-readable description of the source of systematic uncertainty specified as argument
virtual void	printUncertaintyDescription (const CP::SystematicVariation &systematic) const override final
	prints a human-readable description of the source of systematic uncertainty specified as argument
virtual bool	isSystematicUncertainty (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty originates from a systematic uncertainty in the efficiencies (as opposed to statistical)
virtual bool	isStatisticalUncertainty (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty originates from a statistical uncertainty in the efficiencies (as opposed to systematic)
virtual bool	affectsElectrons (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects electrons
virtual bool	affectsMuons (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects muons
virtual bool	affectsTaus (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects taus
virtual bool	affectsRealEfficiencies (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects real efficiencies
virtual bool	affectsFakeEfficiencies (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects fake efficiencies
virtual bool	affectsFakeFactors (const CP::SystematicVariation &systematic) const override final
	checks whether the specified source of uncertainty affects fake factors
virtual const IFakeBkgSystDescriptor &	getSystDescriptor () const override
	retrieves an interface to various helper methods to identify what the different SystematicVariations correspond to
virtual void	print () const
	Print the state of the tool.
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
Additional helper functions, not directly mimicking Athena
template<class T>
const T *	getProperty (const std::string &name) const
	Get one of the tool's properties.
const std::string &	msg_level_name () const __attribute__((deprecated))
	A deprecated function for getting the message level's name.
const std::string &	getName (const void *ptr) const
	Get the name of an object that is / should be in the event store.
SG::sgkey_t	getKey (const void *ptr) const
	Get the (hashed) key of an object that is in the event store.

Static Public Member Functions
static constexpr const char *	defaultSelection ()
	default value taken by the 'selection' argument of several methods or properties It indicates how the analysis selects leptons in the signal region The syntax supported for this arguments is described in the package documentation.
static constexpr const char *	defaultProcess ()
	default value taken by the 'process' argument of several methods or properties It indicates what should be treated as fake lepton background.

Protected Member Functions
virtual void	reset ()
virtual StatusCode	addEventCustom () override
virtual FakeBkgTools::Client	clientForDB () override final
	This indicates which type of efficiencies/fake factor need to be filled.
FakeBkgTools::FinalState	getCachedFinalState (uint8_t nparticles, const std::string &strPID, const std::string &strProc, bool &success)
std::string	getListOfEfficienciesAffectedBy (uint16_t uid) const
StatusCode	CheckHistogramCompatibility (const TH1 *lhs, const TH1 *rhs)
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Protected Attributes
bool	m_initialized = false
bool	m_needEventInfo = true
bool	m_convertWhenMissing = false
std::vector< FakeBkgTools::ParticleData >	m_particles
std::unique_ptr< FakeBkgTools::Database >	m_database
float	m_externalWeight
std::hash< std::string >	m_hasher
	comes from Event passed to addEvent()
std::set< FakeBkgTools::FinalState >	m_cachedFinalStates
std::map< TH1 *, const float * >	m_values_1dhisto_map
std::map< TH2 *, std::pair< const float *, const float * > >	m_values_2dhisto_map
std::map< TH3 *, std::tuple< const float *, const float *, const float * > >	m_values_3dhisto_map
std::string	m_selection = defaultSelection()
	'selection' settings used to compute the total yield / fill histograms
std::string	m_process = defaultProcess()
	'process' settings used to compute the total yield / fill histograms
std::string	m_energyUnit
	property EnergyUnit user can choose between MeV or GeV to indicate the unit of the pT parametrization of efficiencies in the input files
bool	m_useDB = true
std::vector< std::string >	m_inputFiles
	property InputFiles
std::string	m_tightDecoNameAndType
	property TightDecoration
CP::ISelectionReadAccessor *	m_tightAccessor = nullptr
	this can't be a unique_ptr as this can cause issues with the dictionary in some particular circumstances
std::string	m_progressFileName
	property ProgressFileName
std::string	m_progressFileDirectory
	property ProgressFileDirectory
UncertaintyList *	m_selectedUncertainties = nullptr
	Pointer to a value of the 'm_systSetDict' map it must be invalidated each time the map is updated in principle only applySystematicVariation() needs to do that.
std::unordered_map< CP::SystematicSet, UncertaintyList >	m_systSetDict
	List of uncertainties in internal format, associated with a particular SystematicSet the m_selectedUncertainties pointer must be invalidated each time this map is updated in principle only applySystematicVariation() needs to do that.
bool	m_unlimitedSystematicVariations = true
	used to prevent multiple calls to applySystematicVariation() when unsupported set to true in a particular tool's constructor to disable the possibility of calling applySystematicVariation() more than once / after the first call to addEvent()
bool	m_lockedSystematicVariations = false
	when m_unlimitedSystematicVariations=false, keeps track of prior calls to applySystematicVariation() / addEvent()
SG::ConstAccessor< float >	m_accRealEff
SG::ConstAccessor< float >	m_accFakeEff
	only used when m_useDB is false

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	setup ()
StatusCode	addEventCustom (const std::vector< bool > &isTight_vals, const std::vector< FakeBkgTools::Efficiency > &realEff_vals, const std::vector< FakeBkgTools::Efficiency > &fakeEff_vals, const std::vector< int > &charges, float weight)
StatusCode	incrementMatrices (const LhoodMMEvent &mmevt)
StatusCode	incrementOneMatrixSet (LhoodMMFitInfo &fitInfo, const LhoodMMEvent &mmevt)
void	get_init_pars (std::vector< double > &init_pars, int nlep)
void	get_analytic (std::vector< double > &nrf, const int nlep)
double	fixPosErr (double n_fake_fit, TMinuit_LHMM *lhoodFit)
double	fixNegErr (double n_fake_fit, TMinuit_LHMM *lhoodFit)
void	mapLhood (TMinuit_LHMM *lhoodFit, int nlep, double min, double max)
StatusCode	fillHistograms ()
StatusCode	fillHisto_internal (const std::vector< LhoodMMFitInfo > &fitInfo_vec, TH1 *h)
template<class C>
StatusCode	addEventImpl (const C &iparticles, float mcWeight)
	only used when m_useDB is false
bool	importEfficiencies (bool resetDB=false)
	load the config file(s) storing efficiencies
std::pair< uint16_t, float >	identifyCpSystematicVariation (const CP::SystematicVariation &systematic) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Static Private Member Functions
static double	logPoisson (double obs, double pred)
static void	fcn_nlep (Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag)
static void	fcn_minnlep_maxnlep (Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag)

Private Attributes
LhoodMMFitInfo	m_global_fitInfo {}
bool	m_prevSave {}
bool	m_perfectFit {}
const LhoodMMFitInfo *	m_current_fitInfo {}
std::vector< std::unique_ptr< FakeBkgTools::FinalState > >	m_fsvec
int	m_curr_nlep {}
int	m_minnlep {}
int	m_maxnlep {}
int	m_maxnlep_loose {}
int	m_theta_tot_start_index {}
std::vector< std::vector< int > >	m_real_indices
std::vector< std::vector< int > >	m_fake_indices
bool	m_requireSS {}
bool	m_requireOS {}
bool	m_needToResize {}
bool	m_doFakeFactor {}
bool	m_fixNormalization {}
float	m_maxWeight {}
bool	m_alreadyMerged {}
std::vector< std::vector< std::vector< double > > >	m_coeffs
std::map< TH1 *, std::vector< LhoodMMFitInfo > >	m_fitInfo_1dhisto_map
std::map< TH2 *, std::vector< LhoodMMFitInfo > >	m_fitInfo_2dhisto_map
std::map< TH3 *, std::vector< LhoodMMFitInfo > >	m_fitInfo_3dhisto_map
double	m_dilep_SSfrac_num {}
double	m_dilep_SSfrac_denom {}
std::vector< std::vector< double > >	m_OSfrac
double	m_nfakes_std {}
double	m_nfakes_std_err {}
double	m_nfakes_std_perEventWeight {}
double	m_nfakes_std_err_perEventWeight {}
bool	m_do_std_perEventWeight {}
Int_t	m_fitStatus {}
Int_t	m_printLevel {}
std::vector< std::shared_ptr< TMatrixT< double > > >	m_nrf_mat_vec
std::vector< std::shared_ptr< TMatrixT< double > > >	m_MMmatrix_vec
std::vector< std::shared_ptr< TMatrixT< double > > >	m_ntlpred_vec
unsigned	m_lastSaveIndex {}
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Static Private Attributes
static LhoodMM_tools *	m_current_lhoodMM_tool = nullptr
static std::mutex	s_mutex
static constexpr int	s_nLepMax = 6
static constexpr int	s_maxRank = 64
static const double	s_piover2 = 1.57079632679489661923
static const double	s_piover4 = 0.785398163397448309616

Detailed Description

Definition at line 27 of file LhoodMM_tools.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

LhoodMM_tools()

LhoodMM_tools::LhoodMM_tools

(

const std::string &

name

)

Definition at line 41 of file LhoodMM_tools.cxx.

                                                   :
  BaseFakeBkgTool(name)
{
 
  m_unlimitedSystematicVariations = true;
 
  //setup fixHistogramNormalization property
  declareProperty("FixHistogramNormalization",
                  m_fixNormalization,
                  "Boolean to determine whether or not histograms are scaled such that their normalization "
                  "is equal to the fake yield computed for the entire sample (true =  yes, do the scaling)");
  declareProperty("DoFakeFactorFit",
                  m_doFakeFactor,
                  "Give results corresponding to the fake factor method rather than the matrix method");
 
  // set everything to default values
  reset();
}

~LhoodMM_tools()

LhoodMM_tools::~LhoodMM_tools

(

)

Definition at line 60 of file LhoodMM_tools.cxx.

                              {
 
}

Member Function Documentation

addEvent() [1/2]

StatusCode BaseFakeBkgTool::addEvent ( const ConstDataVector< xAOD::IParticleContainer > & particles, float extraWeight = 1.f )

finaloverridevirtualinherited

supply list of leptons / global variables, internal counters incremented Does not return anything; event weight(s) must be retrieved by subsequent call(s) to getEventWeight() (for tools inheriting from ILinearFakeBkgTool)

Implements CP::IFakeBkgTool.

Definition at line 243 of file BaseFakeBkgTool.cxx.

{
    return addEventImpl(iparticles, mcWeight);
}

addEvent() [2/2]

StatusCode BaseFakeBkgTool::addEvent ( const xAOD::IParticleContainer & particles, float extraWeight = 1.f )

finaloverridevirtualinherited

supply list of leptons / global variables, internal counters incremented Does not return anything; event weight(s) must be retrieved by subsequent call(s) to getEventWeight() (for tools inheriting from ILinearFakeBkgTool)

Implements CP::IFakeBkgTool.

Definition at line 238 of file BaseFakeBkgTool.cxx.

{
    return addEventImpl(iparticles, mcWeight);
}

addEventCustom() [1/2]

StatusCode LhoodMM_tools::addEventCustom ( )

overrideprotectedvirtual

Implements CP::BaseFakeBkgTool.

Definition at line 266 of file LhoodMM_tools.cxx.

                                         {
 
  int nlep = m_particles.size();
  if (nlep == 0) {
    ATH_MSG_WARNING("Attempt to add an event with 0 leptons.  This event will be ignored.");
    return StatusCode::SUCCESS;
  }
  std::vector<bool> isTight_vals;
  std::vector<Efficiency> realEff_vals;
  std::vector<Efficiency> fakeEff_vals;  
  std::vector<int> charges;
  std::vector<FakeBkgTools::ParticleData>::const_iterator particles_it;
  for (particles_it = m_particles.begin(); particles_it != m_particles.end(); ++particles_it) { 
    const FakeBkgTools::ParticleData& p = *particles_it;
    isTight_vals.push_back(p.tight);
    realEff_vals.push_back(p.real_efficiency);
    fakeEff_vals.push_back(p.fake_efficiency);
    double r_eff = p.real_efficiency.value(this);
    double f_eff = p.fake_efficiency.value(this);
 
    if (particles_it == m_particles.begin() ){
    
      for(const std::pair<short unsigned int, FakeBkgTools::Uncertainty> kv : p.real_efficiency.uncertainties)
        {
      ATH_MSG_DEBUG("real eff uncertainties for first lepton are " <<  kv.second.up << " " << kv.second.down);
        }
      for(const std::pair<short unsigned int, FakeBkgTools::Uncertainty> kv : p.fake_efficiency.uncertainties)
        {
      ATH_MSG_DEBUG("fake eff uncertainties for first lepton are " <<  kv.second.up << " " << kv.second.down);
        }
    }
    charges.push_back(p.charge);
    if ( r_eff < 0.01 && f_eff< 0.01) {
      ATH_MSG_DEBUG("Found bad efficiency values");
    }
  }
  
  return addEventCustom( isTight_vals, realEff_vals,  fakeEff_vals, charges, m_externalWeight);
}

addEventCustom() [2/2]

StatusCode LhoodMM_tools::addEventCustom ( const std::vector< bool > & isTight_vals, const std::vector< FakeBkgTools::Efficiency > & realEff_vals, const std::vector< FakeBkgTools::Efficiency > & fakeEff_vals, const std::vector< int > & charges, float weight )

private

Definition at line 241 of file LhoodMM_tools.cxx.

                                        {
 
  if (extraweight > m_maxWeight) m_maxWeight = extraweight;
 
  int nlep = isTight_vals.size();
 
  m_needToResize = false;
  if (nlep > m_maxnlep_loose) {
    m_maxnlep_loose = nlep;
    m_needToResize = true;
  }
 
  LhoodMMEvent mmevt(nlep, realEff_vals, fakeEff_vals, isTight_vals, charges, extraweight);
  
  ATH_CHECK(incrementMatrices(mmevt));
   
  
  return StatusCode::SUCCESS;
  
}

addEventImpl()

template<class C>

StatusCode BaseFakeBkgTool::addEventImpl ( const C & iparticles, float mcWeight )

privateinherited

only used when m_useDB is false

prevent further calls to applySystematicVariation() if not allowed

only retrieved if some of the efficiency parameters are event-level!

for standalone compilation, pp is already a reference and the * operator is redefined to a no-op so that this works

Definition at line 174 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized)
    {
         ATH_MSG_WARNING("the tool hasn't been initialized");
        return StatusCode::FAILURE;
    }
    m_particles.clear();
    if(!m_unlimitedSystematicVariations) m_lockedSystematicVariations = true; 
 
    const xAOD::EventInfo* eventInfo = nullptr; 
    if(m_needEventInfo)
    {
      #ifdef FAKEBKGTOOLS_ATLAS_ENVIRONMENT
        ATH_CHECK( evtStore()->retrieve(eventInfo, "EventInfo") );
      #else
        eventInfo = &iparticles.eventInfo;
      #endif
    }
    
    for(const auto& pp : iparticles)
    {
        const auto& p = *pp; 
        m_particles.emplace_back();
        auto& d = m_particles.back();
        d.tight = m_tightAccessor->getBool(p);
        d.type = p.type();
        switch(p.type())
        {
            case xAOD::Type::Electron: d.charge = static_cast<const xAOD::Electron&>(p).charge(); break;
            case xAOD::Type::Muon: d.charge = static_cast<const xAOD::Muon&>(p).charge(); break;
            case xAOD::Type::Tau: d.charge = static_cast<const xAOD::TauJet&>(p).charge(); break;
            case xAOD::Type::Photon: d.charge = 0; break;
            default:
                ATH_MSG_WARNING("unknown particle type, setting charge to 0");
                d.charge = 0;
        }
        if(m_useDB)
        {
            std::string error;
            if(!m_database->fillEfficiencies(d, p, *eventInfo, error))
            {
                ATH_MSG_ERROR("unable to retrieve efficiencies: " << error);
                return StatusCode::FAILURE;
            }
            ATH_MSG_DEBUG("particle has fake fact. = " << d.fake_factor.value(this) <<", fake eff. = " << d.fake_efficiency.value(this) <<", real eff. = " << d.real_efficiency.value(this));
        }
        else
        {
            d.real_efficiency.nominal = m_accRealEff(p);
            d.fake_efficiency.nominal = m_accFakeEff(p);
        }
    }
    if(m_particles.size() > maxParticles())
    {
        ATH_MSG_WARNING( "the input contains " << m_particles.size() << " particles but the maximum allowed is " << maxParticles()
            << "; the last " << (m_particles.size()-maxParticles()) << " will be ignored");
        m_particles.erase(m_particles.begin() + maxParticles(), m_particles.end());
    }
    m_externalWeight = mcWeight;
    ATH_MSG_DEBUG("calling addEventCustom() with #particles = " << m_particles.size());
    return addEventCustom();
}

affectingSystematics()

CP::SystematicSet BaseFakeBkgTool::affectingSystematics ( ) const

overridevirtualinherited

the list of all systematics this tool can be affected by

Implements CP::IReentrantSystematicsTool.

Definition at line 438 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized, since the number of systematic variations depends on the configuration...");
        throw std::logic_error("BaseFakeBkgTool::affectingSystematics() called before initialization");
    }
    CP::SystematicSet affecting;
    for(int step=0;step<2;++step)
    {
        std::string type = step? "STAT" : "SYST";
        const int imax = step? m_database->numberOfStats() : m_database->numberOfSysts();
        for(int i=0;i<imax;++i)
        {
            std::string name = "FAKEBKG_" + type + "_VAR" + std::to_string(i);
            affecting.insert(CP::SystematicVariation(name, 1.f));
            affecting.insert(CP::SystematicVariation(name, -1.f));
        }
    }
    return affecting;
}

affectingSystematicsFor()

CP::SystematicSet BaseFakeBkgTool::affectingSystematicsFor ( const std::string & nuisanceParameter ) const

overridevirtualinherited

These functions are slow, don't use them in the tools implementations.

Implements CP::IFakeBkgSystDescriptor.

Definition at line 618 of file BaseFakeBkgTool.cxx.

{
    CP::SystematicSet affecting;
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized, since the number of systematic variations depends on the configuration...");
        return {};
    }
    bool up=true, down=true;
    auto pos1=nuisanceParameter.find("__up"), pos2=nuisanceParameter.find("__down");
    if(pos1!=std::string::npos && pos1+4==nuisanceParameter.length()) down = false;
    else if(pos2!=std::string::npos && pos2+6==nuisanceParameter.length()) up = false;
    std::string np = nuisanceParameter.substr(0, std::min(pos1, pos2));
    for(unsigned i=0;i<m_database->numberOfSysts();++i)
    {
        auto syst = m_database->findSyst(m_database->systIndexToUID(i));
        if(syst && syst->name==np)
        {
            std::string name = "FAKEBKG_SYST_VAR" + std::to_string(i);
            if(up) affecting.insert(CP::SystematicVariation(name, 1.f));
            if(down) affecting.insert(CP::SystematicVariation(name, -1.f));
        }
    }
    return affecting;
}

affectsElectrons()

bool BaseFakeBkgTool::affectsElectrons ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects electrons

Implements CP::IFakeBkgSystDescriptor.

Definition at line 576 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("electron") != std::string::npos;
    return false;
}

affectsFakeEfficiencies()

bool BaseFakeBkgTool::affectsFakeEfficiencies ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects fake efficiencies

Implements CP::IFakeBkgSystDescriptor.

Definition at line 604 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("fake eff") != std::string::npos;
    return false;
}

affectsFakeFactors()

bool BaseFakeBkgTool::affectsFakeFactors ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects fake factors

Implements CP::IFakeBkgSystDescriptor.

Definition at line 611 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("fake factor") != std::string::npos;
    return false;
}

affectsMuons()

bool BaseFakeBkgTool::affectsMuons ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects muons

Implements CP::IFakeBkgSystDescriptor.

Definition at line 583 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("muon") != std::string::npos;
    return false;
}

affectsRealEfficiencies()

bool BaseFakeBkgTool::affectsRealEfficiencies ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects real efficiencies

Implements CP::IFakeBkgSystDescriptor.

Definition at line 597 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("real eff") != std::string::npos;
    return false;
}

affectsTaus()

bool BaseFakeBkgTool::affectsTaus ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty affects taus

Implements CP::IFakeBkgSystDescriptor.

Definition at line 590 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return getListOfEfficienciesAffectedBy(UID).find("tau") != std::string::npos;
    return false;
}

applySystematicVariation()

StatusCode BaseFakeBkgTool::applySystematicVariation ( const CP::SystematicSet & systConfig )

overridevirtualinherited

effects: configure this tool for the given list of systematic variations.

any requested systematics that are not affecting this tool will be silently ignored (unless they cause other errors). failures: systematic unknown failures: requesting multiple variations on the same systematic (e.g. up & down) failures: requesting an unsupported variation on an otherwise supported systematic (e.g. a 2 sigma variation and the tool only supports 1 sigma variations) failures: unsupported combination of supported systematic failures: other tool specific errors

prevent further calls to applySystematicVariation() if not allowed

Implements CP::ISystematicsTool.

Definition at line 465 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized");
        throw std::logic_error("BaseFakeBkgTool::applySystematicVariation() called before initialization");
    }
    if(m_lockedSystematicVariations)
    {
        ATH_MSG_ERROR("this particular method doesn't support multiple calls to applySystematicVariation(), or after the first call to addEvent(). Please use a separate instance of the tool for each variation.");
        throw std::logic_error("BaseFakeBkgTool::applySystematicVariation() called at a wrong time");
    }
    else if(!m_unlimitedSystematicVariations) m_lockedSystematicVariations = true; 
    if(!systConfig.size())
    {
        m_selectedUncertainties = nullptr;    
        return StatusCode::SUCCESS;
    }
    auto itr = m_systSetDict.find(systConfig);
    if(itr != m_systSetDict.end())
    {
        m_selectedUncertainties = &itr->second;
        return StatusCode::SUCCESS;
    }
    CP::SystematicSet mysys;
    auto sc = CP::SystematicSet::filterForAffectingSystematics(systConfig, affectingSystematics(), mysys);
    if(sc != StatusCode::SUCCESS) return sc;
    std::unique_ptr<UncertaintyList> uncertainties;
    for(auto& sysvar : mysys)
    {
        auto var = identifyCpSystematicVariation(sysvar);
        if(!var.first)
        {
            ATH_MSG_ERROR("The systematic variation " << sysvar.name() << " is not recognized, despite being present in affectingSystematics()...");
            return StatusCode::FAILURE;
        }
        if(!uncertainties) uncertainties.reset(new UncertaintyList(var.first, var.second));
        else uncertainties->extraVariation(var.first, var.second);
    }
    if(uncertainties)
    {
        auto emplaced = m_systSetDict.emplace(systConfig, std::move(*uncertainties));
        m_selectedUncertainties = &emplaced.first->second;
    }
    else m_selectedUncertainties = nullptr;
    return StatusCode::SUCCESS;
}

CheckHistogramCompatibility()

StatusCode BaseFakeBkgTool::CheckHistogramCompatibility ( const TH1 * lhs, const TH1 * rhs )

protectedinherited

Definition at line 359 of file BaseFakeBkgTool.cxx.

{
    std::string error;
    if(std::string(lhs->GetName()) != rhs->GetName()) error = "names";
    else if(lhs->GetDimension() != rhs->GetDimension()) error = "dimensions";
    else if(lhs->GetNbinsX()!=rhs->GetNbinsX() || lhs->GetNbinsY()!=rhs->GetNbinsY() || lhs->GetNbinsZ()!=rhs->GetNbinsZ()) error = "number of bins";
    else
    {
        for(auto getAxis : std::initializer_list<const TAxis*(TH1::*)()const>{&TH1::GetXaxis, &TH1::GetYaxis, &TH1::GetZaxis})
        {
            auto lhsAxis=(lhs->*getAxis)(), rhsAxis=(rhs->*getAxis)();
            for(int i=0;i<=lhsAxis->GetNbins();++i)
            {
                auto x=lhsAxis->GetBinUpEdge(i), y=rhsAxis->GetBinUpEdge(i), width=lhsAxis->GetBinWidth(i?i:1);
                if(std::fabs(x-y) > 0.01*width) error = "bin edges";
            }
        }
    }
    if(error.length())
    {
        ATH_MSG_ERROR("the registered histogram \"" << lhs->GetName() << "\" is not compatible with the one saved in the in-progress ROOT file (mismatching " << error << "). Or, you tried registering two different histograms with the same name.");
        return StatusCode::FAILURE;
    }
    return StatusCode::SUCCESS;
}

clientForDB()

FakeBkgTools::Client LhoodMM_tools::clientForDB ( )

finaloverrideprotectedvirtual

This indicates which type of efficiencies/fake factor need to be filled.

Implements CP::BaseFakeBkgTool.

Definition at line 66 of file LhoodMM_tools.cxx.

{
  return FakeBkgTools::Client::MATRIX_METHOD;
}

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

defaultProcess()

constexpr const char * CP::IFakeBkgTool::defaultProcess ( )

inlinestaticconstexprinherited

default value taken by the 'process' argument of several methods or properties It indicates what should be treated as fake lepton background.

The syntax supported for this arguments is described in the package documentation.

Definition at line 38 of file IFakeBkgTool.h.

{ return ">=1F[T]"; }

defaultSelection()

constexpr const char * CP::IFakeBkgTool::defaultSelection ( )

inlinestaticconstexprinherited

default value taken by the 'selection' argument of several methods or properties It indicates how the analysis selects leptons in the signal region The syntax supported for this arguments is described in the package documentation.

Definition at line 33 of file IFakeBkgTool.h.

{ return "0!T"; }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

fcn_minnlep_maxnlep()

void LhoodMM_tools::fcn_minnlep_maxnlep ( Int_t & npar, Double_t * gin, Double_t & f, Double_t * par, Int_t iflag )

staticprivate

Definition at line 561 of file LhoodMM_tools.cxx.

{
 
  LhoodMM_tools* l = m_current_lhoodMM_tool;
 
  const bool verbose = (l->m_printLevel > 0);
 
  if (verbose) {
    ASG_MSG_VERBOSE("Parameters input to fcn_minnlep_maxnlep:" );
    for (int ipar = 0; ipar < npar; ipar++) {
      ASG_MSG_VERBOSE(ipar << ": " << par[ipar]); 
    }
  }
  int minnlep = l->m_minnlep;
  int maxnlep_loose = l->m_maxnlep_loose;
 
  Double_t f_tot = 0.;
  
  Double_t rsq = par[0];
 
  Double_t sinterm_tot = 1.;
 
  int theta_nlep_index = 1 + maxnlep_loose -minnlep;
  ASG_MSG_VERBOSE("theta_nlep_index initial = " << theta_nlep_index);
  for (int ilep = minnlep; ilep <= maxnlep_loose; ilep++) {
    theta_nlep_index += l->m_real_indices[ilep-1].size();
    ASG_MSG_VERBOSE("theta_nlep_index for ilep = " << ilep << " = " << theta_nlep_index);
  }
 
  Double_t pars_thisnlep[s_maxRank];  // a bit of a waste of memory, but avoids compiler warnings for variable-
 
  if(verbose) ASG_MSG_VERBOSE("theta_nlep_index = " << theta_nlep_index);
 
  int real_index = 1;
  for (int ilep = minnlep; ilep <= maxnlep_loose; ilep++) {
    if (l->m_current_fitInfo->eventCount[ilep-1] == 0) {
      ASG_MSG_VERBOSE("m_real_indices[" << ilep-1 << "].size() = " << l->m_real_indices[ilep-1].size());
      real_index += l->m_real_indices[ilep-1].size();
      for (int ipar = 0; ipar < (int)l->m_fake_indices[ilep-1].size()-1; ipar++) {
    theta_nlep_index++;
      }
      continue;
    }
    l->m_curr_nlep = ilep;
    Int_t npar_thisnlep = 0x1 << ilep;
    
    int theta_tot_index = l->m_theta_tot_start_index+ilep-minnlep; 
    if(verbose) ASG_MSG_VERBOSE("theta_tot_index, npar = " << theta_tot_index << " " << npar);
    if(verbose) ASG_MSG_VERBOSE("sinterm_tot, par[theta_tot_index] = " << sinterm_tot << " " <<  par[theta_tot_index]); 
    if (l->m_maxnlep_loose - minnlep > 0) {
      double costerm;
      if (ilep < l->m_maxnlep_loose ) {
    costerm = TMath::Cos(par[theta_tot_index]);
      } else {
    costerm = 1.;
      }
      if(verbose) ASG_MSG_VERBOSE("r sinterm_tot costerm = " << rsq <<" " << sinterm_tot << " " << costerm);
      pars_thisnlep[0] = rsq*sinterm_tot*costerm*sinterm_tot*costerm;
      sinterm_tot *= TMath::Sin(par[theta_tot_index]);
    } else {
      pars_thisnlep[0] = rsq;
    }
    if(verbose) ASG_MSG_VERBOSE("pars_thisnlep[0] = " <<  pars_thisnlep[0]);
    int par_index = 1;
    ASG_MSG_VERBOSE("m_real_indices[ilep-1].size() = " <<  l->m_real_indices[ilep-1].size());
    for (unsigned ipar = 0; ipar < l->m_real_indices[ilep-1].size(); ipar++) {
      pars_thisnlep[par_index] = par[real_index+ipar];
      if(verbose) ASG_MSG_VERBOSE("r pars_thisnlep[" << par_index << "] = " <<  pars_thisnlep[par_index]);
      par_index++;
    }
    
    for (int ipar = 0; ipar < (int)l->m_fake_indices[ilep-1].size()-1; ipar++) {
      ASG_MSG_VERBOSE("theta_nlep_index = " << theta_nlep_index );
      pars_thisnlep[par_index+ipar] = par[theta_nlep_index];
      if(verbose) ASG_MSG_VERBOSE("f pars_thisnlep[" << par_index+ipar <<"] = " <<  pars_thisnlep[par_index+ipar]);
      theta_nlep_index++;
    }
    fcn_nlep(npar_thisnlep, gin, f, pars_thisnlep, iflag);
    f_tot += f;
    
    real_index += l->m_real_indices[ilep-1].size();
  }
  
  f = f_tot;
}

fcn_nlep()

void LhoodMM_tools::fcn_nlep ( Int_t & npar, Double_t * gin, Double_t & f, Double_t * par, Int_t iflag )

staticprivate

Definition at line 647 of file LhoodMM_tools.cxx.

{
 
  LhoodMM_tools* l = m_current_lhoodMM_tool;
 
  const bool verbose = (l->m_printLevel > 0);
 
  int nlep = l->m_curr_nlep;
  int lepidx = nlep-1;
  int rank = 0x1 << nlep;
 
  if(verbose) {
    ASG_MSG_VERBOSE("npar = " << npar);
    for (int ipar = 0; ipar < npar; ipar++) {
      ASG_MSG_VERBOSE("Parameter " << ipar <<  " = " << par[ipar]);
    }
  }
 
  if(verbose) {
    std::string txt = "testing variable transform: angle pars in fcn: ";
    for (int i = 0; i < npar; i++) {
      txt += std::to_string(par[i]) + " ";
    }
    ASG_MSG_VERBOSE(txt);
  }
 
  // remaining parameters are the angles used to divide up the fakes contribution
  
  std::shared_ptr<TMatrixT<double>> nrf, MMmatrix, ntlpred; 
  nrf = l->m_nrf_mat_vec[lepidx];
  if(verbose) {
    ASG_MSG_VERBOSE("What does nrf look like?");
    nrf->Print();
  }
  MMmatrix = l->m_MMmatrix_vec[lepidx];
  ntlpred = l->m_ntlpred_vec[lepidx];
 
  (*nrf)(0,0) = par[0];
  double rsq = TMath::Abs(par[0]);
  if(verbose) ASG_MSG_VERBOSE("rsq = " << rsq);
  int rsize = l->m_real_indices[lepidx].size();
  int fsize = l->m_fake_indices[lepidx].size();
 
  for (int ipar = 0; ipar < rsize; ipar++) {
    ASG_MSG_VERBOSE("In fcn, setting real par " << l->m_real_indices[lepidx][ipar] << " to " <<  par[ipar+1]); 
    (*nrf)(l->m_real_indices[lepidx][ipar], 0) = par[ipar+1];
  }
  double sinterm = 1.;
 
  if(verbose) ASG_MSG_VERBOSE("nrf[0] = " << (*nrf)(0,0));
 
  for (int ipar = 0; ipar < fsize; ipar++) {
    if(verbose) ASG_MSG_VERBOSE("r, sinterm, par[ipar+1] " << rsq << " " << sinterm << " " << par[ipar+1]);
    if (ipar <  fsize-1 ) {
      double costerm = TMath::Cos(par[rsize+ipar+1]);
      if(verbose) ASG_MSG_VERBOSE("for setting fake parameter, sinterm = " << sinterm << " par index = " << l->m_real_indices[lepidx].size()+ipar+1);
      (*nrf)(l->m_fake_indices[lepidx][ipar],0) = rsq*sinterm*costerm*sinterm*costerm;
    } else {
      (*nrf)(l->m_fake_indices[lepidx][ipar],0) = rsq*sinterm*sinterm;
    }
    
    ASG_MSG_VERBOSE("nrf[" << ipar << "] = " << (*nrf)(ipar,0));
    ASG_MSG_VERBOSE("In fcn, setting fake par " << l->m_fake_indices[lepidx][ipar] << " to " <<  (*nrf)(l->m_fake_indices[lepidx][ipar],0)); 
   
    sinterm *= TMath::Sin(par[rsize+ipar+1]);
  }
  
  ASG_MSG_VERBOSE("Testing variable transform: nrf in fcn: ");
  if(verbose) {
    nrf->Print();
  }
 
  *ntlpred = (*MMmatrix)*(*nrf);
 
  ASG_MSG_VERBOSE("Printing the matrix in fcn");
  if(verbose) {
    MMmatrix->Print();
    nrf->Print();
  }
  f = 0;
  int ipar_start;
  if (l->m_doFakeFactor) {
    ipar_start = 1;
  } else {
    ipar_start = 0;
  }
 
  for (int ipar = ipar_start; ipar < rank; ipar++) {
    if(verbose) ASG_MSG_VERBOSE("Comparing parameter " << ipar << ": " << l->m_current_fitInfo->event_cat.at(lepidx).at(ipar) << " to " << (*ntlpred)(ipar,0));
    // following scaling for weighted events motivated by arXiv:1309.1287 
    int nobs = l->m_current_fitInfo->event_cat.at(lepidx).at(ipar);
    double s = 1.;
    if (nobs > 0) {
      s= l->m_current_fitInfo->event_sumw2.at(lepidx).at(ipar)/nobs;
    }
    if (verbose) ASG_MSG_VERBOSE("s = " << s); 
    f += logPoisson(1.*nobs/s, (*ntlpred)(ipar,0)/s);
    if (verbose)  ASG_MSG_VERBOSE("f = " << f);
  }
 
}

fillHisto_internal()

StatusCode LhoodMM_tools::fillHisto_internal ( const std::vector< LhoodMMFitInfo > & fitInfo_vec, TH1 * h )

private

Definition at line 1166 of file LhoodMM_tools.cxx.

                                                                                                  {
 
  // If fixNormalization is set to true, the fake yield for the entire sample 
  // will be calculated first, and then the histogram will be scaled at the end 
  // so that its normalization matches this yield.  Otherwise, the sum of the 
  // bin entries is not guaranteed to match yield calculated on the sample
  // as a whole.
 
  // As a general rule of thumb, if the histogram being created is the key one
  // for the analysis (e.g. used to set limits) then it's best to keep 
  // fixNormalization false.  On the other hand, if the analysis is based on
  // total yield, and the histogram is a control/validation plot, it's best
  // to set fixNormalization to true.
 
  int nbins = h->GetNcells();
 
  ATH_MSG_VERBOSE("nbins = " << nbins);
  Double_t nf, poserr, negerr, shift = 0.;
 
  for (int ibin = 0; ibin < nbins; ibin++) {
 
    m_current_fitInfo = &fitInfo_vec[ibin];
    int totEvents =  m_current_fitInfo->totEvents;
    if (totEvents > 0) {
      ATH_MSG_VERBOSE("Filling bin " << ibin << " with " << totEvents << " events");
      nf = nfakes(&poserr, &negerr);
      h->SetBinContent(ibin, nf+shift);
      if (TMath::IsNaN(h->GetBinContent(ibin))) {
    h->SetBinContent(ibin,0.);
    h->SetBinError(ibin, 0.);
      } else {
    h->SetBinError(ibin,TMath::Max(poserr,-negerr));
      }
    } else {
      h->SetBinContent(ibin,0.);
      h->SetBinError(ibin, 0.);
    }
    ATH_MSG_VERBOSE("Result is " << h->GetBinContent(ibin) << " +/- " << h->GetBinError(ibin));
  }
 
 
  if (m_fixNormalization) {
    double poserr, negerr;
    double totFakes;
    
    m_current_fitInfo = &m_global_fitInfo;
    totFakes = nfakes(&poserr, &negerr);
    
    // find total content of histogram, including under- and overflows
    double totHistContent  = 0.;
    for (int ibin = 0; ibin < nbins; ibin++) {
      totHistContent += h->GetBinContent(ibin);
    }
    
    ATH_MSG_VERBOSE("totHistContent = " << totHistContent);
    ATH_MSG_VERBOSE("sum of weights = " << h->GetSumOfWeights());
    
    double scaleFactor;
    if (totHistContent > 0.) {
      scaleFactor = totFakes/totHistContent;
    } else {
      scaleFactor = 1.;
    }
    for (int ibin = 1; ibin <= nbins; ibin++) {
      h->SetBinContent(ibin, scaleFactor*h->GetBinContent(ibin));
      h->SetBinError(ibin, scaleFactor*h->GetBinError(ibin));
    }   
  }
  return StatusCode::SUCCESS;
}

fillHistograms()

StatusCode LhoodMM_tools::fillHistograms ( )

private

Definition at line 1139 of file LhoodMM_tools.cxx.

                                         {
 
  StatusCode status = StatusCode::SUCCESS;
 
  for (auto map1_iter=m_fitInfo_1dhisto_map.begin(); map1_iter != m_fitInfo_1dhisto_map.end(); map1_iter++) {
    auto & fitInfo_vec = map1_iter->second;
    TH1* histogram = map1_iter->first;
    status = fillHisto_internal(fitInfo_vec, histogram);
  }
 
  for (auto map2_iter=m_fitInfo_2dhisto_map.begin(); map2_iter != m_fitInfo_2dhisto_map.end(); map2_iter++) {
    auto& fitInfo_vec = map2_iter->second;
    TH2* histogram = (TH2*)map2_iter->first;
    status = fillHisto_internal(fitInfo_vec, histogram);
    ATH_MSG_VERBOSE("Inside fill code, mean = " << histogram->ProjectionX()->GetMean());
  }
 
  for (auto map3_iter=m_fitInfo_3dhisto_map.begin(); map3_iter != m_fitInfo_3dhisto_map.end(); map3_iter++) {
    auto& fitInfo_vec = map3_iter->second;
    TH3* histogram = (TH3*)map3_iter->first;
    status = fillHisto_internal(fitInfo_vec, histogram);
    ATH_MSG_VERBOSE("Inside fill code, mean = " << histogram->ProjectionX()->GetMean());
  }
 
  return status;
}

fixNegErr()

double LhoodMM_tools::fixNegErr ( double n_fake_fit, TMinuit_LHMM * lhoodFit )

private

Definition at line 1588 of file LhoodMM_tools.cxx.

                                                                         {
 
  ATH_MSG_VERBOSE("Trying to fix bad negative error");
 
  // get current value of -lnL
  Double_t f_from_fit, junk;
  Int_t ijunk;
 
  lhoodFit->mnstat(f_from_fit, junk, junk, ijunk, ijunk, ijunk);
 
  // do a binary search to find real value of positive error
  double n_fake_guess_hi = n_fake_fit;
  double n_fake_guess_lo = 0.;
  double n_fake_guess = n_fake_guess_lo;
  double f_with_guess;
 
  bool errFound = 0;
  bool stopSearch = 0;
  double convergeCriteria = 0.01;
  double min_n_fake_guess = 0.05;
 
  int nfake_tot_index = 1;
 
  Double_t arglist[10];
 
  int ierflg;
 
  arglist[0] = nfake_tot_index;
  arglist[1] = n_fake_fit;
  lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
  lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
  
  arglist[0] = 10000;
  arglist[1] = 1.0;
  lhoodFit->mnexcm("MIGRAD", arglist ,2,ierflg);
  lhoodFit->mnimpr();
 
  lhoodFit->mnstat(f_from_fit, junk, junk, ijunk, ijunk, ijunk);
 
  while (!stopSearch) {
    // fit with n_fake_tot fixed to guess value
 
    
    arglist[0] = nfake_tot_index;
    arglist[1] = n_fake_guess;
    lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
    lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
 
    arglist[0] = 10000;
    arglist[1] = 1.0;
    lhoodFit->mnexcm("MIGRAD", arglist ,2,ierflg);
    lhoodFit->mnimpr();
    lhoodFit->mnstat(f_with_guess, junk, junk, ijunk, ijunk, ijunk);
 
    ATH_MSG_VERBOSE("nlep, n_fake_guess, n_fake_guess_lo, n_fake_guesss_hi, f_from_fit, f_with_guess: " << "?" << " " << n_fake_guess << " " <<  n_fake_guess_lo << " " <<  n_fake_guess_hi << " " << f_from_fit << " " <<  f_with_guess);
 
    if ((f_with_guess - f_from_fit) > 0.5) {
      n_fake_guess_lo = n_fake_guess;
    } else {
      n_fake_guess_hi = n_fake_guess;
    }
    n_fake_guess = 0.5*(n_fake_guess_lo+n_fake_guess_hi);
 
    if (((n_fake_guess_hi - n_fake_guess_lo)/n_fake_guess_hi < convergeCriteria) || (n_fake_guess_hi < min_n_fake_guess) ) {
      stopSearch = 1;
      if (n_fake_guess_hi < n_fake_fit) {
    errFound = 1;
      }
    }
  }
 
  // reset nfakes to value found from original fit, so it's read out properly
  // later
  arglist[0] = nfake_tot_index;
  arglist[1] = n_fake_fit;
  lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
  
  if (errFound) {
    return n_fake_guess - n_fake_fit;
  } else {
    ATH_MSG_VERBOSE("Setting fitStatus to 1 in fixNegErr");
    m_fitStatus = 1;
    return 1.;
  }
}

fixPosErr()

double LhoodMM_tools::fixPosErr ( double n_fake_fit, TMinuit_LHMM * lhoodFit )

private

Definition at line 1497 of file LhoodMM_tools.cxx.

                                                                         {
 
  ATH_MSG_VERBOSE("Trying to fix bad positive error");
 
  // get current value of -lnL
  Double_t f_from_fit, junk;
  Int_t ijunk;
 
  // do a binary search to find real value of positive error
  double n_fake_guess_hi = TMath::Max(n_fake_fit*5,1.);
  double n_fake_guess_lo = n_fake_fit;
  double n_fake_guess = n_fake_guess_hi;
  double f_with_guess;
 
  bool errFound = 0;
  bool stopSearch = 0;
 
  double convergeCriteria = 0.01;
 
  int nfake_tot_index = 1;
 
  Double_t arglist[10];
 
  int ierflg;
 
  arglist[0] = nfake_tot_index;
  arglist[1] = n_fake_fit;
  lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
  lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
  
  arglist[0] = 10000;
  arglist[1] = 1.0;
  lhoodFit->mnexcm("MIGRAD", arglist ,2,ierflg);
  lhoodFit->mnimpr();
 
  lhoodFit->mnstat(f_from_fit, junk, junk, ijunk, ijunk, ijunk);
  ATH_MSG_VERBOSE("f_from_fit = " << f_from_fit);
 
  while (!stopSearch) {
    // fit with n_fake_tot fixed to guess value
    arglist[0] = nfake_tot_index;
    arglist[1] = n_fake_guess;
    lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
    lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
 
    arglist[0] = 10000;
    arglist[1] = 1.0;
    lhoodFit->mnexcm("MIGRAD", arglist ,2,ierflg);
    lhoodFit->mnimpr();
 
    lhoodFit->mnstat(f_with_guess, junk, junk, ijunk, ijunk, ijunk);
 
    ATH_MSG_VERBOSE("nlep, n_fake_guess, n_fake_guess_lo, n_fake_guesss_hi, f_from_fit, f_with_guess: " << "?" << " " << n_fake_guess << " " <<  n_fake_guess_lo << " " <<  n_fake_guess_hi << " " << f_from_fit << " " <<  f_with_guess);
 
    if (TMath::IsNaN(f_with_guess)) {
      f_with_guess = f_from_fit + 1.;
    }
    if ((f_with_guess - f_from_fit) > 0.5) {
      n_fake_guess_hi = n_fake_guess;
    } else {
      n_fake_guess_lo = n_fake_guess;
    }
 
    n_fake_guess = 0.5*(n_fake_guess_lo+n_fake_guess_hi);
    
    ATH_MSG_VERBOSE( "n_fake_guess_lo, hi = " <<  n_fake_guess_hi << " " << n_fake_guess_lo);
    if ((n_fake_guess_hi - n_fake_guess_lo)/n_fake_guess_hi < convergeCriteria) {
      stopSearch = 1;
      ATH_MSG_VERBOSE("(n_fake_guess_lo,  n_fake_fit = " << n_fake_guess_lo << " " <<  n_fake_fit);
      if (n_fake_guess_lo > n_fake_fit) {
    errFound = 1;
      }
    
    }
  }
 
  // reset nfakes to value found from original fit, so it's read out properly
  // later
  arglist[0] = nfake_tot_index;
  arglist[1] = n_fake_fit;
  lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
  
  if (errFound) {
    return n_fake_guess - n_fake_fit;
  } else {
    ATH_MSG_VERBOSE("Setting fitStatus to 1 in fixPosErr");
    m_fitStatus = 1;
    return -1.;
  }
}

get_analytic()

void LhoodMM_tools::get_analytic ( std::vector< double > & nrf, const int nlep )

private

Definition at line 1340 of file LhoodMM_tools.cxx.

                                                                    {
 
  m_perfectFit = true;
  ATH_MSG_VERBOSE("just getting started with nlep = "  << nlep);
 
  ATH_MSG_VERBOSE("m_minnlepreg = " << m_minnlep << " m_maxnlep = " << m_maxnlep);
 
 
  int lepidx = nlep-1;
 
  if (m_current_fitInfo->eventCount[lepidx] == 0) return;
 
  const int rank = 0x1 << nlep;
 
  std::vector<FakeBkgTools::Efficiency> coeff_denom(rank);
 
  ATH_MSG_VERBOSE("All set! ");
  
  FakeBkgTools::FSBitset charges =  m_fsvec[lepidx]->retrieveCharges(m_particles); 
  for (int irf = 0; irf < rank; irf++) {
    // add up all the relevant terms in the denominator to translate the 
    // loose sample counts to tight sample counts within the required range of
    // tight lepton multiplicity
    coeff_denom[irf].setToConst(0.);
    coeff_denom[0] = m_current_fitInfo->coeffs_num[lepidx][0][0];  // don't care about this one, but it can't be 0
    float chargefactor ;
    FakeBkgTools::FSBitset fakes = irf;
    FakeBkgTools::FSBitset reals;
    for (int ibit = 0; ibit < nlep; ibit++) {
      reals.set(ibit, ~fakes[ibit]);
    }
    for (int itl = 0; itl < rank; itl++) {
      chargefactor = 1.0;
      FakeBkgTools::FSBitset antitights = itl;
      FakeBkgTools::FSBitset tights = 0;      
      for (int ibit = 0; ibit < nlep; ibit++) {
    tights.set(ibit, ~antitights[ibit]);
      }
      ATH_MSG_VERBOSE("tights " << tights);
      ATH_MSG_VERBOSE("reals "  << reals);
      ATH_MSG_VERBOSE("charges " << charges);
      if (m_fsvec[lepidx]->accept_selection(tights, charges)
          &&  m_fsvec[lepidx]->accept_process(nlep, reals, tights) ) {
    ATH_MSG_VERBOSE("Accepted in LhoodMM_tools " << irf);
    ATH_MSG_VERBOSE("index is " << (itl<<nlep) + irf);
    ATH_MSG_VERBOSE("Adding " << m_current_fitInfo->normterms[lepidx][(itl<<nlep) + irf].value(this) << " to " << irf);
    // assume that dilepton fakes are evenly split between OS and SS
    if (nlep > 2 && tights.count() == 2) {
      if (m_requireOS || m_requireSS) {
        chargefactor = 0.5;
        ATH_MSG_VERBOSE("Setting SSfactor ");
      }
    }
    if (nlep == 2 && tights.count() == 2) {
      if (m_requireOS || m_requireSS) {
        chargefactor = m_OSfrac[2][2];
      }
    }
    if (m_requireOS) {
      chargefactor = m_OSfrac[lepidx][tights.count()];
    }
    ATH_MSG_VERBOSE("chargefactor = " << chargefactor << " for nlep = " << nlep);
    ATH_MSG_VERBOSE("normterm = " << m_current_fitInfo->normterms[lepidx][(itl<<nlep) + irf].value(this));
    FakeBkgTools::Efficiency tmpEff = m_current_fitInfo->normterms[lepidx][(itl<<nlep) + irf];
    tmpEff.multiply(chargefactor);
    ATH_MSG_VERBOSE("how much space? " << coeff_denom.size());
    ATH_MSG_VERBOSE("irf =  " << irf);
    coeff_denom[irf].add(tmpEff);
    ATH_MSG_VERBOSE("m_normterms[" << nlep << "][" << (itl<<nlep) + irf << "]= " << m_current_fitInfo->normterms[lepidx][(itl<<nlep) + irf].value(this));
    ATH_MSG_VERBOSE("chargefactor = " << chargefactor);  
    ATH_MSG_VERBOSE("coeff_denom[" << irf << "] = " << coeff_denom[irf].value(this));
      }
    }
    
    // The following are "don't care" terms, but need to have non-zero
    // denominators 
     if (coeff_denom[irf].nominal == 0.) {
       coeff_denom[irf] =  m_current_fitInfo->coeffs_num[lepidx][0][irf];
     }
 
    for (int itl = 0; itl < rank; itl++) {
      ATH_MSG_VERBOSE("coeff_denom[" << irf << "] = " << coeff_denom[irf].value(this));
      m_coeffs[lepidx][itl][irf] = m_current_fitInfo->coeffs_num[lepidx][itl][irf].value(this)/coeff_denom[irf].value(this); 
    }
  }
 
  ATH_MSG_VERBOSE("About to do matrix stuff");
  std::shared_ptr<TMatrixT<double>> MMmatrix;
  MMmatrix = m_MMmatrix_vec[lepidx];
  
  for (int i = 0; i < rank; i++) {
    for (int j = 0; j < rank; j++) {
      ATH_MSG_VERBOSE(i << " " << j << " " << m_current_fitInfo->coeffs_num[lepidx][i][j].value(this) << " " << coeff_denom[j].value(this) << " " <<  m_coeffs[lepidx][i][j]);
      (*MMmatrix)(i,j) =  m_coeffs[lepidx][i][j];
    }
  }
 
  const bool verbose = this->msgLvl(MSG::VERBOSE);
  ATH_MSG_VERBOSE("Printing the matrix in get_analytic ");
  if(verbose) MMmatrix->Print();
  
  TMatrixT<double>  MMmatrix_inv(rank,rank);
  MMmatrix_inv = *MMmatrix;
  MMmatrix_inv.Invert();
  
  TMatrixT<double> MMmatrix_sqr = MMmatrix_inv;
  for (int i = 0; i < rank; i++) {
    for (int j = 0; j < rank; j++) {
      MMmatrix_sqr(i,j) *= MMmatrix_sqr[i][j];
    }
  }
  
  TMatrixT<double> nevents_mat(rank,1), nfake_mat(rank,1), nfake_err_mat(rank,1);
  for (int i = 0; i < rank; i++) {
    nevents_mat(i,0) = m_current_fitInfo->event_cat.at(lepidx).at(i);
  }
  
  ATH_MSG_VERBOSE("Printing nevents matrix");
  if(verbose) nevents_mat.Print();
  
  nfake_mat = MMmatrix_inv*nevents_mat;
  
  ATH_MSG_VERBOSE("MMmatrix:");
  if(verbose) MMmatrix->Print();
  ATH_MSG_VERBOSE("nevents_lll_mat:");
  if(verbose) nevents_mat.Print();
  ATH_MSG_VERBOSE("nfake_mat:");
  if(verbose) nfake_mat.Print();
  
  
  nfake_err_mat =  MMmatrix_sqr*nevents_mat;
    
  int n_proc_acc = 0;
  for (int ipar = 0;  ipar < (0x1 <<nlep) ; ipar++) {
    nrf[ipar] = nfake_mat(ipar, 0);
    if (nrf[ipar] < 0) m_perfectFit = false;
    ATH_MSG_VERBOSE("nrf[" << ipar << "] = " << nrf[ipar]);
    FakeBkgTools::FSBitset fakes = ipar;
    FakeBkgTools::FSBitset reals;
    FakeBkgTools::FSBitset tights = 0;      
    for (int ibit = 0; ibit < nlep; ibit++) {
      tights.set(ibit, 1);
      reals.set(ibit, ~fakes[ibit]);
    }
    if (m_fsvec[lepidx]->accept_process(nlep, reals, tights) && m_fsvec[lepidx]->accept_selection(tights, charges)) {
      ATH_MSG_VERBOSE("Adding " <<  nfake_mat(ipar,0) << " to m_nfakes_std");
      n_proc_acc++;
      m_nfakes_std += nfake_mat(ipar,0);
      m_nfakes_std_err += nfake_err_mat(ipar, 0);
    }
  }
  
  ATH_MSG_VERBOSE("Accepted " << n_proc_acc << " processes for nlep = " << nlep);
  ATH_MSG_VERBOSE("m_nfakes_std = " << m_nfakes_std);
  
}

get_init_pars()

void LhoodMM_tools::get_init_pars ( std::vector< double > & init_pars, int nlep )

private

Definition at line 1250 of file LhoodMM_tools.cxx.

                                                                     {
 
  ATH_MSG_VERBOSE("Setting initial parameters for nlep = " << nlep);
 
  int lepidx = nlep-1;
 
  vector<double> nrf;
  nrf.resize(0x1 <<nlep);
  get_analytic(nrf, nlep);
  m_real_indices[lepidx].clear();
  m_fake_indices[lepidx].clear();
  
  std::string txt = "Testing variable transform: Initial nrf: ";
  for (auto i = nrf.begin(); i != nrf.end(); ++i)
    txt += std::to_string(*i) + ' ';
  ATH_MSG_VERBOSE(txt);
 
  vector<double> init_angles;
 
  double nfakes_std_thisnlep = 0;
  
  ATH_MSG_VERBOSE("m_fsvec.size() = " << m_fsvec.size() );
  for (int ipar = 0; ipar < 0x1 <<nlep; ipar++) {
    ATH_MSG_VERBOSE("ipar = " << ipar );
    FakeBkgTools::FSBitset fakes = ipar;
    FakeBkgTools::FSBitset reals;
    for (int ibit = 0; ibit < nlep; ibit++) {
      reals.set(ibit, ~fakes[ibit]);
    }
    ATH_MSG_VERBOSE("reals set" );
    bool countsAsFake = false;
    for (int jpar = 0; jpar <  0x1 <<nlep; jpar++) {
      FakeBkgTools::FSBitset tights = jpar;
      for (int kpar = 0; kpar < 0x1 <<nlep; kpar++) {
    FakeBkgTools::FSBitset charges = kpar;
    if (!countsAsFake && 
        m_fsvec[lepidx]->accept_process(nlep, reals, tights) && 
        m_fsvec[lepidx]->accept_selection(tights, charges) ) {
      ATH_MSG_VERBOSE("accepted " << ipar);
      nfakes_std_thisnlep += nrf[ipar];
      m_fake_indices[lepidx].push_back(ipar);
      countsAsFake = true;
      break;
    }
      }
    }
    if (!countsAsFake) {
      ATH_MSG_VERBOSE("trying to push onto m_real_indices");
      ATH_MSG_VERBOSE("m_real_indices.size() = " << m_real_indices.size());
      m_real_indices[lepidx].push_back(ipar);
    }
  }
 
  init_pars[0] = nfakes_std_thisnlep;
  for (unsigned ipar = 1; ipar <= m_real_indices[lepidx].size(); ipar++) {
    init_pars[ipar] = nrf[m_real_indices[lepidx][ipar-1]];
  }
 
  if (nfakes_std_thisnlep > 0.5) {
    double sinterm = 1.;
    int ifake = 0;
    for (int ipar = m_real_indices[lepidx].size()+1; ipar < (0x1 << nlep); ipar++) {
      init_pars[ipar] = TMath::ACos(TMath::Sqrt(TMath::Max(nrf[m_fake_indices[lepidx][ifake] ], 0.)/(nfakes_std_thisnlep))/sinterm);
      sinterm *= TMath::Sin(init_pars[ipar]);
      ifake++;
    }
  } else {
    for (int ipar = m_real_indices[lepidx].size()+1; ipar < (0x1 << nlep); ipar++) {
      init_pars[ipar] = s_piover4;
    }
  }
 
  if (m_printLevel > 0) {
    txt = "testing variable transform: Initial pars: ";
    for (int i = 0; i < (0x1 << nlep); i++) {
      txt += std::to_string(init_pars[i]) + " ";
    }
    ATH_MSG_VERBOSE(txt);
  }
 
  // fix any nan's...
  for (int ipar = 2; ipar < (0x1 << nlep); ipar++) {
    if (TMath::IsNaN(init_pars[ipar])) {
      init_pars[ipar] = 0.;
    }
    ATH_MSG_VERBOSE("Setting angle parameter " << ipar << " to " <<  init_pars[ipar]);
  }
}

getCachedFinalState()

FinalState BaseFakeBkgTool::getCachedFinalState ( uint8_t nparticles, const std::string & strPID, const std::string & strProc, bool & success )

protectedinherited

no longer fill cache if it becomes too large

Definition at line 248 of file BaseFakeBkgTool.cxx.

{
    success = true;
    size_t hFS = m_hasher(strProc) ^ m_hasher(strPID) ^ nparticles;
    auto itrFS = m_cachedFinalStates.find(FinalState(hFS));
    if(itrFS != m_cachedFinalStates.end()) return *itrFS;
    std::string error;
    FinalState fs(hFS, nparticles, strPID, strProc, error);
    if(error.length())
    {
        ATH_MSG_ERROR(error);
        success = false;
        return FinalState(0);
    }
    if(m_cachedFinalStates.size() < 1024) 
    {
        m_cachedFinalStates.emplace(fs);
    }
    return fs;
}

getFitStatus()

Int_t CP::LhoodMM_tools::getFitStatus ( )

inline

Definition at line 60 of file LhoodMM_tools.h.

{return m_fitStatus;}

getKey()

SG::sgkey_t asg::AsgTool::getKey ( const void * ptr ) const

inherited

Get the (hashed) key of an object that is in the event store.

This is a bit of a special one. StoreGateSvc and xAOD::TEvent both provide ways for getting the SG::sgkey_t key for an object that is in the store, based on a bare pointer. But they provide different interfaces for doing so.

In order to allow tools to efficiently perform this operation, they can use this helper function.

See also

asg::AsgTool::getName

Parameters

ptr	The bare pointer to the object that the event store should know about

Returns

The hashed key of the object in the store. If not found, an invalid (zero) key.

Definition at line 119 of file AsgTool.cxx.

                                                    {
 
#ifdef XAOD_STANDALONE
      // In case we use @c xAOD::TEvent, we have a direct function call
      // for this.
      return evtStore()->event()->getKey( ptr );
#else
      const SG::DataProxy* proxy = evtStore()->proxy( ptr );
      return ( proxy == nullptr ? 0 : proxy->sgkey() );
#endif // XAOD_STANDALONE
   }

getListOfEfficienciesAffectedBy()

std::string BaseFakeBkgTool::getListOfEfficienciesAffectedBy ( uint16_t uid ) const

protectedinherited

Definition at line 385 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized");
        return "";
    }
    std::bitset<Database::N_EFFICIENCY_TYPES> affects;
    auto stat = m_database->findStat(uid);
    if(stat) affects = stat->affects;
    else
    {
        auto syst = m_database->findSyst(uid);
        if(syst) affects = syst->affects;
        else
        {
            ATH_MSG_ERROR("uncertainty with UID " << std::hex << uid << std::dec << " not found in database");
            return "";
        }
    }
    std::string info;
    if(affects[Database::ELECTRON_REAL_EFFICIENCY]) info += "electron real efficiencies, ";
    if(affects[Database::ELECTRON_FAKE_EFFICIENCY]) info += "electron fake efficiencies, ";
    if(affects[Database::ELECTRON_FAKE_FACTOR]) info += "electron fake factors, ";
    if(affects[Database::MUON_REAL_EFFICIENCY]) info += "muon real efficiencies, ";
    if(affects[Database::MUON_FAKE_EFFICIENCY]) info += "muon fake efficiencies, ";
    if(affects[Database::MUON_FAKE_FACTOR]) info += "muon fake factors, ";
    if(affects[Database::PHOTON_ELE_FAKE_FACTOR]) info += "electron->photon fake rate, ";
    if(affects[Database::PHOTON_ELE_FAKE_FACTOR_SF]) info += "electron->photon fake rate scale factor, ";
    return info.substr(0, info.size()-2);
}

getName()

const std::string & asg::AsgTool::getName ( const void * ptr ) const

inherited

Get the name of an object that is / should be in the event store.

This is a bit of a special one. StoreGateSvc and xAOD::TEvent both provide ways for getting the std::string name for an object that is in the store, based on a bare pointer. But they provide different interfaces for doing so.

In order to allow tools to efficiently perform this operation, they can use this helper function.

See also

asg::AsgTool::getKey

Parameters

ptr	The bare pointer to the object that the event store should know about

Returns

The string name of the object in the store. If not found, an empty string.

Definition at line 106 of file AsgTool.cxx.

                                                            {
 
#ifdef XAOD_STANDALONE
      // In case we use @c xAOD::TEvent, we have a direct function call
      // for this.
      return evtStore()->event()->getName( ptr );
#else
      const SG::DataProxy* proxy = evtStore()->proxy( ptr );
      static const std::string dummy = "";
      return ( proxy == nullptr ? dummy : proxy->name() );
#endif // XAOD_STANDALONE
   }

getProperty()

template<class T>

const T * asg::AsgTool::getProperty ( const std::string & name ) const

inherited

Get one of the tool's properties.

getSystDescriptor()

virtual const IFakeBkgSystDescriptor & CP::BaseFakeBkgTool::getSystDescriptor ( ) const

inlineoverridevirtualinherited

retrieves an interface to various helper methods to identify what the different SystematicVariations correspond to

Implements CP::IFakeBkgTool.

Definition at line 74 of file BaseFakeBkgTool.h.

{return *this; }

getTotalYield()

StatusCode LhoodMM_tools::getTotalYield ( float & yield, float & statErrorUp, float & statErrorDown )

finaloverridevirtual

returns the accumulated fake lepton background yield (or compute it, in the case of the likelihood matrix method), and fills the registered histograms (if any) The 'selection' and 'process' settings used for these operations can be chosen with the 'Selection' and 'Process' properties.

Only statistical uncertainties can be retrieved; use applySystematicVariation() to obtain uncertainties

Implements CP::IFakeBkgTool.

Definition at line 306 of file LhoodMM_tools.cxx.

                                                                                          {
 
  if (m_progressFileName != "none"  && m_alreadyMerged == false) {
    ATH_CHECK( mergeSubJobs() );
  }
  
  //set output level according to debug flag, also check whether setPrintLevel was called directly
  msgLvl(MSG::DEBUG) ||  msgLvl(MSG::VERBOSE) || (m_printLevel > 0) ?  m_printLevel = 1 : m_printLevel = -1;
 
  Double_t poserr, negerr;
  
  m_current_fitInfo = &m_global_fitInfo;
  yield = nfakes(&poserr,&negerr);
 
  ATH_MSG_DEBUG("Leaving getTotalYield with yield = " << yield);
 
  statErrUp = poserr;
  statErrDown = -negerr;
 
  return fillHistograms();
}

getUncertaintyDescription()

std::string BaseFakeBkgTool::getUncertaintyDescription ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

returns a human-readable description of the source of systematic uncertainty specified as argument

need to add more info (bin index, etc)

Implements CP::IFakeBkgSystDescriptor.

Definition at line 519 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized");
        return "";
    }
    
    auto UID = identifyCpSystematicVariation(systematic).first;
    if(!UID) 
    {
        ATH_MSG_WARNING("Systematic variation " + systematic.name() + " is not recognized by BaseFakeBkgTool");
        return "";
    }
    
    if(UID == 0)
    {
        return "Total statistical uncertainty in the event yield";
    }
    std::string info;
    auto stat = m_database->findStat(UID);
    if(stat)
    {
        info = "Statistical uncertainty affecting ";
    }
    else
    {
        auto syst = m_database->findSyst(UID);
        if(syst)
        {
            info = "Systematic uncertainty \"" + syst->name + "\" affecting ";
        }
        else
        {
            ATH_MSG_ERROR("uncertainty with UID " << std::hex << UID << std::dec << " not found in database");
            return "";
        }
    }
    info += getListOfEfficienciesAffectedBy(UID);
    return info;
}

identifyCpSystematicVariation()

std::pair< uint16_t, float > BaseFakeBkgTool::identifyCpSystematicVariation ( const CP::SystematicVariation & systematic ) const

privateinherited

Definition at line 417 of file BaseFakeBkgTool.cxx.

{
    if(!m_initialized || !m_database)
    {
        ATH_MSG_ERROR("This function can be called only once the tool has been initialized, since the number of systematic variations depends on the configuration...");
        throw std::logic_error("BaseFakeBkgTool::identifyCpSystematicVariation() called before initialization");
    }
    std::smatch smr;
    auto bn = systematic.basename();
    if(!std::regex_match(bn, smr, std::regex("FAKEBKG_(STAT|SYST)_VAR(\\d+)")))  return {{0}, 0.f};
    unsigned index = std::stol(smr[2].str());
    float sigma = systematic.parameter();
    if(smr[1].str() == "SYST") return {m_database->systIndexToUID(index), sigma};
    else return {m_database->statIndexToUID(index), sigma};
}

importEfficiencies()

bool BaseFakeBkgTool::importEfficiencies ( bool resetDB = false )

privateinherited

load the config file(s) storing efficiencies

XML parsing error

ROOT histograms importing error, or unknown error

Definition at line 127 of file BaseFakeBkgTool.cxx.

{
    if(resetDB) m_database->reset();
    std::string filename;
    try
    {
        for(const auto& fn : m_inputFiles)
        {
            filename = PathResolverFindDataFile(fn);
            auto pos = filename.rfind(".xml");
            if(pos == filename.length()-4)
            {
                m_database->importXML(filename);
                continue;
            }
            pos = filename.rfind(".root");
            if(pos == filename.length()-5)
            {
                m_database->importDefaultROOT(fn);
                continue;
            }
            ATH_MSG_ERROR("File extension not supported for " << filename);
            return false;
        }
    }
    catch(const Database::XmlError& err) 
    {
        unsigned line1 = m_database->getXmlLineNumber(err.location.ptr);
        unsigned line2 = m_database->getXmlLineNumber(err.location.endptr);
        ATH_MSG_INFO("Exception caught while reading file " << filename << ", details follow");
        std::string fullmsg = "(while parsing XML, line";
        if(line2 != line1) fullmsg += "s " + std::to_string(line1) + " - " + std::to_string(line2);
        else fullmsg += " " + std::to_string(line1);
        fullmsg +=  "): " +  err.reason;
        ATH_MSG_ERROR(fullmsg);
        return false;
    }
    catch(const Database::GenericError& err) 
    {
        ATH_MSG_INFO("Exception caught while reading file " << filename << ", details follow");
        ATH_MSG_ERROR(err.reason);
        return false;
    }
    return m_database->ready();
}

incrementMatrices()

StatusCode LhoodMM_tools::incrementMatrices ( const LhoodMMEvent & mmevt )

private

Definition at line 328 of file LhoodMM_tools.cxx.

                                                                     {
 
  int nlep = mmevt.nlep();
  //increment global matrix
  if (m_needToResize) {
    m_global_fitInfo.resizeVectors(nlep);
  }
 
  ATH_CHECK(incrementOneMatrixSet(m_global_fitInfo, mmevt));
 
  // increment matrix terms for all registered histograms
  // if size needs to increase, this must be done for all bins...
 
  for (auto map1_iter = m_values_1dhisto_map.begin(); map1_iter != m_values_1dhisto_map.end(); map1_iter++) {
    const float* val = map1_iter->second;
    TH1* h = map1_iter->first;
    auto histoMap = m_fitInfo_1dhisto_map.find(map1_iter->first);
    if (histoMap != m_fitInfo_1dhisto_map.end() ) {
      int icell;
      LhoodMMFitInfo *fitInfo;
      if (m_needToResize) {
    for (icell = 0; icell<h->GetNcells(); icell++) {
      fitInfo = &histoMap->second[icell];
      fitInfo->resizeVectors(nlep);
    }
      }
      icell = h->FindBin(*val);
      ATH_MSG_VERBOSE("fitInfo vector size is " << histoMap->second.size());
      fitInfo = &histoMap->second[icell];
      ATH_MSG_VERBOSE("icell is " << icell);
      ATH_MSG_VERBOSE("fitInfo totEvents is " << fitInfo->totEvents);
      ATH_MSG_VERBOSE("need to resize? " << m_needToResize);
      ANA_CHECK(incrementOneMatrixSet(*fitInfo, mmevt));
      ATH_MSG_VERBOSE("need to resize now? " << m_needToResize);
    } else {
      ATH_MSG_ERROR("Can not find entry for 1d histogram"); 
      return StatusCode::FAILURE;
    }
  }
  
  std::map<TH2*, std::pair<const float*, const float*> >::iterator map2_iter;
  for (map2_iter = m_values_2dhisto_map.begin(); map2_iter != m_values_2dhisto_map.end(); ++map2_iter) {
    std::pair<const float*, const float*> val = map2_iter->second;
    TH2* h = map2_iter->first;
 
    auto histoMap = m_fitInfo_2dhisto_map.find(map2_iter->first);
    if (histoMap != m_fitInfo_2dhisto_map.end() ) {
      int icell;
      LhoodMMFitInfo *fitInfo;
      if (m_needToResize) {
    for (icell = 0; icell<h->GetNcells(); icell++) {
      fitInfo = &histoMap->second[icell];
      fitInfo->resizeVectors(nlep);
    }
      }
      icell = h->FindBin(*(val.first), *(val.second));
      fitInfo = &histoMap->second[icell];
      ANA_CHECK(incrementOneMatrixSet(*fitInfo, mmevt));
    } else {
      ATH_MSG_ERROR("Can not find entry for 2d histogram"); 
      return StatusCode::FAILURE;
    }
 
  }
 
  std::map<TH3*, std::tuple<const float*, const float*, const float*> >::iterator map3_iter;
  for (map3_iter = m_values_3dhisto_map.begin(); map3_iter != m_values_3dhisto_map.end(); ++map3_iter) {
    std::tuple<const float*, const float*, const float*> val = map3_iter->second;
    TH3* h = map3_iter->first;
    auto histoMap = m_fitInfo_3dhisto_map.find(map3_iter->first);
    if (histoMap != m_fitInfo_3dhisto_map.end() ) {
      int icell;
      LhoodMMFitInfo *fitInfo;
      if (m_needToResize) {
        for (icell = 0; icell<h->GetNcells(); icell++) {
          fitInfo = &histoMap->second[icell];
          fitInfo->resizeVectors(nlep);
        }
      }
      icell = h->FindBin(*(std::get<0>(val)), *(std::get<1>(val)), *(std::get<2>(val)) );
      fitInfo = &histoMap->second[icell];
      ANA_CHECK(incrementOneMatrixSet(*fitInfo, mmevt));
    } else {
      ATH_MSG_ERROR("Can not find entry for 3d histogram"); 
      return StatusCode::FAILURE;
    }
  }
 
  return StatusCode::SUCCESS;
}

incrementOneMatrixSet()

StatusCode LhoodMM_tools::incrementOneMatrixSet ( LhoodMMFitInfo & fitInfo, const LhoodMMEvent & mmevt )

private

Definition at line 419 of file LhoodMM_tools.cxx.

                                                   {
 
  int nlep = mmevt.nlep();
  int lepidx = nlep-1;
  int rank = 0x1 << nlep;
 
  fitInfo.totEvents++;
  fitInfo.eventCount[lepidx]++;
 
 
  if (nlep <= s_nLepMax) {
    ATH_MSG_VERBOSE("In incrementMatrices, how many uncertainties? " << mmevt.realEffObj(0).uncertainties.size());
    ATH_MSG_VERBOSE("In incrementMatrices, m_totEvents = " << fitInfo.totEvents);
 
    unsigned int catIndex = 0;
    for (int jlep = 0; jlep < nlep; jlep++) {
      catIndex += (!mmevt.isTight(jlep)) << jlep;
    }
    double weight = mmevt.weight();
 
    ATH_MSG_VERBOSE("event_cat.size() = " << fitInfo.event_cat.size());
    ATH_MSG_VERBOSE("event_sumw2.size() = " << fitInfo.event_sumw2.size());
 
    ATH_MSG_VERBOSE("nlep= " << nlep);
    ATH_MSG_VERBOSE("catIndex= " << catIndex);
    ATH_MSG_VERBOSE("fitInfo.event_cat.at(nlep-1).size() = " << fitInfo.event_cat.at(lepidx).size());
 
    fitInfo.event_cat[lepidx][catIndex] +=weight;
    fitInfo.event_sumw2[lepidx][catIndex]+=weight*weight;
 
    ATH_MSG_VERBOSE("Done updating event_cat and event_sumw2");
  
    //check to see if there is at least one OS pair...
    for (int icomb = 0; icomb < (0x1 << nlep); icomb++) {
      int totcharge = 0;
      std::bitset<s_nLepMax+1> tights(icomb);
      int ntight = tights.count();
      
      for (int jlep = 0; jlep < nlep; jlep++) {
    if (tights[jlep]) {
      totcharge += mmevt.charge(jlep);
    }
      }
 
      ATH_MSG_VERBOSE("Setting OSfrac_denom[" << lepidx << "][" << ntight << "]");
      ATH_MSG_VERBOSE("size is " << fitInfo.OSfrac_denom.size() );
      ATH_MSG_VERBOSE("size is " << fitInfo.OSfrac_denom[lepidx].size() );
      ATH_MSG_VERBOSE("weight is " << weight  );
      fitInfo.OSfrac_denom[lepidx][ntight]+=weight;
      ATH_MSG_VERBOSE("Setting OSfrac_num[" << lepidx << "][" << ntight << "]");
      if ((TMath::Abs(totcharge) < ntight) || ntight == 1) fitInfo.OSfrac_num[lepidx][ntight]+=weight;
    }
  
  
    std::vector<std::vector<FakeBkgTools::Efficiency>> vals(2, std::vector<FakeBkgTools::Efficiency>(nlep));
    for (int ilep = 0; ilep < nlep; ilep++) {
      ATH_MSG_VERBOSE("1 vals[0].size() = " << vals[0].size());
      ATH_MSG_VERBOSE("getting efficiency values for lepton " << ilep);
      ATH_MSG_VERBOSE("how many leptons are there? " << mmevt.nlep());
      ATH_MSG_VERBOSE("nlep-ilep-1 = " << nlep-ilep-1);
      ATH_MSG_VERBOSE("2 vals[0].size() = " << vals[0].size());
      ATH_MSG_VERBOSE("vals[1].size() = " << vals[1].size());
      vals[0][ilep] = mmevt.realEffObj(ilep);
      if (m_doFakeFactor) {
    vals[0][ilep].setToConst(1.0);
      }
      vals[1][ilep] = mmevt.fakeEffObj(ilep);
      ATH_MSG_VERBOSE("Real and fake efficiencies for lepton " << ilep << ": " << vals[0][nlep-ilep-1].value(this) << " " << vals[1][nlep-ilep-1].value(this));
      ATH_MSG_VERBOSE("this is surely harmless");
      ATH_MSG_VERBOSE("3 vals[0].size() = " << vals[0].size());
    }
    
    FakeBkgTools::Efficiency curr_coeff_num;
    ATH_MSG_VERBOSE("how many uncertainties in curr_coeff_num? " << curr_coeff_num.uncertainties.size());
    for (int irf = 0; irf < rank; irf++) {
      for (int itl = 0; itl < rank; itl++) {
    curr_coeff_num.setToConst(1.);
    for (int ilep = 0; ilep < nlep; ilep++) {
      if (itl & (0x1 << ilep) ) {
        if (irf & (0x1 << ilep)) {
          FakeBkgTools::Efficiency tmpEff = vals[1][ilep];
          curr_coeff_num.multiply(tmpEff.subFromOne());
        } else {
          FakeBkgTools::Efficiency tmpEff = vals[0][ilep];
          curr_coeff_num.multiply(tmpEff.subFromOne());
        }
      } else {
        if (irf & (0x1 << ilep) ) {
          curr_coeff_num.multiply(vals[1][ilep]);
        } else {
          curr_coeff_num.multiply(vals[0][ilep]);
        }
      }
    }
    ATH_MSG_VERBOSE("about to set m_coeffs_num[" << lepidx << "][" << itl << "][" << irf << "]");
    ATH_MSG_VERBOSE("setting normterm " << (itl<<nlep) + irf);
    fitInfo.normterms[lepidx][(itl<<nlep) + irf].add(curr_coeff_num);
    fitInfo.coeffs_num[lepidx][itl][irf].add(curr_coeff_num);
    ATH_MSG_VERBOSE("how many uncertainties in coeffs_num? " << fitInfo.coeffs_num[lepidx][itl][irf].uncertainties.size());
    ATH_MSG_VERBOSE("done setting normterm ");
      }
    }
    return StatusCode::SUCCESS;
  }  else {
    ATH_MSG_ERROR( "Error: can only handle " << s_nLepMax << " leptons; you tried " << nlep);
    return StatusCode::FAILURE;
  }
  
}

initialize()

StatusCode LhoodMM_tools::initialize ( void )

overridevirtual

Dummy implementation of the initialisation function.

It's here to allow the dual-use tools to skip defining an initialisation function. Since many are doing so...

Reimplemented from CP::BaseFakeBkgTool.

Definition at line 72 of file LhoodMM_tools.cxx.

{
  return BaseFakeBkgTool::initialize();
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

isAffectedBySystematic()

bool BaseFakeBkgTool::isAffectedBySystematic ( const CP::SystematicVariation & systematic ) const

overridevirtualinherited

Declare the interface that this class provides.

returns: whether this tool is affected by the given systematics

Implements CP::ISystematicsTool.

Definition at line 433 of file BaseFakeBkgTool.cxx.

{
    return identifyCpSystematicVariation(systematic).first;
}

isStatisticalUncertainty()

bool BaseFakeBkgTool::isStatisticalUncertainty ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty originates from a statistical uncertainty in the efficiencies (as opposed to systematic)

Implements CP::IFakeBkgSystDescriptor.

Definition at line 569 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return Database::isStatUID(UID);
    return false;
}

isSystematicUncertainty()

bool BaseFakeBkgTool::isSystematicUncertainty ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

checks whether the specified source of uncertainty originates from a systematic uncertainty in the efficiencies (as opposed to statistical)

Implements CP::IFakeBkgSystDescriptor.

Definition at line 562 of file BaseFakeBkgTool.cxx.

{
    uint16_t UID = identifyCpSystematicVariation(systematic).first;
    if(UID) return Database::isSystUID(UID);
    return false;
}

logPoisson()

double LhoodMM_tools::logPoisson ( double obs, double pred )

staticprivate

Definition at line 548 of file LhoodMM_tools.cxx.

                                                        {
  
  double f =  -(obs*TMath::Log(pred)-pred);
  if (obs > 0) f += obs*TMath::Log(obs)-obs;
  return f;
}

mapLhood()

void CP::LhoodMM_tools::mapLhood ( TMinuit_LHMM * lhoodFit, int nlep, double min, double max )

private

mergeSubJobs()

StatusCode LhoodMM_tools::mergeSubJobs

(

)

Definition at line 1707 of file LhoodMM_tools.cxx.

                                       {
 
  ATH_MSG_VERBOSE("Merging sub jobs");
 
  m_alreadyMerged = true;
  std::string filename = PathResolverFindDataFile(m_progressFileName);
  std::unique_ptr<TFile> fin( new TFile(filename.c_str()));
  if (fin == nullptr) {
    ATH_MSG_ERROR("Unable to open merged input file " << filename );
    return StatusCode::FAILURE;
  }
  if(m_progressFileDirectory.length()) {
    if(!fin->cd(m_progressFileDirectory.c_str())) {
      ATH_MSG_ERROR("Unable to find the directory " << m_progressFileDirectory << " inside the file " << filename);
      return StatusCode::FAILURE;
    }
  }
 
  std::string prefix = (m_progressFileDirectory.length()? "/" + m_progressFileDirectory + "/" : "");
  
  TTree *t_nlep = (TTree*)fin->Get((prefix + "LhoodMM_progress_nlep").c_str());
  if (t_nlep == nullptr) {
    ATH_MSG_ERROR("Unable to find LhoodMM_progress_nlep tree in " << filename);
    return StatusCode::FAILURE;
  }
 
  int merged_maxnlep, merged_maxnlep_prev = -1;
  t_nlep->SetBranchAddress("maxnlep", &merged_maxnlep);  
 
  TTree *t = (TTree*)fin->Get((prefix + "LhoodMM_progress").c_str());
  if (t == nullptr) {
    ATH_MSG_ERROR("Unable to find LhoodMM_progress tree in " << filename);
    return StatusCode::FAILURE;
  }
  
  // check that we are not trying to merge subjobs with inconsistent lepton
  // multiplicities
  Int_t nentries = (Int_t)t_nlep->GetEntries();
  for (Int_t ievt = 0; ievt < nentries; ievt++) {
    t_nlep->GetEntry(ievt);
    if (ievt > 0 && (merged_maxnlep != merged_maxnlep_prev)) {
      ATH_MSG_ERROR("Attempting to merge files with different lepton multiplicities.  This is not supported.");
      return StatusCode::FAILURE;
    }
    merged_maxnlep_prev = merged_maxnlep;  
  }
 
  m_maxnlep_loose = merged_maxnlep;
 
  std::unique_ptr<LhoodMMFitInfo> tmpFitInfo(new LhoodMMFitInfo);
 
  tmpFitInfo->resizeVectors(m_maxnlep_loose);
  m_global_fitInfo.resizeVectors(m_maxnlep_loose);
  
  LhoodMMFitInfo* fitInfoPtr = tmpFitInfo.get();
  t->SetBranchAddress("glb_fitInfo", &fitInfoPtr );
 
  ATH_MSG_VERBOSE("About to add LhoodMMFitInfos");
 
 // prepare to merge any histograms
 
  std::unique_ptr<std::map<TH1*, std::vector< LhoodMMFitInfo > > > tmp_fitInfo_1dhisto_map(new std::map<TH1*, std::vector< LhoodMMFitInfo > >);
  auto *tmp_fitInfo_1dhisto_map_ptr =  tmp_fitInfo_1dhisto_map.get(); 
  t->SetBranchAddress("fitInfo_1dhisto_map", &tmp_fitInfo_1dhisto_map_ptr);
  std::unique_ptr<std::map<TH2*, std::vector< LhoodMMFitInfo > > > tmp_fitInfo_2dhisto_map(new std::map<TH2*, std::vector< LhoodMMFitInfo > >);
  auto *tmp_fitInfo_2dhisto_map_ptr =  tmp_fitInfo_2dhisto_map.get(); 
  t->SetBranchAddress("fitInfo_2dhisto_map", &tmp_fitInfo_2dhisto_map_ptr);
  std::map<TH3*, std::vector< LhoodMMFitInfo > > *tmp_fitInfo_3dhisto_map =  new std::map<TH3*, std::vector< LhoodMMFitInfo > >;
  t->SetBranchAddress("fitInfo_3dhisto_map", &tmp_fitInfo_3dhisto_map);
 
  nentries = (Int_t)t->GetEntries();
  for (Int_t ievt = 0; ievt < nentries; ievt++) {
    t->GetEntry(ievt);
    ATH_MSG_VERBOSE("Adding LhoodMMFitInto with " << (*tmpFitInfo).totEvents << " events, with m_maxnlep_loose = " <<  m_maxnlep_loose );    
    m_global_fitInfo.add(*tmpFitInfo, m_maxnlep_loose);
    for (auto& hm :  m_fitInfo_1dhisto_map) {
      TH1F* histogram = (TH1F*)hm.first;
      std::string hname = histogram->GetName();
      for (auto& im: *tmp_fitInfo_1dhisto_map) {
    ATH_MSG_VERBOSE("Found a matching histogram");
    TH1F* ihistogram = (TH1F*)im.first;
    std::string iname = ihistogram->GetName();
    if (hname == iname) {
      int ncells = histogram->GetNcells();
      for (int icell = 0; icell<ncells; icell++) {
        hm.second[icell].resizeVectors(m_maxnlep_loose);
        hm.second[icell].add(im.second[icell], m_maxnlep_loose);
      }
    }
      }
    }
    for (auto& hm :  m_fitInfo_2dhisto_map) {
      TH1F* histogram = (TH1F*)hm.first;
      std::string hname = histogram->GetName();
      for (auto& im: *tmp_fitInfo_2dhisto_map) {
    ATH_MSG_VERBOSE("Found a matching histogram");
    TH1F* ihistogram = (TH1F*)im.first;
    std::string iname = ihistogram->GetName();
    if (hname == iname) {
      int ncells = histogram->GetNcells();
      for (int icell = 0; icell<ncells; icell++) {
        hm.second[icell].resizeVectors(m_maxnlep_loose);
        hm.second[icell].add(im.second[icell], m_maxnlep_loose);
      }
    }
      }
    }
    for(auto& hm : m_fitInfo_3dhisto_map){
      TH1F* histogram = (TH1F*)hm.first;
      std::string hname = histogram->GetName();
      for (auto& im: *tmp_fitInfo_3dhisto_map){
        ATH_MSG_VERBOSE("Found a matching histogram");
        TH1F* ihistogram = (TH1F*)im.first;
        std::string iname = ihistogram->GetName();
        if (hname == iname) {
          int ncells = histogram->GetNcells();
          for (int icell = 0; icell<ncells; icell++) {
            hm.second[icell].resizeVectors(m_maxnlep_loose);
            hm.second[icell].add(im.second[icell], m_maxnlep_loose);
          }
        }
      }
    }
    
    ATH_MSG_VERBOSE("Added " << ievt);
 
  }
 
  
  ATH_MSG_VERBOSE("Merged totEvents is " << m_global_fitInfo.totEvents);
  for (int ilep = 0; ilep < m_maxnlep_loose; ilep++) {
    ATH_MSG_VERBOSE("Merged  event count is " << m_global_fitInfo.eventCount[ilep]);
  }
 
  return StatusCode::SUCCESS;
}

msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msg_level_name()

const std::string & asg::AsgTool::msg_level_name ( ) const

inherited

A deprecated function for getting the message level's name.

Instead of using this, weirdly named function, user code should get the string name of the current minimum message level (in case they really need it...), with:

MSG::name( msg().level() )

This function's name doesn't follow the ATLAS coding rules, and as such will be removed in the not too distant future.

Returns

The string name of the current minimum message level that's printed

Definition at line 101 of file AsgTool.cxx.

                                                  {
 
      return MSG::name( msg().level() );
   }

msgLvl()

bool AthCommonMsg< AlgTool >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

nfakes()

double LhoodMM_tools::nfakes	(	Double_t *	poserr,
		Double_t *	negerr )

Definition at line 750 of file LhoodMM_tools.cxx.

                                                               {
  // This top-level function modifies (via a call to setup()) the static variable m_current_lhoodMM_tool,
  // which is used to provide information to the minimized function fcn_nlep.
  // It also uses TMinuit for the minimisation.  
  // Re-entrancy (by different class instances in different threads) is thus enforced with a critical section. 
  std::lock_guard<std::mutex> lock(LhoodMM_tools::s_mutex); 
  if (m_current_fitInfo->totEvents == 0) {
    *poserr = 0.;
    *negerr = 0.;
    return 0.;
  }
 
  m_fitStatus = 0;
 
  m_minnlep = s_nLepMax;
  m_maxnlep = 0;
 
  m_requireSS = false;
  m_requireOS = false;
 
  for (int ilep = 0; ilep < s_nLepMax; ilep++) {
    string error;
    // possible issue here -- reassigning vector elements?
    m_fsvec[ilep].reset(new FakeBkgTools::FinalState(0, ilep+1, m_selection, m_process, error));
    if (error.size() > 0) {
      ATH_MSG_VERBOSE("Unable to parse selection " << m_selection << " with process " << m_process << " with " << ilep+1 << " leptons. Error is " << error);
      continue; // unable to parse selection
    }
    if (m_fsvec[ilep]->hasSS() ) {
      m_requireSS = true;
    }
    if (m_fsvec[ilep]->hasOS() ) {
      m_requireOS = true;
    } 
    m_fsvec[ilep]->setSS(false);
    m_fsvec[ilep]->setOS(false);
 
    // charges will only give the charges of the leptons in the most recently
    // added event.  That's why the tricks with the hasSS, hasOS, setSS, and
    // setOS functions are played above (so we don't actually have to care 
    // about the values here) 
    auto charges = m_fsvec[ilep]->retrieveCharges(m_particles);  
  
    for (int icomb = 0; icomb < (0x1 << (ilep+1)); icomb++) {
      FakeBkgTools::FSBitset tights(icomb);
      ATH_MSG_VERBOSE("ilep " << ilep << " (0x1 << ilep) " << std::hex << (0x1 << ilep) << " icomb " << std::hex << icomb << std::dec);
      ATH_MSG_VERBOSE("tights = " << std::hex << tights << std::dec);
      ATH_MSG_VERBOSE("charges = " << std::hex << charges << std::dec);
 
      if (m_fsvec[ilep]->accept_selection(tights, charges)) {
    int nlep = ilep+1; 
    ATH_MSG_VERBOSE("tights = " << std::hex << tights << std::dec << " nlep = " << nlep);
    if (nlep > m_maxnlep) m_maxnlep = nlep;
    if (nlep < m_minnlep) m_minnlep = nlep;
      }
    }
     
  }
 
  //protect against selection strings that don't explicitly require at least
  //one lepton
  if (m_minnlep < 1) m_minnlep = 1;
 
  ATH_MSG_VERBOSE("m_minnlep, m_maxnlep = " << m_minnlep << " " << m_maxnlep);
  int minNlep_proc = m_maxnlep;
  int maxNlep_proc = 0;
  for (int  n=m_minnlep;n<=m_maxnlep;++n)  {
    for(unsigned c=0;c<(1u<<n);++c) // loop on all possible n-particles tight/loose combinations; there are 2^n of them
      {
    FakeBkgTools::FSBitset fakes = c;
    FakeBkgTools::FSBitset reals = 0;
    FakeBkgTools::FSBitset tights = 0;      
    for (int ibit = 0; ibit < n; ibit++) {
      reals.set(ibit, ~fakes[ibit]);
      tights.set(ibit, 1);
    }
    if (m_fsvec[n-1]->accept_process(n, reals, tights) ) {
      if(n < minNlep_proc)  minNlep_proc = n; // minNlep set to "number of tight leptons in the combination with the least number fo tight leptons"
      if (n > maxNlep_proc) {
        maxNlep_proc = n;
      }
      ATH_MSG_VERBOSE("maxNlep_proc = "<< maxNlep_proc);
      break;
    }
      }
  }
 
  m_minnlep = minNlep_proc;
  m_maxnlep = maxNlep_proc;
  if(setup() != StatusCode::SUCCESS) return 0.;
 
  if (m_maxnlep > m_maxnlep_loose) {
    m_maxnlep = m_maxnlep_loose;
  }
 
  if (m_maxnlep_loose < m_minnlep) {
    ATH_MSG_WARNING("Selection requires more leptons than are in any event in the sample; returning nfakes = 0 +/- 0 " << m_maxnlep_loose);
    *poserr = 0.;
    *negerr = 0.;
    return 0.;
  }
 
  ATH_MSG_VERBOSE("In nfakes, m_minnlep, m_maxnlep, m_maxnlep_loose = " << m_minnlep << " " << m_maxnlep << " " << m_maxnlep_loose);
 
  double nfake_fit, nfake_fitErr;
  
  int npar = 0;
  for (int ilep = m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    npar += 0x1 << ilep;
  }
 
  ATH_MSG_VERBOSE("In nfakes, npar = " << npar);
 
  std::unique_ptr<TMinuit_LHMM> lhoodFit(new TMinuit_LHMM(npar));
  lhoodFit->SetPrintLevel(m_printLevel);
  lhoodFit->SetFCN(fcn_minnlep_maxnlep);
 
 
  Double_t arglist[10];
  Int_t ierflg = 0;
 
  arglist[0] = 0.5;
  lhoodFit->mnexcm("SET ERR", arglist ,1,ierflg);;
 
  m_nfakes_std = 0;
  m_nfakes_std_err = 0;
 
  ATH_MSG_VERBOSE("About to initialize parameters");
 
  vector<double> init_pars;
  init_pars.resize(npar);
  int index = 0;
  vector< vector <double> > loc_init_pars;
  loc_init_pars.resize(m_maxnlep_loose);
 
  for (int ilep = m_minnlep; ilep <=m_maxnlep_loose; ilep++) {
    loc_init_pars[ilep-1].resize(0x1 << ilep);
    get_init_pars(loc_init_pars[ilep-1], ilep);
    for (int ipar = 0; ipar < (0x1 << ilep); ipar++) {
      init_pars[index+ipar] = loc_init_pars[ilep-1][ipar];
    }
    index+= 0x1 << ilep;
  }
 
  Double_t step = TMath::Max(loc_init_pars[m_minnlep-1][0]/1000,0.001);
  ATH_MSG_VERBOSE("parameters initialized OK");
  ATH_MSG_VERBOSE("m_nfakes_std_err = " << m_nfakes_std_err);
 
  m_nfakes_std_err = TMath::Sqrt(m_nfakes_std_err);
  
  vector<TString> parameterName;
  vector<int> nreal_start_indices;
  nreal_start_indices.resize(m_maxnlep_loose);
  parameterName.push_back("nfake_tot");
  TString sreal = "nreal";
  for (int ilep = m_minnlep; ilep<= m_maxnlep_loose; ilep++) {
    char tmpchar[20];
    sprintf(tmpchar, "_%i", ilep);
    TString tmpstr = sreal;
    tmpstr.Append(tmpchar);
    for (unsigned isublep = 0; isublep < m_real_indices[ilep-1].size(); isublep++) {
      TString locsreal = tmpstr;
      char tmpchar2[20];
      sprintf(tmpchar2, "_%u", isublep);
      locsreal.Append(tmpchar2);
      parameterName.push_back(locsreal);
      if (isublep == 0) {
        nreal_start_indices[ilep-1] = (parameterName.size());
        ATH_MSG_VERBOSE("nreal_start_indices[" << ilep-1 << "] = " << nreal_start_indices[ilep-1]);
      }
    }
  }
  
  TString stheta_tot = "theta_tot";
  for (int ilep = m_minnlep; ilep<m_maxnlep_loose; ilep++) {
    char tmpchar[20];
    sprintf(tmpchar, "_%i", ilep-m_minnlep);
    TString tmpstr = stheta_tot;
    tmpstr.Append(tmpchar);
    parameterName.push_back(tmpstr);
  }
 
  for (int ilep = m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    TString stheta = "theta_";
    char tmpchar[20];
    sprintf(tmpchar, "%i", ilep);
    TString tmpstr = std::move(stheta);
    tmpstr.Append(tmpchar);
    tmpstr.Append("_");
    ATH_MSG_VERBOSE("How many fake indices?" << m_fake_indices[ilep-1].size());
    for(int jlep = 0; jlep < (int)m_fake_indices[ilep-1].size() - 1; jlep++) {
      TString locstheta = tmpstr;
      char tmpchar2[20];
      sprintf(tmpchar2, "%i", jlep);
      locstheta.Append(tmpchar2);
      parameterName.push_back(locstheta);
    }
    
  }
 
  vector<double> theta_tot;
  ATH_MSG_VERBOSE("m_maxnlep_loose = " << m_maxnlep_loose << " m_minnlep = " << m_minnlep);
  theta_tot.resize(m_maxnlep_loose-m_minnlep);
  ATH_MSG_VERBOSE("theta_tot.size() = " << theta_tot.size());
  ATH_MSG_VERBOSE("m_nfakes_std = " << m_nfakes_std);
  if (m_nfakes_std > 0.) {
    double sinterm = 1.;
    int theta_index = 0;
    for (int ilep = m_minnlep; ilep < m_maxnlep_loose; ilep++ ){ 
      ATH_MSG_VERBOSE("nfakes for nlep = " << ilep << " used to find theta_tot = " << loc_init_pars[ilep-1][0]);
      theta_tot[theta_index] = TMath::ACos(TMath::Sqrt(TMath::Max(loc_init_pars[ilep-1][0],0.)/(m_nfakes_std))/sinterm);
      if (TMath::IsNaN( theta_tot[theta_index] ) ) {
    theta_tot[theta_index] = s_piover4;
      }
      sinterm *= TMath::Sin(theta_tot[theta_index]);
      theta_index++;
    }
  } else {
    int theta_index = 0;
    for (int ilep = m_minnlep; ilep < m_maxnlep_loose; ilep++ ){
      theta_tot[theta_index] = s_piover4;
      theta_index++;
    }
  }
 
  ATH_MSG_VERBOSE("About to set upper limits");
  vector<double> upper_limits;
  upper_limits.resize(npar);
 
  upper_limits[0] =   TMath::Max(5.*m_maxWeight*m_current_fitInfo->totEvents, 0.01);
 
  int real_index = 1;
  for (int ilep = m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    for (unsigned isublep = 0; isublep < m_real_indices[ilep-1].size(); isublep++) {
      upper_limits[real_index] = 5*m_maxWeight*m_current_fitInfo->eventCount[ilep-1]; 
      real_index++;
    }
  }
  
  for (int ipar = real_index; ipar < npar; ipar++) {
    upper_limits[ipar] = s_piover2;
  }
  
  //re-organize from "per-lepton" parameters to global parameters
  vector<double> init_par_values;
  init_par_values.resize(npar);
  ATH_MSG_VERBOSE("Setting parameter 0 to " << TMath::Max(m_nfakes_std,0.5));
  init_par_values[0] =  TMath::Max(m_nfakes_std,0.);
  int init_index = 1;
  int glob_index = 1;
  for (int ilep= m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    for (unsigned isublep = 0; isublep < m_real_indices[ilep-1].size(); isublep++) {     
      ATH_MSG_VERBOSE("Setting parameter " << glob_index << " to " <<  init_pars[init_index+isublep]);
      init_par_values[glob_index] = init_pars[init_index+isublep];
      glob_index++;
    }
    init_index+= pow(2,ilep);
  }
 
  m_theta_tot_start_index = 1;
  for (int ilep = m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    m_theta_tot_start_index += m_real_indices[ilep-1].size();
  }
  vector<int> theta_start_indices;
  theta_start_indices.resize(m_maxnlep_loose);
  theta_start_indices[m_minnlep-1] =  m_theta_tot_start_index+m_maxnlep_loose - m_minnlep;
  for (int i = m_minnlep; i < m_maxnlep_loose; i++) {
    theta_start_indices[i] = theta_start_indices[i-1] +  m_fake_indices[i-1].size() - 1;
  }
 
  for (int ilep= m_minnlep; ilep < m_maxnlep_loose; ilep++) {
    ATH_MSG_VERBOSE("Setting parameter " << m_theta_tot_start_index+ilep-m_minnlep  << " to " << theta_tot[ilep-m_minnlep]);
    init_par_values[m_theta_tot_start_index+ilep-m_minnlep] = theta_tot[ilep-m_minnlep];
  }
 
  ATH_MSG_VERBOSE( "all done!");
 
  int currpar = m_theta_tot_start_index+m_maxnlep_loose-m_minnlep;
  index = 1;
  for (int ilep= m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    for (int ipar = 0; ipar < (int)m_fake_indices[ilep-1].size() - 1; ipar++) {
      ATH_MSG_VERBOSE("Setting parameter " << currpar  << " to " <<  init_pars[index+m_real_indices[ilep-1].size()+ipar]);
      init_par_values[currpar] = init_pars[index+m_real_indices[ilep-1].size()+ipar];
      currpar++;
    }
    index+= 0x1 << ilep;
  }
  int ipar;
  for (ipar = 0; ipar < npar; ipar++) {
    lhoodFit->mnparm(ipar, parameterName[ipar], init_par_values[ipar], step, 0., upper_limits[ipar], ierflg);
  }
 
  ATH_MSG_VERBOSE("About to fix some parameters");
  ATH_MSG_VERBOSE("m_minnlep = " << m_minnlep);
  ATH_MSG_VERBOSE("m_maxnlep_loose = " << m_maxnlep_loose);
  // account for case where there may be no leptons of a given multiplicity 
  // (or no fake leptons allowed by the process string) by
  // fixing the parameters that are relevant to that multiplicity.
  // Also check that at least one lepton multiplicity is valid
 
  int nGoodLeptonMult = 0;
 
  for (int ilep = m_minnlep; ilep <= m_maxnlep_loose; ilep++) {
    if (m_current_fitInfo->eventCount[ilep-1] ==  0  ||
    m_fake_indices[ilep-1].size() == 0) {
      // start with the nreal parameters
      for (unsigned ipar = nreal_start_indices[ilep-1]; ipar < nreal_start_indices[ilep-1] + m_real_indices[ilep-1].size(); ipar++) {
    arglist[0] = ipar;
    arglist[1] = 0.;
    lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
    lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
      }
      //now the theta_tot angle associated with this multiplicity
      arglist[0] = m_theta_tot_start_index + ilep - m_minnlep +1;
      arglist[1] = s_piover2;
      lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
      lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
      
      //now all the angle parameters for this lepton multiplicity
      for (unsigned ipar = theta_start_indices[ilep-1]+1; ipar <  theta_start_indices[ilep-1] + m_fake_indices[ilep-1].size() ; ipar++) {
    arglist[0] = ipar;
    arglist[1] = 0.;
    lhoodFit->mnexcm("SET PAR", arglist, 2, ierflg);
    lhoodFit->mnexcm("FIX PAR", arglist, 1, ierflg);
      }
    } else {
      nGoodLeptonMult++;
    }
    index += (0x1 << ilep) - 2;
  }
 
  if (nGoodLeptonMult == 0) {
    ATH_MSG_VERBOSE("No possible fake contribution for any lepton multiplicity");
    *poserr = 0;
    *negerr = 0;
    return 0;
  }
 
  arglist[0] = 5000;
  arglist[1] = 1.0;
  lhoodFit->mnexcm("MIGRAD", arglist ,2,ierflg);
  ATH_MSG_VERBOSE("ierflg = " << ierflg);
  lhoodFit->mnimpr();
 
  Double_t amin, edm, errdef;
  Int_t nvpar, nparx, icstat;
  lhoodFit->mnstat(amin,edm,errdef,nvpar,nparx,icstat);
  
  lhoodFit->GetParameter(0, nfake_fit, nfake_fitErr);
  
  Double_t gcc;
  
  if (poserr && negerr) { 
    arglist[0] = 500;
    arglist[1] = 1.0;
    lhoodFit->mnexcm("MINOS", arglist ,2,ierflg);
    lhoodFit->mnerrs(0, *poserr, *negerr, nfake_fitErr, gcc);
 
    // re-retrieve fit values, since MINOS might have found a new minimum
    lhoodFit->mnstat(amin,edm,errdef,nvpar,nparx,icstat);    
    lhoodFit->GetParameter(0, nfake_fit, nfake_fitErr);
 
    // check that MINOS succeeded. If not, fix it...
 
    if ( *poserr < 1.e-5) {
      *poserr = fixPosErr(nfake_fit, lhoodFit.get());
    } 
    if (*negerr > -1.e-5 ) {
      *negerr = fixNegErr(nfake_fit, lhoodFit.get());
    }
    //resort to parabolic errors if all else fails
    if (*negerr > -1.e-5) {
      *negerr = -nfake_fitErr;
      // prevent negative error from extending below 0
      if (nfake_fit + *negerr < 0.) {
    *negerr = -nfake_fit;
      }
    }
 
    if (*poserr < 1.e-5) {
      *poserr = nfake_fitErr;
    }
    
  }
  
  return nfake_fit; 
 
}

nfakes_std()

double LhoodMM_tools::nfakes_std

(

double *

error

)

Definition at line 1238 of file LhoodMM_tools.cxx.

                                              {
 
  *error = m_nfakes_std_err;
  return m_nfakes_std;
}

nfakes_std_perEventWeight()

double LhoodMM_tools::nfakes_std_perEventWeight

(

double *

error

)

Definition at line 1244 of file LhoodMM_tools.cxx.

                                                             {
 
  *error = m_nfakes_std_err_perEventWeight;
  return m_nfakes_std_perEventWeight;
}

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

perfectFit()

bool CP::LhoodMM_tools::perfectFit ( )

inline

Definition at line 70 of file LhoodMM_tools.h.

{ return m_perfectFit;}

print()

void asg::AsgTool::print ( ) const

virtualinherited

Print the state of the tool.

Implements asg::IAsgTool.

Reimplemented in AsgHelloTool, HI::HIPileupTool, JetBottomUpSoftDrop, JetConstituentsRetriever, JetDumper, JetFinder, JetFromPseudojet, JetModifiedMassDrop, JetPileupLabelingTool, JetPruner, JetPseudojetRetriever, JetReclusterer, JetReclusteringTool, JetRecTool, JetRecursiveSoftDrop, JetSoftDrop, JetSplitter, JetSubStructureMomentToolsBase, JetToolRunner, JetTrimmer, JetTruthLabelingTool, KtDeltaRTool, and LundVariablesTool.

Definition at line 131 of file AsgTool.cxx.

                             {
 
      ATH_MSG_INFO( "AsgTool " << name() << " @ " << this );
      return;
   }

printUncertaintyDescription()

void BaseFakeBkgTool::printUncertaintyDescription ( const CP::SystematicVariation & systematic ) const

finaloverridevirtualinherited

prints a human-readable description of the source of systematic uncertainty specified as argument

Implements CP::IFakeBkgSystDescriptor.

Definition at line 513 of file BaseFakeBkgTool.cxx.

{
    auto info = getUncertaintyDescription(systematic);
    if(info.length()) ATH_MSG_INFO(info);
}

recommendedSystematics()

CP::SystematicSet BaseFakeBkgTool::recommendedSystematics ( ) const

overridevirtualinherited

the list of all systematics this tool recommends to use

Implements CP::IReentrantSystematicsTool.

Definition at line 460 of file BaseFakeBkgTool.cxx.

{
    return affectingSystematics();
}

register1DHistogram()

StatusCode LhoodMM_tools::register1DHistogram ( TH1 * h1, const float * val )

overridevirtual

associates a 1D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'val' argument points to a variable corresponding to the X axis of the histogram and that needs to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime

Reimplemented from CP::BaseFakeBkgTool.

Definition at line 163 of file LhoodMM_tools.cxx.

                                                                        {
 
  auto sc = BaseFakeBkgTool::register1DHistogram(h1, val);
 
  if(sc != StatusCode::SUCCESS) return sc;
 
  
  auto currentMap = m_fitInfo_1dhisto_map.find(h1);
  if (currentMap ==  m_fitInfo_1dhisto_map.end() ) {
    m_fitInfo_1dhisto_map[h1];
    // size all the vectors appropriately
    int ncells = h1->GetNcells();
    auto *fitinfovec =  &m_fitInfo_1dhisto_map.find(h1)->second;
    fitinfovec->resize(ncells);
    ATH_MSG_VERBOSE("Just resized fitinfovec");
    for (int icell = 0; icell < ncells; icell++) {
      LhoodMMFitInfo* fitInfo =  &(fitinfovec->at(icell));
      fitInfo->reset();
    }
 
    ATH_MSG_INFO("Registered a 1D histogram "<<h1->GetName());
  } else {
    ATH_MSG_ERROR("Error in  LhoodMM_tools::register1DHistogram: histogram has already been registered");
    return StatusCode::FAILURE;
  }
  return StatusCode::SUCCESS;
} 

register2DHistogram()

StatusCode LhoodMM_tools::register2DHistogram ( TH2 * h2, const float * xval, const float * yval )

overridevirtual

associates a 2D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'xval' / 'yval' arguments point to variables corresponding to the X/Y axis of the histogram and that need to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime

Reimplemented from CP::BaseFakeBkgTool.

Definition at line 191 of file LhoodMM_tools.cxx.

                                                                                           {
 
  auto sc = BaseFakeBkgTool::register2DHistogram(h2, xval, yval);
 
  if(sc != StatusCode::SUCCESS) return sc;
    
  auto currentMap = m_fitInfo_2dhisto_map.find(h2);
  if (currentMap ==  m_fitInfo_2dhisto_map.end() ) {
    m_fitInfo_2dhisto_map[h2];
    // size all the vectors appropriately
    int ncells = h2->GetNcells();
    auto *fitinfovec =  &m_fitInfo_2dhisto_map.find(h2)->second;
    fitinfovec->resize(ncells);
    for (int icell = 0; icell < ncells; icell++) {
      LhoodMMFitInfo* fitInfo =  &(fitinfovec->at(icell));
      fitInfo->reset();
    }
    ATH_MSG_INFO("Registered a 2D histogram "<<h2->GetName());
  } else {
    ATH_MSG_ERROR("Error in  LhoodMM_tools::register2DHistogram: histogram has already been registered");
    return StatusCode::FAILURE;
  }
  return StatusCode::SUCCESS;
} 

register3DHistogram()

StatusCode LhoodMM_tools::register3DHistogram ( TH3 * h3, const float * xval, const float * yval, const float * zval )

overridevirtual

associates a 3D histogram to the tool, to obtain a binned estimate of the fake lepton background the 'xval' / 'yval' / 'zval' arguments point to variables corresponding to the X/Y/Z axis of the histogram and that need to be updated before each call to addEvent() undefined behaviour if the pointers are invalidated during the tool's lifetime

Reimplemented from CP::BaseFakeBkgTool.

Definition at line 216 of file LhoodMM_tools.cxx.

                                                                                                              {
 
  auto sc = BaseFakeBkgTool::register3DHistogram(h3, xval, yval, zval);
 
  if(sc != StatusCode::SUCCESS) return sc;
    
  auto currentMap = m_fitInfo_3dhisto_map.find(h3);
  if (currentMap ==  m_fitInfo_3dhisto_map.end() ) {
    m_fitInfo_3dhisto_map[h3];
    // size all the vectors appropriately
    int ncells = h3->GetNcells();
    auto *fitinfovec =  &m_fitInfo_3dhisto_map.find(h3)->second;
    fitinfovec->resize(ncells);
    for (int icell = 0; icell < ncells; icell++) {
      LhoodMMFitInfo* fitInfo =  &(fitinfovec->at(icell));
      fitInfo->reset();
    }
    ATH_MSG_INFO("Registered a 3D histogram "<<h3->GetName());
  } else {
    ATH_MSG_ERROR("Error in  LhoodMM_tools::register3DHistogram: histogram has already been registered");
    return StatusCode::FAILURE;
  }
  return StatusCode::SUCCESS;
} 

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

reset()

void LhoodMM_tools::reset ( )

protectedvirtual

Definition at line 77 of file LhoodMM_tools.cxx.

                          {
 
  m_global_fitInfo.reset();
 
  m_prevSave = false;
 
  m_nfakes_std = 1.;
  m_nfakes_std_err = 1.;
 
  m_maxWeight = 1.;
 
  m_printLevel = -1;
 
  m_theta_tot_start_index = -1;
 
  m_do_std_perEventWeight = false;
 
  m_fixNormalization = false;
 
  m_coeffs.clear();
  m_coeffs.resize(s_nLepMax);
 
  for (int ilep = 0; ilep < s_nLepMax; ilep++) {
    m_coeffs[ilep].clear();
    m_coeffs[ilep].resize((0x1 << (ilep+1)) );
    for (int ientry = 0; ientry < (0x1 << (ilep+1)); ientry++) {
      m_coeffs[ilep][ientry].resize((0x1 << (ilep+1)) );
      for (int jentry = 0; jentry < (0x1 << (ilep+1)); jentry++) {
        m_coeffs[ilep][ientry][jentry] =0.;
      }
    }
  }
 
  m_real_indices.clear();
  m_real_indices.resize(s_nLepMax);
  m_fake_indices.clear();
  m_fake_indices.resize(s_nLepMax);
 
  m_maxnlep_loose = 0;
 
  m_requireSS = false;
  m_requireOS = false;
 
  m_fsvec.clear();
  m_fsvec.resize(s_nLepMax);
 
  m_OSfrac.clear();
  m_OSfrac.resize(s_nLepMax);
 
  for (int ilep = 0; ilep <s_nLepMax; ilep++) {
    m_OSfrac[ilep].resize(ilep);
  }
 
  m_doFakeFactor = false;
 
  m_nrf_mat_vec.clear();
  m_MMmatrix_vec.clear();
  m_nrf_mat_vec.resize(s_nLepMax);
  m_MMmatrix_vec.resize(s_nLepMax);
  m_ntlpred_vec.clear();
  m_ntlpred_vec.resize(s_nLepMax);
  for (int ilep = 0; ilep < s_nLepMax; ilep++) {
    m_nrf_mat_vec[ilep] = std::shared_ptr<TMatrixT<double>>(std::make_shared<TMatrixT<double>>(0x1 << (ilep+1),1) );
    m_MMmatrix_vec[ilep] =  std::shared_ptr<TMatrixT<double>>(std::make_shared<TMatrixT<double>> ((0x1 << (ilep+1)),(0x1 << (ilep+1))));
    m_ntlpred_vec[ilep] = std::shared_ptr<TMatrixT<double>>(std::make_shared< TMatrixT<double>>(0x1 << (ilep+1),1));
  }
 
  m_lastSaveIndex = 0;
 
  m_alreadyMerged = false;
 
}

saveProgress()

StatusCode LhoodMM_tools::saveProgress ( TDirectory * dir )

overridevirtual

Implements CP::IFakeBkgTool.

Definition at line 1674 of file LhoodMM_tools.cxx.

                                                      {
 
  ATH_MSG_VERBOSE("Saving progress");
 
  if (m_prevSave) {
    ATH_MSG_ERROR("Multiple calls to saveProgress are not supported");
    return StatusCode::FAILURE;
  }
  
  m_prevSave = true;
  
  std::unique_ptr<TTree> t(new TTree("LhoodMM_progress", "Stores current info from LhoodMM_toos"));
  
  std::unique_ptr<TTree> t_nlep(new TTree("LhoodMM_progress_nlep", "Stores minimum and maximum lepton multiplicities"));
  
  auto fitInfoBranch = t->Branch("glb_fitInfo", &m_global_fitInfo);
  ATH_MSG_VERBOSE("Branch split level is " << fitInfoBranch->GetSplitLevel() );
  t->Branch("fitInfo_1dhisto_map", &m_fitInfo_1dhisto_map);
  t->Branch("fitInfo_2dhisto_map", &m_fitInfo_2dhisto_map);
  t->Branch("fitInfo_3dhisto_map", &m_fitInfo_3dhisto_map);
 
  t_nlep->Branch("maxnlep", &m_maxnlep_loose);  
 
  ATH_MSG_VERBOSE("Filling tree...");
  t->Fill();
  t_nlep->Fill();
  dir->cd();
  t->Write();
  t_nlep->Write();
 
  return StatusCode::SUCCESS;
}

set_do_std_perEventWeight()

void CP::LhoodMM_tools::set_do_std_perEventWeight ( bool val )

inline

Definition at line 64 of file LhoodMM_tools.h.

{m_do_std_perEventWeight = val;}

setFitType()

StatusCode LhoodMM_tools::setFitType

(

const std::string &

ft

)

Definition at line 150 of file LhoodMM_tools.cxx.

                                                        {
  if (ft == "FF") {
    m_doFakeFactor = true;
    return StatusCode::SUCCESS;
  } else if (ft == "MM") {
    m_doFakeFactor = false;
    return StatusCode::SUCCESS;
  } else {
    ATH_MSG_ERROR("Error in  LhoodMM_tools::setFitType: please specify \"MM\" for matrix method or \"FF\" for fake factor method");
    return StatusCode::FAILURE;
  } 
}

setPrintLevel()

void CP::LhoodMM_tools::setPrintLevel ( Int_t printLevel )

inline

Definition at line 62 of file LhoodMM_tools.h.

{ m_printLevel = printLevel;}

setup()

StatusCode LhoodMM_tools::setup ( )

private

Definition at line 530 of file LhoodMM_tools.cxx.

                                {
 
  m_current_lhoodMM_tool = this;
 
  for (int ilep = 0; ilep < m_maxnlep_loose; ilep++) {
    for (int jlep = 0; jlep < ilep; jlep++) {
      if (m_current_fitInfo->OSfrac_denom[ilep][jlep] > 0) {
    m_OSfrac[ilep][jlep]  = m_current_fitInfo->OSfrac_num[ilep][jlep]/m_current_fitInfo->OSfrac_denom[ilep][jlep];
      } else {
    m_OSfrac[ilep][jlep]  = 1.;
      }
    }
  }
 
  return StatusCode::SUCCESS;
}

sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_accFakeEff

SG::ConstAccessor<float> CP::BaseFakeBkgTool::m_accFakeEff

protectedinherited

only used when m_useDB is false

Definition at line 177 of file BaseFakeBkgTool.h.

m_accRealEff

SG::ConstAccessor<float> CP::BaseFakeBkgTool::m_accRealEff

protectedinherited

Definition at line 175 of file BaseFakeBkgTool.h.

m_alreadyMerged

bool CP::LhoodMM_tools::m_alreadyMerged {}

private

Definition at line 106 of file LhoodMM_tools.h.

{};

m_cachedFinalStates

std::set<FakeBkgTools::FinalState> CP::BaseFakeBkgTool::m_cachedFinalStates

protectedinherited

Definition at line 99 of file BaseFakeBkgTool.h.

m_coeffs

std::vector< std::vector < std::vector < double > > > CP::LhoodMM_tools::m_coeffs

private

Definition at line 112 of file LhoodMM_tools.h.

m_convertWhenMissing

bool CP::BaseFakeBkgTool::m_convertWhenMissing = false

protectedinherited

Definition at line 80 of file BaseFakeBkgTool.h.

m_curr_nlep

int CP::LhoodMM_tools::m_curr_nlep {}

private

Definition at line 92 of file LhoodMM_tools.h.

{};

m_current_fitInfo

const LhoodMMFitInfo* CP::LhoodMM_tools::m_current_fitInfo {}

private

Definition at line 85 of file LhoodMM_tools.h.

{};

m_current_lhoodMM_tool

LhoodMM_tools * LhoodMM_tools::m_current_lhoodMM_tool = nullptr

staticprivate

Definition at line 78 of file LhoodMM_tools.h.

m_database

std::unique_ptr<FakeBkgTools::Database> CP::BaseFakeBkgTool::m_database

protectedinherited

Definition at line 91 of file BaseFakeBkgTool.h.

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_dilep_SSfrac_denom

double CP::LhoodMM_tools::m_dilep_SSfrac_denom {}

private

Definition at line 118 of file LhoodMM_tools.h.

{}, m_dilep_SSfrac_denom{};

m_dilep_SSfrac_num

double CP::LhoodMM_tools::m_dilep_SSfrac_num {}

private

Definition at line 118 of file LhoodMM_tools.h.

{}, m_dilep_SSfrac_denom{};

m_do_std_perEventWeight

bool CP::LhoodMM_tools::m_do_std_perEventWeight {}

private

Definition at line 125 of file LhoodMM_tools.h.

{};

m_doFakeFactor

bool CP::LhoodMM_tools::m_doFakeFactor {}

private

Definition at line 100 of file LhoodMM_tools.h.

{};

m_energyUnit

std::string CP::BaseFakeBkgTool::m_energyUnit

protectedinherited

property EnergyUnit user can choose between MeV or GeV to indicate the unit of the pT parametrization of efficiencies in the input files

Definition at line 122 of file BaseFakeBkgTool.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_externalWeight

float CP::BaseFakeBkgTool::m_externalWeight

protectedinherited

Definition at line 95 of file BaseFakeBkgTool.h.

m_fake_indices

std::vector<std::vector<int> > CP::LhoodMM_tools::m_fake_indices

private

Definition at line 95 of file LhoodMM_tools.h.

m_fitInfo_1dhisto_map

std::map<TH1*, std::vector< LhoodMMFitInfo > > CP::LhoodMM_tools::m_fitInfo_1dhisto_map

private

Definition at line 114 of file LhoodMM_tools.h.

m_fitInfo_2dhisto_map

std::map<TH2*, std::vector< LhoodMMFitInfo > > CP::LhoodMM_tools::m_fitInfo_2dhisto_map

private

Definition at line 115 of file LhoodMM_tools.h.

m_fitInfo_3dhisto_map

std::map<TH3*, std::vector< LhoodMMFitInfo > > CP::LhoodMM_tools::m_fitInfo_3dhisto_map

private

Definition at line 116 of file LhoodMM_tools.h.

m_fitStatus

Int_t CP::LhoodMM_tools::m_fitStatus {}

private

Definition at line 127 of file LhoodMM_tools.h.

{};

m_fixNormalization

bool CP::LhoodMM_tools::m_fixNormalization {}

private

Definition at line 102 of file LhoodMM_tools.h.

{};

m_fsvec

std::vector<std::unique_ptr<FakeBkgTools::FinalState> > CP::LhoodMM_tools::m_fsvec

private

Definition at line 88 of file LhoodMM_tools.h.

m_global_fitInfo

LhoodMMFitInfo CP::LhoodMM_tools::m_global_fitInfo {}

private

Definition at line 81 of file LhoodMM_tools.h.

{};

m_hasher

std::hash<std::string> CP::BaseFakeBkgTool::m_hasher

protectedinherited

comes from Event passed to addEvent()

Definition at line 97 of file BaseFakeBkgTool.h.

m_initialized

bool CP::BaseFakeBkgTool::m_initialized = false

protectedinherited

Definition at line 78 of file BaseFakeBkgTool.h.

m_inputFiles

std::vector<std::string> CP::BaseFakeBkgTool::m_inputFiles

protectedinherited

property InputFiles

Definition at line 127 of file BaseFakeBkgTool.h.

m_lastSaveIndex

unsigned CP::LhoodMM_tools::m_lastSaveIndex {}

private

Definition at line 135 of file LhoodMM_tools.h.

{};

m_lockedSystematicVariations

bool CP::BaseFakeBkgTool::m_lockedSystematicVariations = false

protectedinherited

when m_unlimitedSystematicVariations=false, keeps track of prior calls to applySystematicVariation() / addEvent()

Definition at line 173 of file BaseFakeBkgTool.h.

m_maxnlep

int CP::LhoodMM_tools::m_maxnlep {}

private

Definition at line 93 of file LhoodMM_tools.h.

{}, m_maxnlep{}, m_maxnlep_loose{};

m_maxnlep_loose

int CP::LhoodMM_tools::m_maxnlep_loose {}

private

Definition at line 93 of file LhoodMM_tools.h.

{}, m_maxnlep{}, m_maxnlep_loose{};

m_maxWeight

float CP::LhoodMM_tools::m_maxWeight {}

private

Definition at line 104 of file LhoodMM_tools.h.

{};

m_minnlep

int CP::LhoodMM_tools::m_minnlep {}

private

Definition at line 93 of file LhoodMM_tools.h.

{}, m_maxnlep{}, m_maxnlep_loose{};

m_MMmatrix_vec

std::vector<std::shared_ptr<TMatrixT<double> > > CP::LhoodMM_tools::m_MMmatrix_vec

private

Definition at line 132 of file LhoodMM_tools.h.

m_needEventInfo

bool CP::BaseFakeBkgTool::m_needEventInfo = true

protectedinherited

Definition at line 79 of file BaseFakeBkgTool.h.

m_needToResize

bool CP::LhoodMM_tools::m_needToResize {}

private

Definition at line 98 of file LhoodMM_tools.h.

{};

m_nfakes_std

double CP::LhoodMM_tools::m_nfakes_std {}

private

Definition at line 121 of file LhoodMM_tools.h.

{}, m_nfakes_std_err{};

m_nfakes_std_err

double CP::LhoodMM_tools::m_nfakes_std_err {}

private

Definition at line 121 of file LhoodMM_tools.h.

{}, m_nfakes_std_err{};

m_nfakes_std_err_perEventWeight

double CP::LhoodMM_tools::m_nfakes_std_err_perEventWeight {}

private

Definition at line 123 of file LhoodMM_tools.h.

{}, m_nfakes_std_err_perEventWeight{};

m_nfakes_std_perEventWeight

double CP::LhoodMM_tools::m_nfakes_std_perEventWeight {}

private

Definition at line 123 of file LhoodMM_tools.h.

{}, m_nfakes_std_err_perEventWeight{};

m_nrf_mat_vec

std::vector<std::shared_ptr<TMatrixT<double> > > CP::LhoodMM_tools::m_nrf_mat_vec

private

Definition at line 131 of file LhoodMM_tools.h.

m_ntlpred_vec

std::vector<std::shared_ptr<TMatrixT<double> > > CP::LhoodMM_tools::m_ntlpred_vec

private

Definition at line 133 of file LhoodMM_tools.h.

m_OSfrac

std::vector< std::vector < double > > CP::LhoodMM_tools::m_OSfrac

private

Definition at line 119 of file LhoodMM_tools.h.

m_particles

std::vector<FakeBkgTools::ParticleData> CP::BaseFakeBkgTool::m_particles

protectedinherited

Definition at line 85 of file BaseFakeBkgTool.h.

m_perfectFit

bool CP::LhoodMM_tools::m_perfectFit {}

private

Definition at line 83 of file LhoodMM_tools.h.

{};

m_prevSave

bool CP::LhoodMM_tools::m_prevSave {}

private

Definition at line 82 of file LhoodMM_tools.h.

{};

m_printLevel

Int_t CP::LhoodMM_tools::m_printLevel {}

private

Definition at line 129 of file LhoodMM_tools.h.

{};

m_process

std::string CP::BaseFakeBkgTool::m_process = defaultProcess()

protectedinherited

'process' settings used to compute the total yield / fill histograms

Definition at line 118 of file BaseFakeBkgTool.h.

m_progressFileDirectory

std::string CP::BaseFakeBkgTool::m_progressFileDirectory

protectedinherited

property ProgressFileDirectory

Definition at line 139 of file BaseFakeBkgTool.h.

m_progressFileName

std::string CP::BaseFakeBkgTool::m_progressFileName

protectedinherited

property ProgressFileName

Definition at line 136 of file BaseFakeBkgTool.h.

m_real_indices

std::vector<std::vector<int> > CP::LhoodMM_tools::m_real_indices

private

Definition at line 95 of file LhoodMM_tools.h.

m_requireOS

bool CP::LhoodMM_tools::m_requireOS {}

private

Definition at line 96 of file LhoodMM_tools.h.

{}, m_requireOS{};

m_requireSS

bool CP::LhoodMM_tools::m_requireSS {}

private

Definition at line 96 of file LhoodMM_tools.h.

{}, m_requireOS{};

m_selectedUncertainties

UncertaintyList* CP::BaseFakeBkgTool::m_selectedUncertainties = nullptr

protectedinherited

Pointer to a value of the 'm_systSetDict' map it must be invalidated each time the map is updated in principle only applySystematicVariation() needs to do that.

Definition at line 161 of file BaseFakeBkgTool.h.

m_selection

std::string CP::BaseFakeBkgTool::m_selection = defaultSelection()

protectedinherited

'selection' settings used to compute the total yield / fill histograms

Definition at line 115 of file BaseFakeBkgTool.h.

m_systSetDict

std::unordered_map<CP::SystematicSet, UncertaintyList> CP::BaseFakeBkgTool::m_systSetDict

protectedinherited

List of uncertainties in internal format, associated with a particular SystematicSet the m_selectedUncertainties pointer must be invalidated each time this map is updated in principle only applySystematicVariation() needs to do that.

Definition at line 166 of file BaseFakeBkgTool.h.

m_theta_tot_start_index

int CP::LhoodMM_tools::m_theta_tot_start_index {}

private

Definition at line 94 of file LhoodMM_tools.h.

{};

m_tightAccessor

CP::ISelectionReadAccessor* CP::BaseFakeBkgTool::m_tightAccessor = nullptr

protectedinherited

this can't be a unique_ptr as this can cause issues with the dictionary in some particular circumstances

Definition at line 133 of file BaseFakeBkgTool.h.

m_tightDecoNameAndType

std::string CP::BaseFakeBkgTool::m_tightDecoNameAndType

protectedinherited

property TightDecoration

Definition at line 130 of file BaseFakeBkgTool.h.

m_unlimitedSystematicVariations

bool CP::BaseFakeBkgTool::m_unlimitedSystematicVariations = true

protectedinherited

used to prevent multiple calls to applySystematicVariation() when unsupported set to true in a particular tool's constructor to disable the possibility of calling applySystematicVariation() more than once / after the first call to addEvent()

Definition at line 170 of file BaseFakeBkgTool.h.

m_useDB

bool CP::BaseFakeBkgTool::m_useDB = true

protectedinherited

Definition at line 124 of file BaseFakeBkgTool.h.

m_values_1dhisto_map

std::map<TH1*, const float*> CP::BaseFakeBkgTool::m_values_1dhisto_map

protectedinherited

Definition at line 108 of file BaseFakeBkgTool.h.

m_values_2dhisto_map

std::map<TH2*, std::pair<const float*, const float*> > CP::BaseFakeBkgTool::m_values_2dhisto_map

protectedinherited

Definition at line 109 of file BaseFakeBkgTool.h.

m_values_3dhisto_map

std::map<TH3*, std::tuple<const float*, const float*, const float*> > CP::BaseFakeBkgTool::m_values_3dhisto_map

protectedinherited

Definition at line 110 of file BaseFakeBkgTool.h.

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

s_maxRank

int CP::LhoodMM_tools::s_maxRank = 64

staticconstexprprivate

Definition at line 109 of file LhoodMM_tools.h.

s_mutex

std::mutex LhoodMM_tools::s_mutex

staticprivate

Definition at line 79 of file LhoodMM_tools.h.

s_nLepMax

int CP::LhoodMM_tools::s_nLepMax = 6

staticconstexprprivate

Definition at line 108 of file LhoodMM_tools.h.

s_piover2

const double CP::LhoodMM_tools::s_piover2 = 1.57079632679489661923

inlinestaticprivate

Definition at line 138 of file LhoodMM_tools.h.

s_piover4

const double CP::LhoodMM_tools::s_piover4 = 0.785398163397448309616

inlinestaticprivate

Definition at line 139 of file LhoodMM_tools.h.

---

The documentation for this class was generated from the following files:

• LhoodMM_tools.h
• LhoodMM_tools.cxx