Sebastian Fischer
Sun, 07 Mar 2010 09:10:51 -0800
Instead of drawing bars of different benchmarks next to each other like progression does, barchart draws one bar for each benchmarked implementation where the benchmarks are represented as blocks of the same bar. As a consequence, one can recognise on first sight, which implementation is the fastest _in total_ because the hight of each bar is the sum of run times of all benchmarks for an implementation. Another difference to progression is that barchart is (only) a post processor and you usually do not import barchart modules into your Haskell code.
Please refer to the project website for more information:
http://sebfisch.github.com/haskell-barchart/
I would not have written this program without the Diagrams library by
Brent Yorgey and the CmdArgs package by Neil Mitchell. Thank you for
your excellent libraries!
I hope barchart is useful for some of you! Sebastian -- Underestimating the novelty of the future is a time-honored tradition. (D.G.) _______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell