chore: rev 193
This commit is contained in:
@@ -4,93 +4,89 @@ import net.runelite.mapping.Implements;
|
||||
import net.runelite.mapping.ObfuscatedName;
|
||||
import net.runelite.mapping.ObfuscatedSignature;
|
||||
|
||||
@ObfuscatedName("ls")
|
||||
@ObfuscatedName("lb")
|
||||
@Implements("IterableNodeHashTableIterator")
|
||||
public class IterableNodeHashTableIterator implements Iterator {
|
||||
@ObfuscatedName("f")
|
||||
@ObfuscatedName("h")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Lll;"
|
||||
descriptor = "Lla;"
|
||||
)
|
||||
@Export("hashTable")
|
||||
IterableNodeHashTable hashTable;
|
||||
@ObfuscatedName("b")
|
||||
@ObfuscatedName("v")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Lgn;"
|
||||
descriptor = "Lgu;"
|
||||
)
|
||||
@Export("head")
|
||||
Node head;
|
||||
@ObfuscatedName("l")
|
||||
@ObfuscatedName("x")
|
||||
@Export("index")
|
||||
int index;
|
||||
@ObfuscatedName("m")
|
||||
@ObfuscatedName("w")
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "Lgn;"
|
||||
descriptor = "Lgu;"
|
||||
)
|
||||
@Export("last")
|
||||
Node last;
|
||||
|
||||
@ObfuscatedSignature(
|
||||
descriptor = "(Lll;)V"
|
||||
descriptor = "(Lla;)V"
|
||||
)
|
||||
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
|
||||
this.last = null; // L: 10
|
||||
this.hashTable = var1; // L: 13
|
||||
this.start(); // L: 14
|
||||
} // L: 15
|
||||
this.last = null;
|
||||
this.hashTable = var1;
|
||||
this.start();
|
||||
}
|
||||
|
||||
@ObfuscatedName("e")
|
||||
@ObfuscatedName("z")
|
||||
@Export("start")
|
||||
void start() {
|
||||
this.head = this.hashTable.buckets[0].previous; // L: 18
|
||||
this.index = 1; // L: 19
|
||||
this.last = null; // L: 20
|
||||
} // L: 21
|
||||
this.head = this.hashTable.buckets[0].previous;
|
||||
this.index = 1;
|
||||
this.last = null;
|
||||
}
|
||||
|
||||
public Object next() {
|
||||
Node var1;
|
||||
if (this.hashTable.buckets[this.index - 1] != this.head) { // L: 24
|
||||
var1 = this.head; // L: 25
|
||||
this.head = var1.previous; // L: 26
|
||||
this.last = var1; // L: 27
|
||||
return var1; // L: 28
|
||||
if (this.hashTable.buckets[this.index - 1] != this.head) {
|
||||
var1 = this.head;
|
||||
this.head = var1.previous;
|
||||
this.last = var1;
|
||||
return var1;
|
||||
} else {
|
||||
do {
|
||||
if (this.index >= this.hashTable.size) { // L: 30
|
||||
return null; // L: 38
|
||||
if (this.index >= this.hashTable.size) {
|
||||
return null;
|
||||
}
|
||||
|
||||
var1 = this.hashTable.buckets[this.index++].previous; // L: 31
|
||||
} while(var1 == this.hashTable.buckets[this.index - 1]); // L: 32
|
||||
var1 = this.hashTable.buckets[this.index++].previous;
|
||||
} while(var1 == this.hashTable.buckets[this.index - 1]);
|
||||
|
||||
this.head = var1.previous; // L: 33
|
||||
this.last = var1; // L: 34
|
||||
return var1; // L: 35
|
||||
}
|
||||
}
|
||||
|
||||
public boolean hasNext() {
|
||||
if (this.hashTable.buckets[this.index - 1] != this.head) { // L: 42
|
||||
return true;
|
||||
} else {
|
||||
while (this.index < this.hashTable.size) { // L: 43
|
||||
if (this.hashTable.buckets[this.index++].previous != this.hashTable.buckets[this.index - 1]) { // L: 44
|
||||
this.head = this.hashTable.buckets[this.index - 1].previous; // L: 45
|
||||
return true; // L: 46
|
||||
}
|
||||
|
||||
this.head = this.hashTable.buckets[this.index - 1]; // L: 49
|
||||
}
|
||||
|
||||
return false; // L: 52
|
||||
this.head = var1.previous;
|
||||
this.last = var1;
|
||||
return var1;
|
||||
}
|
||||
}
|
||||
|
||||
public void remove() {
|
||||
if (this.last == null) { // L: 56
|
||||
throw new IllegalStateException();
|
||||
this.last.remove();
|
||||
this.last = null;
|
||||
}
|
||||
|
||||
public boolean hasNext() {
|
||||
if (this.hashTable.buckets[this.index - 1] != this.head) {
|
||||
return true;
|
||||
} else {
|
||||
this.last.remove(); // L: 57
|
||||
this.last = null; // L: 58
|
||||
while (this.index < this.hashTable.size) {
|
||||
if (this.hashTable.buckets[this.index++].previous != this.hashTable.buckets[this.index - 1]) {
|
||||
this.head = this.hashTable.buckets[this.index - 1].previous;
|
||||
return true;
|
||||
}
|
||||
|
||||
this.head = this.hashTable.buckets[this.index - 1];
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
} // L: 59
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user