Name:                 bitset
Version:              1.2
Synopsis:             A compact functional set data structure.
Description:
  A /bit set/ is a compact data structure, which maintains a set of members
  from a type that can be enumerated (i. e. has an `Enum' instance). Current
  implementations uses @Integer@ for as bit storage and provides most of the
  expected set operations: insertion, deletion, intersection, membership
  testing etc.
Category:             Data Structures
License:              MIT
License-file:         LICENSE
Data-files:           CHANGES
Author:               Sergei Lebedev <superbobry@gmail.com>
Maintainer:           Sergei Lebedev <superbobry@gmail.com>
Stability:            Alpha
Cabal-Version:        >= 1.12
Build-type:           Simple
Tested-with:          GHC >= 7.4.2

Library
  Hs-source-dirs:     src
  Ghc-options:        -Wall
  Default-language:   Haskell2010

  Build-depends:      base                    >= 4.5.1 && < 4.7
                    , deepseq                 == 1.3.*

  Exposed-modules:    Data.BitSet


Test-suite bitset-tests
  Hs-source-dirs:     tests
  Ghc-options:        -Wall -O2 -fno-warn-orphans
  Default-language:   Haskell2010

  Type:               exitcode-stdio-1.0
  Main-is:            Tests.hs

  Build-depends:      base                       >= 4.5.1 && < 4.7
                    , QuickCheck                 == 2.5.*
                    , test-framework             == 0.6.*
                    , test-framework-quickcheck2 == 0.2.*
                    , bitset

Benchmark bitset-benchmarks
  Main-is: Benchmarks.hs
  Hs-source-dirs:     tests, benchmarks
  Default-language:   Haskell2010
  Type:               exitcode-stdio-1.0

  Build-depends:      base                        >= 4.5.1 || < 4.7
                    , deepseq                     == 1.3.*
                    , bitset

                    , criterion                   == 0.6.*


Source-repository head
  Type:     git
  Location: https://github.com/superbobry/bitset