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

Safe HaskellSafe
LanguageHaskell98

Math.SetCover.BitMap

Documentation

newtype Map bits Source #

Constructors

Map 

Fields

Instances

Show bits => Show (Map bits) Source # 

Methods

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

show :: Map bits -> String #

showList :: [Map bits] -> ShowS #

C bits => Semigroup (Map bits) Source # 

Methods

(<>) :: Map bits -> Map bits -> Map bits #

sconcat :: NonEmpty (Map bits) -> Map bits #

stimes :: Integral b => b -> Map bits -> Map bits #

C bits => Monoid (Map bits) Source # 

Methods

mempty :: Map bits #

mappend :: Map bits -> Map bits -> Map bits #

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

fromSet :: C bits => Set bits -> Map bits Source #

add :: C bits => Map bits -> Map bits -> Map bits Source #

inc :: C bits => Set bits -> Map bits -> Map bits Source #

sub :: C bits => Map bits -> Map bits -> Map bits Source #

dec :: C bits => Set bits -> Map bits -> Map bits Source #

intersectionSet :: C bits => Map bits -> Set bits -> Map bits Source #

differenceSet :: C bits => Map bits -> Set bits -> Map bits Source #

minimumSet :: C bits => Set bits -> Map bits -> Set bits Source #