dawg-0.8.2: Directed acyclic word graphs

Safe HaskellNone
LanguageHaskell2010

Data.DAWG.Trans.Hashed

Description

Transition map with a hash.

Synopsis

Documentation

data Hashed t Source #

Hash of a transition map is a sum of element-wise hashes. Hash for a given element (Sym, ID) is equal to combine Sym ID.

Constructors

Hashed 

Fields

Instances
Eq (Hashed Trans) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Eq (Hashed Trans) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Ord (Hashed Trans) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Ord (Hashed Trans) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Show t => Show (Hashed t) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Methods

showsPrec :: Int -> Hashed t -> ShowS #

show :: Hashed t -> String #

showList :: [Hashed t] -> ShowS #

Binary t => Binary (Hashed t) Source # 
Instance details

Defined in Data.DAWG.Trans.Hashed

Methods

put :: Hashed t -> Put #

get :: Get (Hashed t) #

putList :: [Hashed t] -> Put #

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 #