ra/runelite
1
0
Fork 0
Code Issues Pull Requests Actions 3 Packages Projects Releases Wiki Activity

project: Revvvvvvvvvvvvv

Browse Source
This commit is contained in:
Owain van Brakel
2022-02-09 13:21:03 +01:00
parent e91fc1a16a
commit e505012bff
474 changed files with 69930 additions and 69430 deletions
Download Patch File Download Diff File Expand all files Collapse all files

312
runescape-client/src/main/java/IterableNodeDeque.java
View File

@@ -5,233 +5,233 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("lr")
@ObfuscatedName("lt")
@Implements("IterableNodeDeque")
public class IterableNodeDeque implements Iterable, Collection {
@ObfuscatedName("c")
@ObfuscatedSignature(
descriptor = "Lnw;"
descriptor = "Loe;"
)
@Export("sentinel")
Node sentinel;
@ObfuscatedName("b")
@ObfuscatedName("l")
@ObfuscatedSignature(
descriptor = "Lnw;"
descriptor = "Loe;"
)
Node field3967;
Node field4014;
public IterableNodeDeque() {
this.sentinel = new Node();
this.sentinel.previous = this.sentinel;
this.sentinel.next = this.sentinel;
}
this.sentinel = new Node(); // L: 7
this.sentinel.previous = this.sentinel; // L: 11
this.sentinel.next = this.sentinel; // L: 12
} // L: 13
@ObfuscatedName("c")
@Export("rsClear")
public void rsClear() {
while (this.sentinel.previous != this.sentinel) {
this.sentinel.previous.remove();
while (this.sentinel.previous != this.sentinel) { // L: 16
this.sentinel.previous.remove(); // L: 17
}
}
} // L: 19
@ObfuscatedName("b")
@ObfuscatedName("l")
@ObfuscatedSignature(
descriptor = "(Lnw;)V"
descriptor = "(Loe;)V"
)
@Export("addFirst")
public void addFirst(Node var1) {
if (var1.next != null) {
if (var1.next != null) { // L: 22
var1.remove();
}
var1.next = this.sentinel.next;
var1.previous = this.sentinel;
var1.next.previous = var1;
var1.previous.next = var1;
}
@ObfuscatedName("p")
@ObfuscatedSignature(
descriptor = "(Lnw;)V"
)
@Export("addLast")
public void addLast(Node var1) {
if (var1.next != null) {
var1.remove();
}
var1.next = this.sentinel;
var1.previous = this.sentinel.previous;
var1.next.previous = var1;
var1.previous.next = var1;
}
@ObfuscatedName("t")
@ObfuscatedSignature(
descriptor = "()Lnw;"
)
@Export("last")
public Node last() {
return this.method5912((Node)null);
}
var1.next = this.sentinel.next; // L: 23
var1.previous = this.sentinel; // L: 24
var1.next.previous = var1; // L: 25
var1.previous.next = var1; // L: 26
} // L: 27
@ObfuscatedName("s")
@ObfuscatedSignature(
descriptor = "(Lnw;)Lnw;"
descriptor = "(Loe;)V"
)
Node method5912(Node var1) {
Node var2;
if (var1 == null) {
var2 = this.sentinel.previous;
} else {
var2 = var1;
@Export("addLast")
public void addLast(Node var1) {
if (var1.next != null) { // L: 30
var1.remove();
}
if (var2 == this.sentinel) {
this.field3967 = null;
return null;
} else {
this.field3967 = var2.previous;
return var2;
}
}
@ObfuscatedName("j")
@ObfuscatedSignature(
descriptor = "()Lnw;"
)
@Export("previous")
public Node previous() {
Node var1 = this.field3967;
if (var1 == this.sentinel) {
this.field3967 = null;
return null;
} else {
this.field3967 = var1.previous;
return var1;
}
}
@ObfuscatedName("w")
int method5914() {
int var1 = 0;
for (Node var2 = this.sentinel.previous; var2 != this.sentinel; var2 = var2.previous) {
++var1;
}
return var1;
}
@ObfuscatedName("n")
public boolean method5915() {
return this.sentinel.previous == this.sentinel;
}
var1.next = this.sentinel; // L: 31
var1.previous = this.sentinel.previous; // L: 32
var1.next.previous = var1; // L: 33
var1.previous.next = var1; // L: 34
} // L: 35
@ObfuscatedName("r")
@ObfuscatedSignature(
descriptor = "()[Lnw;"
descriptor = "()Loe;"
)
Node[] method5972() {
Node[] var1 = new Node[this.method5914()];
int var2 = 0;
for (Node var3 = this.sentinel.previous; var3 != this.sentinel; var3 = var3.previous) {
var1[var2++] = var3;
}
return var1;
@Export("last")
public Node last() {
return this.method5879((Node)null); // L: 46
}
@ObfuscatedName("o")
@ObfuscatedSignature(
descriptor = "(Lnw;)Z"
descriptor = "(Loe;)Loe;"
)
boolean method5918(Node var1) {
this.addFirst(var1);
return true;
}
public Iterator iterator() {
return new IterableNodeDequeDescendingIterator(this);
}
public boolean addAll(Collection var1) {
throw new RuntimeException();
}
public boolean contains(Object var1) {
throw new RuntimeException();
}
public Object[] toArray() {
return this.method5972();
}
public Object[] toArray(Object[] var1) {
int var2 = 0;
for (Node var3 = this.sentinel.previous; var3 != this.sentinel; var3 = var3.previous) {
var1[var2++] = var3;
Node method5879(Node var1) {
Node var2;
if (var1 == null) { // L: 52
var2 = this.sentinel.previous;
} else {
var2 = var1; // L: 53
}
return var1;
if (var2 == this.sentinel) { // L: 54
this.field4014 = null; // L: 55
return null; // L: 56
} else {
this.field4014 = var2.previous; // L: 58
return var2; // L: 59
}
}
public boolean remove(Object var1) {
throw new RuntimeException();
@ObfuscatedName("i")
@ObfuscatedSignature(
descriptor = "()Loe;"
)
@Export("previous")
public Node previous() {
Node var1 = this.field4014; // L: 64
if (var1 == this.sentinel) { // L: 65
this.field4014 = null; // L: 66
return null; // L: 67
} else {
this.field4014 = var1.previous; // L: 69
return var1; // L: 70
}
}
public boolean containsAll(Collection var1) {
throw new RuntimeException();
@ObfuscatedName("w")
int method5881() {
int var1 = 0; // L: 74
for (Node var2 = this.sentinel.previous; var2 != this.sentinel; var2 = var2.previous) { // L: 75 76 78
++var1; // L: 77
}
return var1; // L: 80
}
public boolean removeAll(Collection var1) {
throw new RuntimeException();
@ObfuscatedName("v")
public boolean method5882() {
return this.sentinel.previous == this.sentinel; // L: 84
}
public void clear() {
this.rsClear();
@ObfuscatedName("a")
@ObfuscatedSignature(
descriptor = "()[Loe;"
)
Node[] method5948() {
Node[] var1 = new Node[this.method5881()]; // L: 88
int var2 = 0; // L: 89
for (Node var3 = this.sentinel.previous; var3 != this.sentinel; var3 = var3.previous) { // L: 90 91 93
var1[var2++] = var3; // L: 92
}
return var1; // L: 95
}
public boolean add(Object var1) {
return this.method5918((Node)var1);
}
public boolean equals(Object var1) {
return super.equals(var1);
@ObfuscatedName("y")
@ObfuscatedSignature(
descriptor = "(Loe;)Z"
)
boolean method5885(Node var1) {
this.addFirst(var1); // L: 135
return true; // L: 136
}
public int hashCode() {
return super.hashCode();
return super.hashCode(); // L: 178
}
public boolean isEmpty() {
return this.method5915();
return this.method5882(); // L: 109
}
public boolean contains(Object var1) {
throw new RuntimeException(); // L: 114
}
public Object[] toArray() {
return this.method5948(); // L: 119
}
public Object[] toArray(Object[] var1) {
int var2 = 0; // L: 125
for (Node var3 = this.sentinel.previous; var3 != this.sentinel; var3 = var3.previous) { // L: 126 127 129
var1[var2++] = var3; // L: 128
}
return var1; // L: 131
}
public boolean remove(Object var1) {
throw new RuntimeException(); // L: 141
}
public boolean containsAll(Collection var1) {
throw new RuntimeException(); // L: 146
}
public boolean removeAll(Collection var1) {
throw new RuntimeException(); // L: 156
}
public void clear() {
this.rsClear(); // L: 166
} // L: 167
public boolean add(Object var1) {
return this.method5885((Node)var1); // L: 170
}
public boolean equals(Object var1) {
return super.equals(var1); // L: 174
}
public boolean retainAll(Collection var1) {
throw new RuntimeException();
throw new RuntimeException(); // L: 161
}
public Iterator iterator() {
return new IterableNodeDequeDescendingIterator(this); // L: 99
}
public boolean addAll(Collection var1) {
throw new RuntimeException(); // L: 151
}
public int size() {
return this.method5914();
return this.method5881(); // L: 104
}
@ObfuscatedName("m")
@ObfuscatedName("e")
@ObfuscatedSignature(
descriptor = "(Lnw;Lnw;)V"
descriptor = "(Loe;Loe;)V"
)
@Export("IterableNodeDeque_addBefore")
public static void IterableNodeDeque_addBefore(Node var0, Node var1) {
if (var0.next != null) {
if (var0.next != null) { // L: 38
var0.remove();
}
var0.next = var1;
var0.previous = var1.previous;
var0.next.previous = var0;
var0.previous.next = var0;
}
var0.next = var1; // L: 39
var0.previous = var1.previous; // L: 40
var0.next.previous = var0; // L: 41
var0.previous.next = var0; // L: 42
} // L: 43
}