Text.Regex.Anagram.Bits

Some extra functionality for Bits instances, specifically an optimized version of findBits on Natural (using countTrailingZeros). Mainly exposed for testing purposes, but may be useful on its own.

Documentation

allBits :: (Enum b, Bits b) => Int -> b

value with all lower n bits set

class Bits b => FindBits b where

Minimal complete definition

Nothing

Methods

findBits :: b -> [Int]

list of all set bits in a value

default findBits :: FiniteBits b => b -> [Int]

Instances

FindBits Int

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Int -> [Int]

FindBits Int8

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Int8 -> [Int]

FindBits Int16

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Int16 -> [Int]

FindBits Int32

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Int32 -> [Int]

FindBits Int64

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Int64 -> [Int]

FindBits Natural

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Natural -> [Int]

FindBits Word

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Word -> [Int]

FindBits Word8

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Word8 -> [Int]

FindBits Word16

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Word16 -> [Int]

FindBits Word32

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Word32 -> [Int]

FindBits Word64

Defined in Text.Regex.Anagram.Bits

Methods

findBits :: Word64 -> [Int]