runescape-client: fix the thing

This commit is contained in:
ThatGamerBlue
2020-12-11 06:14:29 +00:00
parent f74baf08ce
commit 463bc42f5f
325 changed files with 35526 additions and 35531 deletions

View File

@@ -21,19 +21,19 @@ public class IterableDualNodeQueue implements Iterable {
DualNode head;
public IterableDualNodeQueue() {
this.sentinel = new DualNode();
this.sentinel.previousDual = this.sentinel;
this.sentinel.nextDual = this.sentinel;
}
this.sentinel = new DualNode(); // L: 7
this.sentinel.previousDual = this.sentinel; // L: 11
this.sentinel.nextDual = this.sentinel; // L: 12
} // L: 13
@ObfuscatedName("h")
@Export("clear")
public void clear() {
while (this.sentinel.previousDual != this.sentinel) {
this.sentinel.previousDual.removeDual();
while (this.sentinel.previousDual != this.sentinel) { // L: 16
this.sentinel.previousDual.removeDual(); // L: 17
}
}
} // L: 19
@ObfuscatedName("v")
@ObfuscatedSignature(
@@ -41,15 +41,15 @@ public class IterableDualNodeQueue implements Iterable {
)
@Export("add")
public void add(DualNode var1) {
if (var1.nextDual != null) {
if (var1.nextDual != null) { // L: 22
var1.removeDual();
}
var1.nextDual = this.sentinel.nextDual;
var1.previousDual = this.sentinel;
var1.nextDual.previousDual = var1;
var1.previousDual.nextDual = var1;
}
var1.nextDual = this.sentinel.nextDual; // L: 23
var1.previousDual = this.sentinel; // L: 24
var1.nextDual.previousDual = var1; // L: 25
var1.previousDual.nextDual = var1; // L: 26
} // L: 27
@ObfuscatedName("w")
@ObfuscatedSignature(
@@ -57,12 +57,12 @@ public class IterableDualNodeQueue implements Iterable {
)
@Export("removeLast")
public DualNode removeLast() {
DualNode var1 = this.sentinel.previousDual;
DualNode var1 = this.sentinel.previousDual; // L: 38
if (var1 == this.sentinel) {
return null;
return null; // L: 39
} else {
var1.removeDual();
return var1;
var1.removeDual(); // L: 40
return var1; // L: 41
}
}
@@ -72,7 +72,7 @@ public class IterableDualNodeQueue implements Iterable {
)
@Export("last")
public DualNode last() {
return this.previousOrLast((DualNode)null);
return this.previousOrLast((DualNode)null); // L: 45
}
@ObfuscatedName("j")
@@ -82,18 +82,18 @@ public class IterableDualNodeQueue implements Iterable {
@Export("previousOrLast")
DualNode previousOrLast(DualNode var1) {
DualNode var2;
if (var1 == null) {
if (var1 == null) { // L: 50
var2 = this.sentinel.previousDual;
} else {
var2 = var1;
var2 = var1; // L: 51
}
if (var2 == this.sentinel) {
this.head = null;
return null;
if (var2 == this.sentinel) { // L: 52
this.head = null; // L: 53
return null; // L: 54
} else {
this.head = var2.previousDual;
return var2;
this.head = var2.previousDual; // L: 56
return var2; // L: 57
}
}
@@ -103,18 +103,18 @@ public class IterableDualNodeQueue implements Iterable {
)
@Export("previous")
public DualNode previous() {
DualNode var1 = this.head;
if (var1 == this.sentinel) {
this.head = null;
return null;
DualNode var1 = this.head; // L: 61
if (var1 == this.sentinel) { // L: 62
this.head = null; // L: 63
return null; // L: 64
} else {
this.head = var1.previousDual;
return var1;
this.head = var1.previousDual; // L: 66
return var1; // L: 67
}
}
public Iterator iterator() {
return new IterableDualNodeQueueIterator(this);
return new IterableDualNodeQueueIterator(this); // L: 71
}
@ObfuscatedName("x")
@@ -123,13 +123,13 @@ public class IterableDualNodeQueue implements Iterable {
)
@Export("DualNodeDeque_addBefore")
public static void DualNodeDeque_addBefore(DualNode var0, DualNode var1) {
if (var0.nextDual != null) {
if (var0.nextDual != null) { // L: 30
var0.removeDual();
}
var0.nextDual = var1;
var0.previousDual = var1.previousDual;
var0.nextDual.previousDual = var0;
var0.previousDual.nextDual = var0;
}
var0.nextDual = var1; // L: 31
var0.previousDual = var1.previousDual; // L: 32
var0.nextDual.previousDual = var0; // L: 33
var0.previousDual.nextDual = var0; // L: 34
} // L: 35
}