universal-physics-tensor 10.0.0 → 11.0.0

package/dist/composition/chain-result.js.map

@@ -1 +1 @@
-{"version":3,"file":"chain-result.js","sourceRoot":"","sources":["../../src/composition/chain-result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,OAAO,EAAE,mBAAmB,EAA2B,MAAM,sBAAsB,CAAC;AAuBpF;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,MAAmB;IAC/C,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc;QAAE,OAAO,cAAc,CAAC;IACzE,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,aAAa,CAAC;IACvE,OAAO,MAAM,CAAC,OAAO,KAAK,kCAAkC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;AACrG,CAAC;AAED,SAAS,UAAU,CAAC,IAAwB;IAC1C,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,cAAc;YACjB,OAAO,CAAC,CAAC;QACX,KAAK,aAAa;YAChB,OAAO,CAAC,CAAC;QACX,KAAK,iBAAiB;YACpB,OAAO,CAAC,CAAC;QACX,KAAK,eAAe;YAClB,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAA+B;IAC/D,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAChC,MAAM,OAAO,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * One internal chain record.\n *\n * The classifier kind, the order key, the filter theorem, a regime\n * mismatch, and the edge ids live on this value. {@link chainOrderKey}\n * and the pipeline's renderer are functions of it. A confirmation and a\n * restatement do not become a rejection.\n *\n * @module composition/chain-result\n */\n\nimport type { ChainClassification } from '../canonical/structural.js';\nimport type { CompositionResult } from '../relations/composition-table.js';\nimport type { BuckinghamFilterRecord } from './buckingham-filter.js';\nimport { compareChainEdgeIds, type ChainCandidateKind } from './chain-candidate.js';\nimport type { ChainRegimeMismatch } from './chain-regime.js';\n\n/**\n * The pipeline's one chain value.\n *\n * `classification` is the structural result. `theorem` is the Buckingham\n * filter's named shape, or null when the filter named none. `mismatch`\n * is set only for a provisional chain the regime gate refused.\n * `categoryComposition` is the category claim for the two steps. It is\n * unset when the edges have no stored category object ids. A recorded\n * `no-composite-claim` does not change the order key.\n *\n * @internal\n */\nexport interface ChainRecord {\n  readonly edgeIds: readonly string[];\n  readonly classification: ChainClassification;\n  readonly theorem: BuckinghamFilterRecord['theorem'];\n  readonly mismatch: ChainRegimeMismatch | undefined;\n  readonly categoryComposition: CompositionResult | undefined;\n}\n\n/**\n * The four-class order key of `record`.\n *\n * A confirmation stays a confirmation. A restatement stays a restatement.\n * A provisional chain whose filter theorem is `monomial_form` is a unique\n * monomial. Every other provisional chain is an unfixed shape. A mismatch\n * does not change the key.\n *\n * @internal\n */\nexport function chainOrderKey(record: ChainRecord): ChainCandidateKind {\n  if (record.classification.kind === 'confirmation') return 'confirmation';\n  if (record.classification.kind === 'restatement') return 'restatement';\n  return record.theorem === 'PhysJS.Dimensional.monomial_form' ? 'unique-monomial' : 'unfixed-shape';\n}\n\nfunction classIndex(kind: ChainCandidateKind): number {\n  switch (kind) {\n    case 'confirmation':\n      return 0;\n    case 'restatement':\n      return 1;\n    case 'unique-monomial':\n      return 2;\n    case 'unfixed-shape':\n      return 3;\n  }\n}\n\n/**\n * Total order of chain records by {@link chainOrderKey}, then by edge ids.\n *\n * Returns a new array. The input array is left as it was. A rejection is\n * not a class in this order.\n *\n * @internal\n */\nexport function orderChainRecords(records: readonly ChainRecord[]): ChainRecord[] {\n  return [...records].sort((a, b) => {\n    const byClass = classIndex(chainOrderKey(a)) - classIndex(chainOrderKey(b));\n    if (byClass !== 0) return byClass < 0 ? -1 : 1;\n    return compareChainEdgeIds(a.edgeIds, b.edgeIds);\n  });\n}\n"]}
+{"version":3,"file":"chain-result.js","sourceRoot":"","sources":["../../src/composition/chain-result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAA2B,MAAM,sBAAsB,CAAC;AAuBrG;;;;;;;;;GASG;AACH,MAAM,UAAU,aAAa,CAAC,MAAmB;IAC/C,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,cAAc;QAAE,OAAO,cAAc,CAAC;IACzE,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,aAAa,CAAC;IACvE,OAAO,MAAM,CAAC,OAAO,KAAK,kCAAkC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC;AACrG,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAA+B;IAC/D,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAChC,MAAM,OAAO,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * One internal chain record.\n *\n * The classifier kind, the order key, the filter theorem, a regime\n * mismatch, and the edge ids live on this value. {@link chainOrderKey}\n * and the pipeline's renderer are functions of it. A confirmation and a\n * restatement do not become a rejection.\n *\n * @module composition/chain-result\n */\n\nimport type { ChainClassification } from '../canonical/structural.js';\nimport type { CompositionResult } from '../relations/composition-table.js';\nimport type { BuckinghamFilterRecord } from './buckingham-filter.js';\nimport { chainClassIndex, compareChainEdgeIds, type ChainCandidateKind } from './chain-candidate.js';\nimport type { ChainRegimeMismatch } from './chain-regime.js';\n\n/**\n * The pipeline's one chain value.\n *\n * `classification` is the structural result. `theorem` is the Buckingham\n * filter's named shape, or null when the filter named none. `mismatch`\n * is set only for a provisional chain the regime gate refused.\n * `categoryComposition` is the category claim for the two steps. It is\n * unset when the edges have no stored category object ids. A recorded\n * `no-composite-claim` does not change the order key.\n *\n * @internal\n */\nexport interface ChainRecord {\n  readonly edgeIds: readonly string[];\n  readonly classification: ChainClassification;\n  readonly theorem: BuckinghamFilterRecord['theorem'];\n  readonly mismatch: ChainRegimeMismatch | undefined;\n  readonly categoryComposition: CompositionResult | undefined;\n}\n\n/**\n * The four-class order key of `record`.\n *\n * A confirmation stays a confirmation. A restatement stays a restatement.\n * A provisional chain whose filter theorem is `monomial_form` is a unique\n * monomial. Every other provisional chain is an unfixed shape. A mismatch\n * does not change the key.\n *\n * @internal\n */\nexport function chainOrderKey(record: ChainRecord): ChainCandidateKind {\n  if (record.classification.kind === 'confirmation') return 'confirmation';\n  if (record.classification.kind === 'restatement') return 'restatement';\n  return record.theorem === 'PhysJS.Dimensional.monomial_form' ? 'unique-monomial' : 'unfixed-shape';\n}\n\n/**\n * Total order of chain records by {@link chainOrderKey}, then by edge ids.\n *\n * Returns a new array. The input array is left as it was. A rejection is\n * not a class in this order.\n *\n * @internal\n */\nexport function orderChainRecords(records: readonly ChainRecord[]): ChainRecord[] {\n  return [...records].sort((a, b) => {\n    const byClass = chainClassIndex(chainOrderKey(a)) - chainClassIndex(chainOrderKey(b));\n    if (byClass !== 0) return byClass < 0 ? -1 : 1;\n    return compareChainEdgeIds(a.edgeIds, b.edgeIds);\n  });\n}\n"]}

