2 Aug
2011
2 Aug
'11
4:11 p.m.
On Tue, Aug 2, 2011 at 12:58 PM, Ovidiu Deac
I'm trying to do some performance evaluation and I'm stuck with the fact that Haskell's lazy evaluation - which make my sort extremely fast :)
You'll probably want to take a look at criterion [1]. [1] http://hackage.haskell.org/package/criterion
I read this page: http://www.haskell.org/haskellwiki/Performance/Strictness but I didn't get it so I'm asking here: How do I make the function 'measure' to actually force the evaluation of (f p)?
One possible solution is: import Control.Exception (evaluate) import Control.DeepSeq (rnf) ... = do ... evaluate (rnf sorted) ... HTH, -- Felipe.