/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.policy.assertion.Assertion
 *  com.l7tech.search.Dependency$DependencyType
 *  org.jetbrains.annotations.NotNull
 */
package com.l7tech.server.search.objects;

import com.l7tech.policy.assertion.Assertion;
import com.l7tech.search.Dependency;
import com.l7tech.server.search.objects.DependentObject;
import org.jetbrains.annotations.NotNull;

public class BrokenDependentAssertion<A extends Assertion>
extends DependentObject {
    @NotNull
    private final Class<A> c;
    private static final String[] e;

    public BrokenDependentAssertion(@NotNull Class<A> clazz) {
        if (clazz == null) {
            BrokenDependentAssertion.b(0);
        }
        super(clazz.getName(), Dependency.DependencyType.ASSERTION);
        this.c = clazz;
    }

    private static /* synthetic */ void b(int n2) {
        String[] stringArray = e;
        throw new IllegalArgumentException(String.format(stringArray[3], stringArray[2], stringArray[1], stringArray[0]));
    }

    /*
     * Unable to fully structure code
     */
    static {
        block10: {
            block9: {
                var5 = new String[4];
                var3_1 = 0;
                var2_2 = "Z6U#*\u00069\u00050Ve2\u000f<\u0003<Se-]:\u0010:Ie-])\u0014<Se1Z\"\u0003<O9qz:\t4^$\u001a]8\u00031_/0L\t\u0015,^8*Q'\b";
                var4_3 = "Z6U#*\u00069\u00050Ve2\u000f<\u0003<Se-]:\u0010:Ie-])\u0014<Se1Z\"\u0003<O9qz:\t4^$\u001a]8\u00031_/0L\t\u0015,^8*Q'\b".length();
                var1_4 = 6;
                var0_5 = -1;
lbl7:
                // 2 sources

                while (true) {
                    v0 = 37;
                    v1 = ++var0_5;
                    v2 = var2_2.substring(v1, v1 + var1_4);
                    v3 = -1;
                    break block9;
                    break;
                }
lbl13:
                // 1 sources

                while (true) {
                    var5[var3_1++] = BrokenDependentAssertion.b(v0, BrokenDependentAssertion.b(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    var2_2 = "\u001c7S47W:\u0012*c=$P ><6G$(F=\tdF>7\u0003\u00133+T\u001f0O?]4A#$N6\t!Rqb\u0006 ZdO7e\u0006 SaSq(V \tdN>1\u00031\u0018dN$)O";
                    var4_3 = "\u001c7S47W:\u0012*c=$P ><6G$(F=\tdF>7\u0003\u00133+T\u001f0O?]4A#$N6\t!Rqb\u0006 ZdO7e\u0006 SaSq(V \tdN>1\u00031\u0018dN$)O".length();
                    var1_4 = 14;
                    var0_5 = -1;
lbl22:
                    // 2 sources

                    while (true) {
                        v0 = 62;
                        v4 = ++var0_5;
                        v2 = var2_2.substring(v4, v4 + var1_4);
                        v3 = 0;
                        break block9;
                        break;
                    }
                    break;
                }
lbl28:
                // 1 sources

                while (true) {
                    var5[var3_1++] = BrokenDependentAssertion.b(v0, BrokenDependentAssertion.b(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    break block10;
                    break;
                }
            }
            switch (v3) {
                default: {
                    ** continue;
                }
                ** case 0:
lbl39:
                // 1 sources

                ** continue;
            }
        }
        BrokenDependentAssertion.e = var5;
    }

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

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String b(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 -> 67;
                    case 1 -> 122;
                    case 2 -> 30;
                    case 3 -> 111;
                    case 4 -> 123;
                    case 5 -> 29;
                    default -> 109;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}