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

Safe HaskellSafe
LanguageHaskell98

Math.SetCover.BitSet

Documentation

newtype Set bits Source #

Constructors

Set bits 

Instances

Eq bits => Eq (Set bits) Source # 

Methods

(==) :: Set bits -> Set bits -> Bool #

(/=) :: Set bits -> Set bits -> Bool #

Ord bits => Ord (Set bits) Source # 

Methods

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 #

Show bits => Show (Set bits) Source # 

Methods

showsPrec :: Int -> Set bits -> ShowS #

show :: Set bits -> String #

showList :: [Set bits] -> ShowS #

C bits => Monoid (Set bits) Source # 

Methods

mempty :: Set bits #

mappend :: Set bits -> Set bits -> Set bits #

mconcat :: [Set bits] -> Set bits #

C a => Set (Set a) Source # 

Methods

null :: Set a -> Bool Source #

disjoint :: Set a -> Set a -> Bool Source #

unions :: [Set a] -> Set a Source #

difference :: Set a -> Set a -> Set a Source #

minimize :: Set a -> [Assign label (Set a)] -> [Assign label (Set a)] Source #

empty :: C bits => Set bits Source #

null :: C bits => Set bits -> Bool Source #

keepMinimum :: C bits => Set bits -> Set bits Source #

disjoint :: C bits => Set bits -> Set bits -> Bool Source #

difference :: C bits => Set bits -> Set bits -> Set bits Source #