return (1.0 - a) * n0 + (a * n1);
if (x == xa) { return ya; if (x == xb) { return yb; return (yb - ya) * (x - xa) / (xb - xa) + ya;
return (currentPoint - firstPoint) / (double) (lastPoint - firstPoint) * (numValues - 1);
return (1 - t) * v0 + t * v1;
return (v2 - v1) * amount + v1;
int n = x.length; double[] intered = new double[n]; for (int i = 0; i < n; i++) { intered[i] = x[i]; double ref = x[0]; int idx_ref = 0; double incre = 0; ...
return (y1 * (1 - mu) + y2 * mu);
double cappedFactor = cap(factor, 0.0, 1.0); return min + (max - min) * cappedFactor;
return (x1 == x2) ? 0.0 : (y1 + (x - x1) * (y2 - y1) / (x2 - x1));
return y0 + ((y1 - y0) / (x1 - x0)) * (x - x0);