FairRoot/PandaRoot
PndDrcLutNodeH.h
Go to the documentation of this file.
1 // -----------------------------------------
2 // PndDrcLutNodeH.h
3 //
4 // Created on: 09.07.2013
5 // Author: R.Dzhygadlo at gsi.de
6 // Author: M.Patsyuk at gsi.de
7 // -----------------------------------------
8 // Container for look-up table
9 
10 #ifndef PNDDRCLUTNODEH_H
11 #define PNDDRCLUTNODEH_H
12 
13 #include "TObject.h"
14 #include "TClonesArray.h"
15 #include "TVector3.h"
16 #include <vector>
17 
18 class PndDrcLutNodeH : public TObject {
19 
20 public:
21 
22  // Default constructor
23  PndDrcLutNodeH ();
24 
25  // Standard constructors
26  PndDrcLutNodeH (Int_t nodeId);
27  PndDrcLutNodeH (Int_t nodeId, TVector3 dir, Double_t time);
28 
29  // Copy constructor
30  PndDrcLutNodeH (PndDrcLutNodeH& node) { *this = node; }
31 
32  // Modifiers
33  void AddEntry(TVector3 dir, Int_t amb, Double_t time);
34  void SetPos(TVector3 dir){fNodePos = dir;}
35 
36  // Accessors
37  Int_t Entries() { return fSize; }
38  Int_t GetNodeId() { return fNodeId; }
39  Int_t GetAmbiguity(Int_t entry);
40  Double_t GetTime(Int_t entry);
41  TVector3 GetDirection(Int_t entry);
42  TVector3 GetPos(){ return fNodePos; }
43 
44 protected:
45 
46  Int_t fNodeId;
47  Int_t fSize;
48 
49  std::vector<TVector3> fNodeArray;
50  std::vector<Int_t> fAmbiguity;
51  std::vector<Double_t> fTimeArray;
52  TVector3 fNodePos;
53  ClassDef(PndDrcLutNodeH,2)
54 };
55 
56 #endif //PNDDRCLUTNODEH_H
Double_t GetTime(Int_t entry)
TVector3 fNodePos
void AddEntry(TVector3 dir, Int_t amb, Double_t time)
PndDrcLutNodeH(PndDrcLutNodeH &node)
Int_t GetAmbiguity(Int_t entry)
std::vector< TVector3 > fNodeArray
std::vector< Double_t > fTimeArray
Double_t
std::vector< Int_t > fAmbiguity
void SetPos(TVector3 dir)
TVector3 GetDirection(Int_t entry)
TVector3 GetPos()