48 phiSegments = inputSegments;
65 i != phiSegments.end();
67 if (step ==
i->bxNum()) empty =
false;
78 i != phiSegments.end();
80 if (step1 <= i->bxNum() && step2 >=
i->bxNum()
81 &&
i->Ts2Tag() == 0 &&
i->code() != 7) size++;
82 if (step1 <= i->bxNum()-1 && step2 >=
i->bxNum()-1
83 &&
i->Ts2Tag() == 1 &&
i->code() != 7) size++;
94 i != phiSegments.end();
96 if (step ==
i->bxNum() && wheel ==
i->whNum() && sect ==
i->scNum()
97 && stat ==
i->stNum() &&
i->Ts2Tag() == 0)
98 rT = const_cast<L1MuDTChambPhDigi*>(&(*
i));
109 i != phiSegments.end();
111 if (step ==
i->bxNum()-1 && wheel ==
i->whNum() && sect ==
i->scNum()
112 && stat ==
i->stNum() &&
i->Ts2Tag() == 1)
113 rT = const_cast<L1MuDTChambPhDigi*>(&(*
i));
bool bxEmpty(int step) const
L1MuDTChambPhDigi * chPhiSegm2(int wheel, int stat, int sect, int bx) const
int bxSize(int step1, int step2) const
L1MuDTChambPhDigi * chPhiSegm1(int wheel, int stat, int sect, int bx) const
Phi_Container * getContainer() const
std::vector< L1MuDTChambPhDigi > Phi_Container
Phi_Container::const_iterator Phi_iterator
~L1MuDTChambPhContainer()
void setContainer(const Phi_Container &inputSegments)
tuple size
Write out results.