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

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

public class InvalidMessageContentExpressionFault
extends GenericNotificationExceptionFault {
    static final long serialVersionUID = 5181598664186439068L;
    private static final String[] c;

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

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

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "6\\Z2|\u0006\fh\u0015\u0017\u0015g\rDy\u0007L,~^+*S\ra.@\u0001*S\ra.\\Vy\u0001Kll\u0006\u001bN\u0016^\"|\tQ~\u001aB/0\u0095*S\ra.@\u001dn\u0016Y g\f\u001f\u0000S\ra.@\u0001*S\u00116}\u000eU}Id/x\u0001Mc\u0017`$}\u0013@m\u0016n.`\u0014Dd\u0007h9~\u0012Dy\u0000D.`&@\u007f\u001fYav\rMd\u0000\u00176}\u000eU}N\u000f)z\u0014Q0\\\u0002%a\u0003R$\u001cL2g\u0013\fe\u0003H/ \u000fSm\\Z2`OC}^\u001fc0j\u0001*S\ra.@\u0001*S\ra2\u0017Rx\u0015\u0000#hZuc\u001eH2z\u0001LzM]6\\Z2|\u0006\fh\u0015\u0017\u0005k\u0013Bx\u001a]5g\u000fO4y\ra.@\u0001*S\r}!\u0017Rd\u0007Z{G\u000eWk\u001fD%C\u0005Ry\u0012J$M\u000fO~\u0016C5K\u0018Qx\u0016^2g\u000fOL\u0012X-z^+*S\ra.@\u001d%\u0017H5o\tM4y";
        int n3 = "6\\Z2|\u0006\fh\u0015\u0017\u0015g\rDy\u0007L,~^+*S\ra.@\u0001*S\ra.\\Vy\u0001Kll\u0006\u001bN\u0016^\"|\tQ~\u001aB/0\u0095*S\ra.@\u001dn\u0016Y g\f\u001f\u0000S\ra.@\u0001*S\u00116}\u000eU}Id/x\u0001Mc\u0017`$}\u0013@m\u0016n.`\u0014Dd\u0007h9~\u0012Dy\u0000D.`&@\u007f\u001fYav\rMd\u0000\u00176}\u000eU}N\u000f)z\u0014Q0\\\u0002%a\u0003R$\u001cL2g\u0013\fe\u0003H/ \u000fSm\\Z2`OC}^\u001fc0j\u0001*S\ra.@\u0001*S\ra2\u0017Rx\u0015\u0000#hZuc\u001eH2z\u0001LzM]6\\Z2|\u0006\fh\u0015\u0017\u0005k\u0013Bx\u001a]5g\u000fO4y\ra.@\u0001*S\r}!\u0017Rd\u0007Z{G\u000eWk\u001fD%C\u0005Ry\u0012J$M\u000fO~\u0016C5K\u0018Qx\u0016^2g\u000fOL\u0012X-z^+*S\ra.@\u001d%\u0017H5o\tM4y".length();
        int n4 = 54;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = InvalidMessageContentExpressionFault.c(36, InvalidMessageContentExpressionFault.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] ^ 5);
        }
        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 -> 46;
                    case 1 -> 87;
                    case 2 -> 9;
                    case 3 -> 101;
                    case 4 -> 42;
                    case 5 -> 68;
                    default -> 5;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}