diff --git a/Core/include/Acts/Vertexing/legacy/AMVF.cxx b/Core/include/Acts/Vertexing/legacy/AMVF.cxx
deleted file mode 100644
index e6b897bdaab74d90f4444038322f276f475243a7..0000000000000000000000000000000000000000
--- a/Core/include/Acts/Vertexing/legacy/AMVF.cxx
+++ /dev/null
@@ -1,1089 +0,0 @@
-/*
- Copyright (C) 2002-2020 CERN for the benefit of the ATLAS collaboration
-*/
-
-
-/***************************************************************************
- InDetAdaptivePriVxFinderTool.cxx - Description
- -------------------
- begin : 29-05-2006
- authors : Giacinto Piacquadio (Freiburg Univ),
- this is a modified version of the adaptive primary vertex finder to fit more vertexes at the same time
- changes :
- 06/12/2006 Kirill.Prokofiev@cern.ch
- EDM cleanup and switching to the FitQuality use
- 2007-02-15 bug fix by scott s snyder <snyder@bnl.gov>
- Fix memory leak. Don't use a map for sorting.
- 2007-10-xx Giacinto Piacquadio
- Many improvements (MultiVertexFinder v. 2)
- 2016-03-09 D. Casper
- Change default value of TracksMaxZinterval to 1 mm
- (trial working point for high luminosities)
-
-***************************************************************************/
-#include "VxVertex/RecVertex.h"
-#include "VxVertex/Vertex.h"
-#include "InDetPriVxFinderTool/InDetAdaptiveMultiPriVxFinderTool.h"
-#include "TrkTrack/Track.h"
-#include "TrkParameters/TrackParameters.h"
-#include <map>
-#include <vector>
-
-#include "EventPrimitives/EventPrimitives.h"
-#include "EventPrimitives/EventPrimitivesHelpers.h"
-#include "GeoPrimitives/GeoPrimitives.h"
-
-#include "NN.h"
-#include "InDetTrackSelectionTool/IInDetTrackSelectionTool.h"
-
-
-#include "VxMultiVertex/MvfFitInfo.h"
-#include "VxMultiVertex/MVFVxTrackAtVertex.h"
-#include "VxMultiVertex/TrackToVtxLink.h"
-#include "AthContainers/DataVector.h"
-#include "TrkEventPrimitives/ParamDefs.h"
-#include "TrkVertexFitters/AdaptiveMultiVertexFitter.h"
-#include "TrkVertexFitterInterfaces/IVertexAnalyticSeedFinder.h"
-#include "TrkTrack/LinkToTrack.h"
-#include "TrkParticleBase/LinkToTrackParticleBase.h"
-#include "TrkLinks/LinkToXAODTrackParticle.h"
-
-#include "xAODTracking/Vertex.h"
-#include "xAODTracking/TrackParticle.h"
-#include "xAODTracking/VertexContainer.h"
-#include "xAODTracking/VertexAuxContainer.h"
-#include "xAODTracking/TrackParticleContainer.h"
-#include "xAODTracking/TrackParticleAuxContainer.h"
-
-#include <cmath>
-
-
-
-namespace InDet
-{
- InDetAdaptiveMultiPriVxFinderTool::InDetAdaptiveMultiPriVxFinderTool(const std::string& t, const std::string& n,
- const IInterface* p)
- : AthAlgTool(t, n, p),
- m_MultiVertexFitter("Trk::AdaptiveMultiVertexFitter"),
- m_analyticSeedFinder("Trk::TrackDensitySeedFinder"),
- m_trkFilter("InDet::InDetTrackSelection"),
- m_useBeamConstraint(true),
- m_TracksMaxZinterval(1.),
- m_maxVertexChi2(18.42),
- m_realMultiVertex(true),
- m_useFastCompatibility(true),
- m_selectiontype(0),
- m_finalCutMaxVertexChi2(18.42),
- m_cutVertexDependence(3.),
- m_minweight(0.0001),
- m_maxIterations(100),
- m_testingclass(0),
- m_addSingleTrackVertices(false),
- m_do3dSplitting(false),
- m_zBfieldApprox(0.60407),
- m_maximumVertexContamination(0.5),
- m_tracksMaxSignificance(5.),
- m_useSeedConstraint(true)
- {
- declareInterface<IVertexFinder>(this);//by GP: changed from InDetMultiAdaptivePriVxFinderTool to IPriVxFinderTool
- /* Retrieve StoreGate container and tool names from job options */
- declareProperty("SeedFinder", m_analyticSeedFinder);
- declareProperty("VertexFitterTool", m_MultiVertexFitter);
- declareProperty("TrackSelector", m_trkFilter);
-
- //finder options
- declareProperty("TracksMaxZinterval", m_TracksMaxZinterval);
- declareProperty("maxVertexChi2", m_maxVertexChi2);
- declareProperty("finalCutMaxVertexChi2", m_finalCutMaxVertexChi2);
- declareProperty("cutVertexDependence", m_cutVertexDependence);
- declareProperty("MinWeight", m_minweight);
- declareProperty("realMultiVertex", m_realMultiVertex);
- declareProperty("useFastCompatibility", m_useFastCompatibility);
- declareProperty("useBeamConstraint", m_useBeamConstraint);
- declareProperty("addSingleTrackVertices", m_addSingleTrackVertices);
- declareProperty("tracksMaxSignificance",m_tracksMaxSignificance);
- declareProperty("m_useSeedConstraint",m_useSeedConstraint);
- //********* signal vertex selection (for pile up) ****
- declareProperty("selectiontype", m_selectiontype);
- //==0 for sum p_t^2
- //==1 for NN
- //==2 for min bias compatibility estimation (in the future)
- declareProperty("maxIterations", m_maxIterations);
- declareProperty("do3dSplitting", m_do3dSplitting);
- declareProperty("zBfieldApprox", m_zBfieldApprox);
- declareProperty("maximumVertexContamination", m_maximumVertexContamination);
- declareProperty( "IPEstimator", m_ipEstimator );
-
- }
-
- InDetAdaptiveMultiPriVxFinderTool::~InDetAdaptiveMultiPriVxFinderTool()
- {}
-
- StatusCode
- InDetAdaptiveMultiPriVxFinderTool::initialize() {
- /* Get the right vertex fitting tool */
- ATH_CHECK(m_MultiVertexFitter.retrieve());
-
- ATH_CHECK(m_analyticSeedFinder.retrieve());
-
- ATH_CHECK(m_beamSpotKey.initialize());
-
- ATH_CHECK(m_trkFilter.retrieve());
-
- // since some parameters special to an inherited class this method
- // will be overloaded by the inherited class
- if (msgLvl(MSG::DEBUG)) printParameterSettings();
-
- ATH_MSG_INFO("Initialization successful");
- return StatusCode::SUCCESS;
- }
-
- namespace
- {
- struct xAODVertex_pair {
- double first;
- xAOD::Vertex* second;
- xAODVertex_pair(double p1, xAOD::Vertex* p2)
- : first(p1), second(p2) {}
- bool
- operator < (const xAODVertex_pair& other) const
- {return first > other.first;}
- };
- } //anonymous namespace
-
-
-
-
-
-
-xAOD::Vertex::Decorator< Trk::MvfFitInfo* > MvfFitInfo("MvfFitInfo");
- xAOD::Vertex::Decorator< bool > isInitialized("isInitialized");
- xAOD::Vertex::Decorator< std::vector< Trk::VxTrackAtVertex* > > VTAV("VTAV");
-
- if (m_selectiontype == 1) {//if you have to use NN, load the class
- m_testingclass = new NN();//check later for MEMORY LEAK
- }
-
- //---- Start of preselection of tracks according to perigee parameters ---------------//
- std::vector<const Trk::ITrackLink*> origTracks = trackVector;
- std::vector<const Trk::ITrackLink*> seedTracks = trackVector;
-
- //now all tracks are in origTracks... std::vector<const Track*> origTracks;
- std::vector<xAODVertex_pair> myxAODVertices;
-
- std::vector<Trk::TrackToVtxLink*> myTrackToVtxLinks;
-
- xAOD::VertexContainer* theVertexContainer = new xAOD::VertexContainer;
- xAOD::VertexAuxContainer* theVertexAuxContainer = new xAOD::VertexAuxContainer;
- theVertexContainer->setStore(theVertexAuxContainer);
-
- Amg::Vector3D actualVertex;
-
-
- std::map<const Trk::ITrackLink*, Trk::TrackToVtxLink*> TrackLinkOf;
-
- //create a map between ITrackLink* and TrackToVtxLink*
- std::vector<const Trk::ITrackLink*>::const_iterator trkbegin = origTracks.begin();
- std::vector<const Trk::ITrackLink*>::const_iterator trkend = origTracks.end();
-
-
- for (std::vector<const Trk::ITrackLink*>::const_iterator trkiter = trkbegin; trkiter != trkend; ++trkiter) {
- Trk::TrackToVtxLink* newTrkToVtxLink(new Trk::TrackToVtxLink(new std::vector<xAOD::Vertex*>)); // makePrivateStore()
- // is called for
- // each vertex to
- // add in iteration
- TrackLinkOf[*trkiter] = newTrkToVtxLink;
- myTrackToVtxLinks.push_back(newTrkToVtxLink);
- }
-
-
- //prepare iterators for tracks only necessary for seeding
- std::vector<const Trk::ITrackLink*>::iterator seedtrkbegin = seedTracks.begin();
- std::vector<const Trk::ITrackLink*>::iterator seedtrkend = seedTracks.end();
- SG::ReadCondHandle<InDet::BeamSpotData> beamSpotHandle { m_beamSpotKey };
- int iteration = 0;
-
- int nNoCompatibleTracks(0);
- int nContamintationCut(0);
- int nWithin3sigma(0);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- unsigned int seedtracknumber = seedTracks.size();
- do {
- if (seedtracknumber == 0) {
- ATH_MSG_DEBUG("No tracks available after track selection for seeding. No finding done.");
- break;
- }
- iteration += 1;
- ATH_MSG_DEBUG("Starting iteration number " << iteration << " with " << seedtracknumber << " seed tracks.");
- //now use all the perigee parameters you have so far
- if (m_realMultiVertex == true) {
- trkbegin = origTracks.begin();
- trkend = origTracks.end();
- } else {
- trkbegin = seedTracks.begin();
- trkend = seedTracks.end();
- }
- std::vector<const Trk::TrackParameters*> perigeeList;
- for (std::vector<const Trk::ITrackLink*>::iterator seedtrkAtVtxIter = seedtrkbegin;
- seedtrkAtVtxIter != seedtrkend; ++seedtrkAtVtxIter) {
- perigeeList.push_back((*seedtrkAtVtxIter)->parameters());
- }
- xAOD::Vertex* constraintVertex = 0;
-
- // SEEDING START
-
- if (m_useBeamConstraint) {
- constraintVertex = new xAOD::Vertex();
- constraintVertex->makePrivateStore();
- constraintVertex->setPosition(beamSpotHandle->beamVtx().position());
- constraintVertex->setCovariancePosition(beamSpotHandle->beamVtx().covariancePosition());
- constraintVertex->setFitQuality(beamSpotHandle->beamVtx().fitQuality().chiSquared(),
- beamSpotHandle->beamVtx().fitQuality().doubleNumberDoF());
- std::pair<Amg::Vector3D,Amg::MatrixX> seedConstraintVertex = m_analyticSeedFinder->findAnalyticSeed(perigeeList, constraintVertex);
- actualVertex = seedConstraintVertex.first;
- if(m_useSeedConstraint){
- constraintVertex->setPosition(seedConstraintVertex.first);
- constraintVertex->setCovariancePosition(seedConstraintVertex.second);
- }
- } else {
- actualVertex = m_analyticSeedFinder->findSeed(perigeeList);
- Amg::MatrixX looseConstraintCovariance(3, 3);
- looseConstraintCovariance.setIdentity();
- looseConstraintCovariance = looseConstraintCovariance * 1e+8;
- constraintVertex = new xAOD::Vertex();
- constraintVertex->makePrivateStore();
- constraintVertex->setPosition(actualVertex);
- constraintVertex->setCovariancePosition(looseConstraintCovariance);
- constraintVertex->setFitQuality(0., -3.);
- }
- // TODO: memory leak here with theconstraint when the loop breaks?
- if (actualVertex.z() == 0.) {
- ATH_MSG_DEBUG("No seed found: no further primary vertex finding performed on this event");
- ATH_MSG_DEBUG(perigeeList.size() << " tracks passed to seed finder, but no seed returned.");
- // TODO: Do I need this?
- delete constraintVertex;
- constraintVertex = 0;
- break;
- }
-
- // SEEDING END
-
- //new xAOD::Vertex with this
- xAOD::Vertex* actualcandidate = new xAOD::Vertex;
- actualcandidate->makePrivateStore();
- actualcandidate->setVertexType(xAOD::VxType::NotSpecified); // to mimic the initialization present in the old EDM // constructor
- // now add decorations!
- MvfFitInfo(*actualcandidate) = new Trk::MvfFitInfo(constraintVertex,
- new Amg::Vector3D(actualVertex),
- new Amg::Vector3D(actualVertex));
- isInitialized(*actualcandidate) = false;
- std::vector<Trk::VxTrackAtVertex*> vector_of_tracks(0);
- VTAV(*actualcandidate) = vector_of_tracks; // TODO: maybe needed before push_back?
- //now iterate on all tracks and find out if they are sufficiently close to the found vertex
-
- ATH_MSG_VERBOSE("Adding tracks to the vertex candidate now");
-
- // ADD COMPATIBLE TRACKS TO VTX CANDIDATE START
-
- for (std::vector<const Trk::ITrackLink*>::const_iterator trkiter = trkbegin; trkiter != trkend; ++trkiter) {
- if (std::fabs(estimateDeltaZ(*(*trkiter)->parameters(), actualVertex)) < m_TracksMaxZinterval) {
- const double thisTracksSignificance = ipSignificance((*trkiter)->parameters(),&actualVertex); // calculate significance
- if ( thisTracksSignificance<m_tracksMaxSignificance)
- {
- //accessing corresponding link to vertices
- Trk::TrackToVtxLink* actuallink = TrackLinkOf[*trkiter];
- std::vector<xAOD::Vertex*>* actualvtxlink = actuallink->vertices();
- //adding vertex to candidates of track
- actualvtxlink->push_back(actualcandidate);
- ATH_MSG_VERBOSE("Adding an MVFVxTrackAtVertex with tracklink " << actuallink <<
- " to the vertex candidate VTAV decoration");
- VTAV(*actualcandidate).push_back(new Trk::MVFVxTrackAtVertex((*trkiter)->clone(),
- actuallink));
- }
- }
- }
- ATH_MSG_DEBUG(VTAV(*actualcandidate).size() << " tracks added to vertex candidate for IP significance less than " << m_tracksMaxSignificance << " within " << m_TracksMaxZinterval << " mm of seed position.");
- //now consider to recovery from the case where no tracks were added to the vertex
- if (VTAV(*actualcandidate).empty()) {
- //you need to define a new seed (because the old one is probably in between two ones...)
- double zdistance = 1e8;
- const Trk::ITrackLink* nearestTrack = 0;
- for (std::vector<const Trk::ITrackLink*>::const_iterator seedtrkiter = seedtrkbegin;
- seedtrkiter != seedtrkend; ++seedtrkiter) {
- if (std::fabs((*seedtrkiter)->parameters()->position()[Trk::z] - actualVertex.z()) < zdistance) {
- zdistance = std::fabs((*seedtrkiter)->parameters()->position()[Trk::z] - actualVertex.z());
- nearestTrack = *seedtrkiter;
- }
- }
- if (nearestTrack) {
- double newz = (nearestTrack->parameters())->position()[Trk::z];
- xAOD::Vertex* oldcandidate = actualcandidate; // to placehold old pointers
-
- actualVertex = Amg::Vector3D(0., 0., newz);
- actualcandidate = new xAOD::Vertex();
- actualcandidate->makePrivateStore();
- actualcandidate->setVertexType(xAOD::VxType::NotSpecified); // to mimic the initialization present in the old
- // EDM constructor
- // TODO: Think about where everything is deleted! Does Trk::MvfFitInfo destructor and do MVFVxTrackAtVertex
- // destructors get called when actualcandidate gets deleted?
- // now add decorations!
- MvfFitInfo(*actualcandidate) = new Trk::MvfFitInfo(new xAOD::Vertex(*constraintVertex),
- new Amg::Vector3D(actualVertex),
- new Amg::Vector3D(actualVertex));
- isInitialized(*actualcandidate) = false;
- VTAV(*actualcandidate) = vector_of_tracks; // TODO: maybe needed before push_back?
-
- releaseCandidate(oldcandidate);
-
- for (std::vector<const Trk::ITrackLink*>::const_iterator trkiter = trkbegin; trkiter != trkend; ++trkiter) {
-
- if (std::fabs(estimateDeltaZ(*(*trkiter)->parameters(), actualVertex)) < m_TracksMaxZinterval) {
- const double thisTracksSignificance = ipSignificance((*trkiter)->parameters(),&actualVertex); // calculate significance
- if ( thisTracksSignificance<m_tracksMaxSignificance)
- {
- //accessing corresponding link to vertices
- Trk::TrackToVtxLink* actuallink = TrackLinkOf[*trkiter];
- std::vector<xAOD::Vertex*>* actualvtxlink = actuallink->vertices();
- //adding vertex to candidates of track
- actualvtxlink->push_back(actualcandidate);
- ATH_MSG_VERBOSE("Adding an MVFVxTrackAtVertex with tracklink " << actuallink <<
- " to the vertex candidate VTAV decoration");
- VTAV(*actualcandidate).push_back(new Trk::MVFVxTrackAtVertex((*trkiter)->clone(),
- actuallink));
- }
- }
- }
-
- if (VTAV(*actualcandidate).empty()) {
- ATH_MSG_DEBUG("No tracks found near seed, while at least one track was expected.");
- delete actualcandidate;
- break;
- }
- } else {
- ATH_MSG_DEBUG("Nearest track to seed is missing.");
- delete actualcandidate;
- break;
- }
- }
-
- // ADD COMPATIBLE TRACKS TO VTX CANDIDATE END
-
- // RUN FITTER START
-
- ATH_MSG_VERBOSE("Running addVtxTofit(); The current candidate has " << VTAV(*actualcandidate).size() <<
- " tracks in the vector");
- m_MultiVertexFitter->addVtxTofit(actualcandidate);
- ATH_MSG_DEBUG("After fit the current candidate has z: " << actualcandidate->position()[Trk::z]);
-
- // RUN FITTER END
-
- // CHECK TRACKS/GOOD VTX AFTER FIT START
-
- //get link to the tracks (they are now all properly in the std::vector<Trk::VxTrackAtVertex> of the xAOD::Vertex)
- // TODO: maybe I shouldn't be using xAOD::Vertex vector at all for VxTrackAtVertex...
- std::vector<Trk::VxTrackAtVertex*>::iterator trkAtVtxbegin = VTAV(*actualcandidate).begin();
- std::vector<Trk::VxTrackAtVertex*>::iterator trkAtVtxend = VTAV(*actualcandidate).end();
- //now check that there is at least one track added to the fit
- //(this is not always the case because only tracks above a certain compatibility threshold are considered)
- bool atleastonecompatibletrack = false;
- int numberOfCompatibleTracks = 0;
- for (std::vector<Trk::VxTrackAtVertex*>::iterator trkAtVtxIter = trkAtVtxbegin;
- trkAtVtxIter != trkAtVtxend; ++trkAtVtxIter) {
- ATH_MSG_VERBOSE("Compatibility: " << (*trkAtVtxIter)->vtxCompatibility() <<
- " weight " << (*trkAtVtxIter)->weight());
-
-
- if (((*trkAtVtxIter)->vtxCompatibility() < m_maxVertexChi2 && m_useFastCompatibility) ||
- ((*trkAtVtxIter)->weight() > m_minweight
- && (*trkAtVtxIter)->trackQuality().chiSquared() < m_maxVertexChi2
- && !m_useFastCompatibility)) {
-
- const Trk::ITrackLink* foundTrack = 0;
- for (std::vector<const Trk::ITrackLink*>::const_iterator seedtrkiter =
- seedtrkbegin; seedtrkiter != seedtrkend;
- ++seedtrkiter) {
- if ((*seedtrkiter)->parameters() == (*trkAtVtxIter)->trackOrParticleLink()->parameters()) {
- foundTrack = *seedtrkiter;
- }
- }
- if (foundTrack != 0) {
- atleastonecompatibletrack = true;
- numberOfCompatibleTracks += 1;
- ATH_MSG_VERBOSE("Found compatible track");
- if (m_addSingleTrackVertices) {
- if (m_useBeamConstraint) break;
- if (numberOfCompatibleTracks > 1 && (!m_useBeamConstraint)) break;
- } else {
- if (numberOfCompatibleTracks > 1) break;
- }
- }
- }
-
-
- }
-
- bool newVertexIsFine = false;
- if (m_addSingleTrackVertices) {
- if (m_useBeamConstraint) {
- if (numberOfCompatibleTracks > 0) {
- newVertexIsFine = true;
- }
- } else {
- if (numberOfCompatibleTracks > 1) {
- newVertexIsFine = true;
- }
- }
- }
-
-
-
- else {
- if (numberOfCompatibleTracks > 1) {
- newVertexIsFine = true;
- }
- }
-
-
- // CHECK TRACKS/GOOD VTX AFTER FIT END
-
- // REMOVE COMPATIBLE TRACKS FROM SEED START
-
- ATH_MSG_VERBOSE("newVertexIsFine = " << newVertexIsFine);
- //this now should be so powerful to do everything by itself
- //problem now is to delete the really compatible tracks to this fit from the tracks
- //which still remain to be fitted
- if (atleastonecompatibletrack) {
- for (std::vector<Trk::VxTrackAtVertex*>::iterator trkAtVtxIter = trkAtVtxbegin;
- trkAtVtxIter != trkAtVtxend; ++trkAtVtxIter) {
-
-
- //for now using the compatibility at stage before end...
- ATH_MSG_VERBOSE("The compatibility value of the track " << *trkAtVtxIter <<
- " is " << (*trkAtVtxIter)->vtxCompatibility());
- if (((*trkAtVtxIter)->vtxCompatibility() < m_maxVertexChi2 && m_useFastCompatibility) ||
- ((*trkAtVtxIter)->weight() > m_minweight
- && (*trkAtVtxIter)->trackQuality().chiSquared() < m_maxVertexChi2
- && !m_useFastCompatibility)) {
- ATH_MSG_VERBOSE("Eliminating incompatible track");
-
- std::vector<const Trk::ITrackLink*>::iterator foundTrack = seedtrkend;
- for (std::vector<const Trk::ITrackLink*>::iterator seedtrkiter = seedtrkbegin; seedtrkiter != seedtrkend;
- ++seedtrkiter) {
- if ((*seedtrkiter)->parameters() == (*trkAtVtxIter)->trackOrParticleLink()->parameters()) {
- foundTrack = seedtrkiter;
- }
- }
- ATH_MSG_VERBOSE("Trying to find track now");
- if (foundTrack != seedtrkend) {
- ATH_MSG_VERBOSE("Track found: eliminating it");
- seedTracks.erase(foundTrack);
-
- //update end and begin??? should I? yes, he can copy, regenerate, you don't know!
- seedtrkbegin = seedTracks.begin();
- seedtrkend = seedTracks.end();
-
- ATH_MSG_VERBOSE("Remaining seeds: " << seedTracks.size());
- }
- }
-
-
-
- } // trackatvertex loop end
- }
-
- // REMOVE COMPATIBLE TRACKS FROM SEED END
-
- // NO COMPATIBLE TRACKS FOUND START
-
-
- else {//no compatible track found...
- //in this case put out the highest seeding track which didn't give any good result...
- double highestcompatibility = 0;
- Trk::VxTrackAtVertex* trackHighestCompatibility = 0;
-
- ATH_MSG_VERBOSE("Analyzing new vertex");
-
- for (std::vector<Trk::VxTrackAtVertex*>::iterator trkAtVtxIter = trkAtVtxbegin;
- trkAtVtxIter != trkAtVtxend; ++trkAtVtxIter) {
- ATH_MSG_VERBOSE("Checking new track for compatibility");
- const Trk::ITrackLink* foundTrack = 0;
- for (std::vector<const Trk::ITrackLink*>::const_iterator seedtrkiter =
- seedtrkbegin; seedtrkiter != seedtrkend;
- ++seedtrkiter) {
- if ((*seedtrkiter)->parameters() == (*trkAtVtxIter)->trackOrParticleLink()->parameters()) {
- foundTrack = *seedtrkiter;
- }
- }
- if (foundTrack != 0) {
- double compatibility = (*trkAtVtxIter)->vtxCompatibility();
- ATH_MSG_VERBOSE("New track has compatibility: " << compatibility);
- if (compatibility > highestcompatibility) {
- highestcompatibility = compatibility;
- trackHighestCompatibility = *trkAtVtxIter;
- }
- }
- }
-
-
- ATH_MSG_VERBOSE("Highest compatibility track:" << trackHighestCompatibility <<
- "with compatibility: " << highestcompatibility);
- if (trackHighestCompatibility != 0) {
- std::vector<const Trk::ITrackLink*>::iterator foundTrack = seedtrkend;
- for (std::vector<const Trk::ITrackLink*>::iterator seedtrkiter = seedtrkbegin; seedtrkiter != seedtrkend;
- ++seedtrkiter) {
- if ((*seedtrkiter)->parameters() == trackHighestCompatibility->trackOrParticleLink()->parameters()) {
- foundTrack = seedtrkiter;
- }
- }
- if (foundTrack != seedtrkend) {
- seedTracks.erase(foundTrack);
- seedtrkbegin = seedTracks.begin();
- seedtrkend = seedTracks.end();
- } else {
- ATH_MSG_FATAL("Cannot find previously determined track ");
- throw;
- }
- } else {
- //alternative method: delete seed track nearest in z to the seed
- double zdistance = 1e8;
- const Trk::ITrackLink* nearestTrack = 0;
- for (std::vector<const Trk::ITrackLink*>::const_iterator seedtrkiter = seedtrkbegin;
- seedtrkiter != seedtrkend; ++seedtrkiter) {
- if (std::fabs((*seedtrkiter)->parameters()->position()[Trk::z] - actualVertex.z()) < zdistance) {
- zdistance = std::fabs((*seedtrkiter)->parameters()->position()[Trk::z] - actualVertex.z());
- nearestTrack = *seedtrkiter;
- }
- }
- if (nearestTrack != 0) {
- std::vector<const Trk::ITrackLink*>::iterator foundTrackToDelete =
- std::find(seedtrkbegin, seedtrkend, nearestTrack);
- if (foundTrackToDelete != seedtrkend) {
- seedTracks.erase(foundTrackToDelete);
- seedtrkbegin = seedTracks.begin();
- seedtrkend = seedTracks.end();
- } else {
- ATH_MSG_DEBUG("No nearest track found while it was expected.");
- break;
- }
- } else {
- ATH_MSG_DEBUG("No further seeding track was found (3 methods used) while it was expected.");
- break;
- }
- }
- }
-
- // NO COMPATIBLE TRACKS FOUND END
-
- // DEAL WITH BAD VERTEX 1 START
-
-
- ///////////////
- //now break the cycle if you didn't diminish the number of seeds...
- ATH_MSG_DEBUG("Remaining seeds: " << seedTracks.size() << " previous round " << seedtracknumber);
- bool deleteLastVertex = false;
- if (!newVertexIsFine) {
- deleteLastVertex = true;
- nNoCompatibleTracks++;
- ATH_MSG_DEBUG("Vertex has no compatible tracks");
- }
-
- // DEAL WITH BAD VERTEX 1 END
-
- // DEAL WITH GOOD VERTEX 1 START
-
- else {
- double contamination = 0.;
- double contaminationNum = 0;
- double contaminationDeNom = 0;
- std::vector<Trk::VxTrackAtVertex*>::iterator TRKtrkbegin(VTAV(*actualcandidate).begin());
- std::vector<Trk::VxTrackAtVertex*>::iterator TRKtrkend(VTAV(*actualcandidate).end());
- for (std::vector<Trk::VxTrackAtVertex*>::iterator TRKtrkiter = TRKtrkbegin; TRKtrkiter != TRKtrkend;
- ++TRKtrkiter) {
- double trackWeight = (*TRKtrkiter)->weight();
- contaminationNum += trackWeight * (1. - trackWeight);
- contaminationDeNom += trackWeight * trackWeight;
- }
- if (contaminationDeNom > 0) {
- contamination = contaminationNum / contaminationDeNom;
- }
- if (contamination > m_maximumVertexContamination) {
- ATH_MSG_VERBOSE(
- "Contamination estimator " << contamination << " fails cut of " << m_maximumVertexContamination);
- deleteLastVertex = true;
- nContamintationCut++;
- ATH_MSG_DEBUG("Vertex failed contamination cut");
- }
- //now try to understand if the vertex was merged with another one...
- const auto & candidatePosition = actualcandidate->position();
- const auto & candidateZPosition = candidatePosition[Trk::z];
- const auto & candidatePositionCovariance = actualcandidate->covariancePosition();
- const auto & candidateZPositionCovariance = candidatePositionCovariance(Trk::z, Trk::z);
- for (const auto & thisVertex: myxAODVertices) {
- const auto & thisVertexPosition = (thisVertex.second)->position();
- const auto & thisVertexZPosition = thisVertexPosition[Trk::z];
- const auto & thisVertexPositionCovariance = thisVertex.second->covariancePosition();
- const auto & thisVertexZPositionCovariance = thisVertexPositionCovariance(Trk::z, Trk::z);
- const auto deltaPosition = thisVertexPosition - candidatePosition;
- const auto deltaZPosition = thisVertexZPosition - candidateZPosition;
- const auto sumZCovSq = thisVertexZPositionCovariance + candidateZPositionCovariance;
-
- ATH_MSG_VERBOSE("Estimating compatibility of z positions: " << thisVertexZPosition <<" and " << candidateZPosition);
- //in case of no beam spot constraint you should use the full 3d significance on the distance
- double dependence = 0;
- if (!m_do3dSplitting) {
- if (sumZCovSq > 0. ){
- dependence = std::fabs(deltaZPosition) / std::sqrt(sumZCovSq);
- } else {
- dependence = 0.;
- }
- } else {
- Amg::MatrixX sumCovariances = thisVertexPositionCovariance + candidatePositionCovariance;
- sumCovariances = sumCovariances.inverse().eval();
- Amg::Vector3D hepVectorPosition;
- hepVectorPosition[0] = deltaPosition.x();
- hepVectorPosition[1] = deltaPosition.y();
- hepVectorPosition[2] = deltaPosition.z();
- dependence = std::sqrt(hepVectorPosition.dot(sumCovariances * hepVectorPosition));
- }
- ATH_MSG_VERBOSE("Significance of vertex pair is: " << dependence << "vs. cut at " << m_cutVertexDependence);
- if (dependence < m_cutVertexDependence) {
- ATH_MSG_VERBOSE("Deleting last vertex since it was found to be merged with another!");
- deleteLastVertex = true;
- nWithin3sigma++;
- ATH_MSG_DEBUG("Vertex failed significance (cut vertex dependence) test");
- break;
- }
- }
- }
- ATH_MSG_VERBOSE("Decision to delete last vertex: " << deleteLastVertex);
-
- // DEAL WITH GOOD VERTEX 1 END
-
- // DELETE BAD VERTEX START
-
-
- ////////////
- //Ok all tracks in seed were deleted. You can go ahead and discover further vertices...
- //please clean the track to vertices links before (required by real multivertexfit)
- if (deleteLastVertex) {
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkAtVtxBegin = VTAV(*actualcandidate).begin();
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkAtVtxEnd = VTAV(*actualcandidate).end();
- for (std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkIterator = MVFtrkAtVtxBegin;
- MVFtrkIterator != MVFtrkAtVtxEnd; ++MVFtrkIterator) {
- ATH_MSG_VERBOSE("Deleting one vertex from tracklink " <<
- (static_cast<Trk::MVFVxTrackAtVertex*>(*MVFtrkIterator))->linkToVertices());
- (static_cast<Trk::MVFVxTrackAtVertex*>(*MVFtrkIterator))->linkToVertices()->vertices()->pop_back();
- }
- seedtracknumber = seedTracks.size();
- ATH_MSG_VERBOSE("Redoing fit after scrapping last vertex");
- m_MultiVertexFitter->addVtxTofit(actualcandidate); // TODO: I think this is fine still, but think about it more
- releaseCandidate(actualcandidate);
- }
-
- // DELETE BAD VERTEX START
-
- // SAVE GOOD VERTEX START
-
- else {
- seedtracknumber = seedTracks.size();
- ATH_MSG_VERBOSE("Storing new vertex with " << actualcandidate->vxTrackAtVertex().size() << " tracks");
- myxAODVertices.push_back(xAODVertex_pair(0,actualcandidate));
- }
- // SAVE GOOD VERTEX END
- } while ((
- (m_addSingleTrackVertices && seedTracks.size() > 0) ||
- ((!m_addSingleTrackVertices) && seedTracks.size() > 1))
- && iteration < m_maxIterations);
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- if (iteration >= m_maxIterations) {
- ATH_MSG_WARNING("Maximum number of iterations (" << m_maxIterations <<
- ") reached; to reconstruct more vertices, set maxIterations to a higher value.");
- }
-
- ATH_MSG_DEBUG("Vertices deleted for no compatible tracks: " << nNoCompatibleTracks);
- ATH_MSG_DEBUG("Vertices deleted for contamination cut: " << nContamintationCut);
- ATH_MSG_DEBUG("Vertices deleted for proximity to previous: " << nWithin3sigma);
-
- ATH_MSG_DEBUG("Primary vertex finding complete with " << iteration <<
- " iterations and " << myxAODVertices.size() << " vertices found.");
-
- //correction of a bug: you can estimate the probability of being
- //the primary interaction vertex only after the whole multivertexfit
- //is finished!!! (the first is influenced by the fit of the second and so
- //on...)
- std::vector<xAODVertex_pair>::iterator vtxBegin = myxAODVertices.begin();
- std::vector<xAODVertex_pair>::iterator vtxEnd = myxAODVertices.end();
- // To make sure that the right tracks are in the std::vector<Trk::VxTrackAtVertex> of each vertex - up until now,
- // they are kept in the VTAV decoration
- for (std::vector<xAODVertex_pair>::iterator vtxIter = vtxBegin; vtxIter != vtxEnd; ++vtxIter) {
- xAOD::Vertex* cand = vtxIter->second;
- std::vector<Trk::VxTrackAtVertex>* tracksOfVertex = &(cand->vxTrackAtVertex());
- tracksOfVertex->clear();
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkBegin = VTAV(*cand).begin();
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkEnd = VTAV(*cand).end();
- for (std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkIter = MVFtrkBegin; MVFtrkIter != MVFtrkEnd;
- ++MVFtrkIter) {
- tracksOfVertex->push_back(**MVFtrkIter);
- }
- }
- //before filling the container, you have to decide what is your most probable signal vertex
- for (std::vector<xAODVertex_pair>::iterator vtxIter = vtxBegin; vtxIter != vtxEnd; ++vtxIter) {
- (*vtxIter).first = estimateSignalCompatibility((*vtxIter).second);
- }
- std::sort(myxAODVertices.begin(), myxAODVertices.end());
- if (msgLvl(MSG::VERBOSE)) {
- ATH_MSG_VERBOSE("Vertex positions after sorting");
- for (std::vector<xAODVertex_pair>::iterator vtxIter = vtxBegin; vtxIter != vtxEnd; ++vtxIter) {
- ATH_MSG_VERBOSE("z position: " << (*vtxIter).second->position().z());
- }
- }
- if (myxAODVertices.size() == 0) {
- ATH_MSG_WARNING("No vertices found: returning a place-holder at the beam spot center.");
- xAOD::Vertex* beamspotCandidate = new xAOD::Vertex;
- beamspotCandidate->makePrivateStore();
- beamspotCandidate->setPosition(beamSpotHandle->beamVtx().position());
- beamspotCandidate->setCovariancePosition(beamSpotHandle->beamVtx().covariancePosition());
- beamspotCandidate->vxTrackAtVertex() = std::vector<Trk::VxTrackAtVertex>();
- // TODO: I don't need to set fitQuality too do I?
- myxAODVertices.push_back(xAODVertex_pair(0, beamspotCandidate));
- }
- vtxBegin = myxAODVertices.begin();
- vtxEnd = myxAODVertices.end();
- for (std::vector<xAODVertex_pair>::const_iterator vtxIter = vtxBegin; vtxIter != vtxEnd; ++vtxIter) {
- xAOD::Vertex* cand = vtxIter->second;
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkBegin = VTAV(*cand).begin();
- std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkEnd = VTAV(*cand).end();
- // TODO: here, I must clean up VTAV decoration separately from vector of VxTrackAtVertex
- for (std::vector<Trk::VxTrackAtVertex*>::iterator MVFtrkIter = MVFtrkBegin; MVFtrkIter != MVFtrkEnd;
- ++MVFtrkIter) {
- //setting link to TrackToVtxLink to 0 (all TrackToVtxLink will be deleted some lines later)
- (static_cast<Trk::MVFVxTrackAtVertex*>(*MVFtrkIter))->setLinkToVertices(0);
- delete *MVFtrkIter;
- *MVFtrkIter = 0;
- }
- //delete VTAV( *cand );
- delete MvfFitInfo(*cand);
- std::vector<Trk::VxTrackAtVertex>::iterator trkAtVtxBegin = cand->vxTrackAtVertex().begin();
- std::vector<Trk::VxTrackAtVertex>::iterator trkAtVtxEnd = cand->vxTrackAtVertex().end();
- for (std::vector<Trk::VxTrackAtVertex>::iterator trkAtVtxIter = trkAtVtxBegin; trkAtVtxIter != trkAtVtxEnd; ) {//++trkAtVtxIter) // {
- //cleaning up incompatible vertices
- if (((*trkAtVtxIter).vtxCompatibility() > m_maxVertexChi2 && m_useFastCompatibility) ||
- (((*trkAtVtxIter).weight() < m_minweight
- || (*trkAtVtxIter).trackQuality().chiSquared() > m_maxVertexChi2)
- && !m_useFastCompatibility)) {
- trkAtVtxIter = cand->vxTrackAtVertex().erase(trkAtVtxIter);
- trkAtVtxEnd = cand->vxTrackAtVertex().end();
- } else {
- ++trkAtVtxIter;
- }
- }
- theVertexContainer->push_back(cand);
- }
- // If track links are to xAOD::TrackParticles, set the links directly in xAOD::Vertex with their weights
- // Needed for weight calculator in sorting tool
- xAOD::VertexContainer::iterator vxBegin = theVertexContainer->begin();
- xAOD::VertexContainer::iterator vxEnd = theVertexContainer->end();
- for (xAOD::VertexContainer::iterator vxIter = vxBegin; vxIter != vxEnd; ++vxIter) {
- std::vector<Trk::VxTrackAtVertex>* myVxTracksAtVtx = &((*vxIter)->vxTrackAtVertex());
- if (!myVxTracksAtVtx) continue;
- std::vector<Trk::VxTrackAtVertex>::iterator tracksBegin = myVxTracksAtVtx->begin();
- std::vector<Trk::VxTrackAtVertex>::iterator tracksEnd = myVxTracksAtVtx->end();
- for (std::vector<Trk::VxTrackAtVertex>::iterator tracksIter = tracksBegin;
- tracksIter != tracksEnd; ++tracksIter) {
- // only set link if track link is to an xAOD::TrackParticle
- Trk::LinkToXAODTrackParticle* linkToXAODTP =
- dynamic_cast<Trk::LinkToXAODTrackParticle*>((*tracksIter).trackOrParticleLink());
- if (linkToXAODTP) {
- ATH_MSG_VERBOSE("Iterating over new vertex in fixing xAOD::TrackParticle links... ");
- (*vxIter)->addTrackAtVertex(*linkToXAODTP, (*tracksIter).weight());
- } // TODO: esle write in a warning? (if tracks were TrkTracks or Trk::TrackParticleBase) - sorting tool expects
- // there to be xAOD::TrackParticleLinks!
- }
- }
- if (m_selectiontype == 1 && m_testingclass != 0) delete m_testingclass;
- std::vector<Trk::TrackToVtxLink*>::iterator begin = myTrackToVtxLinks.begin();
- std::vector<Trk::TrackToVtxLink*>::iterator end = myTrackToVtxLinks.end();
- //delete all TrackToVtxLink objects
- for (std::vector<Trk::TrackToVtxLink*>::iterator iterator = begin; iterator != end; ++iterator) {
- delete *iterator;
- }
- //---- add dummy vertex at the end ------------------------------------------------------//
- //---- if one or more vertices are already there: let dummy have same position as primary vertex
- if (theVertexContainer->size() >= 1) {
- xAOD::Vertex* primaryVtx = theVertexContainer->front();
- if (primaryVtx->vxTrackAtVertex().size() > 0) {
- primaryVtx->setVertexType(xAOD::VxType::PriVtx);
- xAOD::Vertex* dummyxAODVertex = new xAOD::Vertex;
- theVertexContainer->push_back(dummyxAODVertex); // have to add vertex to container here first so it can use its
- // aux store
- dummyxAODVertex->setPosition(primaryVtx->position());
- dummyxAODVertex->setCovariancePosition(primaryVtx->covariancePosition());
- dummyxAODVertex->vxTrackAtVertex() = std::vector<Trk::VxTrackAtVertex>();
- dummyxAODVertex->setVertexType(xAOD::VxType::NoVtx);
- } else {
- primaryVtx->setVertexType(xAOD::VxType::NoVtx);
- }
- }
- //---- if no vertex is there let dummy be at beam spot
- else if (theVertexContainer->size() == 0) {
- xAOD::Vertex* dummyxAODVertex = new xAOD::Vertex;
- theVertexContainer->push_back(dummyxAODVertex); // have to add vertex to container here first so it can use its
- // aux store
- dummyxAODVertex->setPosition(beamSpotHandle->beamVtx().position());
- dummyxAODVertex->setCovariancePosition(beamSpotHandle->beamVtx().covariancePosition());
- dummyxAODVertex->vxTrackAtVertex() = std::vector<Trk::VxTrackAtVertex>();
- dummyxAODVertex->setVertexType(xAOD::VxType::NoVtx);
- }
- // loop over the pile up to set it as pile up (EXCLUDE first and last vertex: loop from 1 to size-1)
- for (unsigned int i = 0; i < theVertexContainer->size() - 1; i++) {
- if (i > 0) {
- (*theVertexContainer)[i]->setVertexType(xAOD::VxType::PileUp);
- }
- ATH_MSG_VERBOSE("Vertex at z =" << (*theVertexContainer)[i]->position().z() <<
- " with ntracks: " << (*theVertexContainer)[i]->vxTrackAtVertex().size());
- }
- return std::make_pair(theVertexContainer, theVertexAuxContainer);
- }
-
- double
- InDetAdaptiveMultiPriVxFinderTool::estimateSignalCompatibility(xAOD::Vertex* mycand) {
- // TODO: put this in a better place
- // Prepare objects holding the decoration of xAOD::Vertex with MVF auxdata
- // For optimization of access speed
- xAOD::Vertex::Decorator< std::vector<Trk::VxTrackAtVertex*> > VTAV("VTAV");
-
- std::vector<Trk::VxTrackAtVertex*>::iterator begintracks = VTAV(*mycand).begin();
- std::vector<Trk::VxTrackAtVertex*>::iterator endtracks = VTAV(*mycand).end();
-
- if (m_selectiontype == 0) {
- //use just sum over pt squared
- //first get all the variables you need for to discriminate between signal and minimum bias event
-
- double total_pt_squared = 0;
- int total_num_tracks = 0;
-
- for (std::vector<Trk::VxTrackAtVertex*>::iterator i = begintracks; i != endtracks; i++) {
- ATH_MSG_VERBOSE("Compatibility is: " << (*i)->vtxCompatibility() <<
- " and chi^2 is: " << (*i)->trackQuality().chiSquared());
-
- if (((*i)->vtxCompatibility() < m_finalCutMaxVertexChi2 && m_useFastCompatibility) ||
- ((*i)->weight() > m_minweight
- && (*i)->trackQuality().chiSquared() < m_finalCutMaxVertexChi2
- && !m_useFastCompatibility)) {
- const Trk::TrackParameters* perigee(0);
- if ((*i)->perigeeAtVertex() != 0) {
- perigee = (*i)->perigeeAtVertex();
- } else {
- ATH_MSG_VERBOSE("Only initialPerigee is available");
- perigee = (*i)->initialPerigee();
- }
- if (perigee == 0) {
- ATH_MSG_ERROR("Neutrals are not supported. Skipping track in pT calculation...");
- continue;
- }
- total_pt_squared +=
- std::pow(std::fabs(1. / perigee->parameters()[Trk::qOverP]) * sin(perigee->parameters()[Trk::theta]), 2);
- total_num_tracks += 1;
- }
- }//finishing iterating on VxTrackAtVertex associated to **vtxIter xAOD::Vertex
-
- return total_pt_squared * std::sqrt((double) total_num_tracks);
- } else if (m_selectiontype == 1) {//use NN
- double pt_track1 = 0.;
- double pt_track2 = 0.;
- double pt_track3 = 0.;
- double pt_sum_linear = 0.;
- double pt_sum_quadratic = 0.;
-
- int total_num_tracks = 0;
- int prognumber = 0;
-
- for (std::vector<Trk::VxTrackAtVertex*>::iterator i = begintracks; i != endtracks; i++) {
- if (((*i)->vtxCompatibility() < m_finalCutMaxVertexChi2 && m_useFastCompatibility) ||
- ((*i)->weight() > m_minweight
- && (*i)->trackQuality().chiSquared() < m_finalCutMaxVertexChi2
- && !m_useFastCompatibility)) {
- const Trk::TrackParameters* perigee(0);
- if ((*i)->perigeeAtVertex() != 0) {
- perigee = (*i)->perigeeAtVertex();
- } else {
- ATH_MSG_VERBOSE("Only initialPerigee is available");
- perigee = (*i)->initialPerigee();
- }
- if (perigee == 0) {
- ATH_MSG_ERROR("Neutrals not supported. Skipping track in pT calculation...");
- continue;
- }
- double actualpt(std::fabs(1. / perigee->parameters()[Trk::qOverP]) * sin(perigee->parameters()[Trk::theta]));
- pt_sum_quadratic += std::pow(actualpt, 2);
- pt_sum_linear += actualpt;
- if (prognumber == 0) {
- pt_track1 = actualpt;
- prognumber += 1;
- } else if (prognumber == 1) {
- pt_track2 = actualpt;
- prognumber += 1;
- } else if (prognumber == 2) {
- pt_track3 = actualpt;
- prognumber += 1;
- }
- total_num_tracks += 1;
- }
- }
- if (total_num_tracks == 0 || pt_track2 == 0 || pt_track3 == 0) {
- return 0.;
- } else {
- return m_testingclass->value(0, pt_track1, pt_track2, pt_track3,
- pt_sum_linear, pt_sum_quadratic,
- total_num_tracks);
- }
- }
- return 0;
- }
-
- StatusCode
- InDetAdaptiveMultiPriVxFinderTool::finalize() {
- return StatusCode::SUCCESS;
- }
-
- void
- InDetAdaptiveMultiPriVxFinderTool::printParameterSettings() {
- ATH_MSG_DEBUG("Adaptive Multi-Vertex Finder: Parameter settings ");
- ATH_MSG_DEBUG("Trackselection cuts handled by the TrackSelectorTool: " << m_trkFilter);
- ATH_MSG_DEBUG("Finder settings: ");
- ATH_MSG_DEBUG(
- "Maximum distance to include track in simultaneous vertex fits: TracksMaxZinterval " << m_TracksMaxZinterval);
- ATH_MSG_DEBUG("Seeding: minimum chi^2 for a track being an outlier: maxVertexChi2 " << m_maxVertexChi2);
- ATH_MSG_DEBUG("Signal identification: final cut on track chi2: finalCutMaxVertexChi2 = " <<
- m_finalCutMaxVertexChi2);
- ATH_MSG_DEBUG("Activate complete multi vertex fitting feature: realMultiVertex " << m_realMultiVertex);
- ATH_MSG_DEBUG("Merging vertices: upper cut on significance to merge two vertices: cutVertexDependence = " <<
- m_cutVertexDependence);
- ATH_MSG_DEBUG("Maximum number of iterations (and vertices): maxIterations = " << m_maxIterations);
- ATH_MSG_DEBUG("Selection type (0 is sqrt(Ntr)*Sum_{tr} pT^2): selectiontype = " << m_selectiontype);
- ATH_MSG_DEBUG("Use fast compatibility (if false use refitted chi2 instead of approximation): useFastCompatibility = " <<
- m_useFastCompatibility);
- ATH_MSG_DEBUG("MinWeight (if track weight in the fit is lower, don't perform the Kalman Update) = " << m_minweight);
- ATH_MSG_DEBUG("");
- }
-
- void
- InDetAdaptiveMultiPriVxFinderTool::SGError(std::string errService) {
- ATH_MSG_FATAL(errService << " not found. Exiting !");
- }
-
- double
- InDetAdaptiveMultiPriVxFinderTool::estimateDeltaZ(const Trk::TrackParameters& myPerigee,
- const Amg::Vector3D& myTransvVertex) {
- Amg::Vector3D lp = myTransvVertex;
-
- Amg::Vector3D expPoint;
- Amg::Vector3D predStatePosition = myPerigee.position();
- expPoint[0] = predStatePosition.x();
- expPoint[1] = predStatePosition.y();
- expPoint[2] = predStatePosition.z();
-
- //phi_v and functions
- double phi_v = myPerigee.parameters()[Trk::phi];
- double th = myPerigee.parameters()[Trk::theta];
- double tan_th = std::tan(th);
- double sin_phi_v = std::sin(phi_v);
- double cos_phi_v = std::cos(phi_v);
- double q_ov_p = myPerigee.parameters()[Trk::qOverP];
-
- //momentum
- Amg::Vector3D expMomentum;
- expMomentum[0] = phi_v;
- expMomentum[1] = th;
- expMomentum[2] = q_ov_p;
-
- double X = expPoint[0] - lp.x();
- double Y = expPoint[1] - lp.y();
-
- return expPoint[2] - lp.z() - 1. / tan_th * (X * cos_phi_v + Y * sin_phi_v);
- }
-
- double InDetAdaptiveMultiPriVxFinderTool::ipSignificance( const Trk::TrackParameters* params,
- const Amg::Vector3D * vertex ) const
- {
- xAOD::Vertex v;
- v.makePrivateStore();
- v.setPosition(*vertex);
- v.setCovariancePosition(AmgSymMatrix(3)::Zero(3,3));
- v.setFitQuality(0., 0.);
-
- double significance = 0.0;
- const Trk::ImpactParametersAndSigma* ipas = m_ipEstimator->estimate( params, &v );
- if ( ipas != nullptr )
- {
- if ( ipas->sigmad0 > 0 && ipas->sigmaz0 > 0)
- {
- significance = std::sqrt( std::pow(ipas->IPd0/ipas->sigmad0,2) + std::pow(ipas->IPz0/ipas->sigmaz0,2) );
- }
- delete ipas;
- }
- return significance;
- }
-
- void
- InDetAdaptiveMultiPriVxFinderTool::releaseCandidate(xAOD::Vertex*& candidate) {
- if (candidate == nullptr) return;
-
- // decorators
- xAOD::Vertex::Decorator< Trk::MvfFitInfo* > MvfFitInfo("MvfFitInfo");
- xAOD::Vertex::Decorator< std::vector< Trk::VxTrackAtVertex* > > VTAV("VTAV");
-
- if (VTAV.isAvailable(*candidate)) {
- for (auto tav : VTAV(*candidate)) {
- if (tav == nullptr) continue;
- (static_cast<Trk::MVFVxTrackAtVertex*>(tav))->setLinkToVertices(nullptr);
- delete tav;
- tav = nullptr;
- }
- VTAV(*candidate).clear();
- }
-
- if (MvfFitInfo.isAvailable(*candidate) && MvfFitInfo(*candidate) != nullptr) {
- delete MvfFitInfo(*candidate);
- MvfFitInfo(*candidate) = nullptr;
- }
-
- delete candidate;
- candidate = nullptr;
- }
-
diff --git a/Core/include/Acts/Vertexing/legacy/AMVF.h b/Core/include/Acts/Vertexing/legacy/AMVF.h
deleted file mode 100644
index ce186b1ef39a4e469c3421dafaeb24880b741685..0000000000000000000000000000000000000000
--- a/Core/include/Acts/Vertexing/legacy/AMVF.h
+++ /dev/null
@@ -1,327 +0,0 @@
-/*
- Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
-*/
-
-/**
- * @class InDet::InDetAdaptiveMultiPriVxFinderTool
- *
- * @author Giacinto Piacquadio (Freiburg University)
- *
- * (giacinto.piacquadio@physik.uni-freiburg.de)
- *
- * This class provides an implementation for a primary
- * vertex finding tool, which uses the \<i\>Adaptive MultiVertex\</i\>
- * Fitter to solve the problem of finding the multiple
- * interaction vertices and to find out the best possible
- * assignment of the track to the vertices.
- *
- * The steps done are the following:
- * - the selection cuts are applied
- *
- * then iteratively:
- * - a new vertex is seeded with the remaining tracks
- * (the seed finder is used)
- * - all the tracks whose Z at PCA is closer to the seeded
- * vertex by more than TracksMaxZinterval (by JobOption),
- * are added to the new vertex candidate
- * - the new vertex candidate is added on top of the previous fit and
- * the AdaptiveMultiVertexFitter is used to fit all them
- * together (more information in the \<br\>\<i\>TrkVertexFitters\</br\>\</i\>
- * package).
- * - the tracks already used are removed from the tracks
- * from which the next seed would be obtained and if there
- * are more than 2 left, a new iteration is started.
- *
- * when no more than 2 seeding tracks are left:
- * - a vector of MVFVxCandidate is provided as result and
- * according to the selection type, the order in which it is
- * provided represents how high the probability of that
- * particular vertex to come from the primary vertex is.
- *
- * In general the first VxCandidate* in the collection is
- * the one with highest sqrt(N_tracks)*Sum Pt_track^2. This
- * is the case if the selectiontype in the jobOptions is set
- * to 0 (default).
- *
- *
- * This finder is particularly suited for the high luminosities
- * scenarios which will came up at LHC.
- *
- * ------------------------------------------------------------
- * Changes:
- *
- * David Shope <david.richard.shope@cern.ch> (2016-04-19)
- *
- * EDM Migration to xAOD - from Trk::VxCandidate to xAOD::Vertex,
- * from Trk::RecVertex to xAOD::Vertex,
- * from Trk::Vertex to Amg::Vector3D
- *
- * Also, VxMultiVertex EDM has been migrated to the following:
- *
- * Trk::MvfFitInfo
- * constraintVertex now uses xAOD::Vertex
- * seedVertex now uses Amg::Vector3D
- * linearizationVertex now uses Amg::Vector3D
- *
- * Trk::TrackToVtxLink
- * Vertex objects stored using this class are now xAOD::Vertex
- *
- * Instead of using the MVFVxCandidate class, xAOD::Vertex is employed by decorating it
- * with the multi-vertex information:
- *
- * bool isInitialized
- * MvfFitInfo* MvfFitInfo
- * std::Vector\<VxTrackAtVertex*\> VTAV
- *
- * This last decoration is needed in order to be able to use MVFVxTrackAtVertex objects
- * which have the additional information of xAOD::Vertices associated to the track
- * and (through polymorphism) to still be able to pass them to the KalmanVertexUpdator as
- * VxTracksAtVertex objects.
- */
-
-#ifndef INDETPRIVXFINDERTOOL_INDETADAPTIVEMULTIPRIVXFINDERTOOL_H
-#define INDETPRIVXFINDERTOOL_INDETADAPTIVEMULTIPRIVXFINDERTOOL_H
-
-#include "InDetRecToolInterfaces/IVertexFinder.h"
-#include "AthenaBaseComps/AthAlgTool.h"
-#include "GaudiKernel/ToolHandle.h"
-#include "GaudiKernel/ServiceHandle.h"
-#include "TrkTrack/TrackCollection.h" // type def ...
-#include "TrkParticleBase/TrackParticleBaseCollection.h"
-#include "TrkParameters/TrackParameters.h"
-
-/**
- * Forward declarations
- */
-#include "xAODTracking/VertexFwd.h"
-#include "xAODTracking/TrackParticleFwd.h"
-#include "xAODTracking/VertexContainerFwd.h"
-#include "xAODTracking/TrackParticleContainerFwd.h"
-#include "BeamSpotConditionsData/BeamSpotData.h"
-#include "TrkVertexFitterInterfaces/ITrackToVertexIPEstimator.h"
-class TrackToVtxLinkContainer;
-class NN;
-
-
-namespace Trk
-{
- class IVertexAnalyticSeedFinder;
- class AdaptiveMultiVertexFitter;
- class Track;
- class ITrackLink;
- class TrkQuality;
- class IVxCandidateXAODVertex;
-}
-
-
-namespace InDet
-{
- class IInDetTrackSelectionTool;
-
- class InDetAdaptiveMultiPriVxFinderTool : public AthAlgTool, virtual public IVertexFinder
- {
-
- public:
-
- InDetAdaptiveMultiPriVxFinderTool(const std::string& t, const std::string& n, const IInterface* p);
- virtual ~InDetAdaptiveMultiPriVxFinderTool();
-
- StatusCode initialize();
-
- /**
- * The MultiVertexFinding is performed.
- *
- * Input is the Track Collection. Output is the VertexContainer
- * with a list of fitted vertices, according to the probability
- * of being the primary interaction point.
- *
- * Description of the finder is provided as doxygen info on the class.
- *
- */
-
- std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer*> findVertex(const TrackCollection* trackTES);
- std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer*> findVertex(const Trk::TrackParticleBaseCollection* trackTES);
- std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer*> findVertex(const xAOD::TrackParticleContainer* trackParticles);
-
- StatusCode finalize();
-
- private:
-
- std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer*> findVertex(const std::vector<const Trk::ITrackLink*> & trackVector);
-
- void SGError(std::string errService);
- virtual void printParameterSettings();
-
- ToolHandle< Trk::AdaptiveMultiVertexFitter > m_MultiVertexFitter;
- ToolHandle< Trk::IVertexAnalyticSeedFinder > m_analyticSeedFinder;
- ToolHandle< InDet::IInDetTrackSelectionTool > m_trkFilter;
-
- SG::ReadCondHandleKey<InDet::BeamSpotData> m_beamSpotKey { this, "BeamSpotKey", "BeamSpotData", "SG key for beam spot" };
-
- /** Define a beam constraint for the fit */
- bool m_useBeamConstraint; //!< Use a vertex/beam constraint
-
-
- /**
- * When adding a new vertex to the multi vertex fit,
- * only the tracks whose Z at PCA is closer
- * to the seeded by more than this TracksMaxZinterval
- * value are added to this new vertex.
- *
- * Default is 4 mm. If you cut too hard, you cut out
- * the good cases where the seed finder is not
- * reliable, but the fit would be still able to converge
- * towards the right vertex. If you cut too soft, you
- * consider a lot of tracks which just slow down the fit.
- */
-
- double m_TracksMaxZinterval;
-
- /**
- * After having added one vertex to the fit and having
- * performed the MultiVertex fit again, all the tracks
- * which are compatible to the new vertex by more than
- * this maxVertexChi2 (in units of chi2) value are eliminated from the
- * tracks from which still to seed the next vertex.
- *
- */
-
- double m_maxVertexChi2;
-
- /**
- * As a default the realMultiVertex should stay to false (because this is very well tested).
- *
- * If switched to true, all the tracks are considered to be added to the new vertex
- * after this new one is seeded, and not only the ones which are considered as outliers
- * of previous fitted vertices.
- *
- * The presence of a core of tracks the previous vertices are as attached to stabilizes
- * the fit quite drastically. In case of luminosities higher than the low lumi scenario,
- * one should probably to try to switch this on, or, if this doesn't work, decrease the
- * maxVertexChi2 and the cleaningZinterval to lower values.
- */
-
- bool m_realMultiVertex;
-
-
- /*
- * Decides if you want to use the vtxCompatibility() of the track (set to true) or
- * the chi2() (set to false) as an estimate for a track being an outlier or not.
- * The vtxCompatibility() is the default. In case the track refitting
- * is switched on in the AdaptiveMultiVertex fitter, you may want to
- * use the refutted chi2().
- *
- */
-
- bool m_useFastCompatibility;
-
- /*
- * Selection of the most probable primary interaction vertex is done accordingly to:
- * - selectiontype is 0: just sqrt(N_tracks)*Sum_track p_t_track^2
- * - selectiontype is 1: Neural Network is used, trained on WH(120)
- */
-
- int m_selectiontype;
-
- /*
- * During the estimation of probability of vertex candidate to be the primary interaction
- * vertex, only all the tracks which have chi2 in the vertex fit higher than this value
- * are used for the sum of p_t^2 or as input for the Neural Network.
- */
-
- double m_finalCutMaxVertexChi2;
-
-
- /*
- * Maximum significance on the distance between two vertices
- * to allow merging of two vertices.
- *
- */
-
- double m_cutVertexDependence;
-
-
- /*
- * Has to be setup equal to the minimum weight set in the fitter.
- *
- * In the fitting, when a track has a weight lower than this value,
- * the track is not updated during that iteration.
- */
-
- double m_minweight;
-
-
- /*
- * Impact parameter estimator used to calculate significance
- */
- ToolHandle< Trk::ITrackToVertexIPEstimator > m_ipEstimator { "Trk::TrackToVertexIPEstimator" };
-
- /*
- * Maximum amount of iterations allowed for vertex finding.
- *
- * The more vertices you have in the event, the more iterations you have to
- * allow (safe factor: number of expected vertices * 10)
- *
- */
-
- double m_maxIterations;
-
- NN* m_testingclass;
-
- /*
- * Fit also single track vertices
- * (could be usefull for example for H-> gamma gamma)\
- *
- */
-
- bool m_addSingleTrackVertices;
-
- bool m_do3dSplitting;
-
- double m_zBfieldApprox;
-
- double m_maximumVertexContamination;
-
- /*
- * Maximum allowed significance of track position to vertex seed
- */
- double m_tracksMaxSignificance ;
-
- /*
- * Toggle vertex seed constraint on/off
- */
- bool m_useSeedConstraint ;
-
-
- struct CompareTheTwoVertices {
- bool operator()( xAOD::Vertex* const & first, xAOD::Vertex* const & second);
- };
-
- /**
- * Internal method to estimate the probability to be signal vertex of a certain vertex candidate.
- */
-
- double estimateSignalCompatibility(xAOD::Vertex *myxAODVertex);
-
- /**
- * Estimate DeltaZ given a certain track parameters and beam spot center position
- * ONLY TEMPORARY 15-08-2009: common tool needed to collect this method
- */
-
- double estimateDeltaZ(const Trk::TrackParameters& myPerigee, const Amg::Vector3D& myTransvVertex);
-
- /**
- * copying from the guassian density alg
- */
- double ipSignificance(const Trk::TrackParameters* params, const Amg::Vector3D * vertex) const;
-
- /**
- * Clean decorator data from a vertex candidate (to avoid memory leaks) and then delete it and set to zero
- */
-
- void releaseCandidate(xAOD::Vertex*& candidate);
-
-
- };//end of class
-}//end of namespace definitions
-#endif