/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.policy.PolicyVersion
 */
package com.l7tech.server.event.admin;

import com.l7tech.policy.PolicyVersion;
import com.l7tech.server.event.EntityChangeSet;
import com.l7tech.server.event.admin.Updated;

public class PolicyVersionUpdated
extends Updated<PolicyVersion> {
    static final long serialVersionUID = 2562788542918237176L;
    private static final String[] b;

    public PolicyVersionUpdated(PolicyVersion policyVersion, EntityChangeSet entityChangeSet) {
        super(policyVersion, entityChangeSet, PolicyVersionUpdated.getNote(policyVersion, entityChangeSet));
    }

    private static String getNote(PolicyVersion policyVersion, EntityChangeSet entityChangeSet) {
        String[] stringArray;
        if (policyVersion.isActive() && Boolean.FALSE.equals(entityChangeSet.getOldValue((stringArray = b)[1]))) {
            String string = String.valueOf(policyVersion.getPolicyGoid());
            long l2 = policyVersion.getOrdinal();
            return stringArray[0] + l2 + stringArray[2] + string;
        }
        return null;
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "5!>;S y1&j$\u00065!>;S$\u000bt-,rU.a=!3r";
        int n3 = "5!>;S y1&j$\u00065!>;S$\u000bt-,rU.a=!3r".length();
        int n4 = 11;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = PolicyVersionUpdated.b(40, PolicyVersionUpdated.b(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                b = stringArray;
                return;
            }
            n4 = string.charAt(n5);
        }
    }

    private static char[] b(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x25);
        }
        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 -> 124;
                    case 1 -> 106;
                    case 2 -> 98;
                    case 3 -> 122;
                    case 4 -> 13;
                    case 5 -> 105;
                    default -> 37;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}