TrigZFinderInternal.h

Go to the documentation of this file.

// emacs: this is -*- c++ -*-
 
/*
  Copyright (C) 2002-2024 CERN for the benefit of the ATLAS collaboration
*/
 
//
// filename: TrigZFinderInternal.h
// 
// author: Nikos Konstantinidis <n.konstantinidis@ucl.ac.uk>
//         
//       
// Description: NON ATHENA Internals for the ZFinder primary z vertex finding AlgTool 
// 
// -------------------------------
// ATLAS Collaboration
 
 
#ifndef TRIGZFINDERINTERNAL_H
#define TRIGZFINDERINTERNAL_H
 
#include <cmath>
#include <vector>
#include <string>
 
#include "ZFinderConstants.h"
#include "IRegionSelector/IRoiDescriptor.h"
#include "TrigInDetEvent/TrigSiSpacePointBase.h"
 
 
 
class TrigZFinderInternal {
 
public: 
 
    struct vertex { 
      vertex( double z, double weight ) : _z(z), _weight(weight) { } 
      double _z;
      double _weight;
    };
 
public:
 
    TrigZFinderInternal( const std::string&, const std::string& );
    virtual ~TrigZFinderInternal(){};
    //  void initializeInternal(long maxLayers=20, long lastBarrel=7); 
    void initializeInternal(long maxLayers, long lastBarrel); 
 
    std::vector<vertex>* findZInternal( const std::vector< TrigSiSpacePointBase >& spVec, 
                    const IRoiDescriptor& roi ) const;
 
    void setLayers(long maxLayers, long lastBarrelLayer) {
      m_IdScan_MaxNumLayers = maxLayers;        // dphiEC depends on this value
      m_IdScan_LastBrlLayer = lastBarrelLayer;  // dphiBrl depends on this value
    } 
 
protected:  // member functions
 
    const std::string& getType() const { return m_type; }
    const std::string& getName() const { return m_name; }
 
 
    // fills phi, rho, z, layer of spacepoints to simple vectors
 
    long fillVectors( const std::vector<TrigSiSpacePointBase>& spVec, 
              const IRoiDescriptor& roi,
              std::vector<double>& phi, 
              std::vector<double>& rho, 
              std::vector<double>& zed, 
              std::vector<long>&   lyr, 
              std::vector<long>&   filledLayers,
              long& numPhiSlices ) const;
 
 
    double computeZV(double r1, double z1, double r2, double z2) const;
    double computeZV(double r1, double p1, double z1, double r2, double p2, double z2) const;
 
 
protected:  // data members
 
    long   m_IdScan_MaxNumLayers; 
    long   m_IdScan_LastBrlLayer; 
 
 
    // To be read in from jobOptions by IdScanMain
 
    double m_invPhiSliceSize = 0.0;     // the inverse size of the phi slices 
    long   m_NumPhiSlices = 0L;        // the number of phi slices, given the width of the RoI 
 
    double m_phiBinSize;          // the size of the phi slices 
    bool   m_forcePhiBinSize = false;     // respect the config of phi bin even if below reasonable threshold
    double m_usedphiBinSize;      // the size of the phi slices 
    double m_ROIphiWidth;         // the phi width of the ROI 
    double m_minZBinSize;         // z-histo bin size: m_minZBinSize+|etaRoI|*m_zBinSizeEtaCoeff (to account for worse resolution in high eta)
    double m_zBinSizeEtaCoeff;    // z-histo bin size: m_minZBinSize+|etaRoI|*m_zBinSizeEtaCoeff (to account for worse resolution in high eta)
 
    long   m_numberOfPeaks;       // how many z-positions to return in findZ
 
    bool   m_pixOnly;             // use only Pixel space points
 
    std::string m_type;  // type information for internal book keeping
    std::string m_name;  // name information for the same
 
 
    bool m_chargeAware ;  // maintain separate sets of z histos for + & - tracks
    bool m_zHistoPerPhi;  // maintain one set of z histos per each phi slice
 
    double m_dphideta; // how, as a function of eta, the number of phi neighbours decreases
    double m_neighborMultiplier; // extra factor to manually increase the number of phi neighbors
 
    std::vector< std::vector<long> > m_extraPhi; // ( IdScan_MaxNumLayers, std::vector<long>(IdScan_MaxNumLayers) ); // number of phi neighbours to look at
 
 
    int m_nFirstLayers;    // When the pairs of SPs are made, the inner SP comes from up to this "filled layer"
 
    double m_vrtxDistCut;  // The minimum fractional distance between two output vertices
    double m_vrtxMixing ;  // If two vertices are found to be too close, "mix" the second into first
    int m_nvrtxSeparation; // The minimum number of zbins that any two output vertices should by separated by
    bool m_preferCentralZ; // Among peaks of same height, should precedence go to the one with smaller |z|
 
    bool m_trustSPprovider; // Should we re-extract the RoI phi range from the phis of the SPs from the SPP
 
    double m_returnval = 0.0; // return value for algorithm
 
    bool   m_fullScanMode;
 
    int m_tripletMode;
    double m_tripletDZ;
    double m_tripletDK;
    double m_halfTripletDK; // replaces m_tripletDK internally to avoid unnecessary multiplication by 2 in curvature calculation, without changing the interface
    double m_tripletDP;
 
    int    m_maxLayer;
 
    double m_minVtxSignificance;
    double m_percentile;
 
 
 
    double  m_weightThreshold;
 
    std::vector<int> m_new2old; //transform table for new layer numbering scheme
 
};
 
 
#endif