| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Game.Mastermind.CodeSet
Synopsis
Documentation
Minimal complete definition
empty, union, intersection, unit, leftNonEmptyProduct, flatten, symbols, null, size, select, representationSize, compress
Methods
union :: Ord a => set a -> set a -> set a Source #
intersection :: Ord a => set a -> set a -> set a Source #
leftNonEmptyProduct :: T a -> set a -> set a Source #
flatten :: Ord a => set a -> [[a]] Source #
symbols :: Ord a => set a -> Set a Source #
null :: set a -> Bool Source #
size :: set a -> Integer Source #
select :: set a -> Integer -> [a] Source #
representationSize :: set a -> Int Source #
compress :: Ord a => set a -> set a Source #
simplify set representation by combining set products where possible
Instances
| C T Source # | |
Defined in Game.Mastermind.CodeSet.Union Methods union :: Ord a => T a -> T a -> T a Source # intersection :: Ord a => T a -> T a -> T a Source # leftNonEmptyProduct :: T0 a -> T a -> T a Source # flatten :: Ord a => T a -> [[a]] Source # symbols :: Ord a => T a -> Set a Source # size :: T a -> Integer Source # select :: T a -> Integer -> [a] Source # representationSize :: T a -> Int Source # | |
| C T Source # | |
Defined in Game.Mastermind.CodeSet.Tree Methods union :: Ord a => T a -> T a -> T a Source # intersection :: Ord a => T a -> T a -> T a Source # leftNonEmptyProduct :: T0 a -> T a -> T a Source # flatten :: Ord a => T a -> [[a]] Source # symbols :: Ord a => T a -> Set a Source # size :: T a -> Integer Source # select :: T a -> Integer -> [a] Source # representationSize :: T a -> Int Source # | |