This makes it easier to have exhaustive handling of operations by combaring the length of the lookup table with the length of the dataclass, and should also be a bit faster to compile (I assume the dictionary indexed with enums should have O(1) lookup.)
This makes it easier to have exhaustive handling of operations by combaring the length of the lookup table with the length of the dataclass, and should also be a bit faster to compile (I assume the dictionary indexed with enums should have O(1) lookup.)