dawg-0.8: Directed acyclic word graphs

Safe HaskellNone

Data.DAWG.Trans.Map

Description

Implementation of a transition map build on top of the M.Map container.

Synopsis

Documentation

data Trans Source

A vector of distinct key/value pairs strictly ascending with respect to key values.

Instances

Eq Trans 
Ord Trans 
Show Trans 
Binary Trans 
Trans Trans 
Eq (Hashed Trans) 
Ord (Hashed Trans) 
(Eq a, Eq b, Unbox a) => Eq (Node Trans a b) 
(Eq (Node Trans a b), Ord a, Ord b, Unbox a) => Ord (Node Trans a b)