#include <PndSttHitSorterTask.h>
Definition at line 13 of file PndSttHitSorterTask.h.
PndSttHitSorterTask::PndSttHitSorterTask |
( |
| ) |
|
PndSttHitSorterTask::PndSttHitSorterTask |
( |
const char * |
name | ) |
|
|
inline |
PndSttHitSorterTask::PndSttHitSorterTask |
( |
Int_t |
numberOfCells, |
|
|
Double_t |
widthOfCells, |
|
|
TString |
inputBranch, |
|
|
TString |
outputBranch, |
|
|
TString |
folderName |
|
) |
| |
|
inline |
Definition at line 17 of file PndSttHitSorterTask.h.
18 FairRingSorterTask(numberOfCells, widthOfCells, inputBranch, outputBranch, folderName){};
PndSttHitSorterTask::~PndSttHitSorterTask |
( |
| ) |
|
|
virtual |
void PndSttHitSorterTask::AddNewDataToTClonesArray |
( |
FairTimeStamp * |
data | ) |
|
|
virtual |
Definition at line 27 of file PndSttHitSorterTask.cxx.
References fVerbose.
29 FairRootManager* ioman = FairRootManager::Instance();
30 TClonesArray* myArray = ioman->GetTClonesArray(fOutputBranch);
32 std::cout <<
"-I- PndSttHitSorterTask::AddNewDataToTClonesArray Data: " ;
33 std::cout << *(
PndSttHit*)(data) << std::endl;
FairRingSorter * PndSttHitSorterTask::InitSorter |
( |
Int_t |
numberOfCells, |
|
|
Double_t |
widthOfCells |
|
) |
| const |
|
virtual |
The documentation for this class was generated from the following files: