[Haskell-cafe] Toy compression algorithms [was: A very edgy
language]
Bulat Ziganshin
bulat.ziganshin at gmail.com
Sun Jul 8 06:53:36 EDT 2007
Hello Donald,
Sunday, July 8, 2007, 12:50:36 PM, you wrote:
>>
too much quoting :(
> Good work. Probably worth benchmarking against the other compression
> libraries
are you really want to totally discredit Haskell? :) they should be
hundreds of times slower than any practical compression algorithm
(and btw, zlib/bzlib isn't good performers anyway, my own algorithm is
several times faster with the same compression ratio)
Haskell isn't a good tool to develop compression algorithms because
it's the very well studied area where it has meaning to use all the
sorts of optimizations. so it falls in the "low-level algorithms"
category where using Haskell means at least 3x slower development and
3x worse performance - or faster development with 100x worse
performance. Andrew's code should fall into later category
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe
mailing list