Cabal revisions of dawg-ord-0.4
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-name: dawg-ord-version: 0.4-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 is, semantically, a map from- sequences of alphabet symbols (keys) to values.- .- The library allows to build DAWGs over any symbols and values- provided that the 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.6-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- hs-source-dirs: src- build-depends:- base >= 4 && < 5- , containers >= 0.4.1 && < 0.6- , vector >= 0.10 && < 0.12- , mtl >= 2.1 && < 2.3- , transformers >= 0.3 && < 0.5-- 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--source-repository head- type: git- location: https://github.com/kawu/dawg-ord.git+name: dawg-ord +version: 0.4 +x-revision: 1 +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 is, semantically, a map from + sequences of alphabet symbols (keys) to values. + . + The library allows to build DAWGs over any symbols and values + provided that the 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.6 +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 + hs-source-dirs: src + build-depends: + base >= 4 && < 5 + , containers >= 0.5 && < 0.6 + , vector >= 0.10 && < 0.12 + , mtl >= 2.1 && < 2.3 + , transformers >= 0.3 && < 0.5 + + 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 + +source-repository head + type: git + location: https://github.com/kawu/dawg-ord.git