341 lines
11 KiB
Java
341 lines
11 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
import java.lang.reflect.Array;
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
public final class DBy extends ktU {
|
||
|
|
private boolean a = true;
|
||
|
|
private double[][] b;
|
||
|
|
private double[] c;
|
||
|
|
private double[] d;
|
||
|
|
private double[][] e;
|
||
|
|
|
||
|
|
private static double a(double d, double d2, double d3, double d4, double d5, double d6) {
|
||
|
|
double d7 = d2 * d2;
|
||
|
|
double d8 = d7 * d2;
|
||
|
|
double d9 = 3.0d * d7;
|
||
|
|
double d10 = d * d6;
|
||
|
|
double d11 = d * d5;
|
||
|
|
return (((((((((((-2.0d) * d8) * d4) + (d9 * d4)) + ((d8 * 2.0d) * d3)) - (d9 * d3)) + d3) + (d10 * d8)) + (d8 * d11)) - (d10 * d7)) - (((d * 2.0d) * d5) * d7)) + (d11 * d2);
|
||
|
|
}
|
||
|
|
|
||
|
|
private static double b(double d, double d2, double d3, double d4, double d5, double d6) {
|
||
|
|
double d7 = d2 * d2;
|
||
|
|
double d8 = d2 * 6.0d;
|
||
|
|
double d9 = 3.0d * d;
|
||
|
|
return ((((((((((-6.0d) * d7) * d4) + (d8 * d4)) + ((6.0d * d7) * d3)) - (d8 * d3)) + ((d9 * d6) * d7)) + ((d9 * d5) * d7)) - (((2.0d * d) * d6) * d2)) - (((4.0d * d) * d5) * d2)) + (d * d5);
|
||
|
|
}
|
||
|
|
|
||
|
|
public DBy(double[] dArr, double[][] dArr2) {
|
||
|
|
int length = dArr.length;
|
||
|
|
int length2 = dArr2[0].length;
|
||
|
|
this.c = new double[length2];
|
||
|
|
int i = length - 1;
|
||
|
|
double[][] dArr3 = (double[][]) Array.newInstance((Class<?>) Double.TYPE, i, length2);
|
||
|
|
double[][] dArr4 = (double[][]) Array.newInstance((Class<?>) Double.TYPE, length, length2);
|
||
|
|
for (int i2 = 0; i2 < length2; i2++) {
|
||
|
|
int i3 = 0;
|
||
|
|
while (i3 < i) {
|
||
|
|
int i4 = i3 + 1;
|
||
|
|
double d = dArr[i4];
|
||
|
|
double d2 = dArr[i3];
|
||
|
|
double[] dArr5 = dArr3[i3];
|
||
|
|
double d3 = (dArr2[i4][i2] - dArr2[i3][i2]) / (d - d2);
|
||
|
|
dArr5[i2] = d3;
|
||
|
|
if (i3 == 0) {
|
||
|
|
dArr4[i3][i2] = d3;
|
||
|
|
} else {
|
||
|
|
dArr4[i3][i2] = (dArr3[i3 - 1][i2] + d3) * 0.5d;
|
||
|
|
}
|
||
|
|
i3 = i4;
|
||
|
|
}
|
||
|
|
dArr4[i][i2] = dArr3[length - 2][i2];
|
||
|
|
}
|
||
|
|
for (int i5 = 0; i5 < i; i5++) {
|
||
|
|
for (int i6 = 0; i6 < length2; i6++) {
|
||
|
|
double d4 = dArr3[i5][i6];
|
||
|
|
if (d4 == 0.0d) {
|
||
|
|
dArr4[i5][i6] = 0.0d;
|
||
|
|
dArr4[i5 + 1][i6] = 0.0d;
|
||
|
|
} else {
|
||
|
|
double d5 = dArr4[i5][i6] / d4;
|
||
|
|
int i7 = i5 + 1;
|
||
|
|
double d6 = dArr4[i7][i6] / d4;
|
||
|
|
double hypot = Math.hypot(d5, d6);
|
||
|
|
if (hypot > 9.0d) {
|
||
|
|
double d7 = 3.0d / hypot;
|
||
|
|
double[] dArr6 = dArr4[i5];
|
||
|
|
double[] dArr7 = dArr3[i5];
|
||
|
|
dArr6[i6] = d5 * d7 * dArr7[i6];
|
||
|
|
dArr4[i7][i6] = d7 * d6 * dArr7[i6];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
this.d = dArr;
|
||
|
|
this.b = dArr2;
|
||
|
|
this.e = dArr4;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.ktU
|
||
|
|
public final void a(double d, double[] dArr) {
|
||
|
|
double[] dArr2 = this.d;
|
||
|
|
int length = dArr2.length;
|
||
|
|
int i = 0;
|
||
|
|
int length2 = this.b[0].length;
|
||
|
|
if (this.a) {
|
||
|
|
double d2 = dArr2[0];
|
||
|
|
if (d <= d2) {
|
||
|
|
b(d2, this.c);
|
||
|
|
for (int i2 = 0; i2 < length2; i2++) {
|
||
|
|
dArr[i2] = this.b[0][i2] + ((d - this.d[0]) * this.c[i2]);
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i3 = length - 1;
|
||
|
|
double d3 = dArr2[i3];
|
||
|
|
if (d >= d3) {
|
||
|
|
b(d3, this.c);
|
||
|
|
while (i < length2) {
|
||
|
|
dArr[i] = this.b[i3][i] + ((d - this.d[i3]) * this.c[i]);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
if (d <= dArr2[0]) {
|
||
|
|
for (int i4 = 0; i4 < length2; i4++) {
|
||
|
|
dArr[i4] = this.b[0][i4];
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i5 = length - 1;
|
||
|
|
if (d >= dArr2[i5]) {
|
||
|
|
while (i < length2) {
|
||
|
|
dArr[i] = this.b[i5][i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int i6 = 0;
|
||
|
|
while (i6 < length - 1) {
|
||
|
|
if (d == this.d[i6]) {
|
||
|
|
for (int i7 = 0; i7 < length2; i7++) {
|
||
|
|
dArr[i7] = this.b[i6][i7];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
double[] dArr3 = this.d;
|
||
|
|
int i8 = i6 + 1;
|
||
|
|
double d4 = dArr3[i8];
|
||
|
|
if (d < d4) {
|
||
|
|
double d5 = dArr3[i6];
|
||
|
|
double d6 = d4 - d5;
|
||
|
|
double d7 = (d - d5) / d6;
|
||
|
|
while (i < length2) {
|
||
|
|
double[][] dArr4 = this.b;
|
||
|
|
double d8 = dArr4[i6][i];
|
||
|
|
double d9 = dArr4[i8][i];
|
||
|
|
double[][] dArr5 = this.e;
|
||
|
|
dArr[i] = a(d6, d7, d8, d9, dArr5[i6][i], dArr5[i8][i]);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
i6 = i8;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.ktU
|
||
|
|
public final void a(double d, float[] fArr) {
|
||
|
|
double[] dArr = this.d;
|
||
|
|
int length = dArr.length;
|
||
|
|
int i = 0;
|
||
|
|
int length2 = this.b[0].length;
|
||
|
|
if (this.a) {
|
||
|
|
double d2 = dArr[0];
|
||
|
|
if (d <= d2) {
|
||
|
|
b(d2, this.c);
|
||
|
|
for (int i2 = 0; i2 < length2; i2++) {
|
||
|
|
fArr[i2] = (float) (this.b[0][i2] + ((d - this.d[0]) * this.c[i2]));
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i3 = length - 1;
|
||
|
|
double d3 = dArr[i3];
|
||
|
|
if (d >= d3) {
|
||
|
|
b(d3, this.c);
|
||
|
|
while (i < length2) {
|
||
|
|
fArr[i] = (float) (this.b[i3][i] + ((d - this.d[i3]) * this.c[i]));
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
if (d <= dArr[0]) {
|
||
|
|
for (int i4 = 0; i4 < length2; i4++) {
|
||
|
|
fArr[i4] = (float) this.b[0][i4];
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int i5 = length - 1;
|
||
|
|
if (d >= dArr[i5]) {
|
||
|
|
while (i < length2) {
|
||
|
|
fArr[i] = (float) this.b[i5][i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int i6 = 0;
|
||
|
|
while (i6 < length - 1) {
|
||
|
|
if (d == this.d[i6]) {
|
||
|
|
for (int i7 = 0; i7 < length2; i7++) {
|
||
|
|
fArr[i7] = (float) this.b[i6][i7];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
double[] dArr2 = this.d;
|
||
|
|
int i8 = i6 + 1;
|
||
|
|
double d4 = dArr2[i8];
|
||
|
|
if (d < d4) {
|
||
|
|
double d5 = dArr2[i6];
|
||
|
|
double d6 = d4 - d5;
|
||
|
|
double d7 = (d - d5) / d6;
|
||
|
|
while (i < length2) {
|
||
|
|
double[][] dArr3 = this.b;
|
||
|
|
double d8 = dArr3[i6][i];
|
||
|
|
double d9 = dArr3[i8][i];
|
||
|
|
double[][] dArr4 = this.e;
|
||
|
|
fArr[i] = (float) a(d6, d7, d8, d9, dArr4[i6][i], dArr4[i8][i]);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
i6 = i8;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.ktU
|
||
|
|
public final double e(double d) {
|
||
|
|
double d2;
|
||
|
|
double d3;
|
||
|
|
double d4;
|
||
|
|
double[] dArr = this.d;
|
||
|
|
int length = dArr.length;
|
||
|
|
if (this.a) {
|
||
|
|
double d5 = dArr[0];
|
||
|
|
if (d <= d5) {
|
||
|
|
d2 = this.b[0][0];
|
||
|
|
d3 = d - d5;
|
||
|
|
d4 = d(d5);
|
||
|
|
} else {
|
||
|
|
int i = length - 1;
|
||
|
|
double d6 = dArr[i];
|
||
|
|
if (d >= d6) {
|
||
|
|
d2 = this.b[i][0];
|
||
|
|
d3 = d - d6;
|
||
|
|
d4 = d(d6);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return d2 + (d3 * d4);
|
||
|
|
}
|
||
|
|
if (d <= dArr[0]) {
|
||
|
|
return this.b[0][0];
|
||
|
|
}
|
||
|
|
int i2 = length - 1;
|
||
|
|
if (d >= dArr[i2]) {
|
||
|
|
return this.b[i2][0];
|
||
|
|
}
|
||
|
|
int i3 = 0;
|
||
|
|
while (i3 < length - 1) {
|
||
|
|
double[] dArr2 = this.d;
|
||
|
|
double d7 = dArr2[i3];
|
||
|
|
if (d == d7) {
|
||
|
|
return this.b[i3][0];
|
||
|
|
}
|
||
|
|
int i4 = i3 + 1;
|
||
|
|
double d8 = dArr2[i4];
|
||
|
|
if (d < d8) {
|
||
|
|
double d9 = d8 - d7;
|
||
|
|
double d10 = (d - d7) / d9;
|
||
|
|
double[][] dArr3 = this.b;
|
||
|
|
double d11 = dArr3[i3][0];
|
||
|
|
double d12 = dArr3[i4][0];
|
||
|
|
double[][] dArr4 = this.e;
|
||
|
|
return a(d9, d10, d11, d12, dArr4[i3][0], dArr4[i4][0]);
|
||
|
|
}
|
||
|
|
i3 = i4;
|
||
|
|
}
|
||
|
|
return 0.0d;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.ktU
|
||
|
|
public final void b(double d, double[] dArr) {
|
||
|
|
double[] dArr2 = this.d;
|
||
|
|
int length = dArr2.length;
|
||
|
|
int length2 = this.b[0].length;
|
||
|
|
double d2 = dArr2[0];
|
||
|
|
if (d > d2) {
|
||
|
|
d2 = dArr2[length - 1];
|
||
|
|
if (d < d2) {
|
||
|
|
d2 = d;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int i = 0;
|
||
|
|
while (i < length - 1) {
|
||
|
|
double[] dArr3 = this.d;
|
||
|
|
int i2 = i + 1;
|
||
|
|
double d3 = dArr3[i2];
|
||
|
|
if (d2 <= d3) {
|
||
|
|
double d4 = dArr3[i];
|
||
|
|
double d5 = d3 - d4;
|
||
|
|
double d6 = (d2 - d4) / d5;
|
||
|
|
for (int i3 = 0; i3 < length2; i3++) {
|
||
|
|
double[][] dArr4 = this.b;
|
||
|
|
double d7 = dArr4[i][i3];
|
||
|
|
double d8 = dArr4[i2][i3];
|
||
|
|
double[][] dArr5 = this.e;
|
||
|
|
dArr[i3] = b(d5, d6, d7, d8, dArr5[i][i3], dArr5[i2][i3]) / d5;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
i = i2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public final double d(double d) {
|
||
|
|
double[] dArr = this.d;
|
||
|
|
int length = dArr.length;
|
||
|
|
double d2 = dArr[0];
|
||
|
|
if (d >= d2) {
|
||
|
|
d2 = dArr[length - 1];
|
||
|
|
if (d < d2) {
|
||
|
|
d2 = d;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int i = 0;
|
||
|
|
while (i < length - 1) {
|
||
|
|
double[] dArr2 = this.d;
|
||
|
|
int i2 = i + 1;
|
||
|
|
double d3 = dArr2[i2];
|
||
|
|
if (d2 <= d3) {
|
||
|
|
double d4 = dArr2[i];
|
||
|
|
double d5 = d3 - d4;
|
||
|
|
double d6 = (d2 - d4) / d5;
|
||
|
|
double[][] dArr3 = this.b;
|
||
|
|
double d7 = dArr3[i][0];
|
||
|
|
double d8 = dArr3[i2][0];
|
||
|
|
double[][] dArr4 = this.e;
|
||
|
|
return b(d5, d6, d7, d8, dArr4[i][0], dArr4[i2][0]) / d5;
|
||
|
|
}
|
||
|
|
i = i2;
|
||
|
|
}
|
||
|
|
return 0.0d;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // o.ktU
|
||
|
|
public final double[] e() {
|
||
|
|
return this.d;
|
||
|
|
}
|
||
|
|
}
|