[Haskell-cafe] forLoop + strict State monad is much faster than foldl'

[Felipe Lessa]

Em 29-04-2014 13:35, Niklas Hambüchen escreveu:
> (http://htmlpreview.github.io/?https://github.com/nh2/loop/blob/master/results/bench-foldl-and-iorefs-are-slow-llvm.html),

Is it just or is criterion broken in some way?

It considers a 1140% effect on the mean "moderate", so I would guess
that the number is being incorrectly printed.  One of the tests even has
a "severe" 7280% effect!

Also, for "sum32/sumIntStrictState" is reports microseconds on the
charts but seconds on the table.

Cheers, =)

-- 
Felipe.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 901 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20140429/1b3e4c3f/attachment.sig>