Is there any reason ConsistentPermutation doesn't allow n to be zero - as per this assertion.
This results in special casing when you're constructing the permutations. We might need a branch at the top of the next function to check, but it should be highly predictable.
Is there any reason
ConsistentPermutationdoesn't allownto be zero - as per this assertion.This results in special casing when you're constructing the permutations. We might need a branch at the top of the
nextfunction to check, but it should be highly predictable.