Math.SetCover.Exact.Knead

This re-implements Math.SetCover.Exact.UArray using LLVM.

Documentation

partitionsIO :: Ord a => IO ([Assign label (Set a)] -> T [[label]])

searchIO :: IO (State label -> T [[label]])

stepIO :: IO (State label -> T [State label])

partitions :: Ord a => [Assign label (Set a)] -> [[label]]

data State label

Constructors

State

Fields

availableSubsets :: (Array SetDim label, Array (SetDim, BlockDim) Block)

freeElements :: Array BlockDim Block

usedSubsets :: [label]

initStateIO :: Ord a => [Assign label (Set a)] -> IO (State label)

updateStateIO :: IO (SetId -> State label -> T (State label))

class Logic block => BitSet block where

Methods

nullBlock :: Exp block -> Exp Bool

blocksFromSets :: Ord a => [Set a] -> ([[block]], [block])

keepMinimumBit :: Exp block -> Exp block

Instances

BitSet Word8

BitSet Word16

BitSet Word32

BitSet Word64

BitSet Block

type SetId = Int32

type SetDim = ZeroBased SetId

type BlockId = Int32

type BlockDim = ZeroBased BlockId