Math.SetCover.Exact.UArray

This implements Math.SetCover.Exact using unboxed arrays of bit vectors. It should always be faster than using Integers as bit vectors. In contrast to IntSet the set representation here is dense, but has a much simpler structure. It should be faster than IntSet for most applications.

Documentation

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

search :: State label -> [[label]]

step :: State label -> [State label]

data State label

Constructors

State

Fields

availableSubsets :: (Array SetId label, UArray (SetId, BlockId) Block)

freeElements :: UArray BlockId Block

usedSubsets :: [label]

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

updateState :: SetId -> State label -> State label