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

Merge remote-tracking branch 'upstream/master' into master

Browse Source 
Nice insider info btw, be nice if you shared it, so-called "open source" client.
This commit is contained in:
ThatGamerBlue
2021-05-28 21:39:25 +01:00
parent a0ae15df6e 04dc76bbfd
commit 38634fcad3
481 changed files with 53410 additions and 51723 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -4,22 +4,22 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("kp")
@ObfuscatedName("kg")
@Implements("IterableDualNodeQueueIterator")
public class IterableDualNodeQueueIterator implements Iterator {
@ObfuscatedName("h")
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lkd;"
descriptor = "Lko;"
)
@Export("queue")
IterableDualNodeQueue queue;
@ObfuscatedName("c")
@ObfuscatedName("n")
@ObfuscatedSignature(
descriptor = "Lmf;"
)
@Export("head")
DualNode head;
@ObfuscatedName("o")
@ObfuscatedName("f")
@ObfuscatedSignature(
descriptor = "Lmf;"
)
@@ -27,7 +27,7 @@ public class IterableDualNodeQueueIterator implements Iterator {
DualNode last;
@ObfuscatedSignature(
descriptor = "(Lkd;)V"
descriptor = "(Lko;)V"
)
IterableDualNodeQueueIterator(IterableDualNodeQueue var1) {
this.last = null; // L: 9
@@ -36,19 +36,6 @@ public class IterableDualNodeQueueIterator implements Iterator {
this.last = null; // L: 14
} // L: 15
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; // L: 24
return var1; // L: 25
}
public void remove() {
if (this.last == null) { // L: 33
throw new IllegalStateException();
@@ -61,4 +48,17 @@ public class IterableDualNodeQueueIterator implements Iterator {
public boolean hasNext() {
return this.queue.sentinel != this.head; // L: 29
}
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; // L: 24
return var1; // L: 25
}
}