set-cover-0.0.9: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube

Safe Haskell	Safe
Language	Haskell98

Math.SetCover.BitPosition

Documentation

class C bits => C bits #

Minimal complete definition

bit, bitPositionPlain, unpack

Instances

C Integer #
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Integer bitPositionPlain :: Integer -> Int unpack :: Set Integer -> [Int] #
C Word8 #
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Word8 bitPositionPlain :: Word8 -> Int unpack :: Set Word8 -> [Int] #
C Word16 #
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Word16 bitPositionPlain :: Word16 -> Int unpack :: Set Word16 -> [Int] #
C Word32 #
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Word32 bitPositionPlain :: Word32 -> Int unpack :: Set Word32 -> [Int] #
C Word64 #
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Word64 bitPositionPlain :: Word64 -> Int unpack :: Set Word64 -> [Int] #
(Integral a, C a, C b) => C (Sum a b) #	Instantiating `a` with `Integer` will end badly because it has no fixed size!
Instance details Defined in Math.SetCover.BitPosition Methods bit :: Int -> Sum a b bitPositionPlain :: Sum a b -> Int unpack :: Set (Sum a b) -> [Int] #

unpack :: C bits => Set bits -> [Int] #

singleton :: C bits => Int -> Set bits #

bitPosition :: C bits => Set bits -> Int #