Safe Haskell | None |
---|---|
Language | Haskell2010 |
Implementation of a transition map build on top of the M.Map container.
Synopsis
- data Trans
Documentation
A vector of distinct key/value pairs strictly ascending with respect to key values.
Instances
Eq Trans Source # | |
Ord Trans Source # | |
Show Trans Source # | |
Binary Trans Source # | |
Trans Trans Source # | |
Defined in Data.DAWG.Trans.Map | |
Eq (Hashed Trans) Source # | |
Ord (Hashed Trans) Source # | |
Defined in Data.DAWG.Trans.Hashed | |
(Eq a, Eq b, Unbox a) => Eq (Node Trans a b) Source # | |
(Ord a, Ord b, Unbox a) => Ord (Node Trans a b) Source # | |
Defined in Data.DAWG.Node compare :: Node Trans a b -> Node Trans a b -> Ordering # (<) :: Node Trans a b -> Node Trans a b -> Bool # (<=) :: Node Trans a b -> Node Trans a b -> Bool # (>) :: Node Trans a b -> Node Trans a b -> Bool # (>=) :: Node Trans a b -> Node Trans a b -> Bool # |