Game.Mastermind.CodeSet

Documentation

class C set where

Minimal complete definition

empty, union, intersection, unit, leftNonEmptyProduct, flatten, symbols, null, size, select, representationSize, compress

Methods

empty :: set a

union, intersection :: Ord a => set a -> set a -> set a

unit :: set a

leftNonEmptyProduct :: Set a -> set a -> set a

the left operand must be non-empty

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

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

null :: set a -> Bool

size :: set a -> Integer

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

representationSize :: set a -> Int

compress :: Ord a => set a -> set a

simplify set representation by combining set products where possible

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

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

cube :: C set => Set a -> Int -> set a

unions :: (C set, Ord a) => [set a] -> set a

insertSortedBy :: (a -> a -> Ordering) -> a -> [a] -> [a]

intersections :: (C set, Ord a) => [set a] -> set a

intersectionsSort :: (C set, Ord a) => [set a] -> set a

(*&) :: C set => Set a -> set a -> set a

Like leftNonEmptyProduct but the left operand can be empty.

(#*&) :: C set => a -> set a -> set a