revert: smart sort entities in NearestLivingEntitySensor [ci skip]

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

@@ -1,112 +0,0 @@
-package org.dreeam.leaf.util;
-
-import net.minecraft.world.entity.Entity;
-
-import java.lang.reflect.Array; // Required for Array.newInstance
-import java.util.List;
-
-public class FastBitRadixSort {
-
-    private static final int SMALL_ARRAY_THRESHOLD = 6;
-    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) {
-            T[] resultArray = (T[]) Array.newInstance(entityClass, size);
-            return entities.toArray(resultArray);
-        }
-
-        if (this.entityBuffer.length < size) {
-            this.entityBuffer = new Entity[size];
-            this.bitsBuffer = new long[size];
-        }
-        for (int i = 0; i < size; i++) {
-            this.entityBuffer[i] = entities.get(i);
-            this.bitsBuffer[i] = Double.doubleToRawLongBits(
-                referenceEntity.distanceToSqr(entities.get(i))
-            );
-        }
-
-        fastRadixSort(this.entityBuffer, 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(
-        Entity[] ents,
-        long[] bits,
-        int low,
-        int high,
-        int bit
-    ) {
-        if (bit < 0 || low >= high) {
-            return;
-        }
-
-        if (high - low <= SMALL_ARRAY_THRESHOLD) {
-            insertionSort(ents, bits, low, high);
-            return;
-        }
-
-        int i = low;
-        int j = high;
-        final long mask = 1L << bit;
-
-        while (i <= j) {
-            while (i <= j && (bits[i] & mask) == 0) {
-                i++;
-            }
-            while (i <= j && (bits[j] & mask) != 0) {
-                j--;
-            }
-            if (i < j) {
-                swap(ents, bits, i++, j--);
-            }
-        }
-
-        if (low < j) {
-            fastRadixSort(ents, bits, low, j, bit - 1);
-        }
-        if (i < high) {
-            fastRadixSort(ents, bits, i, high, bit - 1);
-        }
-    }
-
-    private void insertionSort(
-        Entity[] ents,
-        long[] bits,
-        int low,
-        int high
-    ) {
-        for (int i = low + 1; i <= high; i++) {
-            int j = i;
-            Entity currentEntity = ents[j];
-            long currentBits = bits[j];
-
-            while (j > low && bits[j - 1] > currentBits) {
-                ents[j] = ents[j - 1];
-                bits[j] = bits[j - 1];
-                j--;
-            }
-            ents[j] = currentEntity;
-            bits[j] = currentBits;
-        }
-    }
-
-    private void swap(Entity[] ents, long[] bits, int a, int b) {
-        Entity tempEntity = ents[a];
-        ents[a] = ents[b];
-        ents[b] = tempEntity;
-
-        long tempBits = bits[a];
-        bits[a] = bits[b];
-        bits[b] = tempBits;
-    }
-}