279 lines
8.6 KiB
Java
279 lines
8.6 KiB
Java
|
package com.facetec.sdk;
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
public class dj {
|
||
|
|
public int a;
|
||
|
|
public float b;
|
||
|
|
public long c;
|
||
|
|
public long d;
|
||
|
|
public int e;
|
||
|
|
public Object f;
|
||
|
|
public float g;
|
||
|
|
public Object h;
|
||
|
|
public double i;
|
||
|
|
public double j;
|
||
|
|
private int k;
|
||
|
|
private final int[] l;
|
||
|
|
private int n;
|
||
|
|
private final Object[] r;
|
||
|
|
|
||
|
|
/* renamed from: o, reason: collision with root package name */
|
||
|
|
private final long[] f6434o = new long[10];
|
||
|
|
private final float[] m = new float[10];
|
||
|
|
private final double[] s = new double[10];
|
||
|
|
|
||
|
|
public int a(int i) {
|
||
|
|
switch (i) {
|
||
|
|
case 1:
|
||
|
|
int i2 = this.n - this.a;
|
||
|
|
this.n = i2;
|
||
|
|
this.k = i2;
|
||
|
|
return 0;
|
||
|
|
case 2:
|
||
|
|
Object[] objArr = this.r;
|
||
|
|
int i3 = this.k;
|
||
|
|
this.k = i3 + 1;
|
||
|
|
Object obj = objArr[i3];
|
||
|
|
objArr[i3] = null;
|
||
|
|
this.f = obj;
|
||
|
|
return 0;
|
||
|
|
case 3:
|
||
|
|
Object[] objArr2 = this.r;
|
||
|
|
int i4 = this.n;
|
||
|
|
this.n = i4 + 1;
|
||
|
|
objArr2[i4] = this.h;
|
||
|
|
return 0;
|
||
|
|
case 4:
|
||
|
|
Object[] objArr3 = this.r;
|
||
|
|
int i5 = this.n;
|
||
|
|
this.n = i5 + 1;
|
||
|
|
objArr3[i5] = objArr3[6];
|
||
|
|
return 0;
|
||
|
|
case 5:
|
||
|
|
int i6 = this.n;
|
||
|
|
int i7 = i6 - 2;
|
||
|
|
this.n = i7;
|
||
|
|
Object[] objArr4 = this.r;
|
||
|
|
Object obj2 = objArr4[i7];
|
||
|
|
objArr4[i7] = null;
|
||
|
|
int i8 = i6 - 1;
|
||
|
|
Object obj3 = objArr4[i8];
|
||
|
|
objArr4[i8] = null;
|
||
|
|
this.e = obj2 != obj3 ? 0 : 1;
|
||
|
|
return 0;
|
||
|
|
case 6:
|
||
|
|
int i9 = this.n - 1;
|
||
|
|
this.n = i9;
|
||
|
|
Object[] objArr5 = this.r;
|
||
|
|
Object obj4 = objArr5[i9];
|
||
|
|
objArr5[i9] = null;
|
||
|
|
this.e = obj4 == null ? 0 : 1;
|
||
|
|
return 0;
|
||
|
|
case 7:
|
||
|
|
int[] iArr = this.l;
|
||
|
|
int i10 = this.n;
|
||
|
|
this.n = i10 + 1;
|
||
|
|
iArr[i10] = this.a;
|
||
|
|
return 0;
|
||
|
|
case 8:
|
||
|
|
int i11 = this.n - 1;
|
||
|
|
this.n = i11;
|
||
|
|
this.e = this.l[i11] != 0 ? 0 : 1;
|
||
|
|
return 0;
|
||
|
|
case 9:
|
||
|
|
Object[] objArr6 = this.r;
|
||
|
|
int i12 = this.n;
|
||
|
|
this.n = i12 + 1;
|
||
|
|
objArr6[i12] = objArr6[i12 - 1];
|
||
|
|
return 0;
|
||
|
|
case 10:
|
||
|
|
int[] iArr2 = this.l;
|
||
|
|
int i13 = this.k;
|
||
|
|
this.k = i13 + 1;
|
||
|
|
this.e = iArr2[i13];
|
||
|
|
return 0;
|
||
|
|
case 11:
|
||
|
|
int[] iArr3 = this.l;
|
||
|
|
int i14 = this.n;
|
||
|
|
this.n = i14 + 1;
|
||
|
|
iArr3[i14] = 1;
|
||
|
|
return 0;
|
||
|
|
case 12:
|
||
|
|
int i15 = this.n - 1;
|
||
|
|
this.n = i15;
|
||
|
|
this.e = this.l[i15] <= 0 ? 0 : 1;
|
||
|
|
return 0;
|
||
|
|
case 13:
|
||
|
|
Object[] objArr7 = this.r;
|
||
|
|
int i16 = this.n;
|
||
|
|
Object obj5 = objArr7[6];
|
||
|
|
objArr7[i16] = obj5;
|
||
|
|
this.n = i16 + 2;
|
||
|
|
objArr7[i16 + 1] = obj5;
|
||
|
|
return 0;
|
||
|
|
case 14:
|
||
|
|
int[] iArr4 = this.l;
|
||
|
|
int i17 = this.n;
|
||
|
|
iArr4[i17] = 1;
|
||
|
|
this.n = i17;
|
||
|
|
int i18 = i17 - 1;
|
||
|
|
iArr4[i18] = iArr4[i18] + 1;
|
||
|
|
return 0;
|
||
|
|
case 15:
|
||
|
|
int[] iArr5 = this.l;
|
||
|
|
int i19 = this.n;
|
||
|
|
this.n = i19 + 1;
|
||
|
|
iArr5[i19] = 0;
|
||
|
|
return 0;
|
||
|
|
case 16:
|
||
|
|
int i20 = this.n - 1;
|
||
|
|
this.n = i20;
|
||
|
|
this.r[i20] = null;
|
||
|
|
return 0;
|
||
|
|
case 17:
|
||
|
|
int i21 = this.n;
|
||
|
|
int i22 = i21 - 1;
|
||
|
|
this.n = i22;
|
||
|
|
int[] iArr6 = this.l;
|
||
|
|
Object[] objArr8 = this.r;
|
||
|
|
int i23 = i21 - 2;
|
||
|
|
Object obj6 = objArr8[i23];
|
||
|
|
objArr8[i23] = null;
|
||
|
|
iArr6[i23] = ((int[]) obj6)[iArr6[i22]];
|
||
|
|
return 0;
|
||
|
|
case 18:
|
||
|
|
int[] iArr7 = this.l;
|
||
|
|
int i24 = this.n - 1;
|
||
|
|
this.n = i24;
|
||
|
|
this.e = iArr7[i24];
|
||
|
|
return 0;
|
||
|
|
case 19:
|
||
|
|
int[] iArr8 = this.l;
|
||
|
|
int i25 = this.n;
|
||
|
|
this.n = i25 + 1;
|
||
|
|
iArr8[i25] = iArr8[8];
|
||
|
|
return 0;
|
||
|
|
case 20:
|
||
|
|
Object[] objArr9 = this.r;
|
||
|
|
int i26 = this.n;
|
||
|
|
objArr9[i26] = objArr9[6];
|
||
|
|
this.n = i26 + 2;
|
||
|
|
objArr9[i26 + 1] = objArr9[7];
|
||
|
|
return 0;
|
||
|
|
case 21:
|
||
|
|
Object[] objArr10 = this.r;
|
||
|
|
int i27 = this.n;
|
||
|
|
this.n = i27 + 1;
|
||
|
|
objArr10[i27] = objArr10[7];
|
||
|
|
return 0;
|
||
|
|
case 22:
|
||
|
|
this.e = this.l[this.n - 1];
|
||
|
|
return 0;
|
||
|
|
case 23:
|
||
|
|
int[] iArr9 = this.l;
|
||
|
|
int i28 = this.n;
|
||
|
|
iArr9[i28] = 2;
|
||
|
|
int i29 = i28 + 1;
|
||
|
|
iArr9[i29] = 2;
|
||
|
|
this.n = i29;
|
||
|
|
iArr9[i28] = iArr9[i28] % 2;
|
||
|
|
return 0;
|
||
|
|
case 25:
|
||
|
|
int[] iArr10 = this.l;
|
||
|
|
int i30 = this.n;
|
||
|
|
iArr10[i30] = 117;
|
||
|
|
int i31 = i30 - 1;
|
||
|
|
int i32 = iArr10[i31] + 117;
|
||
|
|
iArr10[i31] = i32;
|
||
|
|
this.n = i30 + 1;
|
||
|
|
iArr10[i30] = i32;
|
||
|
|
case 24:
|
||
|
|
return 0;
|
||
|
|
case 26:
|
||
|
|
int[] iArr11 = this.l;
|
||
|
|
int i33 = this.n;
|
||
|
|
iArr11[i33] = 128;
|
||
|
|
this.n = i33;
|
||
|
|
int i34 = i33 - 1;
|
||
|
|
iArr11[i34] = iArr11[i34] % 128;
|
||
|
|
return 0;
|
||
|
|
case 27:
|
||
|
|
int[] iArr12 = this.l;
|
||
|
|
int i35 = this.n;
|
||
|
|
this.n = i35 + 1;
|
||
|
|
iArr12[i35] = 2;
|
||
|
|
return 0;
|
||
|
|
case 28:
|
||
|
|
int i36 = this.n - 1;
|
||
|
|
this.n = i36;
|
||
|
|
this.e = this.l[i36] == 0 ? 0 : 1;
|
||
|
|
return 0;
|
||
|
|
case 29:
|
||
|
|
int i37 = this.n;
|
||
|
|
int i38 = i37 - 1;
|
||
|
|
this.n = i38;
|
||
|
|
int[] iArr13 = this.l;
|
||
|
|
int i39 = i37 - 2;
|
||
|
|
iArr13[i39] = iArr13[i39] % iArr13[i38];
|
||
|
|
return 0;
|
||
|
|
case 30:
|
||
|
|
int[] iArr14 = this.l;
|
||
|
|
int i40 = this.n;
|
||
|
|
iArr14[i40] = 91;
|
||
|
|
int i41 = i40 - 1;
|
||
|
|
int i42 = iArr14[i41] + 91;
|
||
|
|
iArr14[i41] = i42;
|
||
|
|
this.n = i40 + 1;
|
||
|
|
iArr14[i40] = i42;
|
||
|
|
return 0;
|
||
|
|
case 31:
|
||
|
|
Object[] objArr11 = this.r;
|
||
|
|
int i43 = this.n - 1;
|
||
|
|
Object obj7 = objArr11[i43];
|
||
|
|
objArr11[i43] = null;
|
||
|
|
this.f = obj7;
|
||
|
|
return 0;
|
||
|
|
case 32:
|
||
|
|
Object[] objArr12 = this.r;
|
||
|
|
int i44 = this.n;
|
||
|
|
this.n = i44 + 1;
|
||
|
|
objArr12[i44] = null;
|
||
|
|
return 0;
|
||
|
|
case 33:
|
||
|
|
int[] iArr15 = this.l;
|
||
|
|
int i45 = this.n;
|
||
|
|
Object[] objArr13 = this.r;
|
||
|
|
int i46 = i45 - 1;
|
||
|
|
Object obj8 = objArr13[i46];
|
||
|
|
objArr13[i46] = null;
|
||
|
|
iArr15[i46] = ((int[]) obj8).length;
|
||
|
|
int i47 = i45 - 1;
|
||
|
|
this.n = i47;
|
||
|
|
objArr13[i47] = null;
|
||
|
|
return 0;
|
||
|
|
case 34:
|
||
|
|
for (int i48 = this.n - 1; i48 >= 0; i48--) {
|
||
|
|
this.r[i48] = null;
|
||
|
|
}
|
||
|
|
Object[] objArr14 = this.r;
|
||
|
|
this.n = 1;
|
||
|
|
objArr14[0] = this.h;
|
||
|
|
return 0;
|
||
|
|
default:
|
||
|
|
return i;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public dj(Object obj, Object obj2, int i) {
|
||
|
|
int[] iArr = new int[10];
|
||
|
|
this.l = iArr;
|
||
|
|
Object[] objArr = new Object[10];
|
||
|
|
this.r = objArr;
|
||
|
|
objArr[6] = obj;
|
||
|
|
objArr[7] = obj2;
|
||
|
|
iArr[8] = i;
|
||
|
|
this.n = 0;
|
||
|
|
this.k = -1;
|
||
|
|
}
|
||
|
|
}
|