/*
 * Decompiled with CFR 0.152.
 */
package com.l7tech.server.jdbc;

import java.util.regex.Pattern;

class b {
    static final Pattern a;

    private b() {
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String string = b.a(29, b.a("NA>\u0003$Iz'_?\u0002/IeaG)\u00045\u0005sb\u0011uNo(H+vqHo[-l\u0003a:\u0019NK;\u0016\u0001?zHK;\u0002sKcZ"));
        a = Pattern.compile(string, 2);
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0xB);
        }
        return cArray;
    }

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String a(int n2, char[] cArray) {
        char[] cArray2;
        block11: {
            int n3;
            int n4;
            int n5;
            block10: {
                n5 = n2;
                cArray2 = cArray;
                n4 = cArray.length;
                n3 = 0;
                if (!true) break block10;
                n4 = n4;
                if (n4 <= n3) break block11;
            }
            do {
                n5 = n5;
                cArray2 = cArray2;
                int n6 = n3;
                cArray2[n6] = (char)(cArray2[n6] ^ (n5 ^ (switch (n3 % 7) {
                    case 0 -> 13;
                    case 1 -> 54;
                    case 2 -> 71;
                    case 3 -> 124;
                    case 4 -> 90;
                    case 5 -> 110;
                    default -> 11;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}