Game.Mastermind.CodeSet.Union

Documentation

newtype T a

Cons [[a,b,c,d], [e,f,g,h]] expresses a x b x c x d union e x f x g x h, where x denotes the set product.

Constructors

Cons [[Set a]]

Instances

C T

Methods

empty :: T a

union :: Ord a => T a -> T a -> T a

intersection :: Ord a => T a -> T a -> T a

unit :: T a

leftNonEmptyProduct :: Set a -> T a -> T a

flatten :: Ord a => T a -> [[a]]

symbols :: Ord a => T a -> Set a

null :: T a -> Bool

size :: T a -> Integer

select :: T a -> Integer -> [a]

representationSize :: T a -> Int

compress :: Ord a => T a -> T a

(Ord a, Show a) => Show (T a)

Methods

showsPrec :: Int -> T a -> ShowS

show :: T a -> String

showList :: [T a] -> ShowS

toLists :: Ord a => T a -> [[[a]]]

fromLists :: Ord a => [[[a]]] -> T a

flatten :: Ord a => T a -> [[a]]

symbols :: Ord a => T a -> Set a

cube :: Int -> Set a -> T a

size :: T a -> Integer

productSizes :: T a -> [Integer]

select :: T a -> Integer -> [a]

representationSize :: T a -> Int

union :: T a -> T a -> T a

We could try to merge set products. I'll first want to see, whether this is needed in a relevant number of cases.

intersection :: Ord a => T a -> T a -> T a

member :: Ord a => [a] -> T a -> Bool

normalize :: T a -> T a

Remove empty set products.

disjointProduct :: Ord a => [Set a] -> [Set a] -> Bool

overlappingPairs :: Ord a => T a -> [([Set a], [Set a])]

for debugging: list all pairs of products, that overlap

overlapping :: Ord a => T a -> [([Set a], [[Set a]])]

for debugging: list all subsets, that are contained in more than one product