FairRingSorterTask.h

Go to the documentation of this file.

/********************************************************************************
 *    Copyright (C) 2014 GSI Helmholtzzentrum fuer Schwerionenforschung GmbH    *
 *                                                                              *
 *              This software is distributed under the terms of the             *
 *              GNU Lesser General Public Licence (LGPL) version 3,             *
 *                  copied verbatim in the file "LICENSE"                       *
 ********************************************************************************/

#ifndef FairRingSorterTask_H
#define FairRingSorterTask_H

#include "FairRingSorter.h"   // for FairRingSorter
#include "FairTask.h"         // for FairTask, InitStatus

#include <Rtypes.h>    // for Bool_t, Int_t, kTRUE, etc
#include <TString.h>   // for TString

class FairTimeStamp;
class TClonesArray;

class FairRingSorterTask : public FairTask
{
  public:
    FairRingSorterTask()
        : FairTask("SorterTask")
        , fSorter(0)
        , fPersistance(kTRUE)
        , fDigiPixelMCInfo(kFALSE)
        , fNumberOfCells(1000)
        , fWidthOfCells(10)
        , fInputBranch()
        , fInputArray(0)
        , fOutputBranch()
        , fFolder()
        , fOutputArray(0)
        , fEntryNr(0)
    {
        SetVerbose(0);
    }

    FairRingSorterTask(const char* name)
        : FairTask(name)
        , fSorter(0)
        , fPersistance(kTRUE)
        , fDigiPixelMCInfo(kFALSE)
        , fNumberOfCells(1000)
        , fWidthOfCells(10)
        , fInputBranch()
        , fInputArray(0)
        , fOutputBranch()
        , fFolder()
        , fOutputArray(0)
        , fEntryNr(0)
    {
        SetVerbose(0);
    }

    FairRingSorterTask(Int_t numberOfCells,
                       Double_t widthOfCells,
                       TString inputBranch,
                       TString outputBranch,
                       TString folderName)
        : FairTask("Sorter")
        , fSorter(0)
        , fPersistance(kTRUE)
        , fDigiPixelMCInfo(kFALSE)
        , fNumberOfCells(numberOfCells)
        , fWidthOfCells(widthOfCells)
        , fInputBranch(inputBranch)
        , fInputArray(0)
        , fOutputBranch(outputBranch)
        , fFolder(folderName)
        , fOutputArray(0)
        , fEntryNr(0)
    {
        SetVerbose(0);
    }

    virtual ~FairRingSorterTask() { delete fSorter; }

    virtual InitStatus Init();
    virtual InitStatus ReInit();

    virtual void Exec(Option_t* opt);
    virtual void FinishEvent();
    virtual void FinishTask();

    virtual void SetParContainers(){};

    void SetPersistance(Bool_t p = kTRUE) { fPersistance = p; };
    Bool_t GetPersistance() { return fPersistance; };

    virtual void AddNewDataToTClonesArray(FairTimeStamp* data);
    virtual FairRingSorter* InitSorter(Int_t numberOfCells, Double_t widthOfCells) const;

  protected:
    FairRingSorter* fSorter;
    Bool_t fPersistance;
    Bool_t fDigiPixelMCInfo;
    Int_t fNumberOfCells;
    Double_t fWidthOfCells;   // in ns
    TString fInputBranch;
    TClonesArray* fInputArray;
    TString fOutputBranch;
    TString fFolder;
    TClonesArray* fOutputArray;
    Int_t fEntryNr;
    FairRingSorterTask(const FairRingSorterTask&);
    FairRingSorterTask& operator=(const FairRingSorterTask&);

    ClassDef(FairRingSorterTask, 2);
};

#endif