On Fri, Aug 13, 2010 at 9:55 AM, Daniel Fischer <daniel.is.fisc...@web.de>wrote:
> > That's an unfortunate example. Using the stringsearch package, substring > searching in ByteStrings was considerably faster than in Data.Text in my > tests. > Daniel, thanks again for bringing up this example! It turned out that quite a lot of the difference in performance was due to an inadvertent space leak in the text search code. With a single added bang pattern, the execution time and space usage both improved markedly. There is of course still lots of room for improvement, but having test cases like this helps immensely.
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
