[Haskell-beginners] Fwd: Implementing a spellchecker - problem with Data.HashTable performance

[umptious]

While I think Misters Samborski and Yorgey have fixed the performance
problem, I'm still curious about the apparent synergy effect:

> First example [1] just builds a HashTable of ~1 500 000 ByteStrings.
> > The program takes about 11 seconds to execute.
>


> > Reading data itself is not a
> > problem, as I've measured the execution time of a program which just
> > reads the file (and prints its last line to actually force the read,
> > hence "handle" Haskell's laziness) and it takes no more than a second.
>


> > Coupled together reading and building, however, takes unbearably long.
> > I didn't wait till the program stopped and just terminated it, but it
> > had been running for ~10 minutes already.
>

???
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20120420/474e2415/attachment.htm>