package o;

/* renamed from: o.tlL, reason: case insensitive filesystem */
/* loaded from: classes2.dex */
public final class C17084tlL extends xue {
    static final char[] c = "0123456789-$:/.+ABCD".toCharArray();
    static final int[] d = {3, 6, 9, 96, 18, 66, 33, 36, 48, 72, 12, 24, 69, 81, 84, 21, 26, 41, 11, 14};
    private static final char[] a = {'A', 'B', 'C', 'D'};
    private final StringBuilder f = new StringBuilder(20);
    private int[] b = new int[80];
    private int e = 0;

    /* JADX WARN: Code restructure failed: missing block: B:148:0x0246, code lost:
    
        continue;
     */
    @Override // o.xue
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    public final o.WFF d(int r18, o.C17416wdP r19, java.util.Map<o.CGg, ?> r20) throws com.google.zxing.NotFoundException {
        /*
            Method dump skipped, instructions count: 600
            To view this dump add '--comments-level debug' option
        */
        throw new UnsupportedOperationException("Method not decompiled: o.C17084tlL.d(int, o.wdP, java.util.Map):o.WFF");
    }

    private void b(int i) {
        int[] iArr = this.b;
        int i2 = this.e;
        iArr[i2] = i;
        int i3 = i2 + 1;
        this.e = i3;
        if (i3 >= iArr.length) {
            int[] iArr2 = new int[i3 << 1];
            System.arraycopy(iArr, 0, iArr2, 0, i3);
            this.b = iArr2;
        }
    }

    /* JADX INFO: Access modifiers changed from: package-private */
    public static boolean a(char[] cArr, char c2) {
        if (cArr != null) {
            for (char c3 : cArr) {
                if (c3 == c2) {
                    return true;
                }
            }
        }
        return false;
    }

    private int c(int i) {
        int i2 = i + 7;
        if (i2 >= this.e) {
            return -1;
        }
        int[] iArr = this.b;
        int i3 = Integer.MAX_VALUE;
        int i4 = 0;
        int i5 = Integer.MAX_VALUE;
        int i6 = 0;
        for (int i7 = i; i7 < i2; i7 += 2) {
            int i8 = iArr[i7];
            if (i8 < i5) {
                i5 = i8;
            }
            if (i8 > i6) {
                i6 = i8;
            }
        }
        int i9 = (i5 + i6) / 2;
        int i10 = 0;
        for (int i11 = i + 1; i11 < i2; i11 += 2) {
            int i12 = iArr[i11];
            if (i12 < i3) {
                i3 = i12;
            }
            if (i12 > i10) {
                i10 = i12;
            }
        }
        int i13 = (i3 + i10) / 2;
        int i14 = 128;
        int i15 = 0;
        for (int i16 = 0; i16 < 7; i16++) {
            i14 >>= 1;
            if (iArr[i + i16] > ((i16 & 1) == 0 ? i9 : i13)) {
                i15 |= i14;
            }
        }
        while (true) {
            int[] iArr2 = d;
            if (i4 >= iArr2.length) {
                return -1;
            }
            if (iArr2[i4] == i15) {
                return i4;
            }
            i4++;
        }
    }
}