rangemin: Linear range-min algorithms.

[ algorithms, bsd3, library ] [ Propose Tags ]

Rapidly and lazily preprocesses an array or list so that the smallest element in an arbitrary subrange can be found in constant time.

Modules

[Last Documentation]

  • Data
    • Data.RangeMin

Downloads

Maintainer's Corner

Package maintainers

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 [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer wasserman.louis@gmail.com
Category Algorithms
Uploaded by LouisWasserman at 2009-01-17T02:35:33Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 13717 total (32 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-02 [all 7 reports]