Classes | |
struct | MakeArray |
struct | MakeArray< T, N, 0 > |
Functions | |
unsigned int | findIndex (const reco::TrackBase::TrackAlgorithm algo, const unsigned int index) |
template<typename T , size_t N> | |
std::array< T, N > | makeArray () |
unsigned int | priorityForAlgo (const reco::TrackBase::TrackAlgorithm algo) |
Variables | |
reco::TrackBase::TrackAlgorithm | algoPriorityOrder [] |
The trackAlgoPriorityOrder maps an reco::TrackBase::TrackAlgorithm enumerator to its priority in track list merging. The mapping is needed because the order of the enumerators themselves does not, in general, convey useful information.
unsigned int impl::findIndex | ( | const reco::TrackBase::TrackAlgorithm | algo, |
const unsigned int | index | ||
) |
Recursive implementation of searching the index of an algorithm in the algoPriorityOrder
algo | Algorithm whose index is searched for |
index | Current index |
Definition at line 83 of file trackAlgoPriorityOrder.h.
Create compile-time an std::array mapping reco::TrackBase::TrackAlgorithm enumerators to their order priorities as defined in impl::algoPriorityOrder array.
T | value_type of the std::array |
N | Size of the std::array |
Definition at line 150 of file trackAlgoPriorityOrder.h.
unsigned int impl::priorityForAlgo | ( | const reco::TrackBase::TrackAlgorithm | algo | ) |
Find the order priority for a track algorithm
algo | algorithm whose index is searched for |
Definition at line 98 of file trackAlgoPriorityOrder.h.
reco::TrackBase::TrackAlgorithm impl::algoPriorityOrder[] |
This array defines the priority order in merging for the algorithms. The order is ascending, i.e. the first algorithm has the highest priority etc. The size of the array should be reco::TrackBase:algoSize (checked below with static_assert), and each reco::TrackBase::TrackAlgorithm enumerator should be in the array exactly once (checked below in findIndex() function).
Definition at line 24 of file trackAlgoPriorityOrder.h.