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

17
runescape-client/src/main/java/EvictingDualNodeHashTable.java
View File

@@ -10,7 +10,7 @@ public final class EvictingDualNodeHashTable {
@ObfuscatedSignature(
signature = "Lfn;"
)
DualNode __m;
DualNode field343;
@ObfuscatedName("f")
@Export("capacity")
int capacity;
@@ -31,14 +31,13 @@ public final class EvictingDualNodeHashTable {
DualNodeDeque deque;
public EvictingDualNodeHashTable(int var1) {
this.__m = new DualNode();
this.field343 = new DualNode();
this.deque = new DualNodeDeque();
this.capacity = var1;
this.remainingCapacity = var1;
int var2;
for(var2 = 1; var2 + var2 < var1; var2 += var2) {
;
for (var2 = 1; var2 + var2 < var1; var2 += var2) {
}
this.hashTable = new NodeHashTable(var2);
@@ -51,7 +50,7 @@ public final class EvictingDualNodeHashTable {
@Export("get")
public DualNode get(long var1) {
DualNode var3 = (DualNode)this.hashTable.get(var1);
if(var3 != null) {
if (var3 != null) {
this.deque.addFirst(var3);
}
@@ -62,7 +61,7 @@ public final class EvictingDualNodeHashTable {
@Export("remove")
public void remove(long var1) {
DualNode var3 = (DualNode)this.hashTable.get(var1);
if(var3 != null) {
if (var3 != null) {
var3.remove();
var3.removeDual();
++this.remainingCapacity;
@@ -76,11 +75,11 @@ public final class EvictingDualNodeHashTable {
)
@Export("put")
public void put(DualNode var1, long var2) {
if(this.remainingCapacity == 0) {
if (this.remainingCapacity == 0) {
DualNode var4 = this.deque.removeLast();
var4.remove();
var4.removeDual();
if(var4 == this.__m) {
if (var4 == this.field343) {
var4 = this.deque.removeLast();
var4.remove();
var4.removeDual();
@@ -98,7 +97,7 @@ public final class EvictingDualNodeHashTable {
public void clear() {
this.deque.clear();
this.hashTable.clear();
this.__m = new DualNode();
this.field343 = new DualNode();
this.remainingCapacity = this.capacity;
}
}