@woosh/meep-engine 3.44.0 → 3.45.0

package/src/shade/renderer/buffer/table/gpu_database_check_links.js

@@ -1,6 +1,7 @@
 import { assert } from "../../../../core/assert.js";
 import { GPU_DATABASE_NULL } from "./GPU_DATABASE_NULL.js";
 import { gpu_table_range_well_formed } from "./gpu_table_range_well_formed.js";
+import { number_compare_ascending } from "../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * @typedef {import("./GPUDatabase.js").GPUDatabase} GPUDatabase
@@ -412,7 +413,7 @@ export function gpu_database_check_links(databases) {
             const counts = owner_counts.get(table);
 
             if (counts !== undefined) {
-                const rows = Array.from(counts.keys()).sort((a, b) => a - b);
+                const rows = Array.from(counts.keys()).sort(number_compare_ascending);
 
                 for (let i = 0; i < rows.length; i++) {
                     const count = counts.get(rows[i]);

package/src/shade/renderer/geometry/virtual/build/level/vgeo_build_group_step.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_build_group_step.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_build_group_step.js"],"names":[],"mappings":"AAsEA;;;;;;;;;;;;;;GAcG;AACH,8EAXW,MAAM,EAAE,iBACR,UAAU,eACV,MAAM,SACN,MAAM,8BAEJ,aAAa,GAAC,SAAS,CA0dnC;8BA9gB6B,oBAAoB"}
+{"version":3,"file":"vgeo_build_group_step.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_build_group_step.js"],"names":[],"mappings":"AAuEA;;;;;;;;;;;;;;GAcG;AACH,8EAXW,MAAM,EAAE,iBACR,UAAU,eACV,MAAM,SACN,MAAM,8BAEJ,aAAa,GAAC,SAAS,CA0dnC;8BA/gB6B,oBAAoB"}

package/src/shade/renderer/geometry/virtual/build/level/vgeo_build_group_step.js

@@ -26,6 +26,7 @@ import { vgeo_extract_submesh } from "../submesh/vgeo_extract_submesh.js";
 import { vgeo_build_cluster } from "./vgeo_build_cluster.js";
 import { vgeo_compute_group_boundary } from "./vgeo_compute_group_boundary.js";
 import { VGeoGroupStep } from "./VGeoGroupStep.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * The defects a simplified group carries, as one line, or `''` when it carries none.
@@ -103,7 +104,7 @@ export function vgeo_build_group_step(
         }
     }
 
-    face_ids.sort((a, b) => a - b);
+    face_ids.sort(number_compare_ascending);
 
     const child_clusters = group_clusters.map((cluster) => frontier.clusters[cluster]);
 
@@ -503,7 +504,7 @@ export function vgeo_build_group_step(
     for (const part of parts) {
         const part_face_ids = part.map((dense) => submesh_face_graph.vertex_face_ids[dense]);
 
-        part_face_ids.sort((a, b) => a - b);
+        part_face_ids.sort(number_compare_ascending);
 
         const built = vgeo_build_cluster(submesh.mesh, part_face_ids, level, submesh.wedges);
 

package/src/shade/renderer/geometry/virtual/build/level/vgeo_build_leaf_frontier.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_build_leaf_frontier.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_build_leaf_frontier.js"],"names":[],"mappings":"AAqBA;;;;;;;;;;;;GAYG;AACH,wFATW,YAAY,GAIV,YAAY,CAoFxB;6BA9F4B,mBAAmB"}
+{"version":3,"file":"vgeo_build_leaf_frontier.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_build_leaf_frontier.js"],"names":[],"mappings":"AAsBA;;;;;;;;;;;;GAYG;AACH,wFATW,YAAY,GAIV,YAAY,CAoFxB;6BA/F4B,mBAAmB"}

package/src/shade/renderer/geometry/virtual/build/level/vgeo_build_leaf_frontier.js

@@ -18,6 +18,7 @@ import { VGeoFaceGraph } from "../partition/VGeoFaceGraph.js";
 import { vgeo_split_face_set } from "../partition/vgeo_split_face_set.js";
 import { vgeo_build_cluster } from "./vgeo_build_cluster.js";
 import { VGeoFrontier } from "./VGeoFrontier.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * Cut a mesh into leaf clusters — the frontier every round starts from.
@@ -98,7 +99,7 @@ export function vgeo_build_leaf_frontier(
     for (const part of parts) {
         const face_ids = part.map((dense) => face_graph.vertex_face_ids[dense]);
 
-        face_ids.sort((a, b) => a - b);
+        face_ids.sort(number_compare_ascending);
 
         const built = vgeo_build_cluster(mesh, face_ids, 0, frontier.wedges);
 

package/src/shade/renderer/geometry/virtual/build/level/vgeo_partition_into_groups.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_partition_into_groups.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_partition_into_groups.js"],"names":[],"mappings":"AA0MA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,yEARW,MAAM,EAAE,iBACR,MAAM,cACN,MAAM,GACJ,MAAM,EAAE,EAAE,CAqHtB"}
+{"version":3,"file":"vgeo_partition_into_groups.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_partition_into_groups.js"],"names":[],"mappings":"AA2MA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,yEARW,MAAM,EAAE,iBACR,MAAM,cACN,MAAM,GACJ,MAAM,EAAE,EAAE,CAqHtB"}

package/src/shade/renderer/geometry/virtual/build/level/vgeo_partition_into_groups.js

@@ -6,6 +6,7 @@ import { VGEO_MAX_CLUSTER_VERTEX_COUNT } from "../../format/cluster/VGEO_MAX_CLU
 import { VGEO_MAX_GROUP_CLUSTER_COUNT } from "../../format/page/VGEO_MAX_GROUP_CLUSTER_COUNT.js";
 import { vgeo_graph_components } from "../partition/vgeo_graph_components.js";
 import { vgeo_partition_subgraph } from "../partition/vgeo_partition_subgraph.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * Fixed so that the same frontier always groups the same way.
@@ -190,7 +191,7 @@ function absorb_singleton_pieces(pieces, cluster_graph) {
         );
 
         alive[best].push(cluster);
-        alive[best].sort((a, b) => a - b);
+        alive[best].sort(number_compare_ascending);
 
         piece_of.set(cluster, best);
 

package/src/shade/renderer/geometry/virtual/build/level/vgeo_run_round.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_run_round.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_run_round.js"],"names":[],"mappings":"AAyBA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,8DATW,MAAM,8BAEJ;IAAC,KAAK,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,iBAAiB,CAAC;IAAC,MAAM,EAAE,IAAI,MAAM,CAAC,CAAA;CAAC,GAAC,SAAS,CAyG/F"}
+{"version":3,"file":"vgeo_run_round.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_run_round.js"],"names":[],"mappings":"AA0BA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,8DATW,MAAM,8BAEJ;IAAC,KAAK,EAAE,eAAe,CAAC;IAAC,OAAO,EAAE,iBAAiB,CAAC;IAAC,MAAM,EAAE,IAAI,MAAM,CAAC,CAAA;CAAC,GAAC,SAAS,CAyG/F"}

package/src/shade/renderer/geometry/virtual/build/level/vgeo_run_round.js

@@ -5,6 +5,7 @@ import { vgeo_build_group_step } from "./vgeo_build_group_step.js";
 import { vgeo_error_bands } from "./vgeo_error_bands.js";
 import { vgeo_partition_into_groups } from "./vgeo_partition_into_groups.js";
 import { vgeo_try_repack } from "./vgeo_try_repack.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * The frontier's clusters ordered by error, which is what a band is a slice of.
@@ -65,7 +66,7 @@ export function vgeo_run_round(frontier, level, options) {
         for (const range of bands) {
             const band = ordered.order.slice(range.start, range.end);
 
-            band.sort((a, b) => a - b);
+            band.sort(number_compare_ascending);
 
             const groups = vgeo_partition_into_groups(frontier, band, cluster_graph, group_size);
 

package/src/shade/renderer/geometry/virtual/build/level/vgeo_try_repack.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_try_repack.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_try_repack.js"],"names":[],"mappings":"AASA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wEAPW,MAAM,EAAE,iBACR,MAAM,GACJ,eAAe,GAAC,SAAS,CAsFrC;gCA7G+B,sBAAsB"}
+{"version":3,"file":"vgeo_try_repack.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/level/vgeo_try_repack.js"],"names":[],"mappings":"AAUA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wEAPW,MAAM,EAAE,iBACR,MAAM,GACJ,eAAe,GAAC,SAAS,CAsFrC;gCA9G+B,sBAAsB"}

package/src/shade/renderer/geometry/virtual/build/level/vgeo_try_repack.js

@@ -6,6 +6,7 @@ import { vgeo_split_face_set_packed } from "../partition/vgeo_split_face_set_pac
 import { vgeo_extract_submesh } from "../submesh/vgeo_extract_submesh.js";
 import { vgeo_build_cluster } from "./vgeo_build_cluster.js";
 import { VGeoGroupRepack } from "./VGeoGroupRepack.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * Leaves with room to spare between them, re-cut into fewer and fuller leaves.
@@ -53,7 +54,7 @@ export function vgeo_try_repack(frontier, group_clusters, parent_target) {
         return undefined;
     }
 
-    face_ids.sort((a, b) => a - b);
+    face_ids.sort(number_compare_ascending);
 
     const submesh = vgeo_extract_submesh(frontier.mesh, face_ids, frontier.wedges);
 
@@ -88,7 +89,7 @@ export function vgeo_try_repack(frontier, group_clusters, parent_target) {
     for (const part of parts) {
         const part_face_ids = part.map((dense) => face_graph.vertex_face_ids[dense]);
 
-        part_face_ids.sort((a, b) => a - b);
+        part_face_ids.sort(number_compare_ascending);
 
         const built = vgeo_build_cluster(submesh.mesh, part_face_ids, 0, submesh.wedges);
 

package/src/shade/renderer/geometry/virtual/build/partition/vgeo_graph_components.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_graph_components.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/partition/vgeo_graph_components.js"],"names":[],"mappings":"AA6CA;;;;;;;;;;;GAWG;AACH,sDARW,WAAW,aACX,WAAW,WACX,MAAM,EAAE,cACR,UAAU,SAEV,MAAM,GACJ,MAAM,EAAE,EAAE,CAmEtB"}
+{"version":3,"file":"vgeo_graph_components.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/partition/vgeo_graph_components.js"],"names":[],"mappings":"AA8CA;;;;;;;;;;;GAWG;AACH,sDARW,WAAW,aACX,WAAW,WACX,MAAM,EAAE,cACR,UAAU,SAEV,MAAM,GACJ,MAAM,EAAE,EAAE,CAmEtB"}

package/src/shade/renderer/geometry/virtual/build/partition/vgeo_graph_components.js

@@ -1,3 +1,4 @@
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 /**
  * Connected components of the subgraph a CSR induces on a member set.
  *
@@ -112,7 +113,7 @@ export function vgeo_graph_components(
             }
         }
 
-        component.sort((a, b) => a - b);
+        component.sort(number_compare_ascending);
 
         result.push(component);
     }

package/src/shade/renderer/geometry/virtual/build/partition/vgeo_split_face_set_packed.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_split_face_set_packed.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/partition/vgeo_split_face_set_packed.js"],"names":[],"mappings":"AAmVA;;;;;;;;;;;;GAYG;AACH,+EALW,MAAM,EAAE,aACR,MAAM,gBACN,MAAM,GACJ,MAAM,EAAE,EAAE,CAoBtB"}
+{"version":3,"file":"vgeo_split_face_set_packed.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/geometry/virtual/build/partition/vgeo_split_face_set_packed.js"],"names":[],"mappings":"AAoVA;;;;;;;;;;;;GAYG;AACH,+EALW,MAAM,EAAE,aACR,MAAM,gBACN,MAAM,GACJ,MAAM,EAAE,EAAE,CAoBtB"}

package/src/shade/renderer/geometry/virtual/build/partition/vgeo_split_face_set_packed.js

@@ -4,6 +4,7 @@ import {
     bt_face_read_triangle_vertices
 } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.js";
 import { vgeo_split_face_set } from "./vgeo_split_face_set.js";
+import { number_compare_ascending } from "../../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * {@link vgeo_split_face_set}, then merge the under-filled pieces it left behind.
@@ -331,7 +332,7 @@ function pack_pieces(face_graph, pieces, max_faces, max_vertices, floor) {
             }
         }
 
-        packed.sort((a, b) => a - b);
+        packed.sort(number_compare_ascending);
 
         return packed;
     });

package/src/shade/renderer/geometry/virtual/format/vgeo_write_container.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vgeo_write_container.d.ts","sourceRoot":"","sources":["../../../../../../../src/shade/renderer/geometry/virtual/format/vgeo_write_container.js"],"names":[],"mappings":"AAkfA;;;;;;;;GAQG;AACH,4CANW,qBAAqB,8BAGnB,QAAQ,YAAY,CAAC,CAmOjC;6BA1tB4B,4CAA4C"}
+{"version":3,"file":"vgeo_write_container.d.ts","sourceRoot":"","sources":["../../../../../../../src/shade/renderer/geometry/virtual/format/vgeo_write_container.js"],"names":[],"mappings":"AAmfA;;;;;;;;GAQG;AACH,4CANW,qBAAqB,8BAGnB,QAAQ,YAAY,CAAC,CAmOjC;6BA3tB4B,4CAA4C"}

package/src/shade/renderer/geometry/virtual/format/vgeo_write_container.js

@@ -41,6 +41,7 @@ import { VGEO_PARENT_PAGE_ENTRY_SIZE } from "./page/VGEO_PARENT_PAGE_ENTRY_SIZE.
 import { VGEO_PAYLOAD_ENCODING_SHADE_MESHLET_V1 } from "./header/VGEO_PAYLOAD_ENCODING_SHADE_MESHLET_V1.js";
 import { VGEO_SAME_PAGE } from "./cluster/VGEO_SAME_PAGE.js";
 import { vgeo_scan_frames } from "./frame/vgeo_scan_frames.js";
+import { number_compare_ascending } from "../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * Serialize an assembled page list into `.vgeo` bytes.
@@ -182,7 +183,7 @@ function collect_parent_pages(page, parents) {
         }
     }
 
-    return Array.from(seen).sort((a, b) => a - b);
+    return Array.from(seen).sort(number_compare_ascending);
 }
 
 /**
@@ -206,7 +207,7 @@ function collect_child_pages(page) {
         }
     }
 
-    return Array.from(seen).sort((a, b) => a - b);
+    return Array.from(seen).sort(number_compare_ascending);
 }
 
 /**

package/src/shade/renderer/particles/optimizer/dag/particle_vector_extract.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"particle_vector_extract.d.ts","sourceRoot":"","sources":["../../../../../../../src/shade/renderer/particles/optimizer/dag/particle_vector_extract.js"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH;;;;;;;GAOG;AACH,gDAHW,OAAO,4BAA4B,EAAE,kBAAkB,GACrD,MAAM,CAIlB;AAED;;;;;GAKG;AAEH;;;;;;;;;GASG;AACH,+CATW,OAAO,4BAA4B,EAAE,mBAAmB,SACxD,MAAM,EAAE;IAE4E,SAAS,UAApF,OAAO,4BAA4B,EAAE,kBAAkB,KAAG,MAAM;IACxD,UAAU,GAA3B,MAAM;IACW,eAAe,GAAhC,MAAM;IAEJ,uBAAuB,CA0DnC;;;;;YAvEa,IAAI,MAAM,EAAE,MAAM,CAAC;;;;WACnB,MAAM,EAAE;;;;UACR,MAAM"}
+{"version":3,"file":"particle_vector_extract.d.ts","sourceRoot":"","sources":["../../../../../../../src/shade/renderer/particles/optimizer/dag/particle_vector_extract.js"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH;;;;;;;GAOG;AACH,gDAHW,OAAO,4BAA4B,EAAE,kBAAkB,GACrD,MAAM,CAIlB;AAED;;;;;GAKG;AAEH;;;;;;;;;GASG;AACH,+CATW,OAAO,4BAA4B,EAAE,mBAAmB,SACxD,MAAM,EAAE;IAE4E,SAAS,UAApF,OAAO,4BAA4B,EAAE,kBAAkB,KAAG,MAAM;IACxD,UAAU,GAA3B,MAAM;IACW,eAAe,GAAhC,MAAM;IAEJ,uBAAuB,CA0DnC;;;;;YAvEa,IAAI,MAAM,EAAE,MAAM,CAAC;;;;WACnB,MAAM,EAAE;;;;UACR,MAAM"}

package/src/shade/renderer/particles/optimizer/dag/particle_vector_extract.js

@@ -1,5 +1,6 @@
 import { assert } from "../../../../../core/assert.js";
 import { PV } from "./particle_vector_graph.js";
+import { number_compare_ascending } from "../../../../../core/primitives/numbers/number_compare_ascending.js";
 
 /**
  * Choose one node per class — the instruction-count half of the optimizer.
@@ -86,7 +87,7 @@ export function extract_particle_values(graph, roots, {
 
         // Only the classes that are both reachable and hold more than one node are a decision; with
         // one alternative-generating rule that is a handful of products per program.
-        for (const id of [...reached].sort((a, b) => a - b)) {
+        for (const id of [...reached].sort(number_compare_ascending)) {
             const members = graph.members(id);
 
             if (members.length < 2 || evaluations >= max_evaluations) {
@@ -247,7 +248,7 @@ function topological(graph, reached, choice) {
     const order = [];
     const done = new Set();
 
-    for (const root of [...reached].sort((a, b) => a - b)) {
+    for (const root of [...reached].sort(number_compare_ascending)) {
         if (done.has(root)) {
             continue;
         }