Hello David, Sunday, April 9, 2006, 5:47:03 PM, you wrote:
> In an email to me, Jean-Philippe Bernardy expressed a concern that a > large table could needlessly fill the data cache. He proposed > checking 4 bits at a time and using a small table of 16 elements. > Not surprisingly, it isn't as fast. I wonder what you think of > this. Also, I wonder what would be a good test to demonstrate this > possible interaction with the cache. it depends on the actual task, CPU and other programs running at the same time :) i just can say that it will be better to use array of Word8 (with `fromIntegral` for conversion) and use `unsafeAt` for indexing -- Best regards, Bulat mailto:[EMAIL PROTECTED] _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
