/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.common.io.CertUtils
 */
package com.l7tech.server.security.cert;

import com.l7tech.common.io.CertUtils;
import java.security.cert.CertificateEncodingException;
import java.security.cert.X509Certificate;
import java.util.Arrays;

final class t {
    private final X509Certificate a;
    private final int b;
    private static final String[] c;

    private t(X509Certificate x509Certificate) throws CertificateEncodingException {
        this.a = x509Certificate;
        this.b = Arrays.hashCode(x509Certificate.getEncoded());
    }

    public boolean equals(Object object) {
        return object instanceof t && CertUtils.certsAreEqual((X509Certificate)this.a, (X509Certificate)((t)object).a);
    }

    public int hashCode() {
        return this.b;
    }

    public String toString() {
        String[] stringArray = c;
        return stringArray[1] + this.a.getSubjectDN().toString() + stringArray[0];
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "92\f]\n]\\\u007foFE\u000bA\u0015\u0013";
        int n3 = "92\f]\n]\\\u007foFE\u000bA\u0015\u0013".length();
        int n4 = 2;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = t.a(123, t.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                c = 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] ^ 0x44);
        }
        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 -> 101;
                    case 1 -> 20;
                    case 2 -> 84;
                    case 3 -> 83;
                    case 4 -> 79;
                    case 5 -> 113;
                    default -> 68;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}