QGLikelihoodDBWriter Class Reference

Inheritance diagram for QGLikelihoodDBWriter:

Public Member Functions
void	analyze (const edm::Event &, const edm::EventSetup &) override
void	beginJob () override
void	endJob () override
	QGLikelihoodDBWriter (const edm::ParameterSet &)
	~QGLikelihoodDBWriter () override
Public Member Functions inherited from edm::EDAnalyzer
void	callWhenNewProductsRegistered (std::function< void(BranchDescription const &)> const &func)
	EDAnalyzer ()
SerialTaskQueue *	globalLuminosityBlocksQueue ()
SerialTaskQueue *	globalRunsQueue ()
ModuleDescription const &	moduleDescription () const
std::string	workerType () const
	~EDAnalyzer () override
Public Member Functions inherited from edm::EDConsumerBase
std::vector< ConsumesInfo >	consumesInfo () const
void	convertCurrentProcessAlias (std::string const &processName)
	Convert "@currentProcess" in InputTag process names to the actual current process name. More...
	EDConsumerBase ()
	EDConsumerBase (EDConsumerBase const &)=delete
	EDConsumerBase (EDConsumerBase &&)=default
ProductResolverIndexAndSkipBit	indexFrom (EDGetToken, BranchType, TypeID const &) const
void	itemsMayGet (BranchType, std::vector< ProductResolverIndexAndSkipBit > &) const
void	itemsToGet (BranchType, std::vector< ProductResolverIndexAndSkipBit > &) const
std::vector< ProductResolverIndexAndSkipBit > const &	itemsToGetFrom (BranchType iType) const
void	labelsForToken (EDGetToken iToken, Labels &oLabels) const
void	modulesWhoseProductsAreConsumed (std::vector< ModuleDescription const * > &modules, ProductRegistry const &preg, std::map< std::string, ModuleDescription const * > const &labelsToDesc, std::string const &processName) const
EDConsumerBase const &	operator= (EDConsumerBase const &)=delete
EDConsumerBase &	operator= (EDConsumerBase &&)=default
bool	registeredToConsume (ProductResolverIndex, bool, BranchType) const
bool	registeredToConsumeMany (TypeID const &, BranchType) const
ProductResolverIndexAndSkipBit	uncheckedIndexFrom (EDGetToken) const
void	updateLookup (BranchType iBranchType, ProductResolverIndexHelper const &, bool iPrefetchMayGet)
virtual	~EDConsumerBase () noexcept(false)

Private Member Functions
bool	getVectorFromFile (TFile *, std::vector< float > &, const TString &)
QGLikelihoodObject::Histogram	transformToHistogramObject (TH1 *)
void	tryToMerge (std::map< std::vector< int >, QGLikelihoodCategory > &, std::map< std::vector< int >, TH1 * > &, std::vector< int > &, int)

Private Attributes
std::string	inputRootFile
std::string	payloadTag

Additional Inherited Members
Public Types inherited from edm::EDAnalyzer
typedef EDAnalyzer	ModuleType
Public Types inherited from edm::EDConsumerBase
typedef ProductLabels	Labels
Static Public Member Functions inherited from edm::EDAnalyzer
static const std::string &	baseType ()
static void	fillDescriptions (ConfigurationDescriptions &descriptions)
static void	prevalidate (ConfigurationDescriptions &)
static bool	wantsGlobalLuminosityBlocks ()
static bool	wantsGlobalRuns ()
static bool	wantsStreamLuminosityBlocks ()
static bool	wantsStreamRuns ()
Protected Member Functions inherited from edm::EDConsumerBase
template<typename ProductType , BranchType B = InEvent>
EDGetTokenT< ProductType >	consumes (edm::InputTag const &tag)
EDGetToken	consumes (const TypeToGet &id, edm::InputTag const &tag)
template<BranchType B>
EDGetToken	consumes (TypeToGet const &id, edm::InputTag const &tag)
ConsumesCollector	consumesCollector ()
	Use a ConsumesCollector to gather consumes information from helper functions. More...
template<typename ProductType , BranchType B = InEvent>
void	consumesMany ()
void	consumesMany (const TypeToGet &id)
template<BranchType B>
void	consumesMany (const TypeToGet &id)
template<typename ProductType , BranchType B = InEvent>
EDGetTokenT< ProductType >	mayConsume (edm::InputTag const &tag)
EDGetToken	mayConsume (const TypeToGet &id, edm::InputTag const &tag)
template<BranchType B>
EDGetToken	mayConsume (const TypeToGet &id, edm::InputTag const &tag)

