33 lines
1.0 KiB
Java
33 lines
1.0 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
import com.google.common.primitives.UnsignedBytes;
|
||
|
|
import com.google.zxing.ChecksumException;
|
||
|
|
import com.google.zxing.common.reedsolomon.ReedSolomonException;
|
||
|
|
|
||
|
|
/* renamed from: o.pnF, reason: case insensitive filesystem */
|
||
|
|
/* loaded from: classes2.dex */
|
||
|
|
public final class C16625pnF {
|
||
|
|
private final lxg a = new lxg(Ayo.g);
|
||
|
|
|
||
|
|
public final void e(byte[] bArr, int i, int i2, int i3, int i4) throws ChecksumException {
|
||
|
|
int i5 = i2 + i3;
|
||
|
|
int i6 = i4 == 0 ? 1 : 2;
|
||
|
|
int[] iArr = new int[i5 / i6];
|
||
|
|
for (int i7 = 0; i7 < i5; i7++) {
|
||
|
|
if (i4 == 0 || i7 % 2 == i4 - 1) {
|
||
|
|
iArr[i7 / i6] = bArr[i7 + i] & UnsignedBytes.MAX_VALUE;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
try {
|
||
|
|
this.a.b(iArr, i3 / i6);
|
||
|
|
for (int i8 = 0; i8 < i2; i8++) {
|
||
|
|
if (i4 == 0 || i8 % 2 == i4 - 1) {
|
||
|
|
bArr[i8 + i] = (byte) iArr[i8 / i6];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} catch (ReedSolomonException unused) {
|
||
|
|
throw ChecksumException.e();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|