templated version of a sorter task
More...
#include <BSEmcSorterTask.h>
template<class T>
class BSEmcSorterTask< T >
templated version of a sorter task
sort Ts by time for later timebunching
- Author
- Ben Salisbury salis.nosp@m.bury.nosp@m.@hisk.nosp@m.p.un.nosp@m.i-bon.nosp@m.n.de, HISKP Bonn
- Date
- 2021-02
Definition at line 25 of file BSEmcSorterTask.h.
◆ BSEmcSorterTask() [1/2]
◆ BSEmcSorterTask() [2/2]
template<class T >
BSEmcSorterTask< T >::BSEmcSorterTask |
( |
Int_t |
t_numberOfCells, |
|
|
Double_t |
t_widthOfCells, |
|
|
const std::string & |
t_inputbranch, |
|
|
const std::string & |
t_outputbranch |
|
) |
| |
|
inline |
Definition at line 28 of file BSEmcSorterTask.h.
29 : FairRingSorterTask(t_numberOfCells, t_widthOfCells, TString{t_inputbranch}, TString{t_outputbranch},
"Emc")
◆ ~BSEmcSorterTask()
◆ AddNewDataToTClonesArray()
template<class T >
virtual void BSEmcSorterTask< T >::AddNewDataToTClonesArray |
( |
FairTimeStamp * |
t_data | ) |
|
|
inlinevirtual |
Definition at line 36 of file BSEmcSorterTask.h.
38 FairRootManager *ioman = FairRootManager::Instance();
39 TClonesArray *myArray = ioman->GetTClonesArray(fOutputBranch);
41 std::cout <<
"-I- BSEmcSorterTask::AddNewDataToTClonesArray Data: ";
42 std::cout << *(T *)(t_data) << std::endl;
44 new ((*myArray)[myArray->GetEntries()]) T(*(dynamic_cast<T *>(t_data)));
◆ ClassDef()
◆ InitSorter()
template<class T >
virtual FairRingSorter* BSEmcSorterTask< T >::InitSorter |
( |
Int_t |
t_numberOfCells, |
|
|
Double_t |
t_widthOfCells |
|
) |
| const |
|
inlinevirtual |
◆ SetSourceBranch()
◆ SetTargetBranch()
The documentation for this class was generated from the following file: