Data.DAWG.Ord

A version of Int adapted to keys and values with Ord instances.

DAWG type

data DAWG a b

A directed acyclic word graph (DAWG) with type a representing the type of alphabet symbols (over which keys are constructued) and type b -- the type of values.

A DAWG is, semantically, a map from keys (sequences of as) to values b.

Instances

(Eq a, Eq b) => Eq (DAWG a b)

(Ord a, Ord b) => Ord (DAWG a b)

(Show a, Show b) => Show (DAWG a b)

type ID = Int

Node identifier.

root :: DAWG a b -> ID

Root of the DAWG.

Query

lookup :: (Ord a, Ord b) => [a] -> DAWG a b -> Maybe b

Find value associated with the key.

numStates :: DAWG a b -> Int

Number of states in the automaton.

numEdges :: DAWG a b -> Int

Number of edges in the automaton.

Traversal

value :: ID -> DAWG a b -> Maybe b

Value stored in the given node.

edges :: ID -> DAWG a b -> [(a, ID)]

A list of outgoing edges.

follow :: Ord a => ID -> a -> DAWG a b -> Maybe ID

Follow the given transition from the given state.

Construction

empty :: DAWG a b

Empty DAWG.

fromList :: (Ord a, Ord b) => [([a], b)] -> DAWG a b

Construct DAWG from the list of (word, value) pairs.

fromLang :: Ord a => [[a]] -> DAWG a ()

Make DAWG from the list of words. Annotate each word with the () value.

Insertion

insert :: (Ord a, Ord b) => [a] -> b -> DAWG a b -> DAWG a b

Insert the (key, value) pair into the DAWG.

Conversion

assocs :: DAWG a b -> [([a], b)]

Return all key/value pairs in the DAWG in ascending key order.

keys :: DAWG a b -> [[a]]

Return all keys of the DAWG in ascending order.

elems :: DAWG a b -> [b]

Return all elements of the DAWG in the ascending order of their keys.