Detailed Description

Definition at line 24 of file QGLikelihoodDBWriter.cc.

Constructor & Destructor Documentation

QGLikelihoodDBWriter::QGLikelihoodDBWriter

(

const edm::ParameterSet &

pSet

)

Definition at line 41 of file QGLikelihoodDBWriter.cc.

References edm::ParameterSet::getParameter(), inputRootFile, payloadTag, and AlCaHLTBitMon_QueryRunRegistry::string.

                                                                     {
  inputRootFile    = pSet.getParameter<std::string>("src");
  payloadTag       = pSet.getParameter<std::string>("payload");
}

QGLikelihoodDBWriter::~QGLikelihoodDBWriter ( )

inlineoverride

Definition at line 30 of file QGLikelihoodDBWriter.cc.

References getVectorFromFile(), genParticles_cff::map, transformToHistogramObject(), and tryToMerge().

{}

Member Function Documentation

void QGLikelihoodDBWriter::analyze ( const edm::Event &  , const edm::EventSetup &    )

inlineoverride

Definition at line 28 of file QGLikelihoodDBWriter.cc.

{}

void QGLikelihoodDBWriter::beginJob ( void  )

overridevirtual

Reimplemented from edm::EDAnalyzer.

Definition at line 89 of file QGLikelihoodDBWriter.cc.

