ldr 0.33.11 → 0.33.12

package/dist/cli.js

@@ -1,18 +1,18 @@
 #!/usr/bin/env node
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/cli.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/cli.ts
 import fs4 from "node:fs";
 import zlib from "node:zlib";
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/build-pack.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/build-pack.ts
 import fs3 from "node:fs";
 import path3 from "node:path";
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/resolver.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/resolver.ts
 import fs from "node:fs";
 import path from "node:path";
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/spec.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/spec.ts
 var norm = (s) => s.trim().toLowerCase().replace(/\\/g, "/").replace(/\/+/g, "/");
 var COLOUR_ID_RE = /^[A-Za-z][A-Za-z0-9_]*$/;
 var namedCodes = new Map;
@@ -817,7 +817,7 @@ function fileStepViews(f) {
   return out;
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/model.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/model.ts
 class ModelLimitError extends Error {
   limit;
   code = "ldr-model-limit";
@@ -1259,7 +1259,7 @@ function blendedColourHex(code) {
   return "#" + [0, 1, 2].map((k) => (a[k] + b[k] >> 1).toString(16).padStart(2, "0")).join("").toUpperCase();
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/resolver.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/resolver.ts
 var TOP_STUD_RE = /^(stud|studa|stud2|stud2a|stud6|stud6a|stud10|stud15|stud2s|stud2s2|stud-logo\d*|stud2-logo\d*)\.dat$/i;
 var UNDER_STUD_RE = /^(stud3|stud3a|stud4.*|stud12|stud16.*|stud18a)\.dat$/i;
 var norm2 = (ref) => ref.trim().replace(/\\/g, "/").toLowerCase();
@@ -1586,11 +1586,11 @@ function collectDeps(lib, refs) {
   return out;
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/compile.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/compile.ts
 import fs2 from "node:fs";
 import path2 from "node:path";
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/lod.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/lod.ts
 import { MeshoptSimplifier, MeshoptEncoder } from "meshoptimizer";
 await Promise.all([MeshoptSimplifier.ready, MeshoptEncoder.ready]);
 function reorderMesh(P, N, C, I) {
@@ -1896,7 +1896,7 @@ function levelLines(P, I, E, err, always, tol = 0.01) {
   return out;
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/compile.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/compile.ts
 class BfcState {
   accum;
   ccw = true;
@@ -2840,7 +2840,7 @@ function encodePack(parts, studKinds, weld, extra, options = {}) {
   return Buffer.concat([head, ...chunks.map((c) => new Uint8Array(c.buffer, c.byteOffset, c.byteLength))]);
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/node/build-pack.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/node/build-pack.ts
 function packCompilerOpts(o) {
   return { studs: o.studs ?? "low", prims: o.primitives ?? "full", weld: o.weld ?? true, separateStuds: true, cond: !!o.cond, tex: !!o.textures, ...o.partWorkLimit ? { workLimit: o.partWorkLimit } : {} };
 }
@@ -2913,7 +2913,7 @@ function buildPack(o) {
   return { data: encodePack(parts, kinds, comp.opts.weld, extra, { texture, lod: o.lod !== false, reorder: !!o.reorder }), parts: parts.size, studKinds: kinds.size, missing: [...missing], ...warnings.length ? { warnings } : {} };
 }
 
-// ../../../../../../../tmp/ldr-build-QFMx37/src/cli.ts
+// ../../../../../../../tmp/ldr-build-HYKc29/src/cli.ts
 var HELP = `ldr pack — build a parts pack for the ldr three.js renderer
 
 Usage:

package/dist/cull.d.ts

@@ -21,17 +21,21 @@ export declare function mul12To(a: ArrayLike<number>, b: ArrayLike<number>, bo:
 export declare const det12: (m: ArrayLike<number>) => number;
 /** Singular placement (determinant ~0, relative to the row lengths): BFC can't cull it (article 415 "Degenerate Matrices"). */
 export declare const singular12: (m: ArrayLike<number>, d?: number) => boolean;
-/** Open-addressing hash table from int32 triples to int32 values (-1 = absent); grows as needed. */
+/** Open-addressing hash table from int32 triples to int32 values (-1 = absent); grows as needed. Keys and value sit interleaved in one
+ *  Int32Array (x, y, z, value), and a byte per slot holds 8 more bits of the key's hash (0 = empty), so a miss usually reads only the
+ *  byte array and a hit one cache line of the keys, where five parallel arrays cost five. With `shift` >= 0, keys close in x / z (a
+ *  4 x 4 block of (1 << shift)-unit squares) start in neighbouring slots, so the studs of one brick, or the cells under it, share cache
+ *  lines. The stud-top table of a 400k-brick city has millions of entries and its lookups were the culling pass's biggest cost
+ *  (Round 73). */
 export declare class Int3Table {
-    a: Int32Array;
-    b: Int32Array;
-    c: Int32Array;
-    vals: Int32Array;
-    used: Uint8Array;
+    t: Int32Array;
+    tag: Uint8Array;
     mask: number;
     size: number;
-    constructor(cap?: number);
+    shift: number;
+    constructor(cap?: number, shift?: number);
     private slot;
+    private static tagOf;
     get(x: number, y: number, z: number): number;
     /** Sets (x, y, z) -> v and returns the previous value (-1 if none). */
     put(x: number, y: number, z: number, v: number): number;