@Override
public double evaluate(double x, double m, double n, boolean giveLog) {
double p;
double q;
double f;
double dens;
if (Double.isNaN(x) || Double.isNaN(m) || Double.isNaN(n)) {
return x + m + n;
}
if (m <= 0 || n <= 0) {
return RMath.mlError();
}
if (x < 0.) {
return DPQ.rd0(giveLog);
}
if (x == 0.) {
return m > 2 ? DPQ.rd0(giveLog) : (m == 2 ? DPQ.rd1(giveLog) : Double.POSITIVE_INFINITY);
}
if (!Double.isFinite(m) && !Double.isFinite(n)) {
/* both +Inf */
if (x == 1.) {
return Double.POSITIVE_INFINITY;
} else {
return DPQ.rd0(giveLog);
}
}
if (!Double.isFinite(n)) {
/* must be +Inf by now */
return dgamma(x, m / 2, 2. / m, giveLog);
}
if (m > 1e14) {
/* includes +Inf: code below is inaccurate there */
dens = dgamma(1. / x, n / 2, 2. / n, giveLog);
return giveLog ? dens - 2 * Math.log(x) : dens / (x * x);
}
f = 1. / (n + x * m);
q = n * f;
p = x * m * f;
if (m >= 2) {
f = m * q / 2;
dens = dbinomRaw((m - 2) / 2, (m + n - 2) / 2, p, q, giveLog);
} else {
f = m * m * q / (2 * p * (m + n));
dens = dbinomRaw(m / 2, (m + n) / 2, p, q, giveLog);
}
return (giveLog ? Math.log(f) + dens : f * dens);
}
@Override
public double evaluate(double x, double lambda, boolean giveLog) {
if (Double.isNaN(x) || Double.isNaN(lambda)) {
return x + lambda;
}
if (lambda < 0) {
return RMath.mlError();
}
try {
DPQ.nonintCheck(x, giveLog);
} catch (EarlyReturn e) {
return e.result;
}
if (x < 0 || !Double.isFinite(x)) {
return DPQ.rd0(giveLog);
}
return dpoisRaw(forceint(x), lambda, giveLog);
}
