package com.l7tech.policy.wssp;

import com.l7tech.policy.assertion.Assertion;
import java.util.Map;

class w extends o {
   boolean c = false;
   private static final String[] d;

   @Override
   protected boolean maybeSetSimpleProperty(String var1, boolean var2) {
      if (d[0].equals(var1)) {
         this.c = var2;
         return true;
      } else {
         return super.maybeSetSimpleProperty(var1, var2);
      }
   }

   @Override
   public boolean isSimpleProperty(String var1) throws PolicyConversionException {
      try {
         if (d[1].equals(var1)) {
            return this.c;
         }
      } catch (PolicyConversionException var2) {
         throw a(var2);
      }

      return super.isSimpleProperty(var1);
   }

   protected w(final WsspReader param1) {
      super(null);
   }

   @Override
   protected Map getConverterMap() {
      return WsspReader.b;
   }

   @Override
   protected Assertion recursiveConvertAll(org.apache.ws.policy.Assertion var1) throws PolicyConversionException {
      v var2 = new v(this);
      return a(var2.recursiveConvertAll(var1));
   }

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

   static {
      String[] var5 = new String[2];
      int var3 = 0;
      String var2 = "My\u0017\u0017q{^W~\tMy\u0017\u0017q{^W~";
      int var4 = "My\u0017\u0017q{^W~\tMy\u0017\u0017q{^W~".length();
      char var1 = '\t';
      int var0 = -1;

      while (true) {
         String var10002 = b(48, b(var2.substring(++var0, var0 + var1)));
         byte var10001 = -1;
         var5[var3++] = var10002;
         if ((var0 += var1) >= var4) {
            d = var5;
            return;
         }

         var1 = var2.charAt(var0);
      }
   }

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

      return var10000;
   }

   private static String b(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 -> 20;
            case 1 -> 58;
            case 2 -> 117;
            case 3 -> 66;
            case 4 -> 48;
            case 5 -> 62;
            default -> 11;
         });
      }

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