public class org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm extends java.lang.Object implements org.apache.commons.math.analysis.UnivariateFunction
{
private double[] coefficients;
private final double[] x;
private final double[] y;
private boolean coefficientsComputed;
public void <init>(double[], double[]) throws org.apache.commons.math.exception.DimensionMismatchException, org.apache.commons.math.exception.NumberIsTooSmallException, org.apache.commons.math.exception.NonMonotonicSequenceException
{
double[] v, v, v, v, v, v, v, v, v, v;
int v, v, v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
boolean v;
double[][] v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v := @parameter: double[];
v := @parameter: double[];
specialinvoke v.<java.lang.Object: void <init>()>();
v = lengthof v;
v = newarray (double)[v];
v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x> = v;
v = lengthof v;
v = newarray (double)[v];
v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y> = v;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean coefficientsComputed> = 0;
v = staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean verifyInterpolationArray(double[],double[],boolean)>(v, v, 0);
if v != 0 goto label;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = newarray (double[])[1];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v[0] = v;
staticinvoke <org.apache.commons.math.util.MathArrays: void sortInPlace(double[],double[][])>(v, v);
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean verifyInterpolationArray(double[],double[],boolean)>(v, v, 1);
label:
return;
}
public double value(double)
{
double[] v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
double v, v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v := @parameter: double;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double evaluateInternal(double[],double[],double)>(v, v, v);
return v;
}
public int degree()
{
double[] v;
int v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = lengthof v;
v = v - 1;
return v;
}
public double[] getInterpolatingPoints()
{
double[] v, v, v, v;
int v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = lengthof v;
v = newarray (double)[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
return v;
}
public double[] getInterpolatingValues()
{
double[] v, v, v, v;
int v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = lengthof v;
v = newarray (double)[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
return v;
}
public double[] getCoefficients()
{
double[] v, v, v, v;
int v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
boolean v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean coefficientsComputed>;
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: void computeCoefficients()>();
label:
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v = lengthof v;
v = newarray (double)[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
return v;
}
public static double evaluate(double[], double[], double) throws org.apache.commons.math.exception.DimensionMismatchException, org.apache.commons.math.exception.NumberIsTooSmallException, org.apache.commons.math.exception.NonMonotonicSequenceException
{
double[] v, v, v, v;
int v, v, v, v;
double[][] v;
boolean v;
double v, v, v;
v := @parameter: double[];
v := @parameter: double[];
v := @parameter: double;
v = staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean verifyInterpolationArray(double[],double[],boolean)>(v, v, 0);
if v == 0 goto label;
v = staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double evaluateInternal(double[],double[],double)>(v, v, v);
return v;
label:
v = lengthof v;
v = newarray (double)[v];
v = lengthof v;
v = newarray (double)[v];
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
v = lengthof v;
staticinvoke <java.lang.System: void arraycopy(java.lang.Object,int,java.lang.Object,int,int)>(v, 0, v, 0, v);
v = newarray (double[])[1];
v[0] = v;
staticinvoke <org.apache.commons.math.util.MathArrays: void sortInPlace(double[],double[][])>(v, v);
staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean verifyInterpolationArray(double[],double[],boolean)>(v, v, 1);
v = staticinvoke <org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double evaluateInternal(double[],double[],double)>(v, v, v);
return v;
}
private static double evaluateInternal(double[], double[], double)
{
byte v, v;
double[] v, v, v, v;
int v, v, v, v, v, v, v, v, v, v, v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
v := @parameter: double[];
v := @parameter: double[];
v := @parameter: double;
v = 0;
v = lengthof v;
v = newarray (double)[v];
v = newarray (double)[v];
v = #Infinity;
v = 0;
label:
if v >= v goto label;
v = v[v];
v[v] = v;
v = v[v];
v[v] = v;
v = v[v];
v = v - v;
v = staticinvoke <org.apache.commons.math.util.FastMath: double abs(double)>(v);
v = v cmpg v;
if v >= 0 goto label;
v = v;
v = v;
label:
v = v + 1;
goto label;
label:
v = v[v];
v = 1;
label:
if v >= v goto label;
v = 0;
label:
v = v - v;
if v >= v goto label;
v = v[v];
v = v - v;
v = v + v;
v = v[v];
v = v - v;
v = v[v];
v = v + v;
v = v[v];
v = v - v;
v = v + 1;
v = v[v];
v = v[v];
v = v - v;
v = v / v;
v = v * v;
v[v] = v;
v = v * v;
v[v] = v;
v = v + 1;
goto label;
label:
v = v - v;
v = v + 1;
v = 0.5 * v;
v = v cmpg v;
if v >= 0 goto label;
v = v[v];
v = v + v;
goto label;
label:
v = v - 1;
v = v[v];
v = v + v;
label:
v = v + 1;
goto label;
label:
return v;
}
protected void computeCoefficients()
{
double[] v, v, v, v, v, v, v, v, v, v, v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
v := @this: org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm;
v = virtualinvoke v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: int degree()>();
v = v + 1;
v = newarray (double)[v];
v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients> = v;
v = 0;
label:
if v >= v goto label;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v[v] = 0.0;
v = v + 1;
goto label;
label:
v = v + 1;
v = newarray (double)[v];
v[0] = 1.0;
v = 0;
label:
if v >= v goto label;
v = v;
label:
if v <= 0 goto label;
v = v - 1;
v = v[v];
v = v[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v[v];
v = v * v;
v = v - v;
v[v] = v;
v = v - 1;
goto label;
label:
v = v[0];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v[v];
v = neg v;
v = v * v;
v[0] = v;
v = v + 1;
v[v] = 1.0;
v = v + 1;
goto label;
label:
v = newarray (double)[v];
v = 0;
label:
if v >= v goto label;
v = 1.0;
v = 0;
label:
if v >= v goto label;
if v == v goto label;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v[v];
v = v - v;
v = v * v;
label:
v = v + 1;
goto label;
label:
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] y>;
v = v[v];
v = v / v;
v = v - 1;
v = v[v];
v[v] = v;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v = v - 1;
v = v[v];
v = v - 1;
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v - 2;
label:
if v < 0 goto label;
v = v + 1;
v = v[v];
v = v + 1;
v = v[v];
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] x>;
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: double[] coefficients>;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v - 1;
goto label;
label:
v = v + 1;
goto label;
label:
v.<org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm: boolean coefficientsComputed> = 1;
return;
}
public static boolean verifyInterpolationArray(double[], double[], boolean) throws org.apache.commons.math.exception.DimensionMismatchException, org.apache.commons.math.exception.NumberIsTooSmallException, org.apache.commons.math.exception.NonMonotonicSequenceException
{
double[] v, v;
java.lang.Integer v, v;
org.apache.commons.math.util.MathArrays$OrderDirection v;
org.apache.commons.math.exception.NumberIsTooSmallException v;
int v, v, v, v, v, v;
boolean v, v;
org.apache.commons.math.exception.util.LocalizedFormats v;
org.apache.commons.math.exception.DimensionMismatchException v;
v := @parameter: double[];
v := @parameter: double[];
v := @parameter: boolean;
v = lengthof v;
v = lengthof v;
if v == v goto label;
v = new org.apache.commons.math.exception.DimensionMismatchException;
v = lengthof v;
v = lengthof v;
specialinvoke v.<org.apache.commons.math.exception.DimensionMismatchException: void <init>(int,int)>(v, v);
throw v;
label:
v = lengthof v;
if v >= 2 goto label;
v = new org.apache.commons.math.exception.NumberIsTooSmallException;
v = <org.apache.commons.math.exception.util.LocalizedFormats: org.apache.commons.math.exception.util.LocalizedFormats WRONG_NUMBER_OF_POINTS>;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(2);
v = lengthof v;
v = staticinvoke <java.lang.Integer: java.lang.Integer valueOf(int)>(v);
specialinvoke v.<org.apache.commons.math.exception.NumberIsTooSmallException: void <init>(org.apache.commons.math.exception.util.Localizable,java.lang.Number,java.lang.Number,boolean)>(v, v, v, 1);
throw v;
label:
v = <org.apache.commons.math.util.MathArrays$OrderDirection: org.apache.commons.math.util.MathArrays$OrderDirection INCREASING>;
v = staticinvoke <org.apache.commons.math.util.MathArrays: boolean checkOrder(double[],org.apache.commons.math.util.MathArrays$OrderDirection,boolean,boolean)>(v, v, 1, v);
return v;
}
}