49 for (
Phi_iterator i = phiSegments.begin();
i != phiSegments.end();
i++) {
50 if (
step ==
i->bxNum())
60 for (
Phi_iterator i = phiSegments.begin();
i != phiSegments.end();
i++) {
61 if (step1 <= i->bxNum() && step2 >=
i->bxNum() &&
i->Ts2Tag() == 0 &&
i->code() != 7)
63 if (step1 <= i->bxNum() - 1 && step2 >=
i->bxNum() - 1 &&
i->Ts2Tag() == 1 &&
i->code() != 7)
73 for (
Phi_iterator i = phiSegments.begin();
i != phiSegments.end();
i++) {
74 if (
step ==
i->bxNum() &&
wheel ==
i->whNum() && sect ==
i->scNum() &&
stat ==
i->stNum() &&
i->Ts2Tag() == 0)
84 for (
Phi_iterator i = phiSegments.begin();
i != phiSegments.end();
i++) {
85 if (
step ==
i->bxNum() - 1 &&
wheel ==
i->whNum() && sect ==
i->scNum() &&
stat ==
i->stNum() &&
i->Ts2Tag() == 1)
94 for (Phi_Container::iterator
i = phiSegments.begin();
i != phiSegments.end();
i++) {
95 if (
step ==
i->bxNum() &&
wheel ==
i->whNum() && sect ==
i->scNum() &&
stat ==
i->stNum() &&
i->Ts2Tag() == ts2tag)
L1MuDTChambPhDigi * chPhiSegm(int wheel, int stat, int sect, int bx, int ts2tag)
std::vector< L1MuDTChambPhDigi > Phi_Container
void setContainer(const Phi_Container &inputSegments)
Phi_Container::const_iterator Phi_iterator
int bxSize(int step1, int step2) const
L1MuDTChambPhDigi const * chPhiSegm1(int wheel, int stat, int sect, int bx) const
bool bxEmpty(int step) const
L1MuDTChambPhDigi const * chPhiSegm2(int wheel, int stat, int sect, int bx) const
~L1MuTMChambPhContainer()
Phi_Container const * getContainer() const