15 bx_min(ps.getParameter<
int>(
"BX_min")),
16 bx_max(ps.getParameter<
int>(
"BX_max")) {
35 for(
int sector = 0; sector <= 11; ++sector ) {
38 std::unique_ptr<const L1MuDTChambPhDigi> phi_segm_1(
41 std::unique_ptr<const L1MuDTChambPhDigi> phi_segm_2(
44 std::unique_ptr<const L1MuDTChambThDigi> theta_segm(
48 int bti_group_1=-1, bti_group_2=-1;
55 if( phi_segm_1 && bti_group_1 != -1 ) {
59 }
else if ( phi_segm_1 && bti_group_1 == -1 ) {
61 }
else if ( !phi_segm_1 && bti_group_1 != -1 ) {
66 if( phi_segm_2 && bti_group_2 != -1) {
70 }
else if ( phi_segm_2 && bti_group_2 == -1 ) {
72 }
else if ( !phi_segm_2 && bti_group_2 != -1 ) {
73 chamb_list.push_back(
processDigis(*phi_segm_2,bti_group_2));
81 temp =
_bxc->clean(chamb_list);
82 cleaned.insert(cleaned.end(),temp.begin(),temp.end());
84 cleaned.insert(cleaned.end(),chamb_list.begin(),chamb_list.end());
89 out.insert(out.end(),cleaned.begin(),cleaned.end());
93 const int &segment_number)
const {
99 const int bti_group)
const {
106 const int bti_group)
const {
113 const int pos)
const {
116 for(
int i = 0;
i < 7; ++
i ) {
virtual void extractPrimitives(const edm::Event &, const edm::EventSetup &, std::vector< TriggerPrimitive > &) const
T getParameter(std::string const &) const
L1MuDTChambPhDigi const * chPhiSegm1(int wheel, int stat, int sect, int bx) const
L1MuDTChambPhDigi const * chPhiSegm2(int wheel, int stat, int sect, int bx) const
DTCollector(const edm::ParameterSet &)
std::unique_ptr< DTBunchCrossingCleaner > _bxc
int findBTIGroupForThetaDigi(const L1MuDTChambThDigi &, const int position) const
TriggerPrimitive processDigis(const L1MuDTChambPhDigi &, const int &segment_number) const
int position(const int i) const
std::vector< TriggerPrimitive > TriggerPrimitiveCollection
L1TMuon::TriggerPrimitive TriggerPrimitive
bool getByLabel(InputTag const &tag, Handle< PROD > &result) const
ParameterSet const & getParameterSet(std::string const &) const
L1MuDTChambThDigi const * chThetaSegm(int wheel, int stat, int sect, int bx) const
#define DEFINE_EDM_PLUGIN(factory, type, name)