@ifc-lite/data 1.15.1 → 1.17.0

package/dist/relationship-graph.js

@@ -25,122 +25,158 @@ export class RelationshipGraphBuilder {
     }
     build() {
         const n = this._sources.length;
-        // Build forward CSR (sorted by source, value = target)
-        const forward = this.buildCSR(n, this._sources, this._targets, this._types, this._relIds);
-        // Build inverse CSR (sorted by target, value = source)
-        const inverse = this.buildCSR(n, this._targets, this._sources, this._types, this._relIds);
-        return {
-            forward,
-            inverse,
-            getRelated: (entityId, relType, direction) => {
-                const edges = direction === 'forward'
-                    ? forward.getEdges(entityId, relType)
-                    : inverse.getEdges(entityId, relType);
-                return edges.map((e) => e.target);
-            },
-            hasRelationship: (sourceId, targetId, relType) => {
-                const edges = forward.getEdges(sourceId, relType);
-                return edges.some((e) => e.target === targetId);
-            },
-            getRelationshipsBetween: (sourceId, targetId) => {
-                const edges = forward.getEdges(sourceId);
-                return edges
-                    .filter((e) => e.target === targetId)
-                    .map((e) => ({
-                    relationshipId: e.relationshipId,
-                    type: e.type,
-                    typeName: RelationshipTypeToString(e.type),
-                }));
-            },
-        };
+        const forward = buildCSR(n, this._sources, this._targets, this._types, this._relIds);
+        const inverse = buildCSR(n, this._targets, this._sources, this._types, this._relIds);
+        return relationshipGraphFromEdges(forward, inverse);
     }
