rsc: please read the commit message for my neverending descent into madness
how do i stop making castles every time i go to the beach i make a castle every time i open blender i model castles every time i play chess i castle i just cant stop making castles dude
This commit is contained in:
@@ -6,97 +6,98 @@ import net.runelite.mapping.ObfuscatedSignature;
|
||||
@ObfuscatedName("ex")
|
||||
@Implements("EvictingDualNodeHashTable")
|
||||
public final class EvictingDualNodeHashTable {
|
||||
@ObfuscatedName("n")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Lgj;"
|
||||
)
|
||||
DualNode field1968 = new DualNode();
|
||||
@ObfuscatedName("v")
|
||||
@Export("capacity")
|
||||
int capacity;
|
||||
@ObfuscatedName("d")
|
||||
@Export("remainingCapacity")
|
||||
int remainingCapacity;
|
||||
@ObfuscatedName("c")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Llg;"
|
||||
)
|
||||
@Export("hashTable")
|
||||
IterableNodeHashTable hashTable;
|
||||
@ObfuscatedName("y")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Ljf;"
|
||||
)
|
||||
@Export("deque")
|
||||
IterableDualNodeQueue deque = new IterableDualNodeQueue();
|
||||
@ObfuscatedName("n")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Lgj;"
|
||||
)
|
||||
DualNode field1968;
|
||||
@ObfuscatedName("v")
|
||||
@Export("capacity")
|
||||
int capacity;
|
||||
@ObfuscatedName("d")
|
||||
@Export("remainingCapacity")
|
||||
int remainingCapacity;
|
||||
@ObfuscatedName("c")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Llg;"
|
||||
)
|
||||
@Export("hashTable")
|
||||
IterableNodeHashTable hashTable;
|
||||
@ObfuscatedName("y")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Ljf;"
|
||||
)
|
||||
@Export("deque")
|
||||
IterableDualNodeQueue deque;
|
||||
|
||||
public EvictingDualNodeHashTable(int var1) {
|
||||
this.capacity = var1;
|
||||
this.remainingCapacity = var1;
|
||||
public EvictingDualNodeHashTable(int var1) {
|
||||
this.field1968 = new DualNode(); // L: 8
|
||||
this.deque = new IterableDualNodeQueue(); // L: 12
|
||||
this.capacity = var1; // L: 15
|
||||
this.remainingCapacity = var1; // L: 16
|
||||
|
||||
int var2;
|
||||
for(var2 = 1; var2 + var2 < var1; var2 += var2) {
|
||||
;
|
||||
}
|
||||
int var2;
|
||||
for (var2 = 1; var2 + var2 < var1; var2 += var2) { // L: 17 18
|
||||
}
|
||||
|
||||
this.hashTable = new IterableNodeHashTable(var2);
|
||||
}
|
||||
this.hashTable = new IterableNodeHashTable(var2); // L: 19
|
||||
} // L: 20
|
||||
|
||||
@ObfuscatedName("n")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "(J)Lgj;"
|
||||
)
|
||||
@Export("get")
|
||||
public DualNode get(long var1) {
|
||||
DualNode var3 = (DualNode)this.hashTable.get(var1);
|
||||
if (var3 != null) {
|
||||
this.deque.add(var3);
|
||||
}
|
||||
@ObfuscatedName("n")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "(J)Lgj;"
|
||||
)
|
||||
@Export("get")
|
||||
public DualNode get(long var1) {
|
||||
DualNode var3 = (DualNode)this.hashTable.get(var1); // L: 23
|
||||
if (var3 != null) { // L: 24
|
||||
this.deque.add(var3); // L: 25
|
||||
}
|
||||
|
||||
return var3;
|
||||
}
|
||||
return var3; // L: 28
|
||||
}
|
||||
|
||||
@ObfuscatedName("v")
|
||||
@Export("remove")
|
||||
public void remove(long var1) {
|
||||
DualNode var3 = (DualNode)this.hashTable.get(var1);
|
||||
if (var3 != null) {
|
||||
var3.remove();
|
||||
var3.removeDual();
|
||||
++this.remainingCapacity;
|
||||
}
|
||||
@ObfuscatedName("v")
|
||||
@Export("remove")
|
||||
public void remove(long var1) {
|
||||
DualNode var3 = (DualNode)this.hashTable.get(var1); // L: 32
|
||||
if (var3 != null) { // L: 33
|
||||
var3.remove(); // L: 34
|
||||
var3.removeDual(); // L: 35
|
||||
++this.remainingCapacity; // L: 36
|
||||
}
|
||||
|
||||
}
|
||||
} // L: 38
|
||||
|
||||
@ObfuscatedName("d")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "(Lgj;J)V"
|
||||
)
|
||||
@Export("put")
|
||||
public void put(DualNode var1, long var2) {
|
||||
if (this.remainingCapacity == 0) {
|
||||
DualNode var4 = this.deque.removeLast();
|
||||
var4.remove();
|
||||
var4.removeDual();
|
||||
if (var4 == this.field1968) {
|
||||
var4 = this.deque.removeLast();
|
||||
var4.remove();
|
||||
var4.removeDual();
|
||||
}
|
||||
} else {
|
||||
--this.remainingCapacity;
|
||||
}
|
||||
@ObfuscatedName("d")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "(Lgj;J)V"
|
||||
)
|
||||
@Export("put")
|
||||
public void put(DualNode var1, long var2) {
|
||||
if (this.remainingCapacity == 0) { // L: 41
|
||||
DualNode var4 = this.deque.removeLast(); // L: 42
|
||||
var4.remove(); // L: 43
|
||||
var4.removeDual(); // L: 44
|
||||
if (var4 == this.field1968) { // L: 45
|
||||
var4 = this.deque.removeLast(); // L: 46
|
||||
var4.remove(); // L: 47
|
||||
var4.removeDual(); // L: 48
|
||||
}
|
||||
} else {
|
||||
--this.remainingCapacity; // L: 51
|
||||
}
|
||||
|
||||
this.hashTable.put(var1, var2);
|
||||
this.deque.add(var1);
|
||||
}
|
||||
this.hashTable.put(var1, var2); // L: 52
|
||||
this.deque.add(var1); // L: 53
|
||||
} // L: 54
|
||||
|
||||
@ObfuscatedName("c")
|
||||
@Export("clear")
|
||||
public void clear() {
|
||||
this.deque.clear();
|
||||
this.hashTable.clear();
|
||||
this.field1968 = new DualNode();
|
||||
this.remainingCapacity = this.capacity;
|
||||
}
|
||||
@ObfuscatedName("c")
|
||||
@Export("clear")
|
||||
public void clear() {
|
||||
this.deque.clear(); // L: 57
|
||||
this.hashTable.clear(); // L: 58
|
||||
this.field1968 = new DualNode(); // L: 59
|
||||
this.remainingCapacity = this.capacity; // L: 60
|
||||
} // L: 61
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user