L1RpcTriggerAnalysis/src/PatternManager.cc

#include "UserCode/L1RpcTriggerAnalysis/interface/PatternManager.h"

#include "UserCode/L1RpcTriggerAnalysis/interface/EventObj.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/TrackObj.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/HitSpecObj.h"

#include "UserCode/L1RpcTriggerAnalysis/interface/RPCDetIdUtil.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/DTphDigiSpec.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/CSCDigiSpec.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/RPCDigiSpec.h"

#include "UserCode/L1RpcTriggerAnalysis/interface/Pattern.h"
#include "UserCode/L1RpcTriggerAnalysis/interface/GoldenPattern.h"

#include "TFile.h"
#include "TTree.h"

namespace {
  typedef struct {
    UInt_t key_det;
    unsigned int key_pt;
    unsigned int key_phi;
    int key_ch;
    unsigned int pat_Case;
    UInt_t patDet;
    int posOrBend;
    unsigned int freq; 
  } ENTRY;
}

PatternManager::PatternManager(const edm::ParameterSet &cfg) 
  : theConfig(cfg), theEvForPatCounter(0), theEvUsePatCounter(0) 

{}

PatternManager::~PatternManager()
{
  std::cout <<" Events checked for pattenrs:    " << theEvForPatCounter << std::endl;
  std::cout <<" Events used    for pattenrs:    " << theEvUsePatCounter << std::endl;
  std::cout <<" Size of GoldenPatterns:         " << theGPs.size() << std::endl;
  if (theConfig.getUntrackedParameter<bool>("dump",false)) {
  for (std::map< GoldenPattern::Key, GoldenPattern>::const_iterator 
      im = theGPs.begin(); im!= theGPs.end(); ++im) {
    std::cout <<" GP: "<< (*im).second << std::endl;
  }
  }

}

void PatternManager::run(const EventObj* ev, const TrackObj * simu, const HitSpecObj * hitSpec,  const VDigiSpec & vDigi)
{
  if (!hitSpec) return;
  if (hitSpec->rawId() == 0 ) return;
  double phiref = hitSpec->position().phi();
  double ptref  = simu->pt(); 
  int    chargeref = simu->charge();
  unsigned int detref =  hitSpec->rawId();
/*
  if (detref != 637602109 && detref != 637634877 &&
      detref != 637599914 && detref != 637632682 ) return;

  bool precisePos = ( fabs(hitSpec->position().phi()-1.025) < 0.001);
  if (!precisePos) return;
  if ( simu->pt() < 16.) return;
*/


  GoldenPattern::Key key( detref, ptref, chargeref, phiref);

  Pattern pattern;
  theEvForPatCounter++;
  for (VDigiSpec::const_iterator is= vDigi.begin(); is!=vDigi.end(); is++) {
    bool isOK = pattern.add(*is); 
    if (!isOK) return;
  }
  if (pattern.size() == 0) return; 
  theEvUsePatCounter++;

  if (theGPs.find(key)==theGPs.end()) theGPs[key]=GoldenPattern(key); 
  theGPs[key].add(pattern);

}

L1Obj PatternManager::check(const EventObj* ev, const TrackObj * simu, const HitSpecObj * hitSpec,  const VDigiSpec & vDigi)
{
  L1Obj candidate;
  if (!hitSpec) return candidate;
  if (hitSpec->rawId() == 0 ) return candidate;
  double phiref = hitSpec->position().phi();
  double ptref  = simu->pt();
  int    chargeref = simu->charge();
  unsigned int detref =  hitSpec->rawId();
/*
  if (detref != 637602109 && detref != 637634877 &&
      detref != 637599914 && detref != 637632682 ) return candidate;

  bool precisePos = ( fabs(hitSpec->position().phi()-1.025) < 0.001);
  if (!precisePos) return candidate;
  if ( simu->pt() < 26. || simu->pt() > 27.  ) return candidate;

*/
//  std::cout <<" ------------------ EVENT: " << std::endl;
  std::vector<Pattern> vpattern(1);
  theEvForPatCounter++;
  for (VDigiSpec::const_iterator is= vDigi.begin(); is!=vDigi.end(); is++)  Pattern::add(vpattern,*is);
  if (vpattern[0].size() == 0) return candidate;
//  std::cout <<" ------------------ END EVENT, COMPARE" << std::endl;

  GoldenPattern::Key thisKey(detref, ptref, chargeref, phiref );
//  std::cout << thisKey <<" PATTENR_SIZE: "<<pattern.size()<< std::endl;

  GoldenPattern::Result bestMatching;
  GoldenPattern::Key    bestKey;
  for (std::map< GoldenPattern::Key, GoldenPattern>::iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
  for (auto ip=vpattern.begin(); ip!= vpattern.end();++ip) {
    const Pattern & pattern = *ip;
//    if (!(thisKey==igps->first)) continue;
//    std::cout << " HAS PATTERN "<<pattern << std::endl;
    GoldenPattern & gp = igps->second;
    GoldenPattern::Result result = gp.compare(pattern);
//    if (!result.hasRpcDet(637602109) && !result.hasRpcDet(637634877) && !result.hasRpcDet(637599914) && !result.hasRpcDet(637632682)) continue;
 //   if (!result.hasRpcDet(igps->first.theDet)) continue;
 //   if (result.nMatchedTot() < 5 )continue; 
 //   if (!result) continue;
 //    std::cout <<"PATT KEY: "<<igps->first<<" "<<result<<" is Less: "<<(result<bestMatching)<<" isBetter: "<<(result>bestMatching)<<" isBerres: "<<(bestMatching<result)  ; //<<std::endl;
    if (bestMatching < result) {
      bestMatching = result;
      bestKey =  igps->first;
//      std::cout <<" ----"<<" pt: "<< bestKey.ptValue()<<std::endl; 
    } 
//else std::cout <<std::endl;
  }
  }

//  std::cout <<" ------------------ END COMPARE: " << std::endl;
//  std::cout <<"BEST KEY: "<<bestKey<<" "<< bestMatching<<std::cout <<" ######"<<" pt: "<< bestKey.ptValue()<<std::endl;
  if (bestMatching) {
    candidate.pt = bestKey.ptValue();
    candidate.eta = 1.;
    candidate.phi = bestKey.phiValue();
    candidate.q   = bestMatching.nMatchedTot();
    candidate.type = L1Obj::OTF;
  }
  return candidate;

}


