Rendering the Invisible
How can we track the parity (odd/even transpositions) of all permutations in a totally ordered set?
Useful when the number of arguments to a carteisan product is determined at runtime.
An example that shows compile time type id generation for a performant runtime type inference.
Useful to unit-test private methods for when you have no better way.