Combinatorics
Same convention as integer number theory: integer-leaf expressions in, integer-leaf expressions out; non-integer input raises, as do arguments outside each function's domain (negative counts, …).
falling_factorial#
Explicit context
func fallingFactorial(
value: UniffiExpression,
order: UniffiExpression,
) -> UniffiExpression; length must be a non-negative integer,
base may be any integer.
rising_factorial#
Explicit context
func risingFactorial(
value: UniffiExpression,
order: UniffiExpression,
) -> UniffiExpression(the Pochhammer symbol on integers).
stirling_first_signed#
Explicit context
func stirlingFirstSigned(
upper: UniffiExpression,
lower: UniffiExpression,
) -> UniffiExpressionSigned Stirling number of the first kind s(n, k).
stirling_second#
Explicit context
func stirlingSecond(
upper: UniffiExpression,
lower: UniffiExpression,
) -> UniffiExpressionStirling number of the second kind S(n, k).
bell_number#
Explicit context
func bellNumber(argument: UniffiExpression) -> UniffiExpressionThe n-th Bell number.
catalan_number#
Explicit context
func catalanNumber(argument: UniffiExpression) -> UniffiExpressionThe n-th Catalan number.
fibonacci_number#
Explicit context
func fibonacciNumber(argument: UniffiExpression) -> UniffiExpressionThe n-th Fibonacci number (F(0) = 0, F(1) = 1).
partition_count#
Explicit context
func partitionCount(argument: UniffiExpression) -> UniffiExpressionNumber of integer partitions p(n).
multinomial#
Explicit context
func multinomial(parts: [UniffiExpression]) -> UniffiExpressionMultinomial coefficient ; parts must be non-negative integers.