universal-physics-tensor 9.0.0 → 11.0.0

package/dist/bridges/expr-parse.d.ts

@@ -12,16 +12,50 @@
 import type { ExprNode } from '../dimensional/ast-types.js';
 /** Names a formula may mention: quantities, constants, and formula overlays. */
 export declare function formulaNames(): ReadonlySet<string>;
-/** Numeric scope: constants, formula overlays, and π. Caller inputs overwrite. */
-export declare function formulaScope(inputs?: Readonly<Record<string, number>>): Record<string, number>;
+/** π, the registered constants and the formula overlays: names a caller may not bind. */
+export declare function reservedFormulaNames(): ReadonlySet<string>;
+/**
+ * Numeric scope: constants, formula overlays, and π, then the caller's inputs.
+ * An input whose name is reserved is refused with {@link ConstantInputError}
+ * unless `declared` names it: a relation's own source may carry a constant's
+ * name as a default the caller overrides (be-63's Lane-Emden ω₃).
+ * {@link evaluateFormula} first drops a reserved key its expression does not
+ * read; this builder refuses every undeclared one.
+ */
+export declare function formulaScope(inputs?: Readonly<Record<string, number>>, declared?: readonly string[]): Record<string, number>;
 /**
  * The free variables of a catalog expression, read from the same MathTS parse
  * {@link evaluateFormula} evaluates: the scope names it reads, a hyphenated
  * quantity written with underscores.
  */
 export declare function formulaVariables(expression: string): readonly string[];
-/** Evaluate a catalog expression with MathTS. Inputs are quantity names. */
-export declare function evaluateFormula(expression: string, inputs: Readonly<Record<string, number>>): number;
+/**
+ * The names a catalog expression mentions, each hyphenated quantity or
+ * constant spelling rewritten to its one token first (`truncation-coefficient-b`
+ * is `truncation_coefficient_b`, not `b`), π included (MathTS does not list it
+ * as a variable). Cached per expression text. `reduced-planck-constant` is
+ * `hbar`: the rewrite takes the longest spelling at each segment, so the
+ * declared `planck-constant` inside it does not win. The one identifier
+ * walk: the notices reader and the condition interpreter read it too.
+ * @internal
+ */
+export declare function expressionNames(expression: string): ReadonlySet<string>;
+/**
+ * `inputs` without the reserved keys that `reads` does not name. A reserved
+ * key the formula reads and `declared` does not name is refused: the caller's
+ * number would replace the constant. One the formula does not read is not an
+ * input of this formula; it is dropped, as any other extra key is on the
+ * graph path (a composed edge forwards every input to each component).
+ */
+export declare function withoutUnreadConstants(inputs: Readonly<Record<string, number>>, reads: ReadonlySet<string>, declared: readonly string[]): Record<string, number>;
+/**
+ * Evaluate a catalog expression with MathTS. Inputs are quantity names.
+ * `declared` are the names the caller may bind although they are reserved
+ * (the relation's sources); a reserved key the expression reads and
+ * `declared` does not name is a {@link ConstantInputError}, and one it does
+ * not read is dropped ({@link withoutUnreadConstants}).
+ */
+export declare function evaluateFormula(expression: string, inputs: Readonly<Record<string, number>>, declared?: readonly string[]): number;
 /** Parse a catalog expression into a sign-preserving `ExprNode`, through the one MathTS parser. */
 export declare function parseCatalogExpression(expression: string): ExprNode;
 //# sourceMappingURL=expr-parse.d.ts.map

