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.
| Versions | 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 |
|---|---|
| Dependencies | array, base, containers |
| License | BSD3 |
| Author | Louis Wasserman |
| Maintainer | wasserman.louis@gmail.com |
| Category | Algorithms |
| Upload date | Sat Jan 17 02:35:33 UTC 2009 |
| Uploaded by | LouisWasserman |
| Build failure | ghc-6.10 (log), ghc-6.12 (log) |
| Distributions | Arch: 1.1.2 |
Modules
- Data
- Data.RangeMin
Downloads
- rangemin-1.1.0.tar.gz (Cabal source package)
- package description (included in the package)