chore: rev 190

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

@@ -5,20 +5,20 @@ import net.runelite.mapping.Implements;
 import net.runelite.mapping.ObfuscatedName;
 import net.runelite.mapping.ObfuscatedSignature;
 
-@ObfuscatedName("jm")
+@ObfuscatedName("jx")
 @Implements("IterableNodeDeque")
 public class IterableNodeDeque implements Iterable, Collection {
-	@ObfuscatedName("x")
+	@ObfuscatedName("m")
 	@ObfuscatedSignature(
-		signature = "Lga;"
+		signature = "Lgr;"
 	)
 	@Export("sentinel")
 	Node sentinel;
-	@ObfuscatedName("m")
+	@ObfuscatedName("o")
 	@ObfuscatedSignature(
-		signature = "Lga;"
+		signature = "Lgr;"
 	)
-	Node field3530;
+	Node field3565;
 
 	public IterableNodeDeque() {
 		this.sentinel = new Node();
@@ -26,7 +26,7 @@ public class IterableNodeDeque implements Iterable, Collection {
 		this.sentinel.next = this.sentinel;
 	}
 
-	@ObfuscatedName("x")
+	@ObfuscatedName("m")
 	@Export("rsClear")
 	public void rsClear() {
 		while (this.sentinel.previous != this.sentinel) {
@@ -35,9 +35,9 @@ public class IterableNodeDeque implements Iterable, Collection {
 
 	}
 
-	@ObfuscatedName("m")
+	@ObfuscatedName("o")
 	@ObfuscatedSignature(
-		signature = "(Lga;)V"
+		signature = "(Lgr;)V"
 	)
 	@Export("addFirst")
 	public void addFirst(Node var1) {
@@ -51,9 +51,9 @@ public class IterableNodeDeque implements Iterable, Collection {
 		var1.previous.next = var1;
 	}
 
-	@ObfuscatedName("k")
+	@ObfuscatedName("q")
 	@ObfuscatedSignature(
-		signature = "(Lga;)V"
+		signature = "(Lgr;)V"
 	)
 	@Export("addLast")
 	public void addLast(Node var1) {
@@ -67,20 +67,20 @@ public class IterableNodeDeque implements Iterable, Collection {
 		var1.previous.next = var1;
 	}
 
-	@ObfuscatedName("w")
+	@ObfuscatedName("p")
 	@ObfuscatedSignature(
-		signature = "()Lga;"
+		signature = "()Lgr;"
 	)
 	@Export("last")
 	public Node last() {
-		return this.method4895((Node)null);
+		return this.method5064((Node)null);
 	}
 
-	@ObfuscatedName("v")
+	@ObfuscatedName("g")
 	@ObfuscatedSignature(
-		signature = "(Lga;)Lga;"
+		signature = "(Lgr;)Lgr;"
 	)
-	Node method4895(Node var1) {
+	Node method5064(Node var1) {
 		Node var2;
 		if (var1 == null) {
 			var2 = this.sentinel.previous;
@@ -89,32 +89,32 @@ public class IterableNodeDeque implements Iterable, Collection {
 		}
 
 		if (var2 == this.sentinel) {
-			this.field3530 = null;
+			this.field3565 = null;
 			return null;
 		} else {
-			this.field3530 = var2.previous;
+			this.field3565 = var2.previous;
 			return var2;
 		}
 	}
 
-	@ObfuscatedName("q")
+	@ObfuscatedName("n")
 	@ObfuscatedSignature(
-		signature = "()Lga;"
+		signature = "()Lgr;"
 	)
 	@Export("previous")
 	public Node previous() {
-		Node var1 = this.field3530;
+		Node var1 = this.field3565;
 		if (var1 == this.sentinel) {
-			this.field3530 = null;
+			this.field3565 = null;
 			return null;
 		} else {
-			this.field3530 = var1.previous;
+			this.field3565 = var1.previous;
 			return var1;
 		}
 	}
 
-	@ObfuscatedName("z")
-	int method4927() {
+	@ObfuscatedName("u")
+	int method5008() {
 		int var1 = 0;
 
 		for (Node var2 = this.sentinel.previous; var2 != this.sentinel; var2 = var2.previous) {
@@ -124,17 +124,17 @@ public class IterableNodeDeque implements Iterable, Collection {
 		return var1;
 	}
 
-	@ObfuscatedName("t")
-	public boolean method4891() {
+	@ObfuscatedName("a")
+	public boolean method5014() {
 		return this.sentinel.previous == this.sentinel;
 	}
 
-	@ObfuscatedName("e")
+	@ObfuscatedName("z")
 	@ObfuscatedSignature(
-		signature = "()[Lga;"
+		signature = "()[Lgr;"
 	)
-	Node[] method4888() {
-		Node[] var1 = new Node[this.method4927()];
+	Node[] method5010() {
+		Node[] var1 = new Node[this.method5008()];
 		int var2 = 0;
 
 		for (Node var3 = this.sentinel.previous; var3 != this.sentinel; var3 = var3.previous) {
@@ -144,43 +144,31 @@ public class IterableNodeDeque implements Iterable, Collection {
 		return var1;
 	}
 
-	@ObfuscatedName("s")
+	@ObfuscatedName("w")
 	@ObfuscatedSignature(
-		signature = "(Lga;)Z"
+		signature = "(Lgr;)Z"
 	)
-	boolean method4883(Node var1) {
+	boolean method5012(Node var1) {
 		this.addFirst(var1);
 		return true;
 	}
 
-	public int hashCode() {
-		return super.hashCode();
-	}
-
 	public Iterator iterator() {
 		return new IterableNodeDequeDescendingIterator(this);
 	}
 
-	public boolean equals(Object var1) {
-		return super.equals(var1);
-	}
-
-	public boolean removeAll(Collection var1) {
-		throw new RuntimeException();
-	}
-
 	public int size() {
-		return this.method4927();
+		return this.method5008();
+	}
+
+	public boolean isEmpty() {
+		return this.method5014();
 	}
 
 	public boolean contains(Object var1) {
 		throw new RuntimeException();
 	}
 
-	public Object[] toArray() {
-		return this.method4888();
-	}
-
 	public Object[] toArray(Object[] var1) {
 		int var2 = 0;
 
@@ -195,7 +183,11 @@ public class IterableNodeDeque implements Iterable, Collection {
 		throw new RuntimeException();
 	}
 
-	public boolean containsAll(Collection var1) {
+	public boolean addAll(Collection var1) {
+		throw new RuntimeException();
+	}
+
+	public boolean removeAll(Collection var1) {
 		throw new RuntimeException();
 	}
 
@@ -203,25 +195,33 @@ public class IterableNodeDeque implements Iterable, Collection {
 		throw new RuntimeException();
 	}
 
+	public boolean add(Object var1) {
+		return this.method5012((Node)var1);
+	}
+
+	public int hashCode() {
+		return super.hashCode();
+	}
+
+	public boolean containsAll(Collection var1) {
+		throw new RuntimeException();
+	}
+
 	public void clear() {
 		this.rsClear();
 	}
 
-	public boolean add(Object var1) {
-		return this.method4883((Node)var1);
+	public Object[] toArray() {
+		return this.method5010();
 	}
 
-	public boolean isEmpty() {
-		return this.method4891();
+	public boolean equals(Object var1) {
+		return super.equals(var1);
 	}
 
-	public boolean addAll(Collection var1) {
-		throw new RuntimeException();
-	}
-
-	@ObfuscatedName("d")
+	@ObfuscatedName("j")
 	@ObfuscatedSignature(
-		signature = "(Lga;Lga;)V"
+		signature = "(Lgr;Lgr;)V"
 	)
 	@Export("IterableNodeDeque_addBefore")
 	public static void IterableNodeDeque_addBefore(Node var0, Node var1) {