On Wed, Oct 19, 2011 at 1:13 AM, Kazu Yamamoto
<kazu@iij.ad.jp> wrote:
Hello,
I'm measuring performance of the insertion operation of red-black
trees. For input, three kinds of [Int] are prepared: the increasing
the order, decreasing order, and random.
The random case is 4 or 5 times slower than the others. I'm afraid
that my program also measured the cost of random Int generation.
My benchmark code can be found:
https://github.com/kazu-yamamoto/llrbtree/blob/master/bench/insert/Bench.hs
Does anyone kindly take a look and tell me whether or not my criterion
code measures the cost of random Int generation?
It does. You need to use evaluate to have ensure actually be evaluated.
If so, would you suggest how to avoid it?
Have a look at:
-- Johan