dawg-ord

Directed acyclic word graphs

Version on this page:	0.4.0.2@rev:1
LTS Haskell 20.26:	0.5.1.2
Stackage Nightly 2023-05-01:	0.5.1.2
Latest on Hackage:	0.5.1.2

See all snapshots dawg-ord appears in

BSD-3-Clause licensed by Jakub Waszczuk

Maintained by [email protected]

This version can be pinned in stack with:dawg-ord-0.4.0.2@sha256:e855c06865af4ca1c876baf8c89cfe3479efb00501449f2bb717ad749161a638,1936

Module documentation for 0.4.0.2

Data
- Data.DAWG
  - Data.DAWG.Int
  - Data.DAWG.Ord

Depends on 5 packages(full list with versions):

base, containers, mtl, transformers, vector

The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata. The implemented version of DAWG is, semantically, 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.