complexity: Empirical algorithmic complexity
Determine the complexity of functions by testing them on inputs of various sizes.
| Versions | 0.1, 0.1.1, 0.1.2, 0.1.3 |
|---|---|
| Dependencies | base (>=2), Chart (>=0.11 && <0.12), colour (>=2), data-accessor (>=0.2), hstats (>=0.1 && <=0.3), parallel (>=1 && <2), pretty (>=1), time (>=1.1.2), transformers (>=0.1.4) |
| License | BSD3 |
| Copyright | (c) 2009 Roel van Dijk |
| Author | Roel van Dijk |
| Maintainer | vandijk.roel@gmail.com |
| Stability | experimental |
| Category | Testing |
| Upload date | Thu May 28 16:00:43 UTC 2009 |
| Uploaded by | RoelVanDijk |
| Build failure | ghc-6.12 (log) |
| Distributions | Arch: 0.1.3 |
Modules
- Test
- Test.Complexity
- Test.Complexity.Base
- Test.Complexity.Chart
- Test.Complexity.Pretty
- Test.Complexity.Utils
- Test.Complexity
Downloads
- complexity-0.1.3.tar.gz (Cabal source package)
- package description (included in the package)