63 lines
1.5 KiB
Java
63 lines
1.5 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
/* loaded from: classes2.dex */
|
||
|
|
public enum JLe {
|
||
|
|
TERMINATOR(new int[]{0, 0, 0}, 0),
|
||
|
|
NUMERIC(new int[]{10, 12, 14}, 1),
|
||
|
|
ALPHANUMERIC(new int[]{9, 11, 13}, 2),
|
||
|
|
STRUCTURED_APPEND(new int[]{0, 0, 0}, 3),
|
||
|
|
BYTE(new int[]{8, 16, 16}, 4),
|
||
|
|
ECI(new int[]{0, 0, 0}, 7),
|
||
|
|
KANJI(new int[]{8, 10, 12}, 8),
|
||
|
|
FNC1_FIRST_POSITION(new int[]{0, 0, 0}, 5),
|
||
|
|
FNC1_SECOND_POSITION(new int[]{0, 0, 0}, 9),
|
||
|
|
HANZI(new int[]{8, 10, 12}, 13);
|
||
|
|
|
||
|
|
public final int bits;
|
||
|
|
private final int[] characterCountBitsForVersions;
|
||
|
|
|
||
|
|
JLe(int[] iArr, int i) {
|
||
|
|
this.characterCountBitsForVersions = iArr;
|
||
|
|
this.bits = i;
|
||
|
|
}
|
||
|
|
|
||
|
|
public static JLe a(int i) {
|
||
|
|
if (i == 0) {
|
||
|
|
return TERMINATOR;
|
||
|
|
}
|
||
|
|
if (i == 1) {
|
||
|
|
return NUMERIC;
|
||
|
|
}
|
||
|
|
if (i == 2) {
|
||
|
|
return ALPHANUMERIC;
|
||
|
|
}
|
||
|
|
if (i == 3) {
|
||
|
|
return STRUCTURED_APPEND;
|
||
|
|
}
|
||
|
|
if (i == 4) {
|
||
|
|
return BYTE;
|
||
|
|
}
|
||
|
|
if (i == 5) {
|
||
|
|
return FNC1_FIRST_POSITION;
|
||
|
|
}
|
||
|
|
if (i == 7) {
|
||
|
|
return ECI;
|
||
|
|
}
|
||
|
|
if (i == 8) {
|
||
|
|
return KANJI;
|
||
|
|
}
|
||
|
|
if (i == 9) {
|
||
|
|
return FNC1_SECOND_POSITION;
|
||
|
|
}
|
||
|
|
if (i == 13) {
|
||
|
|
return HANZI;
|
||
|
|
}
|
||
|
|
throw new IllegalArgumentException();
|
||
|
|
}
|
||
|
|
|
||
|
|
public final int c(C0480Hnn c0480Hnn) {
|
||
|
|
int i = c0480Hnn.e;
|
||
|
|
return this.characterCountBitsForVersions[i <= 9 ? (char) 0 : i <= 26 ? (char) 1 : (char) 2];
|
||
|
|
}
|
||
|
|
}
|