/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffX1MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateX1(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void linearDiffTwiceX1MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsLin, new int[] {2, 2 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateTwiceX1(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpDiffCrossMultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.differentiateCross(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nanX1Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } x1Keys[3] = Double.NaN; function.evaluate(result, x0Keys[3], x1Keys[3]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpEvaluateTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.evaluate(result, x0Keys[1], x1Keys[1]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpDiffTwiceX0Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.differentiateTwiceX0(result, x0Keys[1], x1Keys[1]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void infX0MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } x0Keys[2] = INF; function.evaluate(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void linearDiffTwiceX0Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsLin, new int[] {2, 2 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateTwiceX0(result, x0Keys[0], x1Keys[0]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpDiffX0Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.differentiateX0(result, x0Keys[1], x1Keys[1]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpDiffCrossTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.differentiateCross(result, x0Keys[1], x1Keys[1]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nanX0Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } x0Keys[3] = Double.NaN; function.evaluate(result, x0Keys[3], x1Keys[3]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void infX1MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } x1Keys[2] = INF; function.evaluate(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffX0Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateX0(result, x0Keys[0], x1Keys[0]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffCrossTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateCross(result, x0Keys[0], x1Keys[0]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffCrossMultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateCross(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffX0MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateX0(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void constDiffX1Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsConst, new int[] {1, 1 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateX1(result, x0Keys[0], x1Keys[0]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void linearDiffTwiceX0MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsLin, new int[] {2, 2 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateTwiceX0(result, x0Keys, x1Keys); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void linearDiffTwiceX1Test() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefsLin, new int[] {2, 2 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } function.differentiateTwiceX1(result, x0Keys[0], x1Keys[0]); }
/** * */ @Test(expectedExceptions = IllegalArgumentException.class) public void nullPpDiffTwiceX0MultiTest() { PiecewisePolynomialResult2D result = new PiecewisePolynomialResult2D(knots0, knots1, coefs, new int[] {5, 4 }); PiecewisePolynomialFunction2D function = new PiecewisePolynomialFunction2D(); final int n0Keys = 21; final int n1Keys = 31; double[] x0Keys = new double[n0Keys]; double[] x1Keys = new double[n1Keys]; for (int i = 0; i < n0Keys; ++i) { x0Keys[i] = 0. + 4. / (n0Keys - 1) * i; } for (int i = 0; i < n1Keys; ++i) { x1Keys[i] = 1. + 3. / (n1Keys - 1) * i; } result = null; function.differentiateTwiceX0(result, x0Keys, x1Keys); }