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

31
runescape-client/src/main/java/IterableNodeHashTable.java
View File

@@ -37,7 +37,7 @@ public final class IterableNodeHashTable implements Iterable {
this.size = var1;
this.buckets = new Node[var1];
for(int var2 = 0; var2 < var1; ++var2) {
for (int var2 = 0; var2 < var1; ++var2) {
Node var3 = this.buckets[var2] = new Node();
var3.previous = var3;
var3.next = var3;
@@ -53,8 +53,8 @@ public final class IterableNodeHashTable implements Iterable {
public Node get(long var1) {
Node var3 = this.buckets[(int)(var1 & (long)(this.size - 1))];
for(this.currentGet = var3.previous; var3 != this.currentGet; this.currentGet = this.currentGet.previous) {
if(this.currentGet.key == var1) {
for (this.currentGet = var3.previous; var3 != this.currentGet; this.currentGet = this.currentGet.previous) {
if (this.currentGet.key == var1) {
Node var4 = this.currentGet;
this.currentGet = this.currentGet.previous;
return var4;
@@ -71,7 +71,7 @@ public final class IterableNodeHashTable implements Iterable {
)
@Export("put")
public void put(Node var1, long var2) {
if(var1.next != null) {
if (var1.next != null) {
var1.remove();
}
@@ -86,12 +86,12 @@ public final class IterableNodeHashTable implements Iterable {
@ObfuscatedName("q")
@Export("clear")
public void clear() {
for(int var1 = 0; var1 < this.size; ++var1) {
for (int var1 = 0; var1 < this.size; ++var1) {
Node var2 = this.buckets[var1];
while(true) {
while (true) {
Node var3 = var2.previous;
if(var3 == var2) {
if (var3 == var2) {
break;
}
@@ -120,21 +120,20 @@ public final class IterableNodeHashTable implements Iterable {
@Export("next")
public Node next() {
Node var1;
if(this.index > 0 && this.buckets[this.index - 1] != this.current) {
if (this.index > 0 && this.buckets[this.index - 1] != this.current) {
var1 = this.current;
this.current = var1.previous;
return var1;
} else {
do {
if(this.index >= this.size) {
return null;
}
while (this.index < this.size) {
var1 = this.buckets[this.index++].previous;
} while(var1 == this.buckets[this.index - 1]);
if (var1 != this.buckets[this.index - 1]) {
this.current = var1.previous;
return var1;
}
}
this.current = var1.previous;
return var1;
return null;
}
}