-    /**
-     * Build CSR (Compressed Sparse Row) using counting sort.
-     * O(n) instead of O(n log n) — crucial for 12M+ edges.
-     */
-    buildCSR(n, keys, // sort key (source for forward, target for inverse)
-    values, // stored value (target for forward, source for inverse)
-    types, relIds) {
-        if (n === 0) {
-            return this.emptyEdges();
-        }
-        // Step 1: Count edges per key entity
-        const countMap = new Map();
-        for (let i = 0; i < n; i++) {
-            const k = keys[i];
-            countMap.set(k, (countMap.get(k) ?? 0) + 1);
-        }
-        // Step 2: Compute offsets (prefix sums)
-        const offsets = new Map();
-        const counts = new Map();
-        // Sort unique keys for deterministic CSR order
-        const uniqueKeys = Array.from(countMap.keys()).sort((a, b) => a - b);
-        let offset = 0;
-        for (const k of uniqueKeys) {
-            offsets.set(k, offset);
-            counts.set(k, countMap.get(k));
-            offset += countMap.get(k);
-        }
-        // Step 3: Place edges into sorted positions (counting sort scatter)
-        const edgeTargets = new Uint32Array(n);
-        const edgeTypes = new Uint16Array(n);
-        const edgeRelIds = new Uint32Array(n);
-        // Track current write position per key
-        const writePos = new Map();
-        for (const [k, o] of offsets) {
-            writePos.set(k, o);
-        }
-        for (let i = 0; i < n; i++) {
-            const k = keys[i];
-            const pos = writePos.get(k);
-            edgeTargets[pos] = values[i];
-            edgeTypes[pos] = types[i];
-            edgeRelIds[pos] = relIds[i];
-            writePos.set(k, pos + 1);
-        }
-        return {
-            offsets,
-            counts,
-            edgeTargets,
-            edgeTypes,
-            edgeRelIds,
-            getEdges(entityId, type) {
-                const o = offsets.get(entityId);
-                if (o === undefined)
-                    return [];
-                const c = counts.get(entityId);
-                const edges = [];
-                for (let i = o; i < o + c; i++) {
-                    if (type === undefined || edgeTypes[i] === type) {
-                        edges.push({
-                            target: edgeTargets[i],
-                            type: edgeTypes[i],
-                            relationshipId: edgeRelIds[i],
-                        });
-                    }
-                }
-                return edges;
-            },
-            getTargets(entityId, type) {
-                return this.getEdges(entityId, type).map(e => e.target);
-            },
-            hasAnyEdges(entityId) {
-                return offsets.has(entityId);
-            },
-        };
+}
+/**
+ * Build CSR (Compressed Sparse Row) using counting sort.
+ * O(n) instead of O(n log n) — crucial for 12M+ edges.
+ *
+ * Exported because the graph can be reconstructed from raw edge arrays
+ * (e.g. when merging or rebuilding a graph) without going through the
+ * `RelationshipGraphBuilder` mutation API.
+ */
+export function buildCSR(n, keys, values, types, relIds) {
+    if (n === 0)
+        return emptyRelationshipEdges();
+    // Step 1: count per key
+    const countMap = new Map();
+    for (let i = 0; i < n; i++) {
+        const k = keys[i];
+        countMap.set(k, (countMap.get(k) ?? 0) + 1);
+    }
+    // Step 2: prefix-sum offsets, sorted for deterministic order
+    const offsets = new Map();
+    const counts = new Map();
+    const uniqueKeys = Array.from(countMap.keys()).sort((a, b) => a - b);
+    let offset = 0;
+    for (const k of uniqueKeys) {
+        offsets.set(k, offset);
+        counts.set(k, countMap.get(k));
+        offset += countMap.get(k);
     }
-    emptyEdges() {
-        return {
-            offsets: new Map(),
-            counts: new Map(),
-            edgeTargets: new Uint32Array(0),
-            edgeTypes: new Uint16Array(0),
-            edgeRelIds: new Uint32Array(0),
-            getEdges: () => [],
-            getTargets: () => [],
-            hasAnyEdges: () => false,
-        };
+    // Step 3: scatter edges into sorted positions
+    const edgeTargets = new Uint32Array(n);
+    const edgeTypes = new Uint16Array(n);
+    const edgeRelIds = new Uint32Array(n);
+    const writePos = new Map();
+    for (const [k, o] of offsets)
+        writePos.set(k, o);
+    for (let i = 0; i < n; i++) {
+        const k = keys[i];
+        const pos = writePos.get(k);
+        edgeTargets[pos] = values[i];
+        edgeTypes[pos] = types[i];
+        edgeRelIds[pos] = relIds[i];
+        writePos.set(k, pos + 1);
     }
+    return relationshipEdgesFromColumns({ offsets, counts, edgeTargets, edgeTypes, edgeRelIds });
+}
+function emptyRelationshipEdges() {
+    return relationshipEdgesFromColumns({
+        offsets: new Map(),
+        counts: new Map(),
+        edgeTargets: new Uint32Array(0),
+        edgeTypes: new Uint16Array(0),
+        edgeRelIds: new Uint32Array(0),
+    });
+}
+/**
+ * Rebuild the closure-bearing `RelationshipEdges` view (one direction of
+ * the graph) from raw CSR columns. Used by both the in-process builder and
+ * the parser-worker transport layer.
+ */
+export function relationshipEdgesFromColumns(columns) {
+    const { offsets, counts, edgeTargets, edgeTypes, edgeRelIds } = columns;
+    const edges = {
+        offsets,
+        counts,
+        edgeTargets,
+        edgeTypes,
+        edgeRelIds,
+        getEdges(entityId, type) {
+            const o = offsets.get(entityId);
+            if (o === undefined)
+                return [];
+            const c = counts.get(entityId);
+            const out = [];
+            for (let i = o; i < o + c; i++) {
+                if (type === undefined || edgeTypes[i] === type) {
+                    out.push({ target: edgeTargets[i], type: edgeTypes[i], relationshipId: edgeRelIds[i] });
+                }
+            }
+            return out;
+        },
+        getTargets(entityId, type) {
+            return edges.getEdges(entityId, type).map(e => e.target);
+        },
+        hasAnyEdges(entityId) {
+            return offsets.has(entityId);
+        },
+    };
+    return edges;
+}
+/**
+ * Compose a complete `RelationshipGraph` from the two directional halves.
+ * Splits cleanly so that the column extractor can pull edges without
+ * touching the closures attached above.
+ */
+export function relationshipGraphFromEdges(forward, inverse) {
+    return {
+        forward,
+        inverse,
+        getRelated: (entityId, relType, direction) => {
+            const e = direction === 'forward'
+                ? forward.getEdges(entityId, relType)
+                : inverse.getEdges(entityId, relType);
+            return e.map((edge) => edge.target);
+        },
+        hasRelationship: (sourceId, targetId, relType) => {
+            const e = forward.getEdges(sourceId, relType);
+            return e.some((edge) => edge.target === targetId);
+        },
+        getRelationshipsBetween: (sourceId, targetId) => {
+            return forward.getEdges(sourceId)
+                .filter((edge) => edge.target === targetId)
+                .map((edge) => ({
+                relationshipId: edge.relationshipId,
+                type: edge.type,
+                typeName: RelationshipTypeToString(edge.type),
+            }));
+        },
+    };
+}
+/**
+ * Reconstruct a `RelationshipGraph` (closures + both halves) from the
+ * column-only POJO produced by `relationshipGraphToColumns`.
+ */
+export function relationshipGraphFromColumns(columns) {
+    return relationshipGraphFromEdges(relationshipEdgesFromColumns(columns.forward), relationshipEdgesFromColumns(columns.inverse));
+}
+/**
+ * Extract the column data (CSR offsets, counts, parallel edge arrays) from
+ * a `RelationshipGraph`. The returned typed arrays alias the source — they
+ * detach from the source when used in a `postMessage` transfer list.
+ */
+export function relationshipGraphToColumns(graph) {
+    return {
+        forward: {
+            offsets: graph.forward.offsets,
+            counts: graph.forward.counts,
+            edgeTargets: graph.forward.edgeTargets,
+            edgeTypes: graph.forward.edgeTypes,
+            edgeRelIds: graph.forward.edgeRelIds,
+        },
+        inverse: {
+            offsets: graph.inverse.offsets,
+            counts: graph.inverse.counts,
+            edgeTargets: graph.inverse.edgeTargets,
+            edgeTypes: graph.inverse.edgeTypes,
+            edgeRelIds: graph.inverse.edgeRelIds,
+        },
+    };
 }
 function RelationshipTypeToString(type) {
     const names = {

package/dist/relationship-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"relationship-graph.js","sourceRoot":"","sources":["../src/relationship-graph.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAmC9C;;;;;GAKG;AACH,MAAM,OAAO,wBAAwB;IAC3B,QAAQ,GAAa,EAAE,CAAC;IACxB,QAAQ,GAAa,EAAE,CAAC;IACxB,MAAM,GAAa,EAAE,CAAC;IACtB,OAAO,GAAa,EAAE,CAAC;IAE/B,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,IAAsB,EAAE,KAAa;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAE/B,uDAAuD;QACvD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1F,uDAAuD;QACvD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAE1F,OAAO;YACL,OAAO;YACP,OAAO;YAEP,UAAU,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE;gBAC3C,MAAM,KAAK,GAAG,SAAS,KAAK,SAAS;oBACnC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;oBACrC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBACxC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC1C,CAAC;YAED,eAAe,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE;gBAC/C,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAClD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;YACxD,CAAC;YAED,uBAAuB,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;gBAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBACzC,OAAO,KAAK;qBACT,MAAM,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC;qBAC1C,GAAG,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC;oBACjB,cAAc,EAAE,CAAC,CAAC,cAAc;oBAChC,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,QAAQ,EAAE,wBAAwB,CAAC,CAAC,CAAC,IAAI,CAAC;iBAC3C,CAAC,CAAC,CAAC;YACR,CAAC;SACF,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,QAAQ,CACd,CAAS,EACT,IAAc,EAAQ,oDAAoD;IAC1E,MAAgB,EAAM,wDAAwD;IAC9E,KAAe,EACf,MAAgB;QAEhB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3B,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,+CAA+C;QAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;YAChC,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC7B,CAAC;QAED,oEAAoE;QACpE,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QACtC,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YAC7B,WAAW,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO;YACL,OAAO;YACP,MAAM;YACN,WAAW;YACX,SAAS;YACT,UAAU;YAEV,QAAQ,CAAC,QAAgB,EAAE,IAAuB;gBAChD,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChC,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO,EAAE,CAAC;gBAE/B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBAChC,MAAM,KAAK,GAAW,EAAE,CAAC;gBAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC/B,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;wBAChD,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;4BACtB,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;4BAClB,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;yBAC9B,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;gBAED,OAAO,KAAK,CAAC;YACf,CAAC;YAED,UAAU,CAAC,QAAgB,EAAE,IAAuB;gBAClD,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC1D,CAAC;YAED,WAAW,CAAC,QAAgB;gBAC1B,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC/B,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,UAAU;QAChB,OAAO;YACL,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,MAAM,EAAE,IAAI,GAAG,EAAE;YACjB,WAAW,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;YAC/B,SAAS,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;YAC7B,UAAU,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;YAC9B,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE;YAClB,UAAU,EAAE,GAAG,EAAE,CAAC,EAAE;YACpB,WAAW,EAAE,GAAG,EAAE,CAAC,KAAK;SACzB,CAAC;IACJ,CAAC;CACF;AAED,SAAS,wBAAwB,CAAC,IAAsB;IACtD,MAAM,KAAK,GAAqC;QAC9C,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,mCAAmC;QACxE,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,kBAAkB;QACjD,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,EAAE,2BAA2B;QACnE,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,qBAAqB;QACvD,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,EAAE,0BAA0B;QACjE,CAAC,gBAAgB,CAAC,wBAAwB,CAAC,EAAE,gCAAgC;QAC7E,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,EAAE,0BAA0B;QACjE,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,oBAAoB;QACrD,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,oBAAoB;QACrD,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,EAAE,4BAA4B;QACrE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,wBAAwB;QAC7D,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,qBAAqB;QACvD,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAAE,sBAAsB;QACzD,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,wBAAwB;QAC7D,CAAC,gBAAgB,CAAC,4BAA4B,CAAC,EAAE,oCAAoC;KACtF,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;AAClC,CAAC"}
+{"version":3,"file":"relationship-graph.js","sourceRoot":"","sources":["../src/relationship-graph.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;GAGG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAmC9C;;;;;GAKG;AACH,MAAM,OAAO,wBAAwB;IAC3B,QAAQ,GAAa,EAAE,CAAC;IACxB,QAAQ,GAAa,EAAE,CAAC;IACxB,MAAM,GAAa,EAAE,CAAC;IACtB,OAAO,GAAa,EAAE,CAAC;IAE/B,OAAO,CAAC,MAAc,EAAE,MAAc,EAAE,IAAsB,EAAE,KAAa;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACrF,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACrF,OAAO,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;CACF;AAyBD;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CACtB,CAAS,EACT,IAA4B,EAC5B,MAA8B,EAC9B,KAA6B,EAC7B,MAA8B;IAE9B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,sBAAsB,EAAE,CAAC;IAE7C,wBAAwB;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,6DAA6D;IAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAChC,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;IAC7B,CAAC;IAED,8CAA8C;IAC9C,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC7B,WAAW,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO,4BAA4B,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC;AAC/F,CAAC;AAED,SAAS,sBAAsB;IAC7B,OAAO,4BAA4B,CAAC;QAClC,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,MAAM,EAAE,IAAI,GAAG,EAAE;QACjB,WAAW,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;QAC/B,SAAS,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;QAC7B,UAAU,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC;KAC/B,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CAAC,OAAiC;IAC5E,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;IAExE,MAAM,KAAK,GAAsB;QAC/B,OAAO;QACP,MAAM;QACN,WAAW;QACX,SAAS;QACT,UAAU;QAEV,QAAQ,CAAC,QAAgB,EAAE,IAAuB;YAChD,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YAChC,MAAM,GAAG,GAAW,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBAChD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC1F,CAAC;YACH,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,UAAU,CAAC,QAAgB,EAAE,IAAuB;YAClD,OAAO,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3D,CAAC;QAED,WAAW,CAAC,QAAgB;YAC1B,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;KACF,CAAC;IACF,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAA0B,EAC1B,OAA0B;IAE1B,OAAO;QACL,OAAO;QACP,OAAO;QAEP,UAAU,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE;YAC3C,MAAM,CAAC,GAAG,SAAS,KAAK,SAAS;gBAC/B,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;gBACrC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACxC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAU,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QAED,eAAe,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE;YAC/C,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9C,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAU,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAC1D,CAAC;QAED,uBAAuB,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YAC9C,OAAO,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC;iBAC9B,MAAM,CAAC,CAAC,IAAU,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC;iBAChD,GAAG,CAAC,CAAC,IAAU,EAAE,EAAE,CAAC,CAAC;gBACpB,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,QAAQ,EAAE,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC;aAC9C,CAAC,CAAC,CAAC;QACR,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAAC,OAAiC;IAC5E,OAAO,0BAA0B,CAC/B,4BAA4B,CAAC,OAAO,CAAC,OAAO,CAAC,EAC7C,4BAA4B,CAAC,OAAO,CAAC,OAAO,CAAC,CAC9C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CAAC,KAAwB;IACjE,OAAO;QACL,OAAO,EAAE;YACP,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO;YAC9B,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;YAC5B,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,WAAW;YACtC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,SAAS;YAClC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU;SACrC;QACD,OAAO,EAAE;YACP,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO;YAC9B,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;YAC5B,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,WAAW;YACtC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,SAAS;YAClC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU;SACrC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAsB;IACtD,MAAM,KAAK,GAAqC;QAC9C,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,mCAAmC;QACxE,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,kBAAkB;QACjD,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,EAAE,2BAA2B;QACnE,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,qBAAqB;QACvD,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,EAAE,0BAA0B;QACjE,CAAC,gBAAgB,CAAC,wBAAwB,CAAC,EAAE,gCAAgC;QAC7E,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,EAAE,0BAA0B;QACjE,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,oBAAoB;QACrD,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE,oBAAoB;QACrD,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,EAAE,4BAA4B;QACrE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,wBAAwB;QAC7D,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,qBAAqB;QACvD,CAAC,gBAAgB,CAAC,cAAc,CAAC,EAAE,sBAAsB;QACzD,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,EAAE,wBAAwB;QAC7D,CAAC,gBAAgB,CAAC,4BAA4B,CAAC,EAAE,oCAAoC;KACtF,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;AAClC,CAAC"}

package/dist/string-table.d.ts

@@ -6,6 +6,14 @@ export declare class StringTable {
     private strings;
     private index;
     readonly NULL_INDEX = -1;
+    /**
+     * Reconstruct a StringTable from a flat array as produced by `getAll()`.
+     *
+     * Used by the parser-worker → main thread transport so a complete table
+     * round-trips without re-interning each string at every call site.
+     * The first slot must be the canonical empty string at index 0.
+     */
+    static fromArray(strings: string[]): StringTable;
     get count(): number;
     /**
      * Get string by index

package/dist/string-table.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"string-table.d.ts","sourceRoot":"","sources":["../src/string-table.ts"],"names":[],"mappings":"AAIA;;;GAGG;AAEH,qBAAa,WAAW;IACtB,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,KAAK,CAA2C;IAExD,QAAQ,CAAC,UAAU,MAAM;IAEzB,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAOxB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM;IAgBhD;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAI3B;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI9B;;OAEG;IACH,MAAM,IAAI,MAAM,EAAE;CAGnB"}
+{"version":3,"file":"string-table.d.ts","sourceRoot":"","sources":["../src/string-table.ts"],"names":[],"mappings":"AAIA;;;GAGG;AAEH,qBAAa,WAAW;IACtB,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,KAAK,CAA2C;IAExD,QAAQ,CAAC,UAAU,MAAM;IAEzB;;;;;;OAMG;IACH,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,WAAW;IAchD,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAOxB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM;IAgBhD;;OAEG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAI3B;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAI9B;;OAEG;IACH,MAAM,IAAI,MAAM,EAAE;CAGnB"}

package/dist/string-table.js

@@ -9,6 +9,26 @@ export class StringTable {
     strings = [''];
     index = new Map([['', 0]]);
     NULL_INDEX = -1;
+    /**
+     * Reconstruct a StringTable from a flat array as produced by `getAll()`.
+     *
+     * Used by the parser-worker → main thread transport so a complete table
+     * round-trips without re-interning each string at every call site.
+     * The first slot must be the canonical empty string at index 0.
+     */
+    static fromArray(strings) {
+        const table = new StringTable();
+        table.strings = strings.length > 0 && strings[0] === '' ? strings.slice() : ['', ...strings];
+        table.index = new Map();
+        for (let i = 0; i < table.strings.length; i++) {
+            // First occurrence wins so duplicate inputs (rare but possible
+            // after manual concatenation) don't shadow the canonical index.
+            if (!table.index.has(table.strings[i])) {
+                table.index.set(table.strings[i], i);
+            }
+        }
+        return table;
+    }
     get count() {
         return this.strings.length;
     }

package/dist/string-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"string-table.js","sourceRoot":"","sources":["../src/string-table.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;GAGG;AAEH,MAAM,OAAO,WAAW;IACd,OAAO,GAAa,CAAC,EAAE,CAAC,CAAC;IACzB,KAAK,GAAwB,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,UAAU,GAAG,CAAC,CAAC,CAAC;IAEzB,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAW;QACb,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAgC;QACrC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC1C,OAAO,IAAI,CAAC,UAAU,CAAC;QACzB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;CACF"}
+{"version":3,"file":"string-table.js","sourceRoot":"","sources":["../src/string-table.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;GAGG;AAEH,MAAM,OAAO,WAAW;IACd,OAAO,GAAa,CAAC,EAAE,CAAC,CAAC;IACzB,KAAK,GAAwB,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,UAAU,GAAG,CAAC,CAAC,CAAC;IAEzB;;;;;;OAMG;IACH,MAAM,CAAC,SAAS,CAAC,OAAiB;QAChC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,CAAC;QAC7F,KAAK,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,+DAA+D;YAC/D,gEAAgE;YAChE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAW;QACb,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAgC;QACrC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC1C,OAAO,IAAI,CAAC,UAAU,CAAC;QACzB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;CACF"}

package/dist/utf8-decode.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Returns true when `TextDecoder.decode()` accepts a SAB-backed view in
+ * this realm. Cached after first call.
+ *
+ * Exported so call sites can short-circuit explicit copies (e.g. when
+ * they already know the view is SAB-backed and want to allocate a single
+ * scratch buffer for a whole batch).
+ */
+export declare function textDecoderAcceptsSab(): boolean;
+/**
+ * Reset the detection cache. Tests only — production callers should never
+ * need to invalidate the result because the answer is fixed for the
+ * lifetime of the realm.
+ */
+export declare function __resetSabDecodeCache(): void;
+/**
+ * Decode a UTF-8 byte range from `view` into a string. Safe to call on
+ * `SharedArrayBuffer`-backed views in any realm.
+ *
+ * The optional `start`/`end` parameters mirror `Uint8Array.subarray`.
+ * Calling without them decodes the entire view.
+ */
+export declare function safeUtf8Decode(view: Uint8Array, start?: number, end?: number): string;
+//# sourceMappingURL=utf8-decode.d.ts.map

package/dist/utf8-decode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8-decode.d.ts","sourceRoot":"","sources":["../src/utf8-decode.ts"],"names":[],"mappings":"AAmCA;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,IAAI,OAAO,CAa/C;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,IAAI,IAAI,CAE5C;AAiBD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAkBrF"}

package/dist/utf8-decode.js

@@ -0,0 +1,103 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+/**
+ * SAB-safe wrapper around `TextDecoder.decode()`.
+ *
+ * Both Firefox and Chromium reject `TextDecoder.decode(view)` when `view`
+ * is backed by a `SharedArrayBuffer` (Spectre timing-attack mitigation).
+ * The parser intentionally hands the source bytes around as a SAB so the
+ * parser worker, geometry workers, and main-thread on-demand extractors
+ * all read the same memory zero-copy — which means every decode of a
+ * subarray of the source needs to be SAB-aware.
+ *
+ * Strategy:
+ *   1. Detect the runtime's SAB-decode policy lazily, once. The result is
+ *      stable for the lifetime of the realm.
+ *   2. When the runtime accepts SAB views, decode straight off the source
+ *      (zero-copy, ~10 ns per call).
+ *   3. When it rejects, copy the requested subarray into a thread-local
+ *      scratch `Uint8Array` first, then decode. The scratch buffer grows
+ *      to the largest seen subarray and is reused, so the GC pressure is
+ *      bounded even for million-entity files.
+ *
+ * Performance: the typical IFC entity decode is 50–500 bytes, so the copy
+ * path is microseconds per call. The hot batch decode path
+ * (`columnar-parser-attributes.ts`) already routes through scratch
+ * buffers, so only the per-entity attribute reads + schema detection +
+ * tokenizer fallback go through this helper.
+ */
+const sharedDecoder = new TextDecoder();
+let acceptsSabCache = null;
+/**
+ * Returns true when `TextDecoder.decode()` accepts a SAB-backed view in
+ * this realm. Cached after first call.
+ *
+ * Exported so call sites can short-circuit explicit copies (e.g. when
+ * they already know the view is SAB-backed and want to allocate a single
+ * scratch buffer for a whole batch).
+ */
+export function textDecoderAcceptsSab() {
+    if (acceptsSabCache !== null)
+        return acceptsSabCache;
+    if (typeof SharedArrayBuffer === 'undefined') {
+        acceptsSabCache = true; // No SAB exists, so the question is moot.
+        return true;
+    }
+    try {
+        sharedDecoder.decode(new Uint8Array(new SharedArrayBuffer(8)));
+        acceptsSabCache = true;
+    }
+    catch {
+        acceptsSabCache = false;
+    }
+    return acceptsSabCache;
+}
+/**
+ * Reset the detection cache. Tests only — production callers should never
+ * need to invalidate the result because the answer is fixed for the
+ * lifetime of the realm.
+ */
+export function __resetSabDecodeCache() {
+    acceptsSabCache = null;
+}
+let scratchBuffer = null;
+/**
+ * Ensure the realm-local scratch buffer can hold `byteLength` bytes,
+ * doubling on growth to amortise reallocation cost.
+ */
+function ensureScratch(byteLength) {
+    if (scratchBuffer === null || scratchBuffer.length < byteLength) {
+        let cap = scratchBuffer?.length ?? 4096;
+        while (cap < byteLength)
+            cap *= 2;
+        scratchBuffer = new Uint8Array(cap);
+    }
+    return scratchBuffer;
+}
+/**
+ * Decode a UTF-8 byte range from `view` into a string. Safe to call on
+ * `SharedArrayBuffer`-backed views in any realm.
+ *
+ * The optional `start`/`end` parameters mirror `Uint8Array.subarray`.
+ * Calling without them decodes the entire view.
+ */
+export function safeUtf8Decode(view, start, end) {
+    const sub = (start === undefined && end === undefined)
+        ? view
+        : view.subarray(start ?? 0, end ?? view.length);
+    if (textDecoderAcceptsSab()) {
+        return sharedDecoder.decode(sub);
+    }
+    // SAB rejected — copy into scratch. `Uint8Array.set` accepts SAB-backed
+    // sources without restriction (the Spectre mitigation only fires inside
+    // string-producing APIs like TextDecoder), so this gives us an
+    // ArrayBuffer-backed view with the same bytes.
+    const len = sub.length;
+    if (len === 0)
+        return '';
+    const scratch = ensureScratch(len);
+    scratch.set(sub);
+    return sharedDecoder.decode(scratch.subarray(0, len));
+}
+//# sourceMappingURL=utf8-decode.js.map

package/dist/utf8-decode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8-decode.js","sourceRoot":"","sources":["../src/utf8-decode.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,MAAM,aAAa,GAAG,IAAI,WAAW,EAAE,CAAC;AAExC,IAAI,eAAe,GAAmB,IAAI,CAAC;AAE3C;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB;IACnC,IAAI,eAAe,KAAK,IAAI;QAAE,OAAO,eAAe,CAAC;IACrD,IAAI,OAAO,iBAAiB,KAAK,WAAW,EAAE,CAAC;QAC7C,eAAe,GAAG,IAAI,CAAC,CAAC,0CAA0C;QAClE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC;QACH,aAAa,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,eAAe,GAAG,IAAI,CAAC;IACzB,CAAC;IAAC,MAAM,CAAC;QACP,eAAe,GAAG,KAAK,CAAC;IAC1B,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB;IACnC,eAAe,GAAG,IAAI,CAAC;AACzB,CAAC;AAED,IAAI,aAAa,GAAsB,IAAI,CAAC;AAE5C;;;GAGG;AACH,SAAS,aAAa,CAAC,UAAkB;IACvC,IAAI,aAAa,KAAK,IAAI,IAAI,aAAa,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;QAChE,IAAI,GAAG,GAAG,aAAa,EAAE,MAAM,IAAI,IAAI,CAAC;QACxC,OAAO,GAAG,GAAG,UAAU;YAAE,GAAG,IAAI,CAAC,CAAC;QAClC,aAAa,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,IAAgB,EAAE,KAAc,EAAE,GAAY;IAC3E,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,CAAC;QACpD,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;IAElD,IAAI,qBAAqB,EAAE,EAAE,CAAC;QAC5B,OAAO,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,wEAAwE;IACxE,wEAAwE;IACxE,+DAA+D;IAC/D,+CAA+C;IAC/C,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;IACvB,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,OAAO,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AACxD,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ifc-lite/data",
-  "version": "1.15.1",
+  "version": "1.17.0",
   "description": "Columnar data structures for IFC-Lite",
   "type": "module",
   "main": "./dist/index.js",
@@ -43,6 +43,7 @@
     "dev": "pnpm exec tsc --watch",
     "test": "vitest run",
     "generate:epsg-index": "tsx ../../scripts/generate-epsg-index.ts",
-    "augment:epsg-proj4": "tsx ../../scripts/augment-epsg-proj4.ts"
+    "augment:epsg-proj4": "tsx ../../scripts/augment-epsg-proj4.ts",
+    "generate:ifc-schema": "tsx scripts/generate-ifc-schema.ts"
   }
 }