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

rev187

Browse Source
This commit is contained in:
Lucwousin
2019-12-16 18:40:02 +01:00
parent 471eaeb3e0
commit f6c2b4ac11
338 changed files with 40594 additions and 41546 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
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("ll")
@ObfuscatedName("la")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("u")
@ObfuscatedName("f")
@ObfuscatedSignature(
signature = "Llb;"
signature = "Llc;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("f")
@ObfuscatedName("i")
@ObfuscatedSignature(
signature = "Lfb;"
signature = "Lgk;"
)
@Export("head")
Node head;
@ObfuscatedName("b")
@ObfuscatedName("y")
@Export("index")
int index;
@ObfuscatedName("g")
@ObfuscatedName("w")
@ObfuscatedSignature(
signature = "Lfb;"
signature = "Lgk;"
)
@Export("last")
Node last;
@ObfuscatedSignature(
signature = "(Llb;)V"
signature = "(Llc;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
@@ -38,7 +38,7 @@ public class IterableNodeHashTableIterator implements Iterator {
this.start();
}
@ObfuscatedName("y")
@ObfuscatedName("c")
@Export("start")
void start() {
this.head = this.hashTable.buckets[0].previous;
@@ -46,23 +46,6 @@ public class IterableNodeHashTableIterator implements Iterator {
this.last = null;
}
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;
}
this.head = this.hashTable.buckets[this.index - 1];
}
return false;
}
}
public Object next() {
Node var1;
if (this.hashTable.buckets[this.index - 1] != this.head) {
@@ -93,4 +76,21 @@ public class IterableNodeHashTableIterator implements Iterator {
this.last = null;
}
}
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;
}
this.head = this.hashTable.buckets[this.index - 1];
}
return false;
}
}
}