name:                rangemin
version:             2.1.4
synopsis:            Linear range-min algorithms.
description:	     Rapidly (in linear time) preprocesses a vector so that the minimum element of any given subrange can be looked up in constant time.
tested-with:	     GHC
category:            Algorithms
license:             BSD3
license-file:	     LICENSE
author:              Louis Wasserman
maintainer:          wasserman.louis@gmail.com
build-Depends:       base >= 4 && < 5, vector >= 0.6, containers >= 0.3.0.0, primitive >= 0.3
build-type:	     Simple
Exposed-modules:     Data.RangeMin
                     Data.RangeMin.LCA
                     Data.RangeMin.LCA.Binary
                     Data.RangeMin.Cartesian
Other-modules:	     Data.RangeMin.Common
                     Data.RangeMin.Common.ST
                     Data.RangeMin.Common.Math
                     Data.RangeMin.Common.Types
                     Data.RangeMin.Common.Combinators
                     Data.RangeMin.Common.Vector
                     Data.RangeMin.Fusion
                     Data.RangeMin.Fusion.Stream
                     Data.RangeMin.Fusion.Stream.Monadic
                     Data.RangeMin.Cartesian.STInt
                     Data.RangeMin.Int.Quadratic
                     Data.RangeMin.Int.Linearithmic
                     Data.RangeMin.Int.Linearithmic.Combinators
                     Data.RangeMin.Int.NearLinear
                     Data.RangeMin.Int.Catalan
                     Data.RangeMin.Int.Catalan.Combinators
                     Data.RangeMin.Int.Catalan.Table
                     Data.RangeMin.Int.Linear
                     Data.RangeMin.LCA.IndexM
ghc-options:         -O2 -fspec-constr-count=10
extra-source-files:  IntQC.hs
                     newRMQ.tgz
                     BasicBench.hs