172 lines
5.0 KiB
Java
172 lines
5.0 KiB
Java
package o;
|
|
|
|
/* renamed from: o.fXT, reason: case insensitive filesystem */
|
|
/* loaded from: classes6.dex */
|
|
public class C13322fXT {
|
|
public float a;
|
|
public int b;
|
|
public long c;
|
|
public int d;
|
|
public long e;
|
|
public float f;
|
|
public double g;
|
|
public Object h;
|
|
public double i;
|
|
public Object j;
|
|
private int k;
|
|
private final long[] l;
|
|
private int m;
|
|
private final int[] n = new int[7];
|
|
|
|
/* renamed from: o, reason: collision with root package name */
|
|
private final float[] f9126o = new float[7];
|
|
private final double[] r = new double[7];
|
|
private final Object[] p = new Object[7];
|
|
|
|
public int b(int i) {
|
|
switch (i) {
|
|
case 1:
|
|
Object[] objArr = this.p;
|
|
int i2 = this.k;
|
|
this.k = i2 + 1;
|
|
objArr[i2] = this.h;
|
|
return 0;
|
|
case 2:
|
|
int i3 = this.k - 1;
|
|
this.k = i3;
|
|
this.p[i3] = null;
|
|
return 0;
|
|
case 3:
|
|
int i4 = this.k - this.b;
|
|
this.k = i4;
|
|
this.m = i4;
|
|
return 0;
|
|
case 4:
|
|
int[] iArr = this.n;
|
|
int i5 = this.m;
|
|
this.m = i5 + 1;
|
|
this.d = iArr[i5];
|
|
return 0;
|
|
case 5:
|
|
int[] iArr2 = this.n;
|
|
int i6 = this.k;
|
|
this.k = i6 + 1;
|
|
iArr2[i6] = 1;
|
|
return 0;
|
|
case 6:
|
|
int[] iArr3 = this.n;
|
|
int i7 = this.k;
|
|
iArr3[i7] = 2;
|
|
iArr3[i7 + 1] = 2;
|
|
int i8 = i7 + 1;
|
|
this.k = i8;
|
|
iArr3[i7] = iArr3[i7] % iArr3[i8];
|
|
return 0;
|
|
case 8:
|
|
int[] iArr4 = this.n;
|
|
int i9 = this.k;
|
|
this.k = i9 + 1;
|
|
iArr4[i9] = this.b;
|
|
case 7:
|
|
return 0;
|
|
case 9:
|
|
int[] iArr5 = this.n;
|
|
int i10 = this.k;
|
|
iArr5[i10] = 109;
|
|
iArr5[i10 - 1] = iArr5[i10 - 1] + iArr5[i10];
|
|
this.k = i10 + 1;
|
|
iArr5[i10] = iArr5[i10 - 1];
|
|
return 0;
|
|
case 10:
|
|
int[] iArr6 = this.n;
|
|
int i11 = this.k;
|
|
this.k = i11 + 1;
|
|
iArr6[i11] = 128;
|
|
return 0;
|
|
case 11:
|
|
int i12 = this.k;
|
|
int i13 = i12 - 1;
|
|
this.k = i13;
|
|
int[] iArr7 = this.n;
|
|
iArr7[i12 - 2] = iArr7[i12 - 2] % iArr7[i13];
|
|
return 0;
|
|
case 12:
|
|
int[] iArr8 = this.n;
|
|
int i14 = this.k;
|
|
this.k = i14 + 1;
|
|
iArr8[i14] = 2;
|
|
return 0;
|
|
case 13:
|
|
int i15 = this.k - 1;
|
|
this.k = i15;
|
|
this.d = this.n[i15] != 0 ? 0 : 1;
|
|
return 0;
|
|
case 14:
|
|
int[] iArr9 = this.n;
|
|
int i16 = this.k;
|
|
this.k = i16 + 1;
|
|
iArr9[i16] = 17;
|
|
return 0;
|
|
case 15:
|
|
int i17 = this.k;
|
|
int i18 = i17 - 1;
|
|
this.k = i18;
|
|
int[] iArr10 = this.n;
|
|
iArr10[i17 - 2] = iArr10[i17 - 2] + iArr10[i18];
|
|
return 0;
|
|
case 16:
|
|
int[] iArr11 = this.n;
|
|
int i19 = this.k;
|
|
this.k = i19 + 1;
|
|
iArr11[i19] = iArr11[i19 - 1];
|
|
return 0;
|
|
case 17:
|
|
int i20 = this.k;
|
|
int i21 = i20 - 1;
|
|
this.p[i21] = null;
|
|
int[] iArr12 = this.n;
|
|
this.k = i20;
|
|
iArr12[i21] = 1;
|
|
return 0;
|
|
case 18:
|
|
int[] iArr13 = this.n;
|
|
int i22 = this.k - 1;
|
|
this.k = i22;
|
|
this.d = iArr13[i22];
|
|
return 0;
|
|
case 19:
|
|
int[] iArr14 = this.n;
|
|
int i23 = this.k;
|
|
this.k = i23 + 1;
|
|
iArr14[i23] = 0;
|
|
return 0;
|
|
case 20:
|
|
Object[] objArr2 = this.p;
|
|
int i24 = this.k;
|
|
Object obj = objArr2[i24 - 1];
|
|
objArr2[i24 - 1] = null;
|
|
this.j = obj;
|
|
return 0;
|
|
case 21:
|
|
for (int i25 = this.k - 1; i25 >= 0; i25--) {
|
|
this.p[i25] = null;
|
|
}
|
|
Object[] objArr3 = this.p;
|
|
this.k = 1;
|
|
objArr3[0] = this.h;
|
|
return 0;
|
|
default:
|
|
return i;
|
|
}
|
|
}
|
|
|
|
public C13322fXT(long j, long j2) {
|
|
long[] jArr = new long[7];
|
|
this.l = jArr;
|
|
jArr[3] = j;
|
|
jArr[5] = j2;
|
|
this.k = 0;
|
|
this.m = -1;
|
|
}
|
|
}
|