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