30 else if (
u1.rocIds.min() <
u2.rocIds.min())
32 else if (
u1.rocIds.min() >
u2.rocIds.min())
40 typedef Names::const_iterator CIN;
47 vector<Item> linkItems;
48 typedef vector<Item>::const_iterator CIU;
50 for (
unsigned int idx = 0;
idx <
n.size();
idx++) {
57 if (
b->isHalfModule()) {
59 linkItems.push_back(
item);
60 }
else if (
b->layerName() <= 2) {
62 linkItems.push_back(
item);
64 linkItems.push_back(
item);
67 linkItems.push_back(
item);
76 sort(linkItems.begin(), linkItems.end(), myLess);
82 for (CIU it = linkItems.begin(); it != linkItems.end(); it++) {
83 str << (*it).name->name() <<
" r=" << (*it).rocIds << endl;
91 result.reserve(linkItems.size());
92 for (CIU it = linkItems.begin(); it != linkItems.end(); it++) {
96 for (
int id = (*it).rocIds.min();
id <= (*it).rocIds.max();
id++) {
std::vector< uint32_t > DetUnits
PixelRecoRange< float > Range
int moduleName() const
module id (index in z)
Links links(const Names &n, const DetUnits &u) const
PixelFEDCabling::Links Links
Abs< T >::type abs(const T &t)
bool operator()(const Item &, const Item &) const
int layerName() const
layer id
int ladderName() const
ladder id (index in phi)
std::vector< PixelModuleName * > Names
std::vector< PixelROC > ROCs
ROCs served be this link.