208 lines
7.8 KiB
Java
208 lines
7.8 KiB
Java
package o;
|
|
|
|
import com.google.zxing.NotFoundException;
|
|
import java.util.ArrayList;
|
|
import java.util.Collection;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
import org.bouncycastle.crypto.tls.CipherSuite;
|
|
|
|
/* loaded from: classes2.dex */
|
|
public final class Ycl extends AYU {
|
|
private final List<Qht> h = new ArrayList();
|
|
private final List<Qht> i = new ArrayList();
|
|
private static final int[] d = {1, 10, 34, 70, 126};
|
|
private static final int[] a = {4, 20, 48, 81};
|
|
private static final int[] g = {0, CipherSuite.TLS_DH_RSA_WITH_AES_256_GCM_SHA384, 961, 2015, 2715};
|
|
private static final int[] b = {0, 336, 1036, 1516};
|
|
private static final int[] f = {8, 6, 4, 3, 1};
|
|
private static final int[] c = {2, 4, 6, 8};
|
|
private static final int[][] e = {new int[]{3, 8, 2, 1}, new int[]{3, 5, 5, 1}, new int[]{3, 3, 7, 1}, new int[]{3, 1, 9, 1}, new int[]{2, 7, 4, 1}, new int[]{2, 5, 6, 1}, new int[]{2, 3, 8, 1}, new int[]{1, 5, 7, 1}, new int[]{1, 3, 9, 1}};
|
|
|
|
@Override // o.xue
|
|
public final WFF d(int i, C17416wdP c17416wdP, Map<CGg, ?> map) throws NotFoundException {
|
|
d(this.h, e(c17416wdP, false, i, map));
|
|
c17416wdP.c();
|
|
d(this.i, e(c17416wdP, true, i, map));
|
|
c17416wdP.c();
|
|
for (Qht qht : this.h) {
|
|
if (qht.c > 1) {
|
|
for (Qht qht2 : this.i) {
|
|
if (qht2.c > 1) {
|
|
int i2 = qht.a;
|
|
int i3 = qht2.a;
|
|
int i4 = (qht.e.e * 9) + qht2.e.e;
|
|
if (i4 > 72) {
|
|
i4--;
|
|
}
|
|
if (i4 > 8) {
|
|
i4--;
|
|
}
|
|
if ((i2 + (i3 << 4)) % 79 == i4) {
|
|
String valueOf = String.valueOf((qht.d * 4537077) + qht2.d);
|
|
StringBuilder sb = new StringBuilder(14);
|
|
for (int length = 13 - valueOf.length(); length > 0; length--) {
|
|
sb.append('0');
|
|
}
|
|
sb.append(valueOf);
|
|
int i5 = 0;
|
|
for (int i6 = 0; i6 < 13; i6++) {
|
|
int charAt = sb.charAt(i6) - '0';
|
|
if ((i6 & 1) == 0) {
|
|
charAt *= 3;
|
|
}
|
|
i5 += charAt;
|
|
}
|
|
int i7 = 10 - (i5 % 10);
|
|
if (i7 == 10) {
|
|
i7 = 0;
|
|
}
|
|
sb.append(i7);
|
|
qCz[] qczArr = qht.e.d;
|
|
qCz[] qczArr2 = qht2.e.d;
|
|
WFF wff = new WFF(sb.toString(), null, new qCz[]{qczArr[0], qczArr[1], qczArr2[0], qczArr2[1]}, PTS.RSS_14);
|
|
wff.b(MoF.SYMBOLOGY_IDENTIFIER, "]e0");
|
|
return wff;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
throw NotFoundException.b();
|
|
}
|
|
|
|
private static void d(Collection<Qht> collection, Qht qht) {
|
|
if (qht == null) {
|
|
return;
|
|
}
|
|
for (Qht qht2 : collection) {
|
|
if (qht2.d == qht.d) {
|
|
qht2.c++;
|
|
return;
|
|
}
|
|
}
|
|
collection.add(qht);
|
|
}
|
|
|
|
@Override // o.xue, o.zIz
|
|
public final void c() {
|
|
this.h.clear();
|
|
this.i.clear();
|
|
}
|
|
|
|
/* JADX WARN: Code restructure failed: missing block: B:126:0x00cf, code lost:
|
|
|
|
r14 = false;
|
|
r13 = true;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:135:0x00cd, code lost:
|
|
|
|
if (r10 < 4) goto L55;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:40:0x00b6, code lost:
|
|
|
|
if (r10 < 4) goto L55;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:41:0x00d2, code lost:
|
|
|
|
r13 = false;
|
|
r14 = false;
|
|
*/
|
|
/*
|
|
Code decompiled incorrectly, please refer to instructions dump.
|
|
To view partially-correct add '--show-bad-code' argument
|
|
*/
|
|
private o.RHO b(o.C17416wdP r17, o.C17296vbq r18, boolean r19) throws com.google.zxing.NotFoundException {
|
|
/*
|
|
Method dump skipped, instructions count: 506
|
|
To view this dump add '--comments-level debug' option
|
|
*/
|
|
throw new UnsupportedOperationException("Method not decompiled: o.Ycl.b(o.wdP, o.vbq, boolean):o.RHO");
|
|
}
|
|
|
|
private Qht e(C17416wdP c17416wdP, boolean z, int i, Map<CGg, ?> map) {
|
|
int i2;
|
|
int i3;
|
|
try {
|
|
int[] d2 = d();
|
|
d2[0] = 0;
|
|
d2[1] = 0;
|
|
d2[2] = 0;
|
|
d2[3] = 0;
|
|
int i4 = c17416wdP.d;
|
|
int i5 = 0;
|
|
boolean z2 = false;
|
|
while (i5 < i4) {
|
|
z2 = !((c17416wdP.a[i5 / 32] & (1 << (i5 & 31))) != 0);
|
|
if (z == z2) {
|
|
break;
|
|
}
|
|
i5++;
|
|
}
|
|
int i6 = 0;
|
|
boolean z3 = z2;
|
|
int i7 = i5;
|
|
while (i5 < i4) {
|
|
if ((((1 << (i5 & 31)) & c17416wdP.a[i5 / 32]) != 0) != z3) {
|
|
d2[i6] = d2[i6] + 1;
|
|
} else {
|
|
if (i6 != 3) {
|
|
i6++;
|
|
} else if (!b(d2)) {
|
|
i7 += d2[0] + d2[1];
|
|
d2[0] = d2[2];
|
|
d2[1] = d2[3];
|
|
d2[2] = 0;
|
|
d2[3] = 0;
|
|
i6--;
|
|
} else {
|
|
int[] iArr = {i7, i5};
|
|
int i8 = iArr[0];
|
|
boolean z4 = ((1 << (i8 & 31)) & c17416wdP.a[i8 / 32]) != 0;
|
|
int i9 = iArr[0] - 1;
|
|
while (i9 >= 0) {
|
|
if (z4 == ((c17416wdP.a[i9 / 32] & (1 << (i9 & 31))) != 0)) {
|
|
break;
|
|
}
|
|
i9--;
|
|
}
|
|
int i10 = i9 + 1;
|
|
int i11 = iArr[0];
|
|
int[] d3 = d();
|
|
System.arraycopy(d3, 0, d3, 1, d3.length - 1);
|
|
d3[0] = i11 - i10;
|
|
int c2 = c(d3, e);
|
|
int i12 = iArr[1];
|
|
if (z) {
|
|
i3 = (c17416wdP.d - 1) - i10;
|
|
i2 = (c17416wdP.d - 1) - i12;
|
|
} else {
|
|
i2 = i12;
|
|
i3 = i10;
|
|
}
|
|
C17296vbq c17296vbq = new C17296vbq(c2, new int[]{i10, iArr[1]}, i3, i2, i);
|
|
pgq pgqVar = map == null ? null : (pgq) map.get(CGg.NEED_RESULT_POINT_CALLBACK);
|
|
if (pgqVar != null) {
|
|
int[] iArr2 = c17296vbq.b;
|
|
float f2 = ((iArr2[0] + iArr2[1]) - 1) / 2.0f;
|
|
if (z) {
|
|
f2 = (c17416wdP.d - 1) - f2;
|
|
}
|
|
pgqVar.a(new qCz(f2, i));
|
|
}
|
|
RHO b2 = b(c17416wdP, c17296vbq, true);
|
|
RHO b3 = b(c17416wdP, c17296vbq, false);
|
|
return new Qht((b2.d * 1597) + b3.d, b2.a + (b3.a << 2), c17296vbq);
|
|
}
|
|
d2[i6] = 1;
|
|
z3 = !z3;
|
|
}
|
|
i5++;
|
|
}
|
|
throw NotFoundException.b();
|
|
} catch (NotFoundException unused) {
|
|
return null;
|
|
}
|
|
}
|
|
}
|