Re: pure perl + large integers + bitsets = dilemma

are pure perl modules just masochism in disguise?

Set::Infinite is pure Perl and is reasonably fast. I can't say if it will serve your purposes, however. It does not rely in bit sets - it uses "spans" internally.

Comment on Re: pure perl + large integers + bitsets = dilemma

Replies are listed 'Best First'.
Re: Re: pure perl + large integers + bitsets = dilemma by wufnik (Friar) on Jun 17, 2003 at 07:14 UTC
thanks fglock. the use of bitsets is important because theoretically i can unions, intersections etc a little faster, in a little less space - and the sets can be large, and it needs to be fast, or i will spend all my time answering 'why did you do it this way when it is soooo slow' type questions. for 'sparse' sets, the approach your Set::Infinite takes is much more sensible, allowing it to do clever things with more complicated set types. i particularly like it's connection with dates, which seems a good idea. Quantum::Superpositions is something i should check out too, I guess. ...wufnik -- in the world of the mules there are no rules --	[reply]
Re: Re: pure perl + large integers + bitsets = dilemma by dextius (Monk) on Jun 17, 2003 at 13:28 UTC
Ok, I know it said "pure perl", but in case you are looking for a decent C implementation for Perl, look at Math::BigGMP. It's a drop in replacement for Math::BigInt.. Just throwing options for "related" questions..	[reply]