[Haskell-cafe] Re: String vs ByteString

Bryan O'Sullivan bos at serpentine.com
Fri Aug 13 19:41:36 EDT 2010

On Fri, Aug 13, 2010 at 9:55 AM, Daniel Fischer <daniel.is.fischer at 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.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100813/a4c1ac3c/attachment.html

More information about the Haskell-Cafe mailing list