-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsubwordgraph.cabal
37 lines (35 loc) · 1.04 KB
/
subwordgraph.cabal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
name: subwordgraph
version: 1.0.2
cabal-version: 1.12
build-type: Simple
license: BSD3
license-file: LICENSE
maintainer: [email protected]
stability: experimental
homepage: https://github.com/danielnowakowski/Subword-Graph
bug-reports: https://github.com/danielnowakowski/Subword-Graph/issues
synopsis: Subword graph implementation
description:
An implementation of a classic Subword Graph (aka DAWG) data structure for solving string related problems on a single word.
category: Data Structures
author: Adam Bąk, Daniel Nowakowski
library
exposed-modules:
Data.SubwordGraph
build-depends:
base >= 4.6 && < 5,
containers >=0.5.6.2 && <0.6,
mtl >=2.2.1 && <2.3
default-language: Haskell2010
hs-source-dirs: src
ghc-options: -ferror-spans
test-suite test-subwordgraph
type: exitcode-stdio-1.0
main-is: Main.hs
build-depends:
QuickCheck -any,
base >= 4.6 && < 5,
subwordgraph -any
default-language: Haskell2010
hs-source-dirs: test
ghc-options: -ferror-spans