Math.SetCover.Bit

Documentation

class Ord bits => C bits where

This class is similar to the Bits class from the base package but adds keepMinimum and misses the rotation stuff.

Minimal complete definition

empty, complement, keepMinimum, xor, (.&.), (.|.)

Methods

empty :: bits

complement, keepMinimum :: bits -> bits

xor, (.&.), (.|.) :: bits -> bits -> bits infixl 7 .&.infixl 5 .|.

Instances

C Integer

Methods

empty :: Integer

complement :: Integer -> Integer

keepMinimum :: Integer -> Integer

xor :: Integer -> Integer -> Integer

(.&.) :: Integer -> Integer -> Integer

(.|.) :: Integer -> Integer -> Integer

C Word8

Methods

empty :: Word8

complement :: Word8 -> Word8

keepMinimum :: Word8 -> Word8

xor :: Word8 -> Word8 -> Word8

(.&.) :: Word8 -> Word8 -> Word8

(.|.) :: Word8 -> Word8 -> Word8

C Word16

Methods

empty :: Word16

complement :: Word16 -> Word16

keepMinimum :: Word16 -> Word16

xor :: Word16 -> Word16 -> Word16

(.&.) :: Word16 -> Word16 -> Word16

(.|.) :: Word16 -> Word16 -> Word16

C Word32

Methods

empty :: Word32

complement :: Word32 -> Word32

keepMinimum :: Word32 -> Word32

xor :: Word32 -> Word32 -> Word32

(.&.) :: Word32 -> Word32 -> Word32

(.|.) :: Word32 -> Word32 -> Word32

C Word64

Methods

empty :: Word64

complement :: Word64 -> Word64

keepMinimum :: Word64 -> Word64

xor :: Word64 -> Word64 -> Word64

(.&.) :: Word64 -> Word64 -> Word64

(.|.) :: Word64 -> Word64 -> Word64

(C a, C b) => C (Sum a b)

Methods

empty :: Sum a b

complement :: Sum a b -> Sum a b

keepMinimum :: Sum a b -> Sum a b

xor :: Sum a b -> Sum a b -> Sum a b

(.&.) :: Sum a b -> Sum a b -> Sum a b

(.|.) :: Sum a b -> Sum a b -> Sum a b

difference :: C bits => bits -> bits -> bits

data Sum a b

Constructors

Sum !a !b

Instances

(Eq a, Eq b) => Eq (Sum a b)

Methods

(==) :: Sum a b -> Sum a b -> Bool

(/=) :: Sum a b -> Sum a b -> Bool

(Ord a, Ord b) => Ord (Sum a b)

Methods

compare :: Sum a b -> Sum a b -> Ordering

(<) :: Sum a b -> Sum a b -> Bool

(<=) :: Sum a b -> Sum a b -> Bool

(>) :: Sum a b -> Sum a b -> Bool

(>=) :: Sum a b -> Sum a b -> Bool

max :: Sum a b -> Sum a b -> Sum a b

min :: Sum a b -> Sum a b -> Sum a b

(Show a, Show b) => Show (Sum a b)

Methods

showsPrec :: Int -> Sum a b -> ShowS

show :: Sum a b -> String

showList :: [Sum a b] -> ShowS

(C a, C b) => C (Sum a b)

Methods

empty :: Sum a b

complement :: Sum a b -> Sum a b

keepMinimum :: Sum a b -> Sum a b

xor :: Sum a b -> Sum a b -> Sum a b

(.&.) :: Sum a b -> Sum a b -> Sum a b

(.|.) :: Sum a b -> Sum a b -> Sum a b

(Integral a, C a, C b) => C (Sum a b)

Instantiating a with Integer will end badly because it has no fixed size!

Methods

bit :: Int -> Sum a b

bitPositionPlain :: Sum a b -> Int

unpack :: Set (Sum a b) -> [Int]

bitLeft :: (Bits a, C b) => Int -> Sum a b

bitRight :: (C a, Bits b) => Int -> Sum a b