From 22cd7dd5067433d109ad5678478b1f70d90e8aa5 Mon Sep 17 00:00:00 2001 From: ALICE Action Bot Date: Wed, 8 Jan 2025 16:27:32 +0000 Subject: [PATCH] Please consider the following formatting changes --- PWGLF/DataModel/LFKinkDecayTables.h | 2 +- PWGLF/TableProducer/Common/kinkBuilder.cxx | 5 ++--- 2 files changed, 3 insertions(+), 4 deletions(-) diff --git a/PWGLF/DataModel/LFKinkDecayTables.h b/PWGLF/DataModel/LFKinkDecayTables.h index cdc360957cf..7955bc878d6 100644 --- a/PWGLF/DataModel/LFKinkDecayTables.h +++ b/PWGLF/DataModel/LFKinkDecayTables.h @@ -29,7 +29,7 @@ namespace kinkcand DECLARE_SOA_INDEX_COLUMN_FULL(TrackMoth, trackMoth, int, TracksIU, "_Moth"); //! DECLARE_SOA_INDEX_COLUMN_FULL(TrackDaug, trackDaug, int, TracksIU, "_Daug"); //! -DECLARE_SOA_INDEX_COLUMN(Collision, collision); //! +DECLARE_SOA_INDEX_COLUMN(Collision, collision); //! DECLARE_SOA_COLUMN(XDecVtx, xDecVtx, float); //! Decay vertex of the candidate (x direction) DECLARE_SOA_COLUMN(YDecVtx, yDecVtx, float); //! Decay vertex of the candidate (y direction) diff --git a/PWGLF/TableProducer/Common/kinkBuilder.cxx b/PWGLF/TableProducer/Common/kinkBuilder.cxx index 29d0667da51..d71bf04ba52 100644 --- a/PWGLF/TableProducer/Common/kinkBuilder.cxx +++ b/PWGLF/TableProducer/Common/kinkBuilder.cxx @@ -9,7 +9,7 @@ // granted to it by virtue of its status as an Intergovernmental Organization // or submit itself to any jurisdiction. // -/// \brief Builder task for kink decay topologies using ITS standalone tracks for the mother +/// \brief Builder task for kink decay topologies using ITS standalone tracks for the mother /// \author Francesco Mazzaschi #include @@ -412,11 +412,10 @@ struct kinkBuilder { void process(aod::Collisions const& collisions, TracksFull const& tracks, aod::AmbiguousTracks const& ambiTracks, aod::BCsWithTimestamps const& bcs) { - kinkCandidates.clear(); fillCandidateData(collisions, tracks, ambiTracks, bcs); - //sort kinkCandidates by collisionID to allow joining with collision table + // sort kinkCandidates by collisionID to allow joining with collision table std::sort(kinkCandidates.begin(), kinkCandidates.end(), [](const kinkCandidate& a, const kinkCandidate& b) { return a.collisionID < b.collisionID; }); for (auto& kinkCand : kinkCandidates) {