Safe Haskell	Safe
Language	Haskell98

Combinatorics.CardPairs

Synopsis

Documentation

type CardSet a = [(a, Int)] Source #

data Card Source #

Constructors

Other
Queen
King

Instances

Enum Card Source #
Methods succ :: Card -> Card # pred :: Card -> Card # toEnum :: Int -> Card # fromEnum :: Card -> Int # enumFrom :: Card -> [Card] # enumFromThen :: Card -> Card -> [Card] # enumFromTo :: Card -> Card -> [Card] # enumFromThenTo :: Card -> Card -> Card -> [Card] #
Eq Card Source #
Methods (==) :: Card -> Card -> Bool # (/=) :: Card -> Card -> Bool #
Ord Card Source #
Methods compare :: Card -> Card -> Ordering # (<) :: Card -> Card -> Bool # (<=) :: Card -> Card -> Bool # (>) :: Card -> Card -> Bool # (>=) :: Card -> Card -> Bool # max :: Card -> Card -> Card # min :: Card -> Card -> Card #
Show Card Source #
Methods showsPrec :: Int -> Card -> ShowS # show :: Card -> String # showList :: [Card] -> ShowS #

charFromCard :: Card -> Char Source #

removeEach :: StateT (CardSet a) [] a Source #

normalizeSet :: CardSet a -> CardSet a Source #

allPossibilities :: CardSet a -> [[a]] Source #

allPossibilitiesSmall :: [[Card]] Source #

allPossibilitiesMedium :: [[Card]] Source #

allPossibilitiesSkat :: [[Card]] Source #

adjacentCouple :: [Card] -> Bool Source #

adjacentCouplesSmall :: [[Card]] Source #

exampleOutput :: IO () Source #

sample :: (a -> b) -> [a] -> [(a, b)] Source #

Candidate for utility-ht:

data CardCount i Source #

Constructors

CardCount
Fields otherCount, queenCount, kingCount :: i

Instances

Eq i => Eq (CardCount i) Source #
Methods (==) :: CardCount i -> CardCount i -> Bool # (/=) :: CardCount i -> CardCount i -> Bool #
Ord i => Ord (CardCount i) Source #
Methods compare :: CardCount i -> CardCount i -> Ordering # (<) :: CardCount i -> CardCount i -> Bool # (<=) :: CardCount i -> CardCount i -> Bool # (>) :: CardCount i -> CardCount i -> Bool # (>=) :: CardCount i -> CardCount i -> Bool # max :: CardCount i -> CardCount i -> CardCount i # min :: CardCount i -> CardCount i -> CardCount i #
Show i => Show (CardCount i) Source #
Methods showsPrec :: Int -> CardCount i -> ShowS # show :: CardCount i -> String # showList :: [CardCount i] -> ShowS #
Ix i => Ix (CardCount i) Source #
Methods range :: (CardCount i, CardCount i) -> [CardCount i] # index :: (CardCount i, CardCount i) -> CardCount i -> Int # unsafeIndex :: (CardCount i, CardCount i) -> CardCount i -> Int inRange :: (CardCount i, CardCount i) -> CardCount i -> Bool # rangeSize :: (CardCount i, CardCount i) -> Int # unsafeRangeSize :: (CardCount i, CardCount i) -> Int

possibilitiesCardsNaive :: CardCount Int -> Integer Source #

possibilitiesCardsDynamic :: CardCount Int -> Array (CardCount Int) Integer Source #

sumCard :: Num i => CardCount i -> i Source #

possibilitiesCardsBorderNaive :: CardCount Int -> CardCount Integer Source #

Count the number of card set orderings with adjacent queen and king. We return a triple where the elements count with respect to an additional condition: (card set starts with an ordinary card ' ', start with queen q, start with king k)

possibilitiesCardsBorderDynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer) Source #

possibilitiesCardsBorder2Dynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer) Source #

testCardsBorderDynamic :: (CardCount Integer, CardCount Integer, CardCount Integer) Source #

numberOfAllPossibilities :: CardCount Int -> Integer Source #

cardSetSizeSkat :: CardCount Int Source #

numberOfPossibilitiesSkat :: Integer Source #

probabilitySkat :: Double Source #

cardSetSizeRummy :: CardCount Int Source #

numberOfPossibilitiesRummy :: Integer Source #

probabilityRummy :: Double Source #

cardSetSizeRummyJK :: CardCount Int Source #

Allow both Jack and King adjacent to Queen.

numberOfPossibilitiesRummyJK :: Integer Source #

probabilityRummyJK :: Double Source #