This may be the worst piece of documentation I have ever written.
"The order of the permutations is deterministic and can be found ahead of time by consulting the OEIS sequence for reverse colexicographic ordering, using the appropriate elements of A280318 as indices into A055089."
@zt to be fair to me i cannot imagine who on earth would give a shit which permutations would occur first since the whole point is to get all n! permutations. but yeah this is.... not good lol
@deejoe to be fair that's pretty normal, sorted hashes are less efficient in a lot of ways; a fast hashmap will generally not be usefully sorted.
@tindall oh I for-sure can't think of a better way to explain this, without like. listing instructions step-by step