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

project: Rev update

Browse Source
This commit is contained in:
Owain van Brakel
2019-11-28 16:31:53 +01:00
parent 34f8560da9
commit 74726ae17a
343 changed files with 41411 additions and 41094 deletions
Download Patch File Download Diff File Expand all files Collapse all files

102
runescape-client/src/main/java/Huffman.java
View File

@@ -1,24 +1,18 @@
import net.runelite.mapping.Export;
import net.runelite.mapping.Implements;
import net.runelite.mapping.ObfuscatedGetter;
import net.runelite.mapping.ObfuscatedName;
import net.runelite.mapping.ObfuscatedSignature;
@ObfuscatedName("hx")
@ObfuscatedName("hg")
@Implements("Huffman")
public class Huffman {
@ObfuscatedName("as")
@ObfuscatedGetter(
intValue = 821038913
)
static int field2491;
@ObfuscatedName("a")
@ObfuscatedName("u")
@Export("masks")
int[] masks;
@ObfuscatedName("t")
@ObfuscatedName("f")
@Export("bits")
byte[] bits;
@ObfuscatedName("n")
@ObfuscatedName("b")
@Export("keys")
int[] keys;
@@ -47,7 +41,7 @@ public class Huffman {
for (var10 = var6 - 1; var10 >= 1; --var10) {
var11 = var3[var10];
if (var11 != var8) {
if (var8 != var11) {
break;
}
@@ -105,10 +99,10 @@ public class Huffman {
}
@ObfuscatedName("a")
@ObfuscatedName("u")
@ObfuscatedSignature(
signature = "([BII[BIB)I",
garbageValue = "14"
garbageValue = "-1"
)
@Export("compress")
int compress(byte[] var1, int var2, int var3, byte[] var4, int var5) {
@@ -126,7 +120,7 @@ public class Huffman {
int var11 = var7 >> 3;
int var12 = var7 & 7;
var6 &= -var12 >> 31;
int var13 = (var10 + var12 - 1 >> 3) + var11;
int var13 = (var12 + var10 - 1 >> 3) + var11;
var12 += 24;
var4[var11] = (byte)(var6 |= var9 >>> var12);
if (var11 < var13) {
@@ -156,10 +150,10 @@ public class Huffman {
return (var7 + 7 >> 3) - var5;
}
@ObfuscatedName("t")
@ObfuscatedName("f")
@ObfuscatedSignature(
signature = "([BI[BIIB)I",
garbageValue = "-1"
signature = "([BI[BIII)I",
garbageValue = "661108656"
)
@Export("decompress")
int decompress(byte[] var1, int var2, byte[] var3, int var4, int var5) {
@@ -300,25 +294,65 @@ public class Huffman {
}
}
@ObfuscatedName("a")
@ObfuscatedSignature(
signature = "([I[II)V",
garbageValue = "1107408934"
)
public static void method4104(int[] var0, int[] var1) {
if (var0 != null && var1 != null) {
ByteArrayPool.ByteArrayPool_alternativeSizes = var0;
class222.ByteArrayPool_altSizeArrayCounts = new int[var0.length];
HorizontalAlignment.ByteArrayPool_arrays = new byte[var0.length][][];
for (int var2 = 0; var2 < ByteArrayPool.ByteArrayPool_alternativeSizes.length; ++var2) {
HorizontalAlignment.ByteArrayPool_arrays[var2] = new byte[var1[var2]][];
@ObfuscatedName("u")
public static final int method4020(double var0, double var2, double var4) {
double var6 = var4;
double var8 = var4;
double var10 = var4;
if (var2 != 0.0D) {
double var12;
if (var4 < 0.5D) {
var12 = (1.0D + var2) * var4;
} else {
var12 = var4 + var2 - var2 * var4;
}
} else {
ByteArrayPool.ByteArrayPool_alternativeSizes = null;
class222.ByteArrayPool_altSizeArrayCounts = null;
HorizontalAlignment.ByteArrayPool_arrays = null;
double var14 = 2.0D * var4 - var12;
double var16 = 0.3333333333333333D + var0;
if (var16 > 1.0D) {
--var16;
}
double var20 = var0 - 0.3333333333333333D;
if (var20 < 0.0D) {
++var20;
}
if (var16 * 6.0D < 1.0D) {
var6 = var16 * (var12 - var14) * 6.0D + var14;
} else if (var16 * 2.0D < 1.0D) {
var6 = var12;
} else if (3.0D * var16 < 2.0D) {
var6 = 6.0D * (var12 - var14) * (0.6666666666666666D - var16) + var14;
} else {
var6 = var14;
}
if (var0 * 6.0D < 1.0D) {
var8 = var14 + var0 * (var12 - var14) * 6.0D;
} else if (var0 * 2.0D < 1.0D) {
var8 = var12;
} else if (3.0D * var0 < 2.0D) {
var8 = 6.0D * (0.6666666666666666D - var0) * (var12 - var14) + var14;
} else {
var8 = var14;
}
if (var20 * 6.0D < 1.0D) {
var10 = var20 * 6.0D * (var12 - var14) + var14;
} else if (var20 * 2.0D < 1.0D) {
var10 = var12;
} else if (var20 * 3.0D < 2.0D) {
var10 = var14 + 6.0D * (var12 - var14) * (0.6666666666666666D - var20);
} else {
var10 = var14;
}
}
int var22 = (int)(var6 * 256.0D);
int var13 = (int)(256.0D * var8);
int var23 = (int)(256.0D * var10);
int var15 = var23 + (var13 << 8) + (var22 << 16);
return var15;
}
}