set-cover-0.0.9: Solve exact set cover problems like Sudoku, 8 Queens, Soma Cube, Tetris Cube
Math.SetCover.BitSet
newtype Set bits #
Constructors
Defined in Math.SetCover.BitSet
Methods
(==) :: Set bits -> Set bits -> Bool #
(/=) :: Set bits -> Set bits -> Bool #
compare :: Set bits -> Set bits -> Ordering #
(<) :: Set bits -> Set bits -> Bool #
(<=) :: Set bits -> Set bits -> Bool #
(>) :: Set bits -> Set bits -> Bool #
(>=) :: Set bits -> Set bits -> Bool #
max :: Set bits -> Set bits -> Set bits #
min :: Set bits -> Set bits -> Set bits #
showsPrec :: Int -> Set bits -> ShowS #
show :: Set bits -> String #
showList :: [Set bits] -> ShowS #
(<>) :: Set bits -> Set bits -> Set bits #
sconcat :: NonEmpty (Set bits) -> Set bits #
stimes :: Integral b => b -> Set bits -> Set bits #
mempty :: Set bits #
mappend :: Set bits -> Set bits -> Set bits #
mconcat :: [Set bits] -> Set bits #
Defined in Math.SetCover.Exact
null :: Set a -> Bool #
disjoint :: Set a -> Set a -> Bool #
unions :: [Set a] -> Set a #
difference :: Set a -> Set a -> Set a #
minimize :: Set a -> [Assign label (Set a)] -> [Assign label (Set a)] #
empty :: C bits => Set bits #
null :: C bits => Set bits -> Bool #
keepMinimum :: C bits => Set bits -> Set bits #
disjoint :: C bits => Set bits -> Set bits -> Bool #
difference :: C bits => Set bits -> Set bits -> Set bits #