name: packed-dawg version: 0.2.0.5 synopsis: Generation and traversal of highly compressed directed acyclic word graphs. description: Generation and traversal of highly compressed directed acyclic word graphs. license: BSD3 license-file: LICENSE author: Andras Kovacs maintainer: puttamalac@gmail.com category: Data build-type: Simple cabal-version: >=1.8 data-files: TWL06.txt Source-Repository head Type: git Location: https://github.com/AndrasKovacs/dawg library exposed-modules: Data.DAWG.Packed build-depends: base >= 4.6.0 && <= 4.9, vector == 0.10.*, mtl >=2.1, vector-binary-instances == 0.2.1.*, binary == 0.7.*, deepseq>=1.3, unordered-containers >= 0.2 test-suite test main-is: Tests.hs type: exitcode-stdio-1.0 build-depends: base >= 4.6.0 && <= 4.9, vector == 0.10.*, mtl >=2.1, vector-binary-instances == 0.2.1.*, binary == 0.7.*, deepseq>=1.3, unordered-containers >= 0.2, QuickCheck >= 2.5, HUnit >= 1.2, tasty >= 0.3, tasty-quickcheck >= 0.3, tasty-hunit >= 0.2 ghc-options: -O2 -rtsopts benchmark bench-dawg-gen main-is: Benchmarks.hs Build-depends: base >= 4.6.0 && <= 4.9, vector == 0.10.*, mtl >=2.1, vector-binary-instances == 0.2.1.*, binary == 0.7.*, deepseq>=1.3, unordered-containers >= 0.2, criterion >= 1.0 ghc-options: -O2 -rtsopts type: exitcode-stdio-1.0