source: git/modules/BTaggingCMS.h@ 9040259

/*
 *  Delphes: a framework for fast simulation of a generic collider experiment
 *  Copyright (C) 2012-2014  Universite catholique de Louvain (UCL), Belgium
 *
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef BTaggingCMS_h
#define BTaggingCMS_h

/** \class BTaggingCMS
 *
 *  Applies b-tagging efficiency (miss identification rate) formulas
 *  and sets b-tagging flags
 *
 *  \author P. Demin - UCL, Louvain-la-Neuve
 *
 */

#include "classes/DelphesModule.h"
#include "classes/DelphesClasses.h"

#include <map>

class TObjArray;
class DelphesFormula;

class ExRootFilter;

class BTaggingCMS: public DelphesModule
{

public:

  BTaggingCMS();
  ~BTaggingCMS();

  void Init();
  void Process();
  void Finish();

private:

#if !defined(__CINT__) && !defined(__CLING__)
  std::map< Int_t, DelphesFormula * > fEfficiencyMapLoose; //!
  std::map< Int_t, DelphesFormula * > fEfficiencyMapMedium; //!
  std::map< Int_t, DelphesFormula * > fEfficiencyMapTight; //!
#endif

  TIterator *fItJetInputArray; //!

  const TObjArray *fJetInputArray; //!

  ClassDef(BTaggingCMS, 1)
};

#endif