6502/CLK
1
0
Fork 0
mirror of https://github.com/TomHarte/CLK.git synced 2024-12-24 12:30:17 +00:00
Code Issues Projects Releases Wiki Activity

Attempt to make switch sets even more obviously collapsible.

Browse Source
This commit is contained in:
Thomas Harte 2023-05-30 16:43:22 +01:00
parent c630f86f33
commit 4e12d5a70a
1 changed files with 12 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
ClockReceiver/Dispatcher.hpp
View File

@ -21,8 +21,8 @@ struct UnitConverter {
template <int max, typename SequencerT, typename ConverterT = UnitConverter>
struct Dispatcher {
/// Perform @c target.perform<n>() for the input range [start, end]; @c ConverterT()(n) will be applied to
/// each individual step before it becomes the relevant template argument.
/// Perform @c target.perform<n>() for the input range `start <= n < end`;
/// @c ConverterT()(n) will be applied to each individual step before it becomes the relevant template argument.
void dispatch(SequencerT &target, int start, int end) {
// Minor optimisation: do a comparison with end once outside the loop and if it implies so
@ -45,11 +45,16 @@ private:
//
// Sensible choices by the optimiser are assumed.
#define index(n) \
if constexpr (n == max) return; \
if(use_end && end == n) return; \
[[fallthrough]]; \
case n: target.template perform<ConverterT()(n)>();
#define index(n) \
case n: \
if constexpr (n <= max) { \
if constexpr (n == max) return; \
if constexpr (n < max) { \
if(use_end && end == n) return; \
} \
target.template perform<ConverterT()(n)>(); \
} \
[[fallthrough]];
#define index2(n) index(n); index(n+1);
#define index4(n) index2(n); index2(n+2);