359 lines
14 KiB
Java
359 lines
14 KiB
Java
package o;
|
|
|
|
import com.airbnb.deeplinkdispatch.UrlTreeKt;
|
|
import com.google.zxing.FormatException;
|
|
import com.google.zxing.NotFoundException;
|
|
import o.BBv;
|
|
|
|
/* loaded from: classes2.dex */
|
|
public final class itT {
|
|
final C17416wdP c;
|
|
private final BBv b = new BBv();
|
|
private final StringBuilder e = new StringBuilder();
|
|
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
|
public itT(C17416wdP c17416wdP) {
|
|
this.c = c17416wdP;
|
|
}
|
|
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
|
public final String b(StringBuilder sb, int i) throws NotFoundException, FormatException {
|
|
String str = null;
|
|
while (true) {
|
|
mBQ b = b(i, str);
|
|
String d = C17250vHy.d(b.c);
|
|
if (d != null) {
|
|
sb.append(d);
|
|
}
|
|
String valueOf = b.a ? String.valueOf(b.d) : null;
|
|
if (i == b.b) {
|
|
return sb.toString();
|
|
}
|
|
i = b.b;
|
|
str = valueOf;
|
|
}
|
|
}
|
|
|
|
public static int d(C17416wdP c17416wdP, int i, int i2) {
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < i2; i4++) {
|
|
int i5 = i + i4;
|
|
if (((1 << (i5 & 31)) & c17416wdP.a[i5 / 32]) != 0) {
|
|
i3 |= 1 << ((i2 - i4) - 1);
|
|
}
|
|
}
|
|
return i3;
|
|
}
|
|
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
|
public final mBQ b(int i, String str) throws FormatException {
|
|
this.e.setLength(0);
|
|
if (str != null) {
|
|
this.e.append(str);
|
|
}
|
|
this.b.c = i;
|
|
mBQ c = c();
|
|
if (c != null && c.a) {
|
|
return new mBQ(this.b.c, this.e.toString(), c.d);
|
|
}
|
|
return new mBQ(this.b.c, this.e.toString());
|
|
}
|
|
|
|
private boolean b(int i) {
|
|
int i2 = i + 3;
|
|
if (i2 > this.c.d) {
|
|
return false;
|
|
}
|
|
while (i < i2) {
|
|
if (((1 << (i & 31)) & this.c.a[i / 32]) != 0) {
|
|
return false;
|
|
}
|
|
i++;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
private boolean c(int i) {
|
|
int i2;
|
|
if (i + 1 > this.c.d) {
|
|
return false;
|
|
}
|
|
for (int i3 = 0; i3 < 5 && (i2 = i3 + i) < this.c.d; i3++) {
|
|
if (i3 == 2) {
|
|
int i4 = i + 2;
|
|
if ((this.c.a[i4 / 32] & (1 << (i4 & 31))) == 0) {
|
|
return false;
|
|
}
|
|
} else if (((1 << (i2 & 31)) & this.c.a[i2 / 32]) != 0) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
private mBQ c() throws FormatException {
|
|
mgN mgn;
|
|
boolean z;
|
|
jxp jxpVar;
|
|
mBQ mbq;
|
|
int d;
|
|
int d2;
|
|
int d3;
|
|
char c;
|
|
OHf oHf;
|
|
OHf oHf2;
|
|
int d4;
|
|
int d5;
|
|
char c2;
|
|
OHf oHf3;
|
|
OHf oHf4;
|
|
do {
|
|
int i = this.b.c;
|
|
if (this.b.b == BBv.HBt.ALPHA) {
|
|
while (true) {
|
|
int i2 = this.b.c;
|
|
if (i2 + 5 <= this.c.d && (((d4 = d(this.c, i2, 5)) >= 5 && d4 < 16) || (i2 + 6 <= this.c.d && (d5 = d(this.c, i2, 6)) >= 16 && d5 < 63))) {
|
|
int i3 = this.b.c;
|
|
int d6 = d(this.c, i3, 5);
|
|
if (d6 == 15) {
|
|
oHf4 = new OHf(i3 + 5, '$');
|
|
} else {
|
|
if (d6 >= 5 && d6 < 15) {
|
|
oHf3 = new OHf(i3 + 5, (char) (d6 + 43));
|
|
} else {
|
|
int d7 = d(this.c, i3, 6);
|
|
if (d7 >= 32 && d7 < 58) {
|
|
oHf3 = new OHf(i3 + 6, (char) (d7 + 33));
|
|
} else {
|
|
switch (d7) {
|
|
case 58:
|
|
c2 = '*';
|
|
break;
|
|
case 59:
|
|
c2 = ',';
|
|
break;
|
|
case 60:
|
|
c2 = '-';
|
|
break;
|
|
case 61:
|
|
c2 = '.';
|
|
break;
|
|
case 62:
|
|
c2 = '/';
|
|
break;
|
|
default:
|
|
throw new IllegalStateException("Decoding invalid alphanumeric value: ".concat(String.valueOf(d7)));
|
|
}
|
|
oHf3 = new OHf(i3 + 6, c2);
|
|
}
|
|
}
|
|
oHf4 = oHf3;
|
|
}
|
|
this.b.c = oHf4.b;
|
|
if (oHf4.a == '$') {
|
|
mgn = new mgN(new mBQ(this.b.c, this.e.toString()), true);
|
|
} else {
|
|
this.e.append(oHf4.a);
|
|
}
|
|
}
|
|
}
|
|
if (!b(this.b.c)) {
|
|
if (c(this.b.c)) {
|
|
if (this.b.c + 5 < this.c.d) {
|
|
this.b.c += 5;
|
|
} else {
|
|
this.b.c = this.c.d;
|
|
}
|
|
this.b.b = BBv.HBt.ISO_IEC_646;
|
|
}
|
|
} else {
|
|
this.b.c += 3;
|
|
this.b.b = BBv.HBt.NUMERIC;
|
|
}
|
|
mgn = new mgN();
|
|
z = mgn.e;
|
|
} else if (this.b.b == BBv.HBt.ISO_IEC_646) {
|
|
while (true) {
|
|
int i4 = this.b.c;
|
|
if (i4 + 5 <= this.c.d && (((d = d(this.c, i4, 5)) >= 5 && d < 16) || (i4 + 7 <= this.c.d && (((d2 = d(this.c, i4, 7)) >= 64 && d2 < 116) || (i4 + 8 <= this.c.d && (d3 = d(this.c, i4, 8)) >= 232 && d3 < 253))))) {
|
|
int i5 = this.b.c;
|
|
int d8 = d(this.c, i5, 5);
|
|
if (d8 == 15) {
|
|
oHf2 = new OHf(i5 + 5, '$');
|
|
} else {
|
|
if (d8 >= 5 && d8 < 15) {
|
|
oHf = new OHf(i5 + 5, (char) (d8 + 43));
|
|
} else {
|
|
int d9 = d(this.c, i5, 7);
|
|
if (d9 >= 64 && d9 < 90) {
|
|
oHf = new OHf(i5 + 7, (char) (d9 + 1));
|
|
} else if (d9 >= 90 && d9 < 116) {
|
|
oHf = new OHf(i5 + 7, (char) (d9 + 7));
|
|
} else {
|
|
switch (d(this.c, i5, 8)) {
|
|
case 232:
|
|
c = '!';
|
|
break;
|
|
case 233:
|
|
c = '\"';
|
|
break;
|
|
case 234:
|
|
c = '%';
|
|
break;
|
|
case 235:
|
|
c = '&';
|
|
break;
|
|
case 236:
|
|
c = '\'';
|
|
break;
|
|
case 237:
|
|
c = '(';
|
|
break;
|
|
case 238:
|
|
c = ')';
|
|
break;
|
|
case 239:
|
|
c = '*';
|
|
break;
|
|
case 240:
|
|
c = '+';
|
|
break;
|
|
case 241:
|
|
c = ',';
|
|
break;
|
|
case 242:
|
|
c = '-';
|
|
break;
|
|
case 243:
|
|
c = '.';
|
|
break;
|
|
case 244:
|
|
c = '/';
|
|
break;
|
|
case 245:
|
|
c = ':';
|
|
break;
|
|
case 246:
|
|
c = ';';
|
|
break;
|
|
case 247:
|
|
c = UrlTreeKt.configurablePathSegmentPrefixChar;
|
|
break;
|
|
case 248:
|
|
c = '=';
|
|
break;
|
|
case 249:
|
|
c = UrlTreeKt.configurablePathSegmentSuffixChar;
|
|
break;
|
|
case 250:
|
|
c = '?';
|
|
break;
|
|
case 251:
|
|
c = '_';
|
|
break;
|
|
case 252:
|
|
c = ' ';
|
|
break;
|
|
default:
|
|
throw FormatException.c();
|
|
}
|
|
oHf = new OHf(i5 + 8, c);
|
|
}
|
|
}
|
|
oHf2 = oHf;
|
|
}
|
|
this.b.c = oHf2.b;
|
|
if (oHf2.a == '$') {
|
|
mgn = new mgN(new mBQ(this.b.c, this.e.toString()), true);
|
|
} else {
|
|
this.e.append(oHf2.a);
|
|
}
|
|
}
|
|
}
|
|
if (!b(this.b.c)) {
|
|
if (c(this.b.c)) {
|
|
if (this.b.c + 5 < this.c.d) {
|
|
this.b.c += 5;
|
|
} else {
|
|
this.b.c = this.c.d;
|
|
}
|
|
this.b.b = BBv.HBt.ALPHA;
|
|
}
|
|
} else {
|
|
this.b.c += 3;
|
|
this.b.b = BBv.HBt.NUMERIC;
|
|
}
|
|
mgn = new mgN();
|
|
z = mgn.e;
|
|
} else {
|
|
while (true) {
|
|
int i6 = this.b.c;
|
|
if (i6 + 7 > this.c.d) {
|
|
if (i6 + 4 > this.c.d) {
|
|
}
|
|
int i7 = this.b.c;
|
|
int i8 = i7 + 7;
|
|
if (i8 > this.c.d) {
|
|
int d10 = d(this.c, i7, 4);
|
|
if (d10 == 0) {
|
|
jxpVar = new jxp(this.c.d, 10, 10);
|
|
} else {
|
|
jxpVar = new jxp(this.c.d, d10 - 1, 10);
|
|
}
|
|
} else {
|
|
int d11 = d(this.c, i7, 7) - 8;
|
|
jxpVar = new jxp(i8, d11 / 11, d11 % 11);
|
|
}
|
|
this.b.c = jxpVar.b;
|
|
if (jxpVar.a == 10) {
|
|
if (jxpVar.e == 10) {
|
|
mbq = new mBQ(this.b.c, this.e.toString());
|
|
} else {
|
|
mbq = new mBQ(this.b.c, this.e.toString(), jxpVar.e);
|
|
}
|
|
mgn = new mgN(mbq, true);
|
|
} else {
|
|
this.e.append(jxpVar.a);
|
|
if (jxpVar.e == 10) {
|
|
mgn = new mgN(new mBQ(this.b.c, this.e.toString()), true);
|
|
} else {
|
|
this.e.append(jxpVar.e);
|
|
}
|
|
}
|
|
} else {
|
|
int i9 = i6;
|
|
while (true) {
|
|
int i10 = i6 + 3;
|
|
if (i9 < i10) {
|
|
if ((this.c.a[i9 / 32] & (1 << (i9 & 31))) == 0) {
|
|
i9++;
|
|
}
|
|
} else if ((this.c.a[i10 / 32] & (1 << (i10 & 31))) == 0) {
|
|
}
|
|
}
|
|
}
|
|
}
|
|
int i11 = this.b.c;
|
|
if (i11 + 1 <= this.c.d) {
|
|
for (int i12 = 0; i12 < 4; i12++) {
|
|
int i13 = i12 + i11;
|
|
if (i13 >= this.c.d) {
|
|
this.b.b = BBv.HBt.ALPHA;
|
|
this.b.c += 4;
|
|
} else if (((1 << (i13 & 31)) & this.c.a[i13 / 32]) == 0) {
|
|
}
|
|
}
|
|
this.b.b = BBv.HBt.ALPHA;
|
|
this.b.c += 4;
|
|
}
|
|
mgn = new mgN();
|
|
z = mgn.e;
|
|
}
|
|
if (i != this.b.c || z) {
|
|
}
|
|
return mgn.c;
|
|
} while (!z);
|
|
return mgn.c;
|
|
}
|
|
}
|