dawg-ord-0.5.1.0: dawg-ord.cabal
name: dawg-ord
version: 0.5.1.0
synopsis: Directed acyclic word graphs
description:
The library implements /directed acyclic word graphs/ (DAWGs) internally
represented as /minimal acyclic deterministic finite-state automata/.
The implemented version of DAWG can be seen as a map from
sequences of alphabet symbols (keys) to values.
.
The library allows to build DAWGs over any symbols and values
provided that they both have `Ord` instances (see the
"Data.DAWG.Ord" module).
It also provides a fast insert operation which can be used to
construct DAWGs on-the-fly.
license: BSD3
license-file: LICENSE
cabal-version: >= 1.10
copyright: Copyright (c) 2015 Jakub Waszczuk
author: Jakub Waszczuk
maintainer: waszczuk.kuba@gmail.com
stability: experimental
category: Data, Data Structures
homepage: https://github.com/kawu/dawg-ord
build-type: Simple
library
default-language:
Haskell2010
hs-source-dirs: src
build-depends:
base >= 4 && < 5
, containers >= 0.5 && < 0.6
, vector >= 0.10 && < 0.13
, mtl >= 2.1 && < 2.3
, transformers >= 0.3 && < 0.6
exposed-modules:
Data.DAWG.Ord
, Data.DAWG.Int
other-modules:
Data.DAWG.Gen.Types
, Data.DAWG.Int.Dynamic
, Data.DAWG.Ord.Dynamic
, Data.DAWG.Int.Dynamic.Internal
, Data.DAWG.Int.Dynamic.Node
, Data.DAWG.Gen.Graph
, Data.DAWG.Gen.Trans
, Data.DAWG.Gen.Trans.Vector
, Data.DAWG.Gen.Trans.Map
, Data.DAWG.Gen.Trans.Hashed
, Data.DAWG.Gen.HashMap
, Data.DAWG.Gen.Util
ghc-options: -Wall
test-suite test
default-language:
Haskell2010
type:
exitcode-stdio-1.0
hs-source-dirs:
tests
main-is:
test.hs
other-modules:
Ord
build-depends:
dawg-ord
, base >= 4 && < 5
, containers >= 0.5 && < 0.6
, mtl >= 2.1 && < 2.3
, tasty >= 0.10
, smallcheck >= 1.1
, tasty-smallcheck >= 0.8
, tasty-quickcheck >= 0.8
, tasty-hunit >= 0.9
, HUnit >= 1.2
source-repository head
type: git
location: https://github.com/kawu/dawg-ord.git