package/dist/bridges/expr-parse.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"expr-parse.d.ts","sourceRoot":"","sources":["../../src/bridges/expr-parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAoB,MAAM,6BAA6B,CAAC;AA+B9E,gFAAgF;AAChF,wBAAgB,YAAY,IAAI,WAAW,CAAC,MAAM,CAAC,CAMlD;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,MAAM,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAMlG;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEtE;AAED,4EAA4E;AAC5E,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACvC,MAAM,CAGR;AA+ED,mGAAmG;AACnG,wBAAgB,sBAAsB,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,CAGnE"}
+{"version":3,"file":"expr-parse.d.ts","sourceRoot":"","sources":["../../src/bridges/expr-parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAoB,MAAM,6BAA6B,CAAC;AAgC9E,gFAAgF;AAChF,wBAAgB,YAAY,IAAI,WAAW,CAAC,MAAM,CAAC,CAMlD;AAID,yFAAyF;AACzF,wBAAgB,oBAAoB,IAAI,WAAW,CAAC,MAAM,CAAC,CAE1D;AAID;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,MAAM,GAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM,EAC7C,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAWxB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAEtE;AAMD;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAOvE;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,GAC1B,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAYxB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,MAAM,CAUR;AA8FD,mGAAmG;AACnG,wBAAgB,sBAAsB,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,CAGnE"}

package/dist/bridges/expr-parse.js

@@ -10,12 +10,13 @@
  * @module bridges/expr-parse
  */
 import { DIMENSIONLESS } from '../dimensional/types.js';
-import { CONSTANTS } from '../dimensional/symbolic-constants.js';
+import { CONSTANTS, isRegisteredConstant } from '../dimensional/symbolic-constants.js';
 import { FORMULA_NAMED } from '../dimensional/formula-names.js';
 import { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';
 import { allQuantityRecords } from '../dimensional/quantity-registry.js';
 import { parseFormula } from '../numerical/formula-mathts.js';
 import { parseFormulaPNode } from '../numerical/formula-dimension.js';
+import { ConstantInputError } from './evaluation-errors.js';
 const TRANSCENDENTAL = new Set([
     'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',
 ]);
@@ -46,15 +47,33 @@ export function formulaNames() {
     names.add('pi');
     return names;
 }
-/** Numeric scope: constants, formula overlays, and π. Caller inputs overwrite. */
-export function formulaScope(inputs = {}) {
+const RESERVED = new Set(['pi', ...Object.keys(CONSTANTS), ...FORMULA_NAMED.map((named) => named.name)]);
+/** π, the registered constants and the formula overlays: names a caller may not bind. */
+export function reservedFormulaNames() {
+    return RESERVED;
+}
+const underscored = (name) => name.replace(/-/g, '_');
+/**
+ * Numeric scope: constants, formula overlays, and π, then the caller's inputs.
+ * An input whose name is reserved is refused with {@link ConstantInputError}
+ * unless `declared` names it: a relation's own source may carry a constant's
+ * name as a default the caller overrides (be-63's Lane-Emden ω₃).
+ * {@link evaluateFormula} first drops a reserved key its expression does not
+ * read; this builder refuses every undeclared one.
+ */
+export function formulaScope(inputs = {}, declared = []) {
     const scope = { pi: Math.PI };
     for (const [name, constant] of Object.entries(CONSTANTS))
         scope[name] = constant.value;
     for (const named of FORMULA_NAMED)
         scope[named.name] = named.value;
-    for (const [key, value] of Object.entries(inputs))
-        scope[key.replace(/-/g, '_')] = value;
+    const allowed = new Set(declared.map(underscored));
+    for (const [key, value] of Object.entries(inputs)) {
+        const name = underscored(key);
+        if (RESERVED.has(name) && !allowed.has(name))
+            throw new ConstantInputError(key);
+        scope[name] = value;
+    }
     return scope;
 }
 /**
@@ -65,15 +84,83 @@ export function formulaScope(inputs = {}) {
 export function formulaVariables(expression) {
     return parseFormula(rewriteCatalogHyphens(expression, formulaNames())).variables;
 }
-/** Evaluate a catalog expression with MathTS. Inputs are quantity names. */
-export function evaluateFormula(expression, inputs) {
+const VARIABLES = new Map();
+const IDENTIFIER = /[A-Za-z_][A-Za-z0-9_]*/g;
+/**
+ * The names a catalog expression mentions, each hyphenated quantity or
+ * constant spelling rewritten to its one token first (`truncation-coefficient-b`
+ * is `truncation_coefficient_b`, not `b`), π included (MathTS does not list it
+ * as a variable). Cached per expression text. `reduced-planck-constant` is
+ * `hbar`: the rewrite takes the longest spelling at each segment, so the
+ * declared `planck-constant` inside it does not win. The one identifier
+ * walk: the notices reader and the condition interpreter read it too.
+ * @internal
+ */
+export function expressionNames(expression) {
+    let names = VARIABLES.get(expression);
+    if (names === undefined) {
+        names = new Set(rewriteCatalogHyphens(expression, formulaNames()).match(IDENTIFIER) ?? []);
+        VARIABLES.set(expression, names);
+    }
+    return names;
+}
+/**
+ * `inputs` without the reserved keys that `reads` does not name. A reserved
+ * key the formula reads and `declared` does not name is refused: the caller's
+ * number would replace the constant. One the formula does not read is not an
+ * input of this formula; it is dropped, as any other extra key is on the
+ * graph path (a composed edge forwards every input to each component).
+ */
+export function withoutUnreadConstants(inputs, reads, declared) {
+    const allowed = new Set(declared.map(underscored));
+    const kept = {};
+    for (const [key, value] of Object.entries(inputs)) {
+        const name = underscored(key);
+        if (RESERVED.has(name) && !allowed.has(name)) {
+            if (reads.has(name))
+                throw new ConstantInputError(key);
+            continue;
+        }
+        kept[key] = value;
+    }
+    return kept;
+}
+/**
+ * Evaluate a catalog expression with MathTS. Inputs are quantity names.
+ * `declared` are the names the caller may bind although they are reserved
+ * (the relation's sources); a reserved key the expression reads and
+ * `declared` does not name is a {@link ConstantInputError}, and one it does
+ * not read is dropped ({@link withoutUnreadConstants}).
+ */
+export function evaluateFormula(expression, inputs, declared = []) {
+    // One grammar: the expression must also build a dimensional tree, so a function the tree
+    // does not know (`max`) or a call of the wrong arity is refused here too.
+    if (!GRAMMAR_CHECKED.has(expression)) {
+        parseCatalogExpression(expression);
+        GRAMMAR_CHECKED.add(expression);
+    }
     const rewritten = rewriteCatalogHyphens(expression, formulaNames());
-    return parseFormula(rewritten).evaluate(formulaScope(inputs));
+    const scope = formulaScope(withoutUnreadConstants(inputs, expressionNames(expression), declared), declared);
+    return parseFormula(rewritten).evaluate(scope);
+}
+const GRAMMAR_CHECKED = new Set();
+/** A literal exponent: a number, or a ratio of two numbers (`1/3`), folded to one literal. */
+function literalExponent(node) {
+    if (node.kind === 'num')
+        return numberSymbol(String(node.value));
+    if (node.kind === 'op' && node.op === '/' && node.args.length === 2) {
+        const [p, q] = node.args;
+        if (p.kind === 'num' && q.kind === 'num' && q.value !== 0)
+            return numberSymbol(String(p.value / q.value));
+    }
+    return undefined;
 }
 /**
  * The sign-preserving `ExprNode` of a normalized MathTS parse node. Unary minus
- * is `-1 ×`, `sqrt` is `^0.5`, and a transcendental keeps its name; a quantity
- * name written with underscores is restored to its hyphenated id.
+ * is `-1 ×`, `sqrt` is `^0.5`, a literal ratio exponent (`^(1/3)`) is one
+ * literal, and a transcendental keeps its name; a quantity name written with
+ * underscores is restored to its hyphenated id. A call takes exactly one
+ * argument: a second one is refused, never dropped.
  */
 function exprOf(node) {
     switch (node.kind) {
@@ -86,8 +173,10 @@ function exprOf(node) {
         case 'op':
             return { kind: 'op', op: node.op, args: node.args.map(exprOf) };
         case 'pow':
-            return { kind: 'op', op: '^', args: [exprOf(node.base), exprOf(node.exp)] };
+            return { kind: 'op', op: '^', args: [exprOf(node.base), literalExponent(node.exp) ?? exprOf(node.exp)] };
         case 'call': {
+            if (node.args.length !== 1)
+                throw new Error(`expression calls '${node.fn}' with ${node.args.length} arguments; one is expected`);
             const arg = exprOf(node.args[0]);
             if (node.fn === 'sqrt')
                 return { kind: 'op', op: '^', args: [arg, numberSymbol('0.5')] };
@@ -143,7 +232,7 @@ function foldKnownConstants(node) {
             right.name === 'pi' &&
             left.kind === 'symbol' &&
             /^(?:2|4|8)$/.test(left.name) &&
-            `${left.name}pi` in CONSTANTS) {
+            isRegisteredConstant(`${left.name}pi`)) {
             merged.push(symbol(`${left.name}pi`));
             i += 1;
             continue;

package/dist/bridges/expr-parse.js.map

@@ -1 +1 @@
-{"version":3,"file":"expr-parse.js","sourceRoot":"","sources":["../../src/bridges/expr-parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAExD,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAqB,MAAM,mCAAmC,CAAC;AAEzF,MAAM,cAAc,GAAG,IAAI,GAAG,CAAmB;IAC/C,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAC1E,CAAC,CAAC;AAEH,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,kBAAkB,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAEzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAC;AACjD,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE;IAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;AAC/E,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;IAAE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC9F,KAAK,MAAM,KAAK,IAAI,aAAa;IAAE,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAE1E,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC;AAChD,CAAC;AAED,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;AAC5D,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,YAAY;IAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,aAAa,CAAC,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,aAAa;QAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,YAAY,CAAC,MAAM,GAAqC,EAAE;IACxE,MAAM,KAAK,GAA2B,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;IACvF,KAAK,MAAM,KAAK,IAAI,aAAa;QAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACnE,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IACzF,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAkB;IACjD,OAAO,YAAY,CAAC,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnF,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,eAAe,CAC7B,UAAkB,EAClB,MAAwC;IAExC,MAAM,SAAS,GAAG,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC;IACpE,OAAO,YAAY,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,IAAkB;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC/E,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAClE,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC9E,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACzF,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnD,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAsB,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAsB,EAAE,GAAG,EAAE,CAAC;YAC7H,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,WAAmB;IACrC,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9C,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAC7C,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAc;IACxC,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG;YAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC;IACtD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACnF,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAC/C,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;IAC9D,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,MAAgB,EAAQ,EAAE;QACtC,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,IACE,KAAK,EAAE,IAAI,KAAK,QAAQ;YACxB,KAAK,CAAC,IAAI,KAAK,IAAI;YACnB,IAAI,CAAC,IAAI,KAAK,QAAQ;YACtB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC7B,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,SAAS,EAC7B,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;IAC3C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC/C,CAAC;AAED,mGAAmG;AACnG,MAAM,UAAU,sBAAsB,CAAC,UAAkB;IACvD,MAAM,SAAS,GAAG,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC;IACpE,OAAO,kBAAkB,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC"}
+{"version":3,"file":"expr-parse.js","sourceRoot":"","sources":["../../src/bridges/expr-parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,aAAa,EAAkB,MAAM,yBAAyB,CAAC;AAExE,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AACvF,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AACzE,OAAO,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAqB,MAAM,mCAAmC,CAAC;AACzF,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE5D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAmB;IAC/C,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAC1E,CAAC,CAAC;AAEH,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,kBAAkB,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAEzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAC;AACjD,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE;IAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;AAC/E,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;IAAE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC9F,KAAK,MAAM,KAAK,IAAI,aAAa;IAAE,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAE1E,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC;AAChD,CAAC;AAED,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;AAC5D,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,YAAY;IAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,aAAa,CAAC,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,aAAa;QAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAEjH,yFAAyF;AACzF,MAAM,UAAU,oBAAoB;IAClC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AAEtE;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAM,GAAqC,EAAE,EAC7C,QAAQ,GAAsB,EAAE;IAEhC,MAAM,KAAK,GAA2B,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;IACvF,KAAK,MAAM,KAAK,IAAI,aAAa;QAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;IACnD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAChF,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAkB;IACjD,OAAO,YAAY,CAAC,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AACnF,CAAC;AAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;AAEzD,MAAM,UAAU,GAAG,yBAAyB,CAAC;AAE7C;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB;IAChD,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,IAAI,GAAG,CAAC,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3F,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAwC,EACxC,KAA0B,EAC1B,QAA2B;IAE3B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;IACnD,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACpB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,UAAkB,EAClB,MAAwC,EACxC,QAAQ,GAAsB,EAAE;IAEhC,yFAAyF;IACzF,0EAA0E;IAC1E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACrC,sBAAsB,CAAC,UAAU,CAAC,CAAC;QACnC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,SAAS,GAAG,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,eAAe,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5G,OAAO,YAAY,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;AAE1C,8FAA8F;AAC9F,SAAS,eAAe,CAAC,IAAkB;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACjE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,IAAI,CAAE,CAAC,IAAI,KAAK,KAAK,IAAI,CAAE,CAAC,IAAI,KAAK,KAAK,IAAI,CAAE,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,YAAY,CAAC,MAAM,CAAC,CAAE,CAAC,KAAK,GAAG,CAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACjH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,MAAM,CAAC,IAAkB;IAChC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC/E,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAClE,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC3G,KAAK,MAAM,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,IAAI,CAAC,EAAE,UAAU,IAAI,CAAC,IAAI,CAAC,MAAM,6BAA6B,CAAC,CAAC;YACjI,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACzF,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YACnD,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAsB,CAAC;gBAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAsB,EAAE,GAAG,EAAE,CAAC;YAC7H,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,WAAmB;IACrC,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9C,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAC7C,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAc;IACxC,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG;YAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC;IACtD,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACnF,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IAC/C,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;IAC9D,MAAM,OAAO,GAAe,EAAE,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,MAAgB,EAAQ,EAAE;QACtC,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,IACE,KAAK,EAAE,IAAI,KAAK,QAAQ;YACxB,KAAK,CAAC,IAAI,KAAK,IAAI;YACnB,IAAI,CAAC,IAAI,KAAK,QAAQ;YACtB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC7B,oBAAoB,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,EACtC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAE,CAAC;IAC3C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC/C,CAAC;AAED,mGAAmG;AACnG,MAAM,UAAU,sBAAsB,CAAC,UAAkB;IACvD,MAAM,SAAS,GAAG,qBAAqB,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC;IACpE,OAAO,kBAAkB,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC","sourcesContent":["/**\n * One expression parser for a catalog formula: MathTS.\n *\n * Numeric evaluation is MathTS `parseFormula` on the hyphen-rewritten string,\n * and the dimensional `ExprNode` is built from the MathTS parse tree of the\n * same string, so the number and the tree can never disagree on precedence.\n * The `ExprNode` keeps hyphenated quantity names and unary minus, so symbolic\n * composition and dimensional checks see the same formula.\n *\n * @module bridges/expr-parse\n */\n\nimport { DIMENSIONLESS, type Dimension } from '../dimensional/types.js';\nimport type { ExprNode, TranscendentalFn } from '../dimensional/ast-types.js';\nimport { CONSTANTS, isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { FORMULA_NAMED } from '../dimensional/formula-names.js';\nimport { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';\nimport { allQuantityRecords } from '../dimensional/quantity-registry.js';\nimport { parseFormula } from '../numerical/formula-mathts.js';\nimport { parseFormulaPNode, type FormulaPNode } from '../numerical/formula-dimension.js';\nimport { ConstantInputError } from './evaluation-errors.js';\n\nconst TRANSCENDENTAL = new Set<TranscendentalFn>([\n  'exp', 'ln', 'log2', 'log10', 'sin', 'cos', 'tan', 'sinh', 'cosh', 'tanh',\n]);\n\nconst quantityNames = new Set(allQuantityRecords().map((row) => row.id));\n\nconst DIM_BY_NAME = new Map<string, Dimension>();\nfor (const row of allQuantityRecords()) DIM_BY_NAME.set(row.id, row.dimension);\nfor (const [name, constant] of Object.entries(CONSTANTS)) DIM_BY_NAME.set(name, constant.dim);\nfor (const named of FORMULA_NAMED) DIM_BY_NAME.set(named.name, named.dim);\n\nfunction dimOf(name: string): Dimension {\n  return DIM_BY_NAME.get(name) ?? DIMENSIONLESS;\n}\n\nfunction symbol(name: string): ExprNode {\n  return { kind: 'symbol', name, dim: dimOf(name) };\n}\n\nfunction numberSymbol(text: string): ExprNode {\n  return { kind: 'symbol', name: text, dim: DIMENSIONLESS };\n}\n\n/** Names a formula may mention: quantities, constants, and formula overlays. */\nexport function formulaNames(): ReadonlySet<string> {\n  const names = new Set<string>(quantityNames);\n  for (const name of Object.keys(CONSTANTS)) names.add(name);\n  for (const named of FORMULA_NAMED) names.add(named.name);\n  names.add('pi');\n  return names;\n}\n\nconst RESERVED = new Set<string>(['pi', ...Object.keys(CONSTANTS), ...FORMULA_NAMED.map((named) => named.name)]);\n\n/** π, the registered constants and the formula overlays: names a caller may not bind. */\nexport function reservedFormulaNames(): ReadonlySet<string> {\n  return RESERVED;\n}\n\nconst underscored = (name: string): string => name.replace(/-/g, '_');\n\n/**\n * Numeric scope: constants, formula overlays, and π, then the caller's inputs.\n * An input whose name is reserved is refused with {@link ConstantInputError}\n * unless `declared` names it: a relation's own source may carry a constant's\n * name as a default the caller overrides (be-63's Lane-Emden ω₃).\n * {@link evaluateFormula} first drops a reserved key its expression does not\n * read; this builder refuses every undeclared one.\n */\nexport function formulaScope(\n  inputs: Readonly<Record<string, number>> = {},\n  declared: readonly string[] = [],\n): Record<string, number> {\n  const scope: Record<string, number> = { pi: Math.PI };\n  for (const [name, constant] of Object.entries(CONSTANTS)) scope[name] = constant.value;\n  for (const named of FORMULA_NAMED) scope[named.name] = named.value;\n  const allowed = new Set(declared.map(underscored));\n  for (const [key, value] of Object.entries(inputs)) {\n    const name = underscored(key);\n    if (RESERVED.has(name) && !allowed.has(name)) throw new ConstantInputError(key);\n    scope[name] = value;\n  }\n  return scope;\n}\n\n/**\n * The free variables of a catalog expression, read from the same MathTS parse\n * {@link evaluateFormula} evaluates: the scope names it reads, a hyphenated\n * quantity written with underscores.\n */\nexport function formulaVariables(expression: string): readonly string[] {\n  return parseFormula(rewriteCatalogHyphens(expression, formulaNames())).variables;\n}\n\nconst VARIABLES = new Map<string, ReadonlySet<string>>();\n\nconst IDENTIFIER = /[A-Za-z_][A-Za-z0-9_]*/g;\n\n/**\n * The names a catalog expression mentions, each hyphenated quantity or\n * constant spelling rewritten to its one token first (`truncation-coefficient-b`\n * is `truncation_coefficient_b`, not `b`), π included (MathTS does not list it\n * as a variable). Cached per expression text. `reduced-planck-constant` is\n * `hbar`: the rewrite takes the longest spelling at each segment, so the\n * declared `planck-constant` inside it does not win. The one identifier\n * walk: the notices reader and the condition interpreter read it too.\n * @internal\n */\nexport function expressionNames(expression: string): ReadonlySet<string> {\n  let names = VARIABLES.get(expression);\n  if (names === undefined) {\n    names = new Set(rewriteCatalogHyphens(expression, formulaNames()).match(IDENTIFIER) ?? []);\n    VARIABLES.set(expression, names);\n  }\n  return names;\n}\n\n/**\n * `inputs` without the reserved keys that `reads` does not name. A reserved\n * key the formula reads and `declared` does not name is refused: the caller's\n * number would replace the constant. One the formula does not read is not an\n * input of this formula; it is dropped, as any other extra key is on the\n * graph path (a composed edge forwards every input to each component).\n */\nexport function withoutUnreadConstants(\n  inputs: Readonly<Record<string, number>>,\n  reads: ReadonlySet<string>,\n  declared: readonly string[],\n): Record<string, number> {\n  const allowed = new Set(declared.map(underscored));\n  const kept: Record<string, number> = {};\n  for (const [key, value] of Object.entries(inputs)) {\n    const name = underscored(key);\n    if (RESERVED.has(name) && !allowed.has(name)) {\n      if (reads.has(name)) throw new ConstantInputError(key);\n      continue;\n    }\n    kept[key] = value;\n  }\n  return kept;\n}\n\n/**\n * Evaluate a catalog expression with MathTS. Inputs are quantity names.\n * `declared` are the names the caller may bind although they are reserved\n * (the relation's sources); a reserved key the expression reads and\n * `declared` does not name is a {@link ConstantInputError}, and one it does\n * not read is dropped ({@link withoutUnreadConstants}).\n */\nexport function evaluateFormula(\n  expression: string,\n  inputs: Readonly<Record<string, number>>,\n  declared: readonly string[] = [],\n): number {\n  // One grammar: the expression must also build a dimensional tree, so a function the tree\n  // does not know (`max`) or a call of the wrong arity is refused here too.\n  if (!GRAMMAR_CHECKED.has(expression)) {\n    parseCatalogExpression(expression);\n    GRAMMAR_CHECKED.add(expression);\n  }\n  const rewritten = rewriteCatalogHyphens(expression, formulaNames());\n  const scope = formulaScope(withoutUnreadConstants(inputs, expressionNames(expression), declared), declared);\n  return parseFormula(rewritten).evaluate(scope);\n}\n\nconst GRAMMAR_CHECKED = new Set<string>();\n\n/** A literal exponent: a number, or a ratio of two numbers (`1/3`), folded to one literal. */\nfunction literalExponent(node: FormulaPNode): ExprNode | undefined {\n  if (node.kind === 'num') return numberSymbol(String(node.value));\n  if (node.kind === 'op' && node.op === '/' && node.args.length === 2) {\n    const [p, q] = node.args;\n    if (p!.kind === 'num' && q!.kind === 'num' && q!.value !== 0) return numberSymbol(String(p!.value / q!.value));\n  }\n  return undefined;\n}\n\n/**\n * The sign-preserving `ExprNode` of a normalized MathTS parse node. Unary minus\n * is `-1 ×`, `sqrt` is `^0.5`, a literal ratio exponent (`^(1/3)`) is one\n * literal, and a transcendental keeps its name; a quantity name written with\n * underscores is restored to its hyphenated id. A call takes exactly one\n * argument: a second one is refused, never dropped.\n */\nfunction exprOf(node: FormulaPNode): ExprNode {\n  switch (node.kind) {\n    case 'num':\n      return numberSymbol(String(node.value));\n    case 'sym':\n      return symbol(hyphenName(node.name));\n    case 'neg':\n      return { kind: 'op', op: '*', args: [numberSymbol('-1'), exprOf(node.arg)] };\n    case 'op':\n      return { kind: 'op', op: node.op, args: node.args.map(exprOf) };\n    case 'pow':\n      return { kind: 'op', op: '^', args: [exprOf(node.base), literalExponent(node.exp) ?? exprOf(node.exp)] };\n    case 'call': {\n      if (node.args.length !== 1) throw new Error(`expression calls '${node.fn}' with ${node.args.length} arguments; one is expected`);\n      const arg = exprOf(node.args[0]!);\n      if (node.fn === 'sqrt') return { kind: 'op', op: '^', args: [arg, numberSymbol('0.5')] };\n      if (node.fn === 'abs') return { kind: 'abs', arg };\n      if (TRANSCENDENTAL.has(node.fn as TranscendentalFn)) return { kind: 'transcendental', fn: node.fn as TranscendentalFn, arg };\n      throw new Error(`expression calls an unknown function '${node.fn}'`);\n    }\n  }\n}\n\nfunction hyphenName(underscored: string): string {\n  const hyphen = underscored.replace(/_/g, '-');\n  if (quantityNames.has(hyphen)) return hyphen;\n  return underscored;\n}\n\n/**\n * `8*pi` is the constant `8pi`, and `ln(2)` is the constant `ln2`. A product\n * flattens so the tree matches a flat canonical product of the same factors.\n */\nfunction foldKnownConstants(node: ExprNode): ExprNode {\n  if (node.kind === 'transcendental') {\n    const arg = foldKnownConstants(node.arg);\n    if (node.fn === 'ln' && arg.kind === 'symbol' && arg.name === '2') return symbol('ln2');\n    return { kind: 'transcendental', fn: node.fn, arg };\n  }\n  if (node.kind === 'abs') return { kind: 'abs', arg: foldKnownConstants(node.arg) };\n  if (node.kind !== 'op') return node;\n  const args = node.args.map(foldKnownConstants);\n  if (node.op !== '*') return { kind: 'op', op: node.op, args };\n  const factors: ExprNode[] = [];\n  const push = (factor: ExprNode): void => {\n    if (factor.kind === 'op' && factor.op === '*') {\n      for (const inner of factor.args) push(inner);\n    } else {\n      factors.push(factor);\n    }\n  };\n  for (const arg of args) push(arg);\n  const merged: ExprNode[] = [];\n  for (let i = 0; i < factors.length; i++) {\n    const left = factors[i]!;\n    const right = factors[i + 1];\n    if (\n      right?.kind === 'symbol' &&\n      right.name === 'pi' &&\n      left.kind === 'symbol' &&\n      /^(?:2|4|8)$/.test(left.name) &&\n      isRegisteredConstant(`${left.name}pi`)\n    ) {\n      merged.push(symbol(`${left.name}pi`));\n      i += 1;\n      continue;\n    }\n    merged.push(left);\n  }\n  if (merged.length === 1) return merged[0]!;\n  return { kind: 'op', op: '*', args: merged };\n}\n\n/** Parse a catalog expression into a sign-preserving `ExprNode`, through the one MathTS parser. */\nexport function parseCatalogExpression(expression: string): ExprNode {\n  const rewritten = rewriteCatalogHyphens(expression, formulaNames());\n  return foldKnownConstants(exprOf(parseFormulaPNode(rewritten)));\n}\n"]}

package/dist/bridges/holds.d.ts

@@ -18,9 +18,45 @@ export declare class HoldsError extends Error {
     constructor(message: string);
 }
 /**
- * Whether `holds` is true for `values`.
- * Hyphenated quantity names are rewritten with `names` before parsing; an
- * unbound name, a non-boolean result, and a syntax error are a {@link HoldsError}.
+ * One conjunct of a validity condition: the text it is written in (the
+ * relation's own names), the names it reads, and its test.
+ * @internal
  */
-export declare function holds(source: string, values: Readonly<Record<string, number>>, constants: Readonly<Record<string, number>>, names: readonly string[]): boolean;
+export interface HoldsCondition {
+    /** The conjunct as the condition states it, in the relation's names (`swing-kelvin >= 0`). */
+    readonly text: string;
+    /** The names it reads, in order of first use, as the relation spells them. */
+    readonly names: readonly string[];
+    /** True when the conjunct holds; a name it cannot bind, or a non-boolean result, throws {@link HoldsError}. */
+    test(scope: Readonly<Record<string, number>>): boolean;
+}
+/**
+ * The conjuncts of the condition `source`, each testable alone. Their
+ * conjunction is the condition, so a caller that tests them all decides
+ * exactly what {@link holds} decides, and can say which part failed.
+ * Hyphenated names are rewritten with `names` before parsing and restored in
+ * each conjunct's `text` and `names`.
+ * @internal
+ */
+export declare function holdsConditions(source: string, names: readonly string[]): readonly HoldsCondition[];
+/** The names (hyphens written as underscores) the conditions read. @internal */
+export declare function conditionReads(conditions: readonly HoldsCondition[]): ReadonlySet<string>;
+/**
+ * A scope for a condition: the constants, then `values` with hyphens written as
+ * underscores. A value whose name is a constant that `declared` does not name
+ * is a {@link ConstantInputError} when `reads` holds it, and is dropped otherwise.
+ * @internal
+ */
+export declare function holdsScope(values: Readonly<Record<string, number>>, constants: Readonly<Record<string, number>>, reads: ReadonlySet<string>, declared?: readonly string[]): Record<string, number>;
+/**
+ * Whether `holds` is true for `values`: every conjunct of
+ * {@link holdsConditions} holds. Hyphenated quantity names are rewritten with
+ * `names` before parsing; an unbound name, a non-boolean result, and a syntax
+ * error are a {@link HoldsError}.
+ * A value whose name is one of `constants` and which the condition reads is
+ * a {@link ConstantInputError}, a caller error and not a false condition,
+ * unless `declared` names it; one the condition does not read is dropped, as
+ * any other extra key is.
+ */
+export declare function holds(source: string, values: Readonly<Record<string, number>>, constants: Readonly<Record<string, number>>, names: readonly string[], declared?: readonly string[]): boolean;
 //# sourceMappingURL=holds.d.ts.map

package/dist/bridges/holds.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"holds.d.ts","sourceRoot":"","sources":["../../src/bridges/holds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,4GAA4G;AAC5G,qBAAa,UAAW,SAAQ,KAAK;IACnC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAwHD;;;;GAIG;AACH,wBAAgB,KAAK,CACnB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC3C,KAAK,EAAE,SAAS,MAAM,EAAE,GACvB,OAAO,CAOT"}
+{"version":3,"file":"holds.d.ts","sourceRoot":"","sources":["../../src/bridges/holds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAOH,4GAA4G;AAC5G,qBAAa,UAAW,SAAQ,KAAK;IACnC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAwGD;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,8FAA8F;IAC9F,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,+GAA+G;IAC/G,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC;CACxD;AA4DD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,cAAc,EAAE,CA2BnG;AAED,gFAAgF;AAChF,wBAAgB,cAAc,CAAC,UAAU,EAAE,SAAS,cAAc,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAEzF;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC3C,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAYxB;AAED;;;;;;;;;GASG;AACH,wBAAgB,KAAK,CACnB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACxC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC3C,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,OAAO,CAIT"}

package/dist/bridges/holds.js

@@ -15,6 +15,8 @@
  */
 import { parse as parseMathTs } from '@danielsimonjr/mathts-functions';
 import { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';
+import { ConstantInputError } from './evaluation-errors.js';
+import { expressionNames } from './expr-parse.js';
 /** A condition could not be evaluated: it names an unbound symbol, or its text does not parse. @internal */
 export class HoldsError extends Error {
     constructor(message) {
@@ -111,35 +113,142 @@ function compile(node, source) {
             return arithmetic(node, source);
     }
 }
-const COMPILED = new Map();
-function compiled(rewritten, source) {
-    const hit = COMPILED.get(rewritten);
+/**
+ * The conjuncts of `node`: an `and` splits, `not (not X)` is X, `not (A or B)` is
+ * `not A` and `not B`, and `not (x == y)` is `x != y`. Each rewrite is exact, so
+ * the conjunction of the parts is the condition. Anything else is one conjunct.
+ */
+function conjuncts(node) {
+    if (node.type === 'ParenthesisNode')
+        return conjuncts(node.content);
+    if (node.type === 'OperatorNode' && node.op === 'and')
+        return (node.args ?? []).flatMap(conjuncts);
+    if (node.type === 'OperatorNode' && node.op === 'not') {
+        let inner = node.args[0];
+        while (inner.type === 'ParenthesisNode')
+            inner = inner.content;
+        if (inner.type === 'OperatorNode' && inner.op === 'not')
+            return conjuncts(inner.args[0]);
+        if (inner.type === 'OperatorNode' && inner.op === 'or')
+            return (inner.args ?? []).flatMap((arg) => conjuncts(negation(arg)));
+        if (inner.type === 'OperatorNode' && inner.op === '==')
+            return [withOperator(inner, '!=')];
+    }
+    return [node];
+}
+/** `not X` as a node, so the rewrite above can recurse into it. */
+function negation(node) {
+    return parseMathTs(`not (${node.toString()})`);
+}
+/** `a op b` with the same operands. */
+function withOperator(node, op) {
+    const [a, b] = node.args;
+    return parseMathTs(`${a.toString()} ${op} ${b.toString()}`);
+}
+/** The symbol names a node reads, in order, without functions. */
+function symbolNames(node) {
+    const out = [];
+    const visit = (n) => {
+        if (n.type === 'SymbolNode' && n.name !== undefined) {
+            if (!out.includes(n.name))
+                out.push(n.name);
+            return;
+        }
+        if (n.type === 'ParenthesisNode')
+            visit(n.content);
+        for (const arg of n.args ?? [])
+            visit(arg);
+    };
+    visit(node);
+    return out;
+}
+/**
+ * Replace each identifier `text` mentions through `rename`, whole-word, in one
+ * pass (a renamed word is never renamed again). The identifiers are the ones
+ * `expressionNames` reads (the text is a printed conjunct, already written
+ * with underscores, so the rewrite it applies is the identity on it).
+ */
+function renameIdentifiers(text, rename) {
+    const names = expressionNames(text);
+    return text.replace(/[A-Za-z_][A-Za-z0-9_]*/g, (word) => (names.has(word) ? rename(word) : word));
+}
+const CONDITIONS = new Map();
+/**
+ * The conjuncts of the condition `source`, each testable alone. Their
+ * conjunction is the condition, so a caller that tests them all decides
+ * exactly what {@link holds} decides, and can say which part failed.
+ * Hyphenated names are rewritten with `names` before parsing and restored in
+ * each conjunct's `text` and `names`.
+ * @internal
+ */
+export function holdsConditions(source, names) {
+    const rewritten = rewriteCatalogHyphens(source, names);
+    const hit = CONDITIONS.get(rewritten);
     if (hit !== undefined)
         return hit;
-    let node;
+    let root;
     try {
-        node = parseMathTs(rewritten);
+        root = parseMathTs(rewritten);
     }
     catch (error) {
         throw new HoldsError(`${error instanceof Error ? error.message : String(error)} in ${source}`);
     }
-    const fn = compile(node, source);
-    COMPILED.set(rewritten, fn);
-    return fn;
+    const spelled = new Map(names.map((name) => [name.replace(/-/g, '_'), name]));
+    const restore = (name) => spelled.get(name) ?? name;
+    const parts = conjuncts(root).map((node) => {
+        const text = renameIdentifiers(node.toString(), restore);
+        const fn = compile(node, text);
+        return {
+            text,
+            names: symbolNames(node).map(restore),
+            test: (scope) => {
+                const result = fn({ ...scope });
+                if (typeof result !== 'boolean')
+                    throw new HoldsError(`condition is not boolean: ${text}`);
+                return result;
+            },
+        };
+    });
+    CONDITIONS.set(rewritten, parts);
+    return parts;
+}
+/** The names (hyphens written as underscores) the conditions read. @internal */
+export function conditionReads(conditions) {
+    return new Set(conditions.flatMap((condition) => condition.names.map((name) => name.replace(/-/g, '_'))));
 }
 /**
- * Whether `holds` is true for `values`.
- * Hyphenated quantity names are rewritten with `names` before parsing; an
- * unbound name, a non-boolean result, and a syntax error are a {@link HoldsError}.
+ * A scope for a condition: the constants, then `values` with hyphens written as
+ * underscores. A value whose name is a constant that `declared` does not name
+ * is a {@link ConstantInputError} when `reads` holds it, and is dropped otherwise.
+ * @internal
  */
-export function holds(source, values, constants, names) {
-    const rewritten = rewriteCatalogHyphens(source, names);
+export function holdsScope(values, constants, reads, declared = []) {
     const scope = { ...constants };
-    for (const [key, value] of Object.entries(values))
-        scope[key.replace(/-/g, '_')] = value;
-    const result = compiled(rewritten, source)(scope);
-    if (typeof result !== 'boolean')
-        throw new HoldsError(`condition is not boolean: ${source}`);
-    return result;
+    const allowed = new Set(declared.map((name) => name.replace(/-/g, '_')));
+    for (const [key, value] of Object.entries(values)) {
+        const name = key.replace(/-/g, '_');
+        if (name in constants && !allowed.has(name)) {
+            if (reads.has(name))
+                throw new ConstantInputError(key);
+            continue;
+        }
+        scope[name] = value;
+    }
+    return scope;
+}
+/**
+ * Whether `holds` is true for `values`: every conjunct of
+ * {@link holdsConditions} holds. Hyphenated quantity names are rewritten with
+ * `names` before parsing; an unbound name, a non-boolean result, and a syntax
+ * error are a {@link HoldsError}.
+ * A value whose name is one of `constants` and which the condition reads is
+ * a {@link ConstantInputError}, a caller error and not a false condition,
+ * unless `declared` names it; one the condition does not read is dropped, as
+ * any other extra key is.
+ */
+export function holds(source, values, constants, names, declared = []) {
+    const conditions = holdsConditions(source, names);
+    const scope = holdsScope(values, constants, conditionReads(conditions), declared);
+    return conditions.every((condition) => condition.test(scope));
 }
 //# sourceMappingURL=holds.js.map

package/dist/bridges/holds.js.map

@@ -1 +1 @@
-{"version":3,"file":"holds.js","sourceRoot":"","sources":["../../src/bridges/holds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAEvE,4GAA4G;AAC5G,MAAM,OAAO,UAAW,SAAQ,KAAK;IACnC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IAC3B,CAAC;CACF;AAiBD,MAAM,WAAW,GAAgE;IAC/E,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACpB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;IACtB,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACpB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;IACtB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;CACxB,CAAC;AAEF,MAAM,UAAU,GAAqD;IACnE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;CACtC,CAAC;AAEF,SAAS,YAAY,CAAC,IAAc;IAClC,OAAO,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;AACpF,CAAC;AAED,mFAAmF;AACnF,SAAS,UAAU,CAAC,IAAc,EAAE,MAAc;IAChD,OAAO,CAAC,KAAK,EAAE,EAAE;QACf,IAAI,CAAU,CAAC;QACf,IAAI,CAAC;YACH,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,MAAM,EAAE,CAAC,CAAC;QACjG,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,IAAI,CAAC,QAAQ,EAAE,OAAO,MAAM,EAAE,CAAC,CAAC;QAC5G,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,IAAc,EAAE,MAAc;IAC7C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,iBAAiB;YACpB,OAAO,OAAO,CAAC,IAAI,CAAC,OAAQ,EAAE,MAAM,CAAC,CAAC;QACxC,KAAK,cAAc;YACjB,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS;gBAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAgB,CAAC;YACxE,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAClD,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;wBAAE,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,oBAAoB,MAAM,EAAE,CAAC,CAAC;oBACzG,OAAO,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrE,CAAC,CAAC;YACJ,CAAC;YACD,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;gBACjB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;gBACxC,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;oBACvB,IAAI,OAAO,CAAC,KAAK,SAAS;wBAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;oBACnF,OAAO,CAAC,CAAC,CAAC;gBACZ,CAAC,CAAC;YACJ,CAAC;YACD,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC1D,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,IAAK,CAAC,KAAK,CAAC,CAAC;oBACvB,MAAM,CAAC,GAAG,KAAM,CAAC,KAAK,CAAC,CAAC;oBACxB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;wBAAE,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,qBAAqB,MAAM,EAAE,CAAC,CAAC;oBAC9G,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;YACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;gBAC5C,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;oBACrB,IAAI,OAAO,CAAC,KAAK,QAAQ;wBAAE,MAAM,IAAI,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,oBAAoB,MAAM,EAAE,CAAC,CAAC;oBACnG,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QACD;YACE,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;AACH,CAAC;AAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;AAE7C,SAAS,QAAQ,CAAC,SAAiB,EAAE,MAAc;IACjD,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAClC,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,WAAW,CAAC,SAAS,CAAwB,CAAC;IACvD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,MAAM,EAAE,CAAC,CAAC;IACjG,CAAC;IACD,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAC5B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CACnB,MAAc,EACd,MAAwC,EACxC,SAA2C,EAC3C,KAAwB;IAExB,MAAM,SAAS,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvD,MAAM,KAAK,GAAU,EAAE,GAAG,SAAS,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IACzF,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,OAAO,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,MAAM,EAAE,CAAC,CAAC;IAC7F,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"holds.js","sourceRoot":"","sources":["../../src/bridges/holds.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,4GAA4G;AAC5G,MAAM,OAAO,UAAW,SAAQ,KAAK;IACnC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IAC3B,CAAC;CACF;AAiBD,MAAM,WAAW,GAAgE;IAC/E,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACpB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;IACtB,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;IACpB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;IACtB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IACvB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;CACxB,CAAC;AAEF,MAAM,UAAU,GAAqD;IACnE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;CACtC,CAAC;AAEF,SAAS,YAAY,CAAC,IAAc;IAClC,OAAO,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;AACpF,CAAC;AAED,mFAAmF;AACnF,SAAS,UAAU,CAAC,IAAc,EAAE,MAAc;IAChD,OAAO,CAAC,KAAK,EAAE,EAAE;QACf,IAAI,CAAU,CAAC;QACf,IAAI,CAAC;YACH,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,MAAM,EAAE,CAAC,CAAC;QACjG,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,IAAI,CAAC,QAAQ,EAAE,OAAO,MAAM,EAAE,CAAC,CAAC;QAC5G,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,IAAc,EAAE,MAAc;IAC7C,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,iBAAiB;YACpB,OAAO,OAAO,CAAC,IAAI,CAAC,OAAQ,EAAE,MAAM,CAAC,CAAC;QACxC,KAAK,cAAc;YACjB,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS;gBAAE,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,KAAgB,CAAC;YACxE,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAClD,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC1C,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;wBAAE,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,oBAAoB,MAAM,EAAE,CAAC,CAAC;oBACzG,OAAO,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrE,CAAC,CAAC;YACJ,CAAC;YACD,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;gBACjB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;gBACxC,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;oBACvB,IAAI,OAAO,CAAC,KAAK,SAAS;wBAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,MAAM,EAAE,CAAC,CAAC;oBACnF,OAAO,CAAC,CAAC,CAAC;gBACZ,CAAC,CAAC;YACJ,CAAC;YACD,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC1D,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,IAAK,CAAC,KAAK,CAAC,CAAC;oBACvB,MAAM,CAAC,GAAG,KAAM,CAAC,KAAK,CAAC,CAAC;oBACxB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;wBAAE,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,qBAAqB,MAAM,EAAE,CAAC,CAAC;oBAC9G,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;YACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC;gBAC5C,OAAO,CAAC,KAAK,EAAE,EAAE;oBACf,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;oBACrB,IAAI,OAAO,CAAC,KAAK,QAAQ;wBAAE,MAAM,IAAI,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,oBAAoB,MAAM,EAAE,CAAC,CAAC;oBACnG,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QACD;YACE,OAAO,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;AACH,CAAC;AAiBD;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAAc;IAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB;QAAE,OAAO,SAAS,CAAC,IAAI,CAAC,OAAQ,CAAC,CAAC;IACrE,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACnG,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;QACtD,IAAI,KAAK,GAAG,IAAI,CAAC,IAAK,CAAC,CAAC,CAAE,CAAC;QAC3B,OAAO,KAAK,CAAC,IAAI,KAAK,iBAAiB;YAAE,KAAK,GAAG,KAAK,CAAC,OAAQ,CAAC;QAChE,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,IAAI,KAAK,CAAC,EAAE,KAAK,KAAK;YAAE,OAAO,SAAS,CAAC,KAAK,CAAC,IAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3F,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI;YAAE,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7H,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI;YAAE,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,mEAAmE;AACnE,SAAS,QAAQ,CAAC,IAAc;IAC9B,OAAO,WAAW,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAwB,CAAC;AACxE,CAAC;AAED,uCAAuC;AACvC,SAAS,YAAY,CAAC,IAAc,EAAE,EAAU;IAC9C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,IAAK,CAAC;IAC1B,OAAO,WAAW,CAAC,GAAG,CAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAE,CAAC,QAAQ,EAAE,EAAE,CAAwB,CAAC;AACvF,CAAC;AAED,kEAAkE;AAClE,SAAS,WAAW,CAAC,IAAc;IACjC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,CAAC,CAAW,EAAQ,EAAE;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACpD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5C,OAAO;QACT,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,iBAAiB;YAAE,KAAK,CAAC,CAAC,CAAC,OAAQ,CAAC,CAAC;QACpD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,IAAY,EAAE,MAAgC;IACvE,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC,OAAO,CAAC,yBAAyB,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACpG,CAAC;AAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqC,CAAC;AAEhE;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,KAAwB;IACtE,MAAM,SAAS,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvD,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACtC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAClC,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,WAAW,CAAC,SAAS,CAAwB,CAAC;IACvD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,MAAM,EAAE,CAAC,CAAC;IACjG,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IACpE,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAkB,EAAE;QACzD,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,CAAC;QACzD,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC/B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;YACrC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE;gBACd,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;gBAChC,IAAI,OAAO,MAAM,KAAK,SAAS;oBAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,IAAI,EAAE,CAAC,CAAC;gBAC3F,OAAO,MAAM,CAAC;YAChB,CAAC;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACjC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,cAAc,CAAC,UAAqC;IAClE,OAAO,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5G,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CACxB,MAAwC,EACxC,SAA2C,EAC3C,KAA0B,EAC1B,QAAQ,GAAsB,EAAE;IAEhC,MAAM,KAAK,GAA2B,EAAE,GAAG,SAAS,EAAE,CAAC;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpC,IAAI,IAAI,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,KAAK,CACnB,MAAc,EACd,MAAwC,EACxC,SAA2C,EAC3C,KAAwB,EACxB,QAAQ,GAAsB,EAAE;IAEhC,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,cAAc,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;IAClF,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAChE,CAAC","sourcesContent":["/**\n * Interpreter for a catalog validity condition.\n *\n * A condition is a boolean expression over quantity names, the registered\n * constants, `isFinite` and `isInteger`, written in MathTS's grammar\n * (`and`, `or`, `not`, `<`, `<=`, `>`, `>=`, `==`, `!=`). MathTS parses it,\n * and MathTS evaluates every arithmetic sub-expression. The comparisons and\n * the logical operators are evaluated here, exactly: MathTS's own comparison\n * operators are tolerance-based (`absTol` 1e-15), so under them `1e-18 > 0`\n * is false, which no condition over SI magnitudes can accept.\n *\n * It is not JavaScript `eval`.\n *\n * @module bridges/holds\n */\n\nimport { parse as parseMathTs } from '@danielsimonjr/mathts-functions';\nimport { rewriteCatalogHyphens } from '../dimensional/hyphen-names.js';\nimport { ConstantInputError } from './evaluation-errors.js';\nimport { expressionNames } from './expr-parse.js';\n\n/** A condition could not be evaluated: it names an unbound symbol, or its text does not parse. @internal */\nexport class HoldsError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'HoldsError';\n  }\n}\n\n/** The MathTS node shape this interpreter reads. */\ninterface MathNode {\n  readonly type: string;\n  readonly op?: string;\n  readonly fn?: string | { readonly name?: string };\n  readonly name?: string;\n  readonly value?: unknown;\n  readonly args?: readonly MathNode[];\n  readonly content?: MathNode;\n  evaluate(scope: Record<string, unknown>): unknown;\n}\n\ntype Scope = Record<string, number>;\ntype Compiled = (scope: Scope) => boolean | number;\n\nconst COMPARISONS: Readonly<Record<string, (a: number, b: number) => boolean>> = {\n  '<': (a, b) => a < b,\n  '<=': (a, b) => a <= b,\n  '>': (a, b) => a > b,\n  '>=': (a, b) => a >= b,\n  '==': (a, b) => a === b,\n  '!=': (a, b) => a !== b,\n};\n\nconst PREDICATES: Readonly<Record<string, (x: number) => boolean>> = {\n  isFinite: (x) => Number.isFinite(x),\n  isInteger: (x) => Number.isInteger(x),\n};\n\nfunction functionName(node: MathNode): string {\n  return typeof node.fn === 'string' ? node.fn : (node.fn?.name ?? node.name ?? '');\n}\n\n/** Evaluate an arithmetic sub-tree through MathTS; the result must be a number. */\nfunction arithmetic(node: MathNode, source: string): Compiled {\n  return (scope) => {\n    let v: unknown;\n    try {\n      v = node.evaluate(scope);\n    } catch (error) {\n      throw new HoldsError(`${error instanceof Error ? error.message : String(error)} in ${source}`);\n    }\n    if (typeof v !== 'number') throw new HoldsError(`operand is not a number: ${node.toString()} in ${source}`);\n    return v;\n  };\n}\n\nfunction compile(node: MathNode, source: string): Compiled {\n  switch (node.type) {\n    case 'ParenthesisNode':\n      return compile(node.content!, source);\n    case 'ConstantNode':\n      if (typeof node.value === 'boolean') return () => node.value as boolean;\n      return arithmetic(node, source);\n    case 'OperatorNode': {\n      const op = node.op ?? '';\n      const args = node.args ?? [];\n      if (op === 'and' || op === 'or') {\n        const parts = args.map((a) => compile(a, source));\n        return (scope) => {\n          const values = parts.map((p) => p(scope));\n          if (values.some((v) => typeof v !== 'boolean')) throw new HoldsError(`'${op}' of a number in ${source}`);\n          return op === 'and' ? values.every(Boolean) : values.some(Boolean);\n        };\n      }\n      if (op === 'not') {\n        const inner = compile(args[0]!, source);\n        return (scope) => {\n          const v = inner(scope);\n          if (typeof v !== 'boolean') throw new HoldsError(`'not' of a number in ${source}`);\n          return !v;\n        };\n      }\n      const compare = COMPARISONS[op];\n      if (compare !== undefined) {\n        const [left, right] = args.map((a) => compile(a, source));\n        return (scope) => {\n          const a = left!(scope);\n          const b = right!(scope);\n          if (typeof a !== 'number' || typeof b !== 'number') throw new HoldsError(`'${op}' of a boolean in ${source}`);\n          return compare(a, b);\n        };\n      }\n      return arithmetic(node, source);\n    }\n    case 'FunctionNode': {\n      const predicate = PREDICATES[functionName(node)];\n      if (predicate !== undefined) {\n        const arg = compile(node.args![0]!, source);\n        return (scope) => {\n          const v = arg(scope);\n          if (typeof v !== 'number') throw new HoldsError(`${functionName(node)} of a boolean in ${source}`);\n          return predicate(v);\n        };\n      }\n      return arithmetic(node, source);\n    }\n    default:\n      return arithmetic(node, source);\n  }\n}\n\n/**\n * One conjunct of a validity condition: the text it is written in (the\n * relation's own names), the names it reads, and its test.\n * @internal\n */\nexport interface HoldsCondition {\n  /** The conjunct as the condition states it, in the relation's names (`swing-kelvin >= 0`). */\n  readonly text: string;\n  /** The names it reads, in order of first use, as the relation spells them. */\n  readonly names: readonly string[];\n  /** True when the conjunct holds; a name it cannot bind, or a non-boolean result, throws {@link HoldsError}. */\n  test(scope: Readonly<Record<string, number>>): boolean;\n}\n\n\n/**\n * The conjuncts of `node`: an `and` splits, `not (not X)` is X, `not (A or B)` is\n * `not A` and `not B`, and `not (x == y)` is `x != y`. Each rewrite is exact, so\n * the conjunction of the parts is the condition. Anything else is one conjunct.\n */\nfunction conjuncts(node: MathNode): MathNode[] {\n  if (node.type === 'ParenthesisNode') return conjuncts(node.content!);\n  if (node.type === 'OperatorNode' && node.op === 'and') return (node.args ?? []).flatMap(conjuncts);\n  if (node.type === 'OperatorNode' && node.op === 'not') {\n    let inner = node.args![0]!;\n    while (inner.type === 'ParenthesisNode') inner = inner.content!;\n    if (inner.type === 'OperatorNode' && inner.op === 'not') return conjuncts(inner.args![0]!);\n    if (inner.type === 'OperatorNode' && inner.op === 'or') return (inner.args ?? []).flatMap((arg) => conjuncts(negation(arg)));\n    if (inner.type === 'OperatorNode' && inner.op === '==') return [withOperator(inner, '!=')];\n  }\n  return [node];\n}\n\n/** `not X` as a node, so the rewrite above can recurse into it. */\nfunction negation(node: MathNode): MathNode {\n  return parseMathTs(`not (${node.toString()})`) as unknown as MathNode;\n}\n\n/** `a op b` with the same operands. */\nfunction withOperator(node: MathNode, op: string): MathNode {\n  const [a, b] = node.args!;\n  return parseMathTs(`${a!.toString()} ${op} ${b!.toString()}`) as unknown as MathNode;\n}\n\n/** The symbol names a node reads, in order, without functions. */\nfunction symbolNames(node: MathNode): string[] {\n  const out: string[] = [];\n  const visit = (n: MathNode): void => {\n    if (n.type === 'SymbolNode' && n.name !== undefined) {\n      if (!out.includes(n.name)) out.push(n.name);\n      return;\n    }\n    if (n.type === 'ParenthesisNode') visit(n.content!);\n    for (const arg of n.args ?? []) visit(arg);\n  };\n  visit(node);\n  return out;\n}\n\n/**\n * Replace each identifier `text` mentions through `rename`, whole-word, in one\n * pass (a renamed word is never renamed again). The identifiers are the ones\n * `expressionNames` reads (the text is a printed conjunct, already written\n * with underscores, so the rewrite it applies is the identity on it).\n */\nfunction renameIdentifiers(text: string, rename: (name: string) => string): string {\n  const names = expressionNames(text);\n  return text.replace(/[A-Za-z_][A-Za-z0-9_]*/g, (word) => (names.has(word) ? rename(word) : word));\n}\n\nconst CONDITIONS = new Map<string, readonly HoldsCondition[]>();\n\n/**\n * The conjuncts of the condition `source`, each testable alone. Their\n * conjunction is the condition, so a caller that tests them all decides\n * exactly what {@link holds} decides, and can say which part failed.\n * Hyphenated names are rewritten with `names` before parsing and restored in\n * each conjunct's `text` and `names`.\n * @internal\n */\nexport function holdsConditions(source: string, names: readonly string[]): readonly HoldsCondition[] {\n  const rewritten = rewriteCatalogHyphens(source, names);\n  const hit = CONDITIONS.get(rewritten);\n  if (hit !== undefined) return hit;\n  let root: MathNode;\n  try {\n    root = parseMathTs(rewritten) as unknown as MathNode;\n  } catch (error) {\n    throw new HoldsError(`${error instanceof Error ? error.message : String(error)} in ${source}`);\n  }\n  const spelled = new Map(names.map((name) => [name.replace(/-/g, '_'), name]));\n  const restore = (name: string): string => spelled.get(name) ?? name;\n  const parts = conjuncts(root).map((node): HoldsCondition => {\n    const text = renameIdentifiers(node.toString(), restore);\n    const fn = compile(node, text);\n    return {\n      text,\n      names: symbolNames(node).map(restore),\n      test: (scope) => {\n        const result = fn({ ...scope });\n        if (typeof result !== 'boolean') throw new HoldsError(`condition is not boolean: ${text}`);\n        return result;\n      },\n    };\n  });\n  CONDITIONS.set(rewritten, parts);\n  return parts;\n}\n\n/** The names (hyphens written as underscores) the conditions read. @internal */\nexport function conditionReads(conditions: readonly HoldsCondition[]): ReadonlySet<string> {\n  return new Set(conditions.flatMap((condition) => condition.names.map((name) => name.replace(/-/g, '_'))));\n}\n\n/**\n * A scope for a condition: the constants, then `values` with hyphens written as\n * underscores. A value whose name is a constant that `declared` does not name\n * is a {@link ConstantInputError} when `reads` holds it, and is dropped otherwise.\n * @internal\n */\nexport function holdsScope(\n  values: Readonly<Record<string, number>>,\n  constants: Readonly<Record<string, number>>,\n  reads: ReadonlySet<string>,\n  declared: readonly string[] = [],\n): Record<string, number> {\n  const scope: Record<string, number> = { ...constants };\n  const allowed = new Set(declared.map((name) => name.replace(/-/g, '_')));\n  for (const [key, value] of Object.entries(values)) {\n    const name = key.replace(/-/g, '_');\n    if (name in constants && !allowed.has(name)) {\n      if (reads.has(name)) throw new ConstantInputError(key);\n      continue;\n    }\n    scope[name] = value;\n  }\n  return scope;\n}\n\n/**\n * Whether `holds` is true for `values`: every conjunct of\n * {@link holdsConditions} holds. Hyphenated quantity names are rewritten with\n * `names` before parsing; an unbound name, a non-boolean result, and a syntax\n * error are a {@link HoldsError}.\n * A value whose name is one of `constants` and which the condition reads is\n * a {@link ConstantInputError}, a caller error and not a false condition,\n * unless `declared` names it; one the condition does not read is dropped, as\n * any other extra key is.\n */\nexport function holds(\n  source: string,\n  values: Readonly<Record<string, number>>,\n  constants: Readonly<Record<string, number>>,\n  names: readonly string[],\n  declared: readonly string[] = [],\n): boolean {\n  const conditions = holdsConditions(source, names);\n  const scope = holdsScope(values, constants, conditionReads(conditions), declared);\n  return conditions.every((condition) => condition.test(scope));\n}\n"]}

package/dist/bridges/index.d.ts

@@ -1,25 +1,26 @@
 /**
- * Bridge catalog projection. Rows, regimes, and the spine are loaded from
+ * Bridge catalog projection. The rows are loaded from
  * `data/bridge-catalog.json`. This module does not declare an equation.
  *
  * @module bridges
  */
+import type { BridgeEquationEntry } from './types.js';
+/** The catalog row and its status, issue and severity unions. */
 export type { BridgeEquationEntry, BridgeEquationStatus, BridgeIssueFixable, BridgeIssueSeverity, KnownIssue, } from './types.js';
-/** An active status is every status except `invalid`. */
-export { isActiveStatus } from './types.js';
-/** Physical constants the catalog expressions name. */
+/**
+ * Derived constants of the catalog's closed forms, re-exported for callers
+ * who want the number by name. A catalog expression reads `m_p` and
+ * `sigma_T` through the constant registry (`dimensional/constant-rows.ts`),
+ * which carries `M_PROTON_SI`, `THOMSON_CROSS_SECTION_SI` and
+ * `LANE_EMDEN_OMEGA3`; the von Klitzing, Josephson, Lorenz and BCS-gap
+ * values are not read by any expression and are the catalog's documented
+ * reference numbers.
+ */
 export { BCS_GAP_RATIO, JOSEPHSON_CONSTANT_SI, LANE_EMDEN_OMEGA3, LORENZ_NUMBER_SI, M_PROTON_SI, THOMSON_CROSS_SECTION_SI, VON_KLITZING_SI, } from '../core/constants.js';
 /** Thrown when two carrier roles have opposite signs. */
 export { CarrierSignError } from './carrier-sign.js';
-import type { BridgeEquationEntry } from './types.js';
-import type { Regime } from '../relations/types.js';
-/** Catalog rows in file order. @public */
+/** Thrown when a caller input names a registered constant. */
+export { ConstantInputError } from './evaluation-errors.js';
+/** Catalog rows in id order. @public */
 export declare const BRIDGE_EQUATIONS: readonly BridgeEquationEntry[];
-/** The regime recorded on a catalog row, when the row has one. */
-export declare function catalogRegime(id: number): Regime | undefined;
-/**
- * Dimensionless groups at the points the gravitational confrontations used.
- * Keys are catalog ids. Values are group formula → number.
- */
-export declare const SPINE_CONFRONTATION_POINTS: Readonly<Record<string, Readonly<Record<string, number>>>>;
 //# sourceMappingURL=index.d.ts.map