@hackage dawg-ord0.5.1.1

Directed acyclic word graphs

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
- 0.5.1.2 Thu, 24 Sep 2020
- 0.5.1.1 Thu, 24 Sep 2020
- 0.5.1.0 Mon, 9 Jan 2017
- 0.5.0.2 Fri, 5 Aug 2016
- 0.5.0.1 Tue, 12 Jan 2016
- 0.5.0.0 Mon, 11 Jan 2016

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.

Installation
In your cabal file:
Dependencies (5)
- base >=4 && <5
- containers >=0.5 && <0.7
- mtl >=2.1 && <2.3
- transformers >=0.3 && <0.6
- vector >=0.10 && <0.13
Dependents (0)

@hackage dawg-ord0.5.1.1

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (5)

Dependents (0)