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

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

class n
extends TimerTask {
    final SubscriptionNotifier this$0;
    private static final String a = n.a(37, n.a(".\f\u000f;q'l\u00029+x^<q\u00041bO^;s"));

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

    @Override
    public void run() {
        long l2 = System.currentTimeMillis();
        this.this$0.pushMetricsNotifications(this.this$0.j);
        this.this$0.j = l2;
    }

    public String toString() {
        return a;
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x3D);
        }
        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 -> 78;
                    case 1 -> 122;
                    case 2 -> 103;
                    case 3 -> 62;
                    case 4 -> 26;
                    case 5 -> 109;
                    default -> 61;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}