mirror of
https://github.com/sesps/SPS_SABRE_EventBuilder.git
synced 2025-03-14 13:28:50 -04:00
38 lines
818 B
C++
38 lines
818 B
C++
|
/*
|
||
|
|
OrderChecker.cpp
|
||
|
|
Very simple class designed to test whether or not a root file is time ordered.
|
||
|
|
Meant to be used with newly converted from binary data. Only for development.
|
||
|
|
|
||
|
|
Written by G.W. McCann Oct. 2020
|
||
|
|
*/
|
||
|
|
#include "EventBuilder.h"
|
||
|
|
#include "OrderChecker.h"
|
||
|
|
|
||
|
|
OrderChecker::OrderChecker() {
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
OrderChecker::~OrderChecker() {
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
bool OrderChecker::IsOrdered(const std::string& filename) {
|
||
|
|
TFile* file = TFile::Open(filename.c_str(), "READ");
|
||
|
|
TTree* tree = (TTree*) file->Get("Data");
|
||
|
|
|
||
|
|
ULong64_t ts;
|
||
|
|
tree->SetBranchAddress("Timestamp", &ts);
|
||
|
|
ULong64_t prevStamp = 0;
|
||
|
|
|
||
|
|
for(Long64_t i=0; i<tree->GetEntries(); i++) {
|
||
|
|
tree->GetEntry();
|
||
|
|
if(prevStamp >= ts) {
|
||
|
|
std::cerr<<"Bad order at entry "<<i<<" out of "<<tree->GetEntries()<<std::endl;
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
file->Close();
|
||
|
|
return true;
|
||
|
|
}
|