Companion

object Companion

Functions

Link copied to clipboard
fun binomialCCDF(j: Int, n: Int, p: Double): Double

Allows static computation of complementary cdf function assumes that distribution's range is {0,1, ..., n} Uses the recursive logarithmic algorithm

fun binomialCCDF(j: Int, n: Int, p: Double, recursive: Boolean): Double

Allows static computation of complementary cdf function assumes that distribution's range is {0,1, ...,n}

Link copied to clipboard
fun binomialCDF(j: Int, n: Int, p: Double): Double

Allows static computation of the CDF assumes that distribution's range is {0,1, ...,n} Uses the recursive logarithmic algorithm

fun binomialCDF(j: Int, n: Int, p: Double, recursive: Boolean): Double

Allows static computation of the CDF assumes that distribution's range is {0,1, ..., n}

Link copied to clipboard

Returns the quantile associated with the supplied probability, x assumes that distribution's range is {0,1, ..., n} Uses the recursive logarithmic algorithm

fun binomialInvCDF(x: Double, n: Int, p: Double, recursive: Boolean): Int

Returns the quantile associated with the supplied probability, x assumes that distribution's range is {0,1, ...,n}

Link copied to clipboard

Allows static computation of 1st order loss function assumes that distribution's range is {0,1, ..., n} Uses the recursive logarithmic algorithm

fun binomialLF1(j: Double, n: Int, p: Double, recursive: Boolean): Double

Allows static computation of 1st order loss function assumes that distribution's range is {0,1, ...,n}

Link copied to clipboard

Allows static computation of 2nd order loss function assumes that distribution's range is {0,1, ..., n} Uses the recursive logarithmic algorithm

fun binomialLF2(j: Double, n: Int, p: Double, recursive: Boolean): Double

Allows static computation of 2nd order loss function assumes that distribution's range is {0,1, ...,n}

Link copied to clipboard
fun binomialPMF(j: Int, n: Int, p: Double): Double

Allows static computation of prob mass function assumes that distribution's range is {0,1, ..., n} Uses the recursive logarithmic algorithm

fun binomialPMF(j: Int, n: Int, p: Double, recursive: Boolean): Double

Allows static computation of prob mass function assumes that distribution's range is {0,1, ..., n}

Link copied to clipboard
fun canMatchMoments(vararg moments: Double): Boolean
Link copied to clipboard
Link copied to clipboard

Approximates the quantile of x using a normal distribution

Link copied to clipboard
fun recursiveCDF(j: Int, n: Int, p: Double): Double

Computes the probability mass function at j using a recursive (iterative) algorithm using logarithms

Link copied to clipboard
fun recursivePMF(j: Int, n: Int, p: Double): Double

Computes the probability mass function at j using a recursive (iterative) algorithm using logarithms