Data.Bits.Coded

Documentation

class Coded c where

Unaligned codes

Minimal complete definition

encode, decode

Methods

encode :: MonadPut m => c -> Coding m ()

encodeMany :: (MonadPut m, Foldable t) => t c -> Coding m ()

decode :: MonadGet m => Coding m c

Instances

Integral n => Coded (Unary n)

Methods

encode :: MonadPut m => Unary n -> Coding m ()

encodeMany :: (MonadPut m, Foldable t) => t (Unary n) -> Coding m ()

decode :: MonadGet m => Coding m (Unary n)

(Coded c, Integral c, Ranked n) => Coded (Elias c n)

Methods

encode :: MonadPut m => Elias c n -> Coding m ()

encodeMany :: (MonadPut m, Foldable t) => t (Elias c n) -> Coding m ()

decode :: MonadGet m => Coding m (Elias c n)

newtype Unary n

Unary-coded integers

>>> runPutL . runEncode $ encode (Unary 1) >> flush
"\128"
>>> runPutL . runEncode $ encode (Unary 7) >> flush
"\254"

Constructors

Unary

Fields

• unUnary :: n

Instances

Enum n => Enum (Unary n)

Methods

succ :: Unary n -> Unary n

pred :: Unary n -> Unary n

toEnum :: Int -> Unary n

fromEnum :: Unary n -> Int

enumFrom :: Unary n -> [Unary n]

enumFromThen :: Unary n -> Unary n -> [Unary n]

enumFromTo :: Unary n -> Unary n -> [Unary n]

enumFromThenTo :: Unary n -> Unary n -> Unary n -> [Unary n]

Eq n => Eq (Unary n)

Methods

(==) :: Unary n -> Unary n -> Bool

(/=) :: Unary n -> Unary n -> Bool

Integral n => Integral (Unary n)

Methods

quot :: Unary n -> Unary n -> Unary n

rem :: Unary n -> Unary n -> Unary n

div :: Unary n -> Unary n -> Unary n

mod :: Unary n -> Unary n -> Unary n

quotRem :: Unary n -> Unary n -> (Unary n, Unary n)

divMod :: Unary n -> Unary n -> (Unary n, Unary n)

toInteger :: Unary n -> Integer

Num n => Num (Unary n)

Methods

(+) :: Unary n -> Unary n -> Unary n

(-) :: Unary n -> Unary n -> Unary n

(*) :: Unary n -> Unary n -> Unary n

negate :: Unary n -> Unary n

abs :: Unary n -> Unary n

signum :: Unary n -> Unary n

fromInteger :: Integer -> Unary n

Ord n => Ord (Unary n)

Methods

compare :: Unary n -> Unary n -> Ordering

(<) :: Unary n -> Unary n -> Bool

(<=) :: Unary n -> Unary n -> Bool

(>) :: Unary n -> Unary n -> Bool

(>=) :: Unary n -> Unary n -> Bool

max :: Unary n -> Unary n -> Unary n

min :: Unary n -> Unary n -> Unary n

Read n => Read (Unary n)

Methods

readsPrec :: Int -> ReadS (Unary n)

readList :: ReadS [Unary n]

readPrec :: ReadPrec (Unary n)

readListPrec :: ReadPrec [Unary n]

Real n => Real (Unary n)

Methods

toRational :: Unary n -> Rational

Show n => Show (Unary n)

Methods

showsPrec :: Int -> Unary n -> ShowS

show :: Unary n -> String

showList :: [Unary n] -> ShowS

Integral n => Coded (Unary n)

Methods

encode :: MonadPut m => Unary n -> Coding m ()

encodeMany :: (MonadPut m, Foldable t) => t (Unary n) -> Coding m ()

decode :: MonadGet m => Coding m (Unary n)

newtype Elias c n

Representation for Elias Gamma and Delta codes. A positive integer n is encoded by encoding the position of its most significant bit, and then the binary representation of the rest of the number.

Constructors

Elias

Fields

• unElias :: n

Instances

Enum n => Enum (Elias c n)

Methods

succ :: Elias c n -> Elias c n

pred :: Elias c n -> Elias c n

toEnum :: Int -> Elias c n

fromEnum :: Elias c n -> Int

enumFrom :: Elias c n -> [Elias c n]

enumFromThen :: Elias c n -> Elias c n -> [Elias c n]

enumFromTo :: Elias c n -> Elias c n -> [Elias c n]

enumFromThenTo :: Elias c n -> Elias c n -> Elias c n -> [Elias c n]

Eq n => Eq (Elias c n)

Methods

(==) :: Elias c n -> Elias c n -> Bool

(/=) :: Elias c n -> Elias c n -> Bool

Integral n => Integral (Elias c n)

Methods

quot :: Elias c n -> Elias c n -> Elias c n

rem :: Elias c n -> Elias c n -> Elias c n

div :: Elias c n -> Elias c n -> Elias c n

mod :: Elias c n -> Elias c n -> Elias c n

quotRem :: Elias c n -> Elias c n -> (Elias c n, Elias c n)

divMod :: Elias c n -> Elias c n -> (Elias c n, Elias c n)

toInteger :: Elias c n -> Integer

Num n => Num (Elias c n)

Methods

(+) :: Elias c n -> Elias c n -> Elias c n

(-) :: Elias c n -> Elias c n -> Elias c n

(*) :: Elias c n -> Elias c n -> Elias c n

negate :: Elias c n -> Elias c n

abs :: Elias c n -> Elias c n

signum :: Elias c n -> Elias c n

fromInteger :: Integer -> Elias c n

Ord n => Ord (Elias c n)

Methods

compare :: Elias c n -> Elias c n -> Ordering

(<) :: Elias c n -> Elias c n -> Bool

(<=) :: Elias c n -> Elias c n -> Bool

(>) :: Elias c n -> Elias c n -> Bool

(>=) :: Elias c n -> Elias c n -> Bool

max :: Elias c n -> Elias c n -> Elias c n

min :: Elias c n -> Elias c n -> Elias c n

Read n => Read (Elias c n)

Methods

readsPrec :: Int -> ReadS (Elias c n)

readList :: ReadS [Elias c n]

readPrec :: ReadPrec (Elias c n)

readListPrec :: ReadPrec [Elias c n]

Real n => Real (Elias c n)

Methods

toRational :: Elias c n -> Rational

Show n => Show (Elias c n)

Methods

showsPrec :: Int -> Elias c n -> ShowS

show :: Elias c n -> String

showList :: [Elias c n] -> ShowS

(Coded c, Integral c, Ranked n) => Coded (Elias c n)

Methods

encode :: MonadPut m => Elias c n -> Coding m ()

encodeMany :: (MonadPut m, Foldable t) => t (Elias c n) -> Coding m ()

decode :: MonadGet m => Coding m (Elias c n)

type Gamma c = Elias (Unary c)

Elias Gamma codes the position of the most significant in Unary.

type Delta c n = Elias (Gamma c n) n

Elias Delta codes the position of the most significant bit in Elias Gamma.

runEncode :: MonadPut m => Coding m () -> m ()

runDecode :: MonadGet m => Coding m a -> m a