mirror of
https://gitlab.com/2009scape/rt4-client.git
synced 2026-08-17 16:35:14 -06:00
Moved some more methods to utility classes
This commit is contained in:
Pazaz
parent
ad45cb829b
commit
4c73508f1f
25 changed files with 817 additions and 805 deletions
|
|
@ -233,58 +233,58 @@ public final class ArrayUtils {
|
|||
}
|
||||
|
||||
@OriginalMember(owner = "client!kg", name = "a", descriptor = "([III)V")
|
||||
public static void clear(@OriginalArg(0) int[] arg0, @OriginalArg(1) int arg1, @OriginalArg(2) int arg2) {
|
||||
@Pc(5) int local5 = arg2 - 7;
|
||||
while (arg1 < local5) {
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
arg0[arg1++] = 0;
|
||||
public static void clear(@OriginalArg(0) int[] dest, @OriginalArg(1) int off, @OriginalArg(2) int length) {
|
||||
@Pc(5) int len = length - 7;
|
||||
while (off < len) {
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
dest[off++] = 0;
|
||||
}
|
||||
local5 += 7;
|
||||
while (arg1 < local5) {
|
||||
arg0[arg1++] = 0;
|
||||
len += 7;
|
||||
while (off < len) {
|
||||
dest[off++] = 0;
|
||||
}
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!nk", name = "a", descriptor = "(Z[J[I)V")
|
||||
public static void sort(@OriginalArg(1) long[] arg0, @OriginalArg(2) int[] arg1) {
|
||||
method436(arg0, 0, arg0.length - 1, arg1);
|
||||
sort(arg0, 0, arg0.length - 1, arg1);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!gj", name = "a", descriptor = "([JII[II)V")
|
||||
public static void method436(@OriginalArg(0) long[] arg0, @OriginalArg(1) int arg1, @OriginalArg(2) int arg2, @OriginalArg(3) int[] arg3) {
|
||||
if (arg1 >= arg2) {
|
||||
public static void sort(@OriginalArg(0) long[] keys, @OriginalArg(1) int lo, @OriginalArg(2) int hi, @OriginalArg(3) int[] values) {
|
||||
if (lo >= hi) {
|
||||
return;
|
||||
}
|
||||
@Pc(20) int local20 = arg1;
|
||||
@Pc(26) int local26 = (arg2 + arg1) / 2;
|
||||
@Pc(30) long local30 = arg0[local26];
|
||||
arg0[local26] = arg0[arg2];
|
||||
arg0[arg2] = local30;
|
||||
@Pc(44) int local44 = arg3[local26];
|
||||
arg3[local26] = arg3[arg2];
|
||||
arg3[arg2] = local44;
|
||||
for (@Pc(56) int local56 = arg1; local56 < arg2; local56++) {
|
||||
if (arg0[local56] < local30 + (long) (local56 & 0x1)) {
|
||||
@Pc(76) long local76 = arg0[local56];
|
||||
arg0[local56] = arg0[local20];
|
||||
arg0[local20] = local76;
|
||||
@Pc(90) int local90 = arg3[local56];
|
||||
arg3[local56] = arg3[local20];
|
||||
arg3[local20++] = local90;
|
||||
@Pc(20) int i = lo;
|
||||
@Pc(26) int mid = (hi + lo) / 2;
|
||||
@Pc(30) long pivotKey = keys[mid];
|
||||
keys[mid] = keys[hi];
|
||||
keys[hi] = pivotKey;
|
||||
@Pc(44) int pivotValue = values[mid];
|
||||
values[mid] = values[hi];
|
||||
values[hi] = pivotValue;
|
||||
for (@Pc(56) int j = lo; j < hi; j++) {
|
||||
if (keys[j] < pivotKey + (long) (j & 0x1)) {
|
||||
@Pc(76) long key = keys[j];
|
||||
keys[j] = keys[i];
|
||||
keys[i] = key;
|
||||
@Pc(90) int value = values[j];
|
||||
values[j] = values[i];
|
||||
values[i++] = value;
|
||||
}
|
||||
}
|
||||
arg0[arg2] = arg0[local20];
|
||||
arg0[local20] = local30;
|
||||
arg3[arg2] = arg3[local20];
|
||||
arg3[local20] = local44;
|
||||
method436(arg0, arg1, local20 - 1, arg3);
|
||||
method436(arg0, local20 + 1, arg2, arg3);
|
||||
keys[hi] = keys[i];
|
||||
keys[i] = pivotKey;
|
||||
values[hi] = values[i];
|
||||
values[i] = pivotValue;
|
||||
sort(keys, lo, i - 1, values);
|
||||
sort(keys, i + 1, hi, values);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!ja", name = "a", descriptor = "([II)[I")
|
||||
|
|
@ -351,4 +351,107 @@ public final class ArrayUtils {
|
|||
arg0[arg1] = arg3;
|
||||
}
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!ec", name = "a", descriptor = "([Ljava/lang/Object;I[III)V")
|
||||
public static void sort(@OriginalArg(0) Object[] values, @OriginalArg(1) int hi, @OriginalArg(2) int[] keys, @OriginalArg(4) int lo) {
|
||||
if (lo >= hi) {
|
||||
return;
|
||||
}
|
||||
@Pc(11) int mid = (lo + hi) / 2;
|
||||
@Pc(15) int pivotKey = keys[mid];
|
||||
@Pc(17) int i = lo;
|
||||
keys[mid] = keys[hi];
|
||||
keys[hi] = pivotKey;
|
||||
@Pc(31) Object pivotValue = values[mid];
|
||||
values[mid] = values[hi];
|
||||
values[hi] = pivotValue;
|
||||
for (@Pc(43) int j = lo; j < hi; j++) {
|
||||
if ((j & 0x1) + pivotKey > keys[j]) {
|
||||
@Pc(67) int key = keys[j];
|
||||
keys[j] = keys[i];
|
||||
keys[i] = key;
|
||||
@Pc(81) Object value = values[j];
|
||||
values[j] = values[i];
|
||||
values[i++] = value;
|
||||
}
|
||||
}
|
||||
keys[hi] = keys[i];
|
||||
keys[i] = pivotKey;
|
||||
values[hi] = values[i];
|
||||
values[i] = pivotValue;
|
||||
sort(values, i - 1, keys, lo);
|
||||
sort(values, hi, keys, i + 1);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!oi", name = "a", descriptor = "(I[I[Ljava/lang/Object;)V")
|
||||
public static void sort(@OriginalArg(1) int[] arg0, @OriginalArg(2) Object[] arg1) {
|
||||
sort(arg1, arg0.length - 1, arg0, 0);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!nj", name = "a", descriptor = "(IIZ[I[I)V")
|
||||
public static void sort(@OriginalArg(0) int lo, @OriginalArg(1) int hi, @OriginalArg(3) int[] keys, @OriginalArg(4) int[] values) {
|
||||
if (lo >= hi) {
|
||||
return;
|
||||
}
|
||||
@Pc(22) int mid = (hi + lo) / 2;
|
||||
@Pc(24) int i = lo;
|
||||
@Pc(28) int pivotKey = keys[mid];
|
||||
keys[mid] = keys[hi];
|
||||
keys[hi] = pivotKey;
|
||||
@Pc(42) int pivotValue = values[mid];
|
||||
values[mid] = values[hi];
|
||||
values[hi] = pivotValue;
|
||||
for (@Pc(54) int j = lo; j < hi; j++) {
|
||||
if (keys[j] > (j & 0x1) + pivotKey) {
|
||||
@Pc(79) int key = keys[j];
|
||||
keys[j] = keys[i];
|
||||
keys[i] = key;
|
||||
@Pc(93) int value = values[j];
|
||||
values[j] = values[i];
|
||||
values[i++] = value;
|
||||
}
|
||||
}
|
||||
keys[hi] = keys[i];
|
||||
keys[i] = pivotKey;
|
||||
values[hi] = values[i];
|
||||
values[i] = pivotValue;
|
||||
sort(lo, i - 1, keys, values);
|
||||
sort(i + 1, hi, keys, values);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!sh", name = "a", descriptor = "(I[JII[Ljava/lang/Object;)V")
|
||||
public static void sort(@OriginalArg(0) int hi, @OriginalArg(1) long[] keys, @OriginalArg(3) int lo, @OriginalArg(4) Object[] values) {
|
||||
if (lo >= hi) {
|
||||
return;
|
||||
}
|
||||
@Pc(16) int i = lo;
|
||||
@Pc(23) int mid = (lo + hi) / 2;
|
||||
@Pc(27) long pivotKey = keys[mid];
|
||||
keys[mid] = keys[hi];
|
||||
keys[hi] = pivotKey;
|
||||
@Pc(41) Object pivotValue = values[mid];
|
||||
values[mid] = values[hi];
|
||||
values[hi] = pivotValue;
|
||||
for (@Pc(53) int j = lo; j < hi; j++) {
|
||||
if (pivotKey + (long) (j & 0x1) > keys[j]) {
|
||||
@Pc(72) long key = keys[j];
|
||||
keys[j] = keys[i];
|
||||
keys[i] = key;
|
||||
@Pc(86) Object value = values[j];
|
||||
values[j] = values[i];
|
||||
values[i++] = value;
|
||||
}
|
||||
}
|
||||
keys[hi] = keys[i];
|
||||
keys[i] = pivotKey;
|
||||
values[hi] = values[i];
|
||||
values[i] = pivotValue;
|
||||
sort(i - 1, keys, lo, values);
|
||||
sort(hi, keys, i + 1, values);
|
||||
}
|
||||
|
||||
@OriginalMember(owner = "client!ac", name = "a", descriptor = "([J[Ljava/lang/Object;I)V")
|
||||
public static void sort(@OriginalArg(0) long[] arg0, @OriginalArg(1) Object[] arg1) {
|
||||
sort(arg0.length - 1, arg0, 0, arg1);
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue