universal-physics-tensor 10.0.0 → 11.0.0

package/dist/composition/formula-shape.js

@@ -9,44 +9,69 @@
  *
  * @module composition/formula-shape
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
+import { isDecimalLiteral } from '../dimensional/ast-leaves.js';
 import { divide, equals, multiply, power } from '../dimensional/algebra.js';
 import { DIMENSIONLESS } from '../dimensional/types.js';
-const NUMERIC_NAME = /^[+-]?(?:\d+(?:\.\d+)?|\.\d+)$/;
+import { fractionToNumber, rationalize } from './rational-exponent.js';
 /**
- * Exponents of every symbol in a product, quotient, or literal integer power.
- * Undefined for a sum or any node that is not that monomial. The one reader
- * of a monomial's exponents: the canonical graph reads a count's exponent
- * from it, and a composed edge reads the junction's exponent from it.
+ * The rational a literal exponent stands for: a bounded-denominator scan at
+ * the fit's tolerance reads `0.3333333333333333` as `1/3`; a decimal that
+ * is no such rational (`0.3333`) is kept as the exact decimal it spells.
  *
  * @internal
  */
-export function monomialExponents(node) {
+export function rationalExponentOf(name) {
+    if (!isDecimalLiteral(name))
+        return undefined;
+    const value = Number(name);
+    if (!Number.isFinite(value))
+        return undefined;
+    const scanned = rationalize(value);
+    if (scanned !== undefined)
+        return scanned;
+    try {
+        return Fraction.parse(name);
+    }
+    catch {
+        return Fraction.fromNumber(value);
+    }
+}
+/**
+ * Exact exponents of every symbol in a product, quotient, or literal power,
+ * as core `Fraction`s. Undefined for a sum or any node that is not that
+ * monomial. A cancellation is an exact zero: `(x^(1/3))^3 / x` carries `x`
+ * at `0`, not at `2.2e-16`.
+ *
+ * @internal
+ */
+export function monomialExponentsExact(node) {
     if (node === undefined)
         return undefined;
     if (node.kind === 'symbol')
-        return new Map([[node.name, 1]]);
+        return new Map([[node.name, new Fraction(1)]]);
     if (node.kind !== 'op')
         return undefined;
     if (node.op === '*') {
         const acc = new Map();
         for (const arg of node.args) {
-            const part = monomialExponents(arg);
+            const part = monomialExponentsExact(arg);
             if (part === undefined)
                 return undefined;
             for (const [name, exp] of part)
-                acc.set(name, (acc.get(name) ?? 0) + exp);
+                acc.set(name, (acc.get(name) ?? new Fraction(0)).add(exp));
         }
         return acc;
     }
     if (node.op === '/') {
         if (node.args.length !== 2)
             return undefined;
-        const numerator = monomialExponents(node.args[0]);
-        const denominator = monomialExponents(node.args[1]);
+        const numerator = monomialExponentsExact(node.args[0]);
+        const denominator = monomialExponentsExact(node.args[1]);
         if (numerator === undefined || denominator === undefined)
             return undefined;
         for (const [name, exp] of denominator)
-            numerator.set(name, (numerator.get(name) ?? 0) - exp);
+            numerator.set(name, (numerator.get(name) ?? new Fraction(0)).sub(exp));
         return numerator;
     }
     if (node.op === '^') {
@@ -54,21 +79,36 @@ export function monomialExponents(node) {
         const expNode = node.args[1];
         if (base === undefined || expNode === undefined || expNode.kind !== 'symbol')
             return undefined;
-        const exp = Number(expNode.name);
-        if (!Number.isFinite(exp))
+        const exp = rationalExponentOf(expNode.name);
+        if (exp === undefined)
             return undefined;
-        const inner = monomialExponents(base);
+        const inner = monomialExponentsExact(base);
         if (inner === undefined)
             return undefined;
         for (const [name, innerExp] of inner)
-            inner.set(name, innerExp * exp);
+            inner.set(name, innerExp.multiply(exp));
         return inner;
     }
     return undefined;
 }
+/**
+ * Exponents of every symbol in a product, quotient, or literal power, as
+ * numbers: the projection of {@link monomialExponentsExact}. Undefined for a
+ * sum or any node that is not that monomial. The canonical graph reads a
+ * count's exponent from it, and a composed edge reads the junction's
+ * exponent from it.
+ *
+ * @internal
+ */
+export function monomialExponents(node) {
+    const exact = monomialExponentsExact(node);
+    if (exact === undefined)
+        return undefined;
+    return new Map([...exact].map(([name, exp]) => [name, fractionToNumber(exp)]));
+}
 /** A dimensionless symbol whose name is a number, the way a literal exponent is written. */
 function numericExponent(node) {
-    if (node.kind !== 'symbol' || !NUMERIC_NAME.test(node.name))
+    if (node.kind !== 'symbol' || !isDecimalLiteral(node.name))
         return undefined;
     if (!equals(node.dim, DIMENSIONLESS))
         return undefined;

package/dist/composition/formula-shape.js.map

@@ -1 +1 @@
-{"version":3,"file":"formula-shape.js","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAKxD,MAAM,YAAY,GAAG,gCAAgC,CAAC;AAEtD;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA0B;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,SAAS,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3E,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5C,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,CAAC;QACtE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,4FAA4F;AAC5F,SAAS,eAAe,CAAC,IAAc;IACrC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,SAAS,CAAC;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,IAAc;IAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,OAAO,SAAS,CAAC;QACvE,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAc,aAAa,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7D,OAAO,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC9D,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5G,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3I,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,wBAAwB;QAAE,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAc;IACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,EAAE,aAAa,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU,CAAC;AAClE,CAAC","sourcesContent":["/**\n * Whether an encoded formula is a product of powers, or a sum of dimensionful terms.\n *\n * Buckingham-π returns a monomial. A formula that adds dimensionful terms is\n * not that monomial, even when a unique monomial exists in the same variables\n * (fast magnetosonic speed: the monomial is the sound speed; the formula is\n * √(c_s² + v_A²)). A sum whose every addend is dimensionless is still a\n * factor in a monomial: (1+R), (1−e²), (1 + E/(kT)).\n *\n * @module composition/formula-shape\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { divide, equals, multiply, power } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\n\n/** `monomial` is a product of powers. `dimensional-sum` adds dimensionful terms. */\ntype FormulaShape = 'monomial' | 'dimensional-sum';\n\nconst NUMERIC_NAME = /^[+-]?(?:\\d+(?:\\.\\d+)?|\\.\\d+)$/;\n\n/**\n * Exponents of every symbol in a product, quotient, or literal integer power.\n * Undefined for a sum or any node that is not that monomial. The one reader\n * of a monomial's exponents: the canonical graph reads a count's exponent\n * from it, and a composed edge reads the junction's exponent from it.\n *\n * @internal\n */\nexport function monomialExponents(node: ExprNode | undefined): Map<string, number> | undefined {\n  if (node === undefined) return undefined;\n  if (node.kind === 'symbol') return new Map([[node.name, 1]]);\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    const acc = new Map<string, number>();\n    for (const arg of node.args) {\n      const part = monomialExponents(arg);\n      if (part === undefined) return undefined;\n      for (const [name, exp] of part) acc.set(name, (acc.get(name) ?? 0) + exp);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const numerator = monomialExponents(node.args[0]);\n    const denominator = monomialExponents(node.args[1]);\n    if (numerator === undefined || denominator === undefined) return undefined;\n    for (const [name, exp] of denominator) numerator.set(name, (numerator.get(name) ?? 0) - exp);\n    return numerator;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return undefined;\n    const exp = Number(expNode.name);\n    if (!Number.isFinite(exp)) return undefined;\n    const inner = monomialExponents(base);\n    if (inner === undefined) return undefined;\n    for (const [name, innerExp] of inner) inner.set(name, innerExp * exp);\n    return inner;\n  }\n  return undefined;\n}\n\n/** A dimensionless symbol whose name is a number, the way a literal exponent is written. */\nfunction numericExponent(node: ExprNode): number | undefined {\n  if (node.kind !== 'symbol' || !NUMERIC_NAME.test(node.name)) return undefined;\n  if (!equals(node.dim, DIMENSIONLESS)) return undefined;\n  const n = Number(node.name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * Dimension of a scalar node this classifier understands. `undefined` means\n * the node is not a product of powers of dimensioned symbols. A sum that\n * cannot be dimensioned is treated as dimensionful.\n */\nfunction dimOf(node: ExprNode): Dimension | undefined {\n  if (node.kind === 'symbol') return node.dim;\n  if (node.kind === 'abs') return dimOf(node.arg);\n  if (node.kind === 'transcendental') {\n    const arg = dimOf(node.arg);\n    if (arg === undefined || !equals(arg, DIMENSIONLESS)) return undefined;\n    return DIMENSIONLESS;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '+' || node.op === '-') {\n    if (node.args.length === 0) return undefined;\n    const dims = node.args.map(dimOf);\n    if (dims.some((d) => d === undefined)) return undefined;\n    const first = dims[0]!;\n    if (!dims.every((d) => equals(d!, first))) return undefined;\n    return first;\n  }\n  if (node.op === '*') {\n    let acc: Dimension = DIMENSIONLESS;\n    for (const arg of node.args) {\n      const d = dimOf(arg);\n      if (d === undefined) return undefined;\n      acc = multiply(acc, d);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const num = dimOf(node.args[0]!);\n    const den = dimOf(node.args[1]!);\n    if (num === undefined || den === undefined) return undefined;\n    return divide(num, den);\n  }\n  if (node.op === '^') {\n    if (node.args.length !== 2) return undefined;\n    const base = dimOf(node.args[0]!);\n    const exp = numericExponent(node.args[1]!);\n    if (base === undefined || exp === undefined) return undefined;\n    return power(base, exp);\n  }\n  return undefined;\n}\n\n/** Scalar children. A tensor node this walker does not understand contributes none. */\nfunction children(node: ExprNode): readonly ExprNode[] {\n  if (node.kind === 'op') return node.args;\n  if (node.kind === 'abs' || node.kind === 'transcendental' || node.kind === 'dirac-delta') return [node.arg];\n  if (node.kind === 'integral') {\n    return [node.over, node.integrand, ...(node.lower === undefined ? [] : [node.lower]), ...(node.upper === undefined ? [] : [node.upper])];\n  }\n  if (node.kind === 'derivative') return [node.of, node.wrt];\n  if (node.kind === 'variational-derivative') return [node.functional, node.field, node.over];\n  return [];\n}\n\n/**\n * True when `node` adds terms that are not all dimensionless. An addend whose\n * dimension cannot be read counts as dimensionful: a sum we cannot see is not\n * reported as a monomial.\n */\nfunction isDimensionalSum(node: ExprNode): boolean {\n  if (node.kind !== 'op' || (node.op !== '+' && node.op !== '-')) return false;\n  const dims = node.args.map(dimOf);\n  if (dims.some((d) => d === undefined)) return true;\n  return dims.some((d) => !equals(d!, DIMENSIONLESS));\n}\n\nfunction hasDimensionalSum(node: ExprNode): boolean {\n  if (isDimensionalSum(node)) return true;\n  return children(node).some(hasDimensionalSum);\n}\n\n/**\n * Classify `expr`. A node this walker does not understand, and that is not\n * itself a sum, stays a monomial so an unread tensor equation is not\n * reclassified.\n */\nexport function formulaShape(expr: ExprNode): FormulaShape {\n  return hasDimensionalSum(expr) ? 'dimensional-sum' : 'monomial';\n}\n"]}
+{"version":3,"file":"formula-shape.js","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAKvE;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,OAAO,CAAC;IAC1C,IAAI,CAAC;QACH,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAA0B;IAC/D,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,SAAS,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3E,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9G,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACxC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA0B;IAC1D,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,4FAA4F;AAC5F,SAAS,eAAe,CAAC,IAAc;IACrC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,SAAS,CAAC;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,IAAc;IAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,OAAO,SAAS,CAAC;QACvE,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAc,aAAa,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7D,OAAO,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC9D,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5G,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3I,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,wBAAwB;QAAE,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAc;IACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,EAAE,aAAa,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU,CAAC;AAClE,CAAC","sourcesContent":["/**\n * Whether an encoded formula is a product of powers, or a sum of dimensionful terms.\n *\n * Buckingham-π returns a monomial. A formula that adds dimensionful terms is\n * not that monomial, even when a unique monomial exists in the same variables\n * (fast magnetosonic speed: the monomial is the sound speed; the formula is\n * √(c_s² + v_A²)). A sum whose every addend is dimensionless is still a\n * factor in a monomial: (1+R), (1−e²), (1 + E/(kT)).\n *\n * @module composition/formula-shape\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { isDecimalLiteral } from '../dimensional/ast-leaves.js';\nimport { divide, equals, multiply, power } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { fractionToNumber, rationalize } from './rational-exponent.js';\n\n/** `monomial` is a product of powers. `dimensional-sum` adds dimensionful terms. */\ntype FormulaShape = 'monomial' | 'dimensional-sum';\n\n/**\n * The rational a literal exponent stands for: a bounded-denominator scan at\n * the fit's tolerance reads `0.3333333333333333` as `1/3`; a decimal that\n * is no such rational (`0.3333`) is kept as the exact decimal it spells.\n *\n * @internal\n */\nexport function rationalExponentOf(name: string): Fraction | undefined {\n  if (!isDecimalLiteral(name)) return undefined;\n  const value = Number(name);\n  if (!Number.isFinite(value)) return undefined;\n  const scanned = rationalize(value);\n  if (scanned !== undefined) return scanned;\n  try {\n    return Fraction.parse(name);\n  } catch {\n    return Fraction.fromNumber(value);\n  }\n}\n\n/**\n * Exact exponents of every symbol in a product, quotient, or literal power,\n * as core `Fraction`s. Undefined for a sum or any node that is not that\n * monomial. A cancellation is an exact zero: `(x^(1/3))^3 / x` carries `x`\n * at `0`, not at `2.2e-16`.\n *\n * @internal\n */\nexport function monomialExponentsExact(node: ExprNode | undefined): Map<string, Fraction> | undefined {\n  if (node === undefined) return undefined;\n  if (node.kind === 'symbol') return new Map([[node.name, new Fraction(1)]]);\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    const acc = new Map<string, Fraction>();\n    for (const arg of node.args) {\n      const part = monomialExponentsExact(arg);\n      if (part === undefined) return undefined;\n      for (const [name, exp] of part) acc.set(name, (acc.get(name) ?? new Fraction(0)).add(exp));\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const numerator = monomialExponentsExact(node.args[0]);\n    const denominator = monomialExponentsExact(node.args[1]);\n    if (numerator === undefined || denominator === undefined) return undefined;\n    for (const [name, exp] of denominator) numerator.set(name, (numerator.get(name) ?? new Fraction(0)).sub(exp));\n    return numerator;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return undefined;\n    const exp = rationalExponentOf(expNode.name);\n    if (exp === undefined) return undefined;\n    const inner = monomialExponentsExact(base);\n    if (inner === undefined) return undefined;\n    for (const [name, innerExp] of inner) inner.set(name, innerExp.multiply(exp));\n    return inner;\n  }\n  return undefined;\n}\n\n/**\n * Exponents of every symbol in a product, quotient, or literal power, as\n * numbers: the projection of {@link monomialExponentsExact}. Undefined for a\n * sum or any node that is not that monomial. The canonical graph reads a\n * count's exponent from it, and a composed edge reads the junction's\n * exponent from it.\n *\n * @internal\n */\nexport function monomialExponents(node: ExprNode | undefined): Map<string, number> | undefined {\n  const exact = monomialExponentsExact(node);\n  if (exact === undefined) return undefined;\n  return new Map([...exact].map(([name, exp]) => [name, fractionToNumber(exp)]));\n}\n\n/** A dimensionless symbol whose name is a number, the way a literal exponent is written. */\nfunction numericExponent(node: ExprNode): number | undefined {\n  if (node.kind !== 'symbol' || !isDecimalLiteral(node.name)) return undefined;\n  if (!equals(node.dim, DIMENSIONLESS)) return undefined;\n  const n = Number(node.name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * Dimension of a scalar node this classifier understands. `undefined` means\n * the node is not a product of powers of dimensioned symbols. A sum that\n * cannot be dimensioned is treated as dimensionful.\n */\nfunction dimOf(node: ExprNode): Dimension | undefined {\n  if (node.kind === 'symbol') return node.dim;\n  if (node.kind === 'abs') return dimOf(node.arg);\n  if (node.kind === 'transcendental') {\n    const arg = dimOf(node.arg);\n    if (arg === undefined || !equals(arg, DIMENSIONLESS)) return undefined;\n    return DIMENSIONLESS;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '+' || node.op === '-') {\n    if (node.args.length === 0) return undefined;\n    const dims = node.args.map(dimOf);\n    if (dims.some((d) => d === undefined)) return undefined;\n    const first = dims[0]!;\n    if (!dims.every((d) => equals(d!, first))) return undefined;\n    return first;\n  }\n  if (node.op === '*') {\n    let acc: Dimension = DIMENSIONLESS;\n    for (const arg of node.args) {\n      const d = dimOf(arg);\n      if (d === undefined) return undefined;\n      acc = multiply(acc, d);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const num = dimOf(node.args[0]!);\n    const den = dimOf(node.args[1]!);\n    if (num === undefined || den === undefined) return undefined;\n    return divide(num, den);\n  }\n  if (node.op === '^') {\n    if (node.args.length !== 2) return undefined;\n    const base = dimOf(node.args[0]!);\n    const exp = numericExponent(node.args[1]!);\n    if (base === undefined || exp === undefined) return undefined;\n    return power(base, exp);\n  }\n  return undefined;\n}\n\n/** Scalar children. A tensor node this walker does not understand contributes none. */\nfunction children(node: ExprNode): readonly ExprNode[] {\n  if (node.kind === 'op') return node.args;\n  if (node.kind === 'abs' || node.kind === 'transcendental' || node.kind === 'dirac-delta') return [node.arg];\n  if (node.kind === 'integral') {\n    return [node.over, node.integrand, ...(node.lower === undefined ? [] : [node.lower]), ...(node.upper === undefined ? [] : [node.upper])];\n  }\n  if (node.kind === 'derivative') return [node.of, node.wrt];\n  if (node.kind === 'variational-derivative') return [node.functional, node.field, node.over];\n  return [];\n}\n\n/**\n * True when `node` adds terms that are not all dimensionless. An addend whose\n * dimension cannot be read counts as dimensionful: a sum we cannot see is not\n * reported as a monomial.\n */\nfunction isDimensionalSum(node: ExprNode): boolean {\n  if (node.kind !== 'op' || (node.op !== '+' && node.op !== '-')) return false;\n  const dims = node.args.map(dimOf);\n  if (dims.some((d) => d === undefined)) return true;\n  return dims.some((d) => !equals(d!, DIMENSIONLESS));\n}\n\nfunction hasDimensionalSum(node: ExprNode): boolean {\n  if (isDimensionalSum(node)) return true;\n  return children(node).some(hasDimensionalSum);\n}\n\n/**\n * Classify `expr`. A node this walker does not understand, and that is not\n * itself a sum, stays a monomial so an unread tensor equation is not\n * reclassified.\n */\nexport function formulaShape(expr: ExprNode): FormulaShape {\n  return hasDimensionalSum(expr) ? 'dimensional-sum' : 'monomial';\n}\n"]}

package/dist/composition/graph-structure.d.ts

@@ -0,0 +1,98 @@
+/**
+ * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.
+ *
+ * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two
+ * quantities are linked, undirected, when they occur in one equation together (sources and
+ * target), weighted by how many equations hold both. A directed arc runs from each source
+ * quantity to its equation's target. Three readings of it, each stated for what it is:
+ *
+ *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS
+ *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place
+ *     quantities near each other. It is never a physics claim: two quantities in one community
+ *     share equations, which the map already showed; a community boundary is not a regime
+ *     boundary and not a cluster of related physics.
+ *   - {@link derivationCycles} — strongly connected components (MathTS
+ *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities
+ *     each of which can be derived from the others round a loop. That is where over-determination
+ *     lives, and where `retrodict` has two routes to compare.
+ *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),
+ *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,
+ *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of
+ *     the drawing, not a central quantity of physics.
+ *
+ * @module composition/graph-structure
+ */
+import type { BridgeEdge } from './edge.js';
+/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */
+export declare const COMMUNITY_METHOD: 'layout communities (Louvain, heuristic)';
+/** The quantity graph of a composition graph. @internal */
+export interface QuantityGraph {
+    /** Canonical quantity names, in first-seen order; the index of each is its node. */
+    readonly names: readonly string[];
+    /** Symmetric co-occurrence weights: `undirected[i][j]` is the number of equations holding both. */
+    readonly undirected: number[][];
+    /** Directed arcs: `directed[i][j]` is 1 when an equation derives `j` from a source set containing `i`. */
+    readonly directed: number[][];
+}
+/**
+ * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of
+ * its sources contributes no self-arc and no self-link.
+ *
+ * @internal
+ */
+export declare function quantityGraph(edges: readonly BridgeEdge[]): QuantityGraph;
+/** One layout community: a set of quantities a drawing may place together. @internal */
+export interface LayoutCommunity {
+    /** Sorted canonical quantity names. */
+    readonly quantities: readonly string[];
+    readonly size: number;
+}
+/** The community report of the largest connected component. @internal */
+export interface CommunityReport {
+    /** Always {@link COMMUNITY_METHOD}: the reading is a layout heuristic. */
+    readonly method: typeof COMMUNITY_METHOD;
+    /** Quantity nodes in the largest component (0 on an empty graph). */
+    readonly componentSize: number;
+    /** Communities, largest first, then by first quantity. */
+    readonly communities: readonly LayoutCommunity[];
+}
+/**
+ * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the
+ * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)
+ * and not guaranteed optimal. Presented as layout, never as physics: see the module note.
+ *
+ * @internal
+ */
+export declare function communitiesOf(edges: readonly BridgeEdge[]): CommunityReport;
+/** One derivation cycle: quantities each derivable from the others round a loop, and the equations closing it. @internal */
+export interface DerivationCycle {
+    /** Sorted canonical quantity names of the strongly connected component (at least two). */
+    readonly quantities: readonly string[];
+    /** Ids of the equations with a source and the target inside the component, in graph order. */
+    readonly edges: readonly string[];
+}
+/**
+ * The derivation cycles of `edges`: strongly connected components of size two or more in the
+ * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation
+ * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.
+ *
+ * @internal
+ */
+export declare function derivationCycles(edges: readonly BridgeEdge[]): DerivationCycle[];
+/** One quantity's hub rank. @internal */
+export interface HubRank {
+    readonly quantity: string;
+    /** Normalised betweenness centrality in the undirected quantity graph: 0 for a leaf, 1 for the centre of a star. */
+    readonly betweenness: number;
+    /** Distinct quantities it shares an equation with. */
+    readonly degree: number;
+}
+/**
+ * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised
+ * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map
+ * path. A graph of fewer than three quantities has no interior path, so every score is 0.
+ *
+ * @internal
+ */
+export declare function rankHubs(edges: readonly BridgeEdge[]): Promise<HubRank[]>;
+//# sourceMappingURL=graph-structure.d.ts.map

package/dist/composition/graph-structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-structure.d.ts","sourceRoot":"","sources":["../../src/composition/graph-structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAQH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAG5C,qHAAqH;AACrH,eAAO,MAAM,gBAAgB,EAAG,yCAAkD,CAAC;AAEnF,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,oFAAoF;IACpF,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,mGAAmG;IACnG,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IAChC,0GAA0G;IAC1G,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;CAC/B;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,aAAa,CAgCzE;AAED,wFAAwF;AACxF,MAAM,WAAW,eAAe;IAC9B,uCAAuC;IACvC,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,yEAAyE;AACzE,MAAM,WAAW,eAAe;IAC9B,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,OAAO,gBAAgB,CAAC;IACzC,qEAAqE;IACrE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,0DAA0D;IAC1D,QAAQ,CAAC,WAAW,EAAE,SAAS,eAAe,EAAE,CAAC;CAClD;AAeD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,eAAe,CAa3E;AAED,4HAA4H;AAC5H,MAAM,WAAW,eAAe;IAC9B,0FAA0F;IAC1F,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,8FAA8F;IAC9F,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,eAAe,EAAE,CAwBhF;AAED,yCAAyC;AACzC,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,oHAAoH;IACpH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAsB,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAmB/E"}

package/dist/composition/graph-structure.js

@@ -0,0 +1,167 @@
+/**
+ * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.
+ *
+ * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two
+ * quantities are linked, undirected, when they occur in one equation together (sources and
+ * target), weighted by how many equations hold both. A directed arc runs from each source
+ * quantity to its equation's target. Three readings of it, each stated for what it is:
+ *
+ *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS
+ *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place
+ *     quantities near each other. It is never a physics claim: two quantities in one community
+ *     share equations, which the map already showed; a community boundary is not a regime
+ *     boundary and not a cluster of related physics.
+ *   - {@link derivationCycles} — strongly connected components (MathTS
+ *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities
+ *     each of which can be derived from the others round a loop. That is where over-determination
+ *     lives, and where `retrodict` has two routes to compare.
+ *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),
+ *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,
+ *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of
+ *     the drawing, not a central quantity of physics.
+ *
+ * @module composition/graph-structure
+ */
+import { betweennessCentrality, connectedComponents, louvainCommunities, stronglyConnectedComponents, } from '@danielsimonjr/mathts-functions';
+import { quantityCanonicalizer } from './quantity-clusters.js';
+/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */
+export const COMMUNITY_METHOD = 'layout communities (Louvain, heuristic)';
+/**
+ * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of
+ * its sources contributes no self-arc and no self-link.
+ *
+ * @internal
+ */
+export function quantityGraph(edges) {
+    const canon = quantityCanonicalizer();
+    const index = new Map();
+    const names = [];
+    const nodeOf = (raw) => {
+        const name = canon(raw);
+        let i = index.get(name);
+        if (i === undefined) {
+            i = names.length;
+            names.push(name);
+            index.set(name, i);
+        }
+        return i;
+    };
+    const members = edges.map((e) => ({
+        sources: [...new Set(e.sources.map((s) => nodeOf(s.name)))],
+        target: nodeOf(e.target.name),
+    }));
+    const n = names.length;
+    const undirected = Array.from({ length: n }, () => new Array(n).fill(0));
+    const directed = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (const m of members) {
+        const all = [...new Set([...m.sources, m.target])];
+        for (let a = 0; a < all.length; a++) {
+            for (let b = a + 1; b < all.length; b++) {
+                undirected[all[a]][all[b]] += 1;
+                undirected[all[b]][all[a]] += 1;
+            }
+        }
+        for (const s of m.sources)
+            if (s !== m.target)
+                directed[s][m.target] = 1;
+    }
+    return { names, undirected, directed };
+}
+/** 0/1 copy of a weighted adjacency. */
+function binary(weighted) {
+    return weighted.map((row) => row.map((w) => (w > 0 ? 1 : 0)));
+}
+/** The connected components of the undirected quantity graph, largest first, each sorted by node index. */
+function undirectedComponents(g) {
+    if (g.names.length === 0)
+        return [];
+    const comps = connectedComponents(binary(g.undirected)).map((c) => [...c].sort((a, b) => a - b));
+    comps.sort((a, b) => b.length - a.length || g.names[a[0]].localeCompare(g.names[b[0]]));
+    return comps;
+}
+/**
+ * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the
+ * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)
+ * and not guaranteed optimal. Presented as layout, never as physics: see the module note.
+ *
+ * @internal
+ */
+export function communitiesOf(edges) {
+    const g = quantityGraph(edges);
+    const comps = undirectedComponents(g);
+    if (comps.length === 0)
+        return { method: COMMUNITY_METHOD, componentSize: 0, communities: [] };
+    const largest = comps[0];
+    const sub = largest.map((i) => largest.map((j) => g.undirected[i][j]));
+    const partition = louvainCommunities(sub);
+    const communities = partition.map((group) => {
+        const quantities = group.map((k) => g.names[largest[k]]).sort();
+        return { quantities, size: quantities.length };
+    });
+    communities.sort((a, b) => b.size - a.size || a.quantities[0].localeCompare(b.quantities[0]));
+    return { method: COMMUNITY_METHOD, componentSize: largest.length, communities };
+}
+/**
+ * The derivation cycles of `edges`: strongly connected components of size two or more in the
+ * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation
+ * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.
+ *
+ * @internal
+ */
+export function derivationCycles(edges) {
+    const g = quantityGraph(edges);
+    if (g.names.length === 0)
+        return [];
+    const canon = quantityCanonicalizer();
+    const index = new Map(g.names.map((name, i) => [name, i]));
+    const cycles = [];
+    for (const scc of stronglyConnectedComponents(g.directed)) {
+        if (scc.length < 2)
+            continue;
+        const inside = new Set(scc);
+        const quantities = scc.map((i) => g.names[i]).sort();
+        const closing = edges
+            .filter((e) => {
+            const t = index.get(canon(e.target.name));
+            if (t === undefined || !inside.has(t))
+                return false;
+            return e.sources.some((s) => {
+                const si = index.get(canon(s.name));
+                return si !== undefined && si !== t && inside.has(si);
+            });
+        })
+            .map((e) => e.id);
+        cycles.push({ quantities, edges: closing });
+    }
+    cycles.sort((a, b) => b.quantities.length - a.quantities.length || a.quantities[0].localeCompare(b.quantities[0]));
+    return cycles;
+}
+/**
+ * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised
+ * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map
+ * path. A graph of fewer than three quantities has no interior path, so every score is 0.
+ *
+ * @internal
+ */
+export async function rankHubs(edges) {
+    const g = quantityGraph(edges);
+    const n = g.names.length;
+    const adjacency = binary(g.undirected);
+    const degree = adjacency.map((row) => row.reduce((acc, x) => acc + x, 0));
+    let scores;
+    if (n < 3) {
+        scores = new Array(n).fill(0);
+    }
+    else {
+        const result = await betweennessCentrality(adjacency, { directed: false, normalized: true });
+        const centrality = result.centrality;
+        if (!(centrality instanceof Float64Array) || centrality.length !== n) {
+            throw new TypeError(`betweennessCentrality returned ${String(centrality)} for ${n} nodes`);
+        }
+        scores = Array.from(centrality);
+    }
+    const ranks = g.names.map((quantity, i) => ({ quantity, betweenness: scores[i], degree: degree[i] }));
+    ranks.sort((a, b) => b.betweenness - a.betweenness || a.quantity.localeCompare(b.quantity));
+    return ranks;
+}
+//# sourceMappingURL=graph-structure.js.map

package/dist/composition/graph-structure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-structure.js","sourceRoot":"","sources":["../../src/composition/graph-structure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EACL,qBAAqB,EACrB,mBAAmB,EACnB,kBAAkB,EAClB,2BAA2B,GAC5B,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,qHAAqH;AACrH,MAAM,CAAC,MAAM,gBAAgB,GAAG,yCAAkD,CAAC;AAYnF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAA4B;IACxD,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,GAAW,EAAU,EAAE;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;KAC9B,CAAC,CAAC,CAAC;IACJ,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM;gBAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AACzC,CAAC;AAmBD,wCAAwC;AACxC,SAAS,MAAM,CAAC,QAAwC;IACtD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,CAAC;AAED,2GAA2G;AAC3G,SAAS,oBAAoB,CAAC,CAAgB;IAC5C,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAA4B;IACxD,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;IAC/F,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAsB,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC;AAClF,CAAC;AAUD;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA4B;IAC3D,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,KAAK,MAAM,GAAG,IAAI,2BAA2B,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,KAAK;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACpD,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACpC,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;aACD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnH,OAAO,MAAM,CAAC;AAChB,CAAC;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,KAA4B;IACzD,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,MAAgB,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;SAAM,CAAC;QACN,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7F,MAAM,UAAU,GAAY,MAAM,CAAC,UAAU,CAAC;QAC9C,IAAI,CAAC,CAAC,UAAU,YAAY,YAAY,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,MAAM,IAAI,SAAS,CAAC,kCAAkC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7F,CAAC;QACD,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5F,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/**\n * Map structure from graph algorithms, over the QUANTITY graph of a composition graph.\n *\n * The quantity graph has one node per canonical quantity name (`quantityCanonicalizer`). Two\n * quantities are linked, undirected, when they occur in one equation together (sources and\n * target), weighted by how many equations hold both. A directed arc runs from each source\n * quantity to its equation's target. Three readings of it, each stated for what it is:\n *\n *   - {@link communitiesOf} — LAYOUT communities of the largest component (MathTS\n *     `louvainCommunities`, a modularity heuristic). A community is where a drawing may place\n *     quantities near each other. It is never a physics claim: two quantities in one community\n *     share equations, which the map already showed; a community boundary is not a regime\n *     boundary and not a cluster of related physics.\n *   - {@link derivationCycles} — strongly connected components (MathTS\n *     `stronglyConnectedComponents`) of the directed source→target graph: the sets of quantities\n *     each of which can be derived from the others round a loop. That is where over-determination\n *     lives, and where `retrodict` has two routes to compare.\n *   - {@link rankHubs} — betweenness centrality (MathTS `betweennessCentrality`, normalised),\n *     ON DEMAND ONLY: Brandes' algorithm is O(n·m) per call over about five hundred quantity nodes,\n *     so the default `upt map` path does not call it. A hub by betweenness is a cut quantity of\n *     the drawing, not a central quantity of physics.\n *\n * @module composition/graph-structure\n */\n\nimport {\n  betweennessCentrality,\n  connectedComponents,\n  louvainCommunities,\n  stronglyConnectedComponents,\n} from '@danielsimonjr/mathts-functions';\nimport type { BridgeEdge } from './edge.js';\nimport { quantityCanonicalizer } from './quantity-clusters.js';\n\n/** The label every community report and printout carries, so a reader never takes a layout for physics. @internal */\nexport const COMMUNITY_METHOD = 'layout communities (Louvain, heuristic)' as const;\n\n/** The quantity graph of a composition graph. @internal */\nexport interface QuantityGraph {\n  /** Canonical quantity names, in first-seen order; the index of each is its node. */\n  readonly names: readonly string[];\n  /** Symmetric co-occurrence weights: `undirected[i][j]` is the number of equations holding both. */\n  readonly undirected: number[][];\n  /** Directed arcs: `directed[i][j]` is 1 when an equation derives `j` from a source set containing `i`. */\n  readonly directed: number[][];\n}\n\n/**\n * Build the quantity graph of `edges` (canonical names). An equation whose target is also one of\n * its sources contributes no self-arc and no self-link.\n *\n * @internal\n */\nexport function quantityGraph(edges: readonly BridgeEdge[]): QuantityGraph {\n  const canon = quantityCanonicalizer();\n  const index = new Map<string, number>();\n  const names: string[] = [];\n  const nodeOf = (raw: string): number => {\n    const name = canon(raw);\n    let i = index.get(name);\n    if (i === undefined) {\n      i = names.length;\n      names.push(name);\n      index.set(name, i);\n    }\n    return i;\n  };\n  const members = edges.map((e) => ({\n    sources: [...new Set(e.sources.map((s) => nodeOf(s.name)))],\n    target: nodeOf(e.target.name),\n  }));\n  const n = names.length;\n  const undirected = Array.from({ length: n }, () => new Array<number>(n).fill(0));\n  const directed = Array.from({ length: n }, () => new Array<number>(n).fill(0));\n  for (const m of members) {\n    const all = [...new Set([...m.sources, m.target])];\n    for (let a = 0; a < all.length; a++) {\n      for (let b = a + 1; b < all.length; b++) {\n        undirected[all[a]][all[b]] += 1;\n        undirected[all[b]][all[a]] += 1;\n      }\n    }\n    for (const s of m.sources) if (s !== m.target) directed[s][m.target] = 1;\n  }\n  return { names, undirected, directed };\n}\n\n/** One layout community: a set of quantities a drawing may place together. @internal */\nexport interface LayoutCommunity {\n  /** Sorted canonical quantity names. */\n  readonly quantities: readonly string[];\n  readonly size: number;\n}\n\n/** The community report of the largest connected component. @internal */\nexport interface CommunityReport {\n  /** Always {@link COMMUNITY_METHOD}: the reading is a layout heuristic. */\n  readonly method: typeof COMMUNITY_METHOD;\n  /** Quantity nodes in the largest component (0 on an empty graph). */\n  readonly componentSize: number;\n  /** Communities, largest first, then by first quantity. */\n  readonly communities: readonly LayoutCommunity[];\n}\n\n/** 0/1 copy of a weighted adjacency. */\nfunction binary(weighted: readonly (readonly number[])[]): number[][] {\n  return weighted.map((row) => row.map((w) => (w > 0 ? 1 : 0)));\n}\n\n/** The connected components of the undirected quantity graph, largest first, each sorted by node index. */\nfunction undirectedComponents(g: QuantityGraph): number[][] {\n  if (g.names.length === 0) return [];\n  const comps = connectedComponents(binary(g.undirected)).map((c) => [...c].sort((a, b) => a - b));\n  comps.sort((a, b) => b.length - a.length || g.names[a[0]].localeCompare(g.names[b[0]]));\n  return comps;\n}\n\n/**\n * Layout communities (Louvain, heuristic) of the largest component's quantity graph, over the\n * co-occurrence weights. MathTS's Louvain is deterministic (no seed is taken, none is offered)\n * and not guaranteed optimal. Presented as layout, never as physics: see the module note.\n *\n * @internal\n */\nexport function communitiesOf(edges: readonly BridgeEdge[]): CommunityReport {\n  const g = quantityGraph(edges);\n  const comps = undirectedComponents(g);\n  if (comps.length === 0) return { method: COMMUNITY_METHOD, componentSize: 0, communities: [] };\n  const largest = comps[0];\n  const sub = largest.map((i) => largest.map((j) => g.undirected[i][j]));\n  const partition = louvainCommunities(sub);\n  const communities: LayoutCommunity[] = partition.map((group) => {\n    const quantities = group.map((k) => g.names[largest[k]]).sort();\n    return { quantities, size: quantities.length };\n  });\n  communities.sort((a, b) => b.size - a.size || a.quantities[0].localeCompare(b.quantities[0]));\n  return { method: COMMUNITY_METHOD, componentSize: largest.length, communities };\n}\n\n/** One derivation cycle: quantities each derivable from the others round a loop, and the equations closing it. @internal */\nexport interface DerivationCycle {\n  /** Sorted canonical quantity names of the strongly connected component (at least two). */\n  readonly quantities: readonly string[];\n  /** Ids of the equations with a source and the target inside the component, in graph order. */\n  readonly edges: readonly string[];\n}\n\n/**\n * The derivation cycles of `edges`: strongly connected components of size two or more in the\n * directed source→target quantity graph (MathTS `stronglyConnectedComponents`). An equation\n * whose target is one of its own sources is not a cycle. Largest first, then by first quantity.\n *\n * @internal\n */\nexport function derivationCycles(edges: readonly BridgeEdge[]): DerivationCycle[] {\n  const g = quantityGraph(edges);\n  if (g.names.length === 0) return [];\n  const canon = quantityCanonicalizer();\n  const index = new Map(g.names.map((name, i) => [name, i]));\n  const cycles: DerivationCycle[] = [];\n  for (const scc of stronglyConnectedComponents(g.directed)) {\n    if (scc.length < 2) continue;\n    const inside = new Set(scc);\n    const quantities = scc.map((i) => g.names[i]).sort();\n    const closing = edges\n      .filter((e) => {\n        const t = index.get(canon(e.target.name));\n        if (t === undefined || !inside.has(t)) return false;\n        return e.sources.some((s) => {\n          const si = index.get(canon(s.name));\n          return si !== undefined && si !== t && inside.has(si);\n        });\n      })\n      .map((e) => e.id);\n    cycles.push({ quantities, edges: closing });\n  }\n  cycles.sort((a, b) => b.quantities.length - a.quantities.length || a.quantities[0].localeCompare(b.quantities[0]));\n  return cycles;\n}\n\n/** One quantity's hub rank. @internal */\nexport interface HubRank {\n  readonly quantity: string;\n  /** Normalised betweenness centrality in the undirected quantity graph: 0 for a leaf, 1 for the centre of a star. */\n  readonly betweenness: number;\n  /** Distinct quantities it shares an equation with. */\n  readonly degree: number;\n}\n\n/**\n * Rank quantities by betweenness centrality (MathTS `betweennessCentrality`, Brandes, normalised\n * by `(n−1)(n−2)`), highest first, ties by name. ON DEMAND ONLY: not called by the default map\n * path. A graph of fewer than three quantities has no interior path, so every score is 0.\n *\n * @internal\n */\nexport async function rankHubs(edges: readonly BridgeEdge[]): Promise<HubRank[]> {\n  const g = quantityGraph(edges);\n  const n = g.names.length;\n  const adjacency = binary(g.undirected);\n  const degree = adjacency.map((row) => row.reduce((acc, x) => acc + x, 0));\n  let scores: number[];\n  if (n < 3) {\n    scores = new Array<number>(n).fill(0);\n  } else {\n    const result = await betweennessCentrality(adjacency, { directed: false, normalized: true });\n    const centrality: unknown = result.centrality;\n    if (!(centrality instanceof Float64Array) || centrality.length !== n) {\n      throw new TypeError(`betweennessCentrality returned ${String(centrality)} for ${n} nodes`);\n    }\n    scores = Array.from(centrality);\n  }\n  const ranks = g.names.map((quantity, i) => ({ quantity, betweenness: scores[i], degree: degree[i] }));\n  ranks.sort((a, b) => b.betweenness - a.betweenness || a.quantity.localeCompare(b.quantity));\n  return ranks;\n}\n"]}

package/dist/composition/graph-viz-svg.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz-svg.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,qBAAa,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,SAC8B,EAItC;CACF;AASD;;;;;;GAMG;AACH,wBAAsB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CASjE"}
+{"version":3,"file":"graph-viz-svg.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH;;;;;;GAMG;AACH,qBAAa,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,SAC8B,EAItC;CACF;AAWD;;;;;;GAMG;AACH,wBAAsB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CASjE"}

package/dist/composition/graph-viz-svg.js

@@ -34,7 +34,7 @@ export class SvgRendererUnavailableError extends Error {
 export async function renderDotToSvg(dot) {
     let viz;
     try {
-        viz = (await import('@viz-js/viz'));
+        viz = await import('@viz-js/viz');
     }
     catch {
         throw new SvgRendererUnavailableError();

package/dist/composition/graph-viz-svg.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz-svg.js","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,GAAG,+DAA+D;QACvE,mCAAmC;QAErC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AASD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,GAAW;IAC9C,IAAI,GAAc,CAAC;IACnB,IAAI,CAAC;QACH,GAAG,GAAG,CAAC,MAAM,MAAM,CAAC,aAAa,CAAC,CAAyB,CAAC;IAC9D,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,2BAA2B,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,EAAE,CAAC;IACtC,OAAO,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;AACvD,CAAC","sourcesContent":["/**\n * SVG rendering for the physics map — render Graphviz DOT source to an SVG\n * string via the optional **`@viz-js/viz`** peer (the real Graphviz compiled to\n * WebAssembly: same `dot` output, in-process, no native binary, no subprocess).\n *\n * Kept separate from `graph-viz.ts` so that module stays pure, synchronous, and\n * dependency-free (text only). The optional-renderer concern — a lazy dynamic\n * import with graceful fallback, mirroring `numerical/formula-registry.ts`'s\n * MathTS-peer pattern — lives here.\n *\n * @module composition/graph-viz-svg\n */\n\n/**\n * Thrown by {@link renderDotToSvg} when the optional `@viz-js/viz` peer is not\n * installed. The message names the install command and the no-install\n * alternative.\n *\n * @public\n */\nexport class SvgRendererUnavailableError extends Error {\n  constructor(\n    message = 'SVG rendering needs the optional renderer: npm i @viz-js/viz ' +\n      '(or use --format=dot | dot -Tsvg)',\n  ) {\n    super(message);\n    this.name = 'SvgRendererUnavailableError';\n  }\n}\n\n/** The shape we use from `@viz-js/viz` — its `instance()` resolves a renderer. */\ninterface VizModule {\n  instance(): Promise<{\n    renderString(src: string, options: { format: string }): string;\n  }>;\n}\n\n/**\n * Render Graphviz DOT source (e.g. {@link buildVizModel}'s `toDot()`) to an SVG\n * document string. Lazy-loads the optional `@viz-js/viz` peer.\n *\n * @throws {SvgRendererUnavailableError} if the peer is not installed.\n * @public\n */\nexport async function renderDotToSvg(dot: string): Promise<string> {\n  let viz: VizModule;\n  try {\n    viz = (await import('@viz-js/viz')) as unknown as VizModule;\n  } catch {\n    throw new SvgRendererUnavailableError();\n  }\n  const renderer = await viz.instance();\n  return renderer.renderString(dot, { format: 'svg' });\n}\n"]}
+{"version":3,"file":"graph-viz-svg.js","sourceRoot":"","sources":["../../src/composition/graph-viz-svg.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH;;;;;;GAMG;AACH,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IACpD,YACE,OAAO,GAAG,+DAA+D;QACvE,mCAAmC;QAErC,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,GAAW;IAC9C,IAAI,GAAc,CAAC;IACnB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,2BAA2B,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,EAAE,CAAC;IACtC,OAAO,QAAQ,CAAC,YAAY,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;AACvD,CAAC","sourcesContent":["/**\n * SVG rendering for the physics map — render Graphviz DOT source to an SVG\n * string via the optional **`@viz-js/viz`** peer (the real Graphviz compiled to\n * WebAssembly: same `dot` output, in-process, no native binary, no subprocess).\n *\n * Kept separate from `graph-viz.ts` so that module stays pure, synchronous, and\n * dependency-free (text only). The optional-renderer concern — a lazy dynamic\n * import with graceful fallback, mirroring `numerical/formula-registry.ts`'s\n * MathTS-peer pattern — lives here.\n *\n * @module composition/graph-viz-svg\n */\n\nimport type { Viz } from '@viz-js/viz';\n\n/**\n * Thrown by {@link renderDotToSvg} when the optional `@viz-js/viz` peer is not\n * installed. The message names the install command and the no-install\n * alternative.\n *\n * @public\n */\nexport class SvgRendererUnavailableError extends Error {\n  constructor(\n    message = 'SVG rendering needs the optional renderer: npm i @viz-js/viz ' +\n      '(or use --format=dot | dot -Tsvg)',\n  ) {\n    super(message);\n    this.name = 'SvgRendererUnavailableError';\n  }\n}\n\n/**\n * The part of `@viz-js/viz` this module uses: `instance()` resolves the renderer, whose\n * `renderString` is the peer's own declared type. The peer's types are a devDependency, so the\n * dynamic import is typed without a cast; at runtime the peer stays optional.\n */\ninterface VizModule {\n  instance(): Promise<Viz>;\n}\n\n/**\n * Render Graphviz DOT source (e.g. {@link buildVizModel}'s `toDot()`) to an SVG\n * document string. Lazy-loads the optional `@viz-js/viz` peer.\n *\n * @throws {SvgRendererUnavailableError} if the peer is not installed.\n * @public\n */\nexport async function renderDotToSvg(dot: string): Promise<string> {\n  let viz: VizModule;\n  try {\n    viz = await import('@viz-js/viz');\n  } catch {\n    throw new SvgRendererUnavailableError();\n  }\n  const renderer = await viz.instance();\n  return renderer.renderString(dot, { format: 'svg' });\n}\n"]}

package/dist/composition/graph-viz.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-viz.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,KAAK,GACL,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,UAAU,GACV,MAAM,GACN,QAAQ,GACR,aAAa,CAAC;AAElB;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,SAAS,EAShD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,cAAc;IAC7B,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,oEAAoE;IACpE,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,qEAAqE;IACrE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IACjD;;;;;;;;OAQG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;IAChC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,WAAW,CAAC,WAAW,CAAC,CAAC;CACtE;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAC3C,QAAQ,CAAC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,SAAS,IAAI,MAAM,CAAC;IACpB,KAAK,IAAI,MAAM,CAAC;CACjB;AAqBD;;;;4DAI4D;AAC5D,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAW5D;AAgCD;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,gBAAgB,CAAC,GACjE;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAA;CAAE,CA4BjE;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAUvE;AAiPD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,UAAe,GACpB,QAAQ,CA4DV"}
+{"version":3,"file":"graph-viz.d.ts","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAEvE;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GACjB,KAAK,GACL,aAAa,GACb,aAAa,GACb,oBAAoB,GACpB,UAAU,GACV,MAAM,GACN,QAAQ,GACR,aAAa,CAAC;AAElB;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,EAAE,SAAS,SAAS,EAShD,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,4CAA4C;IAC5C,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,yBAAyB;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,cAAc;IAC7B,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,wEAAwE;IACxE,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC,oEAAoE;IACpE,QAAQ,CAAC,sBAAsB,EAAE,MAAM,CAAC;IACxC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC,8CAA8C;IAC9C,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;CACjC;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,sCAAsC;IACtC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,qEAAqE;IACrE,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,uEAAuE;IACvE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,CAAC,EAAE,SAAS,WAAW,EAAE,CAAC;IACjD;;;;;;;;OAQG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC;IACjC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;IAChC;;;;;;;OAOG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,WAAW,CAAC,WAAW,CAAC,CAAC;CACtE;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAC3C,QAAQ,CAAC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;IACzC,0EAA0E;IAC1E,QAAQ,CAAC,WAAW,EAAE,cAAc,CAAC;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,SAAS,IAAI,MAAM,CAAC;IACpB,KAAK,IAAI,MAAM,CAAC;CACjB;AAqBD;;;;4DAI4D;AAC5D,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAW5D;AAgCD;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,UAAU,GAAG,gBAAgB,CAAC,GACjE;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAA;CAAE,CA4BjE;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,GAAG,IAAI,CAUvE;AA8MD;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,UAAe,GACpB,QAAQ,CA4DV"}

package/dist/composition/graph-viz.js

@@ -18,7 +18,7 @@
  *
  * @module composition/graph-viz
  */
-import { QUANTITY_IDENTIFICATIONS } from './compose.js';
+import { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';
 /**
  * Every `VizStatus`, as VALUES.
  *
@@ -147,43 +147,17 @@ export function formatFilterLegend(stats) {
         `${stats.droppedNotMatching} dropped (did not match); ` +
         `${stats.droppedMissingMetadata} dropped (no overlay metadata)`);
 }
-/** Quantity-name canonicalizer from `QUANTITY_IDENTIFICATIONS` (matches `linkageMap`). */
-function makeCanon() {
-    const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));
-    return (n) => alias.get(n) ?? n;
-}
 /** Distinct canonical quantity names of a junction (sources ∪ target). */
 function quantitiesOf(j) {
     return [...new Set([...j.sources, j.target])];
 }
-/** Union-find component grouping of junctions sharing a (canonical) quantity. */
+/**
+ * Component grouping of junctions sharing a (canonical) quantity: the shared partition of
+ * `quantity-clusters.ts`, in the order the map always drew (largest first, then by first
+ * junction id; input order inside). The anchoring rule below is this module's own.
+ */
 function componentsOf(junctions) {
-    const parent = junctions.map((_, i) => i);
-    const find = (x) => parent[x] === x ? x : (parent[x] = find(parent[x]));
-    const union = (a, b) => {
-        parent[find(a)] = find(b);
-    };
-    const qToJunctions = new Map();
-    junctions.forEach((j, i) => {
-        for (const qty of quantitiesOf(j)) {
-            const arr = qToJunctions.get(qty) ?? [];
-            arr.push(i);
-            qToJunctions.set(qty, arr);
-        }
-    });
-    for (const idxs of qToJunctions.values()) {
-        for (let k = 1; k < idxs.length; k++)
-            union(idxs[0], idxs[k]);
-    }
-    const groups = new Map();
-    junctions.forEach((_, i) => {
-        const r = find(i);
-        const arr = groups.get(r) ?? [];
-        arr.push(i);
-        groups.set(r, arr);
-    });
-    const clusters = [...groups.values()].map((idxs) => {
-        const js = idxs.map((i) => junctions[i]);
+    return clusterBySharedKeys(junctions, quantitiesOf, (j) => j.id).map((js) => {
         const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();
         return {
             junctionIds: js.map((j) => j.id),
@@ -197,9 +171,6 @@ function componentsOf(junctions) {
             anchored: js.some((j) => j.status === 'law' || j.status === 'established'),
         };
     });
-    // Deterministic: largest first, then by first junction id.
-    clusters.sort((a, b) => b.size - a.size || a.junctionIds[0].localeCompare(b.junctionIds[0]));
-    return clusters;
 }
 /** A stable, collision-free id factory mapping arbitrary keys to safe ids. */
 function idFactory(prefix) {
@@ -355,7 +326,7 @@ function emitDot(clusters, byId, title, legend) {
  * @public
  */
 export function buildVizModel(edges, opts = {}) {
-    const canon = makeCanon();
+    const canon = quantityCanonicalizer();
     const normalize = (j) => ({
         ...j,
         sources: j.sources.map(canon),