Safe Haskell	Safe
Language	Haskell2010

Data.DAWG.Trans

Description

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

Synopsis

Documentation

class Trans t where Source #

Abstraction over transition maps from alphabet symbols to node identifiers.

Methods

Empty transition map.

Lookup sybol in the map.

Find index of the symbol.

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

insert :: Sym -> ID -> t -> t Source #

Insert element to the transition map.

Construct transition map from a list.

Translate transition map into a list.

Instances

Trans Trans Source #
Instance details Defined in Data.DAWG.Trans.Map Methods empty :: Trans Source # lookup :: Sym -> Trans -> Maybe ID Source # index :: Sym -> Trans -> Maybe Int Source # byIndex :: Int -> Trans -> Maybe (Sym, ID) Source # insert :: Sym -> ID -> Trans -> Trans Source # fromList :: [(Sym, ID)] -> Trans Source # toList :: Trans -> [(Sym, ID)] Source #
Trans Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods empty :: Trans Source # lookup :: Sym -> Trans -> Maybe ID Source # index :: Sym -> Trans -> Maybe Int Source # byIndex :: Int -> Trans -> Maybe (Sym, ID) Source # insert :: Sym -> ID -> Trans -> Trans Source # fromList :: [(Sym, ID)] -> Trans Source # toList :: Trans -> [(Sym, ID)] Source #
Trans t => Trans (Hashed t) Source #
Instance details Defined in Data.DAWG.Trans.Hashed Methods empty :: Hashed t Source # lookup :: Sym -> Hashed t -> Maybe ID Source # index :: Sym -> Hashed t -> Maybe Int Source # byIndex :: Int -> Hashed t -> Maybe (Sym, ID) Source # insert :: Sym -> ID -> Hashed t -> Hashed t Source # fromList :: [(Sym, ID)] -> Hashed t Source # toList :: Hashed t -> [(Sym, ID)] Source #