VertexSelectionAlg.cxx

Go to the documentation of this file.

//
// Copyright (C) 2002-2024 CERN for the benefit of the ATLAS collaboration
//
 
// Local include(s):
#include "TrackingAnalysisAlgorithms/VertexSelectionAlg.h"
 
#include <EventBookkeeperTools/FilterReporter.h>
 
namespace CP {
 
   StatusCode VertexSelectionAlg::initialize() {
 
      // Greet the user:
      ATH_MSG_INFO( "Requiring " << m_minVertices << " vertex/vertices from \""
                    << m_vertexKey << "\" with " << m_minTracks
                    << " track(s) each" );
 
      ANA_CHECK (m_filterParams.initialize());
      ANA_CHECK (m_vertexKey.initialize());
 
      // Return gracefully:
      return StatusCode::SUCCESS;
   }
 
   StatusCode VertexSelectionAlg::finalize() {
      ANA_MSG_INFO (m_filterParams.summary());
 
      // Return gracefully:
      return StatusCode::SUCCESS;
   }
 
   StatusCode VertexSelectionAlg::execute(const EventContext &ctx) const {
 
      FilterReporter filter (m_filterParams, false, ctx);
 
      // Retrieve the vertex container:
      SG::ReadHandle<xAOD::VertexContainer> vertices(m_vertexKey, ctx);
 
      // The number of "good" vertices found:
      unsigned goodVertices = 0;
 
      // Check how many "good" vertices we have in the current event:
      for( const xAOD::Vertex* vx : *vertices ) {
         // It has to be either a primary or a pileup vertex:
         if( ( vx->vertexType() != xAOD::VxType::PriVtx ) &&
             ( vx->vertexType() != xAOD::VxType::PileUp ) ) {
            continue;
         }
         // With the minimum number of tracks specified:
         if( vx->nTrackParticles() < m_minTracks ) {
            continue;
         }
         // Apparently this is a "good" vertex:
         ++goodVertices;
      }
 
      // Decide about the event:
      filter.setPassed( goodVertices >= m_minVertices );
 
      // Return gracefully:
      return StatusCode::SUCCESS;
   }
 
} // namespace CP