project: rev 192

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

@@ -1,29 +1,36 @@
 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("lo")
+@ObfuscatedName("ls")
+@Implements("IterableNodeHashTableIterator")
 public class IterableNodeHashTableIterator implements Iterator {
-	@ObfuscatedName("z")
+	@ObfuscatedName("f")
 	@ObfuscatedSignature(
-		descriptor = "Llq;"
+		descriptor = "Lll;"
 	)
+	@Export("hashTable")
 	IterableNodeHashTable hashTable;
-	@ObfuscatedName("k")
+	@ObfuscatedName("b")
 	@ObfuscatedSignature(
-		descriptor = "Lgw;"
+		descriptor = "Lgn;"
 	)
+	@Export("head")
 	Node head;
-	@ObfuscatedName("s")
+	@ObfuscatedName("l")
+	@Export("index")
 	int index;
-	@ObfuscatedName("t")
+	@ObfuscatedName("m")
 	@ObfuscatedSignature(
-		descriptor = "Lgw;"
+		descriptor = "Lgn;"
 	)
+	@Export("last")
 	Node last;
 
 	@ObfuscatedSignature(
-		descriptor = "(Llq;)V"
+		descriptor = "(Lll;)V"
 	)
 	IterableNodeHashTableIterator(IterableNodeHashTable var1) {
 		this.last = null; // L: 10
@@ -31,13 +38,36 @@ public class IterableNodeHashTableIterator implements Iterator {
 		this.start(); // L: 14
 	} // L: 15
 
-	@ObfuscatedName("x")
+	@ObfuscatedName("e")
+	@Export("start")
 	void start() {
 		this.head = this.hashTable.buckets[0].previous; // L: 18
 		this.index = 1; // L: 19
 		this.last = null; // L: 20
 	} // L: 21
 
+	public Object next() {
+		Node var1;
+		if (this.hashTable.buckets[this.index - 1] != this.head) { // L: 24
+			var1 = this.head; // L: 25
+			this.head = var1.previous; // L: 26
+			this.last = var1; // L: 27
+			return var1; // L: 28
+		} else {
+			do {
+				if (this.index >= this.hashTable.size) { // L: 30
+					return null; // L: 38
+				}
+
+				var1 = this.hashTable.buckets[this.index++].previous; // L: 31
+			} while(var1 == this.hashTable.buckets[this.index - 1]); // L: 32
+
+			this.head = var1.previous; // L: 33
+			this.last = var1; // L: 34
+			return var1; // L: 35
+		}
+	}
+
 	public boolean hasNext() {
 		if (this.hashTable.buckets[this.index - 1] != this.head) { // L: 42
 			return true;
@@ -63,26 +93,4 @@ public class IterableNodeHashTableIterator implements Iterator {
 			this.last = null; // L: 58
 		}
 	} // L: 59
-
-	public Object next() {
-		Node var1;
-		if (this.hashTable.buckets[this.index - 1] != this.head) { // L: 24
-			var1 = this.head; // L: 25
-			this.head = var1.previous; // L: 26
-			this.last = var1; // L: 27
-			return var1; // L: 28
-		} else {
-			do {
-				if (this.index >= this.hashTable.size) { // L: 30
-					return null; // L: 38
-				}
-
-				var1 = this.hashTable.buckets[this.index++].previous; // L: 31
-			} while(var1 == this.hashTable.buckets[this.index - 1]); // L: 32
-
-			this.head = var1.previous; // L: 33
-			this.last = var1; // L: 34
-			return var1; // L: 35
-		}
-	}
 }