The dawg-ord package

[Tags:bsd3, library, test]

The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata. The implemented version of DAWG can be seen as a map from sequences of alphabet symbols (keys) to values.

The library allows to build DAWGs over any symbols and values provided that they 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.


Versions 0.2, 0.3, 0.3.1, 0.4,,,,,,
Dependencies base (==4.*), containers (==0.5.*), mtl (>=2.1 && <2.3), transformers (>=0.3 && <0.6), vector (>=0.10 && <0.13) [details]
License BSD3
Copyright Copyright (c) 2015 Jakub Waszczuk
Author Jakub Waszczuk
Category Data, Data Structures
Home page
Source repository head: git clone
Uploaded Mon Jan 9 10:47:28 UTC 2017 by JakubWaszczuk
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 529 total (17 in the last 30 days)
1 []
Status Docs available [build log]
Last success reported on 2017-01-09 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees