binary-search-0.1: binary-search.cabal

Name:           binary-search
Version:        0.1
Build-Depends:  base
Build-Type:     Simple
License:        BSD3
license-file:   LICENSE
Author:         Ross Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>
Maintainer:     Takayuki Muranushi <muranushi@gmail.com>   
Category:       Algorithms
Synopsis:       Binary and exponential searches
Description:    These modules address the problem of finding the boundary
                of an upward-closed set of integers, using a combination
                of exponential and binary searches.  Variants are provided
                for searching within bounded and unbounded intervals of
                both 'Integer' and bounded integral types.
cabal-version:      >=1.8

library
  exposed-modules:  Numeric.Search
                    Numeric.Search.Bounded
                    Numeric.Search.Integer
                    Numeric.Search.Range
                    Numeric.Search.Combinator.Monadic
                    Numeric.Search.Combinator.Pure

  Ghc-Options:      -Wall

  build-depends:    base >=4.5 && < 5
                  , containers >= 0.4

Test-Suite doctest
  Type: exitcode-stdio-1.0
  HS-Source-Dirs: test
  Ghc-Options: -threaded -Wall
  Main-Is: doctests.hs
  Build-Depends:    base
                  , directory >= 1.1
                  , filepath >= 1.2
                  , doctest >= 0.9.3

Test-Suite spec
  Type: exitcode-stdio-1.0
  Hs-Source-Dirs: test
  Ghc-Options: -Wall
  Main-Is: Spec.hs
  Other-Modules:    PureSpec
                    
  Build-Depends:    base >=4.5 && < 5
                  , binary-search

                  , hspec >= 1.3
                  , QuickCheck >= 2.5



Source-Repository head
  Type: git
  Location: https://github.com/nushio3/binary-search