package o; /* loaded from: classes5.dex */ public class fKE { public int a; public long b; public int c; public long d; public float e; public double f; public Object g; public double h; public Object i; public float j; private final long[] k; private int l; private final float[] m; private final int[] n; /* renamed from: o, reason: collision with root package name */ private int f9095o; private final Object[] p; private final double[] s; public int d(int i) { switch (i) { case 1: int[] iArr = this.n; int i2 = this.l; this.l = i2 + 1; iArr[i2] = this.a; return 0; case 2: int[] iArr2 = this.n; int i3 = this.l; iArr2[i3] = 2; iArr2[i3 + 1] = 2; int i4 = i3 + 1; this.l = i4; iArr2[i3] = iArr2[i3] % iArr2[i4]; return 0; case 3: int i5 = this.l - 1; this.l = i5; this.p[i5] = null; return 0; case 5: this.c = this.n[this.l - 1]; case 4: return 0; case 6: int[] iArr3 = this.n; int i6 = this.l; iArr3[i6] = 121; this.l = i6; iArr3[i6 - 1] = iArr3[i6 - 1] + iArr3[i6]; return 0; case 7: int[] iArr4 = this.n; int i7 = this.l; iArr4[i7] = iArr4[i7 - 1]; this.l = i7 + 2; iArr4[i7 + 1] = 128; return 0; case 8: int i8 = this.l; int i9 = i8 - 1; this.l = i9; int[] iArr5 = this.n; iArr5[i8 - 2] = iArr5[i8 - 2] % iArr5[i9]; return 0; case 9: int i10 = this.l - this.a; this.l = i10; this.f9095o = i10; return 0; case 10: int[] iArr6 = this.n; int i11 = this.f9095o; this.f9095o = i11 + 1; this.c = iArr6[i11]; return 0; case 11: int[] iArr7 = this.n; int i12 = this.l; iArr7[i12] = 2; this.l = i12; iArr7[i12 - 1] = iArr7[i12 - 1] % iArr7[i12]; return 0; case 12: int i13 = this.l - 1; this.l = i13; this.c = this.n[i13] == 0 ? 0 : 1; return 0; case 13: int[] iArr8 = this.n; int i14 = this.l; iArr8[i14] = 99; this.l = i14; iArr8[i14 - 1] = iArr8[i14 - 1] + iArr8[i14]; return 0; case 14: int[] iArr9 = this.n; int i15 = this.l; iArr9[i15] = iArr9[i15 - 1]; iArr9[i15 + 1] = 128; int i16 = i15 + 1; this.l = i16; iArr9[i15] = iArr9[i15] % iArr9[i16]; return 0; case 15: int[] iArr10 = this.n; int i17 = this.l; this.l = i17 + 1; iArr10[i17] = iArr10[4]; return 0; case 16: int[] iArr11 = this.n; int i18 = this.l; this.l = i18 + 1; iArr11[i18] = 89; return 0; case 17: int i19 = this.l; int i20 = i19 - 1; this.l = i20; int[] iArr12 = this.n; iArr12[i19 - 2] = iArr12[i19 - 2] + iArr12[i20]; return 0; case 18: int[] iArr13 = this.n; int i21 = this.l; this.l = i21 + 1; iArr13[i21] = iArr13[i21 - 1]; return 0; case 19: int[] iArr14 = this.n; int i22 = this.l; iArr14[i22] = 128; this.l = i22; iArr14[i22 - 1] = iArr14[i22 - 1] % iArr14[i22]; return 0; case 20: Object[] objArr = this.p; int i23 = this.l; Object obj = objArr[i23 - 1]; objArr[i23 - 1] = null; this.i = obj; return 0; case 21: Object[] objArr2 = this.p; int i24 = this.l; this.l = i24 + 1; objArr2[i24] = null; int[] iArr15 = this.n; Object obj2 = objArr2[i24]; objArr2[i24] = null; iArr15[i24] = ((int[]) obj2).length; return 0; case 22: int[] iArr16 = this.n; int i25 = this.l - 1; this.l = i25; this.c = iArr16[i25]; return 0; case 23: int[] iArr17 = this.n; int i26 = this.l; this.l = i26 + 1; iArr17[i26] = 12; return 0; case 24: int[] iArr18 = this.n; int i27 = this.l; this.l = i27 + 1; iArr18[i27] = 36; return 0; case 25: for (int i28 = this.l - 1; i28 >= 0; i28--) { this.p[i28] = null; } Object[] objArr3 = this.p; this.l = 1; objArr3[0] = this.g; return 0; case 26: int[] iArr19 = this.n; int i29 = this.l; this.l = i29 + 1; iArr19[i29] = 2; return 0; case 27: int[] iArr20 = this.n; int i30 = this.l; this.l = i30 + 1; iArr20[i30] = 83; return 0; case 28: int i31 = this.l; int i32 = i31 - 1; int[] iArr21 = this.n; iArr21[i31 - 2] = iArr21[i31 - 2] + iArr21[i32]; this.l = i31; iArr21[i32] = iArr21[i31 - 2]; return 0; case 29: int i33 = this.l - 1; this.l = i33; this.c = this.n[i33] != 0 ? 0 : 1; return 0; case 30: int[] iArr22 = this.n; int i34 = this.l; iArr22[i34] = 41; iArr22[i34 - 1] = iArr22[i34 - 1] + iArr22[i34]; this.l = i34 + 1; iArr22[i34] = iArr22[i34 - 1]; return 0; case 31: int[] iArr23 = this.n; int i35 = this.l; this.l = i35 + 1; iArr23[i35] = 128; return 0; case 32: int[] iArr24 = this.n; int i36 = this.l; this.l = i36 + 1; iArr24[i36] = 1; return 0; case 33: int[] iArr25 = this.n; int i37 = this.l; iArr25[i37] = 73; this.l = i37; iArr25[i37 - 1] = iArr25[i37 - 1] + iArr25[i37]; return 0; case 34: int[] iArr26 = this.n; int i38 = this.l; iArr26[i38] = 9; this.l = i38; iArr26[i38 - 1] = iArr26[i38 - 1] + iArr26[i38]; return 0; default: return i; } } public fKE(long j, long j2) { this.n = new int[8]; long[] jArr = new long[8]; this.k = jArr; this.m = new float[8]; this.s = new double[8]; this.p = new Object[8]; jArr[4] = j; jArr[6] = j2; this.l = 0; this.f9095o = -1; } public fKE(int i) { int[] iArr = new int[8]; this.n = iArr; this.k = new long[8]; this.m = new float[8]; this.s = new double[8]; this.p = new Object[8]; iArr[4] = i; this.l = 0; this.f9095o = -1; } public fKE() { this.n = new int[8]; this.k = new long[8]; this.m = new float[8]; this.s = new double[8]; this.p = new Object[8]; this.l = 0; this.f9095o = -1; } }