More refactoring (tm)

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

@@ -40,15 +40,15 @@ public class IterableNodeDeque implements Iterable {
       signature = "(Lgw;)V"
    )
    @Export("addFirst")
-   public void addFirst(Node var1) {
-      if (var1.next != null) {
-         var1.remove();
+   public void addFirst(Node node) {
+      if (node.next != null) {
+         node.remove();
       }
 
-      var1.next = this.sentinel.next;
-      var1.previous = this.sentinel;
-      var1.next.previous = var1;
-      var1.previous.next = var1;
+      node.next = this.sentinel.next;
+      node.previous = this.sentinel;
+      node.next.previous = node;
+      node.previous.next = node;
    }
 
    @ObfuscatedName("q")
@@ -56,15 +56,15 @@ public class IterableNodeDeque implements Iterable {
       signature = "(Lgw;)V"
    )
    @Export("addLast")
-   public void addLast(Node var1) {
-      if (var1.next != null) {
-         var1.remove();
+   public void addLast(Node node) {
+      if (node.next != null) {
+         node.remove();
       }
 
-      var1.next = this.sentinel;
-      var1.previous = this.sentinel.previous;
-      var1.next.previous = var1;
-      var1.previous.next = var1;
+      node.next = this.sentinel;
+      node.previous = this.sentinel.previous;
+      node.next.previous = node;
+      node.previous.next = node;
    }
 
    @ObfuscatedName("o")
@@ -81,12 +81,12 @@ public class IterableNodeDeque implements Iterable {
       signature = "(Lgw;)Lgw;"
    )
    @Export("previousOrLast")
-   Node previousOrLast(Node var1) {
+   Node previousOrLast(Node node) {
       Node var2;
-      if (var1 == null) {
+      if (node == null) {
          var2 = this.sentinel.previous;
       } else {
-         var2 = var1;
+         var2 = node;
       }
 
       if (var2 == this.sentinel) {
@@ -131,14 +131,14 @@ public class IterableNodeDeque implements Iterable {
       signature = "(Lgw;Lgw;)V"
    )
    @Export("IterableNodeDeque_addBefore")
-   public static void IterableNodeDeque_addBefore(Node var0, Node var1) {
-      if (var0.next != null) {
-         var0.remove();
+   public static void IterableNodeDeque_addBefore(Node node, Node old) {
+      if (node.next != null) {
+         node.remove();
       }
 
-      var0.next = var1;
-      var0.previous = var1.previous;
-      var0.next.previous = var0;
-      var0.previous.next = var0;
+      node.next = old;
+      node.previous = old.previous;
+      node.next.previous = node;
+      node.previous.next = node;
    }
 }