cabal-version: 2.2 name: OrderedBits version: 0.0.2.0 author: Christian Hoener zu Siederdissen copyright: Christian Hoener zu Siederdissen, 2014 - 2019 homepage: https://github.com/choener/OrderedBits bug-reports: https://github.com/choener/OrderedBits/issues maintainer: choener@bioinf.uni-leipzig.de category: Data license: BSD-3-Clause license-file: LICENSE build-type: Simple stability: experimental tested-with: GHC == 8.4.4 synopsis: Efficient ordered (by popcount) enumeration of bits description: This library provides efficient methods to enumerate all elements of a set in order of the population count, or the ordered enumerations of the elements of the powerset of a set. First, the empty set, then all 1-element sets, all 2-element sets, etc. Such enumerations are important for algorithms over unordered data sets. Examples include the travelling salesman problem and the closely related Hamiltonian path problem. Extra-Source-Files: README.md changelog.md common deps default-language: Haskell2010 default-extensions: BangPatterns , CPP , FlexibleContexts , PatternGuards , ScopedTypeVariables , TemplateHaskell , UnicodeSyntax ghc-options: -O2 -funbox-strict-fields library import: deps build-depends: base >= 4.7 && < 5.0 , bits >= 0.4 , primitive >= 0.5 , vector >= 0.11 , vector-algorithms >= 0.6 hs-source-dirs: lib exposed-modules: Data.Bits.Ordered benchmark benchmark import: deps build-depends: base , criterion >= 1.0.2 -- , OrderedBits hs-source-dirs: tests main-is: benchmark.hs type: exitcode-stdio-1.0 test-suite properties import: deps type: exitcode-stdio-1.0 main-is: properties.hs ghc-options: -threaded -rtsopts -with-rtsopts=-N hs-source-dirs: tests build-depends: base , QuickCheck >= 2.7 , tasty >= 0.11 , tasty-quickcheck >= 0.8 , tasty-th >= 0.1 , vector -- , OrderedBits source-repository head type: git location: git://github.com/choener/OrderedBits