111 lines
3.6 KiB
Java
111 lines
3.6 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
import java.lang.reflect.Array;
|
||
|
|
import java.nio.charset.Charset;
|
||
|
|
import java.util.Arrays;
|
||
|
|
import java.util.Collection;
|
||
|
|
import java.util.Iterator;
|
||
|
|
import java.util.LinkedList;
|
||
|
|
|
||
|
|
/* renamed from: o.kTV, reason: case insensitive filesystem */
|
||
|
|
/* loaded from: classes2.dex */
|
||
|
|
public final class C16011kTV {
|
||
|
|
static final int[][] a;
|
||
|
|
static final int[][] d;
|
||
|
|
final Charset e;
|
||
|
|
final byte[] g;
|
||
|
|
static final String[] c = {"UPPER", "LOWER", "DIGIT", "MIXED", "PUNCT"};
|
||
|
|
static final int[][] b = {new int[]{0, 327708, 327710, 327709, 656318}, new int[]{590318, 0, 327710, 327709, 656318}, new int[]{262158, 590300, 0, 590301, 932798}, new int[]{327709, 327708, 656318, 0, 327710}, new int[]{327711, 656380, 656382, 656381, 0}};
|
||
|
|
|
||
|
|
static {
|
||
|
|
int[][] iArr = (int[][]) Array.newInstance((Class<?>) Integer.TYPE, 5, 256);
|
||
|
|
d = iArr;
|
||
|
|
iArr[0][32] = 1;
|
||
|
|
for (int i = 65; i <= 90; i++) {
|
||
|
|
d[0][i] = i - 63;
|
||
|
|
}
|
||
|
|
d[1][32] = 1;
|
||
|
|
for (int i2 = 97; i2 <= 122; i2++) {
|
||
|
|
d[1][i2] = i2 - 95;
|
||
|
|
}
|
||
|
|
d[2][32] = 1;
|
||
|
|
for (int i3 = 48; i3 <= 57; i3++) {
|
||
|
|
d[2][i3] = i3 - 46;
|
||
|
|
}
|
||
|
|
int[] iArr2 = d[2];
|
||
|
|
iArr2[44] = 12;
|
||
|
|
iArr2[46] = 13;
|
||
|
|
int[] iArr3 = {0, 32, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 27, 28, 29, 30, 31, 64, 92, 94, 95, 96, 124, 126, 127};
|
||
|
|
for (int i4 = 0; i4 < 28; i4++) {
|
||
|
|
d[3][iArr3[i4]] = i4;
|
||
|
|
}
|
||
|
|
int[] iArr4 = {0, 13, 0, 0, 0, 0, 33, 39, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 58, 59, 60, 61, 62, 63, 91, 93, 123, 125};
|
||
|
|
for (int i5 = 0; i5 < 31; i5++) {
|
||
|
|
int i6 = iArr4[i5];
|
||
|
|
if (i6 > 0) {
|
||
|
|
d[4][i6] = i5;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int[][] iArr5 = (int[][]) Array.newInstance((Class<?>) Integer.TYPE, 6, 6);
|
||
|
|
a = iArr5;
|
||
|
|
for (int[] iArr6 : iArr5) {
|
||
|
|
Arrays.fill(iArr6, -1);
|
||
|
|
}
|
||
|
|
int[][] iArr7 = a;
|
||
|
|
iArr7[0][4] = 0;
|
||
|
|
int[] iArr8 = iArr7[1];
|
||
|
|
iArr8[4] = 0;
|
||
|
|
iArr8[0] = 28;
|
||
|
|
iArr7[3][4] = 0;
|
||
|
|
int[] iArr9 = iArr7[2];
|
||
|
|
iArr9[4] = 0;
|
||
|
|
iArr9[0] = 15;
|
||
|
|
}
|
||
|
|
|
||
|
|
public C16011kTV(byte[] bArr, Charset charset) {
|
||
|
|
this.g = bArr;
|
||
|
|
this.e = charset;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
||
|
|
public static Collection<Poe> b(Iterable<Poe> iterable, int i, int i2) {
|
||
|
|
LinkedList linkedList = new LinkedList();
|
||
|
|
for (Poe poe : iterable) {
|
||
|
|
Poe e = poe.e(i);
|
||
|
|
linkedList.add(e.a(4, i2));
|
||
|
|
if (poe.d != 4) {
|
||
|
|
linkedList.add(e.e(4, i2));
|
||
|
|
}
|
||
|
|
if (i2 == 3 || i2 == 4) {
|
||
|
|
linkedList.add(e.a(2, 16 - i2).a(2, 1));
|
||
|
|
}
|
||
|
|
if (poe.c > 0) {
|
||
|
|
linkedList.add(poe.b(i).b(i + 1));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return e(linkedList);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX INFO: Access modifiers changed from: package-private */
|
||
|
|
public static Collection<Poe> e(Iterable<Poe> iterable) {
|
||
|
|
LinkedList linkedList = new LinkedList();
|
||
|
|
for (Poe poe : iterable) {
|
||
|
|
Iterator it = linkedList.iterator();
|
||
|
|
while (true) {
|
||
|
|
if (it.hasNext()) {
|
||
|
|
Poe poe2 = (Poe) it.next();
|
||
|
|
if (!poe2.b(poe)) {
|
||
|
|
if (poe.b(poe2)) {
|
||
|
|
it.remove();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
linkedList.addFirst(poe);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return linkedList;
|
||
|
|
}
|
||
|
|
}
|