Portability	non-portable (type families)
Stability	experimental
Maintainer	ekmett@gmail.com
Safe Haskell	Safe-Inferred

Data.Compressed.LZ78

Contents

Description

Compression algorithms are all about exploiting redundancy. When applying an expensive Reducer to a redundant source, it may be better to extract the structural redundancy that is present. LZ78 is a compression algorithm that does so, without requiring the dictionary to be populated with all of the possible values of a data type unlike its later refinement LZW, and which has fewer comparison reqirements during encoding than its earlier counterpart LZ77.

Synopsis

Lempel-Ziv 78

data LZ78 a Source

An LZ78 compressed Generator.

Instances

Monad LZ78
Functor LZ78
Applicative LZ78
Foldable LZ78
Zip LZ78
Indexable LZ78
Lookup LZ78
Adjustable LZ78
FoldableWithKey LZ78
Pointed LZ78
Eq a => Eq (LZ78 a)
Ord a => Ord (LZ78 a)
(Read a, Hashable a, Eq a) => Read (LZ78 a)
Show a => Show (LZ78 a)
Generator (LZ78 a)

Encoding

encode :: (Hashable a, Eq a) => [a] -> LZ78 aSource

O(n) Construct an LZ78-compressed Generator using a HashMap internally.

encodeOrd :: Ord a => [a] -> LZ78 aSource

O(n log n) Contruct an LZ78-compressed Generator using a Map internally.

encodeEq :: Eq a => [a] -> LZ78 aSource

O(n^2) Contruct an LZ78-compressed Generator using a list internally, requires an instance of Eq, less efficient than encode.

Decoding (reduce)

decode :: LZ78 a -> [a]Source

A type-constrained reduce operation

Recoding

recode :: (Eq a, Hashable a) => LZ78 a -> LZ78 aSource

O(n). Recompress with Hashable

recodeOrd :: Ord a => LZ78 a -> LZ78 aSource

O(n log n). Recompress with Ord

recodeEq :: Eq a => LZ78 a -> LZ78 aSource

O(n^2). Recompress with Eq