microbench: Microbenchmark Haskell code
Microbenchmarking can be used to compare the speed of different approaches to the same operation. Since most code is very fast, to get accurate timing information you must run the operation many times and then divide to get the time per operation.
This library manages the microbenchmarking process: it finds how many iterations of a function are needed to get a good timing estimate per iteration and prints out a human-readable "Your code takes n nanoseconds to run, and can run n times per second".
|Versions [RSS] [faq]||0.1|
|Dependencies||base, time [details]|
|Copyright||(c) 2008 Evan Martin <email@example.com>|
|Uploaded||by EvanMartin at 2008-03-02T22:18:49Z|
|Downloads||1216 total (7 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]