StRoot  1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
L2wEemc2012.h
1 #ifndef L2wEemc2012_H
2 #define L2wEemc2012_H
3 /*********************************************************************
4  * $Id: L2wEemc2012.h,v 1.4 2012/03/23 20:12:11 balewski Exp $
5  * \author Jan Balewski, MIT, 2008
6  *********************************************************************
7  * Descripion:
8  * example algo finding list of 2x2 BTOW clusters based on ET-seed list produced by L2-btow-calib algo
9  * features: uses 2D array (ieta vs. iphi )
10  * Limitations:
11  * - ignores seeds at the edges
12  * - double processing for neighbours seeds
13  *********************************************************************
14  */
15 
16 #ifdef IS_REAL_L2 //in l2-ana environment
17  #include "L2VirtualAlgo2012.h"
18 #else
19  #include "StTriggerUtilities/L2Emulator/L2algoUtil/L2VirtualAlgo2012.h"
20 #endif
21 
22 class L2Histo;
23 class L2EmcGeom2012;
24 
26  unsigned char trigger; // bit0=rnd, bit1=ET>thr
27  unsigned char highestEt; // cluster Et with 60Gev Max. bits=Et*256/60
28  unsigned short highestRDO;
29 };
30 
32  private:
33 
34  //..................... params set in initRun
35  int par_dbg;
36  float par_EtThresh;
37 
38  //............... preserved for Decision(),
39  L2weResult2012 resultBlob[L2eventStream2012::mxToken];
40 
41  // utility methods
42  void createHisto();
43 
44  public:
45  L2wEemc2012(const char* name,const char *uid, L2EmcDb2012* db, L2EmcGeom2012 *geo, char* outDir, int resOff);
46  int initRunUser( int runNo, int *rc_ints, float *rc_floats);
47  void finishRunUser();// at the end of each run
48  void computeUser(int token);
49  bool decisionUser(int token, int *myL2Result);
50 };
51 
52 #endif
53 
54 /**********************************************************************
55  $Log: L2wEemc2012.h,v $
56  Revision 1.4 2012/03/23 20:12:11 balewski
57  changes are to write a L2weResult to the L2Result array so we can differentiate random and real accepts, and update the plots so we can have some monitoring,no intended changes to the actual algo
58 
59  Revision 1.3 2011/10/19 16:12:12 jml
60  more 2012 stuff
61 
62  Revision 1.2 2011/10/19 15:39:45 jml
63  2012
64 
65  Revision 1.1 2011/10/18 15:11:45 jml
66  adding 2012 algorithms
67 
68  Revision 1.1 2009/03/28 19:43:53 balewski
69  2009 code
70 
71 
72 
73 */
74