28 vector<pair<size_t,uint64_t>> pairs;
30 for(
size_t ientry=0; ientry<
fNEntries; ientry++) {
34 pairs.push_back(make_pair(ientry,t0));
37 std::sort(pairs.begin(),pairs.end(),[](pair<size_t,uint64_t>
a, pair<size_t,uint64_t> b) {
38 return a.second < b.second;
41 for(
size_t ientry=0; ientry<
fNEntries; ientry++) {
67 if(nmax!=0 && i==nmax)
return;
77 if(nmax!=0 && i==nmax)
return;
map< size_t, size_t > fRawToOrdered
size_t GetNEntries() const
CRTTiming(CRTPreProcessTree &raw)
const map< size_t, size_t > * GetRawToOrderedMap()
uint64_t GetAbsTime(size_t ientry) const
map< size_t, size_t > fOrderedToRaw
void DumpRawTimes(size_t nmax)
void DumpSortedTimes(size_t nmax)
size_t GetNEntries() const
uint64_t GetAbsTime(size_t ientry) const
const CRTPreProcessTree * fPre
BEGIN_PROLOG could also be cout
const map< size_t, size_t > * GetOrderedToRawMap()