@hackage dawg0.6.0

Directed acyclic word graphs

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
- 0.11 Mon, 22 Jul 2013
- 0.10 Tue, 11 Jun 2013
- 0.9 Wed, 9 Jan 2013
- 0.8.2 Sat, 30 Nov 2019
- 0.8.1 Wed, 28 Nov 2012
- 0.8 Sat, 12 Jan 2019

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.

Installation
In your cabal file:
Dependencies (6)
- base >=4 && <5
- binary
- containers
- mtl
- vector >=0.4.1 && <0.6
- vector-binary
Dependents (2)
@hackage/adict, @hackage/nerf

@hackage dawg0.6.0

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (6)

Dependents (2)