ra/runelite
1
0
Fork 0
Code Issues Pull Requests Actions 3 Packages Projects Releases Wiki Activity

project: rev 192

Browse Source
This commit is contained in:
ThatGamerBlue
2020-10-21 14:30:57 +02:00
parent 47583ab7c6
commit 88599e5dd3
355 changed files with 53400 additions and 49134 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
runescape-client/src/main/java/IterableDualNodeQueue.java
View File

@@ -1,18 +1,23 @@
import java.util.Iterator;
import net.runelite.mapping.Export;
import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("jh")
@ObfuscatedName("jt")
@Implements("IterableDualNodeQueue")
public class IterableDualNodeQueue implements Iterable {
@ObfuscatedName("z")
@ObfuscatedName("f")
@ObfuscatedSignature(
descriptor = "Lgs;"
descriptor = "Lgp;"
)
@Export("sentinel")
public DualNode sentinel;
@ObfuscatedName("k")
@ObfuscatedName("b")
@ObfuscatedSignature(
descriptor = "Lgs;"
descriptor = "Lgp;"
)
@Export("head")
DualNode head;
public IterableDualNodeQueue() {
@@ -21,7 +26,8 @@ public class IterableDualNodeQueue implements Iterable {
this.sentinel.nextDual = this.sentinel; // L: 12
} // L: 13
@ObfuscatedName("z")
@ObfuscatedName("f")
@Export("clear")
public void clear() {
while (this.sentinel.previousDual != this.sentinel) { // L: 16
this.sentinel.previousDual.removeDual(); // L: 17
@@ -29,10 +35,11 @@ public class IterableDualNodeQueue implements Iterable {
} // L: 19
@ObfuscatedName("k")
@ObfuscatedName("b")
@ObfuscatedSignature(
descriptor = "(Lgs;)V"
descriptor = "(Lgp;)V"
)
@Export("add")
public void add(DualNode var1) {
if (var1.nextDual != null) { // L: 22
var1.removeDual();
@@ -44,10 +51,11 @@ public class IterableDualNodeQueue implements Iterable {
var1.previousDual.nextDual = var1; // L: 26
} // L: 27
@ObfuscatedName("t")
@ObfuscatedName("m")
@ObfuscatedSignature(
descriptor = "()Lgs;"
descriptor = "()Lgp;"
)
@Export("removeLast")
public DualNode removeLast() {
DualNode var1 = this.sentinel.previousDual; // L: 38
if (var1 == this.sentinel) {
@@ -58,18 +66,20 @@ public class IterableDualNodeQueue implements Iterable {
}
}
@ObfuscatedName("i")
@ObfuscatedName("z")
@ObfuscatedSignature(
descriptor = "()Lgs;"
descriptor = "()Lgp;"
)
@Export("last")
public DualNode last() {
return this.previousOrLast((DualNode)null); // L: 45
}
@ObfuscatedName("o")
@ObfuscatedName("q")
@ObfuscatedSignature(
descriptor = "(Lgs;)Lgs;"
descriptor = "(Lgp;)Lgp;"
)
@Export("previousOrLast")
DualNode previousOrLast(DualNode var1) {
DualNode var2;
if (var1 == null) { // L: 50
@@ -87,10 +97,11 @@ public class IterableDualNodeQueue implements Iterable {
}
}
@ObfuscatedName("x")
@ObfuscatedName("k")
@ObfuscatedSignature(
descriptor = "()Lgs;"
descriptor = "()Lgp;"
)
@Export("previous")
public DualNode previous() {
DualNode var1 = this.head; // L: 61
if (var1 == this.sentinel) { // L: 62
@@ -106,10 +117,11 @@ public class IterableDualNodeQueue implements Iterable {
return new IterableDualNodeQueueIterator(this); // L: 71
}
@ObfuscatedName("s")
@ObfuscatedName("l")
@ObfuscatedSignature(
descriptor = "(Lgs;Lgs;)V"
descriptor = "(Lgp;Lgp;)V"
)
@Export("DualNodeDeque_addBefore")
public static void DualNodeDeque_addBefore(DualNode var0, DualNode var1) {
if (var0.nextDual != null) { // L: 30
var0.removeDual();