On 6/15/07, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
Benchmark it I guess :-) Both versions use a non-bytestring recursive functions (the outer B.map should just be a straight map, and yours use a foldr), which may mess fusion up... Not sure what would happe here... I don't have a Haskell compiler at this computer so I can't try anything out...
I just remembered this recent thread about fast bytestring parsing: http://www.nabble.com/Fast-number-parsing-with-strict-bytestrings--Was%3A-Re%3A-Seemingly-subtle-change-causes-large-performance-variation--tf3887303.html Perhaps there is an idea or two that can be applied here? Jason _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
