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

import com.l7tech.server.cluster.ClusterLock;

class h {
    private final boolean a;
    private final long b;
    private final long c;
    private static final String[] d;

    private h(boolean bl2, long l2, long l3) {
        this.a = bl2;
        this.b = l2;
        this.c = l3;
    }

    public boolean isLocked() {
        return this.a;
    }

    public long getLockTime() {
        return this.b;
    }

    public long getOwnerId() {
        return this.c;
    }

    /*
     * Unable to fully structure code
     */
    public static h parseString(String var0) {
        block9: {
            try {
                if (var0 == null) {
                    return null;
                }
            }
            catch (NumberFormatException v0) {
                throw h.a(v0);
            }
            var1_1 = var0.split(":");
            if (var1_1 == null) ** GOTO lbl15
            try {
                block10: {
                    if (var1_1.length == 3) break block9;
                    break block10;
                    catch (NumberFormatException v1) {
                        throw h.a(v1);
                    }
                }
                ClusterLock.a.warning(h.d[1] + var0);
                return null;
            }
            catch (NumberFormatException v2) {
                throw h.a(v2);
            }
        }
        var2_2 = Boolean.parseBoolean(var1_1[0]);
        try {
            var3_3 = Long.parseLong(var1_1[1]);
            var5_4 = Long.parseLong(var1_1[2]);
        }
        catch (NumberFormatException var7_5) {
            ClusterLock.a.warning(h.d[0] + var0);
            return null;
        }
        return new h(var2_2, var3_3, var5_4);
    }

    public String toString() {
        return this.a + ":" + this.b + ":" + this.c;
    }

    private static NumberFormatException a(NumberFormatException numberFormatException) {
        return numberFormatException;
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "]\u0005>&7l&4\b$2(q'fK$(8nbq\u0005<5\"?b\u001c]\u0005>&7l&4\b$2(q'fK$(8nbq\u0005<5\"?b";
        int n3 = "]\u0005>&7l&4\b$2(q'fK$(8nbq\u0005<5\"?b\u001c]\u0005>&7l&4\b$2(q'fK$(8nbq\u0005<5\"?b".length();
        int n4 = 28;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = h.a(67, h.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] ^ '\u0001');
        }
        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 -> 87;
                    case 1 -> 40;
                    case 2 -> 11;
                    case 3 -> 4;
                    case 4 -> 24;
                    case 5 -> 70;
                    default -> 1;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}