Safe Haskell | None |
---|---|
Language | Haskell2010 |
Transition map with a hash.
Documentation
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
.
Instances
Eq (Hashed Trans) Source # | |
Eq (Hashed Trans) Source # | |
Ord (Hashed Trans) Source # | |
Defined in Data.DAWG.Trans.Hashed | |
Ord (Hashed Trans) Source # | |
Defined in Data.DAWG.Trans.Hashed | |
Show t => Show (Hashed t) Source # | |
Binary t => Binary (Hashed t) Source # | |
Trans t => Trans (Hashed t) Source # | |