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

client: rev 198 (#3014)

Browse Source 
* client: rev 198

* client: checkstyle

Co-authored-by: therealnull <therealnull@gmail.com>
This commit is contained in:
Tyler Bochard
2021-07-28 07:24:38 -04:00
committed by GitHub
parent c2af17f765
commit 56ae122b89
466 changed files with 65937 additions and 65851 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -4,61 +4,61 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("kl")
@ObfuscatedName("kh")
@Implements("IterableDualNodeQueueIterator")
public class IterableDualNodeQueueIterator implements Iterator {
@ObfuscatedName("f")
@ObfuscatedName("s")
@ObfuscatedSignature(
descriptor = "Lks;"
descriptor = "Lkc;"
)
@Export("queue")
IterableDualNodeQueue queue;
@ObfuscatedName("e")
@ObfuscatedName("t")
@ObfuscatedSignature(
descriptor = "Lmm;"
descriptor = "Lmw;"
)
@Export("head")
DualNode head;
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lmm;"
descriptor = "Lmw;"
)
@Export("last")
DualNode last;
@ObfuscatedSignature(
descriptor = "(Lks;)V"
descriptor = "(Lkc;)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 void remove() {
if (this.last == null) { // L: 33
throw new IllegalStateException();
} else {
this.last.removeDual(); // L: 34
this.last = null; // L: 35
}
} // L: 36
public boolean hasNext() {
return this.queue.sentinel != this.head; // L: 29
this.last = null;
this.queue = var1;
this.head = this.queue.sentinel.previousDual;
this.last = null;
}
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
DualNode var1 = this.head;
if (var1 == this.queue.sentinel) {
var1 = null;
this.head = null;
} else {
this.head = var1.previousDual; // L: 23
this.head = var1.previousDual;
}
this.last = var1; // L: 24
return var1; // L: 25
this.last = var1;
return var1;
}
public boolean hasNext() {
return this.queue.sentinel != this.head;
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.removeDual();
this.last = null;
}
}
}