universal-physics-tensor 10.0.0 → 11.0.0

package/dist/bridges/holds.js

@@ -16,6 +16,7 @@
 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) {
@@ -112,35 +113,116 @@ 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, '_'))));
 }
-const IDENTIFIER = /[A-Za-z_][A-Za-z0-9_]*/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 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.
+ * 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, declared = []) {
-    const rewritten = rewriteCatalogHyphens(source, names);
-    const reads = new Set(rewritten.match(IDENTIFIER) ?? []);
+export function holdsScope(values, constants, reads, declared = []) {
     const scope = { ...constants };
     const allowed = new Set(declared.map((name) => name.replace(/-/g, '_')));
     for (const [key, value] of Object.entries(values)) {
@@ -152,9 +234,21 @@ export function holds(source, values, constants, names, declared = []) {
         }
         scope[name] = value;
     }
-    const result = compiled(rewritten, source)(scope);
-    if (typeof result !== 'boolean')
-        throw new HoldsError(`condition is not boolean: ${source}`);
-    return result;
+    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;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAE5D,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,MAAM,UAAU,GAAG,yBAAyB,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,UAAU,KAAK,CACnB,MAAc,EACd,MAAwC,EACxC,SAA2C,EAC3C,KAAwB,EACxB,QAAQ,GAAsB,EAAE;IAEhC,MAAM,SAAS,GAAG,qBAAqB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACzD,MAAM,KAAK,GAAU,EAAE,GAAG,SAAS,EAAE,CAAC;IACtC,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,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","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';\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\nconst COMPILED = new Map<string, Compiled>();\n\nfunction compiled(rewritten: string, source: string): Compiled {\n  const hit = COMPILED.get(rewritten);\n  if (hit !== undefined) return hit;\n  let node: MathNode;\n  try {\n    node = 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 fn = compile(node, source);\n  COMPILED.set(rewritten, fn);\n  return fn;\n}\n\nconst IDENTIFIER = /[A-Za-z_][A-Za-z0-9_]*/g;\n\n/**\n * Whether `holds` is true for `values`.\n * Hyphenated quantity names are rewritten with `names` before parsing; an\n * unbound name, a non-boolean result, and a syntax 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 rewritten = rewriteCatalogHyphens(source, names);\n  const reads = new Set(rewritten.match(IDENTIFIER) ?? []);\n  const scope: Scope = { ...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  const result = compiled(rewritten, source)(scope);\n  if (typeof result !== 'boolean') throw new HoldsError(`condition is not boolean: ${source}`);\n  return result;\n}\n"]}
+{"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/notices.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"notices.d.ts","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAO1D,gEAAgE;AAChE,wBAAgB,eAAe,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,EAAE,CAKnE"}
+{"version":3,"file":"notices.d.ts","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAG1D,gEAAgE;AAChE,wBAAgB,eAAe,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,EAAE,CAQnE"}

package/dist/bridges/notices.js

@@ -6,16 +6,16 @@
  * @module bridges/notices
  */
 import { constantNotes } from '../dimensional/symbolic-constants.js';
-/** Identifiers in an expression, in order of first appearance. */
-function identifiers(expression) {
-    return [...new Set(expression.match(/[A-Za-z_][A-Za-z0-9_]*/g) ?? [])];
-}
+import { expressionNames } from './expr-parse.js';
 /** The caveats to print beside `relation`'s value. @internal */
 export function relationNotices(relation) {
     const notes = [];
     if (relation.notice !== undefined)
         notes.push(relation.notice.text);
-    for (const note of constantNotes(identifiers(relation.expression)))
+    // The names are read after the kebab rewrite: a bare identifier regex read be-39's
+    // `truncation-coefficient-b` as the constant `b`. A `reduced-planck-constant` spelling is
+    // `hbar` (tests/bridges/expression-names.test.ts).
+    for (const note of constantNotes(expressionNames(relation.expression)))
         notes.push(`note: ${note}`);
     return notes;
 }

package/dist/bridges/notices.js.map

@@ -1 +1 @@
-{"version":3,"file":"notices.js","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,sCAAsC,CAAC;AAGrE,kEAAkE;AAClE,SAAS,WAAW,CAAC,UAAkB;IACrC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,eAAe,CAAC,QAAyB;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpE,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IAChG,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * The caveats printed beside a relation's value: the record's own notice, and\n * the note of every registered constant its expression names. No caller\n * switches on a notice; the text is the record's or the constant's.\n *\n * @module bridges/notices\n */\n\nimport { constantNotes } from '../dimensional/symbolic-constants.js';\nimport type { CatalogRelation } from './catalog-types.js';\n\n/** Identifiers in an expression, in order of first appearance. */\nfunction identifiers(expression: string): string[] {\n  return [...new Set(expression.match(/[A-Za-z_][A-Za-z0-9_]*/g) ?? [])];\n}\n\n/** The caveats to print beside `relation`'s value. @internal */\nexport function relationNotices(relation: CatalogRelation): string[] {\n  const notes: string[] = [];\n  if (relation.notice !== undefined) notes.push(relation.notice.text);\n  for (const note of constantNotes(identifiers(relation.expression))) notes.push(`note: ${note}`);\n  return notes;\n}\n"]}
+{"version":3,"file":"notices.js","sourceRoot":"","sources":["../../src/bridges/notices.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,sCAAsC,CAAC;AAErE,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,gEAAgE;AAChE,MAAM,UAAU,eAAe,CAAC,QAAyB;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpE,mFAAmF;IACnF,0FAA0F;IAC1F,mDAAmD;IACnD,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,eAAe,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IACpG,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * The caveats printed beside a relation's value: the record's own notice, and\n * the note of every registered constant its expression names. No caller\n * switches on a notice; the text is the record's or the constant's.\n *\n * @module bridges/notices\n */\n\nimport { constantNotes } from '../dimensional/symbolic-constants.js';\nimport type { CatalogRelation } from './catalog-types.js';\nimport { expressionNames } from './expr-parse.js';\n\n/** The caveats to print beside `relation`'s value. @internal */\nexport function relationNotices(relation: CatalogRelation): string[] {\n  const notes: string[] = [];\n  if (relation.notice !== undefined) notes.push(relation.notice.text);\n  // The names are read after the kebab rewrite: a bare identifier regex read be-39's\n  // `truncation-coefficient-b` as the constant `b`. A `reduced-planck-constant` spelling is\n  // `hbar` (tests/bridges/expression-names.test.ts).\n  for (const note of constantNotes(expressionNames(relation.expression))) notes.push(`note: ${note}`);\n  return notes;\n}\n"]}

package/dist/bridges/relation-eval.d.ts

@@ -6,14 +6,14 @@
  */
 import { CarrierSignError } from './carrier-sign.js';
 import type { CatalogRelation } from './catalog-types.js';
+import { type ConditionDomain } from './validity.js';
 /** Thrown when two carrier roles have opposite signs. */
 export { CarrierSignError };
 /**
- * Whether `inputs` satisfy the relation's validity condition. An unbound or
- * unparsable condition is false; an input that names a constant the relation
- * does not declare as a source throws `ConstantInputError`.
+ * The relation's validity domain, read from its `holds`: the predicate, the
+ * description and the violated conditions all come from that one text.
  */
-export declare function relationHolds(rel: CatalogRelation, inputs: Readonly<Record<string, number>>): boolean;
+export declare function relationDomain(rel: CatalogRelation): ConditionDomain;
 /**
  * The relation's number at `inputs`. The caller has already checked the
  * validity condition. Opposite carrier signs throw {@link CarrierSignError}.

package/dist/bridges/relation-eval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relation-eval.d.ts","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAA0B,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAI1D,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AA4D5B;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAOrG;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,eAAe,EACpB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACvC,MAAM,CAiBR"}
+{"version":3,"file":"relation-eval.d.ts","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAA0B,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC7E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAE1D,OAAO,EAAmB,KAAK,eAAe,EAAE,MAAM,eAAe,CAAC;AAEtE,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AA8D5B;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,eAAe,GAAG,eAAe,CAMpE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,eAAe,EACpB,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GACvC,MAAM,CAiBR"}

package/dist/bridges/relation-eval.js

@@ -5,9 +5,10 @@
  * @module bridges/relation-eval
  */
 import { quantityRecord } from '../dimensional/quantity-registry.js';
+import { withinSymmetric } from '../core/compare.js';
 import { applyCarrierSignPolicy, CarrierSignError } from './carrier-sign.js';
 import { evaluateFormula, formulaNames, formulaScope } from './expr-parse.js';
-import { holds, HoldsError } from './holds.js';
+import { conditionDomain } from './validity.js';
 /** Thrown when two carrier roles have opposite signs. */
 export { CarrierSignError };
 const parityCache = new Map();
@@ -49,9 +50,9 @@ function classify(rel) {
             }
             if (!Number.isFinite(pos) || !Number.isFinite(neg))
                 continue;
-            const scale = Math.max(Math.abs(pos), Math.abs(neg), 1);
-            const isEven = Math.abs(pos - neg) <= 1e-8 * scale;
-            const isOdd = Math.abs(pos + neg) <= 1e-8 * scale;
+            // The scale is max(|pos|, |neg|, 1): relative far from one, absolute near zero.
+            const isEven = withinSymmetric(pos, neg, 1e-8, 1);
+            const isOdd = withinSymmetric(pos, -neg, 1e-8, 1);
             if (isEven && !isOdd)
                 even.push(name);
             if (isOdd && !isEven) {
@@ -72,20 +73,18 @@ function classify(rel) {
     parityCache.set(rel.id, found);
     return found;
 }
+const domainCache = new Map();
 /**
- * Whether `inputs` satisfy the relation's validity condition. An unbound or
- * unparsable condition is false; an input that names a constant the relation
- * does not declare as a source throws `ConstantInputError`.
+ * The relation's validity domain, read from its `holds`: the predicate, the
+ * description and the violated conditions all come from that one text.
  */
-export function relationHolds(rel, inputs) {
-    try {
-        return holds(rel.holds, inputs, formulaScope(), [...formulaNames()], rel.sources);
-    }
-    catch (error) {
-        if (error instanceof HoldsError)
-            return false;
-        throw error;
-    }
+export function relationDomain(rel) {
+    const hit = domainCache.get(rel.id);
+    if (hit !== undefined)
+        return hit;
+    const domain = conditionDomain(rel.holds, formulaNames, formulaScope, rel.sources);
+    domainCache.set(rel.id, domain);
+    return domain;
 }
 /**
  * The relation's number at `inputs`. The caller has already checked the

package/dist/bridges/relation-eval.js.map

@@ -1 +1 @@
-{"version":3,"file":"relation-eval.js","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAE7E,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE/C,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwH,CAAC;AAEpJ,SAAS,KAAK,CAAC,GAAoB,EAAE,IAAY;IAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;AAC3D,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CAAC,GAAoB;IACxC,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;IACpE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,GAAoB;IACpC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA6C,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACnF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAW,CAAC;YAChB,IAAI,GAAW,CAAC;YAChB,IAAI,CAAC;gBACH,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;gBACnF,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YACtF,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC;YAClD,IAAI,MAAM,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,IAAI,KAAK,QAAQ;oBAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,IAAI,KAAK,UAAU;oBAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG;QACZ,IAAI;QACJ,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1F,CAAC;IACF,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,GAAoB,EAAE,MAAwC;IAC1F,IAAI,CAAC;QACH,OAAO,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACpF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,UAAU;YAAE,OAAO,KAAK,CAAC;QAC9C,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAoB,EACpB,MAAwC;IAExC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,sBAAsB,CACrC,IAAI,EACJ,MAAM,EACN,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EACpB,IAAI,KAAK,SAAS;QAChB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG;YACpC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG;YACtC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;SACjC,CACN,CAAC;IACF,OAAO,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;AAChE,CAAC","sourcesContent":["/**\n * Evaluate one catalog relation: validity condition, carrier-sign policy,\n * and the parsed expression. No per-equation branch.\n *\n * @module bridges/relation-eval\n */\n\nimport { quantityRecord } from '../dimensional/quantity-registry.js';\nimport { applyCarrierSignPolicy, CarrierSignError } from './carrier-sign.js';\nimport type { CatalogRelation } from './catalog-types.js';\nimport { evaluateFormula, formulaNames, formulaScope } from './expr-parse.js';\nimport { holds, HoldsError } from './holds.js';\n\n/** Thrown when two carrier roles have opposite signs. */\nexport { CarrierSignError };\n\nconst parityCache = new Map<string, { readonly even: readonly string[]; readonly pair?: { readonly charge: string; readonly mobility: string } }>();\n\nfunction named(rel: CatalogRelation, name: string): string {\n  const alias = rel.aliases[name]?.[0];\n  return alias === undefined ? name : `${name} (${alias})`;\n}\n\nfunction signRole(name: string): 'charge' | 'mobility' | undefined {\n  return quantityRecord(name)?.signRole;\n}\n\nfunction sampleInputs(rel: CatalogRelation): Record<string, number> | null {\n  if (rel.reference !== undefined) return { ...rel.reference.inputs };\n  if (rel.sources.length === 0) return {};\n  return null;\n}\n\nfunction classify(rel: CatalogRelation): { even: readonly string[]; pair?: { charge: string; mobility: string } } {\n  const cached = parityCache.get(rel.id);\n  if (cached !== undefined) return cached;\n  const base = sampleInputs(rel);\n  const even: string[] = [];\n  const odd: { charge: string[]; mobility: string[] } = { charge: [], mobility: [] };\n  if (base !== null) {\n    for (const name of rel.sources) {\n      const x = base[name];\n      if (x === undefined || x === 0 || !Number.isFinite(x)) continue;\n      const magnitude = Math.abs(x);\n      let pos: number;\n      let neg: number;\n      try {\n        pos = evaluateFormula(rel.expression, { ...base, [name]: magnitude }, rel.sources);\n        neg = evaluateFormula(rel.expression, { ...base, [name]: -magnitude }, rel.sources);\n      } catch {\n        continue;\n      }\n      if (!Number.isFinite(pos) || !Number.isFinite(neg)) continue;\n      const scale = Math.max(Math.abs(pos), Math.abs(neg), 1);\n      const isEven = Math.abs(pos - neg) <= 1e-8 * scale;\n      const isOdd = Math.abs(pos + neg) <= 1e-8 * scale;\n      if (isEven && !isOdd) even.push(name);\n      if (isOdd && !isEven) {\n        const role = signRole(name);\n        if (role === 'charge') odd.charge.push(name);\n        if (role === 'mobility') odd.mobility.push(name);\n      }\n    }\n  }\n  const charge = odd.charge[0];\n  const mobility = odd.mobility[0];\n  const found = {\n    even,\n    ...(charge !== undefined && mobility !== undefined ? { pair: { charge, mobility } } : {}),\n  };\n  parityCache.set(rel.id, found);\n  return found;\n}\n\n/**\n * Whether `inputs` satisfy the relation's validity condition. An unbound or\n * unparsable condition is false; an input that names a constant the relation\n * does not declare as a source throws `ConstantInputError`.\n */\nexport function relationHolds(rel: CatalogRelation, inputs: Readonly<Record<string, number>>): boolean {\n  try {\n    return holds(rel.holds, inputs, formulaScope(), [...formulaNames()], rel.sources);\n  } catch (error) {\n    if (error instanceof HoldsError) return false;\n    throw error;\n  }\n}\n\n/**\n * The relation's number at `inputs`. The caller has already checked the\n * validity condition. Opposite carrier signs throw {@link CarrierSignError}.\n */\nexport function evaluateCatalogRelation(\n  rel: CatalogRelation,\n  inputs: Readonly<Record<string, number>>,\n): number {\n  const policy = classify(rel);\n  const pair = policy.pair;\n  const adjusted = applyCarrierSignPolicy(\n    null,\n    inputs,\n    new Set(policy.even),\n    pair === undefined\n      ? undefined\n      : {\n          a: inputs[pair.charge] ?? Number.NaN,\n          b: inputs[pair.mobility] ?? Number.NaN,\n          left: named(rel, pair.charge),\n          right: named(rel, pair.mobility),\n        },\n  );\n  return evaluateFormula(rel.expression, adjusted, rel.sources);\n}\n"]}
+{"version":3,"file":"relation-eval.js","sourceRoot":"","sources":["../../src/bridges/relation-eval.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAE7E,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,eAAe,EAAwB,MAAM,eAAe,CAAC;AAEtE,yDAAyD;AACzD,OAAO,EAAE,gBAAgB,EAAE,CAAC;AAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwH,CAAC;AAEpJ,SAAS,KAAK,CAAC,GAAoB,EAAE,IAAY;IAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;AAC3D,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;AACxC,CAAC;AAED,SAAS,YAAY,CAAC,GAAoB;IACxC,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;IACpE,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,GAAoB;IACpC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACvC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA6C,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACnF,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,GAAW,CAAC;YAChB,IAAI,GAAW,CAAC;YAChB,IAAI,CAAC;gBACH,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;gBACnF,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YACtF,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC7D,gFAAgF;YAChF,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YAClD,IAAI,MAAM,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,IAAI,KAAK,QAAQ;oBAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,IAAI,IAAI,KAAK,UAAU;oBAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG;QACZ,IAAI;QACJ,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1F,CAAC;IACF,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAC;AAEvD;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAoB;IACjD,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACpC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,GAAG,CAAC;IAClC,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACnF,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAoB,EACpB,MAAwC;IAExC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,sBAAsB,CACrC,IAAI,EACJ,MAAM,EACN,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EACpB,IAAI,KAAK,SAAS;QAChB,CAAC,CAAC,SAAS;QACX,CAAC,CAAC;YACE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG;YACpC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG;YACtC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;SACjC,CACN,CAAC;IACF,OAAO,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;AAChE,CAAC","sourcesContent":["/**\n * Evaluate one catalog relation: validity condition, carrier-sign policy,\n * and the parsed expression. No per-equation branch.\n *\n * @module bridges/relation-eval\n */\n\nimport { quantityRecord } from '../dimensional/quantity-registry.js';\nimport { withinSymmetric } from '../core/compare.js';\nimport { applyCarrierSignPolicy, CarrierSignError } from './carrier-sign.js';\nimport type { CatalogRelation } from './catalog-types.js';\nimport { evaluateFormula, formulaNames, formulaScope } from './expr-parse.js';\nimport { conditionDomain, type ConditionDomain } from './validity.js';\n\n/** Thrown when two carrier roles have opposite signs. */\nexport { CarrierSignError };\n\nconst parityCache = new Map<string, { readonly even: readonly string[]; readonly pair?: { readonly charge: string; readonly mobility: string } }>();\n\nfunction named(rel: CatalogRelation, name: string): string {\n  const alias = rel.aliases[name]?.[0];\n  return alias === undefined ? name : `${name} (${alias})`;\n}\n\nfunction signRole(name: string): 'charge' | 'mobility' | undefined {\n  return quantityRecord(name)?.signRole;\n}\n\nfunction sampleInputs(rel: CatalogRelation): Record<string, number> | null {\n  if (rel.reference !== undefined) return { ...rel.reference.inputs };\n  if (rel.sources.length === 0) return {};\n  return null;\n}\n\nfunction classify(rel: CatalogRelation): { even: readonly string[]; pair?: { charge: string; mobility: string } } {\n  const cached = parityCache.get(rel.id);\n  if (cached !== undefined) return cached;\n  const base = sampleInputs(rel);\n  const even: string[] = [];\n  const odd: { charge: string[]; mobility: string[] } = { charge: [], mobility: [] };\n  if (base !== null) {\n    for (const name of rel.sources) {\n      const x = base[name];\n      if (x === undefined || x === 0 || !Number.isFinite(x)) continue;\n      const magnitude = Math.abs(x);\n      let pos: number;\n      let neg: number;\n      try {\n        pos = evaluateFormula(rel.expression, { ...base, [name]: magnitude }, rel.sources);\n        neg = evaluateFormula(rel.expression, { ...base, [name]: -magnitude }, rel.sources);\n      } catch {\n        continue;\n      }\n      if (!Number.isFinite(pos) || !Number.isFinite(neg)) continue;\n      // The scale is max(|pos|, |neg|, 1): relative far from one, absolute near zero.\n      const isEven = withinSymmetric(pos, neg, 1e-8, 1);\n      const isOdd = withinSymmetric(pos, -neg, 1e-8, 1);\n      if (isEven && !isOdd) even.push(name);\n      if (isOdd && !isEven) {\n        const role = signRole(name);\n        if (role === 'charge') odd.charge.push(name);\n        if (role === 'mobility') odd.mobility.push(name);\n      }\n    }\n  }\n  const charge = odd.charge[0];\n  const mobility = odd.mobility[0];\n  const found = {\n    even,\n    ...(charge !== undefined && mobility !== undefined ? { pair: { charge, mobility } } : {}),\n  };\n  parityCache.set(rel.id, found);\n  return found;\n}\n\nconst domainCache = new Map<string, ConditionDomain>();\n\n/**\n * The relation's validity domain, read from its `holds`: the predicate, the\n * description and the violated conditions all come from that one text.\n */\nexport function relationDomain(rel: CatalogRelation): ConditionDomain {\n  const hit = domainCache.get(rel.id);\n  if (hit !== undefined) return hit;\n  const domain = conditionDomain(rel.holds, formulaNames, formulaScope, rel.sources);\n  domainCache.set(rel.id, domain);\n  return domain;\n}\n\n/**\n * The relation's number at `inputs`. The caller has already checked the\n * validity condition. Opposite carrier signs throw {@link CarrierSignError}.\n */\nexport function evaluateCatalogRelation(\n  rel: CatalogRelation,\n  inputs: Readonly<Record<string, number>>,\n): number {\n  const policy = classify(rel);\n  const pair = policy.pair;\n  const adjusted = applyCarrierSignPolicy(\n    null,\n    inputs,\n    new Set(policy.even),\n    pair === undefined\n      ? undefined\n      : {\n          a: inputs[pair.charge] ?? Number.NaN,\n          b: inputs[pair.mobility] ?? Number.NaN,\n          left: named(rel, pair.charge),\n          right: named(rel, pair.mobility),\n        },\n  );\n  return evaluateFormula(rel.expression, adjusted, rel.sources);\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"sensitivity.d.ts","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAG5D,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAiBD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQpH;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE,CASnE"}
+{"version":3,"file":"sensitivity.d.ts","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAG5D,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAgBD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAQpH;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE,CASnE"}

package/dist/bridges/sensitivity.js

@@ -7,15 +7,15 @@
  *
  * @module bridges/sensitivity
  */
+import { centralPartial } from '../numerical/finite-difference.js';
 import { catalogConfrontations } from './catalog-load.js';
 import { BRIDGE_EVALUATORS } from './evaluators.js';
 function elasticityOf(predict, point, key) {
     const x = point[key];
+    // Relative step 1e-6, absolute 1e-12 at x = 0: this reader's rule; the derivative is the shared one.
     const h = Math.abs(x) * 1e-6 || 1e-12;
-    const up = { ...point, [key]: x + h };
-    const dn = { ...point, [key]: x - h };
     const P = predict(point);
-    const dP = (predict(up) - predict(dn)) / (2 * h);
+    const dP = centralPartial(predict, point, key, h);
     if (!(Number.isFinite(P) && P !== 0))
         return 0;
     return (Math.abs(dP) * Math.abs(x)) / Math.abs(P);

package/dist/bridges/sensitivity.js.map

@@ -1 +1 @@
-{"version":3,"file":"sensitivity.js","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAQpD,SAAS,YAAY,CACnB,OAAkD,EAClD,KAA6B,EAC7B,GAAW;IAEX,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAE,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;IACtC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,UAA6B,EAAE,MAA8B;IAC1G,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,4BAA4B,CAAC,CAAC;IAChG,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnF,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,+BAA+B,GAAG,2BAA2B,CAAC,CAAC;IAClI,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,MAAM,GAAG,GAAG,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;IACjF,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;IAClC,MAAM,KAAK,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,CAAC,MAA8B,EAAU,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACvG,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SACtB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;SAC7E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AACjD,CAAC","sourcesContent":["/**\n * Deciding-measurement elasticity for value-kind confrontations. For each\n * input of a stored prediction point, report the dimensionless\n * log-sensitivity E_i = |∂P/∂x_i|·x_i/P of the number the record predicts.\n * This ranks which input the prediction depends on most strongly. It is not\n * an uncertainty budget.\n *\n * @module bridges/sensitivity\n */\n\nimport { catalogConfrontations } from './catalog-load.js';\nimport type { CatalogPrediction } from './catalog-types.js';\nimport { BRIDGE_EVALUATORS } from './evaluators.js';\n\n/** One input's elasticity. @public */\nexport interface Elasticity {\n  readonly input: string;\n  readonly elasticity: number;\n}\n\nfunction elasticityOf(\n  predict: (point: Record<string, number>) => number,\n  point: Record<string, number>,\n  key: string,\n): number {\n  const x = point[key]!;\n  const h = Math.abs(x) * 1e-6 || 1e-12;\n  const up = { ...point, [key]: x + h };\n  const dn = { ...point, [key]: x - h };\n  const P = predict(point);\n  const dP = (predict(up) - predict(dn)) / (2 * h);\n  if (!(Number.isFinite(P) && P !== 0)) return 0;\n  return (Math.abs(dP) * Math.abs(x)) / Math.abs(P);\n}\n\n/**\n * The number a confrontation's prediction point yields: the evaluator's value\n * at the point, or the extra output the prediction names.\n * @internal\n */\nexport function predictedAt(catalogId: number, prediction: CatalogPrediction, inputs: Record<string, number>): number {\n  const spec = BRIDGE_EVALUATORS.get(catalogId);\n  if (spec === undefined) throw new Error(`confrontation ${catalogId}: no evaluator predicts it`);\n  const result = spec.run(inputs, prediction.output === undefined ? 'value' : 'all');\n  const key = prediction.output ?? 'value';\n  const value = result[key];\n  if (value === undefined) throw new Error(`confrontation ${catalogId}: the evaluator returns no '${key}' at the prediction point`);\n  return value;\n}\n\n/**\n * Elasticity ranking for a value-kind confrontation that stores a prediction\n * point. `[]` when the record is not value-kind, has no point, or is absent.\n *\n * @public\n */\nexport function decidingMeasurement(catalogId: number): Elasticity[] {\n  const row = catalogConfrontations().find((item) => item.catalogId === catalogId);\n  if (row === undefined || row.kind !== 'value' || row.prediction === undefined) return [];\n  const prediction = row.prediction;\n  const point = { ...prediction.inputs };\n  const predict = (inputs: Record<string, number>): number => predictedAt(catalogId, prediction, inputs);\n  return Object.keys(point)\n    .map((key) => ({ input: key, elasticity: elasticityOf(predict, point, key) }))\n    .sort((a, b) => b.elasticity - a.elasticity);\n}\n"]}
+{"version":3,"file":"sensitivity.js","sourceRoot":"","sources":["../../src/bridges/sensitivity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAQpD,SAAS,YAAY,CACnB,OAAkD,EAClD,KAA6B,EAC7B,GAAW;IAEX,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAE,CAAC;IACtB,qGAAqG;IACrG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;IACtC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAClD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,UAA6B,EAAE,MAA8B;IAC1G,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC9C,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,4BAA4B,CAAC,CAAC;IAChG,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnF,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,SAAS,+BAA+B,GAAG,2BAA2B,CAAC,CAAC;IAClI,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,MAAM,GAAG,GAAG,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;IACjF,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACzF,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;IAClC,MAAM,KAAK,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,CAAC,MAA8B,EAAU,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACvG,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SACtB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,YAAY,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;SAC7E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AACjD,CAAC","sourcesContent":["/**\n * Deciding-measurement elasticity for value-kind confrontations. For each\n * input of a stored prediction point, report the dimensionless\n * log-sensitivity E_i = |∂P/∂x_i|·x_i/P of the number the record predicts.\n * This ranks which input the prediction depends on most strongly. It is not\n * an uncertainty budget.\n *\n * @module bridges/sensitivity\n */\n\nimport { centralPartial } from '../numerical/finite-difference.js';\nimport { catalogConfrontations } from './catalog-load.js';\nimport type { CatalogPrediction } from './catalog-types.js';\nimport { BRIDGE_EVALUATORS } from './evaluators.js';\n\n/** One input's elasticity. @public */\nexport interface Elasticity {\n  readonly input: string;\n  readonly elasticity: number;\n}\n\nfunction elasticityOf(\n  predict: (point: Record<string, number>) => number,\n  point: Record<string, number>,\n  key: string,\n): number {\n  const x = point[key]!;\n  // Relative step 1e-6, absolute 1e-12 at x = 0: this reader's rule; the derivative is the shared one.\n  const h = Math.abs(x) * 1e-6 || 1e-12;\n  const P = predict(point);\n  const dP = centralPartial(predict, point, key, h);\n  if (!(Number.isFinite(P) && P !== 0)) return 0;\n  return (Math.abs(dP) * Math.abs(x)) / Math.abs(P);\n}\n\n/**\n * The number a confrontation's prediction point yields: the evaluator's value\n * at the point, or the extra output the prediction names.\n * @internal\n */\nexport function predictedAt(catalogId: number, prediction: CatalogPrediction, inputs: Record<string, number>): number {\n  const spec = BRIDGE_EVALUATORS.get(catalogId);\n  if (spec === undefined) throw new Error(`confrontation ${catalogId}: no evaluator predicts it`);\n  const result = spec.run(inputs, prediction.output === undefined ? 'value' : 'all');\n  const key = prediction.output ?? 'value';\n  const value = result[key];\n  if (value === undefined) throw new Error(`confrontation ${catalogId}: the evaluator returns no '${key}' at the prediction point`);\n  return value;\n}\n\n/**\n * Elasticity ranking for a value-kind confrontation that stores a prediction\n * point. `[]` when the record is not value-kind, has no point, or is absent.\n *\n * @public\n */\nexport function decidingMeasurement(catalogId: number): Elasticity[] {\n  const row = catalogConfrontations().find((item) => item.catalogId === catalogId);\n  if (row === undefined || row.kind !== 'value' || row.prediction === undefined) return [];\n  const prediction = row.prediction;\n  const point = { ...prediction.inputs };\n  const predict = (inputs: Record<string, number>): number => predictedAt(catalogId, prediction, inputs);\n  return Object.keys(point)\n    .map((key) => ({ input: key, elasticity: elasticityOf(predict, point, key) }))\n    .sort((a, b) => b.elasticity - a.elasticity);\n}\n"]}

package/dist/bridges/validity.d.ts

@@ -0,0 +1,33 @@
+/**
+ * A validity domain read from one condition text, the record's `holds`.
+ *
+ * The condition is the single source: the predicate is the conjunction of its
+ * conjuncts, the description is those conjuncts written out, and a refusal
+ * lists only the conjuncts that failed, each rendered with the key the caller
+ * gave the input under. No record carries a second, prose statement of the
+ * same domain, so the message cannot contradict the check.
+ *
+ * @module bridges/validity
+ */
+import type { DomainViolation } from './evaluation-errors.js';
+/** A domain built from a condition text. Structurally a `ValidityDomain`. @internal */
+export interface ConditionDomain {
+    /** The conjuncts, in the relation's names, joined by `and`. */
+    readonly description: string;
+    readonly predicate: (inputs: Record<string, number>) => boolean;
+    /**
+     * The conjuncts `inputs` violate. `keyOf` names the caller's key for a name
+     * the relation reads (a parameter key for an evaluator source); a name it
+     * does not map is its own key.
+     */
+    readonly violations: (inputs: Record<string, number>, keyOf?: (name: string) => string) => readonly DomainViolation[];
+}
+/**
+ * The domain `text` states over `names` (the hyphenated quantity names it may
+ * read), with `constants()` bound. `'true'` is the domain with no condition.
+ * An input named for a constant that `declared` does not list, and that the
+ * condition reads, is a `ConstantInputError` (a caller error, not a false condition).
+ * @internal
+ */
+export declare function conditionDomain(text: string, names: () => Iterable<string>, constants: () => Readonly<Record<string, number>>, declared?: readonly string[]): ConditionDomain;
+//# sourceMappingURL=validity.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"validity.d.ts","sourceRoot":"","sources":["../../src/bridges/validity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAG9D,uFAAuF;AACvF,MAAM,WAAW,eAAe;IAC9B,+DAA+D;IAC/D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC;IAChE;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,KAAK,SAAS,eAAe,EAAE,CAAC;CACvH;AAkBD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,QAAQ,CAAC,MAAM,CAAC,EAC7B,SAAS,EAAE,MAAM,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACjD,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,eAAe,CA8BjB"}

package/dist/bridges/validity.js

@@ -0,0 +1,67 @@
+/**
+ * A validity domain read from one condition text, the record's `holds`.
+ *
+ * The condition is the single source: the predicate is the conjunction of its
+ * conjuncts, the description is those conjuncts written out, and a refusal
+ * lists only the conjuncts that failed, each rendered with the key the caller
+ * gave the input under. No record carries a second, prose statement of the
+ * same domain, so the message cannot contradict the check.
+ *
+ * @module bridges/validity
+ */
+import { conditionReads, holdsConditions, holdsScope, HoldsError } from './holds.js';
+/** A conjunct fails when it is false or cannot be evaluated (an unbound name, a non-number). */
+function fails(condition, scope) {
+    try {
+        return !condition.test(scope);
+    }
+    catch (error) {
+        if (error instanceof HoldsError)
+            return true;
+        throw error;
+    }
+}
+/** `text` with each whole-word name it reads replaced by the caller's key. */
+function rendered(condition, keyOf) {
+    const keys = new Map(condition.names.map((name) => [name, keyOf(name)]));
+    return condition.text.replace(/[A-Za-z_][A-Za-z0-9_-]*/g, (word) => keys.get(word) ?? word);
+}
+/**
+ * The domain `text` states over `names` (the hyphenated quantity names it may
+ * read), with `constants()` bound. `'true'` is the domain with no condition.
+ * An input named for a constant that `declared` does not list, and that the
+ * condition reads, is a `ConstantInputError` (a caller error, not a false condition).
+ * @internal
+ */
+export function conditionDomain(text, names, constants, declared = []) {
+    let parts;
+    const conditions = () => (parts ??= holdsConditions(text, [...names()]));
+    const own = (name) => name;
+    return {
+        get description() {
+            return conditions().map((condition) => condition.text).join(' and ');
+        },
+        predicate: (inputs) => {
+            const scope = holdsScope(inputs, constants(), conditionReads(conditions()), declared);
+            return conditions().every((condition) => !fails(condition, scope));
+        },
+        violations: (inputs, keyOf = own) => {
+            const scope = holdsScope(inputs, constants(), conditionReads(conditions()), declared);
+            const constantNames = constants();
+            return conditions()
+                .filter((condition) => fails(condition, scope))
+                .map((condition) => {
+                const read = condition.names
+                    .filter((name) => !Object.hasOwn(constantNames, name.replace(/-/g, '_')) || Object.hasOwn(inputs, name))
+                    .map((name) => ({ key: keyOf(name), quantity: name, value: inputs[name] ?? Number.NaN }));
+                return {
+                    condition: rendered(condition, keyOf),
+                    key: read[0]?.key ?? '',
+                    value: read[0]?.value ?? Number.NaN,
+                    inputs: read,
+                };
+            });
+        },
+    };
+}
+//# sourceMappingURL=validity.js.map

package/dist/bridges/validity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validity.js","sourceRoot":"","sources":["../../src/bridges/validity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,EAAE,UAAU,EAAuB,MAAM,YAAY,CAAC;AAe1G,gGAAgG;AAChG,SAAS,KAAK,CAAC,SAAyB,EAAE,KAAuC;IAC/E,IAAI,CAAC;QACH,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,UAAU;YAAE,OAAO,IAAI,CAAC;QAC7C,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,QAAQ,CAAC,SAAyB,EAAE,KAA+B;IAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,0BAA0B,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;AAC9F,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAY,EACZ,KAA6B,EAC7B,SAAiD,EACjD,QAAQ,GAAsB,EAAE;IAEhC,IAAI,KAA4C,CAAC;IACjD,MAAM,UAAU,GAAG,GAA8B,EAAE,CAAC,CAAC,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IACpG,MAAM,GAAG,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC;IAC3C,OAAO;QACL,IAAI,WAAW;YACb,OAAO,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvE,CAAC;QACD,SAAS,EAAE,CAAC,MAAM,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,cAAc,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtF,OAAO,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,UAAU,EAAE,CAAC,MAAM,EAAE,KAAK,GAAG,GAAG,EAAE,EAAE;YAClC,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,cAAc,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtF,MAAM,aAAa,GAAG,SAAS,EAAE,CAAC;YAClC,OAAO,UAAU,EAAE;iBAChB,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;iBAC9C,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;gBACjB,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK;qBACzB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;qBACvG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC5F,OAAO;oBACL,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC;oBACrC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE;oBACvB,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,MAAM,CAAC,GAAG;oBACnC,MAAM,EAAE,IAAI;iBACb,CAAC;YACJ,CAAC,CAAC,CAAC;QACP,CAAC;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * A validity domain read from one condition text, the record's `holds`.\n *\n * The condition is the single source: the predicate is the conjunction of its\n * conjuncts, the description is those conjuncts written out, and a refusal\n * lists only the conjuncts that failed, each rendered with the key the caller\n * gave the input under. No record carries a second, prose statement of the\n * same domain, so the message cannot contradict the check.\n *\n * @module bridges/validity\n */\n\nimport type { DomainViolation } from './evaluation-errors.js';\nimport { conditionReads, holdsConditions, holdsScope, HoldsError, type HoldsCondition } from './holds.js';\n\n/** A domain built from a condition text. Structurally a `ValidityDomain`. @internal */\nexport interface ConditionDomain {\n  /** The conjuncts, in the relation's names, joined by `and`. */\n  readonly description: string;\n  readonly predicate: (inputs: Record<string, number>) => boolean;\n  /**\n   * The conjuncts `inputs` violate. `keyOf` names the caller's key for a name\n   * the relation reads (a parameter key for an evaluator source); a name it\n   * does not map is its own key.\n   */\n  readonly violations: (inputs: Record<string, number>, keyOf?: (name: string) => string) => readonly DomainViolation[];\n}\n\n/** A conjunct fails when it is false or cannot be evaluated (an unbound name, a non-number). */\nfunction fails(condition: HoldsCondition, scope: Readonly<Record<string, number>>): boolean {\n  try {\n    return !condition.test(scope);\n  } catch (error) {\n    if (error instanceof HoldsError) return true;\n    throw error;\n  }\n}\n\n/** `text` with each whole-word name it reads replaced by the caller's key. */\nfunction rendered(condition: HoldsCondition, keyOf: (name: string) => string): string {\n  const keys = new Map(condition.names.map((name) => [name, keyOf(name)]));\n  return condition.text.replace(/[A-Za-z_][A-Za-z0-9_-]*/g, (word) => keys.get(word) ?? word);\n}\n\n/**\n * The domain `text` states over `names` (the hyphenated quantity names it may\n * read), with `constants()` bound. `'true'` is the domain with no condition.\n * An input named for a constant that `declared` does not list, and that the\n * condition reads, is a `ConstantInputError` (a caller error, not a false condition).\n * @internal\n */\nexport function conditionDomain(\n  text: string,\n  names: () => Iterable<string>,\n  constants: () => Readonly<Record<string, number>>,\n  declared: readonly string[] = [],\n): ConditionDomain {\n  let parts: readonly HoldsCondition[] | undefined;\n  const conditions = (): readonly HoldsCondition[] => (parts ??= holdsConditions(text, [...names()]));\n  const own = (name: string): string => name;\n  return {\n    get description() {\n      return conditions().map((condition) => condition.text).join(' and ');\n    },\n    predicate: (inputs) => {\n      const scope = holdsScope(inputs, constants(), conditionReads(conditions()), declared);\n      return conditions().every((condition) => !fails(condition, scope));\n    },\n    violations: (inputs, keyOf = own) => {\n      const scope = holdsScope(inputs, constants(), conditionReads(conditions()), declared);\n      const constantNames = constants();\n      return conditions()\n        .filter((condition) => fails(condition, scope))\n        .map((condition) => {\n          const read = condition.names\n            .filter((name) => !Object.hasOwn(constantNames, name.replace(/-/g, '_')) || Object.hasOwn(inputs, name))\n            .map((name) => ({ key: keyOf(name), quantity: name, value: inputs[name] ?? Number.NaN }));\n          return {\n            condition: rendered(condition, keyOf),\n            key: read[0]?.key ?? '',\n            value: read[0]?.value ?? Number.NaN,\n            inputs: read,\n          };\n        });\n    },\n  };\n}\n"]}

package/dist/canonical/entries/atomic.js

@@ -1,9 +1,7 @@
 import { sym } from '../../dimensional/ast-builders.js';
-import { MASS, VELOCITY, ENERGY, LENGTH, AREA, ACTION, CHARGE, FREQUENCY, DIMENSIONLESS, } from '../../dimensional/types.js';
+import { MASS, VELOCITY, ENERGY, LENGTH, AREA, ACTION, CHARGE, FREQUENCY, DIMENSIONLESS, PERMITTIVITY, MOMENTUM, } from '../../dimensional/types.js';
 import { dim, op, pow, l1 } from './_l1-build.js';
-const PERMITTIVITY = dim(-3, -1, 4, 2); // ε₀ [L⁻³ M⁻¹ T⁴ I²]
 const MAGNETIC_MOMENT = dim(2, 0, 0, 1); // [L² I] (A·m²)
-const MOMENTUM = dim(1, 1, -1); // [L M T⁻¹]
 export const ATOMIC = [
     l1({ name: 'rydberg-energy', dim: ENERGY }, [
         { name: 'm_e', dim: MASS },