Skip to content
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

Jump to bottom

A few fixes for DQM/L1TMonitor L1TGT and L1TRate #36233

Merged
merged 1 commit into from Nov 24, 2021
Merged

A few fixes for DQM/L1TMonitor L1TGT and L1TRate #36233

Show file tree
Hide file tree
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.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
6 changes: 2 additions & 4 deletions DQM/L1TMonitor/src/L1TGT.cc
View file
Open in desktop
Expand Up @@ -747,13 +747,12 @@ void L1TGT::countPfsIndicesPerLs() {
// count the number of pairs (lsNumber, pfIndex) per Ls
// there are no duplicate entries, and pairs are sorted after both members
// ... and fill again the histogram
int pfsIndicesPerLs = 1;
for (CItVecPair cIt = m_pairLsNumberPfIndex.begin(); cIt != m_pairLsNumberPfIndex.end(); ++cIt) {
int pfsIndicesPerLs = 1;

if ((*cIt).first == previousLsNumber) {
if ((*cIt).second != previousPfsIndex) {
pfsIndicesPerLs++;
previousPfsIndex = (*cIt).second;
pfsIndicesPerLs++;
}

} else {
Expand All @@ -765,7 +764,6 @@ void L1TGT::countPfsIndicesPerLs() {
// new Ls
previousLsNumber = (*cIt).first;
previousPfsIndex = (*cIt).second;

pfsIndicesPerLs = 1;
}
}
Expand Down
11 changes: 5 additions & 6 deletions DQM/L1TMonitor/src/L1TRate.cc
View file
Open in desktop
Expand Up @@ -495,12 +495,11 @@ bool L1TRate::getXSexFitsPython(const edm::ParameterSet& ps) {
foundFit = true;
break;
}

if (!foundFit) {
noError = false;
string eName = "WARNING_PY_MISSING_FIT";
m_ErrorMonitor->Fill(eName);
}
}
if (!foundFit) {
noError = false;
string eName = "WARNING_PY_MISSING_FIT";
m_ErrorMonitor->Fill(eName);
}
}
}
Expand Down