The dawg package
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.
|Versions||0.1.0, 0.2.0, 0.3.0, 0.4.0, 0.5.0, 0.6.0, 0.7.0, 0.7.1, 0.8, 0.8.1, 0.9, 0.10, 0.11|
|Dependencies||base (==4.*), binary, containers, mtl, vector, vector-binary [details]|
|Copyright||Copyright (c) 2012 IPI PAN|
|Category||Data, Data Structures|
|Source repository||head: git clone https://github.com/kawu/dawg.git|
|Uploaded||Tue Nov 27 11:29:40 UTC 2012 by JakubWaszczuk|
|Downloads||3123 total (12 in the last 30 days)|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees