name: dawg version: 0.8 synopsis: Directed acyclic word graphs description: The library implements /directed acyclic word graphs/ (DAWGs) internaly represented as /minimal acyclic deterministic finite-state automata/. . The "Data.DAWG" module provides fast insert and delete operations which can be used to build the automaton on-the-fly. The automaton from the "Data.DAWG.Static" module has lower memory footprint and provides static hashing functionality. Both automata versions work in combination with different implementations of transition maps provided by the "Data.DAWG.Trans" modules' hierarchy. license: BSD3 license-file: LICENSE cabal-version: >= 1.6 copyright: Copyright (c) 2012 IPI PAN author: Jakub Waszczuk maintainer: stability: experimental category: Data, Data Structures homepage: build-type: Simple library build-depends: base >= 4 && < 5 , containers , binary , vector , vector-binary , mtl exposed-modules: Data.DAWG , Data.DAWG.Types , Data.DAWG.Static , Data.DAWG.Trans , Data.DAWG.Trans.Vector , Data.DAWG.Trans.Map other-modules: Data.DAWG.Node , Data.DAWG.Graph , Data.DAWG.Internal , Data.DAWG.Util , Data.DAWG.HashMap , Data.DAWG.Trans.Hashed ghc-options: -Wall -O2 -auto source-repository head type: git location: