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

import com.l7tech.server.LifecycleException;
import com.l7tech.server.ServerComponentLifecycle;
import com.l7tech.server.util.ManagedTimer;
import java.util.logging.Logger;

public class ManagedTimerLifecycle
implements ServerComponentLifecycle {
    private static final Logger a;
    private static final String[] b;

    @Override
    public void start() throws LifecycleException {
    }

    @Override
    public void stop() throws LifecycleException {
    }

    @Override
    public void close() throws LifecycleException {
        String[] stringArray = b;
        a.info(stringArray[1]);
        ManagedTimer.cancelAndWaitAll();
        a.info(stringArray[0]);
    }

    public String toString() {
        return b[2];
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[3];
        int n2 = 0;
        String string = "AdU<<b\n,qR0>u\u001d,vO2+w\u000bh+\u001d_mN)/n\u0000k%_2,iNadU<<b\n,qR0>u\u001d\"\u0017AdU<<b\nXlV8)'-ckO/4k\u0002iw";
        int n3 = "AdU<<b\n,qR0>u\u001d,vO2+w\u000bh+\u001d_mN)/n\u0000k%_2,iNadU<<b\n,qR0>u\u001d\"\u0017AdU<<b\nXlV8)'-ckO/4k\u0002iw".length();
        int n4 = 23;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = ManagedTimerLifecycle.a(81, ManagedTimerLifecycle.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                b = stringArray;
                a = Logger.getLogger(ManagedTimerLifecycle.class.getName());
                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] ^ 0x3F);
        }
        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 -> 93;
                    case 1 -> 84;
                    case 2 -> 106;
                    case 3 -> 12;
                    case 4 -> 10;
                    case 5 -> 86;
                    default -> 63;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}