Prompt::VertexIterativeFitMergingTool Class Reference

#include <VertexIterativeFitMergingTool.h>

Inheritance diagram for Prompt::VertexIterativeFitMergingTool:

Collaboration diagram for Prompt::VertexIterativeFitMergingTool:

Public Member Functions
	VertexIterativeFitMergingTool (const std::string &name, const std::string &type, const IInterface *parent)
virtual StatusCode	initialize () override
virtual MergeResultNotOwner	mergeInitVertices (const EventContext &ctx, const FittingInput &input, const xAOD::TrackParticle *tracklep, std::vector< std::unique_ptr< xAOD::Vertex > > &initVtxs, const std::vector< const xAOD::TrackParticle * > &selectedTracks) override
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
	DeclareInterfaceID (Prompt::IVertexMergingTool, 1, 0)

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
bool	mergeIteratively2TrackVtxs (const EventContext &ctx, const FittingInput &input, std::vector< std::unique_ptr< xAOD::Vertex > > &initVtxs, MergeResultNotOwner &result, const VtxType vtxType)
void	getNewMergedVertex (const EventContext &ctx, xAOD::Vertex *seedVtx, std::unique_ptr< xAOD::Vertex > &newMergedVtx, const FittingInput &input, std::vector< TwoTrackVtx >::iterator &currVit, std::vector< TwoTrackVtx > &vtxs2Track, const VtxType vtxType)
xAOD::Vertex *	fitSeedVertexCluster (const EventContext &ctx, const FittingInput &input, xAOD::Vertex *seedVtx, const VtxType vtxType, std::vector< TwoTrackVtx > &others)
xAOD::Vertex *	fitSeedVertexCluster (const EventContext &ctx, const FittingInput &input, std::unique_ptr< xAOD::Vertex > &seedVtx, const VtxType vtxType, std::vector< TwoTrackVtx > &others)
std::unique_ptr< xAOD::Vertex >	fitSeedPlusOtherVertex (const EventContext &ctx, const FittingInput &input, const xAOD::Vertex *seedVtx, const xAOD::Vertex *otherVtx, const VtxType vtxType)
bool	passVertexSelection (const xAOD::Vertex *vtx) const
unsigned	removeMerged2TrackVertexes (const xAOD::Vertex *mergedVtx, std::vector< TwoTrackVtx > &vtxs) const
void	plotVertexDistances (const std::vector< TwoTrackVtx > &others)
std::vector< const xAOD::TrackParticle * >	getTracksWithoutVertex (const std::vector< xAOD::Vertex * > &passVtxs, const std::vector< const xAOD::TrackParticle * > &selectedTracks)
std::vector< std::unique_ptr< xAOD::Vertex > >	fit2TrackVertexes (const EventContext &ctx, const FittingInput &input, std::vector< const xAOD::TrackParticle * > &selectedTracks, const VtxType vtxType)
StatusCode	makeHist (TH1 *&h, const std::string &key, int nbin, double xmin, double xmax)
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
ToolHandle< Prompt::IVertexFittingTool >	m_vertexFitterTool
ServiceHandle< ITHistSvc >	m_histSvc
Gaudi::Property< double >	m_minFitProb
Gaudi::Property< double >	m_minCandOverSeedFitProbRatio
Gaudi::Property< unsigned >	m_maxExtraTracks
Gaudi::Property< std::string >	m_outputStream
TH1 *	m_histNvtx2TrkInit {}
TH1 *	m_histNvtx2TrkPass {}
TH1 *	m_histNvtx2TrkUnmerged {}
TH1 *	m_histNvtxMerged {}
TH1 *	m_histNewVtxFitChi2 {}
TH1 *	m_histNewVtxFitProb {}
TH1 *	m_histNewVtxFitDistToCurr {}
TH1 *	m_histNewVtxFitDistToSeed {}
TH1 *	m_histNewVtxFitDistToSeedPass {}
TH1 *	m_histNewVtxFitDistToSeedFail {}
TH1 *	m_histNewVtxFitProbCandOverSeed {}
TH1 *	m_histNewVtxFitProbCandOverSeedPass {}
TH1 *	m_histNewVtxFitProbCandOverSeedFail {}
TH1 *	m_histNewVtxFitProbCandOverSeed3Trk {}
TH1 *	m_histNewVtxFitProbCandOverSeed3TrkPass {}
TH1 *	m_histVtx2TrkPairDist {}
TH1 *	m_histVtx2trkPairDistZoom {}
TH1 *	m_histVtx2TrkPairSig1 {}
TH1 *	m_histVtx2TrkPairSig2 {}
TH1 *	m_histSelectedTrackCountAll {}
TH1 *	m_histSelectedTrackCountMatch2Vtx {}
TH1 *	m_histSelectedTrackCountWithout2Vtx {}
TH1 *	m_histVtxWithoutLepton2TrkNTrack {}
TH1 *	m_histVtxWithoutLepton2TrkNPass {}
TH1 *	m_histVtxWithoutLepton2TrkNPassUnmerged {}
TH1 *	m_histVtxWithoutLepton2TrkNMerged {}
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 89 of file VertexIterativeFitMergingTool.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

VertexIterativeFitMergingTool()

Prompt::VertexIterativeFitMergingTool::VertexIterativeFitMergingTool	(	const std::string &	name,
		const std::string &	type,
		const IInterface *	parent )

Definition at line 16 of file VertexIterativeFitMergingTool.cxx.

 :
  AthAlgTool       (name, type, parent)
{
  declareInterface<Prompt::IVertexMergingTool>(this);
}

Member Function Documentation

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

DeclareInterfaceID()

Prompt::IVertexMergingTool::DeclareInterfaceID ( Prompt::IVertexMergingTool , 1 , 0  )

inherited

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

fit2TrackVertexes()

std::vector< std::unique_ptr< xAOD::Vertex > > Prompt::VertexIterativeFitMergingTool::fit2TrackVertexes ( const EventContext & ctx, const FittingInput & input, std::vector< const xAOD::TrackParticle * > & selectedTracks, const VtxType vtxType )

private

