[Haskell-cafe] proper way to generate a random data in criterion
Kazu Yamamoto ( 山本和彦 )
kazu at iij.ad.jp
Thu Oct 20 03:35:52 CEST 2011
> The code looks ok to me -- you've deepseq'ed the list, and forcing it
> to whnf should force the deepseq. Also, criterion runs your benchmark
> many times, if your code was measuring the RNG time it would only
> happen once. This would show up in the criterion output as an
> unusually large outlier.
Thank you for your review.
Because my benchmark seems OK, I need to think why the algorithm works
slower against random data. :)
More information about the Haskell-Cafe