/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.objectmodel.Goid
 *  com.l7tech.util.ConfigFactory
 */
package com.l7tech.server.service.resolution;

import com.l7tech.objectmodel.Goid;
import com.l7tech.server.service.resolution.e;
import com.l7tech.server.service.resolution.f;
import com.l7tech.server.service.resolution.g;
import com.l7tech.server.service.resolution.h;
import com.l7tech.util.ConfigFactory;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.function.BiConsumer;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.regex.Matcher;

public class TrieBasedResolver {
    private static final Logger a;
    private static final String b;
    private static final boolean c = true;
    private static final String d;
    private static final boolean e = false;
    private static final char f = '*';
    private static final char g = '/';
    private static final String h = "/";
    private final boolean i;
    private final f j;
    public static final TrieBasedResolver NOOP_RESOLVER;
    private static final String[] k;

    public TrieBasedResolver() {
        this(false);
    }

    public TrieBasedResolver(boolean bl2) {
        this.i = bl2;
        this.j = new f();
    }

    public void insert(String string, Goid goid) {
        String[] stringArray = string.split(h);
        f f2 = this.getRoot();
        a.log(Level.FINE, k[0], string);
        for (int i2 = 0; i2 < stringArray.length; ++i2) {
            boolean bl2;
            String string2 = stringArray[i2];
            if (!this.i && string2.indexOf(42) >= 0) {
                string2 = string.substring(string.indexOf(string2));
                this.a(string2, goid, f2, true);
                break;
            }
            boolean bl3 = bl2 = i2 == stringArray.length - 1;
            if (string2.isEmpty()) continue;
            f2 = this.a(string2, goid, f2, bl2);
        }
    }

    private f a(String string, Goid goid, f f2, boolean bl2) {
        f f3 = f2.getChildContaining(string);
        if (null == f3) {
            f f4 = this.a(string, goid, bl2);
            f2.addChild(f4);
            a.log(Level.FINER, k[6], new Object[]{f4, f2});
            return f4;
        }
        if (bl2) {
            f3.setGoid(goid);
        }
        return f3;
    }

    private f a(String string, Goid goid, boolean bl2) {
        f f2;
        f f3 = f2 = string.indexOf(42) >= 0 ? new g(string) : new f(string);
        if (bl2) {
            f2.setGoid(goid);
        }
        return f2;
    }

    public f getRoot() {
        return this.j;
    }

    public List<Goid> search(String string) {
        if (this.j.hasNoChildren()) {
            return Collections.emptyList();
        }
        return this.a(this.b(string), this.j);
    }

    private List<Goid> a(String string, f f2) {
        ArrayList<Goid> arrayList = new ArrayList<Goid>();
        if (f2.hasNoChildren()) {
            return arrayList;
        }
        for (f f3 : f2.getChildren()) {
            h h2 = this.b(string, f3);
            if (h2.isMatch()) {
                arrayList.addAll(h2.getMatchedGoids());
            }
            if (!h2.isPathMatch()) continue;
            arrayList.addAll(this.a(this.a(string), f3));
        }
        return arrayList;
    }

    private h b(String string, f f2) {
        h h2 = new h();
        if (f2.isWildcard()) {
            Matcher matcher = f2.getPattern().matcher(string);
            if (matcher.matches()) {
                h2.getMatchedGoids().add(f2.getGoid());
                h2.setPathMatch(f2.hasChildren());
                h2.setMatch(f2.wasInsertedAsLeaf());
            }
        } else {
            int n2 = string.indexOf(47);
            if (n2 > 0) {
                String string2 = string.substring(0, n2);
                h2.setPathMatch(f2.getWord().equals(string2));
            } else if (f2.getWord().equals(string) && null != f2.getGoid()) {
                h2.setMatch(true);
                h2.getMatchedGoids().add(f2.getGoid());
            }
        }
        return h2;
    }

    public void delete(String string2, Goid goid) {
        String[] stringArray = k;
        a.log(Level.FINE, stringArray[1], string2);
        if (this.j.hasNoChildren()) {
            return;
        }
        ArrayList<f> arrayList = new ArrayList<f>();
        arrayList.add(this.j);
        this.a(this.b(string2), (f f2, String string) -> arrayList.add((f)f2));
        f f3 = (f)arrayList.get(arrayList.size() - 1);
        if (goid.equals((Object)f3.getGoid())) {
            f f4;
            f3.setGoid(null);
            for (int i2 = arrayList.size() - 1; i2 > 0 && (f4 = (f)arrayList.get(i2)).hasNoChildren() && f4.getGoid() == null; --i2) {
                a.log(Level.FINER, k[8], new Object[]{f4, arrayList.get(i2 - 1)});
                ((f)arrayList.get(i2 - 1)).removeChild(f4);
            }
        }
    }

    void a(String string, BiConsumer<f, String> biConsumer) {
        if (this.j.hasChildren()) {
            this.a(this.b(string), this.j, biConsumer);
        }
    }

