Re: fixed list combinatorics

On Nov 28, 2007, at 9:54 PM, Xavier Noria wrote:

On Nov 28, 2007, at 8:58 PM, yitzle wrote:

In a personal email conversation, he realized what he was actually
looking for is the power set.
List::PowerSet
http://search.cpan.org/~nikc/List-PowerSet-0.01/lib/List/PowerSet.pm

If speed is an issue Algorith::Combinatorics provides subsets() in XS:

I had done some benchmarks which are included in the distribution but not this one.

I've found that List::PowerSet outperforms Algorithm::Combinatorics' subset(). Time to revise that subroutine.

-- fxn

.