package/dist/composition/compose-symbolic.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compose-symbolic.d.ts","sourceRoot":"","sources":["../../src/composition/compose-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAO3D;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sBAAsB;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,4CAA4C;IAC5C,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,sCAAsC;IACtC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;CAC5D;AAED;oEACoE;AACpE,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED,mDAAmD;AACnD,MAAM,WAAW,sBAAsB;IACrC,iEAAiE;IACjE,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAqCD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,SAAS,EACd,IAAI,EAAE,QAAQ,GACb,UAAU,CA4BZ;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,EAClB,IAAI,GAAE,sBAA2B,GAChC,UAAU,CAmDZ"}
+{"version":3,"file":"compose-symbolic.d.ts","sourceRoot":"","sources":["../../src/composition/compose-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAQ3D;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,mDAAmD;IACnD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sBAAsB;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,4CAA4C;IAC5C,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IACxB,sCAAsC;IACtC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;CAC5D;AAED;oEACoE;AACpE,qBAAa,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAED,mDAAmD;AACnD,MAAM,WAAW,sBAAsB;IACrC,iEAAiE;IACjE,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAqCD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,SAAS,EACd,IAAI,EAAE,QAAQ,GACb,UAAU,CA4BZ;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,EAClB,IAAI,GAAE,sBAA2B,GAChC,UAAU,CAmDZ"}

package/dist/composition/compose-symbolic.js

@@ -20,7 +20,8 @@ import { validate } from '../dimensional/validator.js';
 import { QUANTITY_IDENTIFICATIONS } from './compose.js';
 import { substitute } from './expr-subst.js';
 import { evalExpr, SymbolicEvalError } from './expr-eval.js';
-import { CONSTANTS } from '../dimensional/symbolic-constants.js';
+import { isRegisteredConstant } from '../dimensional/symbolic-constants.js';
+import { isDecimalLiteral } from '../dimensional/ast-leaves.js';
 import { scalarSymbolsFromMathTs } from './mathts-scalar-symbols.js';
 /** Symbolic composition is undefined (no junction / missing `symbolic` /
  *  zero-occurrence substitution / dimensional mismatch). @public */
@@ -57,7 +58,7 @@ function findJunctionName(first, second, identifications) {
 function freeLeaves(expr) {
     return scalarSymbolsFromMathTs(expr)
         .map((leaf) => leaf.name)
-        .filter((n) => !(n in CONSTANTS) && !Number.isFinite(Number(n)))
+        .filter((n) => !isRegisteredConstant(n) && !isDecimalLiteral(n))
         .sort();
 }
 /**

package/dist/composition/compose-symbolic.js.map

@@ -1 +1 @@
-{"version":3,"file":"compose-symbolic.js","sourceRoot":"","sources":["../../src/composition/compose-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAKvD,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AACjE,OAAO,EAAE,uBAAuB,EAAE,MAAM,4BAA4B,CAAC;AA4BrE;oEACoE;AACpE,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAQD;;;wDAGwD;AACxD,SAAS,gBAAgB,CACvB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAElD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IACtD,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBAAE,OAAO,GAAG,CAAC,IAAI,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,WAAW;QAChE,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,yCAAyC,CACzD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,UAAU,CAAC,IAAc;IAChC,OAAO,uBAAuB,CAAC,IAAI,CAAC;SACjC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/D,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,MAAc,EACd,GAAc,EACd,IAAc;IAEd,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO;QACL,IAAI;QACJ,MAAM;QACN,GAAG;QACH,IAAI;QACJ,MAAM;QACN,QAAQ,CAAC,MAAM;YACb,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;oBACxD,MAAM,IAAI,iBAAiB,CACzB,cAAc,IAAI,uCAAuC,IAAI,IAAI;wBAC/D,YAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CACpC,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1B,MAAM,IAAI,iBAAiB,CACzB,cAAc,IAAI,iCAAiC,GAAG,UAAU;wBAC9D,oCAAoC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,IAAI,CACxE,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,OAAO,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAA2B,EAAE;IAEjC,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IAEF,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,SAAS;YAC9D,IAAI,OAAO,kDAAkD;YAC7D,gBAAgB,CACnB,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACtE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAChC,MAAM,CAAC,QAAQ,EACf,YAAY,EACZ,KAAK,CAAC,QAAQ,CACf,CAAC;IAEF,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,aAAa;YAClE,IAAI,YAAY,kCAAkC,MAAM,CAAC,EAAE,KAAK;YAChE,sDAAsD,KAAK,CAAC,EAAE,GAAG,CACpE,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IACzB,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QAC1C,MAAM,IAAI,wBAAwB,CAChC,6BAA6B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,UAAU;YAC7D,2BAA2B,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,iBAAiB,GAAG,CAC3E,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,wBAAwB,CAChC,6BAA6B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,iBAAiB;YACpE,GAAG,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM;YAC9D,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAClC,CAAC;IACJ,CAAC;IAED,OAAO,cAAc,CACnB,MAAM,CAAC,MAAM,CAAC,IAAI,EAClB,MAAM,CAAC,MAAM,CAAC,MAAM,EACpB,MAAM,CAAC,MAAM,CAAC,GAAG,EACjB,IAAI,CACL,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Symbolic bridge composition (v0.12 — the Observable contract).\n *\n * Resolves the Part-IX §4 \"Observable contract\" deferral with a fourth\n * option the spec did not enumerate: an OPTIONAL `symbolic` ExprNode on a\n * bridge edge (leaves = source-quantity names + the `CONSTANTS` registry),\n * composed by AST SUBSTITUTION. `composeSymbolic(first, second)` substitutes\n * `first`'s symbolic form into the junction leaf of `second`'s, producing a\n * new ExprNode that is dimensionally validated and numerically evaluable —\n * not the black-box numeric closure `composeEdges` chains.\n *\n * Non-breaking (the field is optional), no per-pair adapters, and it retains\n * dimensional type-safety. Edges without a `symbolic` form fall back to\n * numeric `composeEdges` (unchanged).\n *\n * @module composition/compose-symbolic\n */\n\nimport { equals, format } from '../dimensional/algebra.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport type { BridgeEdge } from './edge.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport { substitute } from './expr-subst.js';\nimport { evalExpr, SymbolicEvalError } from './expr-eval.js';\nimport { CONSTANTS } from '../dimensional/symbolic-constants.js';\nimport { scalarSymbolsFromMathTs } from './mathts-scalar-symbols.js';\n\n/**\n * A composed quantity carrying its SYMBOLIC form and an executable\n * evaluator — the shared return contract Part-IX §4 said was missing.\n *\n * @public\n */\nexport interface Observable {\n  /** Target quantity name (from `second.target`). */\n  readonly name: string;\n  /** Display symbol. */\n  readonly symbol: string;\n  /** Dimensionally-validated SI dimension. */\n  readonly dim: Dimension;\n  /** The composed (substituted) AST. */\n  readonly expr: ExprNode;\n  /** Free leaf symbols = the required inputs (constants/literals excluded). */\n  readonly leaves: readonly string[];\n  /**\n   * Numerically evaluate the composed form. STRICT input (Eve EVE-1): every\n   * `leaves` key must be supplied and no extra key is accepted. PURE symbolic\n   * value — NOT domain-checked (unlike `composeEdges`, which throws\n   * `DomainViolationError`); use `composeEdges` for domain-checked values.\n   */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\n/** Symbolic composition is undefined (no junction / missing `symbolic` /\n *  zero-occurrence substitution / dimensional mismatch). @public */\nexport class SymbolicCompositionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'SymbolicCompositionError';\n  }\n}\n\n/** Options for {@link composeSymbolic}. @public */\nexport interface ComposeSymbolicOptions {\n  /** Extra identifications consulted after the registered ones. */\n  readonly identifications?: readonly QuantityIdentification[];\n}\n\n/** Find the junction source of `second` matching `first.target` (by name or\n *  identification). Returns the source whose NAME is the substitution leaf —\n *  `junction.name` is correct in BOTH the name-match and identification cases\n *  (Eve EVE-4), avoiding the always-`ident.to` trap. */\nfunction findJunctionName(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  identifications: readonly QuantityIdentification[],\n): string {\n  for (const src of second.sources) {\n    if (src.name === first.target.name) return src.name;\n  }\n  for (const ident of identifications) {\n    if (ident.from !== first.target.name) continue;\n    for (const src of second.sources) {\n      if (src.name === ident.to) return src.name;\n    }\n  }\n  throw new SymbolicCompositionError(\n    `Cannot symbolically compose ${first.id} -> ${second.id}: target ` +\n      `'${first.target.name}' matches none of [${second.sources\n        .map((s) => `'${s.name}'`)\n        .join(', ')}] by name or registered identification.`,\n  );\n}\n\n/** Free leaves = symbols that are neither registered constants nor numeric\n *  literals (those are not inputs). The names are the MathTS symbol filter. */\nfunction freeLeaves(expr: ExprNode): string[] {\n  return scalarSymbolsFromMathTs(expr)\n    .map((leaf) => leaf.name)\n    .filter((n) => !(n in CONSTANTS) && !Number.isFinite(Number(n)))\n    .sort();\n}\n\n/**\n * Build an {@link Observable} from a composed/simplified expression: computes\n * the free `leaves` and a STRICT `evaluate` closure over THIS `expr` + leaves.\n * Shared by `composeSymbolic` and `simplifyObservable` so a simplified\n * Observable gets a fresh closure (never the stale unsimplified one).\n *\n * @internal\n */\nexport function makeObservable(\n  name: string,\n  symbol: string,\n  dim: Dimension,\n  expr: ExprNode,\n): Observable {\n  const leaves = freeLeaves(expr);\n  return {\n    name,\n    symbol,\n    dim,\n    expr,\n    leaves,\n    evaluate(values) {\n      for (const leaf of leaves) {\n        if (!Object.prototype.hasOwnProperty.call(values, leaf)) {\n          throw new SymbolicEvalError(\n            `Observable(${name}).evaluate: missing required input '${leaf}' ` +\n              `(leaves: ${leaves.join(', ')}).`,\n          );\n        }\n      }\n      for (const key of Object.keys(values)) {\n        if (!leaves.includes(key)) {\n          throw new SymbolicEvalError(\n            `Observable(${name}).evaluate: unexpected input '${key}' (this ` +\n              `Observable's inputs are exactly: ${leaves.join(', ') || '(none)'}).`,\n          );\n        }\n      }\n      return evalExpr(expr, values);\n    },\n  };\n}\n\n/**\n * Compose two bridges SYMBOLICALLY: substitute `first`'s `symbolic` form into\n * the junction leaf of `second`'s, validate the composed AST's dimension, and\n * return an {@link Observable}. Both operands must carry a `symbolic` form\n * (else throws — fall back to `composeEdges` for numeric-only composition).\n *\n * @public\n */\nexport function composeSymbolic(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  opts: ComposeSymbolicOptions = {},\n): Observable {\n  const identifications = [\n    ...QUANTITY_IDENTIFICATIONS,\n    ...(opts.identifications ?? []),\n  ];\n\n  if (!first.symbolic || !second.symbolic) {\n    const missing = !first.symbolic ? first.id : second.id;\n    throw new SymbolicCompositionError(\n      `Cannot symbolically compose ${first.id} -> ${second.id}: edge ` +\n        `'${missing}' has no symbolic form (numeric-only edge — use ` +\n        `composeEdges).`,\n    );\n  }\n\n  const junctionName = findJunctionName(first, second, identifications);\n  const { expr, count } = substitute(\n    second.symbolic,\n    junctionName,\n    first.symbolic,\n  );\n\n  if (count === 0) {\n    throw new SymbolicCompositionError(\n      `Cannot symbolically compose ${first.id} -> ${second.id}: junction ` +\n        `'${junctionName}' does not appear as a leaf of ${second.id}'s ` +\n        `symbolic form — substitution would silently ignore ${first.id}.`,\n    );\n  }\n\n  const v = validate(expr);\n  if (!v.ok || v.inferredDimension === null) {\n    throw new SymbolicCompositionError(\n      `Composed symbolic form of ${first.id} -> ${second.id} failed ` +\n        `dimensional validation: ${v.violations[0]?.note ?? 'not homogeneous'}.`,\n    );\n  }\n  if (!equals(v.inferredDimension, second.target.dim)) {\n    throw new SymbolicCompositionError(\n      `Composed symbolic form of ${first.id} -> ${second.id} has dimension ` +\n        `${format(v.inferredDimension)} but ${second.target.name} is ` +\n        `${format(second.target.dim)}.`,\n    );\n  }\n\n  return makeObservable(\n    second.target.name,\n    second.target.symbol,\n    second.target.dim,\n    expr,\n  );\n}\n"]}
+{"version":3,"file":"compose-symbolic.js","sourceRoot":"","sources":["../../src/composition/compose-symbolic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAKvD,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAC5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,uBAAuB,EAAE,MAAM,4BAA4B,CAAC;AA4BrE;oEACoE;AACpE,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,0BAA0B,CAAC;IACzC,CAAC;CACF;AAQD;;;wDAGwD;AACxD,SAAS,gBAAgB,CACvB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAElD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IACtD,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBAAE,OAAO,GAAG,CAAC,IAAI,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,WAAW;QAChE,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,yCAAyC,CACzD,CAAC;AACJ,CAAC;AAED;+EAC+E;AAC/E,SAAS,UAAU,CAAC,IAAc;IAChC,OAAO,uBAAuB,CAAC,IAAI,CAAC;SACjC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;SAC/D,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,MAAc,EACd,GAAc,EACd,IAAc;IAEd,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO;QACL,IAAI;QACJ,MAAM;QACN,GAAG;QACH,IAAI;QACJ,MAAM;QACN,QAAQ,CAAC,MAAM;YACb,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;oBACxD,MAAM,IAAI,iBAAiB,CACzB,cAAc,IAAI,uCAAuC,IAAI,IAAI;wBAC/D,YAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CACpC,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC1B,MAAM,IAAI,iBAAiB,CACzB,cAAc,IAAI,iCAAiC,GAAG,UAAU;wBAC9D,oCAAoC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,IAAI,CACxE,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,OAAO,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAA2B,EAAE;IAEjC,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IAEF,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACvD,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,SAAS;YAC9D,IAAI,OAAO,kDAAkD;YAC7D,gBAAgB,CACnB,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACtE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAChC,MAAM,CAAC,QAAQ,EACf,YAAY,EACZ,KAAK,CAAC,QAAQ,CACf,CAAC;IAEF,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,wBAAwB,CAChC,+BAA+B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,aAAa;YAClE,IAAI,YAAY,kCAAkC,MAAM,CAAC,EAAE,KAAK;YAChE,sDAAsD,KAAK,CAAC,EAAE,GAAG,CACpE,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IACzB,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QAC1C,MAAM,IAAI,wBAAwB,CAChC,6BAA6B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,UAAU;YAC7D,2BAA2B,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,iBAAiB,GAAG,CAC3E,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,IAAI,wBAAwB,CAChC,6BAA6B,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,iBAAiB;YACpE,GAAG,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM;YAC9D,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAClC,CAAC;IACJ,CAAC;IAED,OAAO,cAAc,CACnB,MAAM,CAAC,MAAM,CAAC,IAAI,EAClB,MAAM,CAAC,MAAM,CAAC,MAAM,EACpB,MAAM,CAAC,MAAM,CAAC,GAAG,EACjB,IAAI,CACL,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Symbolic bridge composition (v0.12 — the Observable contract).\n *\n * Resolves the Part-IX §4 \"Observable contract\" deferral with a fourth\n * option the spec did not enumerate: an OPTIONAL `symbolic` ExprNode on a\n * bridge edge (leaves = source-quantity names + the `CONSTANTS` registry),\n * composed by AST SUBSTITUTION. `composeSymbolic(first, second)` substitutes\n * `first`'s symbolic form into the junction leaf of `second`'s, producing a\n * new ExprNode that is dimensionally validated and numerically evaluable —\n * not the black-box numeric closure `composeEdges` chains.\n *\n * Non-breaking (the field is optional), no per-pair adapters, and it retains\n * dimensional type-safety. Edges without a `symbolic` form fall back to\n * numeric `composeEdges` (unchanged).\n *\n * @module composition/compose-symbolic\n */\n\nimport { equals, format } from '../dimensional/algebra.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport type { BridgeEdge } from './edge.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport { substitute } from './expr-subst.js';\nimport { evalExpr, SymbolicEvalError } from './expr-eval.js';\nimport { isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport { isDecimalLiteral } from '../dimensional/ast-leaves.js';\nimport { scalarSymbolsFromMathTs } from './mathts-scalar-symbols.js';\n\n/**\n * A composed quantity carrying its SYMBOLIC form and an executable\n * evaluator — the shared return contract Part-IX §4 said was missing.\n *\n * @public\n */\nexport interface Observable {\n  /** Target quantity name (from `second.target`). */\n  readonly name: string;\n  /** Display symbol. */\n  readonly symbol: string;\n  /** Dimensionally-validated SI dimension. */\n  readonly dim: Dimension;\n  /** The composed (substituted) AST. */\n  readonly expr: ExprNode;\n  /** Free leaf symbols = the required inputs (constants/literals excluded). */\n  readonly leaves: readonly string[];\n  /**\n   * Numerically evaluate the composed form. STRICT input (Eve EVE-1): every\n   * `leaves` key must be supplied and no extra key is accepted. PURE symbolic\n   * value — NOT domain-checked (unlike `composeEdges`, which throws\n   * `DomainViolationError`); use `composeEdges` for domain-checked values.\n   */\n  evaluate(values: Readonly<Record<string, number>>): number;\n}\n\n/** Symbolic composition is undefined (no junction / missing `symbolic` /\n *  zero-occurrence substitution / dimensional mismatch). @public */\nexport class SymbolicCompositionError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'SymbolicCompositionError';\n  }\n}\n\n/** Options for {@link composeSymbolic}. @public */\nexport interface ComposeSymbolicOptions {\n  /** Extra identifications consulted after the registered ones. */\n  readonly identifications?: readonly QuantityIdentification[];\n}\n\n/** Find the junction source of `second` matching `first.target` (by name or\n *  identification). Returns the source whose NAME is the substitution leaf —\n *  `junction.name` is correct in BOTH the name-match and identification cases\n *  (Eve EVE-4), avoiding the always-`ident.to` trap. */\nfunction findJunctionName(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  identifications: readonly QuantityIdentification[],\n): string {\n  for (const src of second.sources) {\n    if (src.name === first.target.name) return src.name;\n  }\n  for (const ident of identifications) {\n    if (ident.from !== first.target.name) continue;\n    for (const src of second.sources) {\n      if (src.name === ident.to) return src.name;\n    }\n  }\n  throw new SymbolicCompositionError(\n    `Cannot symbolically compose ${first.id} -> ${second.id}: target ` +\n      `'${first.target.name}' matches none of [${second.sources\n        .map((s) => `'${s.name}'`)\n        .join(', ')}] by name or registered identification.`,\n  );\n}\n\n/** Free leaves = symbols that are neither registered constants nor numeric\n *  literals (those are not inputs). The names are the MathTS symbol filter. */\nfunction freeLeaves(expr: ExprNode): string[] {\n  return scalarSymbolsFromMathTs(expr)\n    .map((leaf) => leaf.name)\n    .filter((n) => !isRegisteredConstant(n) && !isDecimalLiteral(n))\n    .sort();\n}\n\n/**\n * Build an {@link Observable} from a composed/simplified expression: computes\n * the free `leaves` and a STRICT `evaluate` closure over THIS `expr` + leaves.\n * Shared by `composeSymbolic` and `simplifyObservable` so a simplified\n * Observable gets a fresh closure (never the stale unsimplified one).\n *\n * @internal\n */\nexport function makeObservable(\n  name: string,\n  symbol: string,\n  dim: Dimension,\n  expr: ExprNode,\n): Observable {\n  const leaves = freeLeaves(expr);\n  return {\n    name,\n    symbol,\n    dim,\n    expr,\n    leaves,\n    evaluate(values) {\n      for (const leaf of leaves) {\n        if (!Object.prototype.hasOwnProperty.call(values, leaf)) {\n          throw new SymbolicEvalError(\n            `Observable(${name}).evaluate: missing required input '${leaf}' ` +\n              `(leaves: ${leaves.join(', ')}).`,\n          );\n        }\n      }\n      for (const key of Object.keys(values)) {\n        if (!leaves.includes(key)) {\n          throw new SymbolicEvalError(\n            `Observable(${name}).evaluate: unexpected input '${key}' (this ` +\n              `Observable's inputs are exactly: ${leaves.join(', ') || '(none)'}).`,\n          );\n        }\n      }\n      return evalExpr(expr, values);\n    },\n  };\n}\n\n/**\n * Compose two bridges SYMBOLICALLY: substitute `first`'s `symbolic` form into\n * the junction leaf of `second`'s, validate the composed AST's dimension, and\n * return an {@link Observable}. Both operands must carry a `symbolic` form\n * (else throws — fall back to `composeEdges` for numeric-only composition).\n *\n * @public\n */\nexport function composeSymbolic(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  opts: ComposeSymbolicOptions = {},\n): Observable {\n  const identifications = [\n    ...QUANTITY_IDENTIFICATIONS,\n    ...(opts.identifications ?? []),\n  ];\n\n  if (!first.symbolic || !second.symbolic) {\n    const missing = !first.symbolic ? first.id : second.id;\n    throw new SymbolicCompositionError(\n      `Cannot symbolically compose ${first.id} -> ${second.id}: edge ` +\n        `'${missing}' has no symbolic form (numeric-only edge — use ` +\n        `composeEdges).`,\n    );\n  }\n\n  const junctionName = findJunctionName(first, second, identifications);\n  const { expr, count } = substitute(\n    second.symbolic,\n    junctionName,\n    first.symbolic,\n  );\n\n  if (count === 0) {\n    throw new SymbolicCompositionError(\n      `Cannot symbolically compose ${first.id} -> ${second.id}: junction ` +\n        `'${junctionName}' does not appear as a leaf of ${second.id}'s ` +\n        `symbolic form — substitution would silently ignore ${first.id}.`,\n    );\n  }\n\n  const v = validate(expr);\n  if (!v.ok || v.inferredDimension === null) {\n    throw new SymbolicCompositionError(\n      `Composed symbolic form of ${first.id} -> ${second.id} failed ` +\n        `dimensional validation: ${v.violations[0]?.note ?? 'not homogeneous'}.`,\n    );\n  }\n  if (!equals(v.inferredDimension, second.target.dim)) {\n    throw new SymbolicCompositionError(\n      `Composed symbolic form of ${first.id} -> ${second.id} has dimension ` +\n        `${format(v.inferredDimension)} but ${second.target.name} is ` +\n        `${format(second.target.dim)}.`,\n    );\n  }\n\n  return makeObservable(\n    second.target.name,\n    second.target.symbol,\n    second.target.dim,\n    expr,\n  );\n}\n"]}

package/dist/composition/compose.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compose.d.ts","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAC5D,OAAO,KAAK,EAAY,gBAAgB,EAAE,MAAM,eAAe,CAAC;AA0DhE;;;;;;GAMG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,EAAE,SAAS,sBAAsB,EA0CrE,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,EACvD,MAAM,GAAE,SAAS,sBAAsB,EAA6B,GACnE,gBAAgB,CAuBlB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG;QAAE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAC9C,MAAM,CAAC,MAAM,EAAE,SAAS,gBAAgB,EAAE,CAAC,CAU5C,CAAC;AAQF;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,CAAC,EAAE,cAAc,EACjB,CAAC,EAAE,cAAc,GAChB,cAAc,CAEhB;AAED,gDAAgD;AAChD,MAAM,WAAW,cAAc;IAC7B,kEAAkE;IAClE,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;OAIG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;CAChD;AAiCD;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAElF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,EAClB,IAAI,GAAE,cAAmB,GACxB,UAAU,CAwNZ"}
+{"version":3,"file":"compose.d.ts","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGzD,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAkB,MAAM,WAAW,CAAC;AAC5E,OAAO,KAAK,EAAY,gBAAgB,EAAE,MAAM,eAAe,CAAC;AA0DhE;;;;;;GAMG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,EAAE,SAAS,sBAAsB,EA0CrE,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,EACvD,MAAM,GAAE,SAAS,sBAAsB,EAA6B,GACnE,gBAAgB,CAuBlB;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG;QAAE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAC9C,MAAM,CAAC,MAAM,EAAE,SAAS,gBAAgB,EAAE,CAAC,CAU5C,CAAC;AAQF;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,CAAC,EAAE,cAAc,EACjB,CAAC,EAAE,cAAc,GAChB,cAAc,CAEhB;AAED,gDAAgD;AAChD,MAAM,WAAW,cAAc;IAC7B,kEAAkE;IAClE,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;OAIG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;CAChD;AAiCD;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAElF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,UAAU,EACjB,MAAM,EAAE,UAAU,EAClB,IAAI,GAAE,cAAmB,GACxB,UAAU,CA6NZ"}

package/dist/composition/compose.js

@@ -310,6 +310,10 @@ export function composeEdges(first, second, opts = {}) {
         si[junction.name] = intermediate * junctionScale;
         return si;
     };
+    const id = `${first.id}>>${second.id}`;
+    // A name `second` reads under a renamed key reads it under that key here.
+    const secondKeyOf = (keyOf) => (name) => keyOf(Object.entries(renameMap).find(([, original]) => original === name)?.[0] ?? name);
+    const pipedContext = `on ${second.id}, with ${junction.name} piped from ${first.id}`;
     const composedDomain = {
         description: `(${first.domain.description}) AND, on the piped ` +
             `${junction.name}, (${second.domain.description})`,
@@ -324,8 +328,14 @@ export function composeEdges(first, second, opts = {}) {
             const intermediate = first.evaluate(inputs);
             return second.domain.predicate(buildSecondInputs(inputs, intermediate));
         },
+        violations: (inputs, keyOf = (name) => name) => {
+            const before = first.domain.violations(inputs, keyOf);
+            if (before.length > 0)
+                return before;
+            const piped = buildSecondInputs(inputs, first.evaluate(inputs));
+            return second.domain.violations(piped, secondKeyOf(keyOf));
+        },
     };
-    const id = `${first.id}>>${second.id}`;
     // ── Atlas Phase 1 (S1.2b): the relation overlay, and NOTHING else. ────────
     // Entered only when BOTH operands carry a `relation`. An operand with no
     // relation skips this block, and the composed edge then has no `relation`
@@ -389,8 +399,7 @@ export function composeEdges(first, second, opts = {}) {
         domain: composedDomain,
         evaluate: (inputs) => {
             if (!first.domain.predicate(inputs)) {
-                throw new DomainViolationError(`${id}: inputs violate composed validity domain ` +
-                    `(${composedDomain.description})`);
+                throw new DomainViolationError(id, first.domain.violations(inputs), `on ${first.id}`);
             }
             // Each operand's unset-coefficient gate is the one `evaluateEdge`
             // applies to a primitive edge; an operand's monomial times an absent 1
@@ -399,8 +408,7 @@ export function composeEdges(first, second, opts = {}) {
             const intermediate = first.evaluate(inputs);
             const pipedInputs = buildSecondInputs(inputs, intermediate);
             if (!second.domain.predicate(pipedInputs)) {
-                throw new DomainViolationError(`${id}: inputs violate composed validity domain ` +
-                    `(${composedDomain.description})`);
+                throw new DomainViolationError(id, second.domain.violations(pipedInputs, secondKeyOf((name) => name)), pipedContext);
             }
             assertCoefficientSet(second, pipedInputs);
             return second.evaluate(pipedInputs);

package/dist/composition/compose.js.map

@@ -1 +1 @@
-{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAIvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,yBAAyB,EACzB,wBAAwB,EACxB,yBAAyB,GAC1B,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,0EAA0E;AAC1E,+EAA+E;AAC/E,kEAAkE;AAClE,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACxF,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,gBAAgB,CACvB,IAA4C,EAC5C,KAAuB,EACvB,MAAwB;IAExB,MAAM,cAAc,GAAG,GAAG,KAAK,CAAC,cAAc,SAAS,MAAM,CAAC,cAAc,EAAE,CAAC;IAC/E,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACjC,2EAA2E;QAC3E,6CAA6C;QAC7C,MAAM,EAAE,GAAI,KAAkE,CAAC,OAAO,CAAC;QACvF,MAAM,EAAE,GAAI,MAAmE,CAAC,OAAO,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;AAClC,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAsC;IACzE;QACE,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,aAAa;QACjB,SAAS,EACP,+DAA+D;YAC/D,2DAA2D;YAC3D,2DAA2D;YAC3D,+DAA+D;YAC/D,gDAAgD;QAClD,QAAQ,EAAE,qDAAqD;KAChE;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,+DAA+D;YAC/D,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,mEAAmE;YACnE,wEAAwE;YACxE,wEAAwE;YACxE,gEAAgE;YAChE,kDAAkD;QACpD,QAAQ,EAAE,iDAAiD;KAC5D;IACD;QACE,IAAI,EAAE,+BAA+B;QACrC,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,sDAAsD;YACtD,uEAAuE;YACvE,mEAAmE;YACnE,wEAAwE;YACxE,oEAAoE;YACpE,yEAAyE;YACzE,2EAA2E;YAC3E,0EAA0E;YAC1E,4CAA4C;QAC9C,QAAQ,EAAE,uDAAuD;KAClE;CACF,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,gBAAuD,EACvD,MAAM,GAAsC,wBAAwB;IAEpE,MAAM,YAAY,GAAuB,EAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,MAAM;YAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,2EAA2E;IAC3E,2EAA2E;IAC3E,kEAAkE;IAClE,0EAA0E;IAC1E,2DAA2D;IAC3D,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAkD,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAClH,CAAC;QACF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;IACxD,CAAC;IACD,OAAO,kBAAkB,CAAC,MAAM,EAAE,uBAAuB,IAAI,GAAG,CAAC,CAAC;AACpE,CAAC;AAoBD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAElC;AACF,0EAA0E;AAC1E,2EAA2E;AAC3E,0EAA0E;AAC1E,wEAAwE;AACxE,sEAAsE;AACtE,2EAA2E;AAC3E,4EAA4E;AAC5E,oCAAoC;CACrC,CAAC;AAEF,MAAM,eAAe,GAAmC;IACtD,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAiB,EACjB,CAAiB;IAEjB,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAcD,SAAS,YAAY,CACnB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAOlD,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC1B,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,oBAAoB;QAC5D,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,wCAAwC,CACxD,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAe,EAAE,KAAgB;IACvE,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAAmB,EAAE;IAEzB,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,GAAG,YAAY,CACxE,KAAK,EACL,MAAM,EACN,eAAe,CAChB,CAAC;IAEF,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,uBAAuB;YAC/D,cAAc,KAAK,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;YACjE,OAAO,QAAQ,CAAC,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GACjB,iBAAiB,KAAK,IAAI;QACxB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEzD,sEAAsE;IACtE,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC;IAE9E,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,cAAc,GAAG;QACrB,GAAG,IAAI,GAAG,CACR,gBAAgB;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACtB;KACF,CAAC;IACF,MAAM,UAAU,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAC/C,MAAM,YAAY,GAAuB;QACvC,GAAG,CAAC,yBAAyB,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;KACxB,CAAC;IACF,MAAM,SAAS,GAA2B,EAAE,CAAC,CAAC,uCAAuC;IACrF,MAAM,gBAAgB,GAAuB,EAAE,CAAC;IAChD,IAAI,cAAc,GAAe,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,sBAAsB,IAAI,YAAY;gBAChE,6BAA6B,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBAC5D,sBAAsB,gBAAgB;qBACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,6CAA6C;gBAC1D,qDAAqD;gBACrD,+DAA+D,CAClE,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,OAAO,KAAK,QAAQ;YAAE,SAAS,CAAC,iCAAiC;QACvE,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;QACvC,IACE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC9C,CAAC;YACD,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,0BAA0B,OAAO,IAAI;gBAC/D,gEAAgE,CACnE,CAAC;QACJ,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAChE,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED;;6EAEyE;IACzE,MAAM,iBAAiB,GAAG,CACxB,MAA8B,EAC9B,YAAoB,EACI,EAAE;QAC1B,MAAM,EAAE,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5D,EAAE,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/B,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACjD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,cAAc,GAAG;QACrB,WAAW,EACT,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,sBAAsB;YAClD,GAAG,QAAQ,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG;QACpD,iEAAiE;QACjE,iEAAiE;QACjE,kEAAkE;QAClE,gEAAgE;QAChE,iEAAiE;QACjE,SAAS,EAAE,CAAC,MAA8B,EAAW,EAAE;YACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;QAC1E,CAAC;KACF,CAAC;IAEF,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAEvC,6EAA6E;IAC7E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,kEAAkE;IAClE,sEAAsE;IACtE,qEAAqE;IACrE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,IAAI,eAAe,GAGf,EAAE,CAAC;IACP,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,kBAAkB,EAAE,CAAC;YACrC,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sCAAsC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI;gBAC7D,IAAI,KAAK,CAAC,EAAE,kBAAkB,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI;gBACtD,IAAI,MAAM,CAAC,EAAE,2CAA2C;gBACxD,6CAA6C,CAChD,CAAC;QACJ,CAAC;QACD,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;YAClC,+DAA+D;YAC/D,yEAAyE;YACzE,wEAAwE;YACxE,gEAAgE;YAChE,yEAAyE;YACzE,sEAAsE;YACtE,uEAAuE;YACvE,WAAW;YACX,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sDAAsD;gBACtD,mEAAmE;gBACnE,iFAAiF,CACpF,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,sEAAsE;QACtE,wEAAwE;QACxE,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,iCAAiC;QACjC,MAAM,MAAM,GACV,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC;YAClE,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE;YACjD,CAAC,CAAC,EAAE,CAAC;QACT,eAAe,GAAG;YAChB,QAAQ,EAAE,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;YACtE,mBAAmB,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,EAAE;QACF,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ;QACtE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,EAAE;QACzC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC;QAC9C,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;QAC9D,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,kEAAkE;YAClE,uEAAuE;YACvE,0DAA0D;YAC1D,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,oBAAoB,CAC5B,GAAG,EAAE,4CAA4C;oBAC/C,IAAI,cAAc,CAAC,WAAW,GAAG,CACpC,CAAC;YACJ,CAAC;YACD,oBAAoB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,OAAO,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACtC,CAAC;QACD,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,MAAM,MAAM,CAAC,QAAQ,EAAE;QAClD,GAAG,CAAC,iBAAiB,KAAK,IAAI;YAC5B,CAAC,CAAC,EAAE,kBAAkB,EAAE,iBAAiB,EAAE;YAC3C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,EAAE,qBAAqB,EAAE,gBAAgB,EAAE;YAC7C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,eAAe;QAClB,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,CAAC;KACpF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,SAAS,aAAa,CACpB,KAAiB,EACjB,MAAkB,EAClB,QAAkB,EAClB,aAAqB,EACrB,cAAmC,EACnC,SAA2C;IAE3C,MAAM,GAAG,GAOL,EAAE,CAAC;IAEP,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9D,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,iCAAiC;gBACzE,cAAc,KAAK,CAAC,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,eAAe;gBAC3E,0DAA0D,CAC7D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC;YACH,GAAG,CAAC,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7D,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,8EAA8E;YAC9E,6DAA6D;YAC7D,MAAM,IAAI,yBAAyB,CAAC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,KAAM,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACrE,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,IAAI,IAAI,MAAM,CAAC,gBAAgB,KAAK,IAAI;QAAE,GAAG,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAErG,mEAAmE;IACnE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IACzE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAE/G,MAAM,IAAI,GAAG;QACX,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;QAC3B,GAAG,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;KAClE,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC;IAE3C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,gBAAgB,CAAC;IACzG,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,IAAI,eAAe,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IAC1D,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,cAAc,GAAG,OAAO,CAAC;IAElE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,MAAM,UAAU,GAAG,CAAC,QAAgB,EAAE,IAAuB,EAAQ,EAAE;QACrE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/D,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;QAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC/F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QACpE,IAAI,eAAe,CAAC,QAAQ,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAC7B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;SACpB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAU,CAAC;SAClF,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CACzC,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC;IAErD,IACE,KAAK,CAAC,QAAQ,KAAK,SAAS;QAC5B,MAAM,CAAC,QAAQ,KAAK,SAAS;QAC7B,aAAa,KAAK,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QACnF,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9G,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Composition graph — the composition operator (v0.8.0 T2/T4, per\n * docs/planning/v0.8.0-Design.md §3 + r2 deltas).\n *\n * `composeEdges(first, second)` pipes `first`'s output quantity into a\n * matching source of `second`, producing a NEW `BridgeEdge` (design\n * D-2 — composition closes over the edge type, so chains nest\n * arbitrarily). Defined iff:\n *\n *   1. `first.target` matches one of `second.sources` — by canonical\n *      name, or via an explicit {@link QuantityIdentification} (the\n *      reviewable physics judgments, e.g. \"the Hawking temperature IS\n *      the temperature in Landauer's bound\");\n *   2. the junction dimensions are EXACTLY equal (the dimension-functor\n *      check — ℤ⁷ integer-vector equality via the dimensional\n *      calculus's `equals`);\n *   3. domains conjoin THROUGH the pipe (design D-5): the composed\n *      domain checks `first`'s domain on the outer inputs and\n *      `second`'s domain on the piped intermediate value. This\n *      evaluates `first.evaluate` inside the predicate — acceptable\n *      for scalar closed forms.\n *\n * Confidence demotes: `min(first, second)` on\n * established > speculative > highly-speculative. Composition never\n * launders credibility (improvement-plan confidence algebra).\n *\n * Operator is named `composeEdges` (NOT `compose`) — `compose` is the\n * public v0.7 Cell factory in `src/core/cell.ts` (Adam A-1).\n *\n * @module composition/compose\n */\n\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { BridgeEdge, EdgeConfidence } from './edge.js';\nimport type { Quantity, RegimeAttributes } from './quantity.js';\nimport { regimeAttributesOf } from './quantity.js';\nimport { AXES } from './axes.js';\nimport { conventionFactor } from '../dimensional/unit-convention.js';\nimport {\n  assertCoefficientSet,\n  CompositionAliasError,\n  CompositionDimensionError,\n  CompositionJunctionError,\n  UndefinedCompositionError,\n} from './edge.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\nimport { substitute } from './expr-subst.js';\nimport { monomialExponents } from './formula-shape.js';\n// Atlas Phase 1 overlay. The composition table is a leaf module (pure, no\n// registry reads, no import from `src/composition/`), so this does not close a\n// cycle — same rule as the type-only atlas import in `./edge.ts`.\nimport { composeRelation, NO_COMPOSITE_CLAIM } from '../relations/composition-table.js';\nimport { checkConventions } from '../relations/conventions.js';\nimport { intersectRegimes } from '../relations/regime.js';\nimport type { Conventions, Regime, RelationContract, RelationType } from '../relations/types.js';\n\n/**\n * The `RelationContract` a composed edge carries, given the composite TYPE the\n * table returned and the two operand contracts.\n *\n * Only four types can be returned by the table (`derivation`,\n * `exact-equivalence`, `restriction`, `coarse-graining`); the other four appear\n * only as operands. `exact-equivalence` is produced by exactly one cell —\n * `exact-equivalence ∘ exact-equivalence` — so both operands are guaranteed to\n * carry the `inverse` its contract requires, and the composed inverse undoes\n * the second map first.\n *\n * NOT composed here: an `ApproximationBound`. `coarse-graining ∘\n * coarse-graining` accumulates error through `composeBounds`\n * (`src/atlas/error-algebra.ts`), which the implementation plan wires in as a\n * SEPARATE task behind this same guard. Until then the composite states its\n * type and no bound — it does not restate either operand's bound, which would\n * be a narrower error claim than the chain supports.\n *\n * @internal\n */\nfunction composedContract(\n  type: Exclude<RelationType, 'approximation'>,\n  first: RelationContract,\n  second: RelationContract,\n): RelationContract {\n  const transformation = `${first.transformation} then ${second.transformation}`;\n  if (type === 'exact-equivalence') {\n    // Guarded by the table: only exact ∘ exact yields exact, and that contract\n    // makes `inverse` REQUIRED on both operands.\n    const fi = (first as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    const si = (second as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    return { type, transformation, inverse: `${si} then ${fi}` };\n  }\n  return { type, transformation };\n}\n\n/**\n * A reviewable quantity-identification judgment: the assertion that\n * the quantity named `from` (an edge's target) IS the quantity named\n * `to` (another edge's source), with the physics rationale on record.\n *\n * @public\n */\nexport interface QuantityIdentification {\n  readonly from: string;\n  readonly to: string;\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered identifications (v0.8.0 CT-1). Each entry is a physics\n * judgment intended for review — see CONTRIBUTING.md.\n *\n * @public\n */\nexport const QUANTITY_IDENTIFICATIONS: readonly QuantityIdentification[] = [\n  {\n    from: 'hawking-temperature',\n    to: 'temperature',\n    rationale:\n      'The Hawking temperature of a black-hole horizon is a genuine ' +\n      'thermodynamic temperature — the temperature appearing in ' +\n      \"Landauer's bound for erasure at the horizon. This is the \" +\n      'standard identification underlying black-hole thermodynamics ' +\n      '(the horizon radiates as a black body at T_H).',\n    citation: 'Hawking 1975 CMP 43:199; Bekenstein 1973 PRD 7:2333',\n  },\n  {\n    from: 'de-broglie-wavelength',\n    to: 'compton-wavelength',\n    rationale:\n      'The de Broglie wavelength λ = h/p and the Compton wavelength ' +\n      'λ_C = h/(mc) are the SAME matter-wavelength quantity of a massive ' +\n      'particle; the Compton wavelength is its value in the relativistic ' +\n      'limit p = mc (v → c). They are equal only in that limit, but at the ' +\n      'composition graph’s quantity-KIND resolution they name one node. ' +\n      'Folded ONTO compton-wavelength (not the reverse) because that node is ' +\n      'anchor-determinable (ℏ/mc from a mass) and carries the sourced atomic ' +\n      'scale the magnitude gate needs; de-broglie’s own form needs a ' +\n      'momentum the single-mass anchor does not supply.',\n    citation: 'de Broglie 1924; Compton 1923 Phys. Rev. 21:483',\n  },\n  {\n    from: 'thermal-de-broglie-wavelength',\n    to: 'thermal-wavelength',\n    rationale:\n      'The catalog names the thermal de Broglie wavelength ' +\n      'λ_T = √(2πℏ²/(m k_B T)) `thermal-de-broglie-wavelength` (BE-11 Zurek ' +\n      'decoherence, BE-12 Caldeira–Leggett coherence length), while the ' +\n      'canonical L-layer law `CE-thermal-de-broglie` names the SAME physical ' +\n      'quantity `thermal-wavelength`. They are one node. Folded ONTO the ' +\n      'canonical `thermal-wavelength` (anchor-determinable: √(2πℏ²/(m k_B T)) ' +\n      'from a mass + temperature), reconnecting BE-11 — an ESTABLISHED bridge — ' +\n      'to standard physics (surfaced by the bridges-vs-canonical map; the link ' +\n      'was hidden purely by the name divergence).',\n    citation: 'de Broglie 1924; standard statistical mechanics (λ_T)',\n  },\n];\n\n/**\n * Effective regime attributes for a candidate NAME, resolved through the\n * `QUANTITY_IDENTIFICATIONS` fold — the SINGLE shared implementation every\n * attribute consumer must use (Eve r3 #2 mandate; the discovery-hardening\n * Phase-2 axis-compatibility gate is the first). `attributesByName` is the\n * REGISTRY-only source (never canonical per-equation stamps — Option-A,\n * audit adjudication F1): callers supply it (production: every centralized\n * `Quantity.attributes`; tests: an injected fixture map), this function only\n * does the fold resolution.\n *\n * Candidate names are already fold-canonicalized (the `to` side of an\n * identification); this additionally pulls in every `from` contributor that\n * folds ONTO `name` and, per axis, unions their stated value with `name`'s\n * own. Where contributors DISAGREE on an axis, the axis counts as UNSTATED\n * (conflict → abstain) rather than picking a side — the fold-conflict rule.\n *\n * @internal\n */\nexport function effectiveAttributes(\n  name: string,\n  attributesByName: ReadonlyMap<string, RegimeAttributes>,\n  idents: readonly QuantityIdentification[] = QUANTITY_IDENTIFICATIONS,\n): RegimeAttributes {\n  const contributors: RegimeAttributes[] = [];\n  const own = attributesByName.get(name);\n  if (own) contributors.push(own);\n  for (const id of idents) {\n    if (id.to !== name) continue;\n    const folded = attributesByName.get(id.from);\n    if (folded) contributors.push(folded);\n  }\n\n  // One-value-agrees, zero-or-conflicting-values-abstain, per REGISTRY axis.\n  // The fold reads `AXES`, so an axis the registry carries is folded here: a\n  // hand list once named scale, force and information only, and the\n  // discrimination audit then measured symmetry, topology and statistics as\n  // `checked: 0` whatever the data said (9.0.0 audit §4 C2).\n  const folded: Record<string, string> = {};\n  for (const { name } of AXES) {\n    const values = new Set(\n      contributors.map((c) => (c as Readonly<Record<string, string | undefined>>)[name]).filter((v) => v !== undefined),\n    );\n    if (values.size === 1) folded[name] = [...values][0]!;\n  }\n  return regimeAttributesOf(folded, `effectiveAttributes(${name})`);\n}\n\n/**\n * A recorded aliasing judgment for one duplicate source name in a\n * composition (v0.11 Option D). `'shared'` = one input deliberately\n * feeds both slots (e.g. ST-2: one M is both the lens and the r_s\n * source). `renameSecond` = split the collision: the SECOND operand's\n * quantity is renamed, and the composed evaluator remaps the renamed\n * input key back to the operand's internal name (vet A-4 — without the\n * remap the rename is a no-op).\n *\n * @public\n */\nexport interface AliasDisposition {\n  readonly name: string;\n  readonly treatAs: 'shared' | { readonly renameSecond: string };\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered alias dispositions, keyed by composed id\n * (`first.id>>second.id`) — judgments live in reviewable registry\n * data, mirroring {@link QUANTITY_IDENTIFICATIONS} (vet A-6.2).\n *\n * @public\n */\nexport const SOURCE_ALIAS_DISPOSITIONS: Readonly<\n  Record<string, readonly AliasDisposition[]>\n> = {\n  // Empty. The one entry this table held, `law-schwarzschild-radius>>be-51`\n  // (\"ST-2\": one M is both the lens and the r_s source), keyed a composition\n  // no call can reach: the law's target `schwarzschild-radius` matches none\n  // of be-51's sources (`mass`, `impact-parameter`) by name or registered\n  // identification, so `composeEdges` throws `CompositionJunctionError`\n  // before the alias gate runs. The judgment was never applied. Retracted in\n  // the 9.0.0 audit (§4 C8); `tests/composition/compose.test.ts` now requires\n  // every key here to reach the gate.\n};\n\nconst CONFIDENCE_RANK: Record<EdgeConfidence, number> = {\n  established: 2,\n  speculative: 1,\n  'highly-speculative': 0,\n};\n\n/**\n * Confidence demotion: the min of the two grades on the ordering\n * established > speculative > highly-speculative.\n *\n * @public\n */\nexport function minConfidence(\n  a: EdgeConfidence,\n  b: EdgeConfidence,\n): EdgeConfidence {\n  return CONFIDENCE_RANK[a] <= CONFIDENCE_RANK[b] ? a : b;\n}\n\n/** Options for {@link composeEdges}. @public */\nexport interface ComposeOptions {\n  /** Extra identifications, consulted after the registered ones. */\n  readonly identifications?: readonly QuantityIdentification[];\n  /**\n   * Alias dispositions for duplicate source names (v0.11 Option D);\n   * consulted after {@link SOURCE_ALIAS_DISPOSITIONS} entries for the\n   * composed id.\n   */\n  readonly aliases?: readonly AliasDisposition[];\n}\n\nfunction findJunction(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  identifications: readonly QuantityIdentification[],\n): {\n  junction: BridgeEdge['sources'][number];\n  /** Position in `second.sources`: the slot the pipe fills. One slot, even when the same object sits twice. */\n  index: number;\n  viaIdentification: QuantityIdentification | null;\n} {\n  for (const [index, src] of second.sources.entries()) {\n    if (src.name === first.target.name) {\n      return { junction: src, index, viaIdentification: null };\n    }\n  }\n  for (const ident of identifications) {\n    if (ident.from !== first.target.name) continue;\n    for (const [index, src] of second.sources.entries()) {\n      if (src.name === ident.to) {\n        return { junction: src, index, viaIdentification: ident };\n      }\n    }\n  }\n  throw new CompositionJunctionError(\n    `Cannot compose ${first.id} -> ${second.id}: target quantity ` +\n      `'${first.target.name}' matches none of [${second.sources\n        .map((s) => `'${s.name}'`)\n        .join(', ')}] by name or registered identification`,\n  );\n}\n\n/**\n * The two sides of a composition pipe have the same dimension.\n *\n * This is the check `composeEdges` already applied: `equals` on the seven\n * SI bases, including that function's exponent tolerance. A mismatch is\n * still {@link CompositionDimensionError}.\n *\n * @internal\n */\nexport function junctionDimensionsMatch(left: Dimension, right: Dimension): boolean {\n  return equals(left, right);\n}\n\n/**\n * Compose two edges into a new edge (sequential composition through a\n * shared quantity). See module docs for the definedness conditions.\n *\n * The composed edge's `sources` are `first.sources` followed by\n * `second`'s remaining (non-junction) sources; `kind` is `'law'` only\n * when both operands are laws; `beId` is null (a derived relation has\n * no single catalog row).\n *\n * @public\n */\nexport function composeEdges(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  opts: ComposeOptions = {},\n): BridgeEdge {\n  const identifications = [\n    ...QUANTITY_IDENTIFICATIONS,\n    ...(opts.identifications ?? []),\n  ];\n  const { junction, index: junctionIndex, viaIdentification } = findJunction(\n    first,\n    second,\n    identifications,\n  );\n\n  if (!junctionDimensionsMatch(first.target.dim, junction.dim)) {\n    throw new CompositionDimensionError(\n      `Cannot compose ${first.id} -> ${second.id}: junction dimension ` +\n        `mismatch — ${first.target.name} is ${format(first.target.dim)} ` +\n        `but ${junction.name} is ${format(junction.dim)}`,\n    );\n  }\n  const junctionScale =\n    viaIdentification === null\n      ? 1\n      : conventionFactor(first.target.name, junction.name);\n\n  // The pipe fills ONE slot of `second.sources`, the one `findJunction`\n  // returned. Removal by object identity would also drop a second slot that\n  // holds the same `Quantity` object, which a `shared` disposition produces.\n  const remainingSources = second.sources.filter((_, i) => i !== junctionIndex);\n\n  // v0.11 Option D (namespacing gate): pure name-collision rule across\n  // operands. Intra-operand duplicates (e.g. ['mass','mass'] inherited\n  // from a prior 'shared' disposition) are exempt by construction —\n  // only names present in BOTH first.sources and second's remaining\n  // sources are collisions, and each needs a recorded disposition.\n  const firstNames = new Set(first.sources.map((s) => s.name));\n  const collisionNames = [\n    ...new Set(\n      remainingSources\n        .filter((s) => firstNames.has(s.name))\n        .map((s) => s.name),\n    ),\n  ];\n  const composedId = `${first.id}>>${second.id}`;\n  const dispositions: AliasDisposition[] = [\n    ...(SOURCE_ALIAS_DISPOSITIONS[composedId] ?? []),\n    ...(opts.aliases ?? []),\n  ];\n  const renameMap: Record<string, string> = {}; // renamed key -> operand-internal name\n  const dispositionsUsed: AliasDisposition[] = [];\n  let finalRemaining: Quantity[] = [...remainingSources];\n  for (const name of collisionNames) {\n    const d = dispositions.find((x) => x.name === name);\n    if (!d) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: source quantity '${name}' appears ` +\n          `in BOTH operands (first: [${[...firstNames].join(', ')}]; ` +\n          `second remaining: [${remainingSources\n            .map((s) => s.name)\n            .join(', ')}]). Same name does not imply same physical ` +\n          `quantity — record an AliasDisposition ('shared' or ` +\n          `{renameSecond}) in SOURCE_ALIAS_DISPOSITIONS or opts.aliases.`,\n      );\n    }\n    dispositionsUsed.push(d);\n    if (d.treatAs === 'shared') continue; // one input key feeds both slots\n    const renamed = d.treatAs.renameSecond;\n    if (\n      firstNames.has(renamed) ||\n      second.sources.some((s) => s.name === renamed)\n    ) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: renameSecond target '${renamed}' ` +\n          `collides with an existing source name of an operand (vet A-4).`,\n      );\n    }\n    finalRemaining = finalRemaining.map((s) =>\n      s.name === name ? { ...s, name: renamed, symbol: s.symbol } : s,\n    );\n    renameMap[renamed] = name;\n  }\n\n  /** Build the second operand's input map: remap renamed keys back to\n   *  the operand-internal names (shadowing the first operand's value\n   *  for that name — vet A-4's required remap), then pipe the junction. */\n  const buildSecondInputs = (\n    inputs: Record<string, number>,\n    intermediate: number,\n  ): Record<string, number> => {\n    const si: Record<string, number> = { ...inputs };\n    for (const [renamed, original] of Object.entries(renameMap)) {\n      si[original] = inputs[renamed];\n      delete si[renamed];\n    }\n    si[junction.name] = intermediate * junctionScale;\n    return si;\n  };\n\n  const composedDomain = {\n    description:\n      `(${first.domain.description}) AND, on the piped ` +\n      `${junction.name}, (${second.domain.description})`,\n    // Standalone domain queries evaluate `first` to obtain the piped\n    // intermediate (design D-5; acceptable for scalar closed forms).\n    // The composed `evaluate` below does NOT call this predicate — it\n    // computes the intermediate once and checks both domains inline\n    // (v0.8.0 punch-list: removed the double evaluation of `first`).\n    predicate: (inputs: Record<string, number>): boolean => {\n      if (!first.domain.predicate(inputs)) return false;\n      const intermediate = first.evaluate(inputs);\n      return second.domain.predicate(buildSecondInputs(inputs, intermediate));\n    },\n  };\n\n  const id = `${first.id}>>${second.id}`;\n\n  // ── Atlas Phase 1 (S1.2b): the relation overlay, and NOTHING else. ────────\n  // Entered only when BOTH operands carry a `relation`. An operand with no\n  // relation skips this block, and the composed edge then has no `relation`\n  // key. The catalog edges that carry one are the catalog's `relation` rows\n  // (`tests/composition/relation-refusal.test.ts` lists them); they stay.\n  // When both operands carry a relation, a silent table cell throws\n  // `UndefinedCompositionError`. The approximation cell throws the same\n  // error, because an edge relation carries no norm transport and this\n  // layer does not invent a bound. `enumerateCompositionsWithRefusals`\n  // records that throw on its own list. A dimension or junction failure\n  // is a different error and is not that list.\n  let relationOverlay: Pick<\n    BridgeEdge,\n    'relation' | 'relationDerivedFrom' | 'conventions'\n  > = {};\n  if (first.relation !== undefined && second.relation !== undefined) {\n    const composite = composeRelation(first.relation.type, second.relation.type);\n    if (composite === NO_COMPOSITE_CLAIM) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `asserts no composite relation for '${first.relation.type}' ` +\n          `(${first.id}) followed by '${second.relation.type}' ` +\n          `(${second.id}). This is silence, not refutation — see ` +\n          `docs/planning/Atlas-Phase-1-Design.md §2.2.`,\n      );\n    }\n    if (composite === 'approximation') {\n      // Reachable since the table's one widening: approximation then\n      // exact-equivalence (docs/planning/ADR-transported-norm-composition.md).\n      // An `approximation` contract REQUIRES an `ApproximationBound`, and the\n      // composed bound exists only when the exact map declares a norm\n      // transport. A `RelationContract` on an edge carries none, so this layer\n      // cannot compose the bound and must refuse rather than fabricate one.\n      // The atlas route layer (`boundPath`) is where a declared transport is\n      // applied.\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `returned 'approximation', which requires a composed ` +\n          `ApproximationBound; an edge relation declares no norm transport, ` +\n          `so no bound is composed here (the atlas boundPath applies declared transports).`,\n      );\n    }\n    // Conventions carry forward only when the operands do not CONTRADICT each\n    // other. `checkConventions` treats an undeclared key as unknown, so a\n    // silent operand never blocks the carry-forward; a genuine disagreement\n    // does, and then the composite declares no conventions at all rather than\n    // picking one operand's choice over the other's. One rule, not a per-key\n    // filter: a chain built across a sign disagreement has no single first-law\n    // convention to state, and stating one would be a claim about the chain\n    // that neither operand supports.\n    const merged: Conventions =\n      checkConventions(first.conventions, second.conventions).length === 0\n        ? { ...first.conventions, ...second.conventions }\n        : {};\n    relationOverlay = {\n      relation: composedContract(composite, first.relation, second.relation),\n      relationDerivedFrom: [first.id, second.id],\n      ...(Object.keys(merged).length > 0 ? { conventions: merged } : {}),\n    };\n  }\n\n  return {\n    id,\n    beId: null,\n    kind: first.kind === 'law' && second.kind === 'law' ? 'law' : 'bridge',\n    label: `${first.label} ∘ ${second.label}`,\n    sources: [...first.sources, ...finalRemaining],\n    target: second.target,\n    confidence: minConfidence(first.confidence, second.confidence),\n    domain: composedDomain,\n    evaluate: (inputs) => {\n      if (!first.domain.predicate(inputs)) {\n        throw new DomainViolationError(\n          `${id}: inputs violate composed validity domain ` +\n            `(${composedDomain.description})`,\n        );\n      }\n      // Each operand's unset-coefficient gate is the one `evaluateEdge`\n      // applies to a primitive edge; an operand's monomial times an absent 1\n      // must not reach the caller as a number through the pipe.\n      assertCoefficientSet(first, inputs);\n      const intermediate = first.evaluate(inputs);\n      const pipedInputs = buildSecondInputs(inputs, intermediate);\n      if (!second.domain.predicate(pipedInputs)) {\n        throw new DomainViolationError(\n          `${id}: inputs violate composed validity domain ` +\n            `(${composedDomain.description})`,\n        );\n      }\n      assertCoefficientSet(second, pipedInputs);\n      return second.evaluate(pipedInputs);\n    },\n    citation: `${first.citation} | ${second.citation}`,\n    ...(viaIdentification !== null\n      ? { identificationUsed: viaIdentification }\n      : {}),\n    ...(dispositionsUsed.length > 0\n      ? { aliasDispositionsUsed: dispositionsUsed }\n      : {}),\n    ...relationOverlay,\n    ...carriedClaims(first, second, junction, junctionScale, finalRemaining, renameMap),\n  };\n}\n\n/**\n * The claims a composed edge carries from its operands (9.0.0 audit §4 C5).\n * A composed edge that dropped them answered differently from its operands:\n * the regime gate abstained on every chain longer than two, an unset\n * coefficient became a number, an even input lost its magnitude reading,\n * a count became a Buckingham governor, and an alias key stopped working.\n *\n * - `regime`: the one an operand states; two of one family intersect\n *   (`intersectRegimes`, which also refuses conflicting group definitions);\n *   two of different families refuse with `UndefinedCompositionError`, since\n *   this layer does not state where a cross-family chain applies.\n * - `coefficientUnset`: either operand's. `evaluateEdge` then refuses the\n *   composite; a bound group lifts a primitive entry only, because the group\n *   row is keyed by the entry id, so a composite with an unset operand is\n *   refused by `evaluateEdge` whatever is bound (its own `evaluate` applies\n *   each operand's gate and does lift the operand whose group is bound).\n * - `evenInputs`, `aliases`: the first operand's, plus the second's for its\n *   remaining sources under their composed names. The piped junction is not\n *   an input and is dropped. An alias key that two quantities would share is\n *   carried for neither.\n * - `formulaFactors`: the second operand's for its remaining sources, exact.\n *   The first operand's counts enter through the pipe with their exponent\n *   times the junction's exponent in the second's monomial, so they are\n *   carried only when `second.symbolic` is a monomial that states it.\n * - `symbolic`: the second's form with the junction leaf replaced by the\n *   first's, when both exist, the junction carries no convention factor, no\n *   source was renamed, the leaf occurs, and the result validates to the\n *   target dimension. Otherwise absent, as on a numeric-only edge.\n */\nfunction carriedClaims(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  junction: Quantity,\n  junctionScale: number,\n  finalRemaining: readonly Quantity[],\n  renameMap: Readonly<Record<string, string>>,\n): Pick<BridgeEdge, 'regime' | 'coefficientUnset' | 'evenInputs' | 'formulaFactors' | 'aliases' | 'symbolic'> {\n  const out: {\n    regime?: Regime;\n    coefficientUnset?: boolean;\n    evenInputs?: readonly string[];\n    formulaFactors?: Readonly<Record<string, number>>;\n    aliases?: Readonly<Record<string, readonly string[]>>;\n    symbolic?: ExprNode;\n  } = {};\n\n  if (first.regime !== undefined && second.regime !== undefined) {\n    if (first.regime.family !== second.regime.family) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the regimes are of different ` +\n          `families ('${first.regime.family}', '${second.regime.family}'), and this ` +\n          `layer does not state where a cross-family chain applies.`,\n      );\n    }\n    try {\n      out.regime = intersectRegimes(first.regime, second.regime);\n    } catch (e) {\n      // Conflicting definitions of one group name: the composite has no regime this\n      // layer can state, the same refusal as a cross-family chain.\n      throw new UndefinedCompositionError(`Cannot compose ${first.id} -> ${second.id}: ${(e as Error).message}`);\n    }\n  } else if (first.regime !== undefined || second.regime !== undefined) {\n    out.regime = first.regime ?? second.regime;\n  }\n\n  if (first.coefficientUnset === true || second.coefficientUnset === true) out.coefficientUnset = true;\n\n  // Operand-internal name → the name the composite exposes it under.\n  const composedName = new Map(Object.entries(renameMap).map(([renamed, original]) => [original, renamed]));\n  const exposed = (name: string): string => composedName.get(name) ?? name;\n  const remainingNames = new Set(finalRemaining.map((s) => s.name));\n  const secondRemaining = (name: string): boolean => name !== junction.name && remainingNames.has(exposed(name));\n\n  const even = [\n    ...(first.evenInputs ?? []),\n    ...(second.evenInputs ?? []).filter(secondRemaining).map(exposed),\n  ];\n  if (even.length > 0) out.evenInputs = even;\n\n  const factors: Record<string, number> = {};\n  const junctionExponent = monomialExponents(second.symbolic)?.get(junction.name);\n  if (first.formulaFactors !== undefined && junctionExponent !== undefined) {\n    for (const [name, exp] of Object.entries(first.formulaFactors)) factors[name] = exp * junctionExponent;\n  }\n  for (const [name, exp] of Object.entries(second.formulaFactors ?? {})) {\n    if (secondRemaining(name)) factors[exposed(name)] = exp;\n  }\n  if (Object.keys(factors).length > 0) out.formulaFactors = factors;\n\n  const aliasOwner = new Map<string, string>();\n  const shared = new Set<string>();\n  const aliases: Record<string, string[]> = {};\n  const addAliases = (quantity: string, keys: readonly string[]): void => {\n    for (const key of keys) {\n      const owner = aliasOwner.get(key);\n      if (owner !== undefined && owner !== quantity) shared.add(key);\n      aliasOwner.set(key, quantity);\n      (aliases[quantity] ??= []).push(key);\n    }\n  };\n  for (const [quantity, keys] of Object.entries(first.aliases ?? {})) addAliases(quantity, keys);\n  for (const [quantity, keys] of Object.entries(second.aliases ?? {})) {\n    if (secondRemaining(quantity)) addAliases(exposed(quantity), keys);\n  }\n  const kept = Object.fromEntries(\n    Object.entries(aliases)\n      .map(([quantity, keys]) => [quantity, keys.filter((k) => !shared.has(k))] as const)\n      .filter(([, keys]) => keys.length > 0),\n  );\n  if (Object.keys(kept).length > 0) out.aliases = kept;\n\n  if (\n    first.symbolic !== undefined &&\n    second.symbolic !== undefined &&\n    junctionScale === 1 &&\n    Object.keys(renameMap).length === 0\n  ) {\n    const { expr, count } = substitute(second.symbolic, junction.name, first.symbolic);\n    const v = count > 0 ? validate(expr) : undefined;\n    if (v !== undefined && v.ok && v.inferredDimension !== null && equals(v.inferredDimension, second.target.dim)) {\n      out.symbolic = expr;\n    }\n  }\n\n  return out;\n}\n"]}
+{"version":3,"file":"compose.js","sourceRoot":"","sources":["../../src/composition/compose.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAE3D,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAIvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,yBAAyB,EACzB,wBAAwB,EACxB,yBAAyB,GAC1B,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,0EAA0E;AAC1E,+EAA+E;AAC/E,kEAAkE;AAClE,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AACxF,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,gBAAgB,CACvB,IAA4C,EAC5C,KAAuB,EACvB,MAAwB;IAExB,MAAM,cAAc,GAAG,GAAG,KAAK,CAAC,cAAc,SAAS,MAAM,CAAC,cAAc,EAAE,CAAC;IAC/E,IAAI,IAAI,KAAK,mBAAmB,EAAE,CAAC;QACjC,2EAA2E;QAC3E,6CAA6C;QAC7C,MAAM,EAAE,GAAI,KAAkE,CAAC,OAAO,CAAC;QACvF,MAAM,EAAE,GAAI,MAAmE,CAAC,OAAO,CAAC;QACxF,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;AAClC,CAAC;AAgBD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAsC;IACzE;QACE,IAAI,EAAE,qBAAqB;QAC3B,EAAE,EAAE,aAAa;QACjB,SAAS,EACP,+DAA+D;YAC/D,2DAA2D;YAC3D,2DAA2D;YAC3D,+DAA+D;YAC/D,gDAAgD;QAClD,QAAQ,EAAE,qDAAqD;KAChE;IACD;QACE,IAAI,EAAE,uBAAuB;QAC7B,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,+DAA+D;YAC/D,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,mEAAmE;YACnE,wEAAwE;YACxE,wEAAwE;YACxE,gEAAgE;YAChE,kDAAkD;QACpD,QAAQ,EAAE,iDAAiD;KAC5D;IACD;QACE,IAAI,EAAE,+BAA+B;QACrC,EAAE,EAAE,oBAAoB;QACxB,SAAS,EACP,sDAAsD;YACtD,uEAAuE;YACvE,mEAAmE;YACnE,wEAAwE;YACxE,oEAAoE;YACpE,yEAAyE;YACzE,2EAA2E;YAC3E,0EAA0E;YAC1E,4CAA4C;QAC9C,QAAQ,EAAE,uDAAuD;KAClE;CACF,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,gBAAuD,EACvD,MAAM,GAAsC,wBAAwB;IAEpE,MAAM,YAAY,GAAuB,EAAE,CAAC;IAC5C,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,GAAG;QAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,CAAC,EAAE,KAAK,IAAI;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,MAAM;YAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,2EAA2E;IAC3E,2EAA2E;IAC3E,kEAAkE;IAClE,0EAA0E;IAC1E,2DAA2D;IAC3D,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAkD,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAClH,CAAC;QACF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;IACxD,CAAC;IACD,OAAO,kBAAkB,CAAC,MAAM,EAAE,uBAAuB,IAAI,GAAG,CAAC,CAAC;AACpE,CAAC;AAoBD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAElC;AACF,0EAA0E;AAC1E,2EAA2E;AAC3E,0EAA0E;AAC1E,wEAAwE;AACxE,sEAAsE;AACtE,2EAA2E;AAC3E,4EAA4E;AAC5E,oCAAoC;CACrC,CAAC;AAEF,MAAM,eAAe,GAAmC;IACtD,WAAW,EAAE,CAAC;IACd,WAAW,EAAE,CAAC;IACd,oBAAoB,EAAE,CAAC;CACxB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAiB,EACjB,CAAiB;IAEjB,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAcD,SAAS,YAAY,CACnB,KAAiB,EACjB,MAAkB,EAClB,eAAkD;IAOlD,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI;YAAE,SAAS;QAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC1B,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,wBAAwB,CAChC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,oBAAoB;QAC5D,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,sBAAsB,MAAM,CAAC,OAAO;aACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC,wCAAwC,CACxD,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAAe,EAAE,KAAgB;IACvE,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAiB,EACjB,MAAkB,EAClB,IAAI,GAAmB,EAAE;IAEzB,MAAM,eAAe,GAAG;QACtB,GAAG,wBAAwB;QAC3B,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,EAAE,CAAC;KAChC,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,GAAG,YAAY,CACxE,KAAK,EACL,MAAM,EACN,eAAe,CAChB,CAAC;IAEF,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,uBAAuB;YAC/D,cAAc,KAAK,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;YACjE,OAAO,QAAQ,CAAC,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CACpD,CAAC;IACJ,CAAC;IACD,MAAM,aAAa,GACjB,iBAAiB,KAAK,IAAI;QACxB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAEzD,sEAAsE;IACtE,0EAA0E;IAC1E,2EAA2E;IAC3E,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC;IAE9E,qEAAqE;IACrE,qEAAqE;IACrE,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,cAAc,GAAG;QACrB,GAAG,IAAI,GAAG,CACR,gBAAgB;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACtB;KACF,CAAC;IACF,MAAM,UAAU,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IAC/C,MAAM,YAAY,GAAuB;QACvC,GAAG,CAAC,yBAAyB,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAChD,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;KACxB,CAAC;IACF,MAAM,SAAS,GAA2B,EAAE,CAAC,CAAC,uCAAuC;IACrF,MAAM,gBAAgB,GAAuB,EAAE,CAAC;IAChD,IAAI,cAAc,GAAe,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QACpD,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,sBAAsB,IAAI,YAAY;gBAChE,6BAA6B,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;gBAC5D,sBAAsB,gBAAgB;qBACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,6CAA6C;gBAC1D,qDAAqD;gBACrD,+DAA+D,CAClE,CAAC;QACJ,CAAC;QACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,OAAO,KAAK,QAAQ;YAAE,SAAS,CAAC,iCAAiC;QACvE,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC;QACvC,IACE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,EAC9C,CAAC;YACD,MAAM,IAAI,qBAAqB,CAC7B,kBAAkB,UAAU,0BAA0B,OAAO,IAAI;gBAC/D,gEAAgE,CACnE,CAAC;QACJ,CAAC;QACD,cAAc,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAChE,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;IAC5B,CAAC;IAED;;6EAEyE;IACzE,MAAM,iBAAiB,GAAG,CACxB,MAA8B,EAC9B,YAAoB,EACI,EAAE;QAC1B,MAAM,EAAE,GAA2B,EAAE,GAAG,MAAM,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5D,EAAE,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC/B,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;QACrB,CAAC;QACD,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACjD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,EAAE,GAAG,GAAG,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;IACvC,0EAA0E;IAC1E,MAAM,WAAW,GAAG,CAAC,KAA+B,EAAE,EAAE,CAAC,CAAC,IAAY,EAAU,EAAE,CAChF,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IAC1F,MAAM,YAAY,GAAG,MAAM,MAAM,CAAC,EAAE,UAAU,QAAQ,CAAC,IAAI,eAAe,KAAK,CAAC,EAAE,EAAE,CAAC;IAErF,MAAM,cAAc,GAAmB;QACrC,WAAW,EACT,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,sBAAsB;YAClD,GAAG,QAAQ,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,CAAC,WAAW,GAAG;QACpD,iEAAiE;QACjE,iEAAiE;QACjE,kEAAkE;QAClE,gEAAgE;QAChE,iEAAiE;QACjE,SAAS,EAAE,CAAC,MAA8B,EAAW,EAAE;YACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,UAAU,EAAE,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE;YAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,MAAM,CAAC;YACrC,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;YAChE,OAAO,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7D,CAAC;KACF,CAAC;IAGF,6EAA6E;IAC7E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,wEAAwE;IACxE,kEAAkE;IAClE,sEAAsE;IACtE,qEAAqE;IACrE,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,IAAI,eAAe,GAGf,EAAE,CAAC;IACP,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAClE,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,kBAAkB,EAAE,CAAC;YACrC,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sCAAsC,KAAK,CAAC,QAAQ,CAAC,IAAI,IAAI;gBAC7D,IAAI,KAAK,CAAC,EAAE,kBAAkB,MAAM,CAAC,QAAQ,CAAC,IAAI,IAAI;gBACtD,IAAI,MAAM,CAAC,EAAE,2CAA2C;gBACxD,6CAA6C,CAChD,CAAC;QACJ,CAAC;QACD,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;YAClC,+DAA+D;YAC/D,yEAAyE;YACzE,wEAAwE;YACxE,gEAAgE;YAChE,yEAAyE;YACzE,sEAAsE;YACtE,uEAAuE;YACvE,WAAW;YACX,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,0BAA0B;gBAClE,sDAAsD;gBACtD,mEAAmE;gBACnE,iFAAiF,CACpF,CAAC;QACJ,CAAC;QACD,0EAA0E;QAC1E,sEAAsE;QACtE,wEAAwE;QACxE,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,iCAAiC;QACjC,MAAM,MAAM,GACV,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC;YAClE,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,WAAW,EAAE;YACjD,CAAC,CAAC,EAAE,CAAC;QACT,eAAe,GAAG;YAChB,QAAQ,EAAE,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;YACtE,mBAAmB,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YAC1C,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;IACJ,CAAC;IAED,OAAO;QACL,EAAE;QACF,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ;QACtE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,EAAE;QACzC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,cAAc,CAAC;QAC9C,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,UAAU,EAAE,aAAa,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;QAC9D,MAAM,EAAE,cAAc;QACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,oBAAoB,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACxF,CAAC;YACD,kEAAkE;YAClE,uEAAuE;YACvE,0DAA0D;YAC1D,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,oBAAoB,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YACvH,CAAC;YACD,oBAAoB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,OAAO,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QACtC,CAAC;QACD,QAAQ,EAAE,GAAG,KAAK,CAAC,QAAQ,MAAM,MAAM,CAAC,QAAQ,EAAE;QAClD,GAAG,CAAC,iBAAiB,KAAK,IAAI;YAC5B,CAAC,CAAC,EAAE,kBAAkB,EAAE,iBAAiB,EAAE;YAC3C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,EAAE,qBAAqB,EAAE,gBAAgB,EAAE;YAC7C,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,eAAe;QAClB,GAAG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,CAAC;KACpF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,SAAS,aAAa,CACpB,KAAiB,EACjB,MAAkB,EAClB,QAAkB,EAClB,aAAqB,EACrB,cAAmC,EACnC,SAA2C;IAE3C,MAAM,GAAG,GAOL,EAAE,CAAC;IAEP,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9D,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjD,MAAM,IAAI,yBAAyB,CACjC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,iCAAiC;gBACzE,cAAc,KAAK,CAAC,MAAM,CAAC,MAAM,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,eAAe;gBAC3E,0DAA0D,CAC7D,CAAC;QACJ,CAAC;QACD,IAAI,CAAC;YACH,GAAG,CAAC,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7D,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,8EAA8E;YAC9E,6DAA6D;YAC7D,MAAM,IAAI,yBAAyB,CAAC,kBAAkB,KAAK,CAAC,EAAE,OAAO,MAAM,CAAC,EAAE,KAAM,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACrE,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,IAAI,IAAI,MAAM,CAAC,gBAAgB,KAAK,IAAI;QAAE,GAAG,CAAC,gBAAgB,GAAG,IAAI,CAAC;IAErG,mEAAmE;IACnE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,OAAO,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IACzE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAE/G,MAAM,IAAI,GAAG;QACX,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;QAC3B,GAAG,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC;KAClE,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC;IAE3C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAChF,IAAI,KAAK,CAAC,cAAc,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,gBAAgB,CAAC;IACzG,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,IAAI,eAAe,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IAC1D,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,cAAc,GAAG,OAAO,CAAC;IAElE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,OAAO,GAA6B,EAAE,CAAC;IAC7C,MAAM,UAAU,GAAG,CAAC,QAAgB,EAAE,IAAuB,EAAQ,EAAE;QACrE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/D,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;QAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC/F,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QACpE,IAAI,eAAe,CAAC,QAAQ,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAC7B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;SACpB,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAU,CAAC;SAClF,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CACzC,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC;IAErD,IACE,KAAK,CAAC,QAAQ,KAAK,SAAS;QAC5B,MAAM,CAAC,QAAQ,KAAK,SAAS;QAC7B,aAAa,KAAK,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QACnF,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,iBAAiB,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9G,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Composition graph — the composition operator (v0.8.0 T2/T4, per\n * docs/planning/v0.8.0-Design.md §3 + r2 deltas).\n *\n * `composeEdges(first, second)` pipes `first`'s output quantity into a\n * matching source of `second`, producing a NEW `BridgeEdge` (design\n * D-2 — composition closes over the edge type, so chains nest\n * arbitrarily). Defined iff:\n *\n *   1. `first.target` matches one of `second.sources` — by canonical\n *      name, or via an explicit {@link QuantityIdentification} (the\n *      reviewable physics judgments, e.g. \"the Hawking temperature IS\n *      the temperature in Landauer's bound\");\n *   2. the junction dimensions are EXACTLY equal (the dimension-functor\n *      check — ℤ⁷ integer-vector equality via the dimensional\n *      calculus's `equals`);\n *   3. domains conjoin THROUGH the pipe (design D-5): the composed\n *      domain checks `first`'s domain on the outer inputs and\n *      `second`'s domain on the piped intermediate value. This\n *      evaluates `first.evaluate` inside the predicate — acceptable\n *      for scalar closed forms.\n *\n * Confidence demotes: `min(first, second)` on\n * established > speculative > highly-speculative. Composition never\n * launders credibility (improvement-plan confidence algebra).\n *\n * Operator is named `composeEdges` (NOT `compose`) — `compose` is the\n * public v0.7 Cell factory in `src/core/cell.ts` (Adam A-1).\n *\n * @module composition/compose\n */\n\nimport { equals, format } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { validate } from '../dimensional/validator.js';\nimport type { ExprNode } from '../dimensional/validator.js';\nimport type { BridgeEdge, EdgeConfidence, ValidityDomain } from './edge.js';\nimport type { Quantity, RegimeAttributes } from './quantity.js';\nimport { regimeAttributesOf } from './quantity.js';\nimport { AXES } from './axes.js';\nimport { conventionFactor } from '../dimensional/unit-convention.js';\nimport {\n  assertCoefficientSet,\n  CompositionAliasError,\n  CompositionDimensionError,\n  CompositionJunctionError,\n  UndefinedCompositionError,\n} from './edge.js';\nimport { DomainViolationError } from '../bridges/evaluation-errors.js';\nimport { substitute } from './expr-subst.js';\nimport { monomialExponents } from './formula-shape.js';\n// Atlas Phase 1 overlay. The composition table is a leaf module (pure, no\n// registry reads, no import from `src/composition/`), so this does not close a\n// cycle — same rule as the type-only atlas import in `./edge.ts`.\nimport { composeRelation, NO_COMPOSITE_CLAIM } from '../relations/composition-table.js';\nimport { checkConventions } from '../relations/conventions.js';\nimport { intersectRegimes } from '../relations/regime.js';\nimport type { Conventions, Regime, RelationContract, RelationType } from '../relations/types.js';\n\n/**\n * The `RelationContract` a composed edge carries, given the composite TYPE the\n * table returned and the two operand contracts.\n *\n * Only four types can be returned by the table (`derivation`,\n * `exact-equivalence`, `restriction`, `coarse-graining`); the other four appear\n * only as operands. `exact-equivalence` is produced by exactly one cell —\n * `exact-equivalence ∘ exact-equivalence` — so both operands are guaranteed to\n * carry the `inverse` its contract requires, and the composed inverse undoes\n * the second map first.\n *\n * NOT composed here: an `ApproximationBound`. `coarse-graining ∘\n * coarse-graining` accumulates error through `composeBounds`\n * (`src/atlas/error-algebra.ts`), which the implementation plan wires in as a\n * SEPARATE task behind this same guard. Until then the composite states its\n * type and no bound — it does not restate either operand's bound, which would\n * be a narrower error claim than the chain supports.\n *\n * @internal\n */\nfunction composedContract(\n  type: Exclude<RelationType, 'approximation'>,\n  first: RelationContract,\n  second: RelationContract,\n): RelationContract {\n  const transformation = `${first.transformation} then ${second.transformation}`;\n  if (type === 'exact-equivalence') {\n    // Guarded by the table: only exact ∘ exact yields exact, and that contract\n    // makes `inverse` REQUIRED on both operands.\n    const fi = (first as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    const si = (second as Extract<RelationContract, { type: 'exact-equivalence' }>).inverse;\n    return { type, transformation, inverse: `${si} then ${fi}` };\n  }\n  return { type, transformation };\n}\n\n/**\n * A reviewable quantity-identification judgment: the assertion that\n * the quantity named `from` (an edge's target) IS the quantity named\n * `to` (another edge's source), with the physics rationale on record.\n *\n * @public\n */\nexport interface QuantityIdentification {\n  readonly from: string;\n  readonly to: string;\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered identifications (v0.8.0 CT-1). Each entry is a physics\n * judgment intended for review — see CONTRIBUTING.md.\n *\n * @public\n */\nexport const QUANTITY_IDENTIFICATIONS: readonly QuantityIdentification[] = [\n  {\n    from: 'hawking-temperature',\n    to: 'temperature',\n    rationale:\n      'The Hawking temperature of a black-hole horizon is a genuine ' +\n      'thermodynamic temperature — the temperature appearing in ' +\n      \"Landauer's bound for erasure at the horizon. This is the \" +\n      'standard identification underlying black-hole thermodynamics ' +\n      '(the horizon radiates as a black body at T_H).',\n    citation: 'Hawking 1975 CMP 43:199; Bekenstein 1973 PRD 7:2333',\n  },\n  {\n    from: 'de-broglie-wavelength',\n    to: 'compton-wavelength',\n    rationale:\n      'The de Broglie wavelength λ = h/p and the Compton wavelength ' +\n      'λ_C = h/(mc) are the SAME matter-wavelength quantity of a massive ' +\n      'particle; the Compton wavelength is its value in the relativistic ' +\n      'limit p = mc (v → c). They are equal only in that limit, but at the ' +\n      'composition graph’s quantity-KIND resolution they name one node. ' +\n      'Folded ONTO compton-wavelength (not the reverse) because that node is ' +\n      'anchor-determinable (ℏ/mc from a mass) and carries the sourced atomic ' +\n      'scale the magnitude gate needs; de-broglie’s own form needs a ' +\n      'momentum the single-mass anchor does not supply.',\n    citation: 'de Broglie 1924; Compton 1923 Phys. Rev. 21:483',\n  },\n  {\n    from: 'thermal-de-broglie-wavelength',\n    to: 'thermal-wavelength',\n    rationale:\n      'The catalog names the thermal de Broglie wavelength ' +\n      'λ_T = √(2πℏ²/(m k_B T)) `thermal-de-broglie-wavelength` (BE-11 Zurek ' +\n      'decoherence, BE-12 Caldeira–Leggett coherence length), while the ' +\n      'canonical L-layer law `CE-thermal-de-broglie` names the SAME physical ' +\n      'quantity `thermal-wavelength`. They are one node. Folded ONTO the ' +\n      'canonical `thermal-wavelength` (anchor-determinable: √(2πℏ²/(m k_B T)) ' +\n      'from a mass + temperature), reconnecting BE-11 — an ESTABLISHED bridge — ' +\n      'to standard physics (surfaced by the bridges-vs-canonical map; the link ' +\n      'was hidden purely by the name divergence).',\n    citation: 'de Broglie 1924; standard statistical mechanics (λ_T)',\n  },\n];\n\n/**\n * Effective regime attributes for a candidate NAME, resolved through the\n * `QUANTITY_IDENTIFICATIONS` fold — the SINGLE shared implementation every\n * attribute consumer must use (Eve r3 #2 mandate; the discovery-hardening\n * Phase-2 axis-compatibility gate is the first). `attributesByName` is the\n * REGISTRY-only source (never canonical per-equation stamps — Option-A,\n * audit adjudication F1): callers supply it (production: every centralized\n * `Quantity.attributes`; tests: an injected fixture map), this function only\n * does the fold resolution.\n *\n * Candidate names are already fold-canonicalized (the `to` side of an\n * identification); this additionally pulls in every `from` contributor that\n * folds ONTO `name` and, per axis, unions their stated value with `name`'s\n * own. Where contributors DISAGREE on an axis, the axis counts as UNSTATED\n * (conflict → abstain) rather than picking a side — the fold-conflict rule.\n *\n * @internal\n */\nexport function effectiveAttributes(\n  name: string,\n  attributesByName: ReadonlyMap<string, RegimeAttributes>,\n  idents: readonly QuantityIdentification[] = QUANTITY_IDENTIFICATIONS,\n): RegimeAttributes {\n  const contributors: RegimeAttributes[] = [];\n  const own = attributesByName.get(name);\n  if (own) contributors.push(own);\n  for (const id of idents) {\n    if (id.to !== name) continue;\n    const folded = attributesByName.get(id.from);\n    if (folded) contributors.push(folded);\n  }\n\n  // One-value-agrees, zero-or-conflicting-values-abstain, per REGISTRY axis.\n  // The fold reads `AXES`, so an axis the registry carries is folded here: a\n  // hand list once named scale, force and information only, and the\n  // discrimination audit then measured symmetry, topology and statistics as\n  // `checked: 0` whatever the data said (9.0.0 audit §4 C2).\n  const folded: Record<string, string> = {};\n  for (const { name } of AXES) {\n    const values = new Set(\n      contributors.map((c) => (c as Readonly<Record<string, string | undefined>>)[name]).filter((v) => v !== undefined),\n    );\n    if (values.size === 1) folded[name] = [...values][0]!;\n  }\n  return regimeAttributesOf(folded, `effectiveAttributes(${name})`);\n}\n\n/**\n * A recorded aliasing judgment for one duplicate source name in a\n * composition (v0.11 Option D). `'shared'` = one input deliberately\n * feeds both slots (e.g. ST-2: one M is both the lens and the r_s\n * source). `renameSecond` = split the collision: the SECOND operand's\n * quantity is renamed, and the composed evaluator remaps the renamed\n * input key back to the operand's internal name (vet A-4 — without the\n * remap the rename is a no-op).\n *\n * @public\n */\nexport interface AliasDisposition {\n  readonly name: string;\n  readonly treatAs: 'shared' | { readonly renameSecond: string };\n  readonly rationale: string;\n  readonly citation?: string;\n}\n\n/**\n * Registered alias dispositions, keyed by composed id\n * (`first.id>>second.id`) — judgments live in reviewable registry\n * data, mirroring {@link QUANTITY_IDENTIFICATIONS} (vet A-6.2).\n *\n * @public\n */\nexport const SOURCE_ALIAS_DISPOSITIONS: Readonly<\n  Record<string, readonly AliasDisposition[]>\n> = {\n  // Empty. The one entry this table held, `law-schwarzschild-radius>>be-51`\n  // (\"ST-2\": one M is both the lens and the r_s source), keyed a composition\n  // no call can reach: the law's target `schwarzschild-radius` matches none\n  // of be-51's sources (`mass`, `impact-parameter`) by name or registered\n  // identification, so `composeEdges` throws `CompositionJunctionError`\n  // before the alias gate runs. The judgment was never applied. Retracted in\n  // the 9.0.0 audit (§4 C8); `tests/composition/compose.test.ts` now requires\n  // every key here to reach the gate.\n};\n\nconst CONFIDENCE_RANK: Record<EdgeConfidence, number> = {\n  established: 2,\n  speculative: 1,\n  'highly-speculative': 0,\n};\n\n/**\n * Confidence demotion: the min of the two grades on the ordering\n * established > speculative > highly-speculative.\n *\n * @public\n */\nexport function minConfidence(\n  a: EdgeConfidence,\n  b: EdgeConfidence,\n): EdgeConfidence {\n  return CONFIDENCE_RANK[a] <= CONFIDENCE_RANK[b] ? a : b;\n}\n\n/** Options for {@link composeEdges}. @public */\nexport interface ComposeOptions {\n  /** Extra identifications, consulted after the registered ones. */\n  readonly identifications?: readonly QuantityIdentification[];\n  /**\n   * Alias dispositions for duplicate source names (v0.11 Option D);\n   * consulted after {@link SOURCE_ALIAS_DISPOSITIONS} entries for the\n   * composed id.\n   */\n  readonly aliases?: readonly AliasDisposition[];\n}\n\nfunction findJunction(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  identifications: readonly QuantityIdentification[],\n): {\n  junction: BridgeEdge['sources'][number];\n  /** Position in `second.sources`: the slot the pipe fills. One slot, even when the same object sits twice. */\n  index: number;\n  viaIdentification: QuantityIdentification | null;\n} {\n  for (const [index, src] of second.sources.entries()) {\n    if (src.name === first.target.name) {\n      return { junction: src, index, viaIdentification: null };\n    }\n  }\n  for (const ident of identifications) {\n    if (ident.from !== first.target.name) continue;\n    for (const [index, src] of second.sources.entries()) {\n      if (src.name === ident.to) {\n        return { junction: src, index, viaIdentification: ident };\n      }\n    }\n  }\n  throw new CompositionJunctionError(\n    `Cannot compose ${first.id} -> ${second.id}: target quantity ` +\n      `'${first.target.name}' matches none of [${second.sources\n        .map((s) => `'${s.name}'`)\n        .join(', ')}] by name or registered identification`,\n  );\n}\n\n/**\n * The two sides of a composition pipe have the same dimension.\n *\n * This is the check `composeEdges` already applied: `equals` on the seven\n * SI bases, including that function's exponent tolerance. A mismatch is\n * still {@link CompositionDimensionError}.\n *\n * @internal\n */\nexport function junctionDimensionsMatch(left: Dimension, right: Dimension): boolean {\n  return equals(left, right);\n}\n\n/**\n * Compose two edges into a new edge (sequential composition through a\n * shared quantity). See module docs for the definedness conditions.\n *\n * The composed edge's `sources` are `first.sources` followed by\n * `second`'s remaining (non-junction) sources; `kind` is `'law'` only\n * when both operands are laws; `beId` is null (a derived relation has\n * no single catalog row).\n *\n * @public\n */\nexport function composeEdges(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  opts: ComposeOptions = {},\n): BridgeEdge {\n  const identifications = [\n    ...QUANTITY_IDENTIFICATIONS,\n    ...(opts.identifications ?? []),\n  ];\n  const { junction, index: junctionIndex, viaIdentification } = findJunction(\n    first,\n    second,\n    identifications,\n  );\n\n  if (!junctionDimensionsMatch(first.target.dim, junction.dim)) {\n    throw new CompositionDimensionError(\n      `Cannot compose ${first.id} -> ${second.id}: junction dimension ` +\n        `mismatch — ${first.target.name} is ${format(first.target.dim)} ` +\n        `but ${junction.name} is ${format(junction.dim)}`,\n    );\n  }\n  const junctionScale =\n    viaIdentification === null\n      ? 1\n      : conventionFactor(first.target.name, junction.name);\n\n  // The pipe fills ONE slot of `second.sources`, the one `findJunction`\n  // returned. Removal by object identity would also drop a second slot that\n  // holds the same `Quantity` object, which a `shared` disposition produces.\n  const remainingSources = second.sources.filter((_, i) => i !== junctionIndex);\n\n  // v0.11 Option D (namespacing gate): pure name-collision rule across\n  // operands. Intra-operand duplicates (e.g. ['mass','mass'] inherited\n  // from a prior 'shared' disposition) are exempt by construction —\n  // only names present in BOTH first.sources and second's remaining\n  // sources are collisions, and each needs a recorded disposition.\n  const firstNames = new Set(first.sources.map((s) => s.name));\n  const collisionNames = [\n    ...new Set(\n      remainingSources\n        .filter((s) => firstNames.has(s.name))\n        .map((s) => s.name),\n    ),\n  ];\n  const composedId = `${first.id}>>${second.id}`;\n  const dispositions: AliasDisposition[] = [\n    ...(SOURCE_ALIAS_DISPOSITIONS[composedId] ?? []),\n    ...(opts.aliases ?? []),\n  ];\n  const renameMap: Record<string, string> = {}; // renamed key -> operand-internal name\n  const dispositionsUsed: AliasDisposition[] = [];\n  let finalRemaining: Quantity[] = [...remainingSources];\n  for (const name of collisionNames) {\n    const d = dispositions.find((x) => x.name === name);\n    if (!d) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: source quantity '${name}' appears ` +\n          `in BOTH operands (first: [${[...firstNames].join(', ')}]; ` +\n          `second remaining: [${remainingSources\n            .map((s) => s.name)\n            .join(', ')}]). Same name does not imply same physical ` +\n          `quantity — record an AliasDisposition ('shared' or ` +\n          `{renameSecond}) in SOURCE_ALIAS_DISPOSITIONS or opts.aliases.`,\n      );\n    }\n    dispositionsUsed.push(d);\n    if (d.treatAs === 'shared') continue; // one input key feeds both slots\n    const renamed = d.treatAs.renameSecond;\n    if (\n      firstNames.has(renamed) ||\n      second.sources.some((s) => s.name === renamed)\n    ) {\n      throw new CompositionAliasError(\n        `Cannot compose ${composedId}: renameSecond target '${renamed}' ` +\n          `collides with an existing source name of an operand (vet A-4).`,\n      );\n    }\n    finalRemaining = finalRemaining.map((s) =>\n      s.name === name ? { ...s, name: renamed, symbol: s.symbol } : s,\n    );\n    renameMap[renamed] = name;\n  }\n\n  /** Build the second operand's input map: remap renamed keys back to\n   *  the operand-internal names (shadowing the first operand's value\n   *  for that name — vet A-4's required remap), then pipe the junction. */\n  const buildSecondInputs = (\n    inputs: Record<string, number>,\n    intermediate: number,\n  ): Record<string, number> => {\n    const si: Record<string, number> = { ...inputs };\n    for (const [renamed, original] of Object.entries(renameMap)) {\n      si[original] = inputs[renamed];\n      delete si[renamed];\n    }\n    si[junction.name] = intermediate * junctionScale;\n    return si;\n  };\n\n  const id = `${first.id}>>${second.id}`;\n  // A name `second` reads under a renamed key reads it under that key here.\n  const secondKeyOf = (keyOf: (name: string) => string) => (name: string): string =>\n    keyOf(Object.entries(renameMap).find(([, original]) => original === name)?.[0] ?? name);\n  const pipedContext = `on ${second.id}, with ${junction.name} piped from ${first.id}`;\n\n  const composedDomain: ValidityDomain = {\n    description:\n      `(${first.domain.description}) AND, on the piped ` +\n      `${junction.name}, (${second.domain.description})`,\n    // Standalone domain queries evaluate `first` to obtain the piped\n    // intermediate (design D-5; acceptable for scalar closed forms).\n    // The composed `evaluate` below does NOT call this predicate — it\n    // computes the intermediate once and checks both domains inline\n    // (v0.8.0 punch-list: removed the double evaluation of `first`).\n    predicate: (inputs: Record<string, number>): boolean => {\n      if (!first.domain.predicate(inputs)) return false;\n      const intermediate = first.evaluate(inputs);\n      return second.domain.predicate(buildSecondInputs(inputs, intermediate));\n    },\n    violations: (inputs, keyOf = (name) => name) => {\n      const before = first.domain.violations(inputs, keyOf);\n      if (before.length > 0) return before;\n      const piped = buildSecondInputs(inputs, first.evaluate(inputs));\n      return second.domain.violations(piped, secondKeyOf(keyOf));\n    },\n  };\n\n\n  // ── Atlas Phase 1 (S1.2b): the relation overlay, and NOTHING else. ────────\n  // Entered only when BOTH operands carry a `relation`. An operand with no\n  // relation skips this block, and the composed edge then has no `relation`\n  // key. The catalog edges that carry one are the catalog's `relation` rows\n  // (`tests/composition/relation-refusal.test.ts` lists them); they stay.\n  // When both operands carry a relation, a silent table cell throws\n  // `UndefinedCompositionError`. The approximation cell throws the same\n  // error, because an edge relation carries no norm transport and this\n  // layer does not invent a bound. `enumerateCompositionsWithRefusals`\n  // records that throw on its own list. A dimension or junction failure\n  // is a different error and is not that list.\n  let relationOverlay: Pick<\n    BridgeEdge,\n    'relation' | 'relationDerivedFrom' | 'conventions'\n  > = {};\n  if (first.relation !== undefined && second.relation !== undefined) {\n    const composite = composeRelation(first.relation.type, second.relation.type);\n    if (composite === NO_COMPOSITE_CLAIM) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `asserts no composite relation for '${first.relation.type}' ` +\n          `(${first.id}) followed by '${second.relation.type}' ` +\n          `(${second.id}). This is silence, not refutation — see ` +\n          `docs/planning/Atlas-Phase-1-Design.md §2.2.`,\n      );\n    }\n    if (composite === 'approximation') {\n      // Reachable since the table's one widening: approximation then\n      // exact-equivalence (docs/planning/ADR-transported-norm-composition.md).\n      // An `approximation` contract REQUIRES an `ApproximationBound`, and the\n      // composed bound exists only when the exact map declares a norm\n      // transport. A `RelationContract` on an edge carries none, so this layer\n      // cannot compose the bound and must refuse rather than fabricate one.\n      // The atlas route layer (`boundPath`) is where a declared transport is\n      // applied.\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the composition table ` +\n          `returned 'approximation', which requires a composed ` +\n          `ApproximationBound; an edge relation declares no norm transport, ` +\n          `so no bound is composed here (the atlas boundPath applies declared transports).`,\n      );\n    }\n    // Conventions carry forward only when the operands do not CONTRADICT each\n    // other. `checkConventions` treats an undeclared key as unknown, so a\n    // silent operand never blocks the carry-forward; a genuine disagreement\n    // does, and then the composite declares no conventions at all rather than\n    // picking one operand's choice over the other's. One rule, not a per-key\n    // filter: a chain built across a sign disagreement has no single first-law\n    // convention to state, and stating one would be a claim about the chain\n    // that neither operand supports.\n    const merged: Conventions =\n      checkConventions(first.conventions, second.conventions).length === 0\n        ? { ...first.conventions, ...second.conventions }\n        : {};\n    relationOverlay = {\n      relation: composedContract(composite, first.relation, second.relation),\n      relationDerivedFrom: [first.id, second.id],\n      ...(Object.keys(merged).length > 0 ? { conventions: merged } : {}),\n    };\n  }\n\n  return {\n    id,\n    beId: null,\n    kind: first.kind === 'law' && second.kind === 'law' ? 'law' : 'bridge',\n    label: `${first.label} ∘ ${second.label}`,\n    sources: [...first.sources, ...finalRemaining],\n    target: second.target,\n    confidence: minConfidence(first.confidence, second.confidence),\n    domain: composedDomain,\n    evaluate: (inputs) => {\n      if (!first.domain.predicate(inputs)) {\n        throw new DomainViolationError(id, first.domain.violations(inputs), `on ${first.id}`);\n      }\n      // Each operand's unset-coefficient gate is the one `evaluateEdge`\n      // applies to a primitive edge; an operand's monomial times an absent 1\n      // must not reach the caller as a number through the pipe.\n      assertCoefficientSet(first, inputs);\n      const intermediate = first.evaluate(inputs);\n      const pipedInputs = buildSecondInputs(inputs, intermediate);\n      if (!second.domain.predicate(pipedInputs)) {\n        throw new DomainViolationError(id, second.domain.violations(pipedInputs, secondKeyOf((name) => name)), pipedContext);\n      }\n      assertCoefficientSet(second, pipedInputs);\n      return second.evaluate(pipedInputs);\n    },\n    citation: `${first.citation} | ${second.citation}`,\n    ...(viaIdentification !== null\n      ? { identificationUsed: viaIdentification }\n      : {}),\n    ...(dispositionsUsed.length > 0\n      ? { aliasDispositionsUsed: dispositionsUsed }\n      : {}),\n    ...relationOverlay,\n    ...carriedClaims(first, second, junction, junctionScale, finalRemaining, renameMap),\n  };\n}\n\n/**\n * The claims a composed edge carries from its operands (9.0.0 audit §4 C5).\n * A composed edge that dropped them answered differently from its operands:\n * the regime gate abstained on every chain longer than two, an unset\n * coefficient became a number, an even input lost its magnitude reading,\n * a count became a Buckingham governor, and an alias key stopped working.\n *\n * - `regime`: the one an operand states; two of one family intersect\n *   (`intersectRegimes`, which also refuses conflicting group definitions);\n *   two of different families refuse with `UndefinedCompositionError`, since\n *   this layer does not state where a cross-family chain applies.\n * - `coefficientUnset`: either operand's. `evaluateEdge` then refuses the\n *   composite; a bound group lifts a primitive entry only, because the group\n *   row is keyed by the entry id, so a composite with an unset operand is\n *   refused by `evaluateEdge` whatever is bound (its own `evaluate` applies\n *   each operand's gate and does lift the operand whose group is bound).\n * - `evenInputs`, `aliases`: the first operand's, plus the second's for its\n *   remaining sources under their composed names. The piped junction is not\n *   an input and is dropped. An alias key that two quantities would share is\n *   carried for neither.\n * - `formulaFactors`: the second operand's for its remaining sources, exact.\n *   The first operand's counts enter through the pipe with their exponent\n *   times the junction's exponent in the second's monomial, so they are\n *   carried only when `second.symbolic` is a monomial that states it.\n * - `symbolic`: the second's form with the junction leaf replaced by the\n *   first's, when both exist, the junction carries no convention factor, no\n *   source was renamed, the leaf occurs, and the result validates to the\n *   target dimension. Otherwise absent, as on a numeric-only edge.\n */\nfunction carriedClaims(\n  first: BridgeEdge,\n  second: BridgeEdge,\n  junction: Quantity,\n  junctionScale: number,\n  finalRemaining: readonly Quantity[],\n  renameMap: Readonly<Record<string, string>>,\n): Pick<BridgeEdge, 'regime' | 'coefficientUnset' | 'evenInputs' | 'formulaFactors' | 'aliases' | 'symbolic'> {\n  const out: {\n    regime?: Regime;\n    coefficientUnset?: boolean;\n    evenInputs?: readonly string[];\n    formulaFactors?: Readonly<Record<string, number>>;\n    aliases?: Readonly<Record<string, readonly string[]>>;\n    symbolic?: ExprNode;\n  } = {};\n\n  if (first.regime !== undefined && second.regime !== undefined) {\n    if (first.regime.family !== second.regime.family) {\n      throw new UndefinedCompositionError(\n        `Cannot compose ${first.id} -> ${second.id}: the regimes are of different ` +\n          `families ('${first.regime.family}', '${second.regime.family}'), and this ` +\n          `layer does not state where a cross-family chain applies.`,\n      );\n    }\n    try {\n      out.regime = intersectRegimes(first.regime, second.regime);\n    } catch (e) {\n      // Conflicting definitions of one group name: the composite has no regime this\n      // layer can state, the same refusal as a cross-family chain.\n      throw new UndefinedCompositionError(`Cannot compose ${first.id} -> ${second.id}: ${(e as Error).message}`);\n    }\n  } else if (first.regime !== undefined || second.regime !== undefined) {\n    out.regime = first.regime ?? second.regime;\n  }\n\n  if (first.coefficientUnset === true || second.coefficientUnset === true) out.coefficientUnset = true;\n\n  // Operand-internal name → the name the composite exposes it under.\n  const composedName = new Map(Object.entries(renameMap).map(([renamed, original]) => [original, renamed]));\n  const exposed = (name: string): string => composedName.get(name) ?? name;\n  const remainingNames = new Set(finalRemaining.map((s) => s.name));\n  const secondRemaining = (name: string): boolean => name !== junction.name && remainingNames.has(exposed(name));\n\n  const even = [\n    ...(first.evenInputs ?? []),\n    ...(second.evenInputs ?? []).filter(secondRemaining).map(exposed),\n  ];\n  if (even.length > 0) out.evenInputs = even;\n\n  const factors: Record<string, number> = {};\n  const junctionExponent = monomialExponents(second.symbolic)?.get(junction.name);\n  if (first.formulaFactors !== undefined && junctionExponent !== undefined) {\n    for (const [name, exp] of Object.entries(first.formulaFactors)) factors[name] = exp * junctionExponent;\n  }\n  for (const [name, exp] of Object.entries(second.formulaFactors ?? {})) {\n    if (secondRemaining(name)) factors[exposed(name)] = exp;\n  }\n  if (Object.keys(factors).length > 0) out.formulaFactors = factors;\n\n  const aliasOwner = new Map<string, string>();\n  const shared = new Set<string>();\n  const aliases: Record<string, string[]> = {};\n  const addAliases = (quantity: string, keys: readonly string[]): void => {\n    for (const key of keys) {\n      const owner = aliasOwner.get(key);\n      if (owner !== undefined && owner !== quantity) shared.add(key);\n      aliasOwner.set(key, quantity);\n      (aliases[quantity] ??= []).push(key);\n    }\n  };\n  for (const [quantity, keys] of Object.entries(first.aliases ?? {})) addAliases(quantity, keys);\n  for (const [quantity, keys] of Object.entries(second.aliases ?? {})) {\n    if (secondRemaining(quantity)) addAliases(exposed(quantity), keys);\n  }\n  const kept = Object.fromEntries(\n    Object.entries(aliases)\n      .map(([quantity, keys]) => [quantity, keys.filter((k) => !shared.has(k))] as const)\n      .filter(([, keys]) => keys.length > 0),\n  );\n  if (Object.keys(kept).length > 0) out.aliases = kept;\n\n  if (\n    first.symbolic !== undefined &&\n    second.symbolic !== undefined &&\n    junctionScale === 1 &&\n    Object.keys(renameMap).length === 0\n  ) {\n    const { expr, count } = substitute(second.symbolic, junction.name, first.symbolic);\n    const v = count > 0 ? validate(expr) : undefined;\n    if (v !== undefined && v.ok && v.inferredDimension !== null && equals(v.inferredDimension, second.target.dim)) {\n      out.symbolic = expr;\n    }\n  }\n\n  return out;\n}\n"]}

package/dist/composition/composition-recovery.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"composition-recovery.d.ts","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAMH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,yDAAyD;AACzD,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,WAAW,sBAAuB,SAAQ,uBAAuB;IACrE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,UAAU,CAAC;CACrC;AAED,0EAA0E;AAC1E,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS,uBAAuB,EAAE,CAAC;IACnD,QAAQ,CAAC,IAAI,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAClD;AAMD;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,GAAE,SAAS,UAAU,EAAkB,GAC3C,uBAAuB,CAyCzB"}
+{"version":3,"file":"composition-recovery.d.ts","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAOH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,yDAAyD;AACzD,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,WAAW,sBAAuB,SAAQ,uBAAuB;IACrE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,UAAU,CAAC;CACrC;AAED,0EAA0E;AAC1E,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS,uBAAuB,EAAE,CAAC;IACnD,QAAQ,CAAC,IAAI,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAClD;AAMD;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,GAAE,SAAS,UAAU,EAAkB,GAC3C,uBAAuB,CAsCzB"}

package/dist/composition/composition-recovery.js

@@ -14,6 +14,7 @@
  * @module composition/composition-recovery
  * @internal
  */
+import { byKey, compareCodepoint } from '../core/compare.js';
 import { CANONICAL_EQUATIONS } from '../canonical/registry.js';
 import { normalForm } from '../canonical/normal-form.js';
 import { CATALOG_GRAPH } from './catalog-graph.js';
@@ -65,13 +66,9 @@ export function scanCompositionRecovery(edges = CATALOG_GRAPH) {
             }
         }
     }