    private void a(String string, f f2, BiConsumer<f, String> biConsumer) {
        String string2;
        int n2 = string.indexOf(47);
        String string3 = string2 = n2 != -1 ? string.substring(0, n2) : string;
        if (!this.i && string2.indexOf(42) != -1) {
            string2 = string;
            n2 = -1;
        }
        String string4 = n2 != -1 ? string.substring(n2 + 1) : null;
        for (f f3 : f2.getChildren()) {
            if (!string2.equals(f3.getWord())) continue;
            a.log(Level.FINER, k[3], f3);
            biConsumer.accept(f3, string4);
            if (string4 == null || !f3.hasChildren()) break;
            this.a(string4, f3, biConsumer);
            break;
        }
    }

    private String a(String string) {
        int n2 = string.indexOf(47);
        if (n2 > 0) {
            return string.substring(n2 + 1);
        }
        return string;
    }

    private String b(String string) {
        return string.indexOf(47) == 0 ? string.substring(1) : string;
    }

    public static boolean isInterestedProperty(String string) {
        String[] stringArray = k;
        return stringArray[7].equals(string) || stringArray[4].equals(string);
    }

    public static boolean isResolverEnabled() {
        return ConfigFactory.getBooleanProperty((String)k[5], (boolean)true);
    }

    public static boolean useInStrictMode() {
        return ConfigFactory.getBooleanProperty((String)k[2], (boolean)false);
    }

    /*
     * Unable to fully structure code
     */
    static {
        block10: {
            block9: {
                var5 = new String[9];
                var3_1 = 0;
                var2_2 = "wQfc'\u0003\u0007XZfo:DAYG\"qy\u0019\u0016dPoe?\rIQ\u0015le-\u0001T\u0016Smxi\u001f\u0017K8EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JREPKd\u001a\u0010U_VvG&\u0000B\u001d`\\qc=\rIQ\u0015vb,DJWAab,\u0000\u0007XZfoi\u001f\u0017K8EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JREPKd\u001a\u0010U_VvG&\u0000B0EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JBXT`f,\u0000\u0018wQfc'\u0003\u0007W\u0015le-\u0001\u0007M\u0005\u007f*=\u000b\u0007M\u0004\u007f";
                var4_3 = "wQfc'\u0003\u0007XZfo:DAYG\"qy\u0019\u0016dPoe?\rIQ\u0015le-\u0001T\u0016Smxi\u001f\u0017K8EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JREPKd\u001a\u0010U_VvG&\u0000B\u001d`\\qc=\rIQ\u0015vb,DJWAab,\u0000\u0007XZfoi\u001f\u0017K8EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JREPKd\u001a\u0010U_VvG&\u0000B0EPp| \u0007B\u0018@pc\u001b\u0001TYYto;JAWFv] \bCuTpn\u001b\u0001TYYto;JBXT`f,\u0000\u0018wQfc'\u0003\u0007W\u0015le-\u0001\u0007M\u0005\u007f*=\u000b\u0007M\u0004\u007f".length();
                var1_4 = 20;
                var0_5 = -1;
lbl7:
                // 2 sources

                while (true) {
                    v0 = 32;
                    v1 = ++var0_5;
                    v2 = var2_2.substring(v1, v1 + var1_4);
                    v3 = -1;
                    break block9;
                    break;
                }
lbl13:
                // 1 sources

                while (true) {
                    var5[var3_1++] = TrieBasedResolver.a(v0, TrieBasedResolver.c(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    var2_2 = "\u0006\u00133?cD\u0001[\u00033 XB\u0017\u001a\u001a7,x\t\u0002\u0014\u00055\u001ecK\u00006\u00173-XB\u0017\u001a\u001a7,x\t\u0001\u001b\u0017#%oC\u001c'\u0013,&|N\n\u0012V idH\u0000\u0010V:yw\u0007\u0002\u0007\u0019,iq\u0016\u0019";
                    var4_3 = "\u0006\u00133?cD\u0001[\u00033 XB\u0017\u001a\u001a7,x\t\u0002\u0014\u00055\u001ecK\u00006\u00173-XB\u0017\u001a\u001a7,x\t\u0001\u001b\u0017#%oC\u001c'\u0013,&|N\n\u0012V idH\u0000\u0010V:yw\u0007\u0002\u0007\u0019,iq\u0016\u0019".length();
                    var1_4 = 48;
                    var0_5 = -1;
lbl22:
                    // 2 sources

                    while (true) {
                        v0 = 99;
                        v4 = ++var0_5;
                        v2 = var2_2.substring(v4, v4 + var1_4);
                        v3 = 0;
                        break block9;
                        break;
                    }
                    break;
                }
lbl28:
                // 1 sources

                while (true) {
                    var5[var3_1++] = TrieBasedResolver.a(v0, TrieBasedResolver.c(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    break block10;
                    break;
                }
            }
            switch (v3) {
                default: {
                    ** continue;
                }
                ** case 0:
lbl39:
                // 1 sources

                ** continue;
            }
        }
        TrieBasedResolver.k = var5;
        TrieBasedResolver.b = TrieBasedResolver.k[7];
        TrieBasedResolver.d = TrieBasedResolver.k[4];
        TrieBasedResolver.a = Logger.getLogger(TrieBasedResolver.class.getName());
        TrieBasedResolver.NOOP_RESOLVER = new e();
    }

    private static char[] c(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 7);
        }
        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 -> 22;
                    case 1 -> 21;
                    case 2 -> 34;
                    case 3 -> 42;
                    case 4 -> 105;
                    case 5 -> 68;
                    default -> 7;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}