DataStruct/interface/SimpleLepton.h

#ifndef SIMPLE_LEPTON
#define SIMPLE_LEPTON

#include <iostream>
#include <iomanip>
#include "TROOT.h"
#include "TBits.h"
#include "TLorentzVector.h"
#include "SelectionStatus.h"

class SimpleLepton { 
 public : 

  SimpleLepton() { 
    //    vec = new TLorentzVector();
    //    vecorig = new TLorentzVector();
  }

  ~SimpleLepton() { 
    //    vec->Delete();
    //    vecorig->Delete();
    //    delete(vec);
    //    delete(vecorig);
  };

  int type, index, charge;
  unsigned scID;
  double ip3dSig;
  float d0,dz;
  bool is4l, isEB, isTight, isLoose, tightCutsApplied, fsrRecoveryAttempted;

  TLorentzVector  vec;

  SelectionStatus status; 
  
  inline void print() { 
    std::cout << 
      "type: "  << std::left << std::setw(3)  << type     << "  "  
      "pt: "    << std::left << std::setw(7) << vec.Pt()  << "  "
      "eta: "   << std::left << std::setw(8) << vec.Eta() << "  "
      "phi: "   << std::left << std::setw(8) << vec.Phi() << "  "
      "index: " << std::left << std::setw(3)  << index  << std::endl;
  }
  static bool lep_pt_sort( const SimpleLepton &l1,  const SimpleLepton &l2 ) { 
    if( l1.vec.Pt() > l2.vec.Pt() ) return true;
                else return false;
  };
  static bool lep_reversept_sort( const SimpleLepton &l1,  const SimpleLepton &l2 ) { 
    if( l1.vec.Pt() < l2.vec.Pt() ) return true;
                else return false;
  };

};

#endif
Revision:	1.9
Committed:	Tue Oct 23 10:17:23 2012 UTC (12 years, 6 months ago) by dkralph
Content type:	text/plain
Branch:	MAIN
CVS Tags:	compiled
Changes since 1.8:	+10 -17 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	khahn	1.1	#ifndef SIMPLE_LEPTON
2			#define SIMPLE_LEPTON
3
4	khahn	1.4	#include <iostream>
5	dkralph	1.9	#include <iomanip>
6	khahn	1.1	#include "TROOT.h"
7	dkralph	1.7	#include "TBits.h"
8	khahn	1.1	#include "TLorentzVector.h"
9	khahn	1.4	#include "SelectionStatus.h"
10	anlevin	1.2
11	khahn	1.1	class SimpleLepton {
12			public :
13
14			SimpleLepton() {
15	khahn	1.4	// vec = new TLorentzVector();
16			// vecorig = new TLorentzVector();
17	khahn	1.1	}
18
19			~SimpleLepton() {
20			// vec->Delete();
21			// vecorig->Delete();
22			// delete(vec);
23			// delete(vecorig);
24			};
25
26			int type, index, charge;
27	dkralph	1.9	unsigned scID;
28	khahn	1.1	double ip3dSig;
29	dkralph	1.9	float d0,dz;
30			bool is4l, isEB, isTight, isLoose, tightCutsApplied, fsrRecoveryAttempted;
31
32	khahn	1.4	TLorentzVector vec;
33	khahn	1.5
34	khahn	1.4	SelectionStatus status;
35	khahn	1.1
36	khahn	1.6	inline void print() {
37			std::cout <<
38	dkralph	1.9	"type: " << std::left << std::setw(3) << type << " "
39			"pt: " << std::left << std::setw(7) << vec.Pt() << " "
40			"eta: " << std::left << std::setw(8) << vec.Eta() << " "
41			"phi: " << std::left << std::setw(8) << vec.Phi() << " "
42			"index: " << std::left << std::setw(3) << index << std::endl;
43	khahn	1.3	}
44	khahn	1.1	static bool lep_pt_sort( const SimpleLepton &l1, const SimpleLepton &l2 ) {
45	khahn	1.4	if( l1.vec.Pt() > l2.vec.Pt() ) return true;
46	anlevin	1.2	else return false;
47	khahn	1.1	};
48	khahn	1.6	static bool lep_reversept_sort( const SimpleLepton &l1, const SimpleLepton &l2 ) {
49			if( l1.vec.Pt() < l2.vec.Pt() ) return true;
50			else return false;
51			};
52	khahn	1.1
53			};
54
55			#endif