References cond::service::PoolDBOutputService::appendSinceTime(), cond::service::PoolDBOutputService::beginOfTime(), myMessageLogger_cff::categories, QGLikelihoodObject::Entry::category, taus_updatedMVAIds_cff::category, cond::service::PoolDBOutputService::createNewIOV(), QGLikelihoodObject::data, DEFINE_FWK_MODULE, cond::service::PoolDBOutputService::endOfTime(), mps_splice::entry, QGLikelihoodCategory::EtaMax, QGLikelihoodCategory::EtaMin, f, getVectorFromFile(), QGLikelihoodObject::Entry::histogram, mps_fire::i, inputRootFile, createfilelist::int, edm::Service< T >::isAvailable(), cond::service::PoolDBOutputService::isNewTagRequest(), gen::k, crabWrapper::key, QGLikelihoodObject::Entry::mean, jets_cff::payload, payloadTag, QGLikelihoodCategory::PtMax, QGLikelihoodCategory::PtMin, QGLikelihoodCategory::QGIndex, QGLikelihoodObject::qgValidRange, QGLikelihoodCategory::RhoMax, QGLikelihoodCategory::RhoMin, alignCSCRings::s, findQualityFiles::size, transformToHistogramObject(), tryToMerge(), and QGLikelihoodCategory::VarIndex.

                                   {
  QGLikelihoodObject *payload = new QGLikelihoodObject();
  payload->data.clear();

  // Get the ROOT file
  TFile *f = TFile::Open(edm::FileInPath(inputRootFile.c_str()).fullPath().c_str());

  // The ROOT file contains the binning for each variable, needed to set up the binning grid
  std::map<TString, std::vector<float>> gridOfBins;
  for(TString binVariable : {"eta", "pt", "rho"}){
    if(!getVectorFromFile(f, gridOfBins[binVariable], binVariable + "Bins")){
      edm::LogError("NoBins") << "Missing bin information for " << binVariable << " in input file" << std::endl;
      return;
    }
  }

  // Get pdf's from file and associate them to a QGLikelihoodCategory
  // Some pdf's in the ROOT-file are copies from each other, with the same title: those are merged bins in pt and rho
  // Here we do not store the copies, but try to extend the range of the neighbouring category (will result in less comparisons during application phase)
  std::map<std::vector<int>, TH1*> pdfs;
  std::map<std::vector<int>, QGLikelihoodCategory> categories;
  for(TString type : {"gluon","quark"}){
    int qgIndex = (type == "gluon");                                    // Keep numbering same as in RecoJets/JetAlgorithms/src/QGLikelihoodCalculator.cc
    for(TString likelihoodVar : {"mult","ptD","axis2"}){
      int varIndex = (likelihoodVar == "mult" ? 0 : (likelihoodVar == "ptD" ? 1 : 2));          // Keep order same as in RecoJets/JetProducers/plugins/QGTagger.cc
      for(int i = 0; i < (int)gridOfBins["eta"].size() - 1; ++i){
        for(int j = 0; j < (int)gridOfBins["pt"].size() - 1; ++j){
          for(int k = 0; k < (int)gridOfBins["rho"].size() - 1; ++k){

            QGLikelihoodCategory category;
            category.EtaMin   = gridOfBins["eta"][i];
            category.EtaMax   = gridOfBins["eta"][i+1];
            category.PtMin    = gridOfBins["pt"][j];
            category.PtMax    = gridOfBins["pt"][j+1];
            category.RhoMin   = gridOfBins["rho"][k];
            category.RhoMax   = gridOfBins["rho"][k+1];
            category.QGIndex  = qgIndex;
            category.VarIndex = varIndex;

            TString key = TString::Format(likelihoodVar + "/" + likelihoodVar + "_" + type + "_eta%d_pt%d_rho%d", i, j, k);
            TH1* pdf = (TH1*) f->Get(key);
            if(!pdf){
              edm::LogError("NoPDF") << "Could not found pdf with key  " << key << " in input file" << std::endl;
              return;
            }

            std::vector<int> binNumbers = {qgIndex, varIndex, i,j,k};
            pdfs[binNumbers]       = pdf; 
            categories[binNumbers] = category;

            tryToMerge(categories, pdfs, binNumbers, 4);
          }
          for(int k = 0; k < (int)gridOfBins["rho"].size() - 1; ++k){
            std::vector<int> binNumbers = {qgIndex, varIndex, i,j,k};
            tryToMerge(categories, pdfs, binNumbers, 3);
          }
        }
        for(int j = 0; j < (int)gridOfBins["pt"].size() - 1; ++j){
          for(int k = 0; k < (int)gridOfBins["rho"].size() - 1; ++k){
            std::vector<int> binNumbers = {qgIndex, varIndex, i,j,k};
            tryToMerge(categories, pdfs, binNumbers, 2);
          }
        }
      }
    }
  }


  // Write all categories with their histograms to file
  int i = 0;
  for(auto category : categories){
    QGLikelihoodObject::Entry entry;
    entry.category  = category.second;
    entry.histogram = transformToHistogramObject(pdfs[category.first]);
    entry.mean      = 0; // not used by the algorithm, is an old data member used in the past, but DB objects are not allowed to change
    payload->data.push_back(entry);
    
    char buff[1000];
    sprintf(buff, "%6d) var=%1d\t\tqg=%1d\t\teta={%5.2f,%5.2f}\t\tpt={%8.2f,%8.2f}\t\trho={%6.2f,%8.2f}", i++,
                        category.second.VarIndex, category.second.QGIndex, category.second.EtaMin, category.second.EtaMax, 
                        category.second.PtMin,    category.second.PtMax,   category.second.RhoMin, category.second.RhoMax);
    edm::LogVerbatim("HistName") << buff << std::endl;
  }

  // Define the valid range, if no category is found within these bounds a warning will be thrown
  payload->qgValidRange.EtaMin   = gridOfBins["eta"].front();
  payload->qgValidRange.EtaMax   = gridOfBins["eta"].back();
  payload->qgValidRange.PtMin    = gridOfBins["pt"].front();
  payload->qgValidRange.PtMax    = gridOfBins["pt"].back();
  payload->qgValidRange.RhoMin   = gridOfBins["rho"].front();
  payload->qgValidRange.RhoMax   = gridOfBins["rho"].back();
  payload->qgValidRange.QGIndex  = -1;
  payload->qgValidRange.VarIndex = -1;

  // Now write it into the DB
  edm::LogInfo("UserOutput") << "Opening PoolDBOutputService" << std::endl;

  edm::Service<cond::service::PoolDBOutputService> s;
  if(s.isAvailable()){ 
    edm::LogInfo("UserOutput") <<  "Setting up payload with " << payload->data.size() <<  " entries and tag " << payloadTag << std::endl;
    if (s->isNewTagRequest(payloadTag)) s->createNewIOV<QGLikelihoodObject>(payload, s->beginOfTime(), s->endOfTime(), payloadTag);
    else s->appendSinceTime<QGLikelihoodObject>(payload, 111, payloadTag);
  }
  edm::LogInfo("UserOutput") <<  "Wrote in CondDB QGLikelihood payload label: " << payloadTag << std::endl;
}

