|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
#ifndef MEChannel_hh
#define MEChannel_hh
//
// Authors : Gautier Hamel de Monchenault and Julie Malcles, Saclay
//
// logical navigation in doubly linked list of channels
#include <vector>
#include <TROOT.h>
class MEChannel {
public:
MEChannel(int ix, int iy, int ii, MEChannel* mother);
virtual ~MEChannel();
int id() const;
int ix() const { return _ix; }
int iy() const { return _iy; }
MEChannel* getDaughter(int ix, int iy, int ig);
MEChannel* m() { return _m; }
MEChannel* d(unsigned ii) {
if (ii >= n())
return nullptr;
return _d[ii];
}
unsigned n() const { return _d.size(); }
int ig() const { return _ig; }
bool getListOfChannels(std::vector<MEChannel*>&);
bool getListOfAncestors(std::vector<MEChannel*>&);
bool getListOfDescendants(std::vector<MEChannel*>&);
bool getListOfDescendants(int ig, std::vector<MEChannel*>&);
MEChannel* getFirstDescendant(int ig);
MEChannel* getDescendant(int ig, int ii);
MEChannel* getChannel(int ix, int iy);
MEChannel* getChannel(int ig, int ix, int iy);
MEChannel* getAncestor(int ig);
void print(std::ostream& o, bool recursif = false) const;
TString oneLine(int ig);
TString oneLine() { return oneLine(_ig); }
TString oneWord(int ig);
TString oneWord() { return oneWord(_ig); }
private:
// doubly-linked tree
MEChannel* _m;
std::vector<MEChannel*> _d;
// granularity
int _ig;
// (local) coordinates
int _ix;
int _iy;
// defines a channel
std::vector<int> _id;
MEChannel* addDaughter(int ix, int iy, int ii);
// ClassDef(MEChannel,0) // MEChannel -- A channel or group of channels
};
#endif
|