The only way to deal with this efficiently is to reduce the input sets to non-overlapping sets prior to permuting them.
To do that, you need to lay out the rules for overlapping sets. You'd need to define how to deal with:
Whence you've defined how all the possibilities should be resolved into distinct groups, the rest should be relatively easy.
I'm still bugged by your lack of explanation of what the purpose of this is?
In reply to Re^5: Multiple Combinatorics
by BrowserUk
in thread Multiple Combinatorics
by aartist
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |