universal-physics-tensor 10.0.0 → 11.0.0

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

@@ -1 +1 @@
-{"version":3,"file":"graph-viz.js","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,wBAAwB,EAAE,MAAM,cAAc,CAAC;AAoBxD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAyB;IACpD,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAqIF,iFAAiF;AACjF,MAAM,YAAY,GAEd;IACF,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,sBAAsB;IAClF,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,uBAAuB;IAC3F,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,QAAQ;IAC5E,oBAAoB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,MAAM;IACnF,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,8BAA8B;IAC9F,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,yBAAyB;IACtF,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS;IACxE,iEAAiE;IACjE,2EAA2E;IAC3E,wEAAwE;IACxE,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,eAAe;CACnF,CAAC;AAEF;;;;4DAI4D;AAC5D,MAAM,UAAU,cAAc,CAAC,IAAgB;IAC7C,MAAM,MAAM,GAAc,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACxE,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;QACzD,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;AACJ,CAAC;AAWD,SAAS,KAAK,CACZ,IAAiB,EACjB,IAAkE;IAElE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,kBAAkB,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;YAAE,OAAO,cAAc,CAAC;IAC7D,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;YAAE,OAAO,kBAAkB,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC;QACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,cAAc,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAA4B,EAC5B,IAAkE;IAElE,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YAClE,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,KAAK,EAAE;YACL,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,CACL,WAAW,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,KAAK,SAAS;QACrE,GAAG,KAAK,CAAC,kBAAkB,4BAA4B;QACvD,GAAG,KAAK,CAAC,sBAAsB,gCAAgC,CAChE,CAAC;AACJ,CAAC;AAED,0FAA0F;AAC1F,SAAS,SAAS;IAChB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClC,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CAAC,CAAc;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,iFAAiF;AACjF,SAAS,YAAY,CAAC,SAAiC;IACrD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CACjC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,KAAK,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACxC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAc,EAAE;QAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjE,OAAO;YACL,WAAW,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,UAAU;YACV,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,+DAA+D;YAC/D,uEAAuE;YACvE,uEAAuE;YACvE,mEAAmE;YACnE,mEAAmE;YACnE,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;SAC3E,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAC9E,CAAC;IACF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,8EAA8E;AAC9E,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,CAAC,GAAG,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9D,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,EAAE,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE,CACpC,CAAC;KACE,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;KAC3B,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;KACtB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;KACvB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;KACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC3B,qDAAqD;AACrD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE,CACrC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE5E;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAyB;IAC9C,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAC1B,QAA+B,EAC/B,aAAmF;IAEnF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IACxD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,aAAa,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAC/F,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,aAAa,CACX,aAAa,UAAU,CAAC,MAAM,GAAG,EACjC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EACxC,KAAK,CACN,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAClB,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,MAAM,GAAG,GAAa,CAAC,cAAc,EAAE,MAAM,KAAK,EAAE,CAAC,CAAC;IACtD,6EAA6E;IAC7E,4EAA4E;IAC5E,sBAAsB;IACtB,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;IAE9C,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAE7C,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAEzE,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACpC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC,IAAI,CACN,cAAc,EAAE,SAAS,IAAI,WAAW,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CACzF,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IACvD,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC/E,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED,SAAS,OAAO,CACd,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAa;QACpB,sBAAsB;QACtB,2EAA2E;QAC3E,uEAAuE;QACvE,YAAY,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,MAAM,EAAE,CAAC,IAAI;QAC1E,eAAe;QACf,gCAAgC;KACjC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,0BAA0B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,IAAI,CACN,OAAO,GAAG,sBAAsB,KAAK,gBAAgB,IAAI,YAAY,MAAM,YAAY,QAAQ,CAC7F,CAAC,CAAC,KAAK,CACR,KAAK,CACP,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,IAAI,GAAe,EAAE;IAErB,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,CAAC,CAAc,EAAe,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC;QACJ,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAC7B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,MAAM,GAAG,GAAkB;QACzB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;KAC9C,CAAC;IACF,mEAAmE;IACnE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,QAAQ,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM;gBACT,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAmB;QAClC,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,kBAAkB;QAClB,sBAAsB;QACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC;IACF,MAAM,YAAY,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACrD,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,iBAAiB,CAAC;IAE9C,OAAO;QACL,SAAS;QACT,QAAQ;QACR,WAAW;QACX,YAAY;QACZ,SAAS,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;QACjE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Physics-map visualization — turn the composition hypergraph into Mermaid and\n * Graphviz-DOT **source text**.\n *\n * The graph is bipartite in the drawing: round nodes are *quantities*\n * (`mass`, `temperature`, …) and box nodes are *equations* — laws, bridges, or\n * proposed relations — each an n-ary junction (its source quantities point in,\n * its target points out). This makes \"equations as junctions\" literal and draws\n * n-ary edges faithfully (a single Mermaid/DOT edge can only connect two nodes).\n *\n * The model computes its own connected components over the junctions — so a\n * `--proposed` overlay participates in the clustering — and groups each component\n * into its own subgraph so the genuinely disjointed map stays legible. For the\n * pure-`BridgeEdge` case the component count matches the authoritative\n * {@link linkageMap} (pinned by a drift-guard test).\n *\n * Pure string production: no file I/O (the CLI is the only file-touching layer).\n *\n * @module composition/graph-viz\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { QUANTITY_IDENTIFICATIONS } from './compose.js';\nimport type { EvidenceTag, RelationType } from '../relations/types.js';\n\n/**\n * Epistemic status of a junction — drives node colour/shape. Bridges carry\n * their catalog confidence; `law` is a diagonal/established-physics edge;\n * `proposed` is a machine-derived, unadjudicated relation (rendered quarantined).\n *\n * @public\n */\nexport type VizStatus =\n  | 'law'\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative'\n  | 'proposed'\n  | 'user'\n  | 'poster'\n  | 'association';\n\n/**\n * Every `VizStatus`, as VALUES.\n *\n * Exists so the union can be pinned at RUNTIME. `VizStatus` is a type: the\n * public-surface test pins its NAME and nothing pins its MEMBERS, so widening\n * it is invisible to every existing test. This array is what the three places\n * a status must be registered are checked against — `STATUS_STYLE` (a compile\n * error when incomplete), `STATUSES_IN_ORDER` (a plain array that would\n * SILENTLY omit a Mermaid `classDef`), and the published surface.\n *\n * @internal\n */\nexport const ALL_VIZ_STATUSES: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * A normalized equation junction: n source quantities → 1 target. The render\n * model's unit of \"equation\", decoupled from both `BridgeEdge` and the internal\n * `ProposedBridge` type (the CLI converts each into this shape).\n *\n * @public\n */\nexport interface VizJunction {\n  /** Graph id, e.g. `'be-42'` or `'IC-…'`. */\n  readonly id: string;\n  /** Short human label. */\n  readonly label: string;\n  readonly status: VizStatus;\n  /** Source quantity names. */\n  readonly sources: readonly string[];\n  /** Target quantity name. */\n  readonly target: string;\n  /**\n   * The Atlas Phase 1 relation TYPE this junction's edge records, when one was\n   * recorded. Absent means \"nobody has audited this edge\", which is a\n   * different statement from \"this edge is not an approximation\" — the\n   * filtering in {@link buildVizModel} keeps the two apart and counts them\n   * separately.\n   */\n  readonly relation?: RelationType;\n  /**\n   * The catalog id this junction's edge cross-references, when it has one.\n   * Carried so evidence can be DERIVED at read time; no evidence tag is ever\n   * stored on a junction.\n   */\n  readonly beId?: number | null;\n}\n\n/**\n * Why junctions were left out of a filtered map.\n *\n * The two dropped counts are SEPARATE on purpose. An edge dropped for not\n * matching the filter answered the question; an edge dropped for carrying no\n * overlay never got asked. Folding them together would let an unaudited graph\n * render as a complete answer to a question nobody could put to it.\n *\n * @public\n */\nexport interface VizFilterStats {\n  /** Junctions considered, before filtering. */\n  readonly total: number;\n  /** Junctions rendered. */\n  readonly kept: number;\n  /** Dropped because their recorded metadata did not match the filter. */\n  readonly droppedNotMatching: number;\n  /** Dropped because they carry no metadata the filter could read. */\n  readonly droppedMissingMetadata: number;\n  /** The `relation` filter in force, if any. */\n  readonly relation?: RelationType;\n  /** The `evidence` filter in force, if any. */\n  readonly evidence?: EvidenceTag;\n}\n\n/**\n * One connected component of the bipartite graph.\n *\n * @public\n */\nexport interface VizCluster {\n  /** Junction ids in this component. */\n  readonly junctionIds: readonly string[];\n  /** Distinct (canonical) quantity names touched by this component. */\n  readonly quantities: readonly string[];\n  /** Number of junctions (the cluster \"size\", matching `linkageMap`). */\n  readonly size: number;\n  /** Contains a `law`/`established` junction (anchored to known physics). */\n  readonly anchored: boolean;\n}\n\n/**\n * Options for {@link buildVizModel}.\n *\n * @public\n */\nexport interface VizOptions {\n  /** Diagram title (used as the graph label). */\n  readonly title?: string;\n  /** Already-normalized extra junctions to overlay (e.g. proposed relations). */\n  readonly extraJunctions?: readonly VizJunction[];\n  /**\n   * Keep only junctions whose recorded relation is this type.\n   *\n   * ⚠ Setting ANY filter changes what a missing overlay MEANS. Unfiltered, an\n   * edge with no `relation` is kept — the map is about connectivity and an\n   * unaudited edge still connects. Filtered, it is dropped, because it cannot\n   * be shown to satisfy the filter. The count of those drops is reported\n   * separately in {@link VizFilterStats} and printed in the legend.\n   */\n  readonly relation?: RelationType;\n  /**\n   * Keep only junctions whose DERIVED evidence set contains this tag.\n   *\n   * Evidence is never stored. It is derived from the catalog row named by the\n   * junction's `beId`, every time it is asked for; a junction with no numeric\n   * `beId` cannot be evaluated and counts as LACKING metadata, not as\n   * non-matching.\n   */\n  readonly evidence?: EvidenceTag;\n  /**\n   * The derivation used when `evidence` is set. The catalog derivation lives\n   * with the CLI (`cli/map-evidence.ts`), which passes it. This module does\n   * not import that derivation. A junction with a numeric `beId` and no\n   * function here cannot be evaluated, and the filter throws rather than\n   * rendering an unfiltered map as a filtered one. A junction with no numeric\n   * `beId` is lacking metadata and does not call the function.\n   */\n  readonly deriveEvidence?: (beId: number) => ReadonlySet<EvidenceTag>;\n}\n\n/**\n * The render model: normalized junctions, their connected components, and the\n * two serializers.\n *\n * @public\n */\nexport interface VizModel {\n  readonly junctions: readonly VizJunction[];\n  readonly clusters: readonly VizCluster[];\n  /** What filtering did. Present even when no filter was set (all kept). */\n  readonly filterStats: VizFilterStats;\n  /** One-line legend describing the filter, or `null` when none is in force. */\n  readonly filterLegend: string | null;\n  toMermaid(): string;\n  toDot(): string;\n}\n\n/** Fill colour + dashed flag per status. Tweak here to restyle the whole map. */\nconst STATUS_STYLE: Readonly<\n  Record<VizStatus, { readonly fill: string; readonly stroke: string; readonly dashed: boolean }>\n> = {\n  law: { fill: '#cfe3f7', stroke: '#3a6ea5', dashed: false }, // textbook law — blue\n  established: { fill: '#cde7d3', stroke: '#3f8f5b', dashed: false }, // solid bridge — green\n  speculative: { fill: '#fdebc8', stroke: '#c9881b', dashed: false }, // amber\n  'highly-speculative': { fill: '#f5c6c6', stroke: '#c0392b', dashed: false }, // red\n  proposed: { fill: '#e6e6e6', stroke: '#888888', dashed: true }, // unadjudicated — grey dashed\n  user: { fill: '#e9d8fd', stroke: '#6b46c1', dashed: false }, // user-supplied — violet\n  // Poster index (Atlas Phase 3). A derivation is a SOLID box: it is a stated\n  // claim with a recorded relation, not an unadjudicated guess like `proposed`.\n  poster: { fill: '#dbe7ff', stroke: '#4c6ef5', dashed: false }, // indigo\n  // An association is DASHED because it asserts no relation at all\n  // (`atlas/association.ts`): the dash is the only thing in the drawing that\n  // says \"this line is a resemblance, not a claim\". Do not make it solid.\n  association: { fill: '#f3f0e7', stroke: '#8d7b4f', dashed: true }, // khaki dashed\n};\n\n/** Map a `BridgeEdge` to a `VizJunction` (raw quantity names).\n *\n * The display label is the compact catalog id (`BE-<n>`) when the edge is\n * catalog-backed, else the edge's own label — a *map* reads better with short\n * junction names; the full formula stays in the catalog. */\nexport function edgeToJunction(edge: BridgeEdge): VizJunction {\n  const status: VizStatus = edge.kind === 'law' ? 'law' : edge.confidence;\n  return {\n    id: edge.id,\n    label: edge.beId != null ? `BE-${edge.beId}` : edge.label,\n    status,\n    sources: edge.sources.map((s) => s.name),\n    target: edge.target.name,\n    ...(edge.relation ? { relation: edge.relation.type } : {}),\n    beId: edge.beId,\n  };\n}\n\n/** How one junction fared against the filters. */\ntype FilterVerdict = 'keep' | 'not-matching' | 'missing-metadata';\n\n/** The overlay a filter reads off a junction or an edge. */\ninterface OverlayView {\n  readonly relation?: RelationType;\n  readonly beId?: number | null;\n}\n\nfunction judge(\n  item: OverlayView,\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): FilterVerdict {\n  if (opts.relation !== undefined) {\n    if (item.relation === undefined) return 'missing-metadata';\n    if (item.relation !== opts.relation) return 'not-matching';\n  }\n  if (opts.evidence !== undefined) {\n    if (item.beId == null) return 'missing-metadata';\n    const derive = opts.deriveEvidence;\n    if (derive === undefined) {\n      throw new Error(\n        'evidence filter has no deriveEvidence function; catalog derivation is not in this module',\n      );\n    }\n    if (!derive(item.beId).has(opts.evidence)) return 'not-matching';\n  }\n  return 'keep';\n}\n\n/**\n * Apply the same filters `buildVizModel` applies, to a raw edge list — so the\n * TEXT map and the visual map can never disagree about what a filter selects.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function filterEdges(\n  edges: readonly BridgeEdge[],\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): { readonly kept: BridgeEdge[]; readonly stats: VizFilterStats } {\n  const kept: BridgeEdge[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const e of edges) {\n    switch (judge({ relation: e.relation?.type, beId: e.beId }, opts)) {\n      case 'keep':\n        kept.push(e);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  return {\n    kept,\n    stats: {\n      total: edges.length,\n      kept: kept.length,\n      droppedNotMatching,\n      droppedMissingMetadata,\n      ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n      ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n    },\n  };\n}\n\n/**\n * The legend line. It always states the lacking-metadata count, including when\n * it is zero: a printed `0` says the graph was checked and nothing was hidden,\n * whereas an omitted line says nothing at all.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function formatFilterLegend(stats: VizFilterStats): string | null {\n  const terms: string[] = [];\n  if (stats.relation !== undefined) terms.push(`relation=${stats.relation}`);\n  if (stats.evidence !== undefined) terms.push(`evidence=${stats.evidence}`);\n  if (terms.length === 0) return null;\n  return (\n    `filter: ${terms.join(' ')} — ${stats.kept} of ${stats.total} kept; ` +\n    `${stats.droppedNotMatching} dropped (did not match); ` +\n    `${stats.droppedMissingMetadata} dropped (no overlay metadata)`\n  );\n}\n\n/** Quantity-name canonicalizer from `QUANTITY_IDENTIFICATIONS` (matches `linkageMap`). */\nfunction makeCanon(): (name: string) => string {\n  const alias = new Map(QUANTITY_IDENTIFICATIONS.map((id) => [id.from, id.to]));\n  return (n) => alias.get(n) ?? n;\n}\n\n/** Distinct canonical quantity names of a junction (sources ∪ target). */\nfunction quantitiesOf(j: VizJunction): string[] {\n  return [...new Set([...j.sources, j.target])];\n}\n\n/** Union-find component grouping of junctions sharing a (canonical) quantity. */\nfunction componentsOf(junctions: readonly VizJunction[]): VizCluster[] {\n  const parent = junctions.map((_, i) => i);\n  const find = (x: number): number =>\n    parent[x] === x ? x : (parent[x] = find(parent[x]));\n  const union = (a: number, b: number): void => {\n    parent[find(a)] = find(b);\n  };\n\n  const qToJunctions = new Map<string, number[]>();\n  junctions.forEach((j, i) => {\n    for (const qty of quantitiesOf(j)) {\n      const arr = qToJunctions.get(qty) ?? [];\n      arr.push(i);\n      qToJunctions.set(qty, arr);\n    }\n  });\n  for (const idxs of qToJunctions.values()) {\n    for (let k = 1; k < idxs.length; k++) union(idxs[0], idxs[k]);\n  }\n\n  const groups = new Map<number, number[]>();\n  junctions.forEach((_, i) => {\n    const r = find(i);\n    const arr = groups.get(r) ?? [];\n    arr.push(i);\n    groups.set(r, arr);\n  });\n\n  const clusters = [...groups.values()].map((idxs): VizCluster => {\n    const js = idxs.map((i) => junctions[i]);\n    const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();\n    return {\n      junctionIds: js.map((j) => j.id),\n      quantities,\n      size: js.length,\n      // DELIBERATE: only `law` and `established` anchor. A `poster`,\n      // `association`, `proposed` or `user` junction never does — the poster\n      // index maps claims and their supports, it does not assert that any of\n      // them is textbook physics. Widening this would make an unanchored\n      // cluster read as anchored the moment a poster overlay touched it.\n      anchored: js.some((j) => j.status === 'law' || j.status === 'established'),\n    };\n  });\n  // Deterministic: largest first, then by first junction id.\n  clusters.sort(\n    (a, b) => b.size - a.size || a.junctionIds[0].localeCompare(b.junctionIds[0]),\n  );\n  return clusters;\n}\n\n/** A stable, collision-free id factory mapping arbitrary keys to safe ids. */\nfunction idFactory(prefix: string): (key: string) => string {\n  const seen = new Map<string, string>();\n  const used = new Set<string>();\n  return (key) => {\n    const cached = seen.get(key);\n    if (cached) return cached;\n    const base = `${prefix}_${key.replace(/[^A-Za-z0-9]/g, '_')}`;\n    let id = base;\n    let n = 1;\n    while (used.has(id)) id = `${base}_${n++}`;\n    used.add(id);\n    seen.set(key, id);\n    return id;\n  };\n}\n\n/** Escape a label for Mermaid `[\"…\"]` — XML-entity-encode the characters that\n *  break the quoted form or are read as entities (`&`, `\"`, `<`, `>`). */\nconst mmLabel = (s: string): string =>\n  s\n    .replace(/\\r\\n|\\r|\\n/g, ' ')\n    .replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;');\n/** Escape a label for a DOT double-quoted string. */\nconst dotLabel = (s: string): string =>\n  s.replace(/\\r\\n|\\r|\\n/g, ' ').replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n\n/**\n * Mermaid `classDef` emission order.\n *\n * ⚠ A plain array, so a status MISSING here does not fail to compile — it\n * silently omits that status's `classDef` and the node renders unstyled. That\n * is why `ALL_VIZ_STATUSES` exists and why a test compares the two sets.\n */\nconst STATUSES_IN_ORDER: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * Drive a format-specific cluster renderer over the standard layout, identical\n * for both emitters: multi-junction components first (each its own subgraph,\n * keyed `0`,`1`,…, labelled `anchored cluster (n)` / `cluster (n)`), then a\n * single `iso` subgraph collecting all singletons. The callback owns all\n * per-format string production; this owns only the traversal and labelling.\n */\nfunction forEachClusterGroup(\n  clusters: readonly VizCluster[],\n  renderCluster: (label: string, junctionIds: readonly string[], key: string) => void,\n): void {\n  const multi = clusters.filter((c) => c.size > 1);\n  const singletons = clusters.filter((c) => c.size === 1);\n  multi.forEach((c, i) =>\n    renderCluster(`${c.anchored ? 'anchored ' : ''}cluster (${c.size})`, c.junctionIds, String(i)),\n  );\n  if (singletons.length) {\n    renderCluster(\n      `isolated (${singletons.length})`,\n      singletons.flatMap((c) => c.junctionIds),\n      'iso',\n    );\n  }\n}\n\nfunction emitMermaid(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const usedStatuses = new Set<VizStatus>();\n  const out: string[] = [`flowchart LR`, `%% ${title}`];\n  // The legend is a comment AND a rendered node: a comment alone disappears in\n  // every renderer, and a filtered map that does not say it is filtered reads\n  // as the whole graph.\n  if (legend !== null) out.push(`%% ${legend}`);\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cl_${key}[\"${mmLabel(label)}\"]`);\n    out.push(`    direction LR`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id}([\"${mmLabel(name)}\"]):::qty`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      usedStatuses.add(j.status);\n      const jId = jid(j.id);\n      out.push(`    ${jId}[\"${mmLabel(j.label)}\"]:::${j.status}`);\n      for (const s of j.sources) out.push(`    ${declareQ(s)} --> ${jId}`);\n      out.push(`    ${jId} --> ${declareQ(j.target)}`);\n    }\n    out.push(`  end`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n\n  if (legend !== null) out.push(`  legend[\"${mmLabel(legend)}\"]:::legend`);\n\n  for (const st of STATUSES_IN_ORDER) {\n    if (!usedStatuses.has(st)) continue;\n    const { fill, stroke, dashed } = STATUS_STYLE[st];\n    out.push(\n      `  classDef ${st} fill:${fill},stroke:${stroke}${dashed ? ',stroke-dasharray:4 3' : ''}`,\n    );\n  }\n  out.push(`  classDef qty fill:#ffffff,stroke:#999999`);\n  if (legend !== null) out.push(`  classDef legend fill:#ffffff,stroke:#333333`);\n  return out.join('\\n') + '\\n';\n}\n\nfunction emitDot(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const out: string[] = [\n    `digraph PhysicsMap {`,\n    // DOT's label is a single quoted string and `dotLabel` collapses newlines,\n    // so the legend joins the title on one line rather than being dropped.\n    `  label=\"${dotLabel(legend === null ? title : `${title} — ${legend}`)}\";`,\n    `  rankdir=LR;`,\n    `  node [fontname=\"Helvetica\"];`,\n  ];\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cluster_${key} {`);\n    out.push(`    label=\"${dotLabel(label)}\";`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id} [shape=ellipse,label=\"${dotLabel(name)}\"];`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      const jId = jid(j.id);\n      const { fill, stroke, dashed } = STATUS_STYLE[j.status];\n      const style = dashed ? 'filled,dashed' : 'filled';\n      out.push(\n        `    ${jId} [shape=box,style=\"${style}\",fillcolor=\"${fill}\",color=\"${stroke}\",label=\"${dotLabel(\n          j.label,\n        )}\"];`,\n      );\n      for (const s of j.sources) out.push(`    ${declareQ(s)} -> ${jId};`);\n      out.push(`    ${jId} -> ${declareQ(j.target)};`);\n    }\n    out.push(`  }`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n  out.push(`}`);\n  return out.join('\\n') + '\\n';\n}\n\n/**\n * Build the bipartite, clustered render model from a graph (+ optional overlay).\n * Quantity names are canonicalized via `QUANTITY_IDENTIFICATIONS` so the\n * clustering matches the authoritative {@link linkageMap}.\n *\n * @public\n */\nexport function buildVizModel(\n  edges: readonly BridgeEdge[],\n  opts: VizOptions = {},\n): VizModel {\n  const canon = makeCanon();\n  const normalize = (j: VizJunction): VizJunction => ({\n    ...j,\n    sources: j.sources.map(canon),\n    target: canon(j.target),\n  });\n  const all: VizJunction[] = [\n    ...edges.map((e) => normalize(edgeToJunction(e))),\n    ...(opts.extraJunctions ?? []).map(normalize),\n  ];\n  // Filtering is applied to the OVERLAY junctions too. A proposed or\n  // user-supplied junction carries no relation and no beId, so a filtered map\n  // drops it as lacking metadata — the same rule as any other edge, and the\n  // count says so out loud rather than letting the overlay vanish quietly.\n  const junctions: VizJunction[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const j of all) {\n    switch (judge(j, opts)) {\n      case 'keep':\n        junctions.push(j);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  const filterStats: VizFilterStats = {\n    total: all.length,\n    kept: junctions.length,\n    droppedNotMatching,\n    droppedMissingMetadata,\n    ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n    ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n  };\n  const filterLegend = formatFilterLegend(filterStats);\n  // A duplicate junction id (e.g. a proposed overlay colliding with an edge id)\n  // would silently drop one from the rendered output — make it a loud error.\n  const byId = new Map<string, VizJunction>();\n  for (const j of junctions) {\n    if (byId.has(j.id)) {\n      throw new Error(`buildVizModel: duplicate junction id '${j.id}'`);\n    }\n    byId.set(j.id, j);\n  }\n  const clusters = componentsOf(junctions);\n  const title = opts.title ?? 'UPT physics map';\n\n  return {\n    junctions,\n    clusters,\n    filterStats,\n    filterLegend,\n    toMermaid: () => emitMermaid(clusters, byId, title, filterLegend),\n    toDot: () => emitDot(clusters, byId, title, filterLegend),\n  };\n}\n"]}
+{"version":3,"file":"graph-viz.js","sourceRoot":"","sources":["../../src/composition/graph-viz.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAoBpF;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAyB;IACpD,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAqIF,iFAAiF;AACjF,MAAM,YAAY,GAEd;IACF,GAAG,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,sBAAsB;IAClF,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,uBAAuB;IAC3F,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,QAAQ;IAC5E,oBAAoB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,MAAM;IACnF,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,8BAA8B;IAC9F,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,yBAAyB;IACtF,4EAA4E;IAC5E,8EAA8E;IAC9E,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS;IACxE,iEAAiE;IACjE,2EAA2E;IAC3E,wEAAwE;IACxE,WAAW,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,eAAe;CACnF,CAAC;AAEF;;;;4DAI4D;AAC5D,MAAM,UAAU,cAAc,CAAC,IAAgB;IAC7C,MAAM,MAAM,GAAc,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACxE,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;QACzD,MAAM;QACN,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACxC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;QACxB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;AACJ,CAAC;AAWD,SAAS,KAAK,CACZ,IAAiB,EACjB,IAAkE;IAElE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,kBAAkB,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;YAAE,OAAO,cAAc,CAAC;IAC7D,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI;YAAE,OAAO,kBAAkB,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC;QACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,cAAc,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAA4B,EAC5B,IAAkE;IAElE,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;YAClE,KAAK,MAAM;gBACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO;QACL,IAAI;QACJ,KAAK,EAAE;YACL,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE;KACF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO,CACL,WAAW,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,KAAK,SAAS;QACrE,GAAG,KAAK,CAAC,kBAAkB,4BAA4B;QACvD,GAAG,KAAK,CAAC,sBAAsB,gCAAgC,CAChE,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CAAC,CAAc;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,SAAiC;IACrD,OAAO,mBAAmB,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAc,EAAE;QACtF,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjE,OAAO;YACL,WAAW,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,UAAU;YACV,IAAI,EAAE,EAAE,CAAC,MAAM;YACf,+DAA+D;YAC/D,uEAAuE;YACvE,uEAAuE;YACvE,mEAAmE;YACnE,mEAAmE;YACnE,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC;SAC3E,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,CAAC,GAAG,EAAE,EAAE;QACb,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,EAAE,CAAC;QAC9D,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,EAAE,GAAG,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;AACJ,CAAC;AAED;0EAC0E;AAC1E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAU,EAAE,CACpC,CAAC;KACE,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;KAC3B,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;KACtB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;KACvB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;KACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC3B,qDAAqD;AACrD,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE,CACrC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE5E;;;;;;GAMG;AACH,MAAM,iBAAiB,GAAyB;IAC9C,KAAK;IACL,aAAa;IACb,aAAa;IACb,oBAAoB;IACpB,UAAU;IACV,MAAM;IACN,QAAQ;IACR,aAAa;CACd,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAC1B,QAA+B,EAC/B,aAAmF;IAEnF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;IACxD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,aAAa,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAC/F,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,aAAa,CACX,aAAa,UAAU,CAAC,MAAM,GAAG,EACjC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EACxC,KAAK,CACN,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAClB,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAa,CAAC;IAC1C,MAAM,GAAG,GAAa,CAAC,cAAc,EAAE,MAAM,KAAK,EAAE,CAAC,CAAC;IACtD,6EAA6E;IAC7E,4EAA4E;IAC5E,sBAAsB;IACtB,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;IAE9C,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,iBAAiB,GAAG,KAAK,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAClD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,QAAQ,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAE7C,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAEzE,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QACpC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC,IAAI,CACN,cAAc,EAAE,SAAS,IAAI,WAAW,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CACzF,CAAC;IACJ,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IACvD,IAAI,MAAM,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC/E,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED,SAAS,OAAO,CACd,QAA+B,EAC/B,IAAsC,EACtC,KAAa,EACb,MAAqB;IAErB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAa;QACpB,sBAAsB;QACtB,2EAA2E;QAC3E,uEAAuE;QACvE,YAAY,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,MAAM,MAAM,EAAE,CAAC,IAAI;QAC1E,eAAe;QACf,gCAAgC;KACjC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,WAA8B,EAAE,GAAW,EAAQ,EAAE;QACzF,GAAG,CAAC,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;YACxC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,0BAA0B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC;YAClD,GAAG,CAAC,IAAI,CACN,OAAO,GAAG,sBAAsB,KAAK,gBAAgB,IAAI,YAAY,MAAM,YAAY,QAAQ,CAC7F,CAAC,CAAC,KAAK,CACR,KAAK,CACP,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,QAAQ,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;YACrE,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,mBAAmB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA4B,EAC5B,IAAI,GAAe,EAAE;IAErB,MAAM,KAAK,GAAG,qBAAqB,EAAE,CAAC;IACtC,MAAM,SAAS,GAAG,CAAC,CAAc,EAAe,EAAE,CAAC,CAAC;QAClD,GAAG,CAAC;QACJ,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAC7B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,MAAM,GAAG,GAAkB;QACzB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;KAC9C,CAAC;IACF,mEAAmE;IACnE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,MAAM,SAAS,GAAkB,EAAE,CAAC;IACpC,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,QAAQ,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM;gBACT,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM;YACR,KAAK,cAAc;gBACjB,kBAAkB,IAAI,CAAC,CAAC;gBACxB,MAAM;YACR,KAAK,kBAAkB;gBACrB,sBAAsB,IAAI,CAAC,CAAC;gBAC5B,MAAM;QACV,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAmB;QAClC,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,IAAI,EAAE,SAAS,CAAC,MAAM;QACtB,kBAAkB;QAClB,sBAAsB;QACtB,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC;IACF,MAAM,YAAY,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IACrD,8EAA8E;IAC9E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,iBAAiB,CAAC;IAE9C,OAAO;QACL,SAAS;QACT,QAAQ;QACR,WAAW;QACX,YAAY;QACZ,SAAS,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;QACjE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC;KAC1D,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Physics-map visualization — turn the composition hypergraph into Mermaid and\n * Graphviz-DOT **source text**.\n *\n * The graph is bipartite in the drawing: round nodes are *quantities*\n * (`mass`, `temperature`, …) and box nodes are *equations* — laws, bridges, or\n * proposed relations — each an n-ary junction (its source quantities point in,\n * its target points out). This makes \"equations as junctions\" literal and draws\n * n-ary edges faithfully (a single Mermaid/DOT edge can only connect two nodes).\n *\n * The model computes its own connected components over the junctions — so a\n * `--proposed` overlay participates in the clustering — and groups each component\n * into its own subgraph so the genuinely disjointed map stays legible. For the\n * pure-`BridgeEdge` case the component count matches the authoritative\n * {@link linkageMap} (pinned by a drift-guard test).\n *\n * Pure string production: no file I/O (the CLI is the only file-touching layer).\n *\n * @module composition/graph-viz\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { clusterBySharedKeys, quantityCanonicalizer } from './quantity-clusters.js';\nimport type { EvidenceTag, RelationType } from '../relations/types.js';\n\n/**\n * Epistemic status of a junction — drives node colour/shape. Bridges carry\n * their catalog confidence; `law` is a diagonal/established-physics edge;\n * `proposed` is a machine-derived, unadjudicated relation (rendered quarantined).\n *\n * @public\n */\nexport type VizStatus =\n  | 'law'\n  | 'established'\n  | 'speculative'\n  | 'highly-speculative'\n  | 'proposed'\n  | 'user'\n  | 'poster'\n  | 'association';\n\n/**\n * Every `VizStatus`, as VALUES.\n *\n * Exists so the union can be pinned at RUNTIME. `VizStatus` is a type: the\n * public-surface test pins its NAME and nothing pins its MEMBERS, so widening\n * it is invisible to every existing test. This array is what the three places\n * a status must be registered are checked against — `STATUS_STYLE` (a compile\n * error when incomplete), `STATUSES_IN_ORDER` (a plain array that would\n * SILENTLY omit a Mermaid `classDef`), and the published surface.\n *\n * @internal\n */\nexport const ALL_VIZ_STATUSES: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * A normalized equation junction: n source quantities → 1 target. The render\n * model's unit of \"equation\", decoupled from both `BridgeEdge` and the internal\n * `ProposedBridge` type (the CLI converts each into this shape).\n *\n * @public\n */\nexport interface VizJunction {\n  /** Graph id, e.g. `'be-42'` or `'IC-…'`. */\n  readonly id: string;\n  /** Short human label. */\n  readonly label: string;\n  readonly status: VizStatus;\n  /** Source quantity names. */\n  readonly sources: readonly string[];\n  /** Target quantity name. */\n  readonly target: string;\n  /**\n   * The Atlas Phase 1 relation TYPE this junction's edge records, when one was\n   * recorded. Absent means \"nobody has audited this edge\", which is a\n   * different statement from \"this edge is not an approximation\" — the\n   * filtering in {@link buildVizModel} keeps the two apart and counts them\n   * separately.\n   */\n  readonly relation?: RelationType;\n  /**\n   * The catalog id this junction's edge cross-references, when it has one.\n   * Carried so evidence can be DERIVED at read time; no evidence tag is ever\n   * stored on a junction.\n   */\n  readonly beId?: number | null;\n}\n\n/**\n * Why junctions were left out of a filtered map.\n *\n * The two dropped counts are SEPARATE on purpose. An edge dropped for not\n * matching the filter answered the question; an edge dropped for carrying no\n * overlay never got asked. Folding them together would let an unaudited graph\n * render as a complete answer to a question nobody could put to it.\n *\n * @public\n */\nexport interface VizFilterStats {\n  /** Junctions considered, before filtering. */\n  readonly total: number;\n  /** Junctions rendered. */\n  readonly kept: number;\n  /** Dropped because their recorded metadata did not match the filter. */\n  readonly droppedNotMatching: number;\n  /** Dropped because they carry no metadata the filter could read. */\n  readonly droppedMissingMetadata: number;\n  /** The `relation` filter in force, if any. */\n  readonly relation?: RelationType;\n  /** The `evidence` filter in force, if any. */\n  readonly evidence?: EvidenceTag;\n}\n\n/**\n * One connected component of the bipartite graph.\n *\n * @public\n */\nexport interface VizCluster {\n  /** Junction ids in this component. */\n  readonly junctionIds: readonly string[];\n  /** Distinct (canonical) quantity names touched by this component. */\n  readonly quantities: readonly string[];\n  /** Number of junctions (the cluster \"size\", matching `linkageMap`). */\n  readonly size: number;\n  /** Contains a `law`/`established` junction (anchored to known physics). */\n  readonly anchored: boolean;\n}\n\n/**\n * Options for {@link buildVizModel}.\n *\n * @public\n */\nexport interface VizOptions {\n  /** Diagram title (used as the graph label). */\n  readonly title?: string;\n  /** Already-normalized extra junctions to overlay (e.g. proposed relations). */\n  readonly extraJunctions?: readonly VizJunction[];\n  /**\n   * Keep only junctions whose recorded relation is this type.\n   *\n   * ⚠ Setting ANY filter changes what a missing overlay MEANS. Unfiltered, an\n   * edge with no `relation` is kept — the map is about connectivity and an\n   * unaudited edge still connects. Filtered, it is dropped, because it cannot\n   * be shown to satisfy the filter. The count of those drops is reported\n   * separately in {@link VizFilterStats} and printed in the legend.\n   */\n  readonly relation?: RelationType;\n  /**\n   * Keep only junctions whose DERIVED evidence set contains this tag.\n   *\n   * Evidence is never stored. It is derived from the catalog row named by the\n   * junction's `beId`, every time it is asked for; a junction with no numeric\n   * `beId` cannot be evaluated and counts as LACKING metadata, not as\n   * non-matching.\n   */\n  readonly evidence?: EvidenceTag;\n  /**\n   * The derivation used when `evidence` is set. The catalog derivation lives\n   * with the CLI (`cli/map-evidence.ts`), which passes it. This module does\n   * not import that derivation. A junction with a numeric `beId` and no\n   * function here cannot be evaluated, and the filter throws rather than\n   * rendering an unfiltered map as a filtered one. A junction with no numeric\n   * `beId` is lacking metadata and does not call the function.\n   */\n  readonly deriveEvidence?: (beId: number) => ReadonlySet<EvidenceTag>;\n}\n\n/**\n * The render model: normalized junctions, their connected components, and the\n * two serializers.\n *\n * @public\n */\nexport interface VizModel {\n  readonly junctions: readonly VizJunction[];\n  readonly clusters: readonly VizCluster[];\n  /** What filtering did. Present even when no filter was set (all kept). */\n  readonly filterStats: VizFilterStats;\n  /** One-line legend describing the filter, or `null` when none is in force. */\n  readonly filterLegend: string | null;\n  toMermaid(): string;\n  toDot(): string;\n}\n\n/** Fill colour + dashed flag per status. Tweak here to restyle the whole map. */\nconst STATUS_STYLE: Readonly<\n  Record<VizStatus, { readonly fill: string; readonly stroke: string; readonly dashed: boolean }>\n> = {\n  law: { fill: '#cfe3f7', stroke: '#3a6ea5', dashed: false }, // textbook law — blue\n  established: { fill: '#cde7d3', stroke: '#3f8f5b', dashed: false }, // solid bridge — green\n  speculative: { fill: '#fdebc8', stroke: '#c9881b', dashed: false }, // amber\n  'highly-speculative': { fill: '#f5c6c6', stroke: '#c0392b', dashed: false }, // red\n  proposed: { fill: '#e6e6e6', stroke: '#888888', dashed: true }, // unadjudicated — grey dashed\n  user: { fill: '#e9d8fd', stroke: '#6b46c1', dashed: false }, // user-supplied — violet\n  // Poster index (Atlas Phase 3). A derivation is a SOLID box: it is a stated\n  // claim with a recorded relation, not an unadjudicated guess like `proposed`.\n  poster: { fill: '#dbe7ff', stroke: '#4c6ef5', dashed: false }, // indigo\n  // An association is DASHED because it asserts no relation at all\n  // (`atlas/association.ts`): the dash is the only thing in the drawing that\n  // says \"this line is a resemblance, not a claim\". Do not make it solid.\n  association: { fill: '#f3f0e7', stroke: '#8d7b4f', dashed: true }, // khaki dashed\n};\n\n/** Map a `BridgeEdge` to a `VizJunction` (raw quantity names).\n *\n * The display label is the compact catalog id (`BE-<n>`) when the edge is\n * catalog-backed, else the edge's own label — a *map* reads better with short\n * junction names; the full formula stays in the catalog. */\nexport function edgeToJunction(edge: BridgeEdge): VizJunction {\n  const status: VizStatus = edge.kind === 'law' ? 'law' : edge.confidence;\n  return {\n    id: edge.id,\n    label: edge.beId != null ? `BE-${edge.beId}` : edge.label,\n    status,\n    sources: edge.sources.map((s) => s.name),\n    target: edge.target.name,\n    ...(edge.relation ? { relation: edge.relation.type } : {}),\n    beId: edge.beId,\n  };\n}\n\n/** How one junction fared against the filters. */\ntype FilterVerdict = 'keep' | 'not-matching' | 'missing-metadata';\n\n/** The overlay a filter reads off a junction or an edge. */\ninterface OverlayView {\n  readonly relation?: RelationType;\n  readonly beId?: number | null;\n}\n\nfunction judge(\n  item: OverlayView,\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): FilterVerdict {\n  if (opts.relation !== undefined) {\n    if (item.relation === undefined) return 'missing-metadata';\n    if (item.relation !== opts.relation) return 'not-matching';\n  }\n  if (opts.evidence !== undefined) {\n    if (item.beId == null) return 'missing-metadata';\n    const derive = opts.deriveEvidence;\n    if (derive === undefined) {\n      throw new Error(\n        'evidence filter has no deriveEvidence function; catalog derivation is not in this module',\n      );\n    }\n    if (!derive(item.beId).has(opts.evidence)) return 'not-matching';\n  }\n  return 'keep';\n}\n\n/**\n * Apply the same filters `buildVizModel` applies, to a raw edge list — so the\n * TEXT map and the visual map can never disagree about what a filter selects.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function filterEdges(\n  edges: readonly BridgeEdge[],\n  opts: Pick<VizOptions, 'relation' | 'evidence' | 'deriveEvidence'>,\n): { readonly kept: BridgeEdge[]; readonly stats: VizFilterStats } {\n  const kept: BridgeEdge[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const e of edges) {\n    switch (judge({ relation: e.relation?.type, beId: e.beId }, opts)) {\n      case 'keep':\n        kept.push(e);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  return {\n    kept,\n    stats: {\n      total: edges.length,\n      kept: kept.length,\n      droppedNotMatching,\n      droppedMissingMetadata,\n      ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n      ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n    },\n  };\n}\n\n/**\n * The legend line. It always states the lacking-metadata count, including when\n * it is zero: a printed `0` says the graph was checked and nothing was hidden,\n * whereas an omitted line says nothing at all.\n *\n * @internal — CLI support, reached through `src/cli-api.ts`.\n */\nexport function formatFilterLegend(stats: VizFilterStats): string | null {\n  const terms: string[] = [];\n  if (stats.relation !== undefined) terms.push(`relation=${stats.relation}`);\n  if (stats.evidence !== undefined) terms.push(`evidence=${stats.evidence}`);\n  if (terms.length === 0) return null;\n  return (\n    `filter: ${terms.join(' ')} — ${stats.kept} of ${stats.total} kept; ` +\n    `${stats.droppedNotMatching} dropped (did not match); ` +\n    `${stats.droppedMissingMetadata} dropped (no overlay metadata)`\n  );\n}\n\n/** Distinct canonical quantity names of a junction (sources ∪ target). */\nfunction quantitiesOf(j: VizJunction): string[] {\n  return [...new Set([...j.sources, j.target])];\n}\n\n/**\n * Component grouping of junctions sharing a (canonical) quantity: the shared partition of\n * `quantity-clusters.ts`, in the order the map always drew (largest first, then by first\n * junction id; input order inside). The anchoring rule below is this module's own.\n */\nfunction componentsOf(junctions: readonly VizJunction[]): VizCluster[] {\n  return clusterBySharedKeys(junctions, quantitiesOf, (j) => j.id).map((js): VizCluster => {\n    const quantities = [...new Set(js.flatMap(quantitiesOf))].sort();\n    return {\n      junctionIds: js.map((j) => j.id),\n      quantities,\n      size: js.length,\n      // DELIBERATE: only `law` and `established` anchor. A `poster`,\n      // `association`, `proposed` or `user` junction never does — the poster\n      // index maps claims and their supports, it does not assert that any of\n      // them is textbook physics. Widening this would make an unanchored\n      // cluster read as anchored the moment a poster overlay touched it.\n      anchored: js.some((j) => j.status === 'law' || j.status === 'established'),\n    };\n  });\n}\n\n/** A stable, collision-free id factory mapping arbitrary keys to safe ids. */\nfunction idFactory(prefix: string): (key: string) => string {\n  const seen = new Map<string, string>();\n  const used = new Set<string>();\n  return (key) => {\n    const cached = seen.get(key);\n    if (cached) return cached;\n    const base = `${prefix}_${key.replace(/[^A-Za-z0-9]/g, '_')}`;\n    let id = base;\n    let n = 1;\n    while (used.has(id)) id = `${base}_${n++}`;\n    used.add(id);\n    seen.set(key, id);\n    return id;\n  };\n}\n\n/** Escape a label for Mermaid `[\"…\"]` — XML-entity-encode the characters that\n *  break the quoted form or are read as entities (`&`, `\"`, `<`, `>`). */\nconst mmLabel = (s: string): string =>\n  s\n    .replace(/\\r\\n|\\r|\\n/g, ' ')\n    .replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;');\n/** Escape a label for a DOT double-quoted string. */\nconst dotLabel = (s: string): string =>\n  s.replace(/\\r\\n|\\r|\\n/g, ' ').replace(/\\\\/g, '\\\\\\\\').replace(/\"/g, '\\\\\"');\n\n/**\n * Mermaid `classDef` emission order.\n *\n * ⚠ A plain array, so a status MISSING here does not fail to compile — it\n * silently omits that status's `classDef` and the node renders unstyled. That\n * is why `ALL_VIZ_STATUSES` exists and why a test compares the two sets.\n */\nconst STATUSES_IN_ORDER: readonly VizStatus[] = [\n  'law',\n  'established',\n  'speculative',\n  'highly-speculative',\n  'proposed',\n  'user',\n  'poster',\n  'association',\n];\n\n/**\n * Drive a format-specific cluster renderer over the standard layout, identical\n * for both emitters: multi-junction components first (each its own subgraph,\n * keyed `0`,`1`,…, labelled `anchored cluster (n)` / `cluster (n)`), then a\n * single `iso` subgraph collecting all singletons. The callback owns all\n * per-format string production; this owns only the traversal and labelling.\n */\nfunction forEachClusterGroup(\n  clusters: readonly VizCluster[],\n  renderCluster: (label: string, junctionIds: readonly string[], key: string) => void,\n): void {\n  const multi = clusters.filter((c) => c.size > 1);\n  const singletons = clusters.filter((c) => c.size === 1);\n  multi.forEach((c, i) =>\n    renderCluster(`${c.anchored ? 'anchored ' : ''}cluster (${c.size})`, c.junctionIds, String(i)),\n  );\n  if (singletons.length) {\n    renderCluster(\n      `isolated (${singletons.length})`,\n      singletons.flatMap((c) => c.junctionIds),\n      'iso',\n    );\n  }\n}\n\nfunction emitMermaid(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const usedStatuses = new Set<VizStatus>();\n  const out: string[] = [`flowchart LR`, `%% ${title}`];\n  // The legend is a comment AND a rendered node: a comment alone disappears in\n  // every renderer, and a filtered map that does not say it is filtered reads\n  // as the whole graph.\n  if (legend !== null) out.push(`%% ${legend}`);\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cl_${key}[\"${mmLabel(label)}\"]`);\n    out.push(`    direction LR`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id}([\"${mmLabel(name)}\"]):::qty`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      usedStatuses.add(j.status);\n      const jId = jid(j.id);\n      out.push(`    ${jId}[\"${mmLabel(j.label)}\"]:::${j.status}`);\n      for (const s of j.sources) out.push(`    ${declareQ(s)} --> ${jId}`);\n      out.push(`    ${jId} --> ${declareQ(j.target)}`);\n    }\n    out.push(`  end`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n\n  if (legend !== null) out.push(`  legend[\"${mmLabel(legend)}\"]:::legend`);\n\n  for (const st of STATUSES_IN_ORDER) {\n    if (!usedStatuses.has(st)) continue;\n    const { fill, stroke, dashed } = STATUS_STYLE[st];\n    out.push(\n      `  classDef ${st} fill:${fill},stroke:${stroke}${dashed ? ',stroke-dasharray:4 3' : ''}`,\n    );\n  }\n  out.push(`  classDef qty fill:#ffffff,stroke:#999999`);\n  if (legend !== null) out.push(`  classDef legend fill:#ffffff,stroke:#333333`);\n  return out.join('\\n') + '\\n';\n}\n\nfunction emitDot(\n  clusters: readonly VizCluster[],\n  byId: ReadonlyMap<string, VizJunction>,\n  title: string,\n  legend: string | null,\n): string {\n  const qid = idFactory('q');\n  const jid = idFactory('j');\n  const out: string[] = [\n    `digraph PhysicsMap {`,\n    // DOT's label is a single quoted string and `dotLabel` collapses newlines,\n    // so the legend joins the title on one line rather than being dropped.\n    `  label=\"${dotLabel(legend === null ? title : `${title} — ${legend}`)}\";`,\n    `  rankdir=LR;`,\n    `  node [fontname=\"Helvetica\"];`,\n  ];\n\n  const renderCluster = (label: string, junctionIds: readonly string[], key: string): void => {\n    out.push(`  subgraph cluster_${key} {`);\n    out.push(`    label=\"${dotLabel(label)}\";`);\n    const declared = new Set<string>();\n    const declareQ = (name: string): string => {\n      const id = qid(name);\n      if (!declared.has(id)) {\n        out.push(`    ${id} [shape=ellipse,label=\"${dotLabel(name)}\"];`);\n        declared.add(id);\n      }\n      return id;\n    };\n    for (const id of junctionIds) {\n      const j = byId.get(id)!;\n      const jId = jid(j.id);\n      const { fill, stroke, dashed } = STATUS_STYLE[j.status];\n      const style = dashed ? 'filled,dashed' : 'filled';\n      out.push(\n        `    ${jId} [shape=box,style=\"${style}\",fillcolor=\"${fill}\",color=\"${stroke}\",label=\"${dotLabel(\n          j.label,\n        )}\"];`,\n      );\n      for (const s of j.sources) out.push(`    ${declareQ(s)} -> ${jId};`);\n      out.push(`    ${jId} -> ${declareQ(j.target)};`);\n    }\n    out.push(`  }`);\n  };\n\n  forEachClusterGroup(clusters, renderCluster);\n  out.push(`}`);\n  return out.join('\\n') + '\\n';\n}\n\n/**\n * Build the bipartite, clustered render model from a graph (+ optional overlay).\n * Quantity names are canonicalized via `QUANTITY_IDENTIFICATIONS` so the\n * clustering matches the authoritative {@link linkageMap}.\n *\n * @public\n */\nexport function buildVizModel(\n  edges: readonly BridgeEdge[],\n  opts: VizOptions = {},\n): VizModel {\n  const canon = quantityCanonicalizer();\n  const normalize = (j: VizJunction): VizJunction => ({\n    ...j,\n    sources: j.sources.map(canon),\n    target: canon(j.target),\n  });\n  const all: VizJunction[] = [\n    ...edges.map((e) => normalize(edgeToJunction(e))),\n    ...(opts.extraJunctions ?? []).map(normalize),\n  ];\n  // Filtering is applied to the OVERLAY junctions too. A proposed or\n  // user-supplied junction carries no relation and no beId, so a filtered map\n  // drops it as lacking metadata — the same rule as any other edge, and the\n  // count says so out loud rather than letting the overlay vanish quietly.\n  const junctions: VizJunction[] = [];\n  let droppedNotMatching = 0;\n  let droppedMissingMetadata = 0;\n  for (const j of all) {\n    switch (judge(j, opts)) {\n      case 'keep':\n        junctions.push(j);\n        break;\n      case 'not-matching':\n        droppedNotMatching += 1;\n        break;\n      case 'missing-metadata':\n        droppedMissingMetadata += 1;\n        break;\n    }\n  }\n  const filterStats: VizFilterStats = {\n    total: all.length,\n    kept: junctions.length,\n    droppedNotMatching,\n    droppedMissingMetadata,\n    ...(opts.relation !== undefined ? { relation: opts.relation } : {}),\n    ...(opts.evidence !== undefined ? { evidence: opts.evidence } : {}),\n  };\n  const filterLegend = formatFilterLegend(filterStats);\n  // A duplicate junction id (e.g. a proposed overlay colliding with an edge id)\n  // would silently drop one from the rendered output — make it a loud error.\n  const byId = new Map<string, VizJunction>();\n  for (const j of junctions) {\n    if (byId.has(j.id)) {\n      throw new Error(`buildVizModel: duplicate junction id '${j.id}'`);\n    }\n    byId.set(j.id, j);\n  }\n  const clusters = componentsOf(junctions);\n  const title = opts.title ?? 'UPT physics map';\n\n  return {\n    junctions,\n    clusters,\n    filterStats,\n    filterLegend,\n    toMermaid: () => emitMermaid(clusters, byId, title, filterLegend),\n    toDot: () => emitDot(clusters, byId, title, filterLegend),\n  };\n}\n"]}

package/dist/composition/identifiability.d.ts

@@ -21,12 +21,28 @@
  * resulting nonlinear system has a unique numeric solution (undecidable
  * in general for closed-form evaluators). "Independent derivation" means
  * a structurally distinct edge, NOT a provably-independent formula — two
- * edges encoding the same relation are counted as two (an honest
- * over-count). The classifier PROPOSES; humans filter (Part-VI §XXVII-B),
- * exactly as `enumerateCompositions` does.
+ * edges encoding the same relation are counted as two by the forward
+ * count (an honest over-count, kept as `surplusConstraints`). The
+ * classifier PROPOSES; humans filter (Part-VI §XXVII-B), exactly as
+ * `enumerateCompositions` does.
+ *
+ * TWO INSTRUMENTS, TWO FIELDS. The forward closure fires an edge only when
+ * every source is known, so it never reads a law in reverse. The MONOMIAL
+ * edges (a `symbolic` product of powers, or a canonical equation with a
+ * stated monomial) are also a linear system in log space: `y = C Π xᵢ^aᵢ`
+ * is the row `log y − Σ aᵢ log xᵢ = log C`. Stacked with a unit row per
+ * known quantity, the exact null space (MathTS `rationalNullspace`) says
+ * which quantities are DETERMINED (their column is zero in every basis
+ * vector) whichever way the laws are read, and `distinct rows − rank` is
+ * the number of independent consistency checks, where a restated monomial
+ * is one row, not two. {@link identifiabilityByRank} is that instrument;
+ * {@link classifyIdentifiability} reports both, `determinable` being their
+ * union, and names every law the rank read in reverse, because a validity
+ * domain is stated on the sources and a caller may refuse the inversion.
  *
  * @module composition/identifiability
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
 import type { BridgeEdge } from './edge.js';
 import type { QuantityIdentification } from './compose.js';
 /** The four-way structural-identifiability verdict. @public */
@@ -42,6 +58,34 @@ export interface IdentifiabilityOptions {
      */
     readonly identifications?: readonly QuantityIdentification[];
 }
+/**
+ * What the log-space rank says about one known set, over the monomial edges
+ * of the graph. See the module docs: this is the second instrument beside
+ * the forward closure, and its numbers are not the closure's.
+ *
+ * @public
+ */
+export interface RankIdentifiability {
+    /** Every quantity whose column is zero in every null-space basis vector, sorted. */
+    readonly determined: readonly string[];
+    /** The quantities the rank determines that the forward closure does not, sorted. */
+    readonly determinedByRankOnly: readonly string[];
+    /**
+     * Independent consistency checks the system carries: distinct rows
+     * (a restated monomial is one row) minus the rank. Zero when every row
+     * is needed to determine what it determines.
+     */
+    readonly surplusChecks: number;
+    /**
+     * Ids of the monomial edges the rank read against their direction: a
+     * source of the edge is determined, and not by the forward closure over
+     * the monomial edges. A caller whose validity domain is stated on the
+     * sources may refuse these.
+     */
+    readonly usedInReverse: readonly string[];
+    /** Ids of the edges that contributed a row (a readable monomial, target not among its sources). */
+    readonly monomialEdges: readonly string[];
+}
 /** The result of classifying one target against one known set. @public */
 export interface IdentifiabilityResult {
     /** The target quantity name that was classified. */
@@ -70,8 +114,14 @@ export interface IdentifiabilityResult {
      * moves the target toward determined. Empty when determinable.
      */
     readonly blockingFrontier: readonly string[];
-    /** Every quantity determinable from the known set (the forward closure). */
+    /**
+     * Every quantity determinable from the known set: the forward closure
+     * united with what the log-space rank determines through the monomial
+     * edges (`rank.determined`), sorted.
+     */
     readonly determinable: readonly string[];
+    /** The rank instrument's own report for this known set. */
+    readonly rank: RankIdentifiability;
 }
 /**
  * The monotone forward closure: the least set ⊇ `knownNames` closed under
@@ -84,6 +134,43 @@ export interface IdentifiabilityResult {
  * @public
  */
 export declare function forwardClosure(edges: readonly BridgeEdge[], knownNames: readonly string[], identifications?: readonly QuantityIdentification[]): Set<string>;
+/**
+ * The exact exponents of an edge's monomial over its SOURCE names, or
+ * undefined when it is not one. Internal: a `Fraction` is not a root type.
+ * @internal
+ */
+export type EdgeMonomialReader = (edge: BridgeEdge) => ReadonlyMap<string, Fraction> | undefined;
+/**
+ * The exact exponents of `edge`'s target over its source names, read from
+ * its `symbolic` form, or, for a canonical edge with no symbolic form, from
+ * the equation's stated monomial and `formulaFactors`. A leaf that is not a
+ * source (a constant, a literal, a held stub) is part of the prefactor and
+ * contributes no column. Undefined when the form is not a monomial, when an
+ * exponent is not a small rational, or when the target is among the sources.
+ *
+ * @internal
+ */
+export declare function edgeMonomial(edge: BridgeEdge): ReadonlyMap<string, Fraction> | undefined;
+/**
+ * {@link identifiabilityByRank} with the monomial reader chosen by the
+ * caller (the default is {@link edgeMonomial}). A custom reader's index and
+ * results are cached beside the default's, never in its place.
+ *
+ * @internal
+ */
+export declare function identifiabilityByRankWith(edges: readonly BridgeEdge[], knownNames: readonly string[], reader: EdgeMonomialReader, opts?: IdentifiabilityOptions): RankIdentifiability;
+/**
+ * The log-space rank: which quantities the monomial edges determine from
+ * `knownNames`, whichever direction each law is read, how many independent
+ * consistency checks the system carries, and which laws were read in
+ * reverse. Identifications stay directed, as in {@link forwardClosure}: a
+ * name they reach joins the known rows, and the system is solved again
+ * until nothing new is determined. Non-monomial edges contribute nothing
+ * here; the forward closure is their instrument.
+ *
+ * @public
+ */
+export declare function identifiabilityByRank(edges: readonly BridgeEdge[], knownNames: readonly string[], opts?: IdentifiabilityOptions): RankIdentifiability;
 /**
  * Classify the structural identifiability of `targetName` given
  * `knownNames` over `edges`. See the module docs and

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

@@ -1 +1 @@
-{"version":3,"file":"identifiability.d.ts","sourceRoot":"","sources":["../../src/composition/identifiability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,+DAA+D;AAC/D,MAAM,MAAM,sBAAsB,GAC9B,OAAO,GACP,kBAAkB,GAClB,oBAAoB,GACpB,iBAAiB,CAAC;AAEtB,0CAA0C;AAC1C,MAAM,WAAW,sBAAsB;IACrC;;;;;;OAMG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAED,0EAA0E;AAC1E,MAAM,WAAW,qBAAqB;IACpC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,4EAA4E;IAC5E,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1C;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,eAAe,GAAE,SAAS,sBAAsB,EAA6B,GAC5E,GAAG,CAAC,MAAM,CAAC,CAoBb;AAyBD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,UAAU,EAAE,MAAM,EAClB,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,CAyDvB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,EAAE,CAKzB"}
+{"version":3,"file":"identifiability.d.ts","sourceRoot":"","sources":["../../src/composition/identifiability.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAM3D,+DAA+D;AAC/D,MAAM,MAAM,sBAAsB,GAC9B,OAAO,GACP,kBAAkB,GAClB,oBAAoB,GACpB,iBAAiB,CAAC;AAEtB,0CAA0C;AAC1C,MAAM,WAAW,sBAAsB;IACrC;;;;;;OAMG;IACH,QAAQ,CAAC,eAAe,CAAC,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC9D;AAED;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,oFAAoF;IACpF,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC,oFAAoF;IACpF,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;IACjD;;;;OAIG;IACH,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;;;;;OAKG;IACH,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IAC1C,mGAAmG;IACnG,QAAQ,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;CAC3C;AAED,0EAA0E;AAC1E,MAAM,WAAW,qBAAqB;IACpC,oDAAoD;IACpD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;;;OAKG;IACH,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACpC;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C;;;;OAIG;IACH,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,EAAE,mBAAmB,CAAC;CACpC;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,eAAe,GAAE,SAAS,sBAAsB,EAA6B,GAC5E,GAAG,CAAC,MAAM,CAAC,CAoBb;AAMD;;;;GAIG;AACH,MAAM,MAAM,kBAAkB,GAAG,CAAC,IAAI,EAAE,UAAU,KAAK,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAAC;AAEjG;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAsBxF;AA4OD;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,MAAM,EAAE,kBAAkB,EAC1B,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAErB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,mBAAmB,CAErB;AAsFD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,UAAU,EAAE,MAAM,EAClB,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,CAmFvB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,IAAI,GAAE,sBAA2B,GAChC,qBAAqB,EAAE,CAKzB"}