Data.DAWG.Trans

The module provides an abstraction over transition maps from alphabet symbols to node identifiers.

Documentation

class Trans t where

Abstraction over transition maps from alphabet symbols to node identifiers.

Methods

empty :: t

Empty transition map.

lookup :: Sym -> t -> Maybe ID

Lookup sybol in the map.

index :: Sym -> t -> Maybe Int

Find index of the symbol.

byIndex :: Int -> t -> Maybe (Sym, ID)

Select a (symbol, ID) pair by index of its position in the map.

insert :: Sym -> ID -> t -> t

Insert element to the transition map.

fromList :: [(Sym, ID)] -> t

Construct transition map from a list.

toList :: t -> [(Sym, ID)]

Translate transition map into a list.

Instances

Trans Trans

Trans Trans

Trans t => Trans (Hashed t)