complexity: Empirical algorithmic complexity
Determine the complexity of functions by testing them on inputs of various sizes.
Modules
- Test
- Test.Complexity
- Test.Complexity.Base
- Test.Complexity.Chart
- Test.Complexity.Pretty
- Test.Complexity.Utils
- Test.Complexity
Downloads
- complexity-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.1.1, 0.1.2, 0.1.3 |
---|---|
Dependencies | base (>=2), Chart (>=0.1 && <=10.0.3), colour (>=2), data-accessor (>=0.2), hstats (>=0.1 && <=0.3), parallel (>=1 && <2), pretty (>=1), time (>=1.1.2), transformers (>=0.1.4) [details] |
License | BSD-3-Clause |
Copyright | (c) 2009 Roel van Dijk |
Author | Roel van Dijk |
Maintainer | vandijk.roel@gmail.com |
Category | Testing |
Uploaded | by RoelVanDijk at 2009-04-21T21:13:13Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 3422 total (25 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2017-01-01 [all 9 reports] |