rangemin: Linear range-min algorithms.

[ algorithms, bsd3, library ] [ Propose Tags ] [ Report a vulnerability ]

Rapidly (in linear time) preprocesses a vector so that the minimum element of any given subrange can be looked up in constant time.

Modules

[Last Documentation]

Data
- Data.RangeMin
  - Data.RangeMin.Cartesian
  - Data.RangeMin.LCA
    - Data.RangeMin.LCA.Binary

Downloads

rangemin-2.1.4.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

LouisWasserman

For package maintainers and hackage trustees

edit package information

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	base (>=4 && <5), containers (>=0.3.0.0), primitive (>=0.3), vector (>=0.6) [details]
Tested with	ghc >=0
License	BSD-3-Clause
Author	Louis Wasserman
Maintainer	wasserman.louis@gmail.com
Category	Algorithms
Uploaded	by LouisWasserman at 2010-05-19T04:03:50Z
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 not available [build log] All reported builds failed as of 2016-12-29 [all 7 reports]