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

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

public class TopicNotSupportedFaultException
extends FaultMappableException {
    static final long serialVersionUID = 7231112849928913261L;
    private static final String[] b;

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

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

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "yt\u007f\u000fpi{'=2(kb36/i\u0011r1\\e{(\\\"/ve{(\\\"3!6)nQ`il\u0001>{\u001fpf&12g\u0012<Oyt\u007f\u000fpi{'=28g|572x\bk`8{Q(\\\"/ve{(@-x%+/\u007fFV`&,8F\u0013v\\#5+g\u000evj2\u0003:}\u0010v1\\e{(\\\"/jj?m\bcf:{Q\u0088e{(\\\"/j!>|\u001dkchO{(\\\"/ve{4\u000bqa\"2a\\\u0013rf5\u000b4|/w\u007f&*)|\u0019fI707|\\zb:+(2\u000bqa\"2f*\u0014v{&\u007ft'\u0018ml%k4i\u000fk|{*+m\u0012,`$\"t\u007f\u000fl 42v:^\"1\\e{(\\\"/ve{(\\\"3!6)nQ`il\u00112e\u0019q{7(+6";
        int n3 = "yt\u007f\u000fpi{'=2(kb36/i\u0011r1\\e{(\\\"/ve{(\\\"3!6)nQ`il\u0001>{\u001fpf&12g\u0012<Oyt\u007f\u000fpi{'=28g|572x\bk`8{Q(\\\"/ve{(@-x%+/\u007fFV`&,8F\u0013v\\#5+g\u000evj2\u0003:}\u0010v1\\e{(\\\"/jj?m\bcf:{Q\u0088e{(\\\"/j!>|\u001dkchO{(\\\"/ve{4\u000bqa\"2a\\\u0013rf5\u000b4|/w\u007f&*)|\u0019fI707|\\zb:+(2\u000bqa\"2f*\u0014v{&\u007ft'\u0018ml%k4i\u000fk|{*+m\u0012,`$\"t\u007f\u000fl 42v:^\"1\\e{(\\\"/ve{(\\\"3!6)nQ`il\u00112e\u0019q{7(+6".length();
        int n4 = 54;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = TopicNotSupportedFaultException.b(30, TopicNotSupportedFaultException.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] ^ 0x48);
        }
        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 -> 91;
                    case 1 -> 69;
                    case 2 -> 22;
                    case 3 -> 98;
                    case 4 -> 28;
                    case 5 -> 17;
                    default -> 72;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}