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

import com.l7tech.server.wsdm.subscription.SubscriptionNotifier;
import java.util.TimerTask;
import java.util.logging.Level;

class m
extends TimerTask {
    final SubscriptionNotifier this$0;
    private static final String[] a;

    m(SubscriptionNotifier subscriptionNotifier) {
        this.this$0 = subscriptionNotifier;
    }

    /*
     * Loose catch block
     */
    @Override
    public void run() {
        block6: {
            try {
                long l2;
                boolean bl2;
                SubscriptionNotifier subscriptionNotifier;
                block8: {
                    block7: {
                        this.this$0.subscriptionManager.deleteExpiredSubscriptions();
                        if (!this.this$0.a(false)) break block6;
                        try {
                            block9: {
                                subscriptionNotifier = this.this$0;
                                bl2 = true;
                                if (!this.this$0.i.get()) break block7;
                                break block9;
                                catch (Exception exception) {
                                    throw m.a(exception);
                                }
                            }
                            l2 = this.this$0.h.get();
                            break block8;
                        }
                        catch (Exception exception) {
                            throw m.a(exception);
                        }
                    }
                    l2 = 0L;
                }
                subscriptionNotifier.a(bl2, l2);
            }
            catch (Exception exception) {
                SubscriptionNotifier.a.log(Level.WARNING, a[0], exception);
            }
        }
    }

    public String toString() {
        return a[1];
    }

    private static Exception a(Exception exception) {
        return exception;
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "q\nzL>PfP\u000b;^7G K\u0016v\u000e!@$W\u0007iG\"A/K\n;M>P'J\u0011k\u0015rB/H\b;\\7A4]Dr@r\u0003v\u0014T+C!\u001b\u0014a7V\u000e\u001fT/J\u0010~@3[%ADOO!^";
        int n3 = "q\nzL>PfP\u000b;^7G K\u0016v\u000e!@$W\u0007iG\"A/K\n;M>P'J\u0011k\u0015rB/H\b;\\7A4]Dr@r\u0003v\u0014T+C!\u001b\u0014a7V\u000e\u001fT/J\u0010~@3[%ADOO!^".length();
        int n4 = 62;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = m.a(35, m.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                a = 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] ^ 0x65);
        }
        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 -> 7;
                    case 1 -> 71;
                    case 2 -> 56;
                    case 3 -> 13;
                    case 4 -> 113;
                    case 5 -> 22;
                    default -> 101;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}