Avoid primitive boxing caused by enhanced for-loops in translucency sorting (#3135)

Author: douira

common/src/main/java/net/caffeinemc/mods/sodium/client/render/chunk/translucent_sorting/bsp_tree/InnerPartitionBSPNode.java

@@ -245,7 +245,8 @@ static BSPNode build(BSPWorkspace workspace, IntArrayList indexes, int depth, BS
 
             // collect all the geometry's start and end points in this direction
             points.clear();
-            for (int quadIndex : indexes) {
+            for (int i = 0, size = indexes.size(); i < size; i++) {
+                int quadIndex = indexes.getInt(i);
                 var quad = workspace.quads[quadIndex];
                 var extents = quad.getExtents();
                 var posExtent = extents[axis];
@@ -288,7 +289,8 @@ static BSPNode build(BSPWorkspace workspace, IntArrayList indexes, int depth, BS
             IntArrayList quadsBefore = null;
             IntArrayList quadsOn = null;
             int thickness = 0;
-            for (long point : points) {
+            for (int i = 0, size = points.size(); i < size; i++) {
+                long point = points.getLong(i);
                 switch (decodeType(point)) {
                     case INTERVAL_START -> {
                         // unless at the start, flush if there's a gap

common/src/main/java/net/caffeinemc/mods/sodium/client/render/chunk/translucent_sorting/trigger/NormalPlanes.java

@@ -57,7 +57,8 @@ public void prepareIntegration() {
         var size = this.relativeDistancesSet.size();
         this.relativeDistances = new float[this.relativeDistancesSet.size()];
         int i = 0;
-        for (float relDistance : this.relativeDistancesSet) {
+        for (var it = this.relativeDistancesSet.iterator(); it.hasNext(); ) {
+            float relDistance = it.nextFloat();
             this.relativeDistances[i++] = relDistance;
 
             long distanceBits = Double.doubleToLongBits(relDistance);