Data.Compressed.RunLengthEncoding

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. Run length encoding can do so for long runs of identical inputs.

Documentation

newtype RLE a

A Generator which supports efficient mapReduce operations over run-length encoded data.

Constructors

RLE

Fields

getRLE :: FingerTree Count (Run a)

Instances

Monad RLE

Functor RLE

Applicative RLE

Foldable RLE

Zip RLE

Lookup RLE

Adjustable RLE

Pointed RLE

Apply RLE

Bind RLE

Eq a => Reducer a (RLE a)

Eq a => Eq (RLE a)

Eq a => Monoid (RLE a)

Hashable a => Hashable (RLE a)

Eq a => Semigroup (RLE a)

Generator (RLE a)

data Run a

A single run with a strict length

Instances

Monad Run

Functor Run

Applicative Run

Foldable Run

Comonad Run

Extend Run

Pointed Run

Apply Run

Foldable1 Run

Bind Run

Measured Count (Run a)

Eq a => Eq (Run a)

Ord a => Ord (Run a)

Show a => Show (Run a)

runLength :: Run a -> Int

decode :: RLE a -> [a]

encode :: (Generator c, Eq (Elem c)) => c -> RLE (Elem c)

recode :: Eq a => RLE a -> RLE a

toRuns :: RLE a -> [Run a]

fromRuns :: [Run a] -> RLE a