The dawg package

[Tags: bsd3, library]

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.


Properties

Versions0.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
Dependenciesbase (==4.*), binary, containers, mtl, vector, vector-binary
LicenseBSD3
CopyrightCopyright (c) 2012 IPI PAN
AuthorJakub Waszczuk
Maintainerwaszczuk.kuba@gmail.com
Stabilityexperimental
CategoryData, Data Structures
Home pagehttps://github.com/kawu/dawg
Source repositoryhead: git clone https://github.com/kawu/dawg.git
UploadedTue Nov 27 11:29:40 UTC 2012 by JakubWaszczuk
Downloads1346 total (71 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees