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

Use newer version of fernflower and remove __xx names

Browse Source
This commit is contained in:
Lucas
2019-07-04 23:51:52 +02:00
parent 1f2a9b21d6
commit a8d801d830
294 changed files with 27369 additions and 27322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
runescape-client/src/main/java/IterableNodeHashTableIterator.java
View File

@@ -17,68 +17,67 @@ public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedSignature(
signature = "Lgw;"
)
Node __f;
Node field442;
@ObfuscatedName("q")
int __q;
int field443;
@ObfuscatedName("w")
@ObfuscatedSignature(
signature = "Lgw;"
)
Node __w;
Node field444;
@ObfuscatedSignature(
signature = "(Llh;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.__w = null;
this.field444 = null;
this.hashTable = var1;
this.__u_483();
this.method157();
}
@ObfuscatedName("u")
void __u_483() {
this.__f = this.hashTable.buckets[0].previous;
this.__q = 1;
this.__w = null;
void method157() {
this.field442 = this.hashTable.buckets[0].previous;
this.field443 = 1;
this.field444 = null;
}
@Export("next")
@ObfuscatedName("next")
public Object next() {
Node var1;
if(this.hashTable.buckets[this.__q - 1] != this.__f) {
var1 = this.__f;
this.__f = var1.previous;
this.__w = var1;
if (this.hashTable.buckets[this.field443 - 1] != this.field442) {
var1 = this.field442;
this.field442 = var1.previous;
this.field444 = var1;
return var1;
} else {
do {
if(this.__q >= this.hashTable.size) {
return null;
while (this.field443 < this.hashTable.size) {
var1 = this.hashTable.buckets[this.field443++].previous;
if (var1 != this.hashTable.buckets[this.field443 - 1]) {
this.field442 = var1.previous;
this.field444 = var1;
return var1;
}
}
var1 = this.hashTable.buckets[this.__q++].previous;
} while(var1 == this.hashTable.buckets[this.__q - 1]);
this.__f = var1.previous;
this.__w = var1;
return var1;
return null;
}
}
@Export("hasNext")
@ObfuscatedName("hasNext")
public boolean hasNext() {
if(this.hashTable.buckets[this.__q - 1] != this.__f) {
if (this.hashTable.buckets[this.field443 - 1] != this.field442) {
return true;
} else {
while(this.__q < this.hashTable.size) {
if(this.hashTable.buckets[this.__q++].previous != this.hashTable.buckets[this.__q - 1]) {
this.__f = this.hashTable.buckets[this.__q - 1].previous;
while (this.field443 < this.hashTable.size) {
if (this.hashTable.buckets[this.field443++].previous != this.hashTable.buckets[this.field443 - 1]) {
this.field442 = this.hashTable.buckets[this.field443 - 1].previous;
return true;
}
this.__f = this.hashTable.buckets[this.__q - 1];
this.field442 = this.hashTable.buckets[this.field443 - 1];
}
return false;
@@ -86,12 +85,12 @@ public class IterableNodeHashTableIterator implements Iterator {
}
@ObfuscatedName("remove")
public void __remove_486() {
if(this.__w == null) {
public void method158() {
if (this.field444 == null) {
throw new IllegalStateException();
} else {
this.__w.remove();
this.__w = null;
this.field444.remove();
this.field444 = null;
}
}
}