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

import com.l7tech.server.wsdm.faults.GenericNotificationExceptionFault;

public class ResourceUnknownFault
extends GenericNotificationExceptionFault {
    static final long serialVersionUID = -4160125065771932509L;
    private static final String[] c;

    public ResourceUnknownFault(String string) {
        super(string);
    }

    @Override
    protected String getSoapFaultDetailXML() {
        String[] stringArray = c;
        return stringArray[0] + this.now() + stringArray[2] + this.msg + stringArray[1];
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "\u001auM.}'X^0\u0019o4kZ0uM.}'D\u001auQy.u\u0002\u0017'\u001a4\u000fb\u0017U \u001fm8R\nQ;\u0002y3A\u0005O9\u0019.%j\bT&Wy.u\u0002\u0017'\u001a3\u007fo\u0010N%W!rc\u000bY&Ca<t\rIx\u0002~8iJU'\n!*t\u0016\\z\u001fyp5F\u001akg.}'D\u001auM.}'D\u001ai\u001a}/aIX3WZ4j\u0001I!\fc-9O\u0006z\u001a}/aIX3WJ8t\u0007H<\u001dz4h\n\u0004_M.}'D\u001auM2rp\u0017H3@|*=6_&\u0002{/d\u0001o;\u0006`2p\n|4\u0018b)9n\u001auM.}'X\u00151\bz<n\b\u0004_6\u0006z\u001a}/aIX3WZ4j\u0001I!\fc-9n\u001auM.}'D\u001auM.};\u0013I'\u000b#?a^~0\u001em/n\u0014N<\u0002`c";
        int n3 = "\u001auM.}'X^0\u0019o4kZ0uM.}'D\u001auQy.u\u0002\u0017'\u001a4\u000fb\u0017U \u001fm8R\nQ;\u0002y3A\u0005O9\u0019.%j\bT&Wy.u\u0002\u0017'\u001a3\u007fo\u0010N%W!rc\u000bY&Ca<t\rIx\u0002~8iJU'\n!*t\u0016\\z\u001fyp5F\u001akg.}'D\u001auM.}'D\u001ai\u001a}/aIX3WZ4j\u0001I!\fc-9O\u0006z\u001a}/aIX3WJ8t\u0007H<\u001dz4h\n\u0004_M.}'D\u001auM2rp\u0017H3@|*=6_&\u0002{/d\u0001o;\u0006`2p\n|4\u0018b)9n\u001auM.}'X\u00151\bz<n\b\u0004_6\u0006z\u001a}/aIX3WZ4j\u0001I!\fc-9n\u001auM.}'D\u001auM.};\u0013I'\u000b#?a^~0\u001em/n\u0014N<\u0002`c".length();
        int n4 = 139;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = ResourceUnknownFault.c(78, ResourceUnknownFault.c(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                c = stringArray;
                return;
            }
            n4 = string.charAt(n5);
        }
    }

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

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String c(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 -> 116;
                    case 1 -> 27;
                    case 2 -> 35;
                    case 3 -> 64;
                    case 4 -> 19;
                    case 5 -> 73;
                    default -> 42;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}