From: Robert Klemme <shortcutter@...>
Date: 2006-10-26T05:50:20+09:00
Subject: Re: Premature Optimization

poopdeville@gmail.com wrote:
> Hi everybody,
> 
> I'm writing a fairly open-ended question.  I'm hoping for suggestions,
> opinions, advice.  Suppose I have n arrays, each of which has m
> entries.  m is a fairly large integer, on the order of 10,000.  Each
> entry is either 1 or 0.

> Is there a slick way to do this with unpacking and packing?  Or some
> other way to do this with strings?  Any modules or libraries I should
> look into?  I'm fairly new to Ruby, though not to scientific
> computation.  I realize I won't be able to do this any faster than with
> m * n * (a constant multiplier), but I need that constant multiplier to
> be as small as possible.  Any advice would be appreciated.

I would look out for an implementation of a BitSet as this data 
structure seems crucial for your application.  You could even create one 
your own - it's not too hard.

Kind regards

	robert