felipe.lessa:
> On Nov 29, 2007 10:31 PM, Justin Bailey <[EMAIL PROTECTED]> wrote:
> > I represent the automata as an array of integers, where each bit
> > represents a cell.
>
> Why don't you use an UArray of Bools? They're implemented as bit
> arrays internally, AFAIK (e.g. see
> http://www.haskell.org/haskellwiki/Shootout/Nsieve ). And then you
> would get rid of a lot of shifts and masks in your code -- clearer and
> faster, the Haskell Way (TM).
Probably you meant to point to this bit / bool benchmark,
http://www.haskell.org/haskellwiki/Shootout/Nsieve_Bits#New_entry
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
