107 x[0] = -1;
x[1] = -1;
108 y[0] = -1;
y[1] = -1;
115 vector<SiPixelCluster::Pixel> pixels = recHit.cluster()->pixels();
119 for(vector<SiPixelCluster::Pixel>::const_iterator pixel = pixels.begin();
120 pixel!= pixels.end();
124 pos.first = (int)pixel->x;
125 pos.second = (
int)pixel->y;
140 if(pos.second >
hig+1)
152 for(
int ix = recHit.cluster()->minPixelRow() + 1;
153 ix < recHit.cluster()->maxPixelRow(); ix++)
156 for(
int iy = recHit.cluster()->minPixelCol() + 1;
157 iy < recHit.cluster()->maxPixelCol(); iy++)
162 if(theTopology->
isItBigPixelInX(recHit.cluster()->minPixelRow())) px++;
163 if(theTopology->
isItBigPixelInX(recHit.cluster()->maxPixelRow())) px++;
166 if(theTopology->
isItBigPixelInY(recHit.cluster()->minPixelCol())) py++;
167 if(theTopology->
isItBigPixelInY(recHit.cluster()->maxPixelCol())) py++;
174 if( (px > 0 || py > 0) &&
odir == 0)
181 data.
size.reserve(px*py);
182 for(
int ax = 0;
ax <= px;
ax++)
183 for(
int ay = 0; ay <= py; ay++)
185 int dx =
x[1] -
x[0] +
ax;
186 int dy =
y[1] -
y[0] + ay;
189 pair<int,int>
s(dx,dy);
190 data.
size.push_back(
s);
std::vector< std::pair< int, int > > size
virtual bool isItEdgePixelInX(int ixbin) const =0
bool processColumn(std::pair< int, int > pos, bool inTheLoop)
virtual bool isItBigPixelInX(const int ixbin) const =0
virtual const PixelTopology & specificTopology() const
Returns a reference to the pixel proxy topology.
bool hasBigPixelsOnlyInside
virtual bool isItEdgePixelInY(int iybin) const =0
virtual bool isItBigPixelInY(const int iybin) const =0