Beispiel #1
0
 final void method578(int i, int i_2_) {
   if (i == 2) {
     anInt1093++;
     if (Class101_Sub1.aClass246_5675 != null) {
       for (Class348_Sub42_Sub8 class348_sub42_sub8 = ((Class348_Sub42_Sub8) queue.getFirst());
           class348_sub42_sub8 != null;
           class348_sub42_sub8 = ((Class348_Sub42_Sub8) queue.next())) {
         if (!class348_sub42_sub8.method3195(-4)) {
           if ((++((SubNode) class348_sub42_sub8).subnodeKey ^ 0xffffffffffffffffL)
               < ((long) i_2_ ^ 0xffffffffffffffffL)) {
             Class348_Sub42_Sub8 class348_sub42_sub8_3_ =
                 Class101_Sub1.aClass246_5675.method1888(3, class348_sub42_sub8);
             hashTable.putNode((((Node) class348_sub42_sub8).nodeKey), class348_sub42_sub8_3_);
             Class59_Sub2_Sub2.method573(class348_sub42_sub8_3_, class348_sub42_sub8, (byte) 63);
             class348_sub42_sub8.removeNode();
             class348_sub42_sub8.removeSubnode();
           }
         } else if (class348_sub42_sub8.method3193(100) == null) {
           class348_sub42_sub8.removeNode();
           class348_sub42_sub8.removeSubnode();
           anInt1086 += (((Class348_Sub42_Sub8) class348_sub42_sub8).anInt9545);
         }
       }
     }
   }
 }
Beispiel #2
0
 final Object method583(long key, int i) {
   try {
     int i_6_ = -59 % ((i - 2) / 47);
     anInt1085++;
     Class348_Sub42_Sub8 class348_sub42_sub8 = (Class348_Sub42_Sub8) hashTable.get(key);
     if (class348_sub42_sub8 == null) return null;
     Object object = class348_sub42_sub8.method3193(86);
     if (object == null) {
       class348_sub42_sub8.removeNode();
       class348_sub42_sub8.removeSubnode();
       anInt1086 += ((Class348_Sub42_Sub8) class348_sub42_sub8).anInt9545;
       return null;
     }
     if (class348_sub42_sub8.method3195(-4)) {
       Class348_Sub42_Sub8_Sub2 class348_sub42_sub8_sub2 =
           new Class348_Sub42_Sub8_Sub2(
               object, (((Class348_Sub42_Sub8) class348_sub42_sub8).anInt9545));
       hashTable.putNode((((Node) class348_sub42_sub8).nodeKey), class348_sub42_sub8_sub2);
       queue.add(class348_sub42_sub8_sub2);
       ((SubNode) class348_sub42_sub8_sub2).subnodeKey = 0L;
       class348_sub42_sub8.removeNode();
       class348_sub42_sub8.removeSubnode();
     } else {
       queue.add(class348_sub42_sub8);
       ((SubNode) class348_sub42_sub8).subnodeKey = 0L;
     }
     return object;
   } catch (RuntimeException runtimeexception) {
     throw Class348_Sub17.method2929(runtimeexception, "jr.K(" + key + ',' + i + ')');
   }
 }
Beispiel #3
0
 final void put(int i, Object object, long key, int i_5_) {
   try {
     anInt1092++;
     if (i_5_ > anInt1084) throw new IllegalStateException("s>cs");
     method586(key);
     anInt1086 -= i_5_;
     while ((anInt1086 ^ 0xffffffff) > -1) {
       Class348_Sub42_Sub8 class348_sub42_sub8 = ((Class348_Sub42_Sub8) queue.removeFirst());
       method585(class348_sub42_sub8, i ^ ~0x7cfa);
     }
     Class348_Sub42_Sub8_Sub2 class348_sub42_sub8_sub2 =
         new Class348_Sub42_Sub8_Sub2(object, i_5_);
     hashTable.putNode(key, class348_sub42_sub8_sub2);
     if (i != 31902) anInt1086 = -106;
     queue.add(class348_sub42_sub8_sub2);
     ((SubNode) class348_sub42_sub8_sub2).subnodeKey = 0L;
   } catch (RuntimeException runtimeexception) {
     throw Class348_Sub17.method2929(
         runtimeexception,
         ("jr.E(" + i + ',' + (object != null ? "{...}" : "null") + ',' + key + ',' + i_5_ + ')'));
   }
 }