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

Safe HaskellSafe
LanguageHaskell98

Math.SetCover.BitPosition

Documentation

class C bits => C bits Source #

Minimal complete definition

bit, bitPositionPlain, unpack

Instances
C Integer Source # 
Instance details

Defined in Math.SetCover.BitPosition

C Word8 Source # 
Instance details

Defined in Math.SetCover.BitPosition

C Word16 Source # 
Instance details

Defined in Math.SetCover.BitPosition

C Word32 Source # 
Instance details

Defined in Math.SetCover.BitPosition

C Word64 Source # 
Instance details

Defined in Math.SetCover.BitPosition

C IntSet Source # 
Instance details

Defined in Math.SetCover.BitPosition

(Sized a, C b) => C (Sum a b) Source # 
Instance details

Defined in Math.SetCover.BitPosition

Methods

bit :: Int -> Sum a b

bitPositionPlain :: Sum a b -> Int

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

class C bits => Sized bits Source #

Minimal complete definition

size

Instances
Sized Word8 Source # 
Instance details

Defined in Math.SetCover.BitPosition

Methods

size :: Size Word8

Sized Word16 Source # 
Instance details

Defined in Math.SetCover.BitPosition

Methods

size :: Size Word16

Sized Word32 Source # 
Instance details

Defined in Math.SetCover.BitPosition

Methods

size :: Size Word32

Sized Word64 Source # 
Instance details

Defined in Math.SetCover.BitPosition

Methods

size :: Size Word64

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

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

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