Safe Haskell	Safe-Inferred
Language	Haskell98

Combinatorics.CardPairs

Contents

general
examples
tests

Description

Compute how often it happens that a Queen and a King are adjacent in a randomly ordered card set.

Synopsis

data Card
- = Other
- | Queen
- | King
data CardCount i = CardCount {
- otherCount, queenCount, kingCount :: i
}
charFromCard :: Card -> Char
allPossibilities :: CardSet a -> [[a]]
numberOfAllPossibilities :: CardCount Int -> Integer
possibilitiesCardsNaive :: CardCount Int -> Integer
possibilitiesCardsDynamic :: CardCount Int -> Array (CardCount Int) Integer
possibilitiesCardsBorderNaive :: CardCount Int -> CardCount Integer
possibilitiesCardsBorderDynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer)
possibilitiesCardsBorder2Dynamic :: CardCount Int -> Array (CardCount Int) (CardCount Integer)
cardSetSizeSkat :: CardCount Int
numberOfPossibilitiesSkat :: Integer
probabilitySkat :: Double
cardSetSizeRummy :: CardCount Int
numberOfPossibilitiesRummy :: Integer
probabilityRummy :: Double
cardSetSizeRummyJK :: CardCount Int
numberOfPossibilitiesRummyJK :: Integer
probabilityRummyJK :: Double
exampleOutput :: IO ()
adjacentCouplesSmall :: [[Card]]
allPossibilitiesSmall :: [[Card]]
allPossibilitiesMedium :: [[Card]]
allPossibilitiesSkat :: [[Card]]

general

data Card Source #

Constructors

Other
Queen
King

Instances

Instances details

Enum Card Source #
Instance details Defined in Combinatorics.CardPairs 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] #
Show Card Source #
Instance details Defined in Combinatorics.CardPairs Methods showsPrec :: Int -> Card -> ShowS # show :: Card -> String # showList :: [Card] -> ShowS #
Eq Card Source #
Instance details Defined in Combinatorics.CardPairs Methods (==) :: Card -> Card -> Bool # (/=) :: Card -> Card -> Bool #
Ord Card Source #
Instance details Defined in Combinatorics.CardPairs 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 #

data CardCount i Source #

Constructors

CardCount
Fields otherCount, queenCount, kingCount :: i

Instances

Instances details

Ix i => Ix (CardCount i) Source #
Instance details Defined in Combinatorics.CardPairs 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 #
Show i => Show (CardCount i) Source #
Instance details Defined in Combinatorics.CardPairs Methods showsPrec :: Int -> CardCount i -> ShowS # show :: CardCount i -> String # showList :: [CardCount i] -> ShowS #
Eq i => Eq (CardCount i) Source #
Instance details Defined in Combinatorics.CardPairs Methods (==) :: CardCount i -> CardCount i -> Bool # (/=) :: CardCount i -> CardCount i -> Bool #
Ord i => Ord (CardCount i) Source #
Instance details Defined in Combinatorics.CardPairs 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 #

charFromCard :: Card -> Char Source #

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

numberOfAllPossibilities :: CardCount Int -> Integer Source #

possibilitiesCardsNaive :: CardCount Int -> Integer Source #

possibilitiesCardsDynamic :: CardCount Int -> Array (CardCount Int) Integer 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)

allEqual [CardPairs.possibilitiesCardsBorderNaive (CardCount 2 3 5), CardPairs.possibilitiesCardsBorderDynamic (CardCount 5 5 5) ! (CardCount 2 3 5), CardPairs.possibilitiesCardsBorder2Dynamic (CardCount 5 5 5) ! (CardCount 2 3 5)]

QC.forAll genCardCount $ \cc -> allEqual [CardPairs.possibilitiesCardsBorderNaive cc, CardPairs.possibilitiesCardsBorderDynamic cc ! cc, CardPairs.possibilitiesCardsBorder2Dynamic cc ! cc]

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

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