Definition at line 778 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Fit all possible combinations of two 2-track vertexes
  //
  std::vector<std::unique_ptr<xAOD::Vertex>> passVtxs;
 
  if(selectedTracks.size() < 2) {
    ATH_MSG_DEBUG("fit2TrackVertexeses - 0 or 1 input tracks - nothing to do");
    return passVtxs;
  }
 
  ATH_MSG_DEBUG(name() << "::fit2TrackVertexes - start with " << selectedTracks.size() << " tracks");
 
  //
  // Sort tracks by decreasing pT
  //
  std::sort(selectedTracks.begin(), selectedTracks.end(), SortTracksByPt());
 
  unsigned icount = 0;
 
  for(std::vector<const xAOD::TrackParticle *>::const_iterator it1 = selectedTracks.begin(); it1 != selectedTracks.end(); ++it1) {
    for(std::vector<const xAOD::TrackParticle *>::const_iterator it2 = it1 + 1; it2 != selectedTracks.end(); ++it2) {
      const xAOD::TrackParticle *track1 = *it1;
      const xAOD::TrackParticle *track2 = *it2;
 
      if(!track1 || !track2) {
        ATH_MSG_WARNING("fit2TrackVertexeses - logic error: TrackParticle null pointer");
        continue;
      }
 
      std::vector<const xAOD::TrackParticle *> fit_tracks = {track1, track2};
 
      //
      // Fit new vertex
      //
      std::unique_ptr<xAOD::Vertex> vtx = m_vertexFitterTool->fitVertexWithPrimarySeed(
        ctx, input, fit_tracks, vtxType
      );
 
      icount++;
 
      if(!vtx) {
        ATH_MSG_WARNING("fit2TrackVertexeses - failed to fit vertex");
        continue;
      }
 
      if(passVertexSelection(vtx.get())) {
        ATH_MSG_DEBUG("fit2TrackVertexeses - pass vertex: " << vtxAsStr(vtx.get(), true));
        passVtxs.push_back(std::move(vtx));
      }
    }
  }
 
  ATH_MSG_DEBUG(name() << "::fit2TrackVertexes - finished processing: " << std::endl
        << "   number of input tracks:            " << selectedTracks.size() << std::endl
        << "   number of 2-track combinations:    " << icount                 << std::endl
        << "   number of passed 2-track vertexes: " << passVtxs      .size() << std::endl
        << name() << "::fit2TrackVertexes - all is done" );
 
  return passVtxs;
}

fitSeedPlusOtherVertex()

std::unique_ptr< xAOD::Vertex > Prompt::VertexIterativeFitMergingTool::fitSeedPlusOtherVertex ( const EventContext & ctx, const FittingInput & input, const xAOD::Vertex * seedVtx, const xAOD::Vertex * otherVtx, const VtxType vtxType )

private

Definition at line 707 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Fit two 2-track vertexes
  //
  if(!seedVtx) {
    ATH_MSG_WARNING("fitSeedPlusOtherVertex - null seed Vertex pointer");
    return 0;
  }
 
  if(!otherVtx) {
    ATH_MSG_WARNING("fitSeedPlusOtherVertex - null other Vertex pointer");
    return 0;
  }
 
  if(otherVtx->nTrackParticles() != 2) {
    ATH_MSG_WARNING("fitSeedPlusOtherVertex - other Vertex does not have 2 tracks: ntrack=" << otherVtx->nTrackParticles());
    return 0;
  }
 
  //
  // Collect tracks from the seed vertex
  //
  std::vector<const xAOD::TrackParticle *> tracks;
 
  for(unsigned k = 0; k < seedVtx->nTrackParticles(); ++k) {
    const xAOD::TrackParticle *track = seedVtx->trackParticle(k);
 
    if(track) {
      tracks.push_back(track);
    }
    else {
      ATH_MSG_WARNING("fitSeedPlusOtherVertex - seed vertex contains TrackParticle null pointer");
    }
  }
 
  //
  // Collect tracks from other vertices
  //
  for(unsigned k = 0; k < otherVtx->nTrackParticles(); ++k) {
    const xAOD::TrackParticle *track = otherVtx->trackParticle(k);
 
    if(track) {
      tracks.push_back(track);
    }
    else {
      ATH_MSG_WARNING("fitSeedPlusOtherVertex - other vertex contains TrackParticle null pointer");
    }
  }
 
  //
  // Fit new vertex
  //
  std::unique_ptr<xAOD::Vertex> secVtx = m_vertexFitterTool->fitVertexWithSeed(
    ctx, input, tracks, seedVtx->position(), vtxType
  );
 
  if(!secVtx) {
    ATH_MSG_WARNING("fitSeedPlusOtherVertex - failed to fit vertex");
    return 0;
  }
 
  return secVtx;
}

fitSeedVertexCluster() [1/2]

xAOD::Vertex * Prompt::VertexIterativeFitMergingTool::fitSeedVertexCluster ( const EventContext & ctx, const FittingInput & input, std::unique_ptr< xAOD::Vertex > & seedVtx, const VtxType vtxType, std::vector< TwoTrackVtx > & others )

private

Definition at line 554 of file VertexIterativeFitMergingTool.cxx.

 {
  // remember the seed vertex before the call 
  xAOD::Vertex* originalSeed = seedVtx.get(); 
  // call the original signature 
  xAOD::Vertex* iterationResult = fitSeedVertexCluster(ctx, input,seedVtx.get(), vtxType,others);
  // if the iteration has finished (it is returning the seed), release the seed vertex. 
  // This will be re-captured by the top level caller after exiting the recursion stack.
  if (iterationResult == originalSeed) return seedVtx.release();
  // otherwise, return the iteration result. The seed vertex will be deleted 
  // when the call stack unwinds.  
  else return iterationResult; 
}

fitSeedVertexCluster() [2/2]

xAOD::Vertex * Prompt::VertexIterativeFitMergingTool::fitSeedVertexCluster ( const EventContext & ctx, const FittingInput & input, xAOD::Vertex * seedVtx, const VtxType vtxType, std::vector< TwoTrackVtx > & others )

private

