Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Trie nodes may have an optional arbitrary value, and each edge is associated with a particular value seen in the input sequences.
Instances
(Ord e, Read v, Read e) => Read (Trie e v) Source # | |
(Show v, Show e) => Show (Trie e v) Source # | |
Generic (Trie e v) Source # | |
(Serialize e, Serialize v, Ord e, Ord v) => Serialize (Trie e v) Source # | |
type Rep (Trie e v) Source # | |
Defined in Codec.Compression.PPM.Trie type Rep (Trie e v) = D1 (MetaData "Trie" "Codec.Compression.PPM.Trie" "ngram-0.1.0.0-DSiDezXpOxU57eJjCaUpw8" False) (C1 (MetaCons "Trie" PrefixI True) (S1 (MetaSel (Just "value") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 v) :*: S1 (MetaSel (Just "edges") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Map e (Trie e v))))) |