@ifc-lite/export 4.11.0 → 4.12.0

package/dist/step-serialization.d.ts

@@ -44,12 +44,24 @@ export declare function serializeTypedMarker(type: string, value: string | numbe
 /**
  * Convert a number to a valid STEP REAL literal.
  *
- * Handles NaN/Infinity (-> `0.`) and delegates the mantissa/`E` rewrite to the
- * shared {@link formatStepReal} so exponential magnitudes serialize as valid
- * STEP (`5e-8` -> `5.E-8`, `1e21` -> `1.E+21`, `1.5e-7` -> `1.5E-7`) rather than
- * the invalid `5e-8.` / lowercase-`e` forms a bare decimal-point append produced.
+ * Delegates the mantissa/`E` rewrite to the shared {@link formatStepReal} so
+ * exponential magnitudes serialize as valid STEP (`5e-8` -> `5.E-8`, `1e21` ->
+ * `1.E+21`, `1.5e-7` -> `1.5E-7`) rather than the invalid `5e-8.` /
+ * lowercase-`e` forms a bare decimal-point append produced.
+ *
+ * A non-finite value THROWS (#7679). It used to be written as a made-up `0.`,
+ * which turned a NaN measure into a real zero. `$` ("omitted") is the reading
+ * only a caller that owns a whole optional attribute or property value can
+ * give, so those callers test `Number.isFinite` first; every other slot is
+ * refused here. The Rust writer (`jsval.rs::to_step_real`) refuses identically.
  */
 export declare function toStepReal(v: number): string;
+/**
+ * The digits of a finite integral number below 1e21, or `null`.
+ * `String(1e21)` is `1e+21`, which is not a STEP INTEGER (#7679). Not 2^53:
+ * the digits of a value between 2^53 and 1e21 are still a valid STEP INTEGER.
+ */
+export declare function toStepInteger(v: number): string | null;
 /**
  * Map QuantityType enum to IFC STEP entity type name.
  */

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

@@ -1 +1 @@
-{"version":3,"file":"step-serialization.d.ts","sourceRoot":"","sources":["../src/step-serialization.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAmC,KAAK,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAkB,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAEhF;;;;;;;GAOG;AACH,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAK5B;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAqBlE;AAiDD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAI3F;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAG5C;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAWhE;AAGD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGzD;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAsCnF;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,iBAAiB,EAAE,SAAS,UAAQ,GAAG,MAAM,CAEtF;AA8CD,+EAA+E;AAC/E,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAExD"}
+{"version":3,"file":"step-serialization.d.ts","sourceRoot":"","sources":["../src/step-serialization.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAmC,KAAK,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAkB,gBAAgB,EAAgC,MAAM,gBAAgB,CAAC;AAE9G;;;;;;;GAOG;AACH,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAK5B;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAqBlE;AAqDD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAI3F;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAG5C;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAEtD;AAOD;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CAWhE;AAGD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGzD;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAyCnF;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,iBAAiB,EAAE,SAAS,UAAQ,GAAG,MAAM,CAEtF;AA8CD,+EAA+E;AAC/E,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAExD"}

package/dist/step-serialization.js

@@ -20,7 +20,7 @@
  *     generic STEP token, and worth reading on its own.
  */
 import { serializeValue, SCHEMA_REGISTRY } from '@ifc-lite/parser';
-import { QuantityType, formatStepReal, escapeStepString } from '@ifc-lite/data';
+import { QuantityType, formatStepReal, escapeStepString, isCompleteStepNumericLiteral } from '@ifc-lite/data';
 /**
  * Re-exported so every existing `import { escapeStepString } from
  * './step-serialization.js'` call site keeps working. The implementation
@@ -93,8 +93,13 @@ function serializeInnerByBase(value, base) {
         case 'REAL':
         case 'NUMBER':
             return toStepReal(Number(value));
-        case 'INTEGER':
-            return String(Math.trunc(Number(value)));
+        case 'INTEGER': {
+            const n = Math.trunc(Number(value));
+            const digits = toStepInteger(n);
+            if (digits === null)
+                throw new Error(`Cannot write ${n} as a STEP INTEGER: it is not a finite value below 1e21`);
+            return digits;
+        }
         case 'BOOLEAN':
             // A BOOLEAN has no unknown state; an unrecognized token coerces to `.F.`.
             return coerceLogical(value) === true ? '.T.' : '.F.';
@@ -109,7 +114,7 @@ function serializeInnerByBase(value, base) {
             if (typeof value === 'boolean')
                 return value ? '.T.' : '.F.';
             if (typeof value === 'number')
-                return Number.isInteger(value) ? String(value) : toStepReal(value);
+                return Number.isInteger(value) ? integralToken(value) : toStepReal(value);
             return `'${escapeStepString(String(value))}'`;
     }
 }
@@ -128,16 +133,34 @@ export function serializeTypedMarker(type, value) {
 /**
  * Convert a number to a valid STEP REAL literal.
  *
- * Handles NaN/Infinity (-> `0.`) and delegates the mantissa/`E` rewrite to the
- * shared {@link formatStepReal} so exponential magnitudes serialize as valid
- * STEP (`5e-8` -> `5.E-8`, `1e21` -> `1.E+21`, `1.5e-7` -> `1.5E-7`) rather than
- * the invalid `5e-8.` / lowercase-`e` forms a bare decimal-point append produced.
+ * Delegates the mantissa/`E` rewrite to the shared {@link formatStepReal} so
+ * exponential magnitudes serialize as valid STEP (`5e-8` -> `5.E-8`, `1e21` ->
+ * `1.E+21`, `1.5e-7` -> `1.5E-7`) rather than the invalid `5e-8.` /
+ * lowercase-`e` forms a bare decimal-point append produced.
+ *
+ * A non-finite value THROWS (#7679). It used to be written as a made-up `0.`,
+ * which turned a NaN measure into a real zero. `$` ("omitted") is the reading
+ * only a caller that owns a whole optional attribute or property value can
+ * give, so those callers test `Number.isFinite` first; every other slot is
+ * refused here. The Rust writer (`jsval.rs::to_step_real`) refuses identically.
  */
 export function toStepReal(v) {
     if (!Number.isFinite(v))
-        return '0.';
+        throw new Error(`Cannot write ${v} as a STEP REAL: it has no finite value`);
     return formatStepReal(v);
 }
+/**
+ * The digits of a finite integral number below 1e21, or `null`.
+ * `String(1e21)` is `1e+21`, which is not a STEP INTEGER (#7679). Not 2^53:
+ * the digits of a value between 2^53 and 1e21 are still a valid STEP INTEGER.
+ */
+export function toStepInteger(v) {
+    return Number.isFinite(v) && Math.abs(v) < 1e21 ? String(v === 0 ? 0 : v) : null;
+}
+/** An integral finite number as a token: INTEGER digits below 1e21, the REAL form from there up. */
+function integralToken(v) {
+    return toStepInteger(v) ?? formatStepReal(v);
+}
 /**
  * Map QuantityType enum to IFC STEP entity type name.
  */
@@ -198,13 +221,16 @@ export function serializeAttributeValue(value, currentToken) {
             return '.F.';
         return '.U.';
     }
-    if (/^-?\d+(?:\.\d+)?(?:E[+-]?\d+)?$/i.test(trimmed) && /^-?\d/.test(current)) {
+    // The one STEP numeric grammar (core's `step_numeric_literal_len`): `.5`,
+    // `+1`, `1.E5`, `+1.` and `-0.` are numbers too. The regex this was refused
+    // them, so such a slot was rewritten as a quoted string (F4 M-export-a).
+    if (isCompleteStepNumericLiteral(trimmed) && isCompleteStepNumericLiteral(current)) {
         const numberValue = Number(trimmed);
         if (!Number.isFinite(numberValue))
             return '$';
-        return current.includes('.') || /E/i.test(current)
+        return current.includes('.') || /E/i.test(current) || !Number.isInteger(numberValue)
             ? toStepReal(numberValue)
-            : String(numberValue);
+            : integralToken(numberValue);
     }
     return serializeValue(value);
 }
@@ -252,7 +278,7 @@ function serializeStepValueAt(value, forceReal, inList) {
         }
         if (forceReal)
             return toStepReal(value);
-        return Number.isInteger(value) ? String(value) : toStepReal(value);
+        return Number.isInteger(value) ? integralToken(value) : toStepReal(value);
     }
     if (Array.isArray(value)) {
         return `(${value.map(v => serializeStepValueAt(v, forceReal, true)).join(',')})`;

package/dist/step-serialization.js.map

@@ -1 +1 @@
-{"version":3,"file":"step-serialization.js","sourceRoot":"","sources":["../src/step-serialization.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,cAAc,EAAE,eAAe,EAA0B,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAEhF;;;;;;;GAOG;AACH,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,qEAAqE;AACrE,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE5G;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,IAAI,MAAM,GAAuB,QAAQ,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,UAAU,GAAuB,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;YACxG,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC;YAC/B,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QAC7B,uEAAuE;QACvE,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAClE,IAAI,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9C,MAAM,GAAG,UAAU,CAAC,CAAC,kEAAkE;IACzF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,aAAa,CAAC,KAAgC;IACrD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IACvE,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IACzE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,KAAgC,EAAE,IAAmB;IACjF,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACnC,KAAK,SAAS;YACZ,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,KAAK,SAAS;YACZ,0EAA0E;YAC1E,OAAO,aAAa,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACvD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YACrC,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACtE,CAAC;QACD,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;QAChD;YACE,IAAI,OAAO,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClG,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;IAClD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,KAAgC;IACjF,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,KAAK,GAAG,MAAM,KAAK,EAAE,CAAC;IACpD,OAAO,GAAG,KAAK,IAAI,oBAAoB,CAAC,KAAK,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;AAC9E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAkB;IACtD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,iBAAiB,CAAC;QACjD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,KAAK,CAAC,CAAC,OAAO,kBAAkB,CAAC;QACnD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,iBAAiB,CAAC;QACjD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,OAAO,CAAC,CAAC,OAAO,kBAAkB,CAAC;IACrC,CAAC;AACH,CAAC;AAGD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa;IAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,OAAO,qCAAqC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAa,EAAE,YAAoB;IACzE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC;IAEpC,6EAA6E;IAC7E,qEAAqE;IACrE,2EAA2E;IAC3E,8EAA8E;IAC9E,gFAAgF;IAChF,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5E,IAAI,KAAK,KAAK,EAAE;YAAE,OAAO,GAAG,CAAC;QAC7B,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAAC;IACxC,CAAC;IAED,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC7B,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;QAAE,OAAO,OAAO,CAAC;IACvD,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAE3C,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3E,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC;IAC5E,CAAC;IAED,IAAI,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,UAAU,KAAK,OAAO,IAAI,UAAU,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QACjE,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,kCAAkC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9E,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC;YAAE,OAAO,GAAG,CAAC;QAC9C,OAAO,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;YAChD,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC;YACzB,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAwB,EAAE,SAAS,GAAG,KAAK;IAC5E,OAAO,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAC,KAAwB,EAAE,SAAkB,EAAE,MAAe;IACzF,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACtD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CACb,gBAAgB,KAAK,qFAAqF,CAC3G,CAAC;YACJ,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,SAAS;YAAE,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACnF,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;QACjD,wEAAwE;QACxE,wDAAwD;QACxD,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,EAAE,CAAC;QAClD,4EAA4E;QAC5E,uEAAuE;QACvE,OAAO,oBAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;QAAE,OAAO,OAAO,CAAC;IACvD,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC3C,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IACpE,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,OAAO,IAAI,SAAS,EAAE,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC"}
+{"version":3,"file":"step-serialization.js","sourceRoot":"","sources":["../src/step-serialization.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,cAAc,EAAE,eAAe,EAA0B,MAAM,kBAAkB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,gBAAgB,EAAE,4BAA4B,EAAE,MAAM,gBAAgB,CAAC;AAE9G;;;;;;;GAOG;AACH,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,qEAAqE;AACrE,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE5G;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,IAAI,MAAM,GAAuB,QAAQ,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,yEAAyE;QACzE,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,UAAU,GAAuB,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;YACxG,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC;YAC/B,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QAC7B,uEAAuE;QACvE,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAClE,IAAI,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9C,MAAM,GAAG,UAAU,CAAC,CAAC,kEAAkE;IACzF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,aAAa,CAAC,KAAgC;IACrD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IACvE,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IACzE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,KAAgC,EAAE,IAAmB;IACjF,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACnC,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,yDAAyD,CAAC,CAAC;YACjH,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,KAAK,SAAS;YACZ,0EAA0E;YAC1E,OAAO,aAAa,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACvD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YACrC,OAAO,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACtE,CAAC;QACD,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;QAChD;YACE,IAAI,OAAO,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACzG,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;IAClD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,KAAgC;IACjF,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,KAAK,GAAG,MAAM,KAAK,EAAE,CAAC;IACpD,OAAO,GAAG,KAAK,IAAI,oBAAoB,CAAC,KAAK,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;AAC9E,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS;IAClC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,yCAAyC,CAAC,CAAC;IACrG,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACnF,CAAC;AAED,oGAAoG;AACpG,SAAS,aAAa,CAAC,CAAS;IAC9B,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAkB;IACtD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,iBAAiB,CAAC;QACjD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,KAAK,CAAC,CAAC,OAAO,kBAAkB,CAAC;QACnD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,iBAAiB,CAAC;QACjD,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,mBAAmB,CAAC;QACrD,OAAO,CAAC,CAAC,OAAO,kBAAkB,CAAC;IACrC,CAAC;AACH,CAAC;AAGD;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa;IAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACvB,OAAO,qCAAqC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAa,EAAE,YAAoB;IACzE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC;IAEpC,6EAA6E;IAC7E,qEAAqE;IACrE,2EAA2E;IAC3E,8EAA8E;IAC9E,gFAAgF;IAChF,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5E,IAAI,KAAK,KAAK,EAAE;YAAE,OAAO,GAAG,CAAC;QAC7B,OAAO,IAAI,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAAC;IACxC,CAAC;IAED,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC7B,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;QAAE,OAAO,OAAO,CAAC;IACvD,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAE3C,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3E,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC;IAC5E,CAAC;IAED,IAAI,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QAChE,IAAI,UAAU,KAAK,OAAO,IAAI,UAAU,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QACjE,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0EAA0E;IAC1E,4EAA4E;IAC5E,yEAAyE;IACzE,IAAI,4BAA4B,CAAC,OAAO,CAAC,IAAI,4BAA4B,CAAC,OAAO,CAAC,EAAE,CAAC;QACnF,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC;YAAE,OAAO,GAAG,CAAC;QAC9C,OAAO,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC;YAClF,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC;YACzB,CAAC,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAwB,EAAE,SAAS,GAAG,KAAK;IAC5E,OAAO,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAC,KAAwB,EAAE,SAAkB,EAAE,MAAe;IACzF,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IACtD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CACb,gBAAgB,KAAK,qFAAqF,CAC3G,CAAC;YACJ,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,SAAS;YAAE,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IACnF,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAI,KAAK,EAAE,CAAC;QACjD,wEAAwE;QACxE,wDAAwD;QACxD,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,EAAE,CAAC;QAClD,4EAA4E;QAC5E,uEAAuE;QACvE,OAAO,oBAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;QAAE,OAAO,OAAO,CAAC;IACvD,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC3C,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IACpE,OAAO,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;AAChD,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,OAAO,IAAI,SAAS,EAAE,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC"}

package/dist/step-slot-grammar.d.ts

@@ -1,24 +1,27 @@
+/** The STEP whitespace set, as core's `is_step_space`. */
+export declare function isStepSpaceCode(code: number): boolean;
+/** Whether `text` is empty or only STEP whitespace. */
+export declare function isStepBlank(text: string): boolean;
+/**
+ * Index past the whitespace and `/* ... *\/` comments starting at `from`, or
+ * -1 when a comment never closes (core's `skip_step_trivia`).
+ */
+export declare function skipStepTrivia(text: string, from: number): number;
+/**
+ * Whether `value` is exactly ONE STEP value, trivia allowed around it and
+ * between its parts. See the module comment for the grammar.
+ */
+export declare function isStepValue(value: string): boolean;
 /**
  * Whether `part` — one slot `splitTopLevelStepArguments` already separated on
- * a top-level comma, raw text including any surrounding whitespace/comments —
- * is a single well-formed STEP value (a string literal, a binary literal
- * (`"..."`), `$`, `*`, a bare keyword / enumeration / number / `#`-reference
- * token, or a typed value or list `NAME(...)` / `(...)`), or is empty.
- *
- * Empty is deliberately accepted, matching `splitTopLevelStepArguments`'s
- * docstring: `a,,b` is one empty part, not a rejection, so slot indices after it
- * stay aligned with what the entity parser counts. A part that is ONLY a comment
- * (no value) is NOT given that same pass — a lone `/* c *​/` between two commas
- * is not a value at all, so treating it as one more empty slot is exactly the
- * index shift that produces a phantom slot; rejecting the whole split is the
- * correct answer there, same as any other malformed argument list.
- *
- * A `/` that is not opening a comment cannot be swallowed into a bare token:
- * it is outside every token's character set, so it stops the scan and the
- * top-of-function "consumed to the end" check then fails the whole part.
+ * a top-level comma, raw text including any surrounding whitespace or
+ * comments — is a single well-formed STEP value, or is empty.
  *
- * Nesting past {@link MAX_SLOT_NESTING_DEPTH} is refused like any other
- * malformed part, for the reason recorded on that constant.
+ * Empty is deliberately accepted, matching `splitTopLevelStepArguments`:
+ * `a,,b` is one empty part, not a rejection, so slot indices after it stay
+ * aligned with what the entity parser counts. A part that is ONLY a comment is
+ * NOT given that pass: counting it as one more empty slot would shift every
+ * index after it.
  */
 export declare function isWellFormedStepSlot(part: string): boolean;
 //# sourceMappingURL=step-slot-grammar.d.ts.map

package/dist/step-slot-grammar.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"step-slot-grammar.d.ts","sourceRoot":"","sources":["../src/step-slot-grammar.ts"],"names":[],"mappings":"AAkEA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAmH1D"}
+{"version":3,"file":"step-slot-grammar.d.ts","sourceRoot":"","sources":["../src/step-slot-grammar.ts"],"names":[],"mappings":"AAuCA,0DAA0D;AAC1D,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAErD;AAED,uDAAuD;AACvD,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAKjD;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAYjE;AA8CD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAgFlD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAE1D"}

package/dist/step-slot-grammar.js

@@ -6,196 +6,229 @@
  * `splitTopLevelStepArguments` (`step-argument-parser.ts`) separated on a
  * top-level comma, is that part a single well-formed STEP value?
  *
- * Split out of `step-argument-parser.ts` because the two answer different
- * questions and only one of them recurses. The splitter is a flat scan over the
- * whole argument list; this is a small recursive-descent grammar over one slot,
- * and it is the recursion that needs the bound documented below. Keeping them in
- * one file also put that file one line under the module-size ratchet.
- */
-/**
- * How deep a slot's parentheses may nest before the slot is refused.
- *
- * The grammar below is recursive descent — `parseValue` -> `parseParenList` ->
- * `parseValue`, two stack frames per nesting level — over text this process did
- * not write. Unbounded, deep enough nesting exhausts the JS stack and throws a
- * `RangeError`, and a throw is a THIRD outcome for a function whose two callers
- * (`replaceStepArgument`, and every by-index writer behind
- * `splitTopLevelStepArguments`) are written against exactly two: parts, or
- * `null` meaning "this edit cannot be made". A malformed or adversarial file
- * would abort the whole export instead of refusing one edit. Bounding the
- * nesting and returning `null` past the bound is what makes the contract total.
- *
- * The number is picked between two measurements taken on 2026-09-09 (#4213):
- *
- *   - REAL NESTING. Over the repo's whole `tests/models` corpus (122 `.ifc`
- *     files, 1.4 GB), the deepest paren nesting inside any top-level slot of any
- *     record is 3 — the record-level maximum is 4, and one of those is the slot
- *     itself. The deepest shape in the corpus is
- *     `IFCINDEXEDPOLYCURVE(#307,(IFCLINEINDEX((1,2)),...),.F.)`.
- *   - THE STACK. In a fresh Node 22 process the deepest slot this grammar could
- *     validate before throwing `RangeError` was 3763 (eight fresh-process
- *     bisections, all eight identical); under vitest, 3768. That floor is the
- *     COLD one: once V8 has optimised the frames the same bisection reaches
- *     ~7900 in the same process, so the low number is the one to design against,
- *     and a real export calls this from far deeper in its own stack than a
- *     bisection harness does.
+ * This is the TypeScript twin of `ifc_lite_core::parser::is_step_value`
+ * (F4 M-export-a, #7778), and both are held to
+ * `rust/core/tests/fixtures/step_slot_vectors.json`
+ * (`step-slot-vectors.parity.test.ts` here, `slots_tests.rs` there). The
+ * grammar is the one the STEP tokenizer reads, so whatever passes is a token
+ * on the reading side: a string `'...'`, a binary `"[0-3]hex*"`, `$`, `*`, a
+ * reference `#digits`, an enumeration `.NAME.`, a number, a list `( ... )`
+ * or a typed value `NAME( ... )`. Not values, because the tokenizer reads
+ * none of them: a bare keyword, `1..2`, `#+5`, an empty list element
+ * (`(1,,2)`), a binary with a non-hex byte, an integer beyond `i64`. The
+ * whitespace is the STEP set (space, tab, LF, CR, FF, VT), never `\s`, so a
+ * no-break space is not padding. A comment that never closes is not trivia.
  *
- * 64 is ~21x the deepest nesting real files use and ~59x below the shallowest
- * depth measured to throw: it refuses nothing the corpus contains, and it is
- * reached long before the stack is. Both figures are historical, not
- * invariants: the corpus can gain a file and V8 can change its frame size. What
- * must stay true is the ORDER — comfortably above real nesting, far below the
- * crash floor — and `step-argument-parser.test.ts` pins the two ends of the
- * bound itself, plus one depth measured to throw before it existed.
- *
- * Deliberately NOT mirrored into the two sibling grammars. `step_slot.rs`'s
- * `is_well_formed_step_slot` and `packages/cli/src/commands/step-args.ts`'s
- * `skipToken` are both flat loops with an explicit `depth` counter — the CLI
- * one says so in its own docstring, in as many words — so neither has a stack
- * to exhaust and neither needs a bound; adding one there would only invent a
- * refusal. This grammar was the odd one out, not the one setting the rule.
- *
- * The implementations therefore diverge on what they ACCEPT at extreme depth,
- * which is why this is not in `rust/export/tests/fixtures/step_refuse_vectors.json`
- * — that fixture pins agreement on refusals only, and pinning an accept-side
- * divergence would freeze the divergence as agreement (#4125).
+ * The scan carries its nesting in a counter rather than recursing, so no input
+ * can exhaust the stack; nesting past {@link MAX_SLOT_NESTING_DEPTH} (the
+ * tokenizer's bound) is refused like any other malformed part. The recursive
+ * descent this replaced bounded nesting at 64 because it could throw
+ * `RangeError` (#4213); the loop has no such floor.
  */
-const MAX_SLOT_NESTING_DEPTH = 64;
+import { stepStringLiteralEnd } from '@ifc-lite/encoding';
+import { isCompleteStepNumericLiteral } from '@ifc-lite/data';
+/** The tokenizer's nesting bound (`MAX_NESTING_DEPTH` in core's tokenizer). */
+const MAX_SLOT_NESTING_DEPTH = 256;
+const I64_MAX = 9223372036854775807n;
+const I64_MIN = -9223372036854775808n;
+const U32_MAX = 4294967295;
+/** The STEP whitespace set, as core's `is_step_space`. */
+export function isStepSpaceCode(code) {
+    return code === 0x20 || (code >= 0x09 && code <= 0x0d);
+}
+/** Whether `text` is empty or only STEP whitespace. */
+export function isStepBlank(text) {
+    for (let i = 0; i < text.length; i++) {
+        if (!isStepSpaceCode(text.charCodeAt(i)))
+            return false;
+    }
+    return true;
+}
 /**
- * Whether `part` — one slot `splitTopLevelStepArguments` already separated on
- * a top-level comma, raw text including any surrounding whitespace/comments —
- * is a single well-formed STEP value (a string literal, a binary literal
- * (`"..."`), `$`, `*`, a bare keyword / enumeration / number / `#`-reference
- * token, or a typed value or list `NAME(...)` / `(...)`), or is empty.
- *
- * Empty is deliberately accepted, matching `splitTopLevelStepArguments`'s
- * docstring: `a,,b` is one empty part, not a rejection, so slot indices after it
- * stay aligned with what the entity parser counts. A part that is ONLY a comment
- * (no value) is NOT given that same pass — a lone `/* c *​/` between two commas
- * is not a value at all, so treating it as one more empty slot is exactly the
- * index shift that produces a phantom slot; rejecting the whole split is the
- * correct answer there, same as any other malformed argument list.
- *
- * A `/` that is not opening a comment cannot be swallowed into a bare token:
- * it is outside every token's character set, so it stops the scan and the
- * top-of-function "consumed to the end" check then fails the whole part.
- *
- * Nesting past {@link MAX_SLOT_NESTING_DEPTH} is refused like any other
- * malformed part, for the reason recorded on that constant.
+ * Index past the whitespace and `/* ... *\/` comments starting at `from`, or
+ * -1 when a comment never closes (core's `skip_step_trivia`).
  */
-export function isWellFormedStepSlot(part) {
-    if (part.trim() === '')
-        return true;
-    let i = 0;
-    const n = part.length;
-    const skipTrivia = () => {
-        for (;;) {
-            while (i < n && /\s/.test(part[i]))
-                i++;
-            if (part[i] === '/' && part[i + 1] === '*') {
-                const end = part.indexOf('*/', i + 2);
-                if (end === -1) {
-                    i = n; // unterminated: leave content unconsumed so parseValue fails
-                    return;
-                }
-                i = end + 2;
-                continue;
-            }
-            break;
-        }
-    };
-    /**
-     * `depth` is how many parens are open around this list — 1 for a list that is
-     * the slot's own outermost `(`. Checked on ENTRY, before any recursion, so the
-     * frame budget is spent by the check rather than by the call it guards.
-     */
-    const parseParenList = (depth) => {
-        if (depth > MAX_SLOT_NESTING_DEPTH)
-            return false;
-        // Caller has already consumed the opening '('.
-        skipTrivia();
-        if (part[i] === ')') {
+export function skipStepTrivia(text, from) {
+    let i = from;
+    for (;;) {
+        while (i < text.length && isStepSpaceCode(text.charCodeAt(i)))
             i++;
-            return true;
+        if (text.charCodeAt(i) === 0x2f && text.charCodeAt(i + 1) === 0x2a) {
+            const end = text.indexOf('*/', i + 2);
+            if (end === -1)
+                return -1;
+            i = end + 2;
+            continue;
         }
-        for (;;) {
-            if (!parseValue(depth))
+        return i;
+    }
+}
+function isDigit(code) {
+    return code >= 0x30 && code <= 0x39;
+}
+function isNameCode(code) {
+    return (isDigit(code) ||
+        (code >= 0x41 && code <= 0x5a) ||
+        (code >= 0x61 && code <= 0x7a) ||
+        code === 0x5f);
+}
+function isHexCode(code) {
+    return isDigit(code) || (code >= 0x41 && code <= 0x46) || (code >= 0x61 && code <= 0x66);
+}
+function isNumberRunCode(code) {
+    return isDigit(code) || code === 0x2b || code === 0x2d || code === 0x2e || code === 0x45 || code === 0x65;
+}
+/** Index past the run of name characters at `from`. */
+function nameEnd(text, from) {
+    let i = from;
+    while (i < text.length && isNameCode(text.charCodeAt(i)))
+        i++;
+    return i;
+}
+/**
+ * Index past the number at `from`, or -1: one complete STEP numeric literal
+ * (core's `read_step_number`), an `INTEGER` within `i64`.
+ */
+function numberEnd(text, from) {
+    let i = from;
+    while (i < text.length && isNumberRunCode(text.charCodeAt(i)))
+        i++;
+    const token = text.slice(from, i);
+    if (!isCompleteStepNumericLiteral(token))
+        return -1;
+    if (!/[.eE]/.test(token)) {
+        const value = BigInt(token);
+        if (value > I64_MAX || value < I64_MIN)
+            return -1;
+    }
+    return i;
+}
+/**
+ * Whether `value` is exactly ONE STEP value, trivia allowed around it and
+ * between its parts. See the module comment for the grammar.
+ */
+export function isStepValue(value) {
+    const n = value.length;
+    let i = skipStepTrivia(value, 0);
+    if (i === -1)
+        return false;
+    let depth = 0;
+    // Whether the next thing read is a value (after `(` or `,`) rather than a
+    // separator (after a value).
+    let expectValue = true;
+    for (;;) {
+        if (expectValue) {
+            if (i >= n)
                 return false;
-            skipTrivia();
-            if (part[i] === ',') {
+            const code = value.charCodeAt(i);
+            const openList = (from) => {
+                depth++;
+                if (depth > MAX_SLOT_NESTING_DEPTH)
+                    return false;
+                i = skipStepTrivia(value, from);
+                if (i === -1)
+                    return false;
+                // An empty list is a value; an element may not be empty.
+                if (value.charCodeAt(i) === 0x29) {
+                    depth--;
+                    i++;
+                    expectValue = false;
+                }
+                i = skipStepTrivia(value, i);
+                return i !== -1;
+            };
+            if (code === 0x27) {
+                const end = stepStringLiteralEnd(value, i);
+                if (end === -1)
+                    return false;
+                i = end;
+            }
+            else if (code === 0x22) {
+                const close = value.indexOf('"', i + 1);
+                if (close === -1)
+                    return false;
+                const first = value.charCodeAt(i + 1);
+                if (close === i + 1 || first < 0x30 || first > 0x33)
+                    return false;
+                for (let k = i + 2; k < close; k++) {
+                    if (!isHexCode(value.charCodeAt(k)))
+                        return false;
+                }
+                i = close + 1;
+            }
+            else if (code === 0x24 || code === 0x2a) {
                 i++;
-                skipTrivia();
+            }
+            else if (code === 0x23) {
+                let end = i + 1;
+                while (end < n && isDigit(value.charCodeAt(end)))
+                    end++;
+                if (end === i + 1 || Number(value.slice(i + 1, end)) > U32_MAX)
+                    return false;
+                i = end;
+            }
+            else if (code === 0x2e && i + 1 < n && !isDigit(value.charCodeAt(i + 1))) {
+                const end = nameEnd(value, i + 1);
+                if (end === i + 1 || value.charCodeAt(end) !== 0x2e)
+                    return false;
+                i = end + 1;
+            }
+            else if (code === 0x28) {
+                if (!openList(i + 1))
+                    return false;
                 continue;
             }
-            if (part[i] === ')') {
-                i++;
-                return true;
+            else if (code === 0x2b || code === 0x2d || code === 0x2e || isDigit(code)) {
+                const end = numberEnd(value, i);
+                if (end === -1)
+                    return false;
+                i = end;
             }
-            return false;
-        }
-    };
-    const parseValue = (depth) => {
-        skipTrivia();
-        if (i >= n)
-            return false;
-        const c = part[i];
-        if (c === "'") {
-            i++;
-            while (i < n) {
-                if (part[i] === "'") {
-                    if (part[i + 1] === "'") {
-                        i += 2;
-                        continue;
-                    }
-                    i++;
-                    return true;
-                }
-                i++;
+            else if ((code >= 0x41 && code <= 0x5a) || (code >= 0x61 && code <= 0x7a) || code === 0x5f) {
+                const open = skipStepTrivia(value, nameEnd(value, i));
+                // A bare keyword is no value.
+                if (open === -1 || value.charCodeAt(open) !== 0x28)
+                    return false;
+                if (!openList(open + 1))
+                    return false;
+                continue;
             }
-            return false; // unterminated string
-        }
-        if (c === '(') {
-            i++;
-            return parseParenList(depth + 1);
-        }
-        // Binary literal (ISO 10303-21 `"..."`, e.g. `"0123ABC"` — an
-        // IfcBinary-typed value, distinct from the `'...'` string literal above.
-        // Unlike a string, `"` has no doubled-quote escape in STEP: ifcopenshell's
-        // tokenizer (`IfcParse.cpp`, `GeneralTokenPtr`/`IfcSpfLexer::Next`)
-        // classifies a token as binary purely by its leading `"` and does not
-        // decode escapes inside it, so the first following `"` ends the literal.
-        if (c === '"') {
-            i++;
-            while (i < n && part[i] !== '"')
-                i++;
-            if (i >= n)
-                return false; // unterminated binary literal
-            i++;
-            return true;
-        }
-        if (c === '$' || c === '*') {
-            i++;
-            return true;
+            else {
+                return false;
+            }
+            expectValue = false;
+            i = skipStepTrivia(value, i);
+            if (i === -1)
+                return false;
+            continue;
         }
-        // Bare token: keyword, enumeration (`.NOTDEFINED.`), number (incl.
-        // exponent), or an `#`-prefixed entity reference.
-        const start = i;
-        while (i < n && /[A-Za-z0-9_.+\-#]/.test(part[i]))
-            i++;
-        if (i === start)
+        // A value just closed: at depth zero it was the whole slot.
+        if (depth === 0)
+            return i === n;
+        const code = value.charCodeAt(i);
+        if (code === 0x29)
+            depth--;
+        else if (code === 0x2c)
+            expectValue = true;
+        else
             return false;
-        // A typed value: NAME(...), trivia tolerated before '(' the same way
-        // `RECORD_PREFIX_RE` tolerates it before a record's own '('.
-        skipTrivia();
-        if (part[i] === '(') {
-            i++;
-            return parseParenList(depth + 1);
-        }
-        return true;
-    };
-    if (!parseValue(0))
-        return false;
-    skipTrivia();
-    return i === n;
+        i = skipStepTrivia(value, i + 1);
+        if (i === -1)
+            return false;
+    }
+}
+/**
+ * Whether `part` — one slot `splitTopLevelStepArguments` already separated on
+ * a top-level comma, raw text including any surrounding whitespace or
+ * comments — is a single well-formed STEP value, or is empty.
+ *
+ * Empty is deliberately accepted, matching `splitTopLevelStepArguments`:
+ * `a,,b` is one empty part, not a rejection, so slot indices after it stay
+ * aligned with what the entity parser counts. A part that is ONLY a comment is
+ * NOT given that pass: counting it as one more empty slot would shift every
+ * index after it.
+ */
+export function isWellFormedStepSlot(part) {
+    return isStepBlank(part) || isStepValue(part);
 }
 //# sourceMappingURL=step-slot-grammar.js.map