Repo-Mirror/Leaf
9
0
Fork 0
mirror of https://github.com/Winds-Studio/Leaf.git synced 2025-12-21 07:59:26 +00:00
Code Issues Releases Activity

Fix radix sort leak

Browse Source 
sync changes from 1.21.8
This commit is contained in:
HaHaWTH
2025-09-30 18:38:46 +08:00
parent 7677a8c86a
commit 26d804bf93
1 changed files with 19 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
leaf-server/src/main/java/org/dreeam/leaf/util/FastBitRadixSort.java
View File

@@ -2,45 +2,32 @@ package org.dreeam.leaf.util;
import net.minecraft.world.entity.Entity; import net.minecraft.world.entity.Entity;
import java.lang.reflect.Array; // Required for Array.newInstance public final class FastBitRadixSort {
import java.util.List;
public class FastBitRadixSort { private static final int SMALL_ARRAY_THRESHOLD = 6;
private static final long[] LONGS = new long[0];
private long[] bitsBuffer = LONGS;
private static final int SMALL_ARRAY_THRESHOLD = 2; public void sort(Object[] entities, int size, net.minecraft.core.Position target) {
private Entity[] entityBuffer = new Entity[0];
private long[] bitsBuffer = new long[0];
@SuppressWarnings("unchecked")
public <T extends Entity, T_REF extends Entity> T[] sort(List<T> entities, T_REF referenceEntity, Class<T> entityClass) {
int size = entities.size();
if (size <= 1) { if (size <= 1) {
T[] resultArray = (T[]) Array.newInstance(entityClass, size); return;
return entities.toArray(resultArray);
} }
if (this.entityBuffer.length < size) { if (this.bitsBuffer.length < size) {
this.entityBuffer = new Entity[size];
this.bitsBuffer = new long[size]; this.bitsBuffer = new long[size];
} }
double tx = target.x();
double ty = target.y();
double tz = target.z();
for (int i = 0; i < size; i++) { for (int i = 0; i < size; i++) {
this.entityBuffer[i] = entities.get(i); this.bitsBuffer[i] = Double.doubleToRawLongBits(((Entity) entities[i]).distanceToSqr(tx, ty, tz));
this.bitsBuffer[i] = Double.doubleToRawLongBits(
referenceEntity.distanceToSqr(entities.get(i))
);
} }
fastRadixSort(this.entityBuffer, this.bitsBuffer, 0, size - 1, 62); fastRadixSort(entities, this.bitsBuffer, 0, size - 1, 62);
T[] resultArray = (T[]) Array.newInstance(entityClass, size);
for (int i = 0; i < size; i++) {
resultArray[i] = entityClass.cast(this.entityBuffer[i]);
}
return resultArray;
} }
private void fastRadixSort( private static void fastRadixSort(
Entity[] ents, Object[] ents,
long[] bits, long[] bits,
int low, int low,
int high, int high,
@@ -79,15 +66,15 @@ public class FastBitRadixSort {
} }
} }
private void insertionSort( private static void insertionSort(
Entity[] ents, Object[] ents,
long[] bits, long[] bits,
int low, int low,
int high int high
) { ) {
for (int i = low + 1; i <= high; i++) { for (int i = low + 1; i <= high; i++) {
int j = i; int j = i;
Entity currentEntity = ents[j]; Object currentEntity = ents[j];
long currentBits = bits[j]; long currentBits = bits[j];
while (j > low && bits[j - 1] > currentBits) { while (j > low && bits[j - 1] > currentBits) {
@@ -100,8 +87,8 @@ public class FastBitRadixSort {
} }
} }
private void swap(Entity[] ents, long[] bits, int a, int b) { private static void swap(Object[] ents, long[] bits, int a, int b) {
Entity tempEntity = ents[a]; Object tempEntity = ents[a];
ents[a] = ents[b]; ents[a] = ents[b];
ents[b] = tempEntity; ents[b] = tempEntity;