Skip to content

PWGLF: Findable test simplification #6150

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
njacazio merged 2 commits into from
May 14, 2024
Merged

PWGLF: Findable test simplification #6150

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8e3c87a
PWGLF: Findable test simplification
ddobrigk May 14, 2024
2f14e60
Please consider the following formatting changes (#299)
alibuild May 14, 2024
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
14 changes: 2 additions & 12 deletions PWGLF/TableProducer/Strangeness/strangederivedbuilder.cxx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -808,21 +808,11 @@ struct strangederivedbuilder {
histos.fill(HIST("hFoundTagsCounters"), 0.0f, foundV0s.size());
histos.fill(HIST("hFoundTagsCounters"), 1.0f, findableV0s.size());

// pack the found V0s in a long long
std::vector<uint64_t> foundV0sPacked;
foundV0sPacked.reserve(foundV0s.size());
for (auto const& foundV0 : foundV0s) {
foundV0sPacked[foundV0.globalIndex()] = combineProngIndices(foundV0.posTrackId(), foundV0.negTrackId());
}

for (auto const& findableV0 : findableV0s) {
bool hasBeenFound = false;
uint64_t indexPack = combineProngIndices(findableV0.posTrackId(), findableV0.negTrackId());
for (uint32_t ic = 0; ic < foundV0s.size(); ic++) {
if (indexPack == foundV0sPacked[ic]) {
for (auto const& foundV0 : foundV0s) {
if (foundV0.posTrackId() == findableV0.posTrackId() && foundV0.negTrackId() == findableV0.negTrackId()) {
hasBeenFound = true;
histos.fill(HIST("hFoundTagsCounters"), 2.0f);
break;
}
}
v0FoundTags(hasBeenFound);
Expand Down