Definition at line 431 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Reached end of the recursive loop
  //
  if(others.empty()) {
    return seedVtx;
  }
 
  //
  // Re-sort other vertices by distance to the seed vertex - needed because seed position changes when vertices are merged
  //
  std::sort(others.begin(), others.end(), Prompt::SortTwoTrackVtxByDistToSeed(seedVtx));
 
  // Take closest vertex
  xAOD::Vertex* currVtx = others.front().vertex;
 
  if(!currVtx) {
    ATH_MSG_WARNING("VertexIterativeFitMergingTool::fitSeedVertexCluster - current vertex is null pointer");
    return seedVtx;
  }
 
  //
  // Remove closest vertex from the list
  //
  others.erase(others.begin());
 
  /*
    Found nearby vertex - fit merged vertex
  */
  std::unique_ptr<xAOD::Vertex> candVtx =fitSeedPlusOtherVertex(
    ctx, input, seedVtx, currVtx, vtxType
  ); 
 
  if(!candVtx) {
    //
    // Failed to fit new vertex - continue with current seed vertex
    //
 
    ATH_MSG_DEBUG("fitSeedVertexCluster - NEW MERGED VERTEX FIT FAILED" << std::endl
          << "---------------------------------------------------------------------------");
 
    return fitSeedVertexCluster(ctx, input, std::move(seedVtx), vtxType, others);
  }
 
  const double probCand = getVertexFitProb(candVtx.get());
  const double probSeed = getVertexFitProb(seedVtx);
 
  double probCandOverSeed = -1.0;
 
  if(probSeed > 0.0) {
    probCandOverSeed = probCand/probSeed;
  }
 
  const double distToSeed = getDistance(seedVtx, candVtx.get());
  const double distToCurr = getDistance(currVtx, candVtx.get());
 
  fillTH1(m_histNewVtxFitChi2, candVtx->chiSquared());
  fillTH1(m_histNewVtxFitProb, probCand);
 
  fillTH1(m_histNewVtxFitDistToSeed,       distToSeed);
  fillTH1(m_histNewVtxFitDistToCurr,       distToCurr);
  fillTH1(m_histNewVtxFitProbCandOverSeed, probCandOverSeed);
 
  if(seedVtx->nTrackParticles() > 2) {
    fillTH1(m_histNewVtxFitProbCandOverSeed3Trk, probCandOverSeed);
  }
 
  std::stringstream str;
 
 
    str << "   dist to seed=" << distToSeed << ", probCandOverSeed=" << probCandOverSeed << std::endl
  << "   seed: "        << vtxAsStr(seedVtx, false) << std::endl
  << "   curr: "        << vtxAsStr(currVtx, true)
  << "   cand: "        << vtxAsStr(candVtx.get(), true)
  << "fitSeedVertexCluster - finished" << std::endl
  << "---------------------------------------------------------------------------" << std::endl;
 
 
 
  if(!(passVertexSelection(candVtx.get()) && probCandOverSeed > m_minCandOverSeedFitProbRatio)) {
    //
    // New fitted merged vertex failed selection
    //
 
    ATH_MSG_DEBUG("fitSeedVertexCluster - FAIL NEW MERGED VERTEX\n" << str.str());
 
 
    fillTH1(m_histNewVtxFitDistToSeedFail,       distToSeed);
    fillTH1(m_histNewVtxFitProbCandOverSeedFail, probCandOverSeed);
 
    //
    // Continue with current seed vertex
    //
    return fitSeedVertexCluster(ctx, input, seedVtx, vtxType, others);
  }
 
  fillTH1(m_histNewVtxFitDistToSeedPass,       distToSeed);
  fillTH1(m_histNewVtxFitProbCandOverSeedPass, probCandOverSeed);
 
  if(seedVtx->nTrackParticles() > 2) {
    fillTH1(m_histNewVtxFitProbCandOverSeed3TrkPass, probCand/probSeed);
  }
 
  //
  // Succesfully fitted new vertex
  //
 
  ATH_MSG_DEBUG("fitSeedVertexCluster - PASS NEW MERGED VERTEX" << str.str());
 
 
  return fitSeedVertexCluster(ctx, input, candVtx, vtxType, others);
}

getNewMergedVertex()

void Prompt::VertexIterativeFitMergingTool::getNewMergedVertex ( const EventContext & ctx, xAOD::Vertex * seedVtx, std::unique_ptr< xAOD::Vertex > & newMergedVtx, const FittingInput & input, std::vector< TwoTrackVtx >::iterator & currVit, std::vector< TwoTrackVtx > & vtxs2Track, const VtxType vtxType )

private

Definition at line 388 of file VertexIterativeFitMergingTool.cxx.

  {
  // Generate a list of 2-track vertices other than the seed vertex
  std::vector<TwoTrackVtx> others;
 
  for(std::vector<TwoTrackVtx>::iterator vit = vtxs2Track.begin(); vit != vtxs2Track.end(); ++vit) {
    if(vit != currVit) {
      others.push_back(*vit);
    }
  }
 
  // Sort other vertices by distance to the seed vertex
  std::sort(others.begin(), others.end(), Prompt::SortTwoTrackVtxByDistToSeed(seedVtx));
 
  // Call recursive function to fit seed+closest vertex pairs
  xAOD::Vertex* mergedVtx = fitSeedVertexCluster(
    ctx, input, seedVtx, vtxType, others
  );
 
  /*
    If the returned vertex is the seed vertex, that means that the
    vertex could not be merged. We do not want to return it because
    then we would assign two unique_ptrs to the same underlying
    vertex object. Instead, we leave newMergedVtx as a nullptr
 
    If they are different, then we do in fact have a new vertex,
    and we are safe to encapsulate it in a unique_ptr.
  */
  if (mergedVtx == seedVtx){
    newMergedVtx.reset(nullptr);
  } else {
    newMergedVtx.reset(mergedVtx);
  }
}

getTracksWithoutVertex()

std::vector< const xAOD::TrackParticle * > Prompt::VertexIterativeFitMergingTool::getTracksWithoutVertex ( const std::vector< xAOD::Vertex * > & passVtxs, const std::vector< const xAOD::TrackParticle * > & selectedTracks )

private

