chore: rev 194

This commit is contained in:
zeruth
2021-02-24 08:08:39 -05:00
parent 11dd1cdb41
commit e1df0f6f7c
352 changed files with 83792 additions and 85533 deletions

View File

@@ -4,89 +4,92 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("lb")
@ObfuscatedName("lj")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("h")
@ObfuscatedSignature(
descriptor = "Lla;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lgu;"
)
@Export("head")
Node head;
@ObfuscatedName("x")
@Export("index")
int index;
@ObfuscatedName("w")
@ObfuscatedSignature(
descriptor = "Lgu;"
)
@Export("last")
Node last;
@ObfuscatedName("n")
@ObfuscatedSignature(
descriptor = "Llg;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("v")
@ObfuscatedSignature(
descriptor = "Lga;"
)
@Export("head")
Node head;
@ObfuscatedName("d")
@Export("index")
int index;
@ObfuscatedName("c")
@ObfuscatedSignature(
descriptor = "Lga;"
)
@Export("last")
Node last = null;
@ObfuscatedSignature(
descriptor = "(Lla;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null; // L: 10
this.hashTable = var1; // L: 13
this.start(); // L: 14
} // L: 15
@ObfuscatedSignature(
descriptor = "(Llg;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.hashTable = var1;
this.start();
}
@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
@ObfuscatedName("e")
@Export("start")
void start() {
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
} else {
do {
if (this.index >= this.hashTable.size) { // L: 30
return null; // L: 38
}
public Object next() {
Node var1;
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) {
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
}
}
this.head = var1.previous;
this.last = var1;
return var1;
}
}
public void remove() {
this.last.remove(); // L: 57
this.last = null; // L: 58
} // L: 59
public boolean hasNext() {
if (this.hashTable.buckets[this.index - 1] != this.head) {
return true;
} else {
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;
}
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];
}
this.head = this.hashTable.buckets[this.index - 1]; // L: 49
}
return false;
}
}
return false; // L: 52
}
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.remove();
this.last = null;
}
}
}