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. Automaton from the Data.DAWG.Frozen module is ,,immutable'', but it has lower memory footprint and provides perfect hashing functionality.
|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||Fri Nov 23 01:47:04 UTC 2012 by JakubWaszczuk|
|Downloads||3005 total (30 in the last 30 days)|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees