28 #include "FairRootManager.h"
30 #include "TClonesArray.h"
179 nStation, nLayer, nSide, nModule);
185 Int_t padIterator = 0;
186 for (Int_t iSector = 0; iSector < nofSectors; iSector++) {
190 for (Int_t iPad = 0; iPad < nofPadsInSector; iPad++) {
213 vector<UInt_t> diagonalNeighbors;
214 diagonalNeighbors.clear();
215 for (Int_t iPadMain = 0; iPadMain <
fNofPads; iPadMain++) {
227 Double_t lPhi = (Left_1 - Right_1) * 0.01;
228 Float_t lR = (Down_1 - Up_1) * 0.01;
229 for (Int_t iPadNeighbor = 0; iPadNeighbor <
fNofPads; iPadNeighbor++) {
230 if (iPadMain == iPadNeighbor)
continue;
239 if ((Left_1 == Right_2) || (Right_1 == Left_2)) {
240 if (((Down_1 - lR) < Up_2) && ((Up_1 + lR) > Down_2)) {
245 if ((Up_1 == Down_2) || (Down_1 == Up_2)) {
246 if (((Left_1 - lPhi) < Right_2) && ((Right_1 + lPhi) > Left_2)) {
252 if (((Left_1 == Right_2) && (Up_1 == Down_2))
253 || ((Left_1 == Right_2) && (Up_2 == Down_1))
254 || ((Left_2 == Right_1) && (Up_1 == Down_2))
255 || ((Left_2 == Right_1) && (Up_2 == Down_1))) {
256 diagonalNeighbors.push_back(iPadNeighbor);
259 for (Int_t iNeighbor = 0; iNeighbor < diagonalNeighbors.size();
264 diagonalNeighbors.clear();
275 nStation, nLayer, nSide, nModule);
281 Int_t padIterator = 0;
282 for (Int_t iSector = 0; iSector < nofSectors; iSector++) {
286 for (Int_t iPad = 0; iPad < nofPadsInSector; iPad++) {
311 vector<UInt_t> diagonalNeighbors;
312 diagonalNeighbors.clear();
313 for (Int_t iSector = 0; iSector < nofSectors; iSector++) {
317 for (Int_t iPad = 0; iPad < nofPadsInSector; iPad++) {
323 for (Int_t iNeighbor = 0; iNeighbor < neighborsVector.size();
346 diagonalNeighbors.push_back(padNeighbor);
353 for (Int_t iNeighbor = 0; iNeighbor < diagonalNeighbors.size();
356 diagonalNeighbors.at(iNeighbor));
359 diagonalNeighbors.clear();
409 template<
typename T1>
418 template<
typename T2>
429 if ((x1 < (x2 + l)) && (x1 > (x2 - l))) {