Majority.Rank

Documentation

type JS = Integer

Number of judges.

type GS = Integer

Number of grades.

type G = Integer

Rank of grade.

rankOfMajorityValue :: GS -> MajorityValue (Ranked grade) -> Integer

'rankOfMajorityValue gs mv' returns the number of MajorityValue lower than given mv.

positionOfMajorityValue :: GS -> MajorityValue (Ranked grade) -> Rational

countMiddleFrom :: JS -> GS -> (G, G) -> (G, G) -> Integer

countMiddle :: JS -> GS -> (G, G) -> Integer

'countMiddle js gs (l,h)' returns the number of MajorityValues of length js and using grades gs, which have '(l,h)' as lower and upper majority grade. This is done by multiplying together the countMerits to the left of l and the countMerits to the right of h

probaMajorityGrades :: JS -> GS -> [Rational]

(probaMajorityGrades js gs' compute the probability of each grade to be a MajorityGrade given js judges and gs grades.

countMerits :: JS -> GS -> Integer

'countMerits js gs' returns the number of Merits of size js possible using grades gs. That is the number of ways to divide a segment of length js into at most gs segments whose size is between '0' and js.

lastRank :: JS -> GS -> Integer

nCk :: Integral i => i -> i -> i infix 7

nCk n k returns the number of combinations of size k from a set of size n.

Computed using the formula: nCk n (k+1) == nCk n (k-1) * (n-k+1) / k