package com.l7tech.message;

import com.l7tech.util.ConfigFactory;
import com.l7tech.util.Pair;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public abstract class AbstractHttpResponseKnob implements HttpResponseKnob {
   public static final int CUSTOM_ORDER = 3;
   public static final String CHALLENGE_ORDER_PROP;
   protected static final Map<String, Integer> supportedChallenges;
   protected AbstractHttpResponseKnob.ChallengeMode challengeOrder;
   protected final List<Pair<String, Integer>> challengesToSend;
   protected int statusToSet;
   private static final String[] b;

   public AbstractHttpResponseKnob() {
      String[] var1 = b;
      this.challengeOrder = this.getChallengeMode(ConfigFactory.getProperty(var1[0], var1[8]));
      this.challengesToSend = new ArrayList<>();
   }

   protected AbstractHttpResponseKnob.ChallengeMode getChallengeMode(String var1) {
      AbstractHttpResponseKnob.ChallengeMode var2 = AbstractHttpResponseKnob.ChallengeMode.WINDOWS;

      try {
         if (var1 == null || var1.length() <= 0) {
            return var2;
         }
      } catch (IllegalArgumentException var5) {
         throw a(var5);
      }

      try {
         var2 = AbstractHttpResponseKnob.ChallengeMode.valueOf(var1.toUpperCase());
      } catch (IllegalArgumentException var4) {
         var2 = AbstractHttpResponseKnob.ChallengeMode.WINDOWS;
      }

      return var2;
   }

   @Override
   public void addChallenge(String var1) {
      String var10000;
      int var10001;
      label16: {
         try {
            var10000 = var1;
            if (supportedChallenges.containsKey(var1.trim())) {
               var10001 = supportedChallenges.get(var1.trim());
               break label16;
            }
         } catch (IllegalArgumentException var3) {
            throw a(var3);
         }

         var10001 = 3;
      }

      Pair var2 = Pair.pair(var10000, var10001);
      this.challengesToSend.add(var2);
   }

   @Override
   public void setStatus(int var1) {
      this.statusToSet = var1;
   }

   @Override
   public int getStatus() {
      return this.statusToSet;
   }

   static {
      String[] var5 = new String[9];
      int var3 = 0;
      String var2 = "\u000b\u00190\u0015o\u0018}!\u001e\u007f\u0011w\tc\u0005\u0013Q\u000f\u007f\t\u007f\u000f5\u001fp\u0019t\u001b~B:w\u000b~LD&\u0006&\u001fy\u0018h\u0018\u0005 \u0017m\u0014x\u0004,\"R0\t,\u0013y\u0012o\u0005l\u0016\u0013\t#\u0018q\u0013b\u0001b\u0017\u0005";
      int var4 = "\u000b\u00190\u0015o\u0018}!\u001e\u007f\u0011w\tc\u0005\u0013Q\u000f\u007f\t\u007f\u000f5\u001fp\u0019t\u001b~B:w\u000b~LD&\u0006&\u001fy\u0018h\u0018\u0005 \u0017m\u0014x\u0004,\"R0\t,\u0013y\u0012o\u0005l\u0016\u0013\t#\u0018q\u0013b\u0001b\u0017\u0005"
         .length();
      char var1 = 21;
      int var8 = -1;

      label24:
      while (true) {
         byte var10000 = 37;
         String var10001 = var2.substring(++var8, var8 + var1);
         byte var10002 = -1;

         while (true) {
            String var10 = a(var10000, a(var10001));
            switch (var10002) {
               case 0:
                  var5[var3++] = var10;
                  if ((var8 += var1) >= var4) {
                     b = var5;
                     CHALLENGE_ORDER_PROP = b[7];
                     HashMap var6 = new HashMap();
                     String[] var9 = b;
                     var6.put(var9[6], 0);
                     var6.put(var9[3], 1);
                     var6.put(var9[2], 2);
                     var6.put(var9[4], 4);
                     var6.put(var9[5], 8);
                     var6.put(var9[1], 16);
                     supportedChallenges = Collections.unmodifiableMap(var6);
                     return;
                  }

                  var1 = var2.charAt(var8);
                  break;
               default:
                  var5[var3++] = var10;
                  if ((var8 += var1) < var4) {
                     var1 = var2.charAt(var8);
                     continue label24;
                  }

                  var2 = "'5\u001c9C4Q\r2S=[%O)?}#S%S\u000793\\5X7R";
                  var4 = "'5\u001c9C4Q\r2S=[%O)?}#S%S\u000793\\5X7R".length();
                  var1 = 21;
                  var8 = -1;
            }

            var10000 = 9;
            var10001 = var2.substring(++var8, var8 + var1);
            var10002 = 0;
         }
      }
   }

   private static IllegalArgumentException a(IllegalArgumentException var0) {
      return var0;
   }

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

      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 -> 71;
            case 1 -> 83;
            case 2 -> 59;
            case 3 -> 88;
            case 4 -> 62;
            case 5 -> 73;
            default -> 40;
         });
      }

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

   protected static class ChallengeComparator implements Comparator<Pair<String, Integer>> {
      private AbstractHttpResponseKnob.ChallengeMode a;

      public ChallengeComparator(AbstractHttpResponseKnob.ChallengeMode var1) {
         this.a = var1;
      }

      public int compare(Pair<String, Integer> var1, Pair<String, Integer> var2) {
         switch (this.a) {
            case WINDOWS:
            default:
               if (var1 != null && var1.right != null) {
                  if (var2 != null && var2.right != null) {
                     return (Integer)var2.right - (Integer)var1.right;
                  }

                  return -1;
               } else {
                  if (var2 != null && var2.right != null) {
                     return 1;
                  }

                  return 0;
               }
            case REVERSE:
               if (var1 != null && var1.left != null) {
                  return var2 != null && var2.left != null ? ((String)var2.left).compareToIgnoreCase((String)var1.left) : -1;
               } else {
                  return var2 != null && var2.left != null ? 1 : 0;
               }
         }
      }
   }

   protected enum ChallengeMode {
      WINDOWS,
      REVERSE;

      // $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[2];
         int var4 = 0;
         String var3 = "7\t>2\u0000\"&\u00072\u0005&3\u001d&0";
         int var5 = "7\t>2\u0000\"&\u00072\u0005&3\u001d&0".length();
         char var2 = 7;
         int var1 = -1;

         while (true) {
            String var10002 = a(97, a(var3.substring(++var1, var1 + var2)));
            byte var10001 = -1;
            var0[var4++] = var10002;
            if ((var1 += var2) >= var5) {
               WINDOWS = new AbstractHttpResponseKnob.ChallengeMode();
               REVERSE = new AbstractHttpResponseKnob.ChallengeMode();
               return;
            }

            var2 = var3.charAt(var1);
         }
      }

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

         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 -> 1;
               case 1 -> 33;
               case 2 -> 17;
               case 3 -> 23;
               case 4 -> 46;
               case 5 -> 20;
               default -> 20;
            });
         }

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