TOPBunchFinderModule.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
#pragma once
 
#include <framework/core/Module.h>
#include <map>
#include <framework/datastore/StoreArray.h>
#include <framework/datastore/StoreObjPtr.h>
#include <top/dataobjects/TOPDigit.h>
#include <top/dataobjects/TOPRawDigit.h>
#include <mdst/dataobjects/Track.h>
#include <top/dataobjects/TOPRecBunch.h>
#include <top/dataobjects/TOPTimeZero.h>
#include <framework/dataobjects/MCInitialParticles.h>
#include <framework/dataobjects/EventT0.h>
#include <framework/database/DBObjPtr.h>
#include <top/dbobjects/TOPCalCommonT0.h>
#include <top/dbobjects/TOPFrontEndSetting.h>
#include <top/dbobjects/TOPCalEventT0Offset.h>
#include <framework/dbobjects/BunchStructure.h>
#include <top/dbobjects/TOPCalFillPatternOffset.h>
 
#include <top/reconstruction_cpp/PDFConstructor.h>
#include <top/utilities/Chi2MinimumFinder1D.h>
#include <framework/gearbox/Const.h>
 
 
namespace Belle2 {
  class TOPBunchFinderModule : public Module {
 
  public:
 
    TOPBunchFinderModule();
 
    virtual void initialize() override;
 
    virtual void beginRun() override;
 
    virtual void event() override;
 
    virtual void terminate() override;
 
  private:
 
    struct TimeSeed {
      double t0 = 0; 
      double sigma = 0; 
      Const::EDetector detector = Const::TOP; 
    };
 
    TimeSeed getTimeSeed();
 
    bool isBucketFilled(int bunchNo);
 
    Const::ChargedStable getMostProbable(const Track& track);
 
    int setFinder(TOP::Chi2MinimumFinder1D& finder, const TOP::PDFConstructor& reco, double timeMin, double timeMax);
 
    // steering parameters
    int m_numBins;      
    double m_timeRangeFine; 
    double m_timeRangeCoarse; 
    bool m_autoRange; 
    double m_sigmaSmear;  
    double m_minSignal;   
    double m_minSBRatio;  
    double m_minDERatio;  
    double m_maxDERatio;  
    double m_minPt; 
    double m_maxPt; 
    double m_maxD0; 
    double m_maxZ0; 
    int m_minNHitsCDC; 
    bool m_useMCTruth;    
    bool m_saveHistograms; 
    double m_tau; 
    bool m_correctDigits; 
    bool m_subtractRunningOffset; 
    int m_bunchesPerSSTclk; 
    bool m_usePIDLikelihoods; 
    unsigned m_nTrackLimit; 
    bool m_useTimeSeed; 
    bool m_useFillPattern; 
    // internal variables shared between events
    double m_bunchTimeSep = 0; 
    std::map<int, double> m_priors; 
    double m_runningOffset = 0; 
    double m_runningError = 0; 
    bool m_HLTmode = false; 
    unsigned m_processed = 0; 
    unsigned m_success = 0; 
    int m_nodEdxCount = 0; 
    unsigned short m_revo9Counter = 0xFFFF; 
    bool m_isMC = false; 
    // collections
    StoreArray<TOPDigit> m_topDigits; 
    StoreArray<TOPRawDigit> m_topRawDigits; 
    StoreArray<Track> m_tracks; 
    StoreObjPtr<TOPRecBunch> m_recBunch; 
    StoreObjPtr<MCInitialParticles> m_initialParticles; 
    StoreArray<TOPTimeZero> m_timeZeros; 
    StoreObjPtr<EventT0> m_eventT0; 
    // database
    DBObjPtr<TOPCalCommonT0> m_commonT0;   
    DBObjPtr<TOPFrontEndSetting> m_feSetting;  
    DBObjPtr<BunchStructure> m_bunchStructure;  
    OptionalDBObjPtr<TOPCalEventT0Offset> m_eventT0Offset; 
    OptionalDBObjPtr<TOPCalFillPatternOffset> m_fillPatternOffset; 
  };
 
} // Belle2 namespace