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

import com.l7tech.server.policy.module.CustomAssertionClassLoader;
import com.l7tech.server.policy.module.CustomAssertionsScanner;
import java.util.logging.Level;

class b {
    private CustomAssertionClassLoader a;
    private static final String b = com.l7tech.server.policy.module.b.a(72, com.l7tech.server.policy.module.b.a("\u0012 \u0018\u0003quV .Q\fx~\u00051a\u0012\u001age\u00199a\u0010\u001cgt\u0004 (\u001e\u00014r\u001a52\u0002Ox~\u00170$\u0003A"));

    private b(CustomAssertionsScanner customAssertionsScanner) {
    }

    void a(CustomAssertionClassLoader customAssertionClassLoader) {
        this.a = customAssertionClassLoader;
    }

    void a() {
        this.a = null;
    }

    void b() {
        if (this.a != null) {
            try {
                this.a.close();
            }
            catch (Throwable throwable) {
                CustomAssertionsScanner.c.log(Level.WARNING, b, throwable);
            }
        }
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x3E);
        }
        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 -> 28;
                    case 1 -> 9;
                    case 2 -> 57;
                    case 3 -> 39;
                    case 4 -> 92;
                    case 5 -> 89;
                    default -> 62;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}