@ifc-lite/parser 5.2.0 → 6.1.0

package/dist/spatial-hierarchy-canonical-parent.js

@@ -1,7 +1,51 @@
 /* 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/. */
-import { IfcTypeEnum, RelationshipType, isSpatialStructureType } from '@ifc-lite/data';
+import { IfcTypeEnum, RelationshipType, createLogger, isSpatialStructureType } from '@ifc-lite/data';
+const log = createLogger('SpatialHierarchy');
+/**
+ * Is `candidateParent` reachable from `childId` by walking forward
+ * `IfcRelAggregates` edges (i.e. is `childId` an ANCESTOR of `candidateParent`
+ * in the raw, unresolved aggregation graph)? Used only to disqualify a tied
+ * candidate parent that would close a cycle back through the child itself -
+ * see the doc comment on `computeCanonicalParent` for why that specific shape
+ * needs a check at all. Bounded to `childId`'s own (raw) aggregation
+ * subtree, so it only costs anything on an already-malformed file where a
+ * child has more than one candidate Aggregates parent - the common case
+ * (one candidate) never calls this.
+ */
+/**
+ * Upper bound on aggregate-graph node visits spent on back-edge cycle checks
+ * for one file. The check only runs for children named by MORE THAN ONE
+ * IfcRelAggregates (already malformed), and costs one descendant walk per
+ * such child - O(V+E) each - so a crafted file with thousands of contested
+ * children could otherwise burn O(C·(V+E)). Past the budget the resolver
+ * falls back to plain first-declared-wins (the pre-#4285 behaviour) and says
+ * so once, instead of stalling the parse.
+ */
+export const CYCLE_CHECK_VISIT_BUDGET = 2_000_000;
+/**
+ * Aggregated descendants of `childId` (transitive, forward `Aggregates`),
+ * charged against `budget`. Returns null when the budget ran out mid-walk
+ * (the partial set must not be used - a missing descendant reads as "no
+ * cycle", which is the wrong side to err on).
+ */
+function aggregatedDescendants(childId, relationships, budget) {
+    const visited = new Set([childId]);
+    const stack = [childId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        for (const kid of relationships.getRelated(current, RelationshipType.Aggregates, 'forward')) {
+            if (--budget.visits < 0)
+                return null;
+            if (!visited.has(kid)) {
+                visited.add(kid);
+                stack.push(kid);
+            }
+        }
+    }
+    return visited;
+}
 /**
  * Resolve each spatial-structure entity's ONE canonical parent, globally,
  * before any recursion starts - so the result cannot depend on traversal
@@ -20,7 +64,19 @@ import { IfcTypeEnum, RelationshipType, isSpatialStructureType } from '@ifc-lite
  *     sort is stable per key (`relationship-graph.ts`) - it scatters edges
  *     for the same child in the order they were appended, never
  *     reordering by id. So `edges[0]` for a given child is the
- *     first-declared parent edge; no id comparison is needed or correct.
+ *     first-declared parent edge; no id comparison is needed or correct -
+ *     EXCEPT that a candidate closing a cycle back through the child is
+ *     skipped first (see `aggregatedDescendants`, #4246): a mutual or
+ *     longer aggregation back-edge cannot win a tie against a candidate that
+ *     doesn't orphan the child's own subtree from itself. Each time that
+ *     happens, a warning is logged (always-visible, like the existing
+ *     "No storeys/buildings found" warnings below) naming the child and the
+ *     disqualified candidate - the only signal a caller gets that a
+ *     malformed back-edge was found and repaired, short of building a
+ *     dedicated report (out of scope here; see the #4208 semantic drop
+ *     census for that shape of reporting - a different layer: per-STEP-class
+ *     scan/retain counts collected during columnar categorization, not a
+ *     graph-repair event like this one).
  *  2. Only when a child has NO aggregates edge at all does a containment edge
  *     (IfcRelContainedInSpatialStructure targeting a spatial-structure type -
  *     the Revit Family/Dynamo `IfcSpace`/`IfcSpatialZone` pattern, #1075)
@@ -31,8 +87,11 @@ import { IfcTypeEnum, RelationshipType, isSpatialStructureType } from '@ifc-lite
  * names the child drops the edge instead of adding an empty-stub duplicate
  * (#4095).
  */
