93 lines
2.7 KiB
Java
93 lines
2.7 KiB
Java
package c.i.e.q;
|
|
|
|
import c.i.e.n.a;
|
|
import com.google.zxing.FormatException;
|
|
import com.google.zxing.NotFoundException;
|
|
/* compiled from: UPCEReader */
|
|
public final class q extends p {
|
|
public static final int[] h = {1, 1, 1, 1, 1, 1};
|
|
public static final int[][] i = {new int[]{56, 52, 50, 49, 44, 38, 35, 42, 41, 37}, new int[]{7, 11, 13, 14, 19, 25, 28, 21, 22, 26}};
|
|
public final int[] j = new int[4];
|
|
|
|
@Override // c.i.e.q.p
|
|
public boolean g(String str) throws FormatException {
|
|
char[] cArr = new char[6];
|
|
str.getChars(1, 7, cArr, 0);
|
|
StringBuilder sb = new StringBuilder(12);
|
|
sb.append(str.charAt(0));
|
|
char c2 = cArr[5];
|
|
switch (c2) {
|
|
case '0':
|
|
case '1':
|
|
case '2':
|
|
sb.append(cArr, 0, 2);
|
|
sb.append(c2);
|
|
sb.append("0000");
|
|
sb.append(cArr, 2, 3);
|
|
break;
|
|
case '3':
|
|
sb.append(cArr, 0, 3);
|
|
sb.append("00000");
|
|
sb.append(cArr, 3, 2);
|
|
break;
|
|
case '4':
|
|
sb.append(cArr, 0, 4);
|
|
sb.append("00000");
|
|
sb.append(cArr[4]);
|
|
break;
|
|
default:
|
|
sb.append(cArr, 0, 5);
|
|
sb.append("0000");
|
|
sb.append(c2);
|
|
break;
|
|
}
|
|
if (str.length() >= 8) {
|
|
sb.append(str.charAt(7));
|
|
}
|
|
return super.g(sb.toString());
|
|
}
|
|
|
|
@Override // c.i.e.q.p
|
|
public int[] i(a aVar, int i2) throws NotFoundException {
|
|
int[] iArr = h;
|
|
return p.l(aVar, i2, true, iArr, new int[iArr.length]);
|
|
}
|
|
|
|
@Override // c.i.e.q.p
|
|
public int j(a aVar, int[] iArr, StringBuilder sb) throws NotFoundException {
|
|
int[] iArr2 = this.j;
|
|
iArr2[0] = 0;
|
|
iArr2[1] = 0;
|
|
iArr2[2] = 0;
|
|
iArr2[3] = 0;
|
|
int i2 = aVar.j;
|
|
int i3 = iArr[1];
|
|
int i4 = 0;
|
|
for (int i5 = 0; i5 < 6 && i3 < i2; i5++) {
|
|
int h2 = p.h(aVar, iArr2, i3, p.d);
|
|
sb.append((char) ((h2 % 10) + 48));
|
|
for (int i6 : iArr2) {
|
|
i3 += i6;
|
|
}
|
|
if (h2 >= 10) {
|
|
i4 |= 1 << (5 - i5);
|
|
}
|
|
}
|
|
for (int i7 = 0; i7 <= 1; i7++) {
|
|
for (int i8 = 0; i8 < 10; i8++) {
|
|
if (i4 == i[i7][i8]) {
|
|
sb.insert(0, (char) (i7 + 48));
|
|
sb.append((char) (i8 + 48));
|
|
return i3;
|
|
}
|
|
}
|
|
}
|
|
throw NotFoundException.k;
|
|
}
|
|
|
|
@Override // c.i.e.q.p
|
|
public c.i.e.a n() {
|
|
return c.i.e.a.UPC_E;
|
|
}
|
|
}
|