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

import com.l7tech.server.util.SchemaUpdater;
import java.util.logging.Logger;

public class NoOpSchemaUpdater
implements SchemaUpdater {
    private static final Logger a;
    private static final String b;

    @Override
    public void ensureCurrentSchema() throws SchemaUpdater.SchemaException {
        a.info(b);
    }

    /*
     * Enabled aggressive block sorting
     */
    static {
        b = NoOpSchemaUpdater.a(38, NoOpSchemaUpdater.a("1t}xyv7\u0012z}~jz3\u000b~}y\u007fo'\u0016i8o"));
        a = Logger.getLogger(NoOpSchemaUpdater.class.getName());
    }

    private static char[] a(String string) {
        char[] cArray = string.toCharArray();
        if (cArray.length < 2) {
            cArray = cArray;
            cArray[0] = (char)(cArray[0] ^ 0x74);
        }
        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 -> 89;
                    case 1 -> 61;
                    case 2 -> 123;
                    case 3 -> 45;
                    case 4 -> 60;
                    case 5 -> 56;
                    default -> 116;
                })));
                ++n3;
                n4 = n4;
            } while (n4 > n3);
        }
        return new String(cArray2).intern();
    }
}