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

project: rev 199

Browse Source
This commit is contained in:
Owain van Brakel
2021-08-25 13:49:53 +02:00
parent c1fffa1562
commit e6be88fbeb
490 changed files with 47651 additions and 46243 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
runescape-client/src/main/java/IterableNodeHashTableIterator.java
View File

@@ -4,33 +4,33 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("mx")
@ObfuscatedName("np")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("s")
@ObfuscatedName("n")
@ObfuscatedSignature(
descriptor = "Lmc;"
descriptor = "Lnz;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("t")
@ObfuscatedName("c")
@ObfuscatedSignature(
descriptor = "Lml;"
descriptor = "Lnr;"
)
@Export("head")
Node head;
@ObfuscatedName("v")
@ObfuscatedName("m")
@Export("index")
int index;
@ObfuscatedName("j")
@ObfuscatedName("k")
@ObfuscatedSignature(
descriptor = "Lml;"
descriptor = "Lnr;"
)
@Export("last")
Node last;
@ObfuscatedSignature(
descriptor = "(Lmc;)V"
descriptor = "(Lnz;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
@@ -38,7 +38,7 @@ public class IterableNodeHashTableIterator implements Iterator {
this.start();
}
@ObfuscatedName("s")
@ObfuscatedName("n")
@Export("start")
void start() {
this.head = this.hashTable.buckets[0].previous;
@@ -46,28 +46,6 @@ public class IterableNodeHashTableIterator implements Iterator {
this.last = null;
}
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;
} while(var1 == this.hashTable.buckets[this.index - 1]);
this.head = var1.previous;
this.last = var1;
return var1;
}
}
public boolean hasNext() {
if (this.hashTable.buckets[this.index - 1] != this.head) {
return true;
@@ -93,4 +71,26 @@ public class IterableNodeHashTableIterator implements Iterator {
this.last = null;
}
}
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;
} while(var1 == this.hashTable.buckets[this.index - 1]);
this.head = var1.previous;
this.last = var1;
return var1;
}
}
}