/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.ca.apim.gateway.extension.sharedstate.cluster.ClusterInfoService
 *  com.ca.apim.gateway.extension.sharedstate.cluster.ClusterNodeSharedInfo
 *  com.l7tech.gateway.common.cluster.ClusterNodeInfo
 */
package com.l7tech.server.cluster;

import com.ca.apim.gateway.extension.sharedstate.cluster.ClusterInfoService;
import com.ca.apim.gateway.extension.sharedstate.cluster.ClusterNodeSharedInfo;
import com.l7tech.gateway.common.cluster.ClusterNodeInfo;
import com.l7tech.server.cluster.p;
import java.util.Arrays;
import java.util.Collection;
import java.util.UUID;

public class LocalClusterInfoService
implements ClusterInfoService {
    private ClusterNodeInfo a = new ClusterNodeInfo();
    public static final String KEY;
    private static final String[] b;

    public LocalClusterInfoService() {
        this.a.setLastUpdateTimeStamp(System.currentTimeMillis());
        this.a.setNodeIdentifier(UUID.randomUUID().toString().replace("-", ""));
        this.a.setName(b[0]);
    }

    public Collection<ClusterNodeSharedInfo> getActiveNodes() {
        this.a.setLastUpdateTimeStamp(System.currentTimeMillis());
        return Arrays.asList(new p(this));
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "\u0012o{W?~r\u0005\u0019alS$";
        int n3 = "\u0012o{W?~r\u0005\u0019alS$".length();
        int n4 = 7;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = LocalClusterInfoService.a(95, LocalClusterInfoService.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                b = stringArray;
                KEY = b[1];
                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] ^ 0x54);
        }
        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 -> 42;
                    case 1 -> 81;
                    case 2 -> 80;
                    case 3 -> 109;
                    case 4 -> 23;
                    case 5 -> 64;
                    default -> 84;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}