rangemin: Linear range-min algorithms.
Rapidly and lazily preprocesses an array or list so that the smallest element in an arbitrary subrange can be found in constant time.
Downloads
- rangemin-1.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] | 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.0.5, 1.0.6, 1.1.0, 1.1.1, 1.1.2, 2.0, 2.1.0, 2.1.1, 2.1.2, 2.1.3, 2.1.4, 2.1.5, 2.2.0, 2.2.1, 2.2.2 |
|---|---|
| Dependencies | array, base, containers, ghc-prim, mtl [details] |
| Tested with | ghc >=0 |
| License | BSD-3-Clause |
| Author | Louis Wasserman |
| Maintainer | wasserman.louis@gmail.com |
| Category | Algorithms |
| Uploaded | by LouisWasserman at 2009-01-18T23:14:18Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 14162 total (1 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |