Game.Mastermind.CodeSet.Tree

Documentation

data T a

Products [(a,b),(c,d)] expresses a x b union c x d, where x denotes the set product.

Constructors

End

Products (Map (Set a) (T 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

Show a => Show (T a)

Methods

showsPrec :: Int -> T a -> ShowS

show :: T a -> String

showList :: [T a] -> ShowS

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

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

size :: T a -> Integer

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

representationSize :: T a -> Int

union :: Ord a => 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

normalizeProducts :: [(Set a, T a)] -> [(Set a, T a)]

Remove empty set products.

newtype Indexable a

This allows (T a) to be a key in a Map. I do not want an Ord (T a) instance, since it makes no sense and it requires an Eq (T a) instance that is either expensive (if it means set equality) or confusing (if it means structural equality).

Constructors

Indexable (T a)

Instances

Eq a => Eq (Indexable a)

Methods

(==) :: Indexable a -> Indexable a -> Bool

(/=) :: Indexable a -> Indexable a -> Bool

Ord a => Ord (Indexable a)

Methods

compare :: Indexable a -> Indexable a -> Ordering

(<) :: Indexable a -> Indexable a -> Bool

(<=) :: Indexable a -> Indexable a -> Bool

(>) :: Indexable a -> Indexable a -> Bool

(>=) :: Indexable a -> Indexable a -> Bool

max :: Indexable a -> Indexable a -> Indexable a

min :: Indexable a -> Indexable a -> Indexable a

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

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

null :: T a -> Bool