Data.DAWG.Int

DAWG type

data DAWG a

A directed acyclic word graph with phantom type a representing the type of alphabet elements.

Instances

Eq (DAWG a)

Ord (DAWG a)

Show (DAWG a)

type ID = Int

Node identifier.

root :: DAWG a -> ID

Query

member :: Enum a => [a] -> DAWG a -> Bool

Find value associated with the key.

numStates :: DAWG a -> Int

Number of states in the automaton.

numEdges :: DAWG a -> Int

Number of edges in the automaton.

Traversal

accept :: ID -> DAWG a -> Bool

Value stored in the given state.

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

A list of outgoing edges.

follow :: Enum a => ID -> a -> DAWG a -> Maybe ID

Follow the given transition from the given state.

Construction

empty :: DAWG a

Empty DAWG.

fromList :: Enum a => [[a]] -> DAWG a

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

Insertion

insert :: Enum a => [a] -> DAWG a -> DAWG a

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

Conversion

keys :: Enum a => DAWG a -> [[a]]

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