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

rs-client/apis

Browse Source
This commit is contained in:
Lucwousin
2019-07-18 15:21:46 +02:00
parent aa5098aff5
commit 25ce6c2ee9
346 changed files with 78952 additions and 84408 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -4,93 +4,93 @@ import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("lk")
@ObfuscatedName("lg")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("m")
@ObfuscatedSignature(
signature = "Llh;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("f")
@ObfuscatedSignature(
signature = "Lgw;"
)
@Export("head")
Node head;
@ObfuscatedName("q")
@Export("index")
int index;
@ObfuscatedName("w")
@ObfuscatedSignature(
signature = "Lgw;"
)
@Export("last")
Node last;
@ObfuscatedName("q")
@ObfuscatedSignature(
signature = "Lla;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("w")
@ObfuscatedSignature(
signature = "Lfw;"
)
@Export("head")
Node head;
@ObfuscatedName("e")
@Export("index")
int index;
@ObfuscatedName("p")
@ObfuscatedSignature(
signature = "Lfw;"
)
@Export("last")
Node last;
@ObfuscatedSignature(
signature = "(Llh;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
this.hashTable = var1;
this.start();
}
@ObfuscatedSignature(
signature = "(Lla;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
this.hashTable = var1;
this.start();
}
@ObfuscatedName("u")
@Export("start")
void start() {
this.head = this.hashTable.buckets[0].previous;
this.index = 1;
this.last = null;
}
@ObfuscatedName("b")
@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) {
var1 = this.head;
this.head = var1.previous;
this.last = var1;
return var1;
} else {
do {
if (this.index >= this.hashTable.size) {
return 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;
}
var1 = this.hashTable.buckets[this.index++].previous;
} while(var1 == this.hashTable.buckets[this.index - 1]);
this.head = this.hashTable.buckets[this.index - 1];
}
this.head = var1.previous;
this.last = var1;
return var1;
}
}
return false;
}
}
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 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;
}
this.head = this.hashTable.buckets[this.index - 1];
}
var1 = this.hashTable.buckets[this.index++].previous;
} while(var1 == this.hashTable.buckets[this.index - 1]);
return false;
}
}
this.head = var1.previous;
this.last = var1;
return var1;
}
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.remove();
this.last = null;
}
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.remove();
this.last = null;
}
}
}