[Haskell-cafe] Is Haskell capable of matching C in string processing performance?

Don Stewart dons at galois.com
Fri Jan 22 01:28:00 EST 2010


jmillikin:
> Here's the fastest Haskell version I could come up with. It discards
> all error handling, validation, and correctness in the name of
> performance, but still can't get anywhere near C:
> http://hpaste.org/fastcgi/hpaste.fcgi/view?id=16423

Thanks for posting the code.

You're not using bytestrings??

They were invented to deal with the problem of [Char] being a poor
structure for large scale string processing, and you should have no
problem getting C-like string performance.

    http://www.cse.unsw.edu.au/~dons/papers/CSL06.html

-- Don


More information about the Haskell-Cafe mailing list