-    pairs.sort((a, b) => (pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0));
-    hits.sort((a, b) => {
-        const byPair = pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0;
-        if (byPair !== 0)
-            return byPair;
-        return a.canonicalId < b.canonicalId ? -1 : a.canonicalId > b.canonicalId ? 1 : 0;
-    });
+    const byPair = byKey(pairKey);
+    pairs.sort(byPair);
+    hits.sort((a, b) => byPair(a, b) || compareCodepoint(a.canonicalId, b.canonicalId));
     return { pairs, hits };
 }
 //# sourceMappingURL=composition-recovery.js.map

package/dist/composition/composition-recovery.js.map

@@ -1 +1 @@
-{"version":3,"file":"composition-recovery.js","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,wBAAwB,EAAE,MAAM,uBAAuB,CAAC;AAyBlF,SAAS,OAAO,CAAC,IAA6B;IAC5C,OAAO,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAK,GAA0B,aAAa;IAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzF,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,SAAU,CAAC;KAClC,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,MAAM,IAAI,GAA6B,EAAE,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACrC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,wBAAwB;oBAAE,SAAS;gBACxD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACpC,IAAI,CAAC,IAAI,CAAC;oBACR,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,WAAW,EAAE,KAAK,CAAC,EAAE;oBACrB,cAAc,EAAE,UAAU;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAChC,OAAO,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Composition-derived recovery.\n *\n * Single-bridge linkage asks whether one bridge RHS is a canonical equation.\n * This asks the same question of a chain of two edges that both carry a\n * symbolic form. The comparison is `normalForm`: the same relation up to a\n * dimensionless factor. Dimensionful cancellation is not applied, so an\n * unsimplified chain is not rewritten into a simpler formula.\n *\n * A chain is never `restates-canonical`. That label is the F4 guard on one\n * bridge the registry already names. A chain is a derivation, and a\n * structural match is `recovers`.\n *\n * @module composition/composition-recovery\n * @internal\n */\n\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { composeSymbolic, SymbolicCompositionError } from './compose-symbolic.js';\nimport type { BridgeEdge } from './edge.js';\n\n/** One ordered pair of edges that composed. @internal */\nexport interface CompositionRecoveryPair {\n  readonly firstId: string;\n  readonly secondId: string;\n}\n\n/**\n * A chain whose normal form equals a canonical scalar AST.\n * `classification` is always `recovers`.\n * @internal\n */\nexport interface CompositionRecoveryHit extends CompositionRecoveryPair {\n  readonly canonicalId: string;\n  readonly classification: 'recovers';\n}\n\n/** The chains that were searched, and the ones that matched. @internal */\nexport interface CompositionRecoveryScan {\n  readonly pairs: readonly CompositionRecoveryPair[];\n  readonly hits: readonly CompositionRecoveryHit[];\n}\n\nfunction pairKey(pair: CompositionRecoveryPair): string {\n  return `${pair.firstId}\\0${pair.secondId}`;\n}\n\n/**\n * Search two-edge symbolic chains against the canonical registry.\n *\n * The default edge list is the catalog graph. A caller may pass a shorter\n * list; the canonical side stays the registry. Pairs that cannot compose\n * are not examined. Order is by edge id, then canonical id.\n *\n * @internal\n */\nexport function scanCompositionRecovery(\n  edges: readonly BridgeEdge[] = CATALOG_GRAPH,\n): CompositionRecoveryScan {\n  const symbolic = edges.filter((edge) => edge.symbolic !== undefined);\n  const canons = CANONICAL_EQUATIONS.filter((ce) => ce.scalarAst !== undefined).map((ce) => ({\n    id: ce.id,\n    normal: normalForm(ce.scalarAst!),\n  }));\n\n  const pairs: CompositionRecoveryPair[] = [];\n  const hits: CompositionRecoveryHit[] = [];\n\n  for (const first of symbolic) {\n    for (const second of symbolic) {\n      if (first.id === second.id) continue;\n      let expr;\n      try {\n        expr = composeSymbolic(first, second).expr;\n      } catch (error) {\n        if (error instanceof SymbolicCompositionError) continue;\n        throw error;\n      }\n      pairs.push({ firstId: first.id, secondId: second.id });\n      const form = normalForm(expr);\n      for (const canon of canons) {\n        if (form !== canon.normal) continue;\n        hits.push({\n          firstId: first.id,\n          secondId: second.id,\n          canonicalId: canon.id,\n          classification: 'recovers',\n        });\n      }\n    }\n  }\n\n  pairs.sort((a, b) => (pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0));\n  hits.sort((a, b) => {\n    const byPair = pairKey(a) < pairKey(b) ? -1 : pairKey(a) > pairKey(b) ? 1 : 0;\n    if (byPair !== 0) return byPair;\n    return a.canonicalId < b.canonicalId ? -1 : a.canonicalId > b.canonicalId ? 1 : 0;\n  });\n  return { pairs, hits };\n}\n"]}
+{"version":3,"file":"composition-recovery.js","sourceRoot":"","sources":["../../src/composition/composition-recovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,wBAAwB,EAAE,MAAM,uBAAuB,CAAC;AAyBlF,SAAS,OAAO,CAAC,IAA6B;IAC5C,OAAO,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAK,GAA0B,aAAa;IAE5C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzF,EAAE,EAAE,EAAE,CAAC,EAAE;QACT,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,SAAU,CAAC;KAClC,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAA8B,EAAE,CAAC;IAC5C,MAAM,IAAI,GAA6B,EAAE,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACrC,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,wBAAwB;oBAAE,SAAS;gBACxD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,IAAI,KAAK,KAAK,CAAC,MAAM;oBAAE,SAAS;gBACpC,IAAI,CAAC,IAAI,CAAC;oBACR,OAAO,EAAE,KAAK,CAAC,EAAE;oBACjB,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,WAAW,EAAE,KAAK,CAAC,EAAE;oBACrB,cAAc,EAAE,UAAU;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;IAC9B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IACpF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Composition-derived recovery.\n *\n * Single-bridge linkage asks whether one bridge RHS is a canonical equation.\n * This asks the same question of a chain of two edges that both carry a\n * symbolic form. The comparison is `normalForm`: the same relation up to a\n * dimensionless factor. Dimensionful cancellation is not applied, so an\n * unsimplified chain is not rewritten into a simpler formula.\n *\n * A chain is never `restates-canonical`. That label is the F4 guard on one\n * bridge the registry already names. A chain is a derivation, and a\n * structural match is `recovers`.\n *\n * @module composition/composition-recovery\n * @internal\n */\n\nimport { byKey, compareCodepoint } from '../core/compare.js';\nimport { CANONICAL_EQUATIONS } from '../canonical/registry.js';\nimport { normalForm } from '../canonical/normal-form.js';\nimport { CATALOG_GRAPH } from './catalog-graph.js';\nimport { composeSymbolic, SymbolicCompositionError } from './compose-symbolic.js';\nimport type { BridgeEdge } from './edge.js';\n\n/** One ordered pair of edges that composed. @internal */\nexport interface CompositionRecoveryPair {\n  readonly firstId: string;\n  readonly secondId: string;\n}\n\n/**\n * A chain whose normal form equals a canonical scalar AST.\n * `classification` is always `recovers`.\n * @internal\n */\nexport interface CompositionRecoveryHit extends CompositionRecoveryPair {\n  readonly canonicalId: string;\n  readonly classification: 'recovers';\n}\n\n/** The chains that were searched, and the ones that matched. @internal */\nexport interface CompositionRecoveryScan {\n  readonly pairs: readonly CompositionRecoveryPair[];\n  readonly hits: readonly CompositionRecoveryHit[];\n}\n\nfunction pairKey(pair: CompositionRecoveryPair): string {\n  return `${pair.firstId}\\0${pair.secondId}`;\n}\n\n/**\n * Search two-edge symbolic chains against the canonical registry.\n *\n * The default edge list is the catalog graph. A caller may pass a shorter\n * list; the canonical side stays the registry. Pairs that cannot compose\n * are not examined. Order is by edge id, then canonical id.\n *\n * @internal\n */\nexport function scanCompositionRecovery(\n  edges: readonly BridgeEdge[] = CATALOG_GRAPH,\n): CompositionRecoveryScan {\n  const symbolic = edges.filter((edge) => edge.symbolic !== undefined);\n  const canons = CANONICAL_EQUATIONS.filter((ce) => ce.scalarAst !== undefined).map((ce) => ({\n    id: ce.id,\n    normal: normalForm(ce.scalarAst!),\n  }));\n\n  const pairs: CompositionRecoveryPair[] = [];\n  const hits: CompositionRecoveryHit[] = [];\n\n  for (const first of symbolic) {\n    for (const second of symbolic) {\n      if (first.id === second.id) continue;\n      let expr;\n      try {\n        expr = composeSymbolic(first, second).expr;\n      } catch (error) {\n        if (error instanceof SymbolicCompositionError) continue;\n        throw error;\n      }\n      pairs.push({ firstId: first.id, secondId: second.id });\n      const form = normalForm(expr);\n      for (const canon of canons) {\n        if (form !== canon.normal) continue;\n        hits.push({\n          firstId: first.id,\n          secondId: second.id,\n          canonicalId: canon.id,\n          classification: 'recovers',\n        });\n      }\n    }\n  }\n\n  const byPair = byKey(pairKey);\n  pairs.sort(byPair);\n  hits.sort((a, b) => byPair(a, b) || compareCodepoint(a.canonicalId, b.canonicalId));\n  return { pairs, hits };\n}\n"]}

