|
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
#include <vector>
#include <utility>
#include <string>
#include <iostream>
#include "DataFormats/Phase2TrackerDigi/interface/Phase2ITQCore.h"
#include "DataFormats/Phase2TrackerDigi/interface/Phase2ITChip.h"
#include "DataFormats/Phase2TrackerDigi/interface/Phase2ITDigiHit.h"
Phase2ITChip::Phase2ITChip(int rocnum, const std::vector<Phase2ITDigiHit> hl) {
hitList_ = hl;
rocnum_ = rocnum;
}
unsigned int Phase2ITChip::size() { return hitList_.size(); }
//Returns the position (row,col) of the 4x4 QCores that contains a hit
std::pair<int, int> Phase2ITChip::get_QCore_pos(Phase2ITDigiHit hit) {
int row = hit.row() / 4;
int col = hit.col() / 4;
return {row, col};
}
//Takes a hit and returns the 4x4 QCore that contains it
Phase2ITQCore Phase2ITChip::get_QCore_from_hit(Phase2ITDigiHit pixel) {
std::vector<int> adcs(16, 0), hits(16, 0);
std::pair<int, int> pos = get_QCore_pos(pixel);
for (const auto& hit : hitList_) {
if (get_QCore_pos(hit) == pos) {
int i = (4 * (hit.row() % 4) + (hit.col() % 4) + 8) % 16;
adcs[i] = hit.adc();
hits[i] = 1;
}
}
Phase2ITQCore qcore(0, pos.second, pos.first, false, false, adcs, hits);
return qcore;
}
//Removes duplicated Phase2ITQCores
std::vector<Phase2ITQCore> Phase2ITChip::rem_duplicates(std::vector<Phase2ITQCore> qcores) {
std::vector<Phase2ITQCore> list = {};
size_t i = 0;
while (i < qcores.size()) {
for (size_t j = i + 1; j < qcores.size();) {
if (qcores[j].get_col() == qcores[i].get_col() && qcores[j].get_row() == qcores[i].get_row()) {
qcores.erase(qcores.begin() + j);
} else {
++j;
}
}
list.push_back(qcores[i]);
++i;
}
return list;
}
//Returns a list of the qcores with hits arranged by increasing column and then row numbers
std::vector<Phase2ITQCore> Phase2ITChip::organize_QCores(std::vector<Phase2ITQCore> qcores) {
std::vector<Phase2ITQCore> organized_list = {};
while (!qcores.empty()) {
int min = 0;
for (size_t i = 1; i < qcores.size(); i++) {
if (qcores[i].get_col() < qcores[min].get_col()) {
min = i;
} else if (qcores[i].get_col() == qcores[min].get_col() && qcores[i].get_row() < qcores[min].get_row()) {
min = i;
}
}
organized_list.push_back(qcores[min]);
qcores.erase(qcores.begin() + min);
}
return organized_list;
}
//Takes in an oranized list of Phase2ITQCores and sets the islast and isneighbor properties of those qcores
std::vector<Phase2ITQCore> link_QCores(std::vector<Phase2ITQCore> qcores) {
for (size_t i = 1; i < qcores.size(); i++) {
if (qcores[i].get_row() == qcores[i - 1].get_row()) {
qcores[i].setIsNeighbour(true);
}
}
//.size() is unsigned. If size is zero size()-1 is a huge number hence this needs to be protected
if (!qcores.empty()) {
for (size_t i = 0; i < qcores.size() - 1; i++) {
if (qcores[i].get_col() != qcores[i + 1].get_col()) {
qcores[i].setIsLast(true);
}
}
qcores[qcores.size() - 1].setIsLast(true);
}
return qcores;
}
//Takes in a list of hits and organizes them into the 4x4 QCores that contains them
std::vector<Phase2ITQCore> Phase2ITChip::get_organized_QCores() {
std::vector<Phase2ITQCore> qcores = {};
qcores.reserve(hitList_.size());
for (const auto& hit : hitList_) {
qcores.push_back(get_QCore_from_hit(hit));
}
return (link_QCores(organize_QCores(rem_duplicates(qcores))));
}
//Returns the encoding of the readout chip
std::vector<bool> Phase2ITChip::get_chip_code() {
std::vector<bool> code = {};
if (!hitList_.empty()) {
std::vector<Phase2ITQCore> qcores = get_organized_QCores();
bool is_new_col = true;
for (auto& qcore : qcores) {
std::vector<bool> qcore_code = qcore.encodeQCore(is_new_col);
code.insert(code.end(), qcore_code.begin(), qcore_code.end());
is_new_col = qcore.islast();
}
}
return code;
}
|