24 void DegradeBend::degrade(
float bend,
29 unsigned int& numInGroup)
const {
31 unsigned int windowHalfStrips;
32 this->
work(bend, psModule, stDetId, windowFEnew, degradedBend, numInGroup, windowHalfStrips);
42 unsigned int& numInGroup,
43 unsigned int& windowHalfStrips)
const {
47 const double* storedHalfWindow = sw_->storedWindowSize(theTrackerTopo_, stDetId);
50 const double window =
std::min(*storedHalfWindow,
double(windowFEnew));
51 windowHalfStrips = (
unsigned int)(2 *
window);
55 int b = std::round(2 * bend);
57 if ((
unsigned int)(
std::abs(
b)) <= windowHalfStrips) {
59 degradedBend = stubAlgo_->degradeBend(psModule, windowHalfStrips,
b);
63 constexpr
float rejectedStubBend = 99999.;
64 degradedBend = rejectedStubBend;
Abs< T >::type abs(const T &t)
def window(xmin, xmax, ymin, ymax, x=0, y=0, width=100, height=100, xlogbase=None, ylogbase=None, minusInfinity=-1000, flipx=False, flipy=True)
=== This is the base class for the linearised chi-squared track fit algorithms.