Kurt Starsinic wrote:
On 5/22/06, David Landgren <[EMAIL PROTECTED]> wrote:
I have a list of elements, qw[a b c d e] and I wanted to steal some code
from CPAN to divvy it up into two subsets of 2 and 3 members. And
enumerate all the possibilities.
[ . . . . ]
Now my observation is that Set::Partition seems a little to generic
and/or I would be trampling on namespace with the proposed name. So
either do people have strong feelings about the name and/or a better
name for a module? Hint: When you read the subject of this message, did
you have a pretty good idea of what this module does?
Or did I overlook a module that already does this?
Have you looked at Math::Combinatorics?
Well, apart from its abysmal documentation, no, not much. Nor does the
much better Algorithm::Combinatorics help here.
The difference is that an element doesn't permute within a set, which
cuts down on a lot of arrangements.
Thanks,
David
--
hope still, a little resistance always maybe stubborn tiny lights vs.
clustering darkness forever ok? -- g!ybe
