chore: rev 193

runescape-client/src/main/java/IterableDualNodeQueueIterator.java

@@ -4,61 +4,61 @@ import net.runelite.mapping.Implements;
 import net.runelite.mapping.ObfuscatedName;
 import net.runelite.mapping.ObfuscatedSignature;
 
-@ObfuscatedName("jb")
+@ObfuscatedName("jw")
 @Implements("IterableDualNodeQueueIterator")
 public class IterableDualNodeQueueIterator implements Iterator {
-	@ObfuscatedName("f")
+	@ObfuscatedName("h")
 	@ObfuscatedSignature(
-		descriptor = "Ljt;"
+		descriptor = "Ljf;"
 	)
 	@Export("queue")
 	IterableDualNodeQueue queue;
-	@ObfuscatedName("b")
+	@ObfuscatedName("v")
 	@ObfuscatedSignature(
-		descriptor = "Lgp;"
+		descriptor = "Lgj;"
 	)
 	@Export("head")
 	DualNode head;
-	@ObfuscatedName("l")
+	@ObfuscatedName("x")
 	@ObfuscatedSignature(
-		descriptor = "Lgp;"
+		descriptor = "Lgj;"
 	)
 	@Export("last")
 	DualNode last;
 
 	@ObfuscatedSignature(
-		descriptor = "(Ljt;)V"
+		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; // 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 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 void remove() {
-		if (this.last == null) { // L: 33
+		if (this.last == null) {
 			throw new IllegalStateException();
 		} else {
-			this.last.removeDual(); // L: 34
-			this.last = null; // L: 35
+			this.last.removeDual();
+			this.last = null;
 		}
-	} // L: 36
+	}
+
+	public Object next() {
+		DualNode var1 = this.head;
+		if (var1 == this.queue.sentinel) {
+			var1 = null;
+			this.head = null;
+		} else {
+			this.head = var1.previousDual;
+		}
+
+		this.last = var1;
+		return var1;
+	}
+
+	public boolean hasNext() {
+		return this.queue.sentinel != this.head;
+	}
 }