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

rsc: please read the commit message for my neverending descent into madness

Browse Source 
how do i stop making castles
every time i go to the beach i make a castle
every time i open blender i model castles
every time i play chess i castle
i just cant stop making castles dude
This commit is contained in:
ThatGamerBlue
2021-02-26 00:33:45 +00:00
parent 62df7e0ff1
commit 563587e6b0
346 changed files with 84175 additions and 82557 deletions
Download Patch File Download Diff File Expand all files Collapse all files

89
runescape-client/src/main/java/IterableDualNodeQueueIterator.java
View File

@@ -7,53 +7,54 @@ import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("ju")
@Implements("IterableDualNodeQueueIterator")
public class IterableDualNodeQueueIterator implements Iterator {
@ObfuscatedName("n")
@ObfuscatedSignature(
descriptor = "Ljf;"
)
@Export("queue")
IterableDualNodeQueue queue;
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lgj;"
)
@Export("head")
DualNode head;
@ObfuscatedName("d")
@ObfuscatedSignature(
descriptor = "Lgj;"
)
@Export("last")
DualNode last = null;
@ObfuscatedName("n")
@ObfuscatedSignature(
descriptor = "Ljf;"
)
@Export("queue")
IterableDualNodeQueue queue;
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lgj;"
)
@Export("head")
DualNode head;
@ObfuscatedName("d")
@ObfuscatedSignature(
descriptor = "Lgj;"
)
@Export("last")
DualNode last;
@ObfuscatedSignature(
descriptor = "(Ljf;)V"
)
IterableDualNodeQueueIterator(IterableDualNodeQueue var1) {
this.queue = var1;
this.head = this.queue.sentinel.previousDual;
this.last = null;
}
@ObfuscatedSignature(
descriptor = "(Ljf;)V"
)
IterableDualNodeQueueIterator(IterableDualNodeQueue var1) {
this.last = null; // L: 9
this.queue = var1; // L: 12
this.head = this.queue.sentinel.previousDual; // L: 13
this.last = null; // L: 14
} // L: 15
public Object next() {
DualNode var1 = this.head;
if (var1 == this.queue.sentinel) {
var1 = null;
this.head = null;
} else {
this.head = var1.previousDual;
}
public Object next() {
DualNode var1 = this.head; // L: 18
if (var1 == this.queue.sentinel) { // L: 19
var1 = null; // L: 20
this.head = null; // L: 21
} else {
this.head = var1.previousDual; // L: 23
}
this.last = var1;
return var1;
}
this.last = var1; // L: 24
return var1; // L: 25
}
public void remove() {
this.last.removeDual();
this.last = null;
}
public void remove() {
this.last.removeDual(); // L: 34
this.last = null; // L: 35
} // L: 36
public boolean hasNext() {
return this.queue.sentinel != this.head;
}
public boolean hasNext() {
return this.queue.sentinel != this.head; // L: 29
}
}