/*
 * Decompiled with CFR 0.152.
 * 
 * Could not load the following classes:
 *  com.l7tech.objectmodel.Entity
 *  com.l7tech.objectmodel.EntityHeader
 *  com.l7tech.objectmodel.FindException
 *  com.l7tech.search.Dependency$DependencyType
 *  com.l7tech.util.Functions$UnaryThrows
 */
package com.l7tech.server.search.processors;

import com.l7tech.objectmodel.Entity;
import com.l7tech.objectmodel.EntityHeader;
import com.l7tech.objectmodel.FindException;
import com.l7tech.search.Dependency;
import com.l7tech.server.search.processors.DefaultDependencyProcessor;
import com.l7tech.server.search.processors.DependencyFinder;
import com.l7tech.util.Functions;

class n
implements Functions.UnaryThrows<DependencyFinder.FindResults<O>, EntityHeader, FindException> {
    final Dependency.DependencyType val$dependencyType;
    final Object val$searchValue;
    final DefaultDependencyProcessor this$0;
    private static final String[] a;

    /*
     * Ignored method signature, as it can't be verified against descriptor
     */
    n(DefaultDependencyProcessor defaultDependencyProcessor, Dependency.DependencyType dependencyType, Object object) {
        this.this$0 = defaultDependencyProcessor;
        this.val$dependencyType = dependencyType;
        this.val$searchValue = object;
    }

    public DependencyFinder.FindResults<O> call(EntityHeader entityHeader) throws FindException {
        try {
            Entity entity = this.this$0.loadEntity(entityHeader);
            return DependencyFinder.FindResults.create(entity, entityHeader);
        }
        catch (ClassCastException classCastException) {
            String[] stringArray = a;
            throw new FindException(stringArray[0] + String.valueOf(this.val$dependencyType.getEntityType()) + stringArray[1] + String.valueOf(this.val$searchValue.getClass()), (Throwable)classCastException);
        }
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        String[] stringArray = new String[2];
        int n2 = 0;
        String string = ".'\b|59\u0013\u000b/\bvz)Cf#|.$G\u0014f\u0005s4#\\\u0019f\u0004wz.R\u001e2Ff5mP\u00024\u0014w99\u0013\u0019?\u0016w`m";
        int n3 = ".'\b|59\u0013\u000b/\bvz)Cf#|.$G\u0014f\u0005s4#\\\u0019f\u0004wz.R\u001e2Ff5mP\u00024\u0014w99\u0013\u0019?\u0016w`m".length();
        int n4 = 12;
        int n5 = -1;
        while (true) {
            int n6 = ++n5;
            stringArray[n2++] = n.a(59, n.a(string.substring(n6, n6 + n4)));
            if ((n5 += n4) >= n3) {
                a = stringArray;
                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] ^ 8);
        }
        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 -> 86;
                    case 1 -> 125;
                    case 2 -> 93;
                    case 3 -> 41;
                    case 4 -> 97;
                    case 5 -> 118;
                    default -> 8;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}