Haskus.Format.Binary.Bits.Reverse

Reverse bits

There are several algorithms performing the same thing here (reversing bits into words of different sizes). There are benchmarks for them in the "bench" directory. The fastest one for the current architecture should be selected below. If you find that another algorithm is faster on your architecture, please report it.

Generic

class ReversableBits w where

Data whose bits can be reversed

Methods

reverseBits :: w -> w

Instances

ReversableBits Int

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Int -> Int

ReversableBits Int8

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Int8 -> Int8

ReversableBits Int16

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Int16 -> Int16

ReversableBits Int32

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Int32 -> Int32

ReversableBits Int64

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Int64 -> Int64

ReversableBits Word

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Word -> Word

ReversableBits Word8

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Word8 -> Word8

ReversableBits Word16

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Word16 -> Word16

ReversableBits Word32

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Word32 -> Word32

ReversableBits Word64

Defined in Haskus.Format.Binary.Bits.Reverse

Methods

reverseBits :: Word64 -> Word64

ReversableBits a => ReversableBits (AsLittleEndian a)

Defined in Haskus.Format.Binary.Endianness

Methods

reverseBits :: AsLittleEndian a -> AsLittleEndian a

ReversableBits a => ReversableBits (AsBigEndian a)

Defined in Haskus.Format.Binary.Endianness

Methods

reverseBits :: AsBigEndian a -> AsBigEndian a

reverseBitsGeneric :: (FiniteBits a, Integral a, ShiftableBits a, Bitwise a, KnownNat (BitSize a)) => a -> a

Reverse bits in a Word

Algorithms

reverseBitsObvious :: forall a. (FiniteBits a, ShiftableBits a, IndexableBits a, Bitwise a, KnownNat (BitSize a), Eq a) => a -> a

Obvious recursive version

reverseBits3Ops :: Word8 -> Word8

Reverse bits in a Word8 (3 64-bit operations, modulus division)

reverseBits4Ops :: Word8 -> Word8

Reverse bits in a Word8 (4 64-bit operations, no division)

reverseBitsTable :: Word8 -> Word8

Reverse bits using a lookup table

reverseBits7Ops :: Word8 -> Word8

Reverse bits in a Word8 (7 no 64-bit operations, no division)

reverseBits5LgN :: forall a. (FiniteBits a, ShiftableBits a, Bitwise a, KnownNat (BitSize a)) => a -> a

Parallel recursive version

liftReverseBits :: (ShiftableBits a, Bitwise a, FiniteBits a, Integral a, KnownNat (BitSize a)) => (Word8 -> Word8) -> a -> a

Convert a function working on Word8 to one working on any Word

The number of bits in the Word must be a multiple of 8