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

project: Rev 202

Browse Source
This commit is contained in:
Owain van Brakel
2021-12-14 18:20:58 +01:00
parent e974585ce8
commit 7c7bf0901a
406 changed files with 39725 additions and 39842 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -31,17 +31,17 @@ public final class EvictingDualNodeHashTable {
IterableDualNodeQueue deque;
public EvictingDualNodeHashTable(int var1) {
this.field2797 = new DualNode(); // L: 8
this.deque = new IterableDualNodeQueue(); // L: 12
this.capacity = var1; // L: 15
this.remainingCapacity = var1; // L: 16
this.field2797 = new DualNode();
this.deque = new IterableDualNodeQueue();
this.capacity = var1;
this.remainingCapacity = var1;
int var2;
for (var2 = 1; var2 + var2 < var1; var2 += var2) { // L: 17 18
for (var2 = 1; var2 + var2 < var1; var2 += var2) {
}
this.hashTable = new IterableNodeHashTable(var2); // L: 19
} // L: 20
this.hashTable = new IterableNodeHashTable(var2);
}
@ObfuscatedName("c")
@ObfuscatedSignature(
@@ -49,25 +49,25 @@ public final class EvictingDualNodeHashTable {
)
@Export("get")
public DualNode get(long var1) {
DualNode var3 = (DualNode)this.hashTable.get(var1); // L: 24
if (var3 != null) { // L: 25
this.deque.add(var3); // L: 26
DualNode var3 = (DualNode)this.hashTable.get(var1);
if (var3 != null) {
this.deque.add(var3);
}
return var3; // L: 29
return var3;
}
@ObfuscatedName("b")
@Export("remove")
public void remove(long var1) {
DualNode var3 = (DualNode)this.hashTable.get(var1); // L: 33
if (var3 != null) { // L: 34
var3.remove(); // L: 35
var3.removeDual(); // L: 36
++this.remainingCapacity; // L: 37
DualNode var3 = (DualNode)this.hashTable.get(var1);
if (var3 != null) {
var3.remove();
var3.removeDual();
++this.remainingCapacity;
}
} // L: 39
}
@ObfuscatedName("p")
@ObfuscatedSignature(
@@ -75,29 +75,29 @@ public final class EvictingDualNodeHashTable {
)
@Export("put")
public void put(DualNode var1, long var2) {
if (this.remainingCapacity == 0) { // L: 42
DualNode var4 = this.deque.removeLast(); // L: 43
var4.remove(); // L: 44
var4.removeDual(); // L: 45
if (var4 == this.field2797) { // L: 46
var4 = this.deque.removeLast(); // L: 47
var4.remove(); // L: 48
var4.removeDual(); // L: 49
if (this.remainingCapacity == 0) {
DualNode var4 = this.deque.removeLast();
var4.remove();
var4.removeDual();
if (var4 == this.field2797) {
var4 = this.deque.removeLast();
var4.remove();
var4.removeDual();
}
} else {
--this.remainingCapacity; // L: 52
--this.remainingCapacity;
}
this.hashTable.put(var1, var2); // L: 53
this.deque.add(var1); // L: 54
} // L: 55
this.hashTable.put(var1, var2);
this.deque.add(var1);
}
@ObfuscatedName("m")
@Export("clear")
public void clear() {
this.deque.clear(); // L: 58
this.hashTable.clear(); // L: 59
this.field2797 = new DualNode(); // L: 60
this.remainingCapacity = this.capacity; // L: 61
} // L: 62
this.deque.clear();
this.hashTable.clear();
this.field2797 = new DualNode();
this.remainingCapacity = this.capacity;
}
}