package/dist/composition/discovery.d.ts

@@ -79,6 +79,19 @@ export interface VettedCandidate {
      * value (the gate abstained — see `magnitudeChecked`).
      */
     readonly ordersApart: number | null;
+    /**
+     * The calibrated STRENGTH of the magnitude falsifier against the two values' stated
+     * uncertainties: `2·Φ(−ordersApart / √(σ_a² + σ_b²))`, with σ in decades per representative
+     * value (`sigmaDecades`, default one decade: the table's "good to about one order"; an
+     * anchor-derived value takes the default), through MathTS `normalCDF` of the negative
+     * argument so a far tail is not rounded to 0 by `1 − cdf`. It is reported BESIDE the verdict
+     * and changes no verdict: the clash threshold stays `ordersApart > maxOrders`. A small p says
+     * the two magnitudes are hard to reconcile at their stated precision; 2.9 decades at σ = 1
+     * is p ≈ 0.040, no longer a clean pass, while 3.1 decades stays a clash. NOT a credibility
+     * score: it says nothing about whether the identification is true. `null` when the gate
+     * abstained. Optional on the type; the funnel always sets it.
+     */
+    readonly magnitudeP?: number | null;
     /** Both endpoints had a representative value, so the magnitude gate ran. */
     readonly magnitudeChecked: boolean;
     /** The magnitude gate read at least one endpoint value from the graph at
@@ -247,6 +260,48 @@ export interface DiscoveryContext {
 /** Resolve options and compute the candidate-invariant discovery state once.
  *  @internal */
 export declare function buildDiscoveryContext(edges: readonly BridgeEdge[], opts: DiscoveryOptions): DiscoveryContext;
+/** One endpoint's magnitude for the gate: its value, where it came from, and its σ in decades. */
+interface GateMagnitude {
+    readonly value: number;
+    readonly fromAnchor: boolean;
+    readonly sigmaDecades: number;
+}
+/** What the magnitude gate found for one candidate. @internal */
+export interface MagnitudeGate {
+    /** The two magnitudes, when both were found (the gate ran). */
+    readonly a: GateMagnitude | undefined;
+    readonly b: GateMagnitude | undefined;
+    readonly checked: boolean;
+    readonly usedAnchor: boolean;
+    /** `|log10|a| − log10|b||`, or null when the gate abstained. */
+    readonly ordersApart: number | null;
+    /** The verdict: `ordersApart > maxOrders`. */
+    readonly clash: boolean;
+    /** The calibrated strength `2·Φ(−orders/√(σ_a² + σ_b²))`, or null when the gate abstained. */
+    readonly p: number | null;
+    /** The endpoints with no magnitude (why the gate abstained); empty when it ran. */
+    readonly missing: readonly string[];
+}
+/**
+ * The two-sided tail of a gap of `orders` decades between two values whose log10 carry
+ * standard deviations `sigmaA` and `sigmaB` decades: `2·Φ(−orders/√(σ_a² + σ_b²))`, through the
+ * NEGATIVE argument (`1 − Φ` rounds a far tail to 0; the lower tail is accurate). A strength of
+ * the falsifier, not a credibility score.
+ *
+ * @internal
+ */
+export declare function magnitudeStrength(orders: number, sigmaA: number, sigmaB: number): number;
+/**
+ * The magnitude gate: an INDEPENDENT falsifier the single-anchor graph cannot make. It runs only
+ * when both endpoints have a representative value and abstains (never false-rejects) otherwise.
+ * A value comes from the sourced static table first, else — for graph-derived quantities the
+ * table omits by design (schwarzschild-radius, thermal-de-broglie-wavelength) — from the
+ * quantity's value AT THE REGISTERED ANCHOR, a definite magnitude for this run, with the default
+ * σ of one decade. The verdict is `ordersApart > ctx.maxOrders`; `p` is reported beside it.
+ *
+ * @internal
+ */
+export declare function magnitudeGate(candidate: LinkCandidate, ctx: DiscoveryContext): MagnitudeGate;
 /**
  * Vet one link candidate by hypothesizing the identification a≡b and
  * measuring its structural and numerical consequences. See module docs.
@@ -272,4 +327,5 @@ export declare function vetInContext(edges: readonly BridgeEdge[], candidate: Li
  * @public
  */
 export declare function rankDiscoveries(edges: readonly BridgeEdge[], opts?: DiscoveryOptions): VettedCandidate[];
+export {};
 //# sourceMappingURL=discovery.d.ts.map

package/dist/composition/discovery.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AAkCD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA6BlB;AA8DD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CA+MjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}
+{"version":3,"file":"discovery.d.ts","sourceRoot":"","sources":["../../src/composition/discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAItD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAK1D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAYtE;4DAC4D;AAC5D,eAAO,MAAM,2BAA2B,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAE7E,CAAC;AA+BF,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,yDAAyD;IACzD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;;;OAMG;IACH,QAAQ,CAAC,qBAAqB,EAAE,OAAO,CAAC;IACxC;;qDAEiD;IACjD,QAAQ,CAAC,iBAAiB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;;OAIG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;IACnC;4EACwE;IACxE,QAAQ,CAAC,mBAAmB,EAAE,OAAO,CAAC;IACtC;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,wBAAwB,CAAC,EAAE,OAAO,CAAC;IAC5C;;;;OAIG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9C;;;OAGG;IACH,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAA;KAAE,EAAE,CAAC;IACpG;;;;;OAKG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,GAAG,eAAe,GAAG,iBAAiB,GAAG,YAAY,CAAC;IAC7F,4DAA4D;IAC5D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;OAIG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C;kDAC8C;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,OAAO,CAAC;CACpC;AAED,gDAAgD;AAChD,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACxD,0EAA0E;IAC1E,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;IAC7D;;;;;OAKG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC9E;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CACrE;AA4CD;;;;GAIG;AACH,eAAO,MAAM,cAAc,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAsB,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AA+BjD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,SAAS,sBAAsB,EAAE,CAAC;IACvD,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvD,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0CACsC;IACtC,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACjE,6EAA6E;IAC7E,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,qFAAqF;IACrF,QAAQ,CAAC,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,2EAA2E;IAC3E,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC1C;;;;;OAKG;IACH,QAAQ,CAAC,qBAAqB,EAAE,SAAS,MAAM,EAAE,CAAC;CACnD;AAED;gBACgB;AAChB,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE,gBAAgB,GACrB,gBAAgB,CA6BlB;AA8DD,kGAAkG;AAClG,UAAU,aAAa;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,iEAAiE;AACjE,MAAM,WAAW,aAAa;IAC5B,+DAA+D;IAC/D,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,gEAAgE;IAChE,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,8FAA8F;IAC9F,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mFAAmF;IACnF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AASD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAExF;AAED;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,aAAa,EAAE,GAAG,EAAE,gBAAgB,GAAG,aAAa,CAkC5F;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,IAAI,GAAE,gBAAqB,GAC1B,eAAe,CAEjB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,SAAS,EAAE,aAAa,EACxB,GAAG,EAAE,gBAAgB,GACpB,eAAe,CAoLjB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,GAAE,gBAAqB,GAC1B,eAAe,EAAE,CAmBnB"}