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

project: update from 184 to 184 (#1675)

Browse Source 
* 184

* checkstyle

* project: fix exports.
This commit is contained in:
Ganom
2019-09-28 13:37:36 -04:00
committed by Kyle
parent 63e7952335
commit cb57ab26b3
341 changed files with 90585 additions and 90740 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,96 +1,96 @@
import java.util.Iterator;
import net.runelite.mapping.Export;
import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("ls")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("z")
@ObfuscatedSignature(
signature = "Llb;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("n")
@ObfuscatedSignature(
signature = "Lfx;"
)
@Export("head")
Node head;
@ObfuscatedName("v")
@Export("index")
int index;
@ObfuscatedName("u")
@ObfuscatedSignature(
signature = "Lfx;"
)
@Export("last")
Node last;
@ObfuscatedSignature(
signature = "(Llb;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
this.hashTable = var1;
this.start();
}
@ObfuscatedName("i")
@Export("start")
void start() {
this.head = this.hashTable.buckets[0].previous;
this.index = 1;
this.last = null;
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.remove();
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;
} 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;
}
}
}
import java.util.Iterator;
import net.runelite.mapping.Export;
import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("ls")
@Implements("IterableNodeHashTableIterator")
public class IterableNodeHashTableIterator implements Iterator {
@ObfuscatedName("z")
@ObfuscatedSignature(
signature = "Llb;"
)
@Export("hashTable")
IterableNodeHashTable hashTable;
@ObfuscatedName("n")
@ObfuscatedSignature(
signature = "Lfx;"
)
@Export("head")
Node head;
@ObfuscatedName("v")
@Export("index")
int index;
@ObfuscatedName("u")
@ObfuscatedSignature(
signature = "Lfx;"
)
@Export("last")
Node last;
@ObfuscatedSignature(
signature = "(Llb;)V"
)
IterableNodeHashTableIterator(IterableNodeHashTable var1) {
this.last = null;
this.hashTable = var1;
this.start();
}
@ObfuscatedName("i")
@Export("start")
void start() {
this.head = this.hashTable.buckets[0].previous;
this.index = 1;
this.last = null;
}
public void remove() {
if (this.last == null) {
throw new IllegalStateException();
} else {
this.last.remove();
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;
} 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;
}
}
}