Closed mszlazak closed 10 months ago
Sorry @mszlazak , but that would take a lot of work. It makes sense to have permutations defined for any finite set containing elements of any type, and you can get that with my Bijections
type. What I've not created is a way to compose two bijections. That's something I can consider.
I see. I like your cycle representation in PermGen. Perhaps just integer type but not restricted to those from 1 to n. You could then use them as indexes to map to other types. Anyway, I am not familiar with your Bijections and will take a look. Thanks.
Can you make your PermGen use a set of integers {3,4,5,6} as well as what it does now with just the number of consecutive interferes from 1 to n? Thanks