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

import com.l7tech.server.cluster.ClusterPropertyCache;
import com.l7tech.server.uddi.TimerUDDIEvent;
import com.l7tech.server.uddi.UDDIBusinessServiceStatusManager;
import com.l7tech.server.uddi.UDDIHelper;
import com.l7tech.server.uddi.UDDIRegistryManager;
import com.l7tech.server.uddi.UDDITaskFactory;
import com.l7tech.server.uddi.UDDITemplateManager;
import com.l7tech.server.uddi.o;
import com.l7tech.server.uddi.u;
import com.l7tech.server.uddi.v;
import com.l7tech.server.wsdm.Aggregator;

public class MetricsUDDITaskFactory
extends UDDITaskFactory {
    private final UDDIRegistryManager a;
    private final UDDIHelper b;
    private final UDDITemplateManager c;
    private final UDDIBusinessServiceStatusManager d;
    private final Aggregator e;
    private final ClusterPropertyCache f;

    public MetricsUDDITaskFactory(UDDIRegistryManager uDDIRegistryManager, UDDIHelper uDDIHelper, UDDITemplateManager uDDITemplateManager, UDDIBusinessServiceStatusManager uDDIBusinessServiceStatusManager, Aggregator aggregator, ClusterPropertyCache clusterPropertyCache) {
        this.a = uDDIRegistryManager;
        this.b = uDDIHelper;
        this.c = uDDITemplateManager;
        this.d = uDDIBusinessServiceStatusManager;
        this.e = aggregator;
        this.f = clusterPropertyCache;
    }

    @Override
    public UDDITaskFactory.UDDITask buildUDDITask(o o2) {
        UDDITaskFactory.UDDITask uDDITask = null;
        if (o2 instanceof TimerUDDIEvent) {
            TimerUDDIEvent timerUDDIEvent = (TimerUDDIEvent)o2;
            if (timerUDDIEvent.b() == TimerUDDIEvent.Type.METRICS_PUBLISH) {
                uDDITask = new v(this, timerUDDIEvent.a());
            } else if (timerUDDIEvent.b() == TimerUDDIEvent.Type.METRICS_CLEANUP) {
                uDDITask = new u(this, timerUDDIEvent.a());
            }
        }
        return uDDITask;
    }

    private static final class ValueException
    extends Exception {
        static final long serialVersionUID = 8635401207380239417L;

        public ValueException(String string) {
            super(string);
        }
    }

    static final class Metric
    extends Enum<Metric> {
        public static final /* enum */ Metric CLUSTER;
        public static final /* enum */ Metric SERVICE_KEY;
        public static final /* enum */ Metric START_TIME;
        public static final /* enum */ Metric END_TIME;
        public static final /* enum */ Metric TOTAL_REQUEST_COUNT;
        public static final /* enum */ Metric SUCCESS_REQUEST_COUNT;
        public static final /* enum */ Metric FAILURE_REQUEST_COUNT;
        public static final /* enum */ Metric AVERAGE_RESPONSE_TIME;
        public static final /* enum */ Metric MINIMUM_RESPONSE_TIME;
        public static final /* enum */ Metric MAXIMUM_RESPONSE_TIME;
        public static final /* enum */ Metric AVAILABILITY;
        private static final /* synthetic */ Metric[] $VALUES;

        public static Metric[] values() {
            return (Metric[])$VALUES.clone();
        }

        public static Metric valueOf(String string) {
            return Enum.valueOf(Metric.class, string);
        }

        private static /* synthetic */ Metric[] $values() {
            return new Metric[]{CLUSTER, SERVICE_KEY, START_TIME, END_TIME, TOTAL_REQUEST_COUNT, SUCCESS_REQUEST_COUNT, FAILURE_REQUEST_COUNT, AVERAGE_RESPONSE_TIME, MINIMUM_RESPONSE_TIME, MAXIMUM_RESPONSE_TIME, AVAILABILITY};
        }

        /*
         * Unable to fully structure code
         */
        static {
            block10: {
                block9: {
                    var0 = new String[11];
                    var4_1 = 0;
                    var3_2 = "Zllu4\bPHwgo)\u0012SD`}h0\u0010X\u0013Cjv}5\u0002ORtwy*\tBTjwr-\fVscu5\u001c_^ikh \u0007Tiwo-\u0018O\u0015Vsgn8\u001aXHwgo)\u0012SD`}h0\u0010X\nDqcn-\u0002I^hg\u0015Dpa\u007f<\u000eNHwgm,\u0018NCzas,\u0013I\u0015Zdzu4\bPHwgo)\u0012SD`}h0\u0010X\bRkfc-\u0014PR";
                    var5_3 = "Zllu4\bPHwgo)\u0012SD`}h0\u0010X\u0013Cjv}5\u0002ORtwy*\tBTjwr-\fVscu5\u001c_^ikh \u0007Tiwo-\u0018O\u0015Vsgn8\u001aXHwgo)\u0012SD`}h0\u0010X\nDqcn-\u0002I^hg\u0015Dpa\u007f<\u000eNHwgm,\u0018NCzas,\u0013I\u0015Zdzu4\bPHwgo)\u0012SD`}h0\u0010X\bRkfc-\u0014PR".length();
                    var2_4 = 21;
                    var1_5 = -1;
lbl7:
                    // 2 sources

                    while (true) {
                        v0 = 40;
                        v1 = ++var1_5;
                        v2 = var3_2.substring(v1, v1 + var2_4);
                        v3 = -1;
                        break block9;
                        break;
                    }
lbl13:
                    // 1 sources

                    while (true) {
                        var0[var4_1++] = Metric.a(v0, Metric.a(v2));
                        if ((var1_5 += var2_4) < var5_3) {
                            var2_4 = var3_2.charAt(var1_5);
                            ** continue;
                        }
                        var3_2 = "\u0003'7-wY\u001f\u000f) \"\u0015\u0016#,7kH\u001f\u000f0 *k_\t\u0004=&4kT\u000e";
                        var5_3 = "\u0003'7-wY\u001f\u000f) \"\u0015\u0016#,7kH\u001f\u000f0 *k_\t\u0004=&4kT\u000e".length();
                        var2_4 = 11;
                        var1_5 = -1;
lbl22:
                        // 2 sources

                        while (true) {
                            v0 = 111;
                            v4 = ++var1_5;
                            v2 = var3_2.substring(v4, v4 + var2_4);
                            v3 = 0;
                            break block9;
                            break;
                        }
                        break;
                    }
lbl28:
                    // 1 sources

                    while (true) {
                        var0[var4_1++] = Metric.a(v0, Metric.a(v2));
                        if ((var1_5 += var2_4) < var5_3) {
                            var2_4 = var3_2.charAt(var1_5);
                            ** continue;
                        }
                        break block10;
                        break;
                    }
                }
                switch (v3) {
                    default: {
                        ** continue;
                    }
                    ** case 0:
lbl39:
                    // 1 sources

                    ** continue;
                }
            }
            Metric.CLUSTER = new Metric();
            Metric.SERVICE_KEY = new Metric();
            Metric.START_TIME = new Metric();
            Metric.END_TIME = new Metric();
            Metric.TOTAL_REQUEST_COUNT = new Metric();
            Metric.SUCCESS_REQUEST_COUNT = new Metric();
            Metric.FAILURE_REQUEST_COUNT = new Metric();
            Metric.AVERAGE_RESPONSE_TIME = new Metric();
            Metric.MINIMUM_RESPONSE_TIME = new Metric();
            Metric.MAXIMUM_RESPONSE_TIME = new Metric();
            Metric.AVAILABILITY = new Metric();
            Metric.$VALUES = Metric.$values();
        }

        private static char[] a(String string) {
            char[] cArray = string.toCharArray();
            if (cArray.length < 2) {
                cArray = cArray;
                cArray[0] = (char)(cArray[0] ^ 0x35);
            }
            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 -> 63;
                        case 1 -> 13;
                        case 2 -> 10;
                        case 3 -> 20;
                        case 4 -> 81;
                        case 5 -> 117;
                        default -> 53;
                    })));
                    ++n3;
                    n4 = n4;
                } while (n4 > n3);
            }
            return new String(cArray2).intern();
        }
    }
}