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

Use newer version of fernflower and remove __xx names

Browse Source
This commit is contained in:
Lucas
2019-07-04 23:51:52 +02:00
parent 1f2a9b21d6
commit a8d801d830
294 changed files with 27369 additions and 27322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
runescape-client/src/main/java/IntHashTable.java
View File

@@ -12,21 +12,19 @@ public class IntHashTable {
public IntHashTable(int[] var1) {
int var2;
for(var2 = 1; var2 <= (var1.length >> 1) + var1.length; var2 <<= 1) {
;
for (var2 = 1; var2 <= (var1.length >> 1) + var1.length; var2 <<= 1) {
}
this.array = new int[var2 + var2];
int var3;
for(var3 = 0; var3 < var2 + var2; ++var3) {
for (var3 = 0; var3 < var2 + var2; ++var3) {
this.array[var3] = -1;
}
int var4;
for(var3 = 0; var3 < var1.length; this.array[var4 + var4 + 1] = var3++) {
for(var4 = var1[var3] & var2 - 1; this.array[var4 + var4 + 1] != -1; var4 = var4 + 1 & var2 - 1) {
;
for (var3 = 0; var3 < var1.length; this.array[var4 + var4 + 1] = var3++) {
for (var4 = var1[var3] & var2 - 1; this.array[var4 + var4 + 1] != -1; var4 = var4 + 1 & var2 - 1) {
}
this.array[var4 + var4] = var1[var3];
@@ -44,13 +42,13 @@ public class IntHashTable {
int var2 = (this.array.length >> 1) - 1;
int var3 = var1 & var2;
while(true) {
while (true) {
int var4 = this.array[var3 + var3 + 1];
if(var4 == -1) {
if (var4 == -1) {
return -1;
}
if(this.array[var3 + var3] == var1) {
if (this.array[var3 + var3] == var1) {
return var4;
}