Re: fixed list combinatorics
- From: fxn@xxxxxxxxxxx (Xavier Noria)
- Date: Fri, 30 Nov 2007 10:53:55 +0100
On Nov 29, 2007, at 2:06 AM, Xavier Noria wrote:
Indeed, the iterator provided by Algorithm::Combinatorics is faster only for lists of sizes >= 7. (And gets to be twice as fast for size 16.)
Certainly there's room for improvement here.
For the archives, I copied the iterator in List::PowerSet and rewrote it in XS for Algorithm::Combinatorics, that's up in the 0.25.
-- fxn
.
- References:
- fixed list combinatorics
- From: Dan Klose
- Re: fixed list combinatorics
- From: Dr.Ruud
- Re: fixed list combinatorics
- From: Yitzle
- Re: fixed list combinatorics
- From: Xavier Noria
- Re: fixed list combinatorics
- From: Xavier Noria
- Re: fixed list combinatorics
- From: Xavier Noria
- fixed list combinatorics
- Prev by Date: RE: Comparing Regular Expression in Perl vs Python
- Next by Date: Re: Comparing Regular Expression in Perl vs Python
- Previous by thread: Re: fixed list combinatorics
- Next by thread: Re: fixed list combinatorics
- Index(es):
Relevant Pages
|