Data.DAWG.Trans.Vector

A vector representation of a transition map. Memory efficient, but the insert operation is O(n) with respect to the number of transitions. In particular, complexity of the insert operation can make the construction of a large-alphabet dictionary intractable.

Documentation

data Trans

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)

(Eq b, Eq c, Unbox b) => Eq (DAWG Trans a b c)

(Eq (DAWG Trans a b c), Ord b, Ord c, Unbox b) => Ord (DAWG Trans a b c)