26 else if ( u1.
rocIds.
min() <
u2.rocIds.min() ) res =
true;
27 else if ( u1.
rocIds.
min() >
u2.rocIds.min() ) res =
false;
37 typedef Names::const_iterator CIN;
44 vector<Item> linkItems;
45 typedef vector<Item>::const_iterator CIU;
47 for(
unsigned int idx = 0;
idx < n.size();
idx++) {
56 linkItems.push_back(item);
59 linkItems.push_back(item);
61 linkItems.push_back(item);
64 linkItems.push_back(item);
75 sort( linkItems.begin(), linkItems.end(), myLess );
81 for (CIU it = linkItems.begin(); it != linkItems.end(); it++) {
82 str << (*it).name->name() <<
" r="<< (*it).rocIds << endl;
84 LogDebug(
" sorted BARREL links: ") << str.str();
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++) {
98 rocs.push_back(
PixelROC( it->unit,
id, idRoc) );
101 result.push_back(link);
std::vector< uint32_t > DetUnits
const PixelBarrelName * name
void add(const ROCs &rocs)
add connection (defined by connection spec and ROCs)
int moduleName() const
module id (index in z)
PixelRecoRange< float > Range
Links links(const Names &n, const DetUnits &u) const
const T & min() const
lower edge of range
PixelFEDCabling::Links Links
bool isHalfModule() const
full or half module
Abs< T >::type abs(const T &t)
int ladderName() const
ladder id (index in phi)
int layerName() const
layer id
std::vector< PixelModuleName * > Names
std::vector< PixelROC > ROCs
ROCs served be this link.