[Haskell-cafe] hamming distance allocation
arnoldomuller at gmail.com
Mon Apr 19 11:17:11 EDT 2010
The strings will not be longer than 30 characters.
I am doing sets of 2000 (total of 2000^2 distance computations)
I am expecting that all the operations will be lazyly performed but at some
point I get a memory error.
Most of the memory is being allocated for the hamming distance and I am
still unable to find the source of my memory leak.
On Mon, Apr 19, 2010 at 3:47 PM, Daniel Fischer <daniel.is.fischer at web.de>wrote:
> Am Montag 19 April 2010 14:37:33 schrieb John Lato:
> > Is it really necessary to use Strings? I think a packed type, e.g.
> > Vector or ByteString, would be much more efficient here.
> Not very much if the strings are fairly short (and the list isn't too long,
> so there's not a big difference in cache-friendliness).
> If eight-bit characters aren't enough, packing the strings into
> UArray Int Char gives performance quite close to ByteStrings.
> > Of course this is only likely to be a benefit if you can move away from
> > String entirely.
> > I suspect that "hamming2" would perform better then.
> > John
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe