/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.objectmodel.FindException
 *  com.l7tech.search.Dependency
 *  org.jetbrains.annotations.NotNull
 *  org.jetbrains.annotations.Nullable
 */
package com.l7tech.server.search.processors;

import com.l7tech.objectmodel.FindException;
import com.l7tech.search.Dependency;
import com.l7tech.server.search.exceptions.CannotRetrieveDependenciesException;
import com.l7tech.server.search.processors.DefaultDependencyProcessor;
import com.l7tech.server.search.processors.DependencyFinder;
import com.l7tech.server.search.processors.t;
import java.lang.reflect.Method;
import java.util.ArrayList;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;

class k
implements t<FindException> {
    final ArrayList val$dependencies;
    final DependencyFinder val$finder;
    final Object val$object;
    private static final String[] a;

    /*
     * Ignored method signature, as it can't be verified against descriptor
     */
    k(DefaultDependencyProcessor defaultDependencyProcessor, ArrayList arrayList, DependencyFinder dependencyFinder, Object object) {
        this.val$dependencies = arrayList;
        this.val$finder = dependencyFinder;
        this.val$object = object;
    }

    @Override
    public void process(@NotNull Object object, @NotNull Method method, @Nullable Dependency dependency) throws CannotRetrieveDependenciesException, FindException {
        try {
            if (object == null) {
                k.a(0);
            }
        }
        catch (CannotRetrieveDependenciesException cannotRetrieveDependenciesException) {
            throw k.a(cannotRetrieveDependenciesException);
        }
        try {
            if (method == null) {
                k.a(1);
            }
        }
        catch (CannotRetrieveDependenciesException cannotRetrieveDependenciesException) {
            throw k.a(cannotRetrieveDependenciesException);
        }
        this.val$dependencies.addAll(this.val$finder.getDependenciesFromObjects(this.val$object, this.val$finder, DefaultDependencyProcessor.a(dependency, object, this.val$finder)));
    }

    /*
     * Exception decompiling
     */
    private static void a(int var0) {
        /*
         * This method has failed to decompile.  When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file.
         * 
         * org.benf.cfr.reader.util.ConfusedCFRException: Tried to end blocks [0[TRYBLOCK]], but top level block is 1[SWITCH]
         *     at org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.processEndingBlocks(Op04StructuredStatement.java:435)
         *     at org.benf.cfr.reader.bytecode.analysis.opgraph.Op04StructuredStatement.buildNestedBlocks(Op04StructuredStatement.java:484)
         *     at org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.createInitialStructuredBlock(Op03SimpleStatement.java:736)
         *     at org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:850)
         *     at org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:278)
         *     at org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:201)
         *     at org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:94)
         *     at org.benf.cfr.reader.entities.Method.analyse(Method.java:531)
         *     at org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:1055)
         *     at org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:942)
         *     at org.benf.cfr.reader.Driver.doJarVersionTypes(Driver.java:257)
         *     at org.benf.cfr.reader.Driver.doJar(Driver.java:139)
         *     at org.benf.cfr.reader.CfrDriverImpl.analyse(CfrDriverImpl.java:76)
         *     at org.benf.cfr.reader.Main.main(Main.java:54)
         */
        throw new IllegalStateException("Decompilation failed");
    }

    private static Exception a(Exception exception) {
        return exception;
    }

    /*
     * Unable to fully structure code
     */
    static {
        block10: {
            block9: {
                var5 = new String[5];
                var3_1 = 0;
                var2_2 = ";B\u00119\u0016C\u0014\u000e\u0010\u0010#\t\u0006:4_\u0002\u0002\u000eJ\u0016Z@\u0017>\u001aK\u001f\u000eU\u0004l\\\u0003\t]\u0010\u0019*[\u0003\tT\u0015\u0005l\u0016S\t\u000e\u0010\u0018#\u000f\u0006\u0018\u001f\u0010\u00189\u0017J%\u0019_\u001bc\u0017\u0011\u000e\u001fS\u001ec\bC\b\fU\u0004c\bC\u001b\bS\u001ec\u000bT\u0015\u0019U\u0005?\u0014T\tU[\u0006\u0017U\u0002$\u0014B";
                var4_3 = ";B\u00119\u0016C\u0014\u000e\u0010\u0010#\t\u0006:4_\u0002\u0002\u000eJ\u0016Z@\u0017>\u001aK\u001f\u000eU\u0004l\\\u0003\t]\u0010\u0019*[\u0003\tT\u0015\u0005l\u0016S\t\u000e\u0010\u0018#\u000f\u0006\u0018\u001f\u0010\u00189\u0017J%\u0019_\u001bc\u0017\u0011\u000e\u001fS\u001ec\bC\b\fU\u0004c\bC\u001b\bS\u001ec\u000bT\u0015\u0019U\u0005?\u0014T\tU[\u0006\u0017U\u0002$\u0014B".length();
                var1_4 = 62;
                var0_5 = -1;
lbl7:
                // 2 sources

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

                while (true) {
                    var5[var3_1++] = k.a(v0, k.a(v2));
                    if ((var0_5 += var1_4) < var4_3) {
                        var1_4 = var2_2.charAt(var0_5);
                        ** continue;
                    }
                    var2_2 = "A\tRdU\u001eB\u0011\\\u001eIo_\tcT\u000fHu^;P]\u000eX";
                    var4_3 = "A\tRdU\u001eB\u0011\\\u001eIo_\tcT\u000fHu^;P]\u000eX".length();
                    var1_4 = 7;
                    var0_5 = -1;
lbl22:
                    // 2 sources

                    while (true) {
                        v0 = 42;
                        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++] = k.a(v0, k.a(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;
            }
        }
        k.a = var5;
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x1B);
        }
        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 -> 27;
                    case 1 -> 81;
                    case 2 -> 23;
                    case 3 -> 45;
                    case 4 -> 26;
                    case 5 -> 71;
                    default -> 27;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}