ViewVC Help
View File | Revision Log | Show Annotations | Root Listing
root/cvsroot/UserCode/L1RpcTriggerAnalysis/src/PatternManager.cc
Revision: 1.9
Committed: Mon May 27 11:02:41 2013 UTC (11 years, 11 months ago) by konec
Content type: text/plain
Branch: MAIN
Changes since 1.8: +7 -4 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 konec 1.1 #include "UserCode/L1RpcTriggerAnalysis/interface/PatternManager.h"
2    
3     #include "UserCode/L1RpcTriggerAnalysis/interface/EventObj.h"
4     #include "UserCode/L1RpcTriggerAnalysis/interface/TrackObj.h"
5     #include "UserCode/L1RpcTriggerAnalysis/interface/HitSpecObj.h"
6    
7     #include "UserCode/L1RpcTriggerAnalysis/interface/RPCDetIdUtil.h"
8     #include "UserCode/L1RpcTriggerAnalysis/interface/DTphDigiSpec.h"
9     #include "UserCode/L1RpcTriggerAnalysis/interface/CSCDigiSpec.h"
10     #include "UserCode/L1RpcTriggerAnalysis/interface/RPCDigiSpec.h"
11 konec 1.8 #include "DataFormats/MuonDetId/interface/MuonSubdetId.h"
12 konec 1.1
13     #include "UserCode/L1RpcTriggerAnalysis/interface/Pattern.h"
14     #include "UserCode/L1RpcTriggerAnalysis/interface/GoldenPattern.h"
15    
16     #include "TFile.h"
17     #include "TTree.h"
18    
19     namespace {
20     typedef struct {
21     UInt_t key_det;
22     unsigned int key_pt;
23     unsigned int key_phi;
24     int key_ch;
25     unsigned int pat_Case;
26     UInt_t patDet;
27     int posOrBend;
28     unsigned int freq;
29     } ENTRY;
30     }
31    
32     PatternManager::PatternManager(const edm::ParameterSet &cfg)
33     : theConfig(cfg), theEvForPatCounter(0), theEvUsePatCounter(0)
34    
35     {}
36    
37     PatternManager::~PatternManager()
38     {
39     std::cout <<" Events checked for pattenrs: " << theEvForPatCounter << std::endl;
40 konec 1.5 std::cout <<" Events used for pattenrs: " << theEvUsePatCounter << std::endl;
41 konec 1.1 std::cout <<" Size of GoldenPatterns: " << theGPs.size() << std::endl;
42     if (theConfig.getUntrackedParameter<bool>("dump",false)) {
43     for (std::map< GoldenPattern::Key, GoldenPattern>::const_iterator
44     im = theGPs.begin(); im!= theGPs.end(); ++im) {
45     std::cout <<" GP: "<< (*im).second << std::endl;
46     }
47     }
48    
49     }
50    
51     void PatternManager::run(const EventObj* ev, const TrackObj * simu, const HitSpecObj * hitSpec, const VDigiSpec & vDigi)
52     {
53     if (!hitSpec) return;
54     if (hitSpec->rawId() == 0 ) return;
55     double phiref = hitSpec->position().phi();
56     double ptref = simu->pt();
57     int chargeref = simu->charge();
58     unsigned int detref = hitSpec->rawId();
59 konec 1.2 /*
60 konec 1.1 if (detref != 637602109 && detref != 637634877 &&
61     detref != 637599914 && detref != 637632682 ) return;
62    
63     bool precisePos = ( fabs(hitSpec->position().phi()-1.025) < 0.001);
64     if (!precisePos) return;
65     if ( simu->pt() < 16.) return;
66 konec 1.2 */
67 konec 1.1
68    
69     GoldenPattern::Key key( detref, ptref, chargeref, phiref);
70    
71     Pattern pattern;
72     theEvForPatCounter++;
73     for (VDigiSpec::const_iterator is= vDigi.begin(); is!=vDigi.end(); is++) {
74     bool isOK = pattern.add(*is);
75     if (!isOK) return;
76     }
77     if (pattern.size() == 0) return;
78     theEvUsePatCounter++;
79    
80     if (theGPs.find(key)==theGPs.end()) theGPs[key]=GoldenPattern(key);
81     theGPs[key].add(pattern);
82    
83     }
84    
85     L1Obj PatternManager::check(const EventObj* ev, const TrackObj * simu, const HitSpecObj * hitSpec, const VDigiSpec & vDigi)
86     {
87     L1Obj candidate;
88     if (!hitSpec) return candidate;
89     if (hitSpec->rawId() == 0 ) return candidate;
90     double phiref = hitSpec->position().phi();
91     double ptref = simu->pt();
92     int chargeref = simu->charge();
93     unsigned int detref = hitSpec->rawId();
94 konec 1.5 /*
95 konec 1.1 if (detref != 637602109 && detref != 637634877 &&
96     detref != 637599914 && detref != 637632682 ) return candidate;
97    
98     bool precisePos = ( fabs(hitSpec->position().phi()-1.025) < 0.001);
99     if (!precisePos) return candidate;
100     if ( simu->pt() < 26. || simu->pt() > 27. ) return candidate;
101    
102 konec 1.2 */
103 konec 1.9 // std::cout <<" ------------------ EVENT: "<<*ev <<" number of digis: "<<vDigi.size()<< std::endl;
104 konec 1.6 std::vector<Pattern> vpattern(1);
105 konec 1.1 theEvForPatCounter++;
106 konec 1.8 static bool skipRpcData = theConfig.getUntrackedParameter<bool>("skipRpcData", false);
107     static bool skipDtCscData = theConfig.getUntrackedParameter<bool>("skipDtCscData",false);
108     for (VDigiSpec::const_iterator is= vDigi.begin(); is!=vDigi.end(); is++) {
109     DetId detId( is->first);
110     if (skipRpcData && detId.subdetId()==MuonSubdetId::RPC) continue;
111     if (skipDtCscData && (detId.subdetId()==MuonSubdetId::DT || detId.subdetId()==MuonSubdetId::CSC) ) continue;
112 konec 1.9 // std::cout << "adding------- "<< is-vDigi.begin()+1 <<" digi det: "<<is->first<<"(rpc:"<<(detId.subdetId()==MuonSubdetId::RPC)<<") data: "<<is->second<< std::endl;
113 konec 1.8 Pattern::add(vpattern,*is);
114 konec 1.9 // std::cout <<" after vpattern has size: "<<vpattern.size() << std::endl;
115     if (vpattern.size() > 100) break;
116 konec 1.8 }
117 konec 1.6 if (vpattern[0].size() == 0) return candidate;
118 konec 1.8 // std::cout <<" ------------------ END EVENT, NOW COMPARE, has #patterns: "<<vpattern.size()<<" vpattern[0].size="<<vpattern[0].size() << std::endl;
119 konec 1.1
120 konec 1.5 GoldenPattern::Key thisKey(detref, ptref, chargeref, phiref );
121 konec 1.8 // std::cout << thisKey << std::endl;
122 konec 1.1
123     GoldenPattern::Result bestMatching;
124     GoldenPattern::Key bestKey;
125 konec 1.8 for (auto ip=vpattern.begin(); ip!= vpattern.end();++ip) {
126     const Pattern & pattern = *ip;
127     // std::cout << " HAS PATTERN "<<pattern << std::endl;
128 konec 1.1 for (std::map< GoldenPattern::Key, GoldenPattern>::iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
129     // if (!(thisKey==igps->first)) continue;
130     GoldenPattern & gp = igps->second;
131     GoldenPattern::Result result = gp.compare(pattern);
132 konec 1.4 // if (!result.hasRpcDet(637602109) && !result.hasRpcDet(637634877) && !result.hasRpcDet(637599914) && !result.hasRpcDet(637632682)) continue;
133 konec 1.9 // if (!result.hasRpcDet(igps->first.theDet)) continue;
134     // if (result.nMatchedTot() < 5 )continue;
135     // if (!result) continue;
136 konec 1.8 // std::cout <<"PATT KEY: "<<igps->first<<" "<<result ; //<<std::endl;
137 konec 1.5 if (bestMatching < result) {
138 konec 1.1 bestMatching = result;
139     bestKey = igps->first;
140 konec 1.5 // std::cout <<" ----"<<" pt: "<< bestKey.ptValue()<<std::endl;
141     }
142     //else std::cout <<std::endl;
143 konec 1.1 }
144 konec 1.6 }
145 konec 1.5
146 konec 1.2 // std::cout <<" ------------------ END COMPARE: " << std::endl;
147 konec 1.5 // std::cout <<"BEST KEY: "<<bestKey<<" "<< bestMatching<<std::cout <<" ######"<<" pt: "<< bestKey.ptValue()<<std::endl;
148 konec 1.8 // abort();
149 konec 1.1 if (bestMatching) {
150     candidate.pt = bestKey.ptValue();
151     candidate.eta = 1.;
152     candidate.phi = bestKey.phiValue();
153     candidate.q = bestMatching.nMatchedTot();
154     candidate.type = L1Obj::OTF;
155     }
156     return candidate;
157    
158     }
159    
160    
161     void PatternManager::beginJob()
162     {
163     if ( !theConfig.exists("patternInpFile") ) return;
164     std::string patternInpFileName = theConfig.getParameter<std::string>("patternInpFile");
165     TFile patternInpFile( patternInpFileName.c_str());
166     TTree * tree = (TTree*) patternInpFile.Get("FlatPatterns");
167     static ENTRY entry;
168     tree->SetBranchAddress("entry",&entry);
169     Int_t nentries = (Int_t) tree->GetEntries();
170     for (Int_t i=0; i<nentries; i++) {
171     tree->GetEntry(i);
172     GoldenPattern::Key key;
173     key.theDet = entry.key_det;
174     key.thePtCode = entry.key_pt;
175     key.thePhiCode = entry.key_phi;
176     key.theCharge = entry.key_ch;
177     GoldenPattern::PosBenCase pat_Case = static_cast<GoldenPattern::PosBenCase>(entry.pat_Case);
178     if (theGPs.find(key)==theGPs.end()) theGPs[key]=GoldenPattern(key);
179     theGPs[key].add(pat_Case, entry.patDet, entry.posOrBend, entry.freq);
180     }
181     delete tree;
182     patternInpFile.Close();
183     }
184    
185     void PatternManager::endJob()
186     {
187     for (std::map< GoldenPattern::Key, GoldenPattern>::iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
188     GoldenPattern & gp = igps->second;
189     gp.purge();
190     }
191    
192     if ( !theConfig.exists("patternOutFile") ) return;
193     std::string patternOutFileName = theConfig.getParameter<std::string>("patternOutFile");
194     TFile patternOutFile( patternOutFileName.c_str(),"RECREATE");
195    
196     static ENTRY entry;
197     TTree *tree = new TTree("FlatPatterns","FlatPatterns");
198     tree->Branch("entry",&entry,"key_det/i:key_pt/i:key_phi/i:key_ch/I:pat_Case/i:patDet/i:posOrBend/I:freq/i");
199    
200     for (std::map< GoldenPattern::Key, GoldenPattern>::const_iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
201     const GoldenPattern & gp = igps->second;
202     entry.key_det = gp.theKey.theDet;
203     entry.key_pt = gp.theKey.thePtCode;
204     entry.key_phi = gp.theKey.thePhiCode;
205     entry.key_ch = gp.theKey.theCharge;
206     for (unsigned int iCase =1; iCase <=5; ++iCase) {
207     entry.pat_Case = iCase;
208     const GoldenPattern::DetFreq * detFreq = 0;
209     if (iCase==GoldenPattern::POSRPC) detFreq = &gp.posRpc;
210     if (iCase==GoldenPattern::POSCSC) detFreq = &gp.posCsc;
211     if (iCase==GoldenPattern::BENCSC) detFreq = &gp.bendingCsc;
212     if (iCase==GoldenPattern::POSDT ) detFreq = &gp.posDt;
213     if (iCase==GoldenPattern::BENDT ) detFreq = &gp.bendingDt;
214     for (GoldenPattern::DetFreq::const_iterator idf = detFreq->begin(); idf != detFreq->end(); idf++) {
215     entry.patDet = idf->first;
216     for (GoldenPattern::MFreq::const_iterator imf = idf->second.begin(); imf != idf->second.end(); imf++) {
217     entry.posOrBend = imf->first;
218     entry.freq = imf->second;
219     tree->Fill();
220     }
221     }
222     }
223     }
224     patternOutFile.Write();
225     patternOutFile.Close();
226     // delete tree;
227     }
228