Skip to content

[PWGDQ] Update track indexing for derived tables #16968

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
mcoquet642 merged 1 commit into from
Jul 8, 2026
+10 −13
Merged

[PWGDQ] Update track indexing for derived tables #16968

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 10 additions & 13 deletions PWGDQ/Tasks/qaMatching.cxx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3020,7 +3020,7 @@ struct QaMatching {

int debugCounter{0};
fillQaMatchingAodEventForCollision(collisionInfo, collision, collisionInfo.reducedEventId, debugCounter);
fillQaMatchingMchTracksForCollision(collisionInfo, collision, muonTracks, taggedMuons, collisionInfo.reducedEventId);
fillQaMatchingMchTracksForCollision(collisionInfo, collision, muonTracks, taggedMuons, collisionInfo.reducedEventId, collisionInfo.reducedMchTrackIds);

registry.get<TH1>(HIST("tracksMultiplicityMFT"))->Fill(collisionInfo.mftTracks.size());
registry.get<TH1>(HIST("tracksMultiplicityMCH"))->Fill(collisionInfo.mchTracks.size());
Expand Down Expand Up @@ -3234,21 +3234,18 @@ struct QaMatching {
TCOLLISION const& collision,
TMUON const& muonTracks,
const std::vector<int64_t>& taggedMuons,
int32_t reducedEventId)
int32_t reducedEventId,
const std::map<int64_t, int64_t>& reducedMchTrackIds)
{
std::vector<int64_t> mchIds;
for (const auto& mchTrack : collisionInfo.mchTracks) {
if (std::find(mchIds.begin(), mchIds.end(), mchTrack.first) == mchIds.end()) {
mchIds.emplace_back(mchTrack.first);
}
}
for (const auto& candidate : collisionInfo.matchingCandidates) {
if (std::find(mchIds.begin(), mchIds.end(), candidate.first) == mchIds.end()) {
mchIds.emplace_back(candidate.first);
}
std::vector<std::pair<int64_t, int64_t>> orderedMchIds;
orderedMchIds.reserve(reducedMchTrackIds.size());
for (const auto& [mchIndex, reducedMchTrackId] : reducedMchTrackIds) {
orderedMchIds.emplace_back(reducedMchTrackId, mchIndex);
}
std::sort(orderedMchIds.begin(), orderedMchIds.end());

for (const auto& mchIndex : mchIds) {
for (const auto& [reducedMchTrackId, mchIndex] : orderedMchIds) {
(void)reducedMchTrackId;
auto const& mchTrack = muonTracks.rawIteratorAt(mchIndex);
int mftMchMatchAttempts = 0;
if (const auto& mchTrackInfoIt = collisionInfo.mchTracks.find(mchIndex); mchTrackInfoIt != collisionInfo.mchTracks.end()) {
Expand Down
Loading