Definition at line 643 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Plot unmatched tracks
  //
  std::vector<const xAOD::TrackParticle *> tracksWithoutVertex;
 
  unsigned iCountDoMatch = 0;
 
  for(const xAOD::TrackParticle *track: selectedTracks) {
    bool match = false;
 
    for(const xAOD::Vertex *vtx: passVtxs) {
      for(unsigned k = 0; k < vtx->nTrackParticles(); ++k) {
        const xAOD::TrackParticle *vtxTrack = vtx->trackParticle(k);
 
        if(vtxTrack == track) {
          match = true;
          break;
        }
      }
    }
 
    if(match) {
      iCountDoMatch++;
    }
    else {
      tracksWithoutVertex.push_back(track);
    }
  }
 
  fillTH1(m_histSelectedTrackCountAll,         selectedTracks.size());
  fillTH1(m_histSelectedTrackCountMatch2Vtx,   iCountDoMatch);
  fillTH1(m_histSelectedTrackCountWithout2Vtx, tracksWithoutVertex.size());
 
  return tracksWithoutVertex;
}

initialize()

StatusCode Prompt::VertexIterativeFitMergingTool::initialize ( )

overridevirtual

Definition at line 27 of file VertexIterativeFitMergingTool.cxx.

{
  ATH_CHECK(m_vertexFitterTool.retrieve());
  ATH_CHECK(m_histSvc.retrieve());
 
  ATH_CHECK(makeHist(m_histNvtx2TrkInit,     "nvtx_2trk_init",                   25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histNvtx2TrkPass,     "nvtx_2trk_pass",                   25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histNvtx2TrkUnmerged, "nvtx_2trk_unmerged",               25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histNvtxMerged,        "nvtx_merged",                      25, -0.5, 24.5));
 
  ATH_CHECK(makeHist(m_histNewVtxFitChi2,             "newVtxFit_chi2",                   100, 0.0, 50.0));
  ATH_CHECK(makeHist(m_histNewVtxFitProb,             "newVtxFit_prob",                   100, 0.0,  1.0));
 
  ATH_CHECK(makeHist(m_histNewVtxFitDistToCurr,      "newVtxFit_dist_toCurr",            100, 0.0, 10.0));
  ATH_CHECK(makeHist(m_histNewVtxFitDistToSeed,      "newVtxFit_dist_toSeed",            100, 0.0, 10.0));
  ATH_CHECK(makeHist(m_histNewVtxFitDistToSeedPass, "newVtxFit_dist_toSeed_pass",       100, 0.0, 10.0));
  ATH_CHECK(makeHist(m_histNewVtxFitDistToSeedFail, "newVtxFit_dist_toSeed_fail",       100, 0.0, 10.0));
 
  ATH_CHECK(makeHist(m_histNewVtxFitProbCandOverSeed,           "newVtxFit_prob_candOverSeed",           100, 0.0,  4.0));
  ATH_CHECK(makeHist(m_histNewVtxFitProbCandOverSeedPass,      "newVtxFit_prob_candOverSeed_pass",      100, 0.0,  4.0));
  ATH_CHECK(makeHist(m_histNewVtxFitProbCandOverSeedFail,      "newVtxFit_prob_candOverSeed_fail",      100, 0.0,  4.0));
  ATH_CHECK(makeHist(m_histNewVtxFitProbCandOverSeed3Trk,      "newVtxFit_prob_candOverSeed_3trk",      100, 0.0,  4.0));
  ATH_CHECK(makeHist(m_histNewVtxFitProbCandOverSeed3TrkPass, "newVtxFit_prob_candOverSeed_3trk_pass", 100, 0.0,  4.0));
 
  ATH_CHECK(makeHist(m_histVtx2TrkPairDist,      "Vtx2trkPair_dist",      100, 0.0, 100.0));
  ATH_CHECK(makeHist(m_histVtx2trkPairDistZoom, "Vtx2trkPair_dist_zoom", 100, 0.0,  10.0));
  ATH_CHECK(makeHist(m_histVtx2TrkPairSig1,      "Vtx2trkPair_sig1",      100, 0.0,  20.0));
  ATH_CHECK(makeHist(m_histVtx2TrkPairSig2,      "Vtx2trkPair_sig2",      100, 0.0,  20.0));
 
  ATH_CHECK(makeHist(m_histSelectedTrackCountAll,         "selectedTrack_CountAll",         25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histSelectedTrackCountMatch2Vtx ,  "selectedTrack_CountMatch2Vtx",   25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histSelectedTrackCountWithout2Vtx, "selectedTrack_CountWithout2Vtx", 25, -0.5, 24.5));
 
  ATH_CHECK(makeHist(m_histVtxWithoutLepton2TrkNTrack,        "vtxWithoutLepton2trk_NTrack",         25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histVtxWithoutLepton2TrkNPass,         "vtxWithoutLepton2trk_NPass",          25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histVtxWithoutLepton2TrkNPassUnmerged, "vtxWithoutLepton2trk_NPassUnmerged",  25, -0.5, 24.5));
  ATH_CHECK(makeHist(m_histVtxWithoutLepton2TrkNMerged,       "vtxWithoutLepton2trk_NMerged",        25, -0.5, 24.5));
 
  return StatusCode::SUCCESS;
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

makeHist()

StatusCode Prompt::VertexIterativeFitMergingTool::makeHist ( TH1 *& h, const std::string & key, int nbin, double xmin, double xmax )

private

Definition at line 847 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Initiliase histogram pointer. If configured to run in validation mode, then create and register histogram
  //
  h = 0;
 
  if(m_outputStream.empty() || key.empty()) {
    return StatusCode::SUCCESS;
  }
 
  const std::string hname    = name() + "_" + key;
  const std::string hist_key = "/"+m_outputStream+"/"+hname;
 
  h = new TH1D(hname.c_str(), hname.c_str(), nbin, xmin, xmax);
  h->SetDirectory(0);
 
  return m_histSvc->regHist(hist_key, h);
}

mergeInitVertices()

Prompt::MergeResultNotOwner Prompt::VertexIterativeFitMergingTool::mergeInitVertices ( const EventContext & ctx, const FittingInput & input, const xAOD::TrackParticle * tracklep, std::vector< std::unique_ptr< xAOD::Vertex > > & initVtxs, const std::vector< const xAOD::TrackParticle * > & selectedTracks )

overridevirtual

Implements Prompt::IVertexMergingTool.

