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

import com.l7tech.server.oauth2.OAuth2VerifierResult;
import java.util.Map;

public class SSGOAuth2VerifierResult
implements OAuth2VerifierResult {
    private boolean a;
    private Map<String, Object> b;
    private String c;
    private static final String[] d;

    @Override
    public boolean isValid() {
        return this.a;
    }

    @Override
    public Map<String, Object> getResult() {
        return this.b;
    }

    @Override
    public int getError() {
        return this.b != null ? (Integer)this.b.getOrDefault(d[0], 0) : 0;
    }

    @Override
    public String getErrorDescription() {
        return this.b != null ? (String)this.b.get(d[1]) : null;
    }

    public void setValid(boolean bl2) {
        this.a = bl2;
    }

    public void setResult(Map<String, Object> map) {
        this.b = map;
    }

    public void setTokenType(String string) {
        this.c = string;
    }

    @Override
    public String getTokenType() {
        return this.c;
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "\u0004h\u007fp{\u0011\u0004h\u007fp{\u001d7\u0004inm`2'\buc";
        int n3 = "\u0004h\u007fp{\u0011\u0004h\u007fp{\u001d7\u0004inm`2'\buc".length();
        int n4 = 5;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = SSGOAuth2VerifierResult.a(1, SSGOAuth2VerifierResult.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                d = stringArray;
                return;
            }
            n4 = string.charAt(n5);
        }
    }

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

    /*
     * Handled impossible loop by duplicating code
     * Enabled aggressive block sorting
     */
    private static String a(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 -> 96;
                    case 1 -> 27;
                    case 2 -> 12;
                    case 3 -> 30;
                    case 4 -> 8;
                    case 5 -> 67;
                    default -> 82;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}