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

import java.util.List;
import java.util.Map;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.regex.Pattern;

public class OtelTraceConfigUtil {
    private static final Logger a;
    private static final String[] b;

    public static boolean shouldCtxVarBeIncluded(List<Pattern> list, List<Pattern> list2, String string) {
        boolean bl2 = false;
        if (!list.isEmpty()) {
            bl2 = list.stream().anyMatch(pattern -> pattern.matcher(string).matches());
        }
        if (bl2 && !list2.isEmpty()) {
            bl2 = list2.stream().noneMatch(pattern -> pattern.matcher(string).matches());
        }
        return bl2;
    }

    public static void setCustomAttributesMap(String string, Map<String, String> map) {
        String[] stringArray;
        StringBuilder stringBuilder = new StringBuilder();
        String string2 = Pattern.quote(",");
        String string3 = Pattern.quote("=");
        for (String string4 : stringArray = string.split(string2)) {
            String[] stringArray2 = string4.split(string3);
            if (stringArray2.length == 2 && !stringArray2[0].isBlank()) {
                map.put(stringArray2[0].trim(), stringArray2[1].trim());
                continue;
            }
            stringBuilder.append(string4).append(" ");
        }
        if (!stringBuilder.isEmpty()) {
            String[] stringArray3 = b;
            a.log(Level.FINE, stringArray3[0] + String.valueOf(stringBuilder) + stringArray3[1] + string);
        }
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = "2H/FqV\u001f[L4Zw\\\u0016[N5]qZ\u0019\u000e[$\tHV\u0002[Y EvV[\u000bN([p\u0013\u001f\u000eJa]l\u0013\f\t@/N#U\u0014\tB ]9\u0013\u0018[i.[#p\u000e\b[.D#r\u000f\u000f](KvG\u001e\b\u0015a";
        int n3 = "2H/FqV\u001f[L4Zw\\\u0016[N5]qZ\u0019\u000e[$\tHV\u0002[Y EvV[\u000bN([p\u0013\u001f\u000eJa]l\u0013\f\t@/N#U\u0014\tB ]9\u0013\u0018[i.[#p\u000e\b[.D#r\u000f\u000f](KvG\u001e\b\u0015a".length();
        int n4 = 62;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = OtelTraceConfigUtil.a(120, OtelTraceConfigUtil.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                b = stringArray;
                a = Logger.getLogger(OtelTraceConfigUtil.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] ^ 3);
        }
        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 -> 3;
                    case 1 -> 87;
                    case 2 -> 57;
                    case 3 -> 81;
                    case 4 -> 123;
                    case 5 -> 75;
                    default -> 3;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}