homepage: https://github.com/danielnowakowski/Subword-Graph
changelog-type: ''
hash: 9041976019744df3580be87b55665df42b648046356b439c290f216498f72fb0
test-bench-deps:
  base: ! '>=4.5 && <5'
  containers: ! '>=0.5.6.2 && <0.6'
  mtl: ! '>=2.2.1 && <2.3'
  QuickCheck: -any
  subwordgraph: -any
maintainer: adambak1992@gmail.com
synopsis: Subword graph implementation
changelog: ''
basic-deps:
  base: ! '>=4.8 && <5'
  containers: ! '>=0.5.6.2 && <0.6'
  mtl: ! '>=2.2.1 && <2.3'
all-versions:
- '1.0.0'
- '1.0.1'
author: Adam Bąk, Daniel Nowakowski
latest: '1.0.1'
description-type: haddock
description: An implementation of a classic Subword Graph (aka DAWG) data structure
  for solving string related problems on a single word.
license-name: BSD3

homepage: https://github.com/danielnowakowski/Subword-Graph
changelog-type: ''
hash: 0976a7219c7b2fa92ef537ac4ebf2157ac61712b08b0816c05bdc6f3a7f899ca
test-bench-deps:
  base: ! '>=4.6 && <5'
  QuickCheck: -any
  subwordgraph: -any
maintainer: adambak1992@gmail.com
synopsis: Subword graph implementation
changelog: ''
basic-deps:
  base: ! '>=4.6 && <5'
  containers: ! '>=0.5.6.2 && <0.6'
  mtl: ! '>=2.2.1 && <2.3'
all-versions:
- '1.0.0'
- '1.0.1'
- '1.0.2'
author: Adam Bąk, Daniel Nowakowski
latest: '1.0.2'
description-type: haddock
description: An implementation of a classic Subword Graph (aka DAWG) data structure
  for solving string related problems on a single word.
license-name: BSD3

Update from Hackage at 2016-06-07T11:42:19+0000
Update from Hackage at 2016-06-07T11:42:19+0000
