Re2: [MacPerl] BigInt sluggishness.

[bert <bertboucheron@bigfoot.com>]

Jim Miner wrote:

>This is a good application for Bit::Vector.
> You can think of bit vectors as sets of integers from 0 up to some
> maximum.  In your application, the vector/set for a class would
> contain the integers representing the hours that the class meets.

Thank you for the responses first of all. I think this sounds like something
I thought up last night. Each of the 70 possible hours are represented by
it's own character...each class is represented as a list of the characters
corresponding to its meeting times. I'd then go through and concatenate the
strings for the classes and run a regular expression of some sort over the
result to check for duplicates.

basketweaving = a b c Q  R s
juggling      = z 1 5 6
quilting      = b 7 & *

schedule =  basketweaving . juggling
schedule =  abcQRsz156 (good)
schedule .= quilting
schedule =  abcQRsz156b7&* (duplicate b...bad)

not sure if this will be fast or not, but it sounds close to your
suggestion, from what i can get of it.

David Steffen wrote about using binary operators and such...which i thought
about but know little about. I figured converting back to base 10 would
produce an even larger number...so that technique was out, i'm sure there
are other ways of using them in binary form though.

Thanks for responses...I will now get back to ignoring my real schoolwork
and work on this some more :c)

    Brian Boucheron.


# ===== Want to unsubscribe from this list?
# ===== Send mail with body "unsubscribe" to macperl-request@macperl.org