Safe Haskell | None |
---|
This implements Math.SetCover.Exact using unboxed arrays of bit vectors.
It should always be faster than using Integer
s 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]]Source
State | |
|
updateState :: SetId -> State label -> State labelSource