void QGLikelihoodDBWriter::endJob ( void  )

inlineoverridevirtual

Reimplemented from edm::EDAnalyzer.

Definition at line 29 of file QGLikelihoodDBWriter.cc.

{}

bool QGLikelihoodDBWriter::getVectorFromFile ( TFile *  f, std::vector< float > &  vector, const TString &  name  )

private

Definition at line 48 of file QGLikelihoodDBWriter.cc.

References mps_fire::i.

Referenced by beginJob(), and ~QGLikelihoodDBWriter().

                                                                                                   {
  TVectorT<float> *tVector = nullptr;
  f->GetObject(name, tVector);
  if(!tVector) return false;
  for(int i = 0; i < tVector->GetNoElements(); ++i) vector.push_back((*tVector)[i]);
  return true;
}

QGLikelihoodObject::Histogram QGLikelihoodDBWriter::transformToHistogramObject ( TH1 *  th1 )

private

Definition at line 58 of file QGLikelihoodDBWriter.cc.

References PhysicsTools::Calibration::Histogram< Value_t, Axis_t >::setBinContent().

Referenced by beginJob(), and ~QGLikelihoodDBWriter().

                                                                                    {
  QGLikelihoodObject::Histogram histogram(th1->GetNbinsX(), th1->GetXaxis()->GetBinLowEdge(1), th1->GetXaxis()->GetBinUpEdge(th1->GetNbinsX()));
  for(int ibin = 0; ibin <= th1->GetNbinsX() + 1; ++ibin) histogram.setBinContent(ibin, th1->GetBinContent(ibin));
  return histogram;
}

void QGLikelihoodDBWriter::tryToMerge ( std::map< std::vector< int >, QGLikelihoodCategory > &  categories, std::map< std::vector< int >, TH1 * > &  pdfs, std::vector< int > &  binNumbers, int  index  )

private

Definition at line 66 of file QGLikelihoodDBWriter.cc.

References myMessageLogger_cff::categories, Gflash::EtaMax, Gflash::EtaMin, HLT_HIPhoton15_DQM_cfi::PtMax, HIPixelMedianVertex_cfi::PtMin, and hltL2MuonIsolationsCR_cfi::RhoMax.

Referenced by beginJob(), and ~QGLikelihoodDBWriter().

                                                                                                                                                                        {
  if(!pdfs[binNumbers]) return;
  std::vector<int> neighbour = binNumbers;
  do {
    if(--(neighbour[index]) < 0) return;
  } while (!pdfs[neighbour]);
  if(TString(pdfs[binNumbers]->GetTitle()) != TString(pdfs[neighbour]->GetTitle())) return;
  if(index != 4 && categories[neighbour].RhoMax != categories[binNumbers].RhoMax)   return;
  if(index != 4 && categories[neighbour].RhoMin != categories[binNumbers].RhoMin)   return;
  if(index != 3 && categories[neighbour].PtMax  != categories[binNumbers].PtMax)    return;
  if(index != 3 && categories[neighbour].PtMin  != categories[binNumbers].PtMin)    return;
  if(index != 2 && categories[neighbour].EtaMax != categories[binNumbers].EtaMax)   return;
  if(index != 2 && categories[neighbour].EtaMin != categories[binNumbers].EtaMin)   return;

  if(index == 4) categories[neighbour].RhoMax = categories[binNumbers].RhoMax;
  if(index == 3) categories[neighbour].PtMax  = categories[binNumbers].PtMax;
  if(index == 2) categories[neighbour].EtaMax = categories[binNumbers].EtaMax;
  pdfs.erase(binNumbers);
  categories.erase(binNumbers);
}

Member Data Documentation

std::string QGLikelihoodDBWriter::inputRootFile

private

Definition at line 36 of file QGLikelihoodDBWriter.cc.

Referenced by beginJob(), and QGLikelihoodDBWriter().

std::string QGLikelihoodDBWriter::payloadTag

private

Definition at line 36 of file QGLikelihoodDBWriter.cc.

Referenced by beginJob(), and QGLikelihoodDBWriter().