project: rev 195

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

@@ -4,33 +4,33 @@ import net.runelite.mapping.Implements;
 import net.runelite.mapping.ObfuscatedName;
 import net.runelite.mapping.ObfuscatedSignature;
 
-@ObfuscatedName("lj")
+@ObfuscatedName("mq")
 @Implements("IterableNodeHashTableIterator")
 public class IterableNodeHashTableIterator implements Iterator {
-	@ObfuscatedName("n")
+	@ObfuscatedName("f")
 	@ObfuscatedSignature(
-		descriptor = "Llg;"
+		descriptor = "Lme;"
 	)
 	@Export("hashTable")
 	IterableNodeHashTable hashTable;
-	@ObfuscatedName("v")
+	@ObfuscatedName("o")
 	@ObfuscatedSignature(
-		descriptor = "Lga;"
+		descriptor = "Lmh;"
 	)
 	@Export("head")
 	Node head;
-	@ObfuscatedName("d")
+	@ObfuscatedName("u")
 	@Export("index")
 	int index;
-	@ObfuscatedName("c")
+	@ObfuscatedName("p")
 	@ObfuscatedSignature(
-		descriptor = "Lga;"
+		descriptor = "Lmh;"
 	)
 	@Export("last")
 	Node last;
 
 	@ObfuscatedSignature(
-		descriptor = "(Llg;)V"
+		descriptor = "(Lme;)V"
 	)
 	IterableNodeHashTableIterator(IterableNodeHashTable var1) {
 		this.last = null; // L: 10
@@ -38,7 +38,7 @@ public class IterableNodeHashTableIterator implements Iterator {
 		this.start(); // L: 14
 	} // L: 15
 
-	@ObfuscatedName("e")
+	@ObfuscatedName("f")
 	@Export("start")
 	void start() {
 		this.head = this.hashTable.buckets[0].previous; // L: 18
@@ -46,28 +46,6 @@ public class IterableNodeHashTableIterator implements Iterator {
 		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;
@@ -93,4 +71,26 @@ 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
+		}
+	}
 }