void PatternManager::beginJob()
{
  if ( !theConfig.exists("patternInpFile") ) return;
  std::string patternInpFileName = theConfig.getParameter<std::string>("patternInpFile");
  TFile patternInpFile( patternInpFileName.c_str());
  TTree * tree = (TTree*) patternInpFile.Get("FlatPatterns");
  static ENTRY entry;
  tree->SetBranchAddress("entry",&entry); 
  Int_t nentries = (Int_t) tree->GetEntries();
  for (Int_t i=0; i<nentries; i++) {
    tree->GetEntry(i);
    GoldenPattern::Key key;
    key.theDet =     entry.key_det;
    key.thePtCode =  entry.key_pt;
    key.thePhiCode = entry.key_phi;
    key.theCharge =  entry.key_ch;
    GoldenPattern::PosBenCase pat_Case = static_cast<GoldenPattern::PosBenCase>(entry.pat_Case);
    if (theGPs.find(key)==theGPs.end()) theGPs[key]=GoldenPattern(key); 
    theGPs[key].add(pat_Case, entry.patDet, entry.posOrBend, entry.freq);
  }
  delete tree;
  patternInpFile.Close();
}

void PatternManager::endJob()
{
  for (std::map< GoldenPattern::Key, GoldenPattern>::iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
    GoldenPattern & gp = igps->second;
    gp.purge();
  }

  if ( !theConfig.exists("patternOutFile") ) return;
  std::string patternOutFileName = theConfig.getParameter<std::string>("patternOutFile");
  TFile patternOutFile( patternOutFileName.c_str(),"RECREATE"); 

  static ENTRY entry;
  TTree *tree = new TTree("FlatPatterns","FlatPatterns");
  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");

  for (std::map< GoldenPattern::Key, GoldenPattern>::const_iterator igps = theGPs.begin(); igps != theGPs.end(); igps++) {
    const GoldenPattern & gp = igps->second; 
    entry.key_det =  gp.theKey.theDet;
    entry.key_pt =  gp.theKey.thePtCode;
    entry.key_phi =  gp.theKey.thePhiCode;
    entry.key_ch =  gp.theKey.theCharge;
    for (unsigned int iCase =1; iCase <=5; ++iCase) {
      entry.pat_Case = iCase; 
      const GoldenPattern::DetFreq * detFreq = 0;
      if (iCase==GoldenPattern::POSRPC) detFreq = &gp.posRpc;
      if (iCase==GoldenPattern::POSCSC) detFreq = &gp.posCsc;
      if (iCase==GoldenPattern::BENCSC) detFreq = &gp.bendingCsc;
      if (iCase==GoldenPattern::POSDT ) detFreq = &gp.posDt;
      if (iCase==GoldenPattern::BENDT ) detFreq = &gp.bendingDt;
      for (GoldenPattern::DetFreq::const_iterator idf = detFreq->begin(); idf != detFreq->end(); idf++) {
        entry.patDet = idf->first;
        for (GoldenPattern::MFreq::const_iterator imf = idf->second.begin(); imf != idf->second.end(); imf++) {
          entry.posOrBend = imf->first;
          entry.freq = imf->second; 
          tree->Fill();
        }
      }
    }
  } 
  patternOutFile.Write();
  patternOutFile.Close();
//  delete tree;
}

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