@playcanvas/splat-transform 1.4.0 → 1.4.1

package/dist/index.mjs

@@ -156,42 +156,38 @@ class DataTable {
      * After calling, row `i` will contain the data that was previously at row `indices[i]`.
      *
      * This is a memory-efficient alternative to `permuteRows` that modifies the table
-     * in-place rather than creating a copy.
+     * in-place rather than creating a copy. It reuses ArrayBuffers between columns to
+     * minimize memory allocations.
      *
      * @param indices - Array of indices defining the permutation. Must have the same
      * length as the number of rows, and must be a valid permutation
      * (each index 0 to n-1 appears exactly once).
      */
     permuteRowsInPlace(indices) {
-        const n = this.numRows;
-        const numCols = this.columns.length;
-        const visited = new Uint8Array(n);
-        const temps = new Array(numCols);
-        for (let i = 0; i < n; i++) {
-            if (visited[i] || indices[i] === i)
-                continue;
-            // Save values at position i
-            for (let c = 0; c < numCols; c++) {
-                temps[c] = this.columns[c].data[i];
+        // Cache for reusing ArrayBuffers by size
+        const cache = new Map();
+        const getBuffer = (size) => {
+            const cached = cache.get(size);
+            if (cached) {
+                cache.delete(size);
+                return cached;
             }
-            // Walk the cycle
-            let j = i;
-            while (true) {
-                const next = indices[j];
-                visited[j] = 1;
-                if (next === i) {
-                    // End of cycle - place saved values
-                    for (let c = 0; c < numCols; c++) {
-                        this.columns[c].data[j] = temps[c];
-                    }
-                    break;
-                }
-                // Move values from next to j
-                for (let c = 0; c < numCols; c++) {
-                    this.columns[c].data[j] = this.columns[c].data[next];
-                }
-                j = next;
+            return new ArrayBuffer(size);
+        };
+        const returnBuffer = (buffer) => {
+            cache.set(buffer.byteLength, buffer);
+        };
+        const n = this.numRows;
+        for (const column of this.columns) {
+            const src = column.data;
+            const constructor = src.constructor;
+            const dst = new constructor(getBuffer(src.byteLength));
+            // Sequential writes are cache-friendly
+            for (let i = 0; i < n; i++) {
+                dst[i] = src[indices[i]];
             }
+            returnBuffer(src.buffer);
+            column.data = dst;
         }
     }
 }
@@ -3722,7 +3718,7 @@ class CompressedChunk {
     }
 }
 
-var version = "1.4.0";
+var version = "1.4.1";
 
 const generatedByString = `Generated by splat-transform ${version}`;
 const chunkProps = [