48 phiSegments = inputSegments;
60 i != phiSegments.end();
62 if (step ==
i->bxNum()) empty =
false;
73 i != phiSegments.end();
75 if (step1 <= i->bxNum() && step2 >=
i->bxNum()
76 &&
i->Ts2Tag() == 0 &&
i->code() != 7) size++;
77 if (step1 <= i->bxNum()-1 && step2 >=
i->bxNum()-1
78 &&
i->Ts2Tag() == 1 &&
i->code() != 7) size++;
89 i != phiSegments.end();
91 if (step ==
i->bxNum() && wheel ==
i->whNum() && sect ==
i->scNum()
92 && stat ==
i->stNum() &&
i->Ts2Tag() == 0)
104 i != phiSegments.end();
106 if (step ==
i->bxNum()-1 && wheel ==
i->whNum() && sect ==
i->scNum()
107 && stat ==
i->stNum() &&
i->Ts2Tag() == 1)
L1MuDTChambPhDigi const * chPhiSegm1(int wheel, int stat, int sect, int bx) const
L1MuDTChambPhDigi const * chPhiSegm2(int wheel, int stat, int sect, int bx) const
bool bxEmpty(int step) const
int bxSize(int step1, int step2) const
std::vector< L1MuDTChambPhDigi > Phi_Container
Phi_Container::const_iterator Phi_iterator
~L1MuDTChambPhContainer()
void setContainer(const Phi_Container &inputSegments)
Phi_Container const * getContainer() const
tuple size
Write out results.