[Haskell-cafe] Iteratee performance

Bayley, Alistair Alistair.Bayley at invesco.com
Wed Mar 17 11:52:21 EDT 2010

> From: haskell-cafe-bounces at haskell.org 
> [mailto:haskell-cafe-bounces at haskell.org] On Behalf Of Vasyl Pasternak
> Yesterday I played with iteratee package, and wanted to check its
> performance. I tried to count lines in a file, as Oleg in his famous
> lazy_vs_correct[1] article. The results somewhat disappointed me.
> The statistics and code follows, but shortly: lazy bytestring is the
> fastest, iteratee with bytestrings 10 times slower than lazy
> bytestring. When comparing lazy string and iteratee with [Char], than
> their results were close, but lazy string reading uses less memory and
> was a bit faster (20%).
> I performed test on 250Mb file with 5 millions lines.

Not tuning advice, but still...

If you have the time, could you also try Peter Simon's old block-io

I'm curious to see how it compares to bytestring. I can't see why the
iteratee approach can't have similar performance.

Confidentiality Note: The information contained in this message,
and any attachments, may contain confidential and/or privileged
material. It is intended solely for the person(s) or entity to
which it is addressed. Any review, retransmission, dissemination,
or taking of any action in reliance upon this information by
persons or entities other than the intended recipient(s) is
prohibited. If you received this in error, please contact the
sender and delete the material from any computer.

More information about the Haskell-Cafe mailing list