rangemin: Linear range-min algorithms.

[ algorithms, bsd3, library ] [ Propose Tags ]

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

Versions [faq] 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.*), containers (>=0.3.0.0), primitive (>=0.3), vector (>=0.6) [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer wasserman.louis@gmail.com
Category Algorithms
Uploaded by LouisWasserman at Wed May 19 04:03:50 UTC 2010
Distributions NixOS:2.2.2
Downloads 7049 total (67 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-29 [all 7 reports]

Modules

  • Data
    • Data.RangeMin
      • Data.RangeMin.Cartesian
      • Data.RangeMin.LCA
        • Data.RangeMin.LCA.Binary

Downloads

Maintainer's Corner

For package maintainers and hackage trustees