oh dear, just the (too many!) histogram variables (we will need these for the test and reference, so these should go inside test, and ref structs like the TrackParaters etc More...

Collaboration diagram for IDTPM2::SiHitPlots::Histograms:

Public Types
enum	HitPar { NHitPars }
	ugly, but it gets the jobs done - this is the price you pay for have SO MANY STUPIDLY LONG NAMED PARAMETERS ... More...

Public Member Functions
size_t	nHitParNames () const
const std::string &	hitParName (int i) const
void	initialize (SiHitPlots *p, const std::string &s="")
void	fill (const TrackView *t) const

Public Attributes
std::vector< std::string >	m_hitParNames
	probably should use an std::array<string,NparNames>
TIDA::Histogram< float >	m_hits [NHitPars]
	actual stored histograms
TIDA::Histogram< float >	m_hits_vs_pt [NHitPars]
	for theis "2D" histograms, could use yet another enum, and some parname vector, but prefer to keep it explicit for a low number of entries std::string m_parName[4] = { "pt", "eta", "phi", "d0" };
TIDA::Histogram< float >	m_hits_vs_eta [NHitPars]
TIDA::Histogram< float >	m_hits_vs_phi [NHitPars]
TIDA::Histogram< float >	m_hits_vs_d0 [NHitPars]

Detailed Description

oh dear, just the (too many!) histogram variables (we will need these for the test and reference, so these should go inside test, and ref structs like the TrackParaters etc

can esily add histograms vs mu if required

Definition at line 93 of file SiHitPlots.h.

Member Enumeration Documentation

◆ HitPar

enum IDTPM2::SiHitPlots::Histograms::HitPar

ugly, but it gets the jobs done - this is the price you pay for have SO MANY STUPIDLY LONG NAMED PARAMETERS ...

if we want them all with proper names, rather than just filling histograms with numbers ...

Enumerator
NHitPars

Definition at line 101 of file SiHitPlots.h.

                {
#      define X(x) x,
       HIT_PARAMS(X)
#      undef X
       NHitPars
    };

Member Function Documentation

◆ fill()

void IDTPM2::SiHitPlots::Histograms::fill ( const TrackView * t ) const

need a mechanism to get the TrackParticle from say an xAOD::Electron say by an or of t.is<xAOD::TrackParticle>() || ( t.hashChild() && t.child(0).is<sADO::TrackParticle>() )

actually, if we are using the TrackTracks access we don't need to test if it is a TrackParticle

there are far, far too many "hit type" parameters on the tracks, the bloated tracks classes with the ludicrously long names are really not nice and do not lead to nice code ...

I mean 28 !!! how mamny layers might a track go through ? with a max os say 20 layers it would be more efficient storing a status for each layer - so for each layer you could could have a number or bits - hit | hole | ... then you could store say 1 uint8_t per layer rather than all these individual (28) uint8_t counters for all the variables. or just store the hit patterns and let people work out what they wanted themselves. With all this bloat, no wonder the tracks are so large

Compute hit parameters

Definition at line 57 of file SiHitPlots.cxx.

                                                                 {
  
  //  const xAOD::TrackParticle* tp = t->as<xAOD::TrackParticle>();
 
  //  if ( !tp ) return; /// no point trying to fill anything unless it's an xAOD::TrackParticle 
  
 
  // can add the rest of these histgrams as and when we need to ...
  std::array<float,NHitPars> hitP = {};
 
#if 1
  hitP[NInnerMostPixelHits]                   = t->nPixelsInner();
  hitP[NInnerMostPixelEndcapHits]             = t->nPixelsInnerEndcap();
  //  hitP[NNextToInnerMostPixelHits]         = t->nNextToInnerMostPixelHits();
  //  hitP[NNextToInnerMostPixelEndcapHits]   = t->nNextToInnerMostPixelEndcapHits();
  hitP[NInnerMostPixelSharedHits]             = t->nPixelsInnerShared();
  hitP[NInnerMostPixelSharedEndcapHits]       = t->nPixelsInnerSharedEndcap();
  hitP[NPixelHits]                            = t->nPixels();
  hitP[NPixelHoles]                           = t->nPixelHoles();
  hitP[NPixelSharedHits]                      = t->nPixelsShared();
  //  hitP[PixeldEdx]                         = t->pixeldEdx();
  hitP[NSCTHits]                              = t->nSCT();
  hitP[NSCTHoles]                             = t->nSCTHoles(); 
  hitP[NSCTSharedHits]                        = t->nSCTShared();
 
  //  hitP[NInnerMostPixelOutliers]           = t->nPixelsInnerOutliers();
  //  hitP[NInnerMostPixelEndcapOutliers]     = t->nPixelsInnerEndcapOutliers();
  //  hitP[NInnerMostPixelSplitHits]          = t->nPixelsInnerSplit();
  //  hitP[NInnerMostPixelSplitEndcapHits]    = t->nPixelsEndcapSplit();
  
  //  hitP[NExpectedInnerMostPixelHits]       = t->nExpectedInnerMostPixelHits();
  //  hitP[NExpectedNextToInnerMostPixelHits] = t->nExpectedNextToInnerMostPixelHits();
 
  //  hitP[NPixelOutliers]                    = t->nPixelOutliers();
  //  hitP[NPixelContribLayers]               = t->nPixelContribLayers();
  //  hitP[NPixelSplitHits]                   = t->nPixelsSplit();
  //  hitP[NPixelGangedHits]                  = t->nPixelsGanged();
  //  hitP[NPixelGangedHitsFlaggedFakes]      = t->nPixelGangedHitsFlaggedFakes();
  //  hitP[NPixelDeadSensors]                 = t->nPixelDeadSensors();
  //  hitP[NSCTOutliers]                      = t->nSCTOutliers();
  //  hitP[NSCTDoubleHoles]                   = t->nSCTDoubleHoles();
  //  hitP[NSCTDeadSensors]                   = t->nSCTDeadSensors();
  
#else
  hitP[NInnerMostPixelHits]               = t->nInnerMostPixelHits();
  hitP[NInnerMostPixelEndcapHits]         = t->nInnerMostPixelEndcapHits();
  hitP[NNextToInnerMostPixelHits]         = t->nNextToInnerMostPixelHits();
  hitP[NNextToInnerMostPixelEndcapHits]   = t->nNextToInnerMostPixelEndcapHits();
  hitP[NInnerMostPixelSharedHits]         = t->nInnerMostPixelSharedHits();
  hitP[NInnerMostPixelSharedEndcapHits]   = t->nInnerMostPixelSharedEndcapHits();
  hitP[NPixelHits]                        = t->nPixelHits();
  hitP[NPixelHoles]                       = t->nPixelHoles();
  hitP[NPixelSharedHits]                  = t->nPixelSharedHits();
  hitP[PixeldEdx]                         = t->pixeldEdx();
  hitP[NSCTHits]                          = t->nSCTHits();
  hitP[NSCTHoles]                         = t->nSCTHoles(); 
  hitP[NSCTSharedHits]                    = t->nSCTSharedHits();
  hitP[NInnerMostPixelOutliers]           = t->nInnerMostPixelOutliers();
  hitP[NInnerMostPixelEndcapOutliers]     = t->nInnerMostPixelEndcapOutliers();
  hitP[NInnerMostPixelSplitHits]          = t->nInnerMostPixelSplitHits();
  hitP[NInnerMostPixelSplitEndcapHits]    = t->nInnerMostPixelSplitEndcapHits();
  hitP[NExpectedInnerMostPixelHits]       = t->nExpectedInnerMostPixelHits();
  hitP[NExpectedNextToInnerMostPixelHits] = t->nExpectedNextToInnerMostPixelHits();
  hitP[NPixelOutliers]                    = t->nPixelOutliers();
  hitP[NPixelContribLayers]               = t->nPixelContribLayers();
  hitP[NPixelSplitHits]                   = t->nPixelSplitHits();
  hitP[NPixelGangedHits]                  = t->nPixelGangedHits();
  hitP[NPixelGangedHitsFlaggedFakes]      = t->nPixelGangedHitsFlaggedFakes();
  hitP[NPixelDeadSensors]                 = t->nPixelDeadSensors();
  hitP[NSCTOutliers]                      = t->nSCTOutliers();
  hitP[NSCTDoubleHoles]                   = t->nSCTDoubleHoles();
  hitP[NSCTDeadSensors]                   = t->nSCTDeadSensors();
#endif
 
  float pt  = std::fabs(t->pt())*0.001;
  float eta = t->eta();
  float phi = t->phi();
  float d0  = t->d0();
 
  //  std::cout << "SiHits: track: " << *t << std::endl; 
 
  static const std::array<bool,NHitPars> proc = { true, true, false, false, true, true, true, true, true, false, true, true, true };
  
  for ( int i=0 ; i<NHitPars ; i++ ) {
 
    if ( !proc[i] ) continue;
    
    //    std::cout << "\tfill par; " << hitParName(i) << "\t: " << hitP[i] << std::endl;
    
    m_hits[i].Fill( hitP[i] );
 
    m_hits_vs_pt[i].Fill(  pt,  hitP[i] );
    m_hits_vs_eta[i].Fill( eta, hitP[i] );
    m_hits_vs_phi[i].Fill( phi, hitP[i] );
    m_hits_vs_d0[i].Fill(  d0,  hitP[i] );
  }
 
}

◆ hitParName()

const std::string & IDTPM2::SiHitPlots::Histograms::hitParName ( int i ) const

inline

Definition at line 117 of file SiHitPlots.h.

117{ return m_hitParNames.at(i); }

IDTPM2::SiHitPlots::Histograms::m_hitParNames

std::vector< std::string > m_hitParNames

probably should use an std::array<string,NparNames>

Definition SiHitPlots.h:109

◆ initialize()

void IDTPM2::SiHitPlots::Histograms::initialize	(	SiHitPlots *	p,
		const std::string &	s = "" )

should use Resplots for these really, as profiles are affected by outlyera...

Definition at line 35 of file SiHitPlots.cxx.

                                                                               {
 
  static const std::array<bool,NHitPars> proc = { true, true, false, false, true, true, true, true, true, false, true, true, true };
  
  for ( size_t i=0 ; i<nHitParNames() ; i++ ) {
 
    if ( !proc[i] ) continue;
    
    m_hits[i] = TIDA::Histogram<float>( p->monTool(), hitParName(i), s );
  
    m_hits_vs_pt[i]  = TIDA::Histogram<float>( p->monTool(), hitParName(i)+"_vs_pt",  s );
    m_hits_vs_eta[i] = TIDA::Histogram<float>( p->monTool(), hitParName(i)+"_vs_eta", s );
    m_hits_vs_phi[i] = TIDA::Histogram<float>( p->monTool(), hitParName(i)+"_vs_phi", s );
    m_hits_vs_d0[i]  = TIDA::Histogram<float>( p->monTool(), hitParName(i)+"_vs_d0",  s );
 
  }
  
}

◆ nHitParNames()

size_t IDTPM2::SiHitPlots::Histograms::nHitParNames ( ) const

inline

Definition at line 115 of file SiHitPlots.h.

115{ return m_hitParNames.size(); }

Member Data Documentation

◆ m_hitParNames

std::vector<std::string> IDTPM2::SiHitPlots::Histograms::m_hitParNames

Initial value:

                              = {
#     define X(x)    
 
 
    }

probably should use an std::array<string,NparNames>

Definition at line 109 of file SiHitPlots.h.

                                       {
#     define X(x) #x,
      HIT_PARAMS(X)
#     undef X
    };

◆ m_hits

TIDA::Histogram<float> IDTPM2::SiHitPlots::Histograms::m_hits[NHitPars]

actual stored histograms

Definition at line 126 of file SiHitPlots.h.

◆ m_hits_vs_d0

TIDA::Histogram<float> IDTPM2::SiHitPlots::Histograms::m_hits_vs_d0[NHitPars]

Definition at line 136 of file SiHitPlots.h.

◆ m_hits_vs_eta

TIDA::Histogram<float> IDTPM2::SiHitPlots::Histograms::m_hits_vs_eta[NHitPars]

Definition at line 134 of file SiHitPlots.h.

◆ m_hits_vs_phi

TIDA::Histogram<float> IDTPM2::SiHitPlots::Histograms::m_hits_vs_phi[NHitPars]

Definition at line 135 of file SiHitPlots.h.

◆ m_hits_vs_pt

TIDA::Histogram<float> IDTPM2::SiHitPlots::Histograms::m_hits_vs_pt[NHitPars]

for theis "2D" histograms, could use yet another enum, and some parname vector, but prefer to keep it explicit for a low number of entries std::string m_parName[4] = { "pt", "eta", "phi", "d0" };

Definition at line 133 of file SiHitPlots.h.

The documentation for this struct was generated from the following files:

Public Types

Public Member Functions

Public Attributes