That statement about switch inefficiency is simply not true, except for sparse case values.
But since one can generally choose those values (and they're often a running enum anyways), it's really a non-issue.
For sparse case, it's better to use a hash table. Perhaps a build phase to generate a perfect hash (https://en.wikipedia.org/wiki/Perfect_hash_function) to map each possible input value to continuous range of integer values.
Even for sparse case values the compiler will emit a binary search once the list of labels is long enough.
I guess the main issue is that the compiler will need to also ensure no value outside the expected set can match a case statement either (no match and default cases), which kinda negates the benefit.
Maybe there are cases this is generated, anyone seen compiler generating those?
I wonder whether it is possible to generate reversible (almost) perfect "hashes"?
I mean a hash where every unique input value is guaranteed to map to a unique output value. Because this kind of hash could be used to handle no-match/default case safely.
It's actually pretty cheap on ARM (2 cycles [1]), if the message IDs are consecutive, due to TBB/TBH [2], and GCC will use it when appropriate. Not sure if x86 has an equivalent.
[1] http://infocenter.arm.com/help/index.jsp?topic=/com.arm.doc.... [2] http://infocenter.arm.com/help/topic/com.arm.doc.dui0553a/BA...