Data.Bits.Extras

Calculate a number of fiddly bit operations using fast de Bruijn multiplication tables.

Documentation

class (Num t, Bits t) => Ranked t where

Methods

lsb :: t -> Int

Calculate the least significant set bit using a debruijn multiplication table. NB: The result of this function is undefined when given 0.

rank :: t -> Int

Calculate the number of trailing 0 bits.

nlz :: t -> Int

Calculate the number of leading zeros.

Instances

Ranked Int8

Ranked Int16

Ranked Int32

Ranked Int64

Ranked Word8

Ranked Word16

Ranked Word32

Ranked Word64

log2 :: Word32 -> Int

w8 :: Integral a => a -> Word8

w16 :: Integral a => a -> Word16

w32 :: Integral a => a -> Word32

w64 :: Integral a => a -> Word64