-
Notifications
You must be signed in to change notification settings - Fork 54
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1427 from VinzenzBildstein/main
Got mega-linter to apply its fixes
- Loading branch information
Showing
12 changed files
with
115 additions
and
168 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -32,3 +32,4 @@ grsi_logon.C | |
*Data | ||
.grsirc | ||
wiki | ||
megalinter-reports |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,14 +1,15 @@ | ||
void DroppedData(TFile *file) { | ||
void DroppedData(TFile* file) | ||
{ | ||
//Finds the number of dropped Midas events as well as the number of lost events over the network. | ||
TTree* tree = (TTree*) file->Get("FragmentTree"); | ||
TTree* tree = (TTree*)file->Get("FragmentTree"); | ||
|
||
long entries = tree->GetEntries(); | ||
double packetRatio = ((double)entries)/((double)(tree->GetMaximum("NetworkPacketNumber") - tree->GetMinimum("NetworkPacketNumber"))); | ||
// double filterRatio = ((double)entries)/((double)(tree->GetMaximum("MidasId") - tree->GetMinimum("MidasId"))); | ||
long entries = tree->GetEntries(); | ||
double packetRatio = ((double)entries) / ((double)(tree->GetMaximum("NetworkPacketNumber") - tree->GetMinimum("NetworkPacketNumber"))); | ||
// double filterRatio = ((double)entries)/((double)(tree->GetMaximum("MidasId") - tree->GetMinimum("MidasId"))); | ||
|
||
double packetLost = tree->GetMaximum("NetworkPacketNumber") - tree->GetMinimum("NetworkPacketNumber") - entries; | ||
// double filterLost = tree->GetMaximum("MidasId") - tree->GetMinimum("MidasId") - entries; | ||
// double filterLost = tree->GetMaximum("MidasId") - tree->GetMinimum("MidasId") - entries; | ||
|
||
std::cout<<"Got "<<packetRatio*100.<<" % of the network packets (lost "<<packetLost<<" packets"<<std::endl; | ||
// std::cout<<"Got "<<packetRatio*100.<<" % of the network packets and "<<filterRatio*100.<<" % of the primary filter IDs (lost "<<packetLost<<" packets and "<<filterLost<<" IDs)"<<std::endl; | ||
std::cout << "Got " << packetRatio * 100. << " % of the network packets (lost " << packetLost << " packets" << std::endl; | ||
// std::cout<<"Got "<<packetRatio*100.<<" % of the network packets and "<<filterRatio*100.<<" % of the primary filter IDs (lost "<<packetLost<<" packets and "<<filterLost<<" IDs)"<<std::endl; | ||
} |
Oops, something went wrong.