-
Notifications
You must be signed in to change notification settings - Fork 4.2k
/
IndexIntoFile.cc
1775 lines (1559 loc) · 69 KB
/
IndexIntoFile.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "DataFormats/Provenance/interface/IndexIntoFile.h"
#include "DataFormats/Provenance/interface/ProcessHistoryRegistry.h"
#include "FWCore/Utilities/interface/Algorithms.h"
#include "FWCore/Utilities/interface/EDMException.h"
#include <algorithm>
#include <iomanip>
#include <ostream>
namespace edm {
int const IndexIntoFile::invalidIndex;
RunNumber_t const IndexIntoFile::invalidRun;
LuminosityBlockNumber_t const IndexIntoFile::invalidLumi;
EventNumber_t const IndexIntoFile::invalidEvent;
IndexIntoFile::EntryNumber_t const IndexIntoFile::invalidEntry;
IndexIntoFile::Transients::Transients()
: previousAddedIndex_(invalidIndex),
runToOrder_(),
lumiToOrder_(),
beginEvents_(invalidEntry),
endEvents_(invalidEntry),
currentIndex_(invalidIndex),
currentRun_(invalidRun),
currentLumi_(invalidLumi),
numberOfEvents_(0),
eventFinder_(),
runOrLumiIndexes_(),
eventNumbers_(),
eventEntries_(),
unsortedEventNumbers_() {}
void IndexIntoFile::Transients::reset() {
previousAddedIndex_ = invalidIndex;
runToOrder_.clear();
lumiToOrder_.clear();
beginEvents_ = invalidEntry;
endEvents_ = invalidEntry;
currentIndex_ = invalidIndex;
currentRun_ = invalidRun;
currentLumi_ = invalidLumi;
numberOfEvents_ = 0;
eventFinder_ = nullptr; // propagate_const<T> has no reset() function
runOrLumiIndexes_.clear();
eventNumbers_.clear();
eventEntries_.clear();
unsortedEventNumbers_.clear();
}
IndexIntoFile::IndexIntoFile() : transient_(), processHistoryIDs_(), runOrLumiEntries_() {}
IndexIntoFile::~IndexIntoFile() {}
ProcessHistoryID const& IndexIntoFile::processHistoryID(int i) const { return processHistoryIDs_.at(i); }
std::vector<ProcessHistoryID> const& IndexIntoFile::processHistoryIDs() const { return processHistoryIDs_; }
void IndexIntoFile::addLumi(int index, RunNumber_t run, LuminosityBlockNumber_t lumi, EntryNumber_t entry) {
// assign each lumi an order value sequentially when first seen
std::pair<IndexRunLumiKey, EntryNumber_t> keyAndOrder(IndexRunLumiKey(index, run, lumi), lumiToOrder().size());
lumiToOrder().insert(keyAndOrder); // does nothing if this key already was inserted
runOrLumiEntries_.emplace_back(invalidEntry,
lumiToOrder()[IndexRunLumiKey(index, run, lumi)],
entry,
index,
run,
lumi,
beginEvents(),
endEvents());
beginEvents() = invalidEntry;
endEvents() = invalidEntry;
}
void IndexIntoFile::addEntry(ProcessHistoryID const& processHistoryID,
RunNumber_t run,
LuminosityBlockNumber_t lumi,
EventNumber_t event,
EntryNumber_t entry) {
int index = 0;
// First see if the ProcessHistoryID is the same as the previous one.
// This is just a performance optimization. We expect to usually get
// many in a row that are the same.
if (previousAddedIndex() != invalidIndex && processHistoryID == processHistoryIDs_[previousAddedIndex()]) {
index = previousAddedIndex();
} else {
// If it was not the same as the previous one then search through the
// entire vector. If it is not there, it needs to be added at the
// end.
index = 0;
while (index < static_cast<int>(processHistoryIDs_.size()) && processHistoryIDs_[index] != processHistoryID) {
++index;
}
if (index == static_cast<int>(processHistoryIDs_.size())) {
processHistoryIDs_.push_back(processHistoryID);
}
}
previousAddedIndex() = index;
assert((currentRun() == run && currentIndex() == index) || currentRun() == invalidRun);
if (lumi == invalidLumi) {
if (currentLumi() != invalidLumi) {
throw Exception(errors::LogicError)
<< "In IndexIntoFile::addEntry. Entries were added in illegal order.\n"
<< "This means the IndexIntoFile product in the output file will be corrupted.\n"
<< "The output file will be unusable for most purposes.\n"
<< "If this occurs after an unrelated exception was thrown in\n"
<< "endLuminosityBlock or endRun then ignore this exception and fix\n"
<< "the primary exception. This is an expected side effect.\n"
<< "Otherwise please report this to the core framework developers\n";
}
currentIndex() = invalidIndex;
currentRun() = invalidRun;
currentLumi() = invalidLumi;
// assign each run an order value when first seen (using entry but any increasing value would work)
std::pair<IndexRunKey, EntryNumber_t> keyAndOrder(IndexRunKey(index, run), entry);
runToOrder().insert(keyAndOrder); // Does nothing if this key was already inserted
runOrLumiEntries_.emplace_back(
runToOrder()[IndexRunKey(index, run)], invalidEntry, entry, index, run, lumi, invalidEntry, invalidEntry);
} else {
if (currentRun() == invalidRun) {
currentRun() = run;
currentIndex() = index;
}
if (event == invalidEvent) {
if (currentLumi() != lumi and currentLumi() != invalidLumi) {
//we have overlapping lumis so must inject a placeholder
addLumi(index, run, currentLumi(), invalidEntry);
}
currentLumi() = invalidLumi;
addLumi(index, run, lumi, entry);
} else {
if (currentLumi() != lumi and currentLumi() != invalidLumi) {
//We have overlapping lumis so need to inject a placeholder
addLumi(index, run, currentLumi(), invalidEntry);
}
setNumberOfEvents(numberOfEvents() + 1);
if (beginEvents() == invalidEntry) {
currentLumi() = lumi;
beginEvents() = entry;
endEvents() = beginEvents() + 1;
} else {
assert(currentLumi() == lumi);
assert(entry == endEvents());
++endEvents();
}
}
}
}
void IndexIntoFile::fillRunOrLumiIndexes() const {
if (runOrLumiEntries_.empty() || !runOrLumiIndexes().empty()) {
return;
}
runOrLumiIndexes().reserve(runOrLumiEntries_.size());
int index = 0;
for (RunOrLumiEntry const& item : runOrLumiEntries_) {
runOrLumiIndexes().emplace_back(item.processHistoryIDIndex(), item.run(), item.lumi(), index);
++index;
}
stable_sort_all(runOrLumiIndexes());
long long beginEventNumbers = 0;
std::vector<RunOrLumiIndexes>::iterator beginOfLumi = runOrLumiIndexes().begin();
std::vector<RunOrLumiIndexes>::iterator endOfLumi = beginOfLumi;
std::vector<RunOrLumiIndexes>::iterator iEnd = runOrLumiIndexes().end();
while (true) {
while (beginOfLumi != iEnd && beginOfLumi->isRun()) {
++beginOfLumi;
}
if (beginOfLumi == iEnd)
break;
endOfLumi = beginOfLumi + 1;
while (endOfLumi != iEnd && beginOfLumi->processHistoryIDIndex() == endOfLumi->processHistoryIDIndex() &&
beginOfLumi->run() == endOfLumi->run() && beginOfLumi->lumi() == endOfLumi->lumi()) {
++endOfLumi;
}
int nEvents = 0;
for (std::vector<RunOrLumiIndexes>::iterator iter = beginOfLumi; iter != endOfLumi; ++iter) {
if (runOrLumiEntries_[iter->indexToGetEntry()].beginEvents() != invalidEntry) {
nEvents += runOrLumiEntries_[iter->indexToGetEntry()].endEvents() -
runOrLumiEntries_[iter->indexToGetEntry()].beginEvents();
}
}
for (std::vector<RunOrLumiIndexes>::iterator iter = beginOfLumi; iter != endOfLumi; ++iter) {
iter->setBeginEventNumbers(beginEventNumbers);
iter->setEndEventNumbers(beginEventNumbers + nEvents);
}
beginEventNumbers += nEvents;
beginOfLumi = endOfLumi;
}
assert(runOrLumiIndexes().size() == runOrLumiEntries_.size());
}
void IndexIntoFile::fillEventNumbers() const { fillEventNumbersOrEntries(true, false); }
void IndexIntoFile::fillEventEntries() const { fillEventNumbersOrEntries(false, true); }
void IndexIntoFile::fillEventNumbersOrEntries(bool needEventNumbers, bool needEventEntries) const {
if (numberOfEvents() == 0) {
return;
}
if (needEventNumbers && !eventNumbers().empty()) {
needEventNumbers = false;
}
if (needEventEntries && !eventEntries().empty()) {
needEventEntries = false;
}
if (needEventNumbers && !eventEntries().empty()) {
assert(numberOfEvents() == eventEntries().size());
eventNumbers().reserve(eventEntries().size());
for (std::vector<EventNumber_t>::size_type entry = 0U; entry < numberOfEvents(); ++entry) {
eventNumbers().push_back(eventEntries()[entry].event());
}
return;
}
if (!needEventNumbers && !needEventEntries) {
return;
}
fillUnsortedEventNumbers();
if (needEventNumbers) {
eventNumbers().resize(numberOfEvents(), IndexIntoFile::invalidEvent);
}
if (needEventEntries) {
eventEntries().resize(numberOfEvents());
}
long long offset = 0;
long long previousBeginEventNumbers = -1LL;
for (SortedRunOrLumiItr runOrLumi = beginRunOrLumi(), runOrLumiEnd = endRunOrLumi(); runOrLumi != runOrLumiEnd;
++runOrLumi) {
if (runOrLumi.isRun())
continue;
long long beginEventNumbers = 0;
long long endEventNumbers = 0;
EntryNumber_t beginEventEntry = invalidEntry;
EntryNumber_t endEventEntry = invalidEntry;
runOrLumi.getRange(beginEventNumbers, endEventNumbers, beginEventEntry, endEventEntry);
// This is true each time one hits a new lumi section (except if the previous lumi had
// no events, in which case the offset is still 0 anyway)
if (beginEventNumbers != previousBeginEventNumbers)
offset = 0;
for (EntryNumber_t entry = beginEventEntry; entry != endEventEntry; ++entry) {
if (needEventNumbers) {
eventNumbers().at((entry - beginEventEntry) + offset + beginEventNumbers) = unsortedEventNumbers().at(entry);
}
if (needEventEntries) {
eventEntries().at((entry - beginEventEntry) + offset + beginEventNumbers) =
EventEntry(unsortedEventNumbers().at(entry), entry);
}
}
previousBeginEventNumbers = beginEventNumbers;
offset += endEventEntry - beginEventEntry;
}
if (needEventNumbers) {
sortEvents();
assert(numberOfEvents() == eventNumbers().size());
}
if (needEventEntries) {
sortEventEntries();
assert(numberOfEvents() == eventEntries().size());
}
}
void IndexIntoFile::fillUnsortedEventNumbers() const {
if (numberOfEvents() == 0 || !unsortedEventNumbers().empty()) {
return;
}
unsortedEventNumbersMutable().reserve(numberOfEvents());
// The main purpose for the existence of the unsortedEventNumbers
// vector is that it can easily be filled by reading through
// the EventAuxiliary branch in the same order as the TTree
// entries. fillEventNumbersOrEntries can then use this information
// instead of using getEventNumberOfEntry directly and reading
// the branch in a different order.
for (std::vector<EventNumber_t>::size_type entry = 0U; entry < numberOfEvents(); ++entry) {
unsortedEventNumbersMutable().push_back(getEventNumberOfEntry(entry));
}
}
// We are closing the input file, but we need to keep event numbers.
// We can delete the other transient collections by using the swap trick.
void IndexIntoFile::inputFileClosed() {
std::vector<EventEntry>().swap(eventEntries());
std::vector<RunOrLumiIndexes>().swap(runOrLumiIndexes());
std::vector<EventNumber_t>().swap(unsortedEventNumbers());
resetEventFinder();
}
void IndexIntoFile::doneFileInitialization() { std::vector<EventNumber_t>().swap(unsortedEventNumbers()); }
void IndexIntoFile::reduceProcessHistoryIDs(ProcessHistoryRegistry const& processHistoryRegistry) {
std::vector<ProcessHistoryID> reducedPHIDs;
std::map<ProcessHistoryID, int> reducedPHIDToIndex;
std::pair<ProcessHistoryID, int> mapEntry(ProcessHistoryID(), 0);
std::pair<std::map<ProcessHistoryID, int>::iterator, bool> insertResult;
std::vector<int> phidIndexConverter;
for (auto const& phid : processHistoryIDs_) {
ProcessHistoryID const& reducedPHID = processHistoryRegistry.reducedProcessHistoryID(phid);
mapEntry.first = reducedPHID;
insertResult = reducedPHIDToIndex.insert(mapEntry);
if (insertResult.second) {
insertResult.first->second = reducedPHIDs.size();
reducedPHIDs.push_back(reducedPHID);
}
phidIndexConverter.push_back(insertResult.first->second);
}
processHistoryIDs_.swap(reducedPHIDs);
// If the size of the vector of IDs does not change
// then their indexes and the ordering of the Runs and
// and Lumis does not change, so we are done.
if (processHistoryIDs_.size() == reducedPHIDs.size()) {
return;
}
std::map<IndexIntoFile::IndexRunKey, int> runOrderMap;
std::pair<std::map<IndexIntoFile::IndexRunKey, int>::iterator, bool> runInsertResult;
std::map<IndexIntoFile::IndexRunLumiKey, int> lumiOrderMap;
std::pair<std::map<IndexIntoFile::IndexRunLumiKey, int>::iterator, bool> lumiInsertResult;
// loop over all the RunOrLumiEntry's
for (auto& item : runOrLumiEntries_) {
// Convert the process history index so it points into the new vector of reduced IDs
item.setProcessHistoryIDIndex(phidIndexConverter.at(item.processHistoryIDIndex()));
// Convert the phid-run order
IndexIntoFile::IndexRunKey runKey(item.processHistoryIDIndex(), item.run());
runInsertResult = runOrderMap.insert(std::pair<IndexIntoFile::IndexRunKey, int>(runKey, 0));
if (runInsertResult.second) {
runInsertResult.first->second = item.orderPHIDRun();
} else {
item.setOrderPHIDRun(runInsertResult.first->second);
}
// Convert the phid-run-lumi order for the lumi entries
if (item.lumi() != 0) {
IndexIntoFile::IndexRunLumiKey lumiKey(item.processHistoryIDIndex(), item.run(), item.lumi());
lumiInsertResult = lumiOrderMap.insert(std::pair<IndexIntoFile::IndexRunLumiKey, int>(lumiKey, 0));
if (lumiInsertResult.second) {
lumiInsertResult.first->second = item.orderPHIDRunLumi();
} else {
item.setOrderPHIDRunLumi(lumiInsertResult.first->second);
}
}
}
std::stable_sort(runOrLumiEntries_.begin(), runOrLumiEntries_.end());
}
void IndexIntoFile::fixIndexes(std::vector<ProcessHistoryID>& processHistoryIDs) {
std::map<int, int> oldToNewIndex;
for (std::vector<ProcessHistoryID>::const_iterator iter = processHistoryIDs_.begin(),
iEnd = processHistoryIDs_.end();
iter != iEnd;
++iter) {
std::vector<ProcessHistoryID>::const_iterator iterExisting =
std::find(processHistoryIDs.begin(), processHistoryIDs.end(), *iter);
if (iterExisting == processHistoryIDs.end()) {
oldToNewIndex[iter - processHistoryIDs_.begin()] = processHistoryIDs.size();
processHistoryIDs.push_back(*iter);
} else {
oldToNewIndex[iter - processHistoryIDs_.begin()] = iterExisting - processHistoryIDs.begin();
}
}
processHistoryIDs_ = processHistoryIDs;
for (RunOrLumiEntry& item : runOrLumiEntries_) {
item.setProcessHistoryIDIndex(oldToNewIndex[item.processHistoryIDIndex()]);
}
}
void IndexIntoFile::sortVector_Run_Or_Lumi_Entries() {
for (RunOrLumiEntry& item : runOrLumiEntries_) {
std::map<IndexRunKey, EntryNumber_t>::const_iterator keyAndOrder =
runToOrder().find(IndexRunKey(item.processHistoryIDIndex(), item.run()));
if (keyAndOrder == runToOrder().end()) {
throw Exception(errors::LogicError)
<< "In IndexIntoFile::sortVector_Run_Or_Lumi_Entries. A run entry is missing.\n"
<< "This means the IndexIntoFile product in the output file will be corrupted.\n"
<< "The output file will be unusable for most purposes.\n"
<< "If this occurs after an unrelated exception was thrown in\n"
<< "endLuminosityBlock or endRun then ignore this exception and fix\n"
<< "the primary exception. This is an expected side effect.\n"
<< "Otherwise please report this to the core framework developers\n";
}
item.setOrderPHIDRun(keyAndOrder->second);
}
stable_sort_all(runOrLumiEntries_);
}
void IndexIntoFile::sortEvents() const {
fillRunOrLumiIndexes();
std::vector<RunOrLumiIndexes>::iterator beginOfLumi = runOrLumiIndexes().begin();
std::vector<RunOrLumiIndexes>::iterator endOfLumi = beginOfLumi;
std::vector<RunOrLumiIndexes>::iterator iEnd = runOrLumiIndexes().end();
while (true) {
while (beginOfLumi != iEnd && beginOfLumi->isRun()) {
++beginOfLumi;
}
if (beginOfLumi == iEnd)
break;
endOfLumi = beginOfLumi + 1;
while (endOfLumi != iEnd && beginOfLumi->processHistoryIDIndex() == endOfLumi->processHistoryIDIndex() &&
beginOfLumi->run() == endOfLumi->run() && beginOfLumi->lumi() == endOfLumi->lumi()) {
++endOfLumi;
}
assert(beginOfLumi->endEventNumbers() >= 0);
assert(beginOfLumi->endEventNumbers() <= static_cast<long long>(eventNumbers().size()));
std::sort(eventNumbers().begin() + beginOfLumi->beginEventNumbers(),
eventNumbers().begin() + beginOfLumi->endEventNumbers());
beginOfLumi = endOfLumi;
}
}
void IndexIntoFile::sortEventEntries() const {
fillRunOrLumiIndexes();
std::vector<RunOrLumiIndexes>::iterator beginOfLumi = runOrLumiIndexes().begin();
std::vector<RunOrLumiIndexes>::iterator endOfLumi = beginOfLumi;
std::vector<RunOrLumiIndexes>::iterator iEnd = runOrLumiIndexes().end();
while (true) {
while (beginOfLumi != iEnd && beginOfLumi->isRun()) {
++beginOfLumi;
}
if (beginOfLumi == iEnd)
break;
endOfLumi = beginOfLumi + 1;
while (endOfLumi != iEnd && beginOfLumi->processHistoryIDIndex() == endOfLumi->processHistoryIDIndex() &&
beginOfLumi->run() == endOfLumi->run() && beginOfLumi->lumi() == endOfLumi->lumi()) {
++endOfLumi;
}
assert(beginOfLumi->endEventNumbers() >= 0);
assert(beginOfLumi->endEventNumbers() <= static_cast<long long>(eventEntries().size()));
std::sort(eventEntries().begin() + beginOfLumi->beginEventNumbers(),
eventEntries().begin() + beginOfLumi->endEventNumbers());
beginOfLumi = endOfLumi;
}
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::begin(SortOrder sortOrder) const {
if (empty()) {
return end(sortOrder);
}
IndexIntoFileItr iter(this, sortOrder, kRun, 0, invalidIndex, invalidIndex, 0, 0);
iter.initializeRun();
return iter;
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::end(SortOrder sortOrder) const {
return IndexIntoFileItr(this, sortOrder, kEnd, invalidIndex, invalidIndex, invalidIndex, 0, 0);
}
bool IndexIntoFile::iterationWillBeInEntryOrder(SortOrder sortOrder) const {
EntryNumber_t maxEntry = invalidEntry;
for (IndexIntoFileItr it = begin(sortOrder), itEnd = end(sortOrder); it != itEnd; ++it) {
if (it.getEntryType() == kEvent) {
if (it.entry() < maxEntry) {
return false;
}
maxEntry = it.entry();
}
}
return true;
}
bool IndexIntoFile::empty() const { return runOrLumiEntries().empty(); }
IndexIntoFile::IndexIntoFileItr IndexIntoFile::findPosition(RunNumber_t run,
LuminosityBlockNumber_t lumi,
EventNumber_t event) const {
fillRunOrLumiIndexes();
bool lumiMissing = (lumi == 0 && event != 0);
std::vector<RunOrLumiIndexes>::const_iterator iEnd = runOrLumiIndexes().end();
std::vector<RunOrLumiIndexes>::const_iterator phEnd;
// Loop over ranges of entries with the same ProcessHistoryID
for (std::vector<RunOrLumiIndexes>::const_iterator phBegin = runOrLumiIndexes().begin(); phBegin != iEnd;
phBegin = phEnd) {
RunOrLumiIndexes el(phBegin->processHistoryIDIndex(), run, lumi, 0);
phEnd = std::upper_bound(phBegin, iEnd, el, Compare_Index());
std::vector<RunOrLumiIndexes>::const_iterator iRun = std::lower_bound(phBegin, phEnd, el, Compare_Index_Run());
if (iRun == phEnd || iRun->run() != run)
continue;
if (lumi == invalidLumi && event == invalidEvent) {
IndexIntoFileItr indexItr(
this, numericalOrder, kRun, iRun - runOrLumiIndexes().begin(), invalidIndex, invalidIndex, 0, 0);
indexItr.initializeRun();
return indexItr;
}
std::vector<RunOrLumiIndexes>::const_iterator iRunEnd = std::upper_bound(iRun, phEnd, el, Compare_Index_Run());
if (!lumiMissing) {
std::vector<RunOrLumiIndexes>::const_iterator iLumi = std::lower_bound(iRun, iRunEnd, el);
if (iLumi == iRunEnd || iLumi->lumi() != lumi)
continue;
if (event == invalidEvent) {
IndexIntoFileItr indexItr(this,
numericalOrder,
kRun,
iRun - runOrLumiIndexes().begin(),
iLumi - runOrLumiIndexes().begin(),
invalidIndex,
0,
0);
indexItr.initializeLumi();
return indexItr;
}
long long beginEventNumbers = iLumi->beginEventNumbers();
long long endEventNumbers = iLumi->endEventNumbers();
if (beginEventNumbers >= endEventNumbers)
continue;
long long indexToEvent = 0;
if (!eventEntries().empty()) {
std::vector<EventEntry>::const_iterator eventIter =
std::lower_bound(eventEntries().begin() + beginEventNumbers,
eventEntries().begin() + endEventNumbers,
EventEntry(event, invalidEntry));
if (eventIter == (eventEntries().begin() + endEventNumbers) || eventIter->event() != event)
continue;
indexToEvent = eventIter - eventEntries().begin() - beginEventNumbers;
} else {
fillEventNumbers();
std::vector<EventNumber_t>::const_iterator eventIter = std::lower_bound(
eventNumbers().begin() + beginEventNumbers, eventNumbers().begin() + endEventNumbers, event);
if (eventIter == (eventNumbers().begin() + endEventNumbers) || *eventIter != event)
continue;
indexToEvent = eventIter - eventNumbers().begin() - beginEventNumbers;
}
int newIndexToLumi = iLumi - runOrLumiIndexes().begin();
while (runOrLumiEntries_[runOrLumiIndexes()[newIndexToLumi].indexToGetEntry()].entry() == invalidEntry) {
++newIndexToLumi;
assert(static_cast<unsigned>(newIndexToLumi) < runOrLumiEntries_.size());
assert(runOrLumiIndexes()[newIndexToLumi].lumi() == lumi);
}
return IndexIntoFileItr(this,
numericalOrder,
kRun,
iRun - runOrLumiIndexes().begin(),
newIndexToLumi,
iLumi - runOrLumiIndexes().begin(),
indexToEvent,
endEventNumbers - beginEventNumbers);
}
if (lumiMissing) {
std::vector<RunOrLumiIndexes>::const_iterator iLumi = iRun;
while (iLumi != iRunEnd && iLumi->lumi() == invalidLumi) {
++iLumi;
}
if (iLumi == iRunEnd)
continue;
std::vector<RunOrLumiIndexes>::const_iterator lumiEnd;
for (; iLumi != iRunEnd; iLumi = lumiEnd) {
RunOrLumiIndexes elWithLumi(phBegin->processHistoryIDIndex(), run, iLumi->lumi(), 0);
lumiEnd = std::upper_bound(iLumi, iRunEnd, elWithLumi);
long long beginEventNumbers = iLumi->beginEventNumbers();
long long endEventNumbers = iLumi->endEventNumbers();
if (beginEventNumbers >= endEventNumbers)
continue;
long long indexToEvent = 0;
if (!eventEntries().empty()) {
std::vector<EventEntry>::const_iterator eventIter =
std::lower_bound(eventEntries().begin() + beginEventNumbers,
eventEntries().begin() + endEventNumbers,
EventEntry(event, invalidEntry));
if (eventIter == (eventEntries().begin() + endEventNumbers) || eventIter->event() != event)
continue;
indexToEvent = eventIter - eventEntries().begin() - beginEventNumbers;
} else {
fillEventNumbers();
std::vector<EventNumber_t>::const_iterator eventIter = std::lower_bound(
eventNumbers().begin() + beginEventNumbers, eventNumbers().begin() + endEventNumbers, event);
if (eventIter == (eventNumbers().begin() + endEventNumbers) || *eventIter != event)
continue;
indexToEvent = eventIter - eventNumbers().begin() - beginEventNumbers;
}
int newIndexToLumi = iLumi - runOrLumiIndexes().begin();
while (runOrLumiEntries_[runOrLumiIndexes()[newIndexToLumi].indexToGetEntry()].entry() == invalidEntry) {
++newIndexToLumi;
assert(static_cast<unsigned>(newIndexToLumi) < runOrLumiEntries_.size());
assert(runOrLumiIndexes()[newIndexToLumi].lumi() == iLumi->lumi());
}
return IndexIntoFileItr(this,
numericalOrder,
kRun,
iRun - runOrLumiIndexes().begin(),
newIndexToLumi,
iLumi - runOrLumiIndexes().begin(),
indexToEvent,
endEventNumbers - beginEventNumbers);
}
}
} // Loop over ProcessHistoryIDs
return IndexIntoFileItr(this, numericalOrder, kEnd, invalidIndex, invalidIndex, invalidIndex, 0, 0);
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::findPosition(SortOrder sortOrder,
RunNumber_t run,
LuminosityBlockNumber_t lumi,
EventNumber_t event) const {
if (sortOrder == IndexIntoFile::numericalOrder) {
return findPosition(run, lumi, event); // a faster algorithm
}
IndexIntoFileItr itr = begin(sortOrder);
IndexIntoFileItr itrEnd = end(sortOrder);
while (itr != itrEnd) {
if (itr.run() != run) {
itr.advanceToNextRun();
} else {
if (lumi == invalidLumi && event == invalidEvent) {
return itr;
} else if (lumi != invalidLumi && itr.peekAheadAtLumi() != lumi) {
if (!itr.skipLumiInRun()) {
itr.advanceToNextRun();
}
} else {
if (event == invalidEvent) {
return itr;
} else {
EventNumber_t eventNumber = getEventNumberOfEntry(itr.peekAheadAtEventEntry());
if (eventNumber == event) {
return itr;
} else {
if (!itr.skipToNextEventInLumi()) {
if (!itr.skipLumiInRun()) {
itr.advanceToNextRun();
}
}
}
}
}
}
}
return itrEnd;
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::findEventPosition(RunNumber_t run,
LuminosityBlockNumber_t lumi,
EventNumber_t event) const {
assert(event != invalidEvent);
IndexIntoFileItr iter = findPosition(run, lumi, event);
iter.advanceToEvent();
return iter;
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::findLumiPosition(RunNumber_t run, LuminosityBlockNumber_t lumi) const {
assert(lumi != invalidLumi);
IndexIntoFileItr iter = findPosition(run, lumi, 0U);
iter.advanceToLumi();
return iter;
}
IndexIntoFile::IndexIntoFileItr IndexIntoFile::findRunPosition(RunNumber_t run) const {
return findPosition(run, 0U, 0U);
}
bool IndexIntoFile::containsItem(RunNumber_t run, LuminosityBlockNumber_t lumi, EventNumber_t event) const {
return (event != 0) ? containsEvent(run, lumi, event) : (lumi ? containsLumi(run, lumi) : containsRun(run));
}
bool IndexIntoFile::containsEvent(RunNumber_t run, LuminosityBlockNumber_t lumi, EventNumber_t event) const {
return findEventPosition(run, lumi, event).getEntryType() != kEnd;
}
bool IndexIntoFile::containsLumi(RunNumber_t run, LuminosityBlockNumber_t lumi) const {
return findLumiPosition(run, lumi).getEntryType() != kEnd;
}
bool IndexIntoFile::containsRun(RunNumber_t run) const { return findRunPosition(run).getEntryType() != kEnd; }
IndexIntoFile::SortedRunOrLumiItr IndexIntoFile::beginRunOrLumi() const { return SortedRunOrLumiItr(this, 0); }
IndexIntoFile::SortedRunOrLumiItr IndexIntoFile::endRunOrLumi() const {
return SortedRunOrLumiItr(this, runOrLumiEntries().size());
}
void IndexIntoFile::set_intersection(IndexIntoFile const& indexIntoFile,
std::set<IndexRunLumiEventKey>& intersection) const {
if (empty() || indexIntoFile.empty())
return;
fillRunOrLumiIndexes();
indexIntoFile.fillRunOrLumiIndexes();
RunOrLumiIndexes const& back1 = runOrLumiIndexes().back();
RunOrLumiIndexes const& back2 = indexIntoFile.runOrLumiIndexes().back();
// Very quick decision if the run ranges in the two files do not overlap
if (back2 < runOrLumiIndexes().front())
return;
if (back1 < indexIntoFile.runOrLumiIndexes().front())
return;
SortedRunOrLumiItr iter1 = beginRunOrLumi();
SortedRunOrLumiItr iEnd1 = endRunOrLumi();
SortedRunOrLumiItr iter2 = indexIntoFile.beginRunOrLumi();
SortedRunOrLumiItr iEnd2 = indexIntoFile.endRunOrLumi();
// Quick decision if the lumi ranges in the two files do not overlap
while (iter1 != iEnd1 && iter1.isRun())
++iter1;
if (iter1 == iEnd1)
return;
if (back2 < iter1.runOrLumiIndexes())
return;
while (iter2 != iEnd2 && iter2.isRun())
++iter2;
if (iter2 == iEnd2)
return;
if (back1 < iter2.runOrLumiIndexes())
return;
RunOrLumiIndexes const* previousIndexes = nullptr;
// Loop through the both IndexIntoFile objects and look for matching lumis
while (iter1 != iEnd1 && iter2 != iEnd2) {
RunOrLumiIndexes const& indexes1 = iter1.runOrLumiIndexes();
RunOrLumiIndexes const& indexes2 = iter2.runOrLumiIndexes();
if (indexes1 < indexes2) {
++iter1;
} else if (indexes2 < indexes1) {
++iter2;
} else { // they are equal
// Skip them if it is a run or the same lumi
if (indexes1.isRun() || (previousIndexes && !(*previousIndexes < indexes1))) {
++iter1;
++iter2;
} else {
previousIndexes = &indexes1;
// Found a matching lumi, now look for matching events
long long beginEventNumbers1 = indexes1.beginEventNumbers();
long long endEventNumbers1 = indexes1.endEventNumbers();
long long beginEventNumbers2 = indexes2.beginEventNumbers();
long long endEventNumbers2 = indexes2.endEventNumbers();
// there must be at least 1 event in each lumi for there to be any matches
if ((beginEventNumbers1 >= endEventNumbers1) || (beginEventNumbers2 >= endEventNumbers2)) {
++iter1;
++iter2;
continue;
}
if (!eventEntries().empty() && !indexIntoFile.eventEntries().empty()) {
std::vector<EventEntry> matchingEvents;
std::insert_iterator<std::vector<EventEntry> > insertIter(matchingEvents, matchingEvents.begin());
std::set_intersection(eventEntries().begin() + beginEventNumbers1,
eventEntries().begin() + endEventNumbers1,
indexIntoFile.eventEntries().begin() + beginEventNumbers2,
indexIntoFile.eventEntries().begin() + endEventNumbers2,
insertIter);
for (EventEntry const& entry : matchingEvents) {
intersection.insert(IndexRunLumiEventKey(
indexes1.processHistoryIDIndex(), indexes1.run(), indexes1.lumi(), entry.event()));
}
} else {
fillEventNumbers();
indexIntoFile.fillEventNumbers();
std::vector<EventNumber_t> matchingEvents;
std::insert_iterator<std::vector<EventNumber_t> > insertIter(matchingEvents, matchingEvents.begin());
std::set_intersection(eventNumbers().begin() + beginEventNumbers1,
eventNumbers().begin() + endEventNumbers1,
indexIntoFile.eventNumbers().begin() + beginEventNumbers2,
indexIntoFile.eventNumbers().begin() + endEventNumbers2,
insertIter);
for (EventNumber_t const& eventNumber : matchingEvents) {
intersection.insert(
IndexRunLumiEventKey(indexes1.processHistoryIDIndex(), indexes1.run(), indexes1.lumi(), eventNumber));
}
}
}
}
}
}
bool IndexIntoFile::containsDuplicateEvents() const {
RunOrLumiIndexes const* previousIndexes = nullptr;
for (SortedRunOrLumiItr iter = beginRunOrLumi(), iEnd = endRunOrLumi(); iter != iEnd; ++iter) {
RunOrLumiIndexes const& indexes = iter.runOrLumiIndexes();
// Skip it if it is a run or the same lumi
if (indexes.isRun() || (previousIndexes && !(*previousIndexes < indexes))) {
continue;
}
previousIndexes = &indexes;
long long beginEventNumbers = indexes.beginEventNumbers();
long long endEventNumbers = indexes.endEventNumbers();
// there must be more than 1 event in the lumi for there to be any duplicates
if (beginEventNumbers + 1 >= endEventNumbers)
continue;
if (!eventEntries().empty()) {
std::vector<EventEntry>::iterator last = eventEntries().begin() + endEventNumbers;
if (std::adjacent_find(eventEntries().begin() + beginEventNumbers, last) != last) {
return true;
}
} else {
fillEventNumbers();
std::vector<EventNumber_t>::iterator last = eventNumbers().begin() + endEventNumbers;
if (std::adjacent_find(eventNumbers().begin() + beginEventNumbers, last) != last) {
return true;
}
}
}
return false;
}
IndexIntoFile::RunOrLumiEntry::RunOrLumiEntry()
: orderPHIDRun_(invalidEntry),
orderPHIDRunLumi_(invalidEntry),
entry_(invalidEntry),
processHistoryIDIndex_(invalidIndex),
run_(invalidRun),
lumi_(invalidLumi),
beginEvents_(invalidEntry),
endEvents_(invalidEntry) {}
IndexIntoFile::RunOrLumiEntry::RunOrLumiEntry(EntryNumber_t orderPHIDRun,
EntryNumber_t orderPHIDRunLumi,
EntryNumber_t entry,
int processHistoryIDIndex,
RunNumber_t run,
LuminosityBlockNumber_t lumi,
EntryNumber_t beginEvents,
EntryNumber_t endEvents)
: orderPHIDRun_(orderPHIDRun),
orderPHIDRunLumi_(orderPHIDRunLumi),
entry_(entry),
processHistoryIDIndex_(processHistoryIDIndex),
run_(run),
lumi_(lumi),
beginEvents_(beginEvents),
endEvents_(endEvents) {}
IndexIntoFile::RunOrLumiIndexes::RunOrLumiIndexes(int processHistoryIDIndex,
RunNumber_t run,
LuminosityBlockNumber_t lumi,
int indexToGetEntry)
: processHistoryIDIndex_(processHistoryIDIndex),
run_(run),
lumi_(lumi),
indexToGetEntry_(indexToGetEntry),
beginEventNumbers_(-1),
endEventNumbers_(-1) {}
IndexIntoFile::SortedRunOrLumiItr::SortedRunOrLumiItr(IndexIntoFile const* indexIntoFile, unsigned runOrLumi)
: indexIntoFile_(indexIntoFile), runOrLumi_(runOrLumi) {
assert(runOrLumi_ <= indexIntoFile_->runOrLumiEntries().size());
indexIntoFile_->fillRunOrLumiIndexes();
}
bool IndexIntoFile::SortedRunOrLumiItr::operator==(SortedRunOrLumiItr const& right) const {
return indexIntoFile_ == right.indexIntoFile() && runOrLumi_ == right.runOrLumi();
}
bool IndexIntoFile::SortedRunOrLumiItr::operator!=(SortedRunOrLumiItr const& right) const {
return indexIntoFile_ != right.indexIntoFile() || runOrLumi_ != right.runOrLumi();
}
IndexIntoFile::SortedRunOrLumiItr& IndexIntoFile::SortedRunOrLumiItr::operator++() {
if (runOrLumi_ != indexIntoFile_->runOrLumiEntries().size()) {
++runOrLumi_;
}
return *this;
}
bool IndexIntoFile::SortedRunOrLumiItr::isRun() {
return indexIntoFile_->runOrLumiIndexes().at(runOrLumi_).lumi() == invalidLumi;
}
void IndexIntoFile::SortedRunOrLumiItr::getRange(long long& beginEventNumbers,
long long& endEventNumbers,
EntryNumber_t& beginEventEntry,
EntryNumber_t& endEventEntry) {
beginEventNumbers = indexIntoFile_->runOrLumiIndexes().at(runOrLumi_).beginEventNumbers();
endEventNumbers = indexIntoFile_->runOrLumiIndexes().at(runOrLumi_).endEventNumbers();
int indexToGetEntry = indexIntoFile_->runOrLumiIndexes().at(runOrLumi_).indexToGetEntry();
beginEventEntry = indexIntoFile_->runOrLumiEntries_.at(indexToGetEntry).beginEvents();
endEventEntry = indexIntoFile_->runOrLumiEntries_.at(indexToGetEntry).endEvents();
}
IndexIntoFile::RunOrLumiIndexes const& IndexIntoFile::SortedRunOrLumiItr::runOrLumiIndexes() const {
return indexIntoFile_->runOrLumiIndexes().at(runOrLumi_);
}
IndexIntoFile::IndexIntoFileItrImpl::IndexIntoFileItrImpl(IndexIntoFile const* indexIntoFile,
EntryType entryType,
int indexToRun,
int indexToLumi,
int indexToEventRange,
long long indexToEvent,
long long nEvents)
: indexIntoFile_(indexIntoFile),
size_(static_cast<int>(indexIntoFile_->runOrLumiEntries_.size())),
type_(entryType),
indexToRun_(indexToRun),
indexToLumi_(indexToLumi),
indexToEventRange_(indexToEventRange),
indexToEvent_(indexToEvent),
nEvents_(nEvents) {}
IndexIntoFile::IndexIntoFileItrImpl::~IndexIntoFileItrImpl() {}
void IndexIntoFile::IndexIntoFileItrImpl::next() {
if (type_ == kEvent) {
if ((indexToEvent_ + 1) < nEvents_) {
++indexToEvent_;
} else {
bool found = nextEventRange();
if (!found) {
type_ = getRunOrLumiEntryType(indexToLumi_ + 1);
if (type_ == kLumi) {
++indexToLumi_;
initializeLumi();
} else if (type_ == kRun) {
indexToRun_ = indexToLumi_ + 1;
initializeRun();
} else {
setInvalid(); // type_ is kEnd
}
}
}
} else if (type_ == kLumi) {
if (indexToLumi_ + 1 == size_) {
if (indexToEvent_ < nEvents_) {
type_ = kEvent;
} else {
setInvalid();
}
} else {
EntryType nextType = getRunOrLumiEntryType(indexToLumi_ + 1);
if (nextType == kLumi && isSameLumi(indexToLumi_, indexToLumi_ + 1)) {
++indexToLumi_;
} else if (indexToEvent_ < nEvents_) {
type_ = kEvent;
} else if (nextType == kRun) {
type_ = kRun;
indexToRun_ = indexToLumi_ + 1;
initializeRun();
} else {
++indexToLumi_;
initializeLumi();
}
}
} else if (type_ == kRun) {
EntryType nextType = getRunOrLumiEntryType(indexToRun_ + 1);
bool sameRun = isSameRun(indexToRun_, indexToRun_ + 1);
if (nextType == kRun && sameRun) {
++indexToRun_;
} else if (nextType == kRun && !sameRun) {
++indexToRun_;