package com.l7tech.server.security.rbac;

enum CheckAfter {
   NONE,
   ENTITY,
   HEADER,
   COLLECTION;

   // $VF: Failed to inline enum fields
   // Please report this to the Vineflower issue tracker, at https://github.com/Vineflower/vineflower/issues with a copy of the class file (if you have the rights to distribute it!)
   static {
      String[] var0 = new String[4];
      int var4 = 0;
      String var3 = "\b?%,f \n\u00035($f1s\t5*";
      int var5 = "\b?%,f \n\u00035($f1s\t5*".length();
      char var2 = 6;
      int var7 = -1;

      label25:
      while (true) {
         byte var10000 = 44;
         String var10001 = var3.substring(++var7, var7 + var2);
         byte var10002 = -1;

         while (true) {
            String var8 = a(var10000, a(var10001));
            switch (var10002) {
               case 0:
                  var0[var4++] = var8;
                  if ((var7 += var2) >= var5) {
                     NONE = new CheckAfter();
                     ENTITY = new CheckAfter();
                     HEADER = new CheckAfter();
                     COLLECTION = new CheckAfter();
                     return;
                  }

                  var2 = var3.charAt(var7);
                  break;
               default:
                  var0[var4++] = var8;
                  if ((var7 += var2) < var5) {
                     var2 = var3.charAt(var7);
                     continue label25;
                  }

                  var3 = " \u0011\u0015\u0004R\u000e\u0004+\u0010\u000f\b";
                  var5 = " \u0011\u0015\u0004R\u000e\u0004+\u0010\u000f\b".length();
                  var2 = 6;
                  var7 = -1;
            }

            var10000 = 9;
            var10001 = var3.substring(++var7, var7 + var2);
            var10002 = 0;
         }
      }
   }

   private static char[] a(String var0) {
      char[] var10000 = var0.toCharArray();
      if (var10000.length < 2) {
         var10000[0] = (char)(var10000[0] ^ 11);
      }

      return var10000;
   }

   private static String a(int var0, char[] var1) {
      int var10003 = var1.length;
      int var10002 = var0;
      char[] var10001 = var1;
      int var10000 = var10003;

      for (int var2 = 0; var10000 > var2; var2++) {
         var10001[var2] = (char)(var10001[var2] ^ var10002 ^ switch (var2 % 7) {
            case 0 -> 108;
            case 1 -> 86;
            case 2 -> 72;
            case 3 -> 68;
            case 4 -> 15;
            case 5 -> 94;
            default -> 11;
         });
      }

      return new String(var10001).intern();
   }
}