Name:           perfecthash
Version:        0.2.0
Cabal-Version:  >= 1.10
License:	BSD3
License-File:   LICENSE
Build-Type:     Simple
Author:		Mark Wotton <mwotton@gmail.com>
Maintainer:	Mark Wotton <mwotton@gmail.com>
Category:	Data, Data Structures
Stability:	Experimental
extra-source-files:  README, TODO
bug-reports:	mailto:mwotton@gmail.com
Synopsis:	A perfect hashing library for mapping bytestrings to values.
Description:    A perfect hashing library for mapping bytestrings to values.
		Insertion is not supported (by design): Only fromList
		and lookup operations are supported.

                CI at https://travis-ci.org/mwotton/PerfectHash
Library
        default-language: Haskell2010
        Exposed-Modules: Data.PerfectHash
        ghc-options:    -funbox-strict-fields -O2
        ghc-prof-options: -fprof-auto
--        extra-libraries: cmph
        build-depends:  base >=4.5 && <5.2,
                        containers,
                        cmph,
                        bytestring,
                        array,
                        time


test-suite cmph-test
  default-language:    Haskell2010
  type:                exitcode-stdio-1.0
  hs-source-dirs:      test
  main-is:             Main.hs
  other-modules:       Data.PerfectHashSpec
  build-depends:       cmph
                     , base
                     , hspec
                     , QuickCheck
                     , perfecthash
                     , bytestring
                     , containers

Benchmark bench-foo
    type:       exitcode-stdio-1.0
    main-is:        Main.hs
    hs-source-dirs: benchmark
    build-depends:  base
                  , array
                  , bytestring
                  , criterion
                  , containers
                  , random
                  , perfecthash
                  , unordered-containers
                  , deepseq
source-repository head
  type: git
  location: http://github.com/mwotton/PerfectHash.git