-export function computeCanonicalParent(entities, relationships) {
+export function computeCanonicalParent(entities, relationships, options = {}) {
     const canonicalParent = new Map();
+    const visitBudget = options.cycleCheckVisitBudget ?? CYCLE_CHECK_VISIT_BUDGET;
+    const cycleBudget = { visits: visitBudget };
+    let cycleBudgetExhausted = false;
     const claimFirstDeclaredParent = (predicate, relType) => {
         for (const childId of relationships.inverse.offsets.keys()) {
             if (canonicalParent.has(childId) || !predicate(childId))
@@ -45,7 +104,60 @@ export function computeCanonicalParent(entities, relationships) {
             // order here. This mirrors apps/server's `canonical_parent`
             // (`spatial.rs`), which does `entry(...).or_insert(...)` while
             // iterating relationships in file-scan order: first occurrence wins.
-            const winner = edges[0];
+            let winner = edges[0];
+            if (relType === RelationshipType.Aggregates && edges.length > 1) {
+                // A child named as the target of more than one IfcRelAggregates is
+                // already a malformed file, but one shape needs a special rule: a
+                // BACK-EDGE, where a candidate parent P is itself a (possibly
+                // indirect) AGGREGATED DESCENDANT of this very child - i.e. taking P
+                // as childId's parent would close a cycle back through childId. That
+                // is the STEP-authoring-tool mistake of declaring an aggregation
+                // pair in both directions (#4246, the direct 2-node case; the same
+                // shape generalizes to a longer A->B->C->A chain). If the back-edge
+                // is declared before the real parent edge, plain first-declared-wins
+                // picks P as childId's canonical parent; P's own resolution (walking
+                // the SAME cycle) then independently lands back on a node inside the
+                // cycle too, so the whole cycle points at itself and none of it is
+                // reachable from IfcProject - orphaning whatever real subtree hung
+                // off any node in the cycle.
+                //
+                // Skip any candidate edge that closes a cycle through childId and
+                // take the first REMAINING candidate, still by declaration order -
+                // this changes nothing when a child has only one candidate (the
+                // overwhelmingly common case) or when none of its candidates close a
+                // cycle (the genuine multiple-real-parents case, #4095, which this
+                // loop never even sees more than one Aggregates edge for - #4095's
+                // contested child has exactly one Aggregates edge naming it; its
+                // OTHER "parent" only contains it). If EVERY candidate closes a
+                // cycle (a more degenerate file than anything observed), fall
+                // through to plain first-declared so the child is never left
+                // without a parent.
+                //
+                // One descendant walk per contested child (not per candidate), under a
+                // file-wide visit budget - see CYCLE_CHECK_VISIT_BUDGET.
+                const descendants = cycleBudgetExhausted ? null : aggregatedDescendants(childId, relationships, cycleBudget);
+                if (descendants === null) {
+                    if (!cycleBudgetExhausted) {
+                        cycleBudgetExhausted = true;
+                        log.warn(`Aggregation back-edge cycle checks stopped after ${visitBudget} graph visits; ` +
+                            'remaining multi-parent children resolve to their first-declared IfcRelAggregates edge');
+                    }
+                }
+                else {
+                    const rejected = [];
+                    const nonCyclic = edges.find((edge) => {
+                        const cyclic = descendants.has(edge.target);
+                        if (cyclic)
+                            rejected.push(edge.target);
+                        return !cyclic;
+                    });
+                    if (nonCyclic && nonCyclic !== winner) {
+                        log.warn(`Ignored ${rejected.length} aggregation back-edge cycle(s): #${childId} kept parent #${nonCyclic.target}, ` +
+                            `not ${rejected.map((id) => `#${id}`).join(', ')} (each would have closed a cycle back through #${childId})`);
+                        winner = nonCyclic;
+                    }
+                }
+            }
             // Inverse edges flip source/target, so `target` here is the original
             // relationship's `relating_id` (the parent).
             canonicalParent.set(childId, winner.target);
@@ -60,4 +172,41 @@ export function computeCanonicalParent(entities, relationships) {
     }, RelationshipType.ContainsElements);
     return canonicalParent;
 }
+/**
+ * Which spatial-structure nodes will `SpatialHierarchyBuilder.buildNode`
+ * actually visit, starting from `projectId`? Mirrors `addSpatialChild`
+ * exactly: a node is visited iff it is `projectId` itself, or its
+ * `canonicalParent` entry points to an already-visited node - the same
+ * check `addSpatialChild` makes before recursing (`canonicalParent.get
+ * (childId) === expressId`). Computed as one forward walk over
+ * `canonicalParent` (childId -> parentId) up front, so a storey's
+ * reachability never depends on where in the traversal it happens to sit
+ * (#4310): a node named only by an unreachable storey - one with no path
+ * back to `projectId`, e.g. a malformed file where a storey has no
+ * `IfcRelAggregates` edge at all - is never in this set, exactly as
+ * `buildNode` would never recurse into it.
+ */
+export function computeReachableSpatialNodes(projectId, canonicalParent) {
+    const childrenOf = new Map();
+    for (const [childId, parentId] of canonicalParent) {
+        let siblings = childrenOf.get(parentId);
+        if (!siblings) {
+            siblings = [];
+            childrenOf.set(parentId, siblings);
+        }
+        siblings.push(childId);
+    }
+    const reachable = new Set([projectId]);
+    const stack = [projectId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        for (const childId of childrenOf.get(current) ?? []) {
+            if (reachable.has(childId))
+                continue; // also guards a canonicalParent cycle from looping forever
+            reachable.add(childId);
+            stack.push(childId);
+        }
+    }
+    return reachable;
+}
 //# sourceMappingURL=spatial-hierarchy-canonical-parent.js.map

package/dist/spatial-hierarchy-canonical-parent.js.map

@@ -1 +1 @@
-{"version":3,"file":"spatial-hierarchy-canonical-parent.js","sourceRoot":"","sources":["../src/spatial-hierarchy-canonical-parent.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAQ/D,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAEvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAAqB,EAAE,aAAgC;IAC5F,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD,MAAM,wBAAwB,GAAG,CAC/B,SAAuC,EACvC,OAAyB,EACnB,EAAE;QACR,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3D,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;gBAAE,SAAS;YAClE,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACjC,sEAAsE;YACtE,kEAAkE;YAClE,4DAA4D;YAC5D,+DAA+D;YAC/D,qEAAqE;YACrE,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,qEAAqE;YACrE,6CAA6C;YAC7C,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC;IAEF,yDAAyD;IACzD,wBAAwB,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAClE,kFAAkF;IAClF,wBAAwB,CACtB,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAChD,OAAO,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,CAAC;IACnF,CAAC,EACD,gBAAgB,CAAC,gBAAgB,CAClC,CAAC;IAEF,OAAO,eAAe,CAAC;AACzB,CAAC"}
+{"version":3,"file":"spatial-hierarchy-canonical-parent.js","sourceRoot":"","sources":["../src/spatial-hierarchy-canonical-parent.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAQ/D,OAAO,EAAE,WAAW,EAAE,gBAAgB,EAAE,YAAY,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AAErG,MAAM,GAAG,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC;AAE7C;;;;;;;;;;GAUG;AACH;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,SAAS,CAAC;AAElD;;;;;GAKG;AACH,SAAS,qBAAqB,CAC5B,OAAe,EACf,aAAgC,EAChC,MAA0B;IAE1B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,CAAC,OAAO,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5F,IAAI,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAAqB,EACrB,aAAgC,EAChC,UAA8C,EAAE;IAEhD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,MAAM,WAAW,GAAG,OAAO,CAAC,qBAAqB,IAAI,wBAAwB,CAAC;IAC9E,MAAM,WAAW,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC5C,IAAI,oBAAoB,GAAG,KAAK,CAAC;IAEjC,MAAM,wBAAwB,GAAG,CAC/B,SAAuC,EACvC,OAAyB,EACnB,EAAE;QACR,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3D,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;gBAAE,SAAS;YAClE,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACjC,sEAAsE;YACtE,kEAAkE;YAClE,4DAA4D;YAC5D,+DAA+D;YAC/D,qEAAqE;YACrE,IAAI,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,OAAO,KAAK,gBAAgB,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChE,mEAAmE;gBACnE,kEAAkE;gBAClE,8DAA8D;gBAC9D,qEAAqE;gBACrE,qEAAqE;gBACrE,iEAAiE;gBACjE,mEAAmE;gBACnE,oEAAoE;gBACpE,qEAAqE;gBACrE,qEAAqE;gBACrE,qEAAqE;gBACrE,mEAAmE;gBACnE,mEAAmE;gBACnE,6BAA6B;gBAC7B,EAAE;gBACF,kEAAkE;gBAClE,mEAAmE;gBACnE,gEAAgE;gBAChE,qEAAqE;gBACrE,mEAAmE;gBACnE,mEAAmE;gBACnE,iEAAiE;gBACjE,gEAAgE;gBAChE,8DAA8D;gBAC9D,6DAA6D;gBAC7D,oBAAoB;gBACpB,EAAE;gBACF,uEAAuE;gBACvE,yDAAyD;gBACzD,MAAM,WAAW,GAAG,oBAAoB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,qBAAqB,CAAC,OAAO,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;gBAC7G,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;oBACzB,IAAI,CAAC,oBAAoB,EAAE,CAAC;wBAC1B,oBAAoB,GAAG,IAAI,CAAC;wBAC5B,GAAG,CAAC,IAAI,CACN,oDAAoD,WAAW,iBAAiB;4BAC9E,uFAAuF,CAC1F,CAAC;oBACJ,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,QAAQ,GAAa,EAAE,CAAC;oBAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;wBACpC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5C,IAAI,MAAM;4BAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBACvC,OAAO,CAAC,MAAM,CAAC;oBACjB,CAAC,CAAC,CAAC;oBACH,IAAI,SAAS,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;wBACtC,GAAG,CAAC,IAAI,CACN,WAAW,QAAQ,CAAC,MAAM,qCAAqC,OAAO,iBAAiB,SAAS,CAAC,MAAM,IAAI;4BACzG,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kDAAkD,OAAO,GAAG,CAC/G,CAAC;wBACF,MAAM,GAAG,SAAS,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,qEAAqE;YACrE,6CAA6C;YAC7C,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC;IAEF,yDAAyD;IACzD,wBAAwB,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,gBAAgB,CAAC,UAAU,CAAC,CAAC;IAClE,kFAAkF;IAClF,wBAAwB,CACtB,CAAC,OAAO,EAAE,EAAE;QACV,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAChD,OAAO,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,CAAC;IACnF,CAAC,EACD,gBAAgB,CAAC,gBAAgB,CAClC,CAAC;IAEF,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,4BAA4B,CAC1C,SAAiB,EACjB,eAAoC;IAEpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,eAAe,EAAE,CAAC;QAClD,IAAI,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,QAAQ,GAAG,EAAE,CAAC;YACd,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;QACtC,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS,CAAC,2DAA2D;YACjG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/step-lexing.d.ts

@@ -8,9 +8,9 @@ export interface Skip {
 }
 export declare function skipLexical(buf: Uint8Array, pos: number, len: number): Skip;
 export declare function opensLiteralOrComment(buf: Uint8Array, pos: number, len: number): boolean;
+export declare function isSpaceByte(b: number): boolean;
 export declare function skipTrivia(buf: Uint8Array, pos: number, len: number): Skip;
 export declare function countNewlines(buf: Uint8Array, from: number, to: number): number;
-export declare function findEntityLength(buf: Uint8Array, pos: number, startOffset: number): number;
 /**
  * A scan of one decoded string.
  *

package/dist/step-lexing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"step-lexing.d.ts","sourceRoot":"","sources":["../src/step-lexing.ts"],"names":[],"mappings":"AA2BA,wBAAgB,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAE/E;AA0BD,wBAAgB,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAO7E;AAaD,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAanF;AAED,MAAM,WAAW,IAAI;IAEnB,IAAI,EAAE,MAAM,CAAC;IAEb,KAAK,EAAE,MAAM,CAAC;IAKd,IAAI,EAAE,OAAO,CAAC;CACf;AAKD,wBAAgB,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAa3E;AAGD,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAExF;AAuCD,wBAAgB,UAAU,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAkB1E;AAGD,wBAAgB,aAAa,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAM/E;AAkBD,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAgC1F;AAmBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,qBAAa,YAAY;IASX,OAAO,CAAC,QAAQ,CAAC,IAAI;IARjC,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,QAAQ,CAAS;IAEzB,iFAAiF;IACjF,IAAI,QAAQ,IAAI,MAAM,CAErB;gBAE4B,IAAI,EAAE,MAAM;IAEzC;;;;;;;;OAQG;IACH,OAAO,CAAC,aAAa;IAarB;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAahC;;;;;;;;OAQG;IACH,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CAS9B;AAOD;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAOlF"}
+{"version":3,"file":"step-lexing.d.ts","sourceRoot":"","sources":["../src/step-lexing.ts"],"names":[],"mappings":"AAyBA,wBAAgB,YAAY,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAE/E;AA0BD,wBAAgB,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAO7E;AAaD,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAanF;AAED,MAAM,WAAW,IAAI;IAEnB,IAAI,EAAE,MAAM,CAAC;IAEb,KAAK,EAAE,MAAM,CAAC;IAKd,IAAI,EAAE,OAAO,CAAC;CACf;AAKD,wBAAgB,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAa3E;AAGD,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAExF;AAeD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAI9C;AAoBD,wBAAgB,UAAU,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAkB1E;AAGD,wBAAgB,aAAa,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAM/E;AAmBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,qBAAa,YAAY;IASX,OAAO,CAAC,QAAQ,CAAC,IAAI;IARjC,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,QAAQ,CAAS;IAEzB,iFAAiF;IACjF,IAAI,QAAQ,IAAI,MAAM,CAErB;gBAE4B,IAAI,EAAE,MAAM;IAEzC;;;;;;;;OAQG;IACH,OAAO,CAAC,aAAa;IAarB;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAahC;;;;;;;;OAQG;IACH,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;CAS9B;AAOD;;;;;;;;;;;;GAYG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAOlF"}

package/dist/step-lexing.js

@@ -19,8 +19,6 @@ const SLASH = 0x2f; // '/'
 const STAR = 0x2a; // '*'
 const NEWLINE = 0x0a; // '\n'
 const QUOTE = 0x27; // '\''
-const LPAREN = 0x28; // '('
-const RPAREN = 0x29; // ')'
 // Whether a comment opens at `pos`.
 export function opensComment(buf, pos, len) {
     return buf[pos] === SLASH && pos + 1 < len && buf[pos + 1] === STAR;
@@ -117,7 +115,7 @@ export function opensLiteralOrComment(buf, pos, len) {
 // definition and excludes vertical tab, so reaching for it on either side
 // reintroduces the exact FF/VT divergence issue #3733 reported (dropped
 // entity on a leading form feed) rather than closing it.
-function isSpaceByte(b) {
+export function isSpaceByte(b) {
     return (b === 0x20 || b === 0x09 || b === 0x0d || b === NEWLINE || b === 0x0c || b === 0x0b);
 }
 // Skip STEP trivia from `pos`: whitespace, comments, and any run of the two.
@@ -166,59 +164,6 @@ export function countNewlines(buf, from, to) {
     }
     return n;
 }
-// Byte length of the record that starts at `startOffset` and whose argument
-// list opens at `pos`: the span up to and including the ')' balancing that '(',
-// or 0 when the input runs out first.
-//
-// A string literal is jumped over by skipStringLiteral above rather than
-// counted, so the '(' in 'Storey (Level 1)' is text and not depth, and STEP's
-// doubled-quote escape ('') stays inside the literal instead of closing it.
-// Sharing that helper is what keeps the escape rule in one place: an
-// open-coded `inString` flag here would be a second copy of it, free to drift
-// from the one every other scanner in this file uses.
-//
-// A comment is jumped over for the same reason, in the same order: the literal
-// test comes first, so a '/*' inside a value is text; the comment is then taken
-// whole, so a '(' or a quote inside it is text. Without that, the comment in
-// `#1=IFCWALL('a', /* see IFCWALL( */ $);` opened a paren depth that never
-// closed and the record came back with length 0.
-export function findEntityLength(buf, pos, startOffset) {
-    const len = buf.length;
-    let depth = 0;
-    while (pos < len) {
-        const char = buf[pos];
-        if (char === QUOTE) {
-            // Returns `-1` on an unterminated literal (see skipStringLiteral's own
-            // doc): no balancing ')' can follow, same 0 as running off the end.
-            const next = skipStringLiteral(buf, pos, len);
-            if (next < 0)
-                return 0;
-            pos = next;
-        }
-        else if (opensComment(buf, pos, len)) {
-            const end = skipComment(buf, pos, len);
-            // Unterminated: the rest of the input is inside the comment, so no
-            // balancing ')' can follow. Same 0 as running off the end.
-            if (end < 0)
-                return 0;
-            pos = end;
-        }
-        else if (char === LPAREN) {
-            depth++;
-            pos++;
-        }
-        else if (char === RPAREN) {
-            depth--;
-            pos++;
-            if (depth === 0)
-                return pos - startOffset;
-        }
-        else {
-            pos++;
-        }
-    }
-    return 0; // no matching ')'
-}
 // ---------------------------------------------------------------------------
 // The same rule over a decoded string.
 //

package/dist/step-lexing.js.map

@@ -1 +1 @@
-{"version":3,"file":"step-lexing.js","sourceRoot":"","sources":["../src/step-lexing.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,gDAAgD;AAChD,EAAE;AACF,uEAAuE;AACvE,gFAAgF;AAChF,gFAAgF;AAChF,+EAA+E;AAC/E,qDAAqD;AACrD,EAAE;AACF,8EAA8E;AAC9E,gFAAgF;AAChF,oEAAoE;AAEpE,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM;AAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,MAAM;AACzB,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,OAAO;AAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO;AAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;AAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;AAE3B,oCAAoC;AACpC,MAAM,UAAU,YAAY,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACpE,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC;AACtE,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,EAAE;AACF,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,4EAA4E;AAC5E,gEAAgE;AAChE,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,uCAAuC;AACvC,EAAE;AACF,yEAAyE;AACzE,+EAA+E;AAC/E,sEAAsE;AACtE,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,0EAA0E;AAC1E,MAAM,UAAU,WAAW,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACnE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACnB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,0EAA0E;AAC1E,kCAAkC;AAClC,EAAE;AACF,4EAA4E;AAC5E,gFAAgF;AAChF,8EAA8E;AAC9E,gFAAgF;AAChF,gFAAgF;AAChF,uDAAuD;AACvD,MAAM,UAAU,iBAAiB,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACzE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACxC,CAAC,IAAI,CAAC,CAAC;gBACP,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAcD,qEAAqE;AACrE,+EAA+E;AAC/E,+EAA+E;AAC/E,MAAM,UAAU,WAAW,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACnE,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACxE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IAC7E,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAChF,+EAA+E;AAC/E,2BAA2B;AAC3B,EAAE;AACF,0EAA0E;AAC1E,8EAA8E;AAC9E,wEAAwE;AACxE,4EAA4E;AAC5E,sEAAsE;AACtE,wEAAwE;AACxE,0EAA0E;AAC1E,wEAAwE;AACxE,yDAAyD;AACzD,SAAS,WAAW,CAAC,CAAS;IAC5B,OAAO,CACL,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,CACpF,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,6EAA6E;AAC7E,+EAA+E;AAC/E,0EAA0E;AAC1E,8EAA8E;AAC9E,oCAAoC;AACpC,EAAE;AACF,6EAA6E;AAC7E,8EAA8E;AAC9E,gFAAgF;AAChF,EAAE;AACF,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,qBAAqB;AACrB,MAAM,UAAU,UAAU,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IAClE,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,CAAC;QACR,OAAO,CAAC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO;gBAAE,KAAK,EAAE,CAAC;YAChC,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAEvE,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAC9E,CAAC;QACD,KAAK,IAAI,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC,GAAG,GAAG,CAAC;IACV,CAAC;AACH,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,aAAa,CAAC,GAAe,EAAE,IAAY,EAAE,EAAU;IACrE,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,CAAC,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,4EAA4E;AAC5E,gFAAgF;AAChF,sCAAsC;AACtC,EAAE;AACF,yEAAyE;AACzE,8EAA8E;AAC9E,4EAA4E;AAC5E,qEAAqE;AACrE,8EAA8E;AAC9E,sDAAsD;AACtD,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,6EAA6E;AAC7E,2EAA2E;AAC3E,iDAAiD;AACjD,MAAM,UAAU,gBAAgB,CAAC,GAAe,EAAE,GAAW,EAAE,WAAmB;IAChF,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,GAAG,GAAG,GAAG,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAEtB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACnB,uEAAuE;YACvE,oEAAoE;YACpE,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9C,IAAI,IAAI,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACvB,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;aAAM,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvC,mEAAmE;YACnE,2DAA2D;YAC3D,IAAI,GAAG,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC;QACZ,CAAC;aAAM,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,KAAK,EAAE,CAAC;YACR,GAAG,EAAE,CAAC;QACR,CAAC;aAAM,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,KAAK,EAAE,CAAC;YACR,GAAG,EAAE,CAAC;YACN,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,GAAG,GAAG,WAAW,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,GAAG,EAAE,CAAC;QACR,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAC,kBAAkB;AAC9B,CAAC;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,EAAE;AACF,gFAAgF;AAChF,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,gDAAgD;AAChD,EAAE;AACF,8EAA8E;AAC9E,2EAA2E;AAC3E,+EAA+E;AAC/E,+EAA+E;AAC/E,+EAA+E;AAC/E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,OAAO,YAAY;IASM;IARrB,WAAW,GAAG,CAAC,CAAC;IAChB,QAAQ,GAAG,KAAK,CAAC;IAEzB,iFAAiF;IACjF,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,YAA6B,IAAY;QAAZ,SAAI,GAAJ,IAAI,CAAQ;IAAG,CAAC;IAE7C;;;;;;;;OAQG;IACK,aAAa,CAAC,CAAS;QAC7B,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,CAAC,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,CAAC,CAAS;QACrB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;oBAAE,SAAS;gBAC9B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;oBAAC,CAAC,EAAE,CAAC;oBAAC,SAAS;gBAAC,CAAC,CAAC,wCAAwC;gBACpF,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU,CAAC,CAAS;QAClB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,SAAS,CAAC;YACR,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,IAAI,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACvB,CAAC,GAAG,IAAI,CAAC;QACX,CAAC;IACH,CAAC;CACF;AAED,wEAAwE;AACxE,SAAS,YAAY,CAAC,EAAsB;IAC1C,OAAO,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC;AAC/F,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,CAAS,EAAE,OAAe;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,yCAAyC;QACzE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG;YAAE,CAAC,IAAI,EAAE,CAAC;QACjC,IAAI,CAAC,KAAK,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}
+{"version":3,"file":"step-lexing.js","sourceRoot":"","sources":["../src/step-lexing.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,gDAAgD;AAChD,EAAE;AACF,uEAAuE;AACvE,gFAAgF;AAChF,gFAAgF;AAChF,+EAA+E;AAC/E,qDAAqD;AACrD,EAAE;AACF,8EAA8E;AAC9E,gFAAgF;AAChF,oEAAoE;AAEpE,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM;AAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,MAAM;AACzB,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,OAAO;AAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO;AAE3B,oCAAoC;AACpC,MAAM,UAAU,YAAY,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACpE,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC;AACtE,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,EAAE;AACF,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,4EAA4E;AAC5E,gEAAgE;AAChE,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,uCAAuC;AACvC,EAAE;AACF,yEAAyE;AACzE,+EAA+E;AAC/E,sEAAsE;AACtE,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,0EAA0E;AAC1E,MAAM,UAAU,WAAW,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACnE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACnB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QAC1D,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,2EAA2E;AAC3E,2EAA2E;AAC3E,0EAA0E;AAC1E,kCAAkC;AAClC,EAAE;AACF,4EAA4E;AAC5E,gFAAgF;AAChF,8EAA8E;AAC9E,gFAAgF;AAChF,gFAAgF;AAChF,uDAAuD;AACvD,MAAM,UAAU,iBAAiB,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACzE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACxC,CAAC,IAAI,CAAC,CAAC;gBACP,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAcD,qEAAqE;AACrE,+EAA+E;AAC/E,+EAA+E;AAC/E,MAAM,UAAU,WAAW,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IACnE,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACxE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACxC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACrE,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,qBAAqB,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IAC7E,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,KAAK,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED,gFAAgF;AAChF,+EAA+E;AAC/E,2BAA2B;AAC3B,EAAE;AACF,0EAA0E;AAC1E,8EAA8E;AAC9E,wEAAwE;AACxE,4EAA4E;AAC5E,sEAAsE;AACtE,wEAAwE;AACxE,0EAA0E;AAC1E,wEAAwE;AACxE,yDAAyD;AACzD,MAAM,UAAU,WAAW,CAAC,CAAS;IACnC,OAAO,CACL,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,CACpF,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,6EAA6E;AAC7E,+EAA+E;AAC/E,0EAA0E;AAC1E,8EAA8E;AAC9E,oCAAoC;AACpC,EAAE;AACF,6EAA6E;AAC7E,8EAA8E;AAC9E,gFAAgF;AAChF,EAAE;AACF,8EAA8E;AAC9E,6EAA6E;AAC7E,6EAA6E;AAC7E,qBAAqB;AACrB,MAAM,UAAU,UAAU,CAAC,GAAe,EAAE,GAAW,EAAE,GAAW;IAClE,IAAI,CAAC,GAAG,GAAG,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,CAAC;QACR,OAAO,CAAC,GAAG,GAAG,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO;gBAAE,KAAK,EAAE,CAAC;YAChC,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAEvE,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAC9E,CAAC;QACD,KAAK,IAAI,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC,GAAG,GAAG,CAAC;IACV,CAAC;AACH,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,aAAa,CAAC,GAAe,EAAE,IAAY,EAAE,EAAU;IACrE,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,CAAC,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8EAA8E;AAC9E,uCAAuC;AACvC,EAAE;AACF,gFAAgF;AAChF,+EAA+E;AAC/E,8EAA8E;AAC9E,8EAA8E;AAC9E,gDAAgD;AAChD,EAAE;AACF,8EAA8E;AAC9E,2EAA2E;AAC3E,+EAA+E;AAC/E,+EAA+E;AAC/E,+EAA+E;AAC/E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,OAAO,YAAY;IASM;IARrB,WAAW,GAAG,CAAC,CAAC;IAChB,QAAQ,GAAG,KAAK,CAAC;IAEzB,iFAAiF;IACjF,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,YAA6B,IAAY;QAAZ,SAAI,GAAJ,IAAI,CAAQ;IAAG,CAAC;IAE7C;;;;;;;;OAQG;IACK,aAAa,CAAC,CAAS;QAC7B,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,CAAC,CAAC,CAAC;QACtD,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,aAAa,CAAC,CAAS;QACrB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;oBAAE,SAAS;gBAC9B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;oBAAC,CAAC,EAAE,CAAC;oBAAC,SAAS;gBAAC,CAAC,CAAC,wCAAwC;gBACpF,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU,CAAC,CAAS;QAClB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,SAAS,CAAC;YACR,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,IAAI,GAAG,CAAC;gBAAE,OAAO,CAAC,CAAC;YACvB,CAAC,GAAG,IAAI,CAAC;QACX,CAAC;IACH,CAAC;CACF;AAED,wEAAwE;AACxE,SAAS,YAAY,CAAC,EAAsB;IAC1C,OAAO,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC;AAC/F,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,CAAS,EAAE,OAAe;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,yCAAyC;QACzE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG;YAAE,CAAC,IAAI,EAAE,CAAC;QACjC,IAAI,CAAC,KAAK,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/step-record-boundary.d.ts

@@ -0,0 +1,28 @@
+export declare const UNBALANCED_RECORD = -1;
+export declare const UNREADABLE_RECORD = -2;
+export declare function findEntityLength(buf: Uint8Array, pos: number, startOffset: number): number;
+/**
+ * Offset just past the `)` balancing the record's own `(`, or one of
+ * `UNBALANCED_RECORD` / `UNREADABLE_RECORD`.
+ *
+ * The byte a scan resumes at after dropping a record it refused, and the two
+ * failures a caller must tell apart to know whether it may resume at all.
+ */
+export declare function recordCloseOffset(buf: Uint8Array, parenPos: number, startOffset: number): number;
+/**
+ * Whether the `;` at `semi` terminates the record that closes at `close` (from
+ * `recordCloseOffset`).
+ *
+ * Only for the case a caller's backwards whitespace walk could not settle: on
+ * a record with a trailing comment before its `;` the walk lands on the last
+ * byte of the comment close, and it cannot see through a comment (searching
+ * back for the opener would find one written inside a string literal).
+ * Skipping the trivia after
+ * the closing `)` answers it exactly, for any run of comments, and runs only
+ * here -- never on a record whose `)` sits directly before its `;`.
+ *
+ * Takes `close` rather than recomputing it so the caller, which needs the same
+ * offset to resume from when this returns false, balances the record once.
+ */
+export declare function semicolonClosesRecord(buf: Uint8Array, close: number, semi: number): boolean;
+//# sourceMappingURL=step-record-boundary.d.ts.map

package/dist/step-record-boundary.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-record-boundary.d.ts","sourceRoot":"","sources":["../src/step-record-boundary.ts"],"names":[],"mappings":"AAyCA,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,eAAO,MAAM,iBAAiB,KAAK,CAAC;AACpC,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CA+B1F;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,UAAU,EACf,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,GAClB,MAAM,CAGR;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GACX,OAAO,CAIT"}

package/dist/step-record-boundary.js

@@ -0,0 +1,108 @@
+/* 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/. */
+/**
+ * Where one STEP record ends, and whether a given `;` is its own (#4179).
+ *
+ * The TypeScript half of the rule argued in `close_step_record` in
+ * rust/core/src/parser/lexical.rs. Rust is the source of truth
+ * per AGENTS.md; read the two rules, the general property they approximate,
+ * and why a refusal recovers rather than stops, THERE, and change the halves
+ * together. `StepTokenizer.scanEntitiesFast` (tokenizer.ts) calls into here;
+ * `WORKER_CODE` (scan-worker-source.ts) hand-duplicates it because a Blob
+ * worker cannot import at runtime.
+ */
+import { opensComment, skipComment, skipStringLiteral, skipTrivia } from './step-lexing.js';
+const QUOTE = 0x27; // '\''
+const LPAREN = 0x28; // '('
+const RPAREN = 0x29; // ')'
+// Byte length of the record starting at `startOffset` whose argument list
+// opens at `pos`: up to and including the ')' balancing that '('.
+//
+// A failure is CLASSIFIED, because the two kinds call for opposite answers
+// from a scan that wants to recover (#4179). UNBALANCED_RECORD: every literal
+// and comment closed, so bytes after this record are readable and a caller may
+// resume there. UNREADABLE_RECORD: one never closed, so everything to end of
+// input is inside it and nothing can be resumed.
+//
+// A string literal is jumped over by skipStringLiteral rather than counted, so
+// the '(' in 'Storey (Level 1)' is text and not depth, and STEP's doubled-quote
+// escape ('') stays inside the literal instead of closing it. Sharing that
+// helper keeps the escape rule in one place: an open-coded `inString` flag here
+// would be a second copy, free to drift from the one every other scanner uses.
+//
+// A comment is jumped over for the same reason, in the same order: the literal
+// test comes first, so a '/*' inside a value is text; the comment is then taken
+// whole, so a '(' or a quote inside it is text. Without that, the comment in
+// `#1=IFCWALL('a', /* see IFCWALL( */ $);` opened a depth that never closed.
+export const UNBALANCED_RECORD = -1;
+export const UNREADABLE_RECORD = -2;
+export function findEntityLength(buf, pos, startOffset) {
+    const len = buf.length;
+    let depth = 0;
+    while (pos < len) {
+        const char = buf[pos];
+        if (char === QUOTE) {
+            // Returns `-1` on an unterminated literal (see skipStringLiteral's own
+            // doc): nothing after it is readable.
+            const next = skipStringLiteral(buf, pos, len);
+            if (next < 0)
+                return UNREADABLE_RECORD;
+            pos = next;
+        }
+        else if (opensComment(buf, pos, len)) {
+            const end = skipComment(buf, pos, len);
+            // Unterminated: the rest of the input is inside the comment.
+            if (end < 0)
+                return UNREADABLE_RECORD;
+            pos = end;
+        }
+        else if (char === LPAREN) {
+            depth++;
+            pos++;
+        }
+        else if (char === RPAREN) {
+            depth--;
+            pos++;
+            if (depth === 0)
+                return pos - startOffset;
+        }
+        else {
+            pos++;
+        }
+    }
+    return UNBALANCED_RECORD; // ran out of input with the '(' still open
+}
+/**
+ * Offset just past the `)` balancing the record's own `(`, or one of
+ * `UNBALANCED_RECORD` / `UNREADABLE_RECORD`.
+ *
+ * The byte a scan resumes at after dropping a record it refused, and the two
+ * failures a caller must tell apart to know whether it may resume at all.
+ */
+export function recordCloseOffset(buf, parenPos, startOffset) {
+    const length = findEntityLength(buf, parenPos, startOffset);
+    return length > 0 ? startOffset + length : length;
+}
+/**
+ * Whether the `;` at `semi` terminates the record that closes at `close` (from
+ * `recordCloseOffset`).
+ *
+ * Only for the case a caller's backwards whitespace walk could not settle: on
+ * a record with a trailing comment before its `;` the walk lands on the last
+ * byte of the comment close, and it cannot see through a comment (searching
+ * back for the opener would find one written inside a string literal).
+ * Skipping the trivia after
+ * the closing `)` answers it exactly, for any run of comments, and runs only
+ * here -- never on a record whose `)` sits directly before its `;`.
+ *
+ * Takes `close` rather than recomputing it so the caller, which needs the same
+ * offset to resume from when this returns false, balances the record once.
+ */
+export function semicolonClosesRecord(buf, close, semi) {
+    if (close <= 0)
+        return false;
+    const after = skipTrivia(buf, close, buf.length);
+    return !after.stop && after.next === semi;
+}
+//# sourceMappingURL=step-record-boundary.js.map

package/dist/step-record-boundary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-record-boundary.js","sourceRoot":"","sources":["../src/step-record-boundary.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE5F,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO;AAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;AAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;AAE3B,0EAA0E;AAC1E,kEAAkE;AAClE,EAAE;AACF,2EAA2E;AAC3E,8EAA8E;AAC9E,+EAA+E;AAC/E,6EAA6E;AAC7E,iDAAiD;AACjD,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,2EAA2E;AAC3E,gFAAgF;AAChF,+EAA+E;AAC/E,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,6EAA6E;AAC7E,6EAA6E;AAC7E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC;AACpC,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC;AACpC,MAAM,UAAU,gBAAgB,CAAC,GAAe,EAAE,GAAW,EAAE,WAAmB;IAChF,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,GAAG,GAAG,GAAG,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAEtB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACnB,uEAAuE;YACvE,sCAAsC;YACtC,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9C,IAAI,IAAI,GAAG,CAAC;gBAAE,OAAO,iBAAiB,CAAC;YACvC,GAAG,GAAG,IAAI,CAAC;QACb,CAAC;aAAM,IAAI,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvC,6DAA6D;YAC7D,IAAI,GAAG,GAAG,CAAC;gBAAE,OAAO,iBAAiB,CAAC;YACtC,GAAG,GAAG,GAAG,CAAC;QACZ,CAAC;aAAM,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,KAAK,EAAE,CAAC;YACR,GAAG,EAAE,CAAC;QACR,CAAC;aAAM,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,KAAK,EAAE,CAAC;YACR,GAAG,EAAE,CAAC;YACN,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,GAAG,GAAG,WAAW,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,GAAG,EAAE,CAAC;QACR,CAAC;IACH,CAAC;IAED,OAAO,iBAAiB,CAAC,CAAC,2CAA2C;AACvE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAe,EACf,QAAgB,EAChB,WAAmB;IAEnB,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;IAC5D,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;AACpD,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,qBAAqB,CACnC,GAAe,EACf,KAAa,EACb,IAAY;IAEZ,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACjD,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAC5C,CAAC"}

package/dist/step-record-boundary.vectors.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Shared #4179 record-boundary cases for the two TypeScript scan copies.
+ *
+ * The SCANNERS are hand-duplicated because a Blob worker cannot import at
+ * runtime. A test file is an ordinary module and has no such excuse, so the
+ * vectors live here once and `tokenizer.test.ts` and
+ * `scan-worker-source.malformed-record.test.ts` supply only their own driver.
+ * They were copies for one commit and had already drifted inside it.
+ */
+/** What a scan returned: each record as `[expressId, source text]`. */
+export type ScanSpans = {
+    spans: (readonly [number, string])[];
+    malformed: number;
+};
+/** Drives one scan implementation over `text`. */
+export type ScanDriver = (text: string) => ScanSpans;
+/**
+ * Records that must be ACCEPTED, i.e. the false-positive direction.
+ *
+ * Every shape is hand-constructed because a 487-file, 14,282,864-record sweep
+ * of this repo's IFC corpus contains NONE of them: zero records with a comment
+ * between the ')' and the ';', and zero with any whitespace there either. A
+ * clean sweep over a population without the case is not evidence about the
+ * case. What the corpus DOES carry, and so does attest: 6,816,392 records
+ * ending in a nested '))', 234,391 spanning several lines, and 15,111 with an
+ * '=' inside a string or comment, all accepted.
+ */
+export declare const LEGAL_BODIES: readonly string[];
+/**
+ * A record with no closing ')' at all costs ONE record, not the tail.
+ *
+ * `close_step_record`'s two failures are not interchangeable: this one leaves
+ * every literal and comment closed, so the bytes after are readable and the
+ * scan re-hunts from past the record's '#'. Collapsing it with the
+ * unreadable case below took `[1]` from an input the parent scanner read as
+ * `[1, 2, 3, 4]`, which is the amplification #4179 exists to remove.
+ */
+export declare const UNBALANCED_CASE: {
+    text: string;
+    spans: readonly [readonly [1, "#1=IFCA(1);"], readonly [3, "#3=IFCC(3);"], readonly [4, "#4=IFCD(4);"]];
+};
+/** Bodies with no ';' of their own AND no balancing ')' to resume at. */
+export declare const UNRESUMABLE_BODIES: readonly string[];
+/** The two shapes #4179 is about, as `[label, text, expected spans]`. */
+/**
+ * Records whose LINE numbers a cold re-walk must not disturb.
+ *
+ * The worker's comment skip advances its line counter as a side effect, so a
+ * caller that balances the record again to settle the ')' rule inflates every
+ * later line unless it saves and restores. `#2` here landed on line 4 in the
+ * worker and line 3 in the tokenizer for the same bytes.
+ */
+export declare const LINE_NUMBER_CASE: {
+    text: string;
+    lines: readonly [1, 3];
+};
+export declare const SWALLOW_CASES: readonly (readonly [string, string, (readonly [number, string])[]])[];
+//# sourceMappingURL=step-record-boundary.vectors.d.ts.map

package/dist/step-record-boundary.vectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-record-boundary.vectors.d.ts","sourceRoot":"","sources":["../src/step-record-boundary.vectors.ts"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AAEH,uEAAuE;AACvE,MAAM,MAAM,SAAS,GAAG;IAAE,KAAK,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpF,kDAAkD;AAClD,MAAM,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,CAAC;AAErD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,YAAY,EAAE,SAAS,MAAM,EAgBzC,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,eAAe;;;CAG3B,CAAC;AAEF,yEAAyE;AACzE,eAAO,MAAM,kBAAkB,EAAE,SAAS,MAAM,EAG/C,CAAC;AAEF,yEAAyE;AACzE;;;;;;;GAOG;AACH,eAAO,MAAM,gBAAgB;;;CAG5B,CAAC;AAEF,eAAO,MAAM,aAAa,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAgB9F,CAAC"}

package/dist/step-record-boundary.vectors.js

@@ -0,0 +1,80 @@
+/* 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/. */
+/**
+ * Records that must be ACCEPTED, i.e. the false-positive direction.
+ *
+ * Every shape is hand-constructed because a 487-file, 14,282,864-record sweep
+ * of this repo's IFC corpus contains NONE of them: zero records with a comment
+ * between the ')' and the ';', and zero with any whitespace there either. A
+ * clean sweep over a population without the case is not evidence about the
+ * case. What the corpus DOES carry, and so does attest: 6,816,392 records
+ * ending in a nested '))', 234,391 spanning several lines, and 15,111 with an
+ * '=' inside a string or comment, all accepted.
+ */
+export const LEGAL_BODIES = [
+    "IFCWALL('a=b',$);",
+    'IFCWALL($ /* a=b */);',
+    "IFCDOCUMENTREFERENCE('http://h/q?a=b&c=d',$);",
+    'IFCWALL($)/* trailing */;',
+    'IFCWALL($)/* one *//* two */;',
+    'IFCWALL($) /* spaced */ \t /* twice */ ;',
+    'IFCWALL($)/* multi\nline */;',
+    "IFCWALL(('a'),(1.,2.));",
+    "IFCWALL(\n  'a',\n  $\n);",
+    // isSpaceByte includes vertical tab and form feed; a form feed silently
+    // dropping an entity is exactly what #3733 was.
+    ...[' ', '\t', '\r', '\n', '\v', '\f'].flatMap((sp) => [
+        `IFCWALL($)${sp};`,
+        `IFCWALL($)${sp}/* c */${sp};`,
+    ]),
+];
+/**
+ * A record with no closing ')' at all costs ONE record, not the tail.
+ *
+ * `close_step_record`'s two failures are not interchangeable: this one leaves
+ * every literal and comment closed, so the bytes after are readable and the
+ * scan re-hunts from past the record's '#'. Collapsing it with the
+ * unreadable case below took `[1]` from an input the parent scanner read as
+ * `[1, 2, 3, 4]`, which is the amplification #4179 exists to remove.
+ */
+export const UNBALANCED_CASE = {
+    text: '#1=IFCA(1);\n#2=IFCB(2;\n#3=IFCC(3);\n#4=IFCD(4);\n',
+    spans: [[1, '#1=IFCA(1);'], [3, '#3=IFCC(3);'], [4, '#4=IFCD(4);']],
+};
+/** Bodies with no ';' of their own AND no balancing ')' to resume at. */
+export const UNRESUMABLE_BODIES = [
+    "IFCWALL('never closes,$)",
+    'IFCWALL(/* never closes $)',
+];
+/** The two shapes #4179 is about, as `[label, text, expected spans]`. */
+/**
+ * Records whose LINE numbers a cold re-walk must not disturb.
+ *
+ * The worker's comment skip advances its line counter as a side effect, so a
+ * caller that balances the record again to settle the ')' rule inflates every
+ * later line unless it saves and restores. `#2` here landed on line 4 in the
+ * worker and line 3 in the tokenizer for the same bytes.
+ */
+export const LINE_NUMBER_CASE = {
+    text: '#1=IFCWALL(/* a\nb */$)/* c */;\n#2=IFCDOOR($);\n',
+    lines: [1, 3],
+};
+export const SWALLOW_CASES = [
+    [
+        // Pre-fix: [#1, #2, #4] -- #3 gone, #2's span covering #3's whole record,
+        // and no diagnostic. The broken record is DROPPED, not the tail: #3 and #4
+        // both survive, because the scan resumes at the ')' balancing #2's own '('.
+        'a record missing its own ";" does not swallow the next record',
+        '#1=IFCA(1);\n#2=IFCB(2)\n#3=IFCC(3);\n#4=IFCD(4);\n',
+        [[1, '#1=IFCA(1);'], [3, '#3=IFCC(3);'], [4, '#4=IFCD(4);']],
+    ],
+    [
+        // Pre-fix: #2's span absorbed "ENDSEC;" and nothing was reported, so the
+        // file read as fully successful having lost a structural marker.
+        'a truncated last record does not swallow the footer',
+        "#1=IFCPROJECT('a');\n#2=IFCWALL('b')\nENDSEC;\nEND-ISO-10303-21;\n",
+        [[1, "#1=IFCPROJECT('a');"]],
+    ],
+];
+//# sourceMappingURL=step-record-boundary.vectors.js.map

package/dist/step-record-boundary.vectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-record-boundary.vectors.js","sourceRoot":"","sources":["../src/step-record-boundary.vectors.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAkB/D;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,YAAY,GAAsB;IAC7C,mBAAmB;IACnB,uBAAuB;IACvB,+CAA+C;IAC/C,2BAA2B;IAC3B,+BAA+B;IAC/B,0CAA0C;IAC1C,8BAA8B;IAC9B,yBAAyB;IACzB,2BAA2B;IAC3B,wEAAwE;IACxE,gDAAgD;IAChD,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;QACrD,aAAa,EAAE,GAAG;QAClB,aAAa,EAAE,UAAU,EAAE,GAAG;KAC/B,CAAC;CACH,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,IAAI,EAAE,qDAAqD;IAC3D,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAU;CAC7E,CAAC;AAEF,yEAAyE;AACzE,MAAM,CAAC,MAAM,kBAAkB,GAAsB;IACnD,0BAA0B;IAC1B,4BAA4B;CAC7B,CAAC;AAEF,yEAAyE;AACzE;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B,IAAI,EAAE,mDAAmD;IACzD,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAU;CACvB,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAA0E;IAClG;QACE,0EAA0E;QAC1E,2EAA2E;QAC3E,4EAA4E;QAC5E,+DAA+D;QAC/D,qDAAqD;QACrD,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;KAC7D;IACD;QACE,yEAAyE;QACzE,iEAAiE;QACjE,qDAAqD;QACrD,oEAAoE;QACpE,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;KAC7B;CACF,CAAC"}