Name: bitset Version: 1.4.0 Synopsis: A space-efficient 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). Category: Data Structures License: MIT License-file: LICENSE Data-files: CHANGES Author: Sergei Lebedev , Aleksey Kladov , Fedor Gogolev Maintainer: superbobry@gmail.com Bug-reports: http://github.com/lambda-llama/bitset/issues Stability: Experimental Cabal-Version: >= 1.12 Build-type: Simple Tested-with: GHC >= 7.4.2 Source-repository head Type: git Location: https://github.com/lambda-llama/bitset Library Hs-source-dirs: src Ghc-options: -Wall -fno-warn-orphans Default-language: Haskell2010 Build-depends: base >= 4.4.0 && < 4.7 , deepseq == 1.3.* , integer-gmp , ghc-prim Exposed-modules: Data.BitSet , Data.BitSet.Dynamic , Data.BitSet.Generic , Data.BitSet.Word 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.4.0 && < 4.7 , QuickCheck == 2.5.* , test-framework == 0.6.* , test-framework-quickcheck2 == 0.2.* , bitset Benchmark bitset-benchmarks Hs-source-dirs: src benchmarks Ghc-options: -Wall -fno-warn-orphans -O2 -optc-O3 -optc-msse4.1 Default-language: Haskell2010 Type: exitcode-stdio-1.0 Main-is: Benchmarks.hs Build-depends: base >= 4.4.0 || < 4.7 , deepseq == 1.3.* , integer-gmp , ghc-prim , criterion == 0.6.* , containers >= 0.4.2 , random == 1.0.* , random-shuffle == 0.0.4