Definition at line 68 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Merge initial (2-track) vertices into new merged vertices with three tracks or more
  //
 
  ATH_MSG_DEBUG("===========================================================================" << std::endl
             << name() << "::mergeInitVertices - start processing");
 
 
  /*
    We store the initial vertices that pass selection in their own list
    with ownership, as this needs to be passed later to the MergeResults.
  */
  MergeResultNotOwner result;
  std::vector<std::unique_ptr<xAOD::Vertex>> vtxsInitPassed;
 
  for(std::unique_ptr<xAOD::Vertex> &vtx: initVtxs) {
    if(passVertexSelection(vtx.get())) {
      ATH_MSG_DEBUG("pushing vertex into result.vtxInitPassed");
      result.vtxsInitPassed.push_back(vtx.get());
      vtxsInitPassed.push_back(std::move(vtx));
    }
  }
 
  const unsigned nvtxInit = initVtxs.size();
  const unsigned nvtxPass = result.vtxsInitPassed.size();
 
  fillTH1(m_histNvtx2TrkInit, nvtxInit);
 
  //
  // Find tracks that do not form 2-track vertex with lepton track
  //
  ATH_MSG_DEBUG(name() << "::mergeInitVertices - processes vertexes without lepton");
 
  std::vector<const xAOD::TrackParticle *> tracksWithoutVertex = getTracksWithoutVertex(
    result.vtxsInitPassed, selectedTracks
  );
 
  // Rank the tracks by pT, will keep the top `m_maxExtraTracks` tracks
  // for fitting vertexes without lepton
  if(tracksWithoutVertex.size() > m_maxExtraTracks) {
    ATH_MSG_DEBUG(" number of tracks without good lepton+track vertex: " << tracksWithoutVertex.size() << std::endl
        << " will only keep the top " << m_maxExtraTracks << " tracks");
 
    std::sort(tracksWithoutVertex.begin(), tracksWithoutVertex.end(), Prompt::SortByIDTrackPt());
 
    tracksWithoutVertex.erase(tracksWithoutVertex.begin() + m_maxExtraTracks, tracksWithoutVertex.end());
  }
 
 
  MergeResultNotOwner resultExtra;
  std::vector<std::unique_ptr<xAOD::Vertex>> twoTrackVtxInit = fit2TrackVertexes(ctx, input, tracksWithoutVertex, Prompt::kTwoTrackVtxWithoutLepton);
 
  ATH_MSG_DEBUG(
    name() << "::mergeInitVertices - will merge vertexes without lepton" << std::endl
    << "   number of selected tracks without good lepton+track vertex: "
    << tracksWithoutVertex        .size() << std::endl
    << "   number of 2-track vertexes without lepton:                  "
    << resultExtra.vtxsInitPassed.size()
  );
 
  //
  // Merge 2-track vertex without lepton only when there are two or more vertices
  //
  mergeIteratively2TrackVtxs(ctx, input, twoTrackVtxInit, resultExtra, Prompt::kIterativeFitVtxWithoutLepton);
 
  if(resultExtra.vtxsInitPassed.size() > 1) {
    //
    // Fill histograms only when there are two or more vertices
    //
    fillTH1(m_histVtxWithoutLepton2TrkNTrack, tracksWithoutVertex.size());
    fillTH1(m_histVtxWithoutLepton2TrkNPass, resultExtra.vtxsInitPassed.size());
    fillTH1(m_histVtxWithoutLepton2TrkNPassUnmerged, resultExtra.vtxsInitPassedNotMerged.size());
    fillTH1(m_histVtxWithoutLepton2TrkNMerged, resultExtra.vtxsNewMerged.size());
  }
 
  ATH_MSG_DEBUG(name() << "::mergeInitVertices - finished merging vertexes without lepton" << std::endl
      << "   number of tracks without good lepton+track vertex:  " << tracksWithoutVertex.size() << std::endl
      << "   number of          2-track vertexes without lepton: " << resultExtra.vtxsInitPassed.size() << std::endl
      << "   number of unmerged 2-track vertexes without lepton: " << resultExtra.vtxsInitPassedNotMerged.size() << std::endl
      << "   number of merged  vertexes without lepton:          " << resultExtra.vtxsNewMerged.size());
 
  //
  // Next, processes 2-track vertexes that contain lepton track
  //
  ATH_MSG_DEBUG("===========================================================================" << std::endl
      << name() << "::mergeInitVertices - process 2-track vertexes with lepton" << std::endl
      << "   lepton track pT="                      << tracklep->pt()                 << std::endl
      << "   number of initial  2-track vertices: " << initVtxs.size()               << std::endl
      << "   number of selected 2-track vertices: " << result.vtxsInitPassed.size() << std::endl
      << "   number of selected ID tracks:        " << selectedTracks.size() );
 
  //
  // Merge 2-track vertexes that contain lepton track
  //
  mergeIteratively2TrackVtxs(ctx, input, vtxsInitPassed, result, Prompt::kIterativeFitVtx);
 
  if(result.vtxsInitPassed.size() > 1) {
    //
    // Fill histograms only when there are at least two vertexes to merge
    //
    fillTH1(m_histNvtx2TrkPass,     nvtxPass);
    fillTH1(m_histNvtx2TrkUnmerged, result.vtxsInitPassedNotMerged.size());
    fillTH1(m_histNvtxMerged,        result.vtxsNewMerged            .size());
  }
 
  //
  // Erase vector of 2-track vertices without lepton that were merged
  //
  resultExtra.vtxsInitPassed.clear();
 
  //
  // Add vertices without lepton track to result
  //
  result.vtxsInitPassedNotMerged.insert(
    result.vtxsInitPassedNotMerged.end(),
    std::make_move_iterator(resultExtra.vtxsInitPassedNotMerged.begin()),
    std::make_move_iterator(resultExtra.vtxsInitPassedNotMerged.end())
  );
 
  result.vtxsNewMerged.insert(
    result.vtxsNewMerged.end(),
    std::make_move_iterator(resultExtra.vtxsNewMerged.begin()),
    std::make_move_iterator(resultExtra.vtxsNewMerged.end())
  );
 
  ATH_MSG_DEBUG("==========================================" << std::endl
    << "mergeInitVertices report" << std::endl
    << " \tnumber of initial  2-track vertices: "
    << initVtxs.size() << std::endl
    << "\tnumber of passed   2-track vertices: "
    << result.vtxsInitPassed.size() << std::endl
    << "\tnumber of unmerged 2-track vertices: "
    << result.vtxsInitPassedNotMerged.size() << std::endl
    << "\tnumber of merged           vertices: "
    << result.vtxsNewMerged.size() << std::endl
    << std::endl
    << "\tnumber of tracks without good lepton+track vertex:  "
    << tracksWithoutVertex.size() << std::endl
    << "\tnumber of          2-track vertexes without lepton: "
    << resultExtra.vtxsInitPassed.size() << std::endl
    << "\tnumber of unmerged 2-track vertexes without lepton: "
    << resultExtra.vtxsInitPassedNotMerged.size() << std::endl
    << "\tnumber of merged  vertexes without lepton:          "
    << resultExtra.vtxsNewMerged.size() << std::endl
    << name() << "::mergeInitVertices - ALL DONE" << std::endl
    << "=========================================="
  );
 
 
  return result;
}

mergeIteratively2TrackVtxs()

bool Prompt::VertexIterativeFitMergingTool::mergeIteratively2TrackVtxs ( const EventContext & ctx, const FittingInput & input, std::vector< std::unique_ptr< xAOD::Vertex > > & initVtxs, MergeResultNotOwner & result, const VtxType vtxType )

private

Definition at line 228 of file VertexIterativeFitMergingTool.cxx.

{
  /*
     This function merges iterively vertexes with this algorithm:
     o) Sort 2-track vertexes by sum of track pT
     o) Select the vertex with the highest sum of track pT as the seed vertex
     - Sort all other vertexes by the distance to the seed vertex
     - Add tracks from the closest vertex to the selected vertex
     - Fit new vertex:
     -- if the new vertex passes cuts, select as the new seed vertex
     -- if the new vertex fails cuts, continue with the original seed vertex
     -- Remove this closest vertex from the list
     - Resort remaining tracks by the distance to the seed vertex and repeat
     o) Remove the 2-track vertexes that were merged from the global list and repeat
     */
 
  // Only 0 or 1 2-track vertices - add the vertex to not merged list and return
  if(result.vtxsInitPassed.size() < 2) {
    result.vtxsInitPassedNotMerged = std::move(initVtxs);
 
    ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - too few vertexes: nothing more to do");
 
    return false;
  }
 
  //
  // Make 2-track vertex data structures
  //
  std::vector<TwoTrackVtx> vtxs2Track;
 
  for(std::unique_ptr<xAOD::Vertex> &vtx: initVtxs) {
    if(vtx->nTrackParticles() != 2) {
      ATH_MSG_WARNING("mergeIteratively2TrackVtxs - wrong number of tracks: " << vtx->nTrackParticles());
      continue;
    }
 
    if(vtx->nTrackParticles() !=2 ) {
      ATH_MSG_WARNING("mergeIteratively2TrackVtxs - vertex does not contain 2 TrackParticles: ntrack=" << vtx->nTrackParticles());
      continue;
    }
 
    TwoTrackVtx vtx2track;
    vtx2track.trackId0 = vtx->trackParticle(0);
    vtx2track.trackId1 = vtx->trackParticle(1);
 
    if(!vtx2track.trackId0 || !vtx2track.trackId1) {
      ATH_MSG_WARNING("mergeIteratively2TrackVtxs - failed to find TrackParticles for 2-track vertex");
      continue;
    }
 
    vtx2track.vertex        = vtx.get();
    vtx2track.vertexFitProb = Prompt::getVertexFitProb(vtx.get());
    vtx2track.sumTrackPt    = vtx2track.trackId0->pt() + vtx2track.trackId1->pt();
 
    vtxs2Track.push_back(vtx2track);
  }
 
  ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - start processing with " << vtxs2Track.size() << " input vertexes ");
 
  if(vtxs2Track.size() < 2) {
    ATH_MSG_WARNING("mergeIteratively2TrackVtxs - logic error: found only " << vtxs2Track.size() << " 2-track vertex");
    return false;
  }
 
  //
  // Sort 2-track vertexes by ID track pT
  //
  std::sort(vtxs2Track.begin(), vtxs2Track.end(), Prompt::SortTwoTrackVtxBySumTrackPt());
 
  ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - number of 2 track passed vertexes=" << vtxs2Track.size());
 
  for(const TwoTrackVtx &vtx: vtxs2Track) {
    ATH_MSG_DEBUG("Input vertex with 2 tracks sum pT=" << vtx.sumTrackPt << "\n    " << vtxAsStr(vtx.vertex, true));
  }
 
  //
  // Plot distances between all unique pairs of 2-track vertexes
  //
  plotVertexDistances(vtxs2Track);
 
  //
  // Iterative fit vertices for merging:
  //
  std::vector<TwoTrackVtx>::iterator currVit = vtxs2Track.begin();
 
  /*
    Seed new vertex with 2-track vertex containing
    highest pT ID track (non-lepton track)
  */
  while(currVit != vtxs2Track.end()) {
    xAOD::Vertex* seedVtx = currVit->vertex;
 
    /*
      We potentially generate a new vertex here,
      so it has to be a unique_ptr. If the vertex could not be merged,
      then the newMergedVtx will remain a nullptr.
    */
    std::unique_ptr<xAOD::Vertex> newMergedVtx = nullptr;
    getNewMergedVertex(
      ctx, seedVtx, newMergedVtx, input, currVit, vtxs2Track, vtxType
    );
 
    // Check to see if the new merged vertex is not a nullptr
    // (i.e., if the vertex could be merged)
    if(newMergedVtx) {
      // Remove 2-track vertexes that were merged
      removeMerged2TrackVertexes(newMergedVtx.get(), vtxs2Track);
 
      // Reset current vertex iterator to beginning
      currVit = vtxs2Track.begin();
 
      ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - new merged vertex:\n" << vtxAsStr(newMergedVtx.get(), false));
 
      // Save new merged vertex (it is new because it is distinct from seed vertex)
      result.vtxsNewMerged.push_back(std::move(newMergedVtx));
    }
    else {
      //
      // This vertex could not be merged - try next one
      //
      ++currVit;
 
      ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - could not merge 2-track vertex:\n" << vtxAsStr(seedVtx, false));
    }
  }
 
  //
  // Record unmerged two-track vertexes
  //
  for(std::unique_ptr<xAOD::Vertex> &vtxUniquePtr: initVtxs) {
    for(TwoTrackVtx &vtx: vtxs2Track) {
      if (vtxUniquePtr.get() == vtx.vertex){
        result.vtxsInitPassedNotMerged.push_back(std::move(vtxUniquePtr));
 
        ATH_MSG_DEBUG("Unmerged " << vtxAsStr(vtx.vertex, true));
      }
    }
  }
 
  ATH_MSG_DEBUG(name() << "::mergeIteratively2TrackVtxs - finished processing:" << std::endl
  << "   number of unmerged 2-track vertexes=" << vtxs2Track           .size() << std::endl
  << "   number of merged           vertexes=" << result.vtxsNewMerged.size() );
 
  for(TwoTrackVtx &vtx: vtxs2Track) {
    ATH_MSG_DEBUG("Unmerged " << vtxAsStr(vtx.vertex, true));
  }
 
  for(const std::unique_ptr<xAOD::Vertex>& vtx: result.vtxsNewMerged) {
    ATH_MSG_DEBUG("Merged " << vtxAsStr(vtx.get(), true));
  }
 
  return true;
}

msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< AlgTool >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

passVertexSelection()

bool Prompt::VertexIterativeFitMergingTool::passVertexSelection ( const xAOD::Vertex * vtx ) const

private

Definition at line 685 of file VertexIterativeFitMergingTool.cxx.

{
  //
  // Check whether vertex passes quality cuts
  //
  if(!vtx) {
    ATH_MSG_WARNING("passVertexSelection - input vertex is null pointer");
    return false;
  }
 
  if(!(vtx->numberDoF() > 0 && vtx->chiSquared() >= 0)) {
    return false;
  }
 
  const double fitProb = Prompt::getVertexFitProb(vtx);
 
  ATH_MSG_DEBUG("passVertexSelection - vertex pointer=" << vtx << " chi2/ndof=" << vtx->chiSquared() << "/" << vtx->numberDoF() << ", prob=" << fitProb);
 
  return fitProb > m_minFitProb;
}

plotVertexDistances()

void Prompt::VertexIterativeFitMergingTool::plotVertexDistances ( const std::vector< TwoTrackVtx > & others )

private

Definition at line 625 of file VertexIterativeFitMergingTool.cxx.

  {
  for(std::vector<TwoTrackVtx>::const_iterator fit = others.begin(); fit != others.end(); ++fit) {
    for(std::vector<TwoTrackVtx>::const_iterator sit = fit+1; sit != others.end(); ++sit) {
      const double dist = Prompt::getDistance(fit->vertex, sit->vertex);
      const double sig1 = Prompt::getNormDist(fit->vertex->position(), sit->vertex->position(), fit->vertex->covariance(), msg(MSG::WARNING));
      const double sig2 = Prompt::getNormDist(fit->vertex->position(), sit->vertex->position(), sit->vertex->covariance(), msg(MSG::WARNING));
 
      fillTH1(m_histVtx2TrkPairDist,     dist);
      fillTH1(m_histVtx2trkPairDistZoom, dist);
      fillTH1(m_histVtx2TrkPairSig1,     sig1);
      fillTH1(m_histVtx2TrkPairSig2,     sig2);
    }
  }
}

removeMerged2TrackVertexes()

unsigned Prompt::VertexIterativeFitMergingTool::removeMerged2TrackVertexes ( const xAOD::Vertex * mergedVtx, std::vector< TwoTrackVtx > & vtxs ) const

private

Definition at line 573 of file VertexIterativeFitMergingTool.cxx.

        {
  if(!mergedVtx) {
    ATH_MSG_WARNING("VertexIterativeFitMergingTool::removeMerged2TrackVertexes - merged vertex is null pointer");
    return 0;
  }
 
  unsigned icount = 0;
  std::vector<TwoTrackVtx>::iterator vit = vtxs.begin();
 
  while(vit != vtxs.end()) {
    int iCountMatchedTrack = 0;
 
    for(unsigned k = 0; k < mergedVtx->nTrackParticles(); ++k) {
      const xAOD::TrackParticle *track = mergedVtx->trackParticle(k);
 
      if(!track) {
        ATH_MSG_WARNING("removeMerged2TrackVertexes - merged vertex contains null TrackParticle pointer");
        continue;
      }
 
      if(vit->trackId0 == track) { iCountMatchedTrack++; }
      if(vit->trackId1 == track) { iCountMatchedTrack++; }
    }
 
    if(iCountMatchedTrack == 2) {
      //
      // Found 2-track vertex that was merged - remove this vertex
      //
      vit = vtxs.erase(vit);
      icount++;
 
      ATH_MSG_DEBUG("removeMerged2TrackVertexes - removed merged 2-track vertex");
    }
    else {
      ++vit;
 
      ATH_MSG_DEBUG("removeMerged2TrackVertexes - skip unmerged 2-track vertex");
    }
  }
 
  ATH_MSG_DEBUG(
    name() << "::removeMerged2TrackVertexes - merged vertex ntrack=" << mergedVtx->nTrackParticles()
    << ", removed " << icount << " merged 2-track vertexes"
  );
 
  return icount;
}

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 390 of file AthCommonDataStore.h.

m_histNewVtxFitChi2

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitChi2 {}

private

Definition at line 247 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitDistToCurr

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitDistToCurr {}

private

Definition at line 250 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitDistToSeed

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitDistToSeed {}

private

Definition at line 251 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitDistToSeedFail

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitDistToSeedFail {}

private

Definition at line 253 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitDistToSeedPass

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitDistToSeedPass {}

private

Definition at line 252 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProb

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProb {}

private

Definition at line 248 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProbCandOverSeed

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProbCandOverSeed {}

private

Definition at line 255 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProbCandOverSeed3Trk

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProbCandOverSeed3Trk {}

private

Definition at line 258 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProbCandOverSeed3TrkPass

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProbCandOverSeed3TrkPass {}

private

Definition at line 259 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProbCandOverSeedFail

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProbCandOverSeedFail {}

private

Definition at line 257 of file VertexIterativeFitMergingTool.h.

{};

m_histNewVtxFitProbCandOverSeedPass

TH1* Prompt::VertexIterativeFitMergingTool::m_histNewVtxFitProbCandOverSeedPass {}

private

Definition at line 256 of file VertexIterativeFitMergingTool.h.

{};

m_histNvtx2TrkInit

TH1* Prompt::VertexIterativeFitMergingTool::m_histNvtx2TrkInit {}

private

Definition at line 242 of file VertexIterativeFitMergingTool.h.

{};

m_histNvtx2TrkPass

TH1* Prompt::VertexIterativeFitMergingTool::m_histNvtx2TrkPass {}

private

Definition at line 243 of file VertexIterativeFitMergingTool.h.

{};

m_histNvtx2TrkUnmerged

TH1* Prompt::VertexIterativeFitMergingTool::m_histNvtx2TrkUnmerged {}

private

Definition at line 244 of file VertexIterativeFitMergingTool.h.

{};

m_histNvtxMerged

TH1* Prompt::VertexIterativeFitMergingTool::m_histNvtxMerged {}

private

Definition at line 245 of file VertexIterativeFitMergingTool.h.

{};

m_histSelectedTrackCountAll

TH1* Prompt::VertexIterativeFitMergingTool::m_histSelectedTrackCountAll {}

private

Definition at line 266 of file VertexIterativeFitMergingTool.h.

{};

m_histSelectedTrackCountMatch2Vtx

TH1* Prompt::VertexIterativeFitMergingTool::m_histSelectedTrackCountMatch2Vtx {}

private

Definition at line 267 of file VertexIterativeFitMergingTool.h.

{};

m_histSelectedTrackCountWithout2Vtx

TH1* Prompt::VertexIterativeFitMergingTool::m_histSelectedTrackCountWithout2Vtx {}

private

Definition at line 268 of file VertexIterativeFitMergingTool.h.

{};

m_histSvc

ServiceHandle<ITHistSvc> Prompt::VertexIterativeFitMergingTool::m_histSvc

private

Initial value:

{
      this, "THistSvc", "THistSvc/THistSvc"
    }

Definition at line 219 of file VertexIterativeFitMergingTool.h.

                                       {
      this, "THistSvc", "THistSvc/THistSvc"
    };

m_histVtx2TrkPairDist

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtx2TrkPairDist {}

private

Definition at line 261 of file VertexIterativeFitMergingTool.h.

{};

m_histVtx2trkPairDistZoom

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtx2trkPairDistZoom {}

private

Definition at line 262 of file VertexIterativeFitMergingTool.h.

{};

m_histVtx2TrkPairSig1

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtx2TrkPairSig1 {}

private

Definition at line 263 of file VertexIterativeFitMergingTool.h.

{};

m_histVtx2TrkPairSig2

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtx2TrkPairSig2 {}

private

Definition at line 264 of file VertexIterativeFitMergingTool.h.

{};

m_histVtxWithoutLepton2TrkNMerged

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtxWithoutLepton2TrkNMerged {}

private

Definition at line 273 of file VertexIterativeFitMergingTool.h.

{};

m_histVtxWithoutLepton2TrkNPass

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtxWithoutLepton2TrkNPass {}

private

Definition at line 271 of file VertexIterativeFitMergingTool.h.

{};

m_histVtxWithoutLepton2TrkNPassUnmerged

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtxWithoutLepton2TrkNPassUnmerged {}

private

Definition at line 272 of file VertexIterativeFitMergingTool.h.

{};

m_histVtxWithoutLepton2TrkNTrack

TH1* Prompt::VertexIterativeFitMergingTool::m_histVtxWithoutLepton2TrkNTrack {}

private

Definition at line 270 of file VertexIterativeFitMergingTool.h.

{};

m_maxExtraTracks

Gaudi::Property<unsigned> Prompt::VertexIterativeFitMergingTool::m_maxExtraTracks

private

Initial value:

{
      this, "maxExtraTracks", 10,
      "maximum number of tracks without good lepton+track vertex that we will used for further fitting of vertexes without lepton"
    }

Definition at line 230 of file VertexIterativeFitMergingTool.h.

                                             {
      this, "maxExtraTracks", 10,
      "maximum number of tracks without good lepton+track vertex that we will used for further fitting of vertexes without lepton"
    };

m_minCandOverSeedFitProbRatio

Gaudi::Property<double> Prompt::VertexIterativeFitMergingTool::m_minCandOverSeedFitProbRatio

private

Initial value:

{
      this, "minCandOverSeedFitProbRatio", 0.2,
      "minimum requirement of the fit probability of new merged vertex / fit probability of seed vertex"
    }

Definition at line 226 of file VertexIterativeFitMergingTool.h.

                                                        {
      this, "minCandOverSeedFitProbRatio", 0.2,
      "minimum requirement of the fit probability of new merged vertex / fit probability of seed vertex"
    };

m_minFitProb

Gaudi::Property<double> Prompt::VertexIterativeFitMergingTool::m_minFitProb

private

Initial value:

{this, "minFitProb", 0.01,
      "minimum fit probability requirement for a vertex"
    }

Definition at line 223 of file VertexIterativeFitMergingTool.h.

                                       {this, "minFitProb", 0.01,
      "minimum fit probability requirement for a vertex"
    };

m_outputStream

Gaudi::Property<std::string> Prompt::VertexIterativeFitMergingTool::m_outputStream

private

Initial value:

{
      this, "outputStream", ""
    }

Definition at line 235 of file VertexIterativeFitMergingTool.h.

                                            {
      this, "outputStream", ""
    };

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vertexFitterTool

ToolHandle<Prompt::IVertexFittingTool> Prompt::VertexIterativeFitMergingTool::m_vertexFitterTool

private

Initial value:

{
      this, "VertexFittingTool",
      "Prompt::VertexFittingTool/VertexFittingTool"
    }

Definition at line 215 of file VertexIterativeFitMergingTool.h.

                                                            {
      this, "VertexFittingTool",
      "Prompt::VertexFittingTool/VertexFittingTool"
    };

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• VertexIterativeFitMergingTool.h
• VertexIterativeFitMergingTool.cxx