universal-physics-tensor 10.0.0 → 12.0.0

package/dist/core/tensor.js.map

@@ -1 +1 @@
-{"version":3,"file":"tensor.js","sourceRoot":"","sources":["../../src/core/tensor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAkBH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAErE,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAY/E;;;;;;;;;;;;;;;GAeG;AACH,SAAS,wBAAwB,CAAC,CAAiB;IACjD,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,aAAa,EAAE,OAAO,IAAI,CAAC;QAChC,KAAK,aAAa,EAAE,OAAO,GAAG,CAAC;QAC/B,KAAK,oBAAoB,EAAE,OAAO,GAAG,CAAC;QACtC,SAAS,CAAC;YACR,MAAM,WAAW,GAAU,CAAC,CAAC;YAC7B,KAAK,WAAW,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAW,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,IAAa;IAC9B,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAChC,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QACrD,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjE,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,IAAgB;IACpC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QACrD,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,WAAW,EAAE,IAAI,CAAC,WAAW;KAC9B,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,IAAmB;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW;QAClC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,OAAO,IAAI,CAAC,WAAW,EAAE;QAC3C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IAClB,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,WAAW;QACX,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;KACtD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,eAAe;IACT,MAAM,CAAyB;IAC/B,SAAS,CAA2B;IACpC,eAAe,CAA8B;IAC7C,iBAAiB,CAAkC;IAEpE;;;;;OAKG;IACc,UAAU,CAA2B;IAEtD;;;;;;;;;OASG;IACc,SAAS,CAA0B;IAEpD,YAAY,MAAoB;QAC9B,sEAAsE;QACtE,oEAAoE;QACpE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,UAAU,CAAC,gDAAgD,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACtF,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;QACvE,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,MAAM,GAAG;YACZ,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;gBAC3D,CAAC,CAAC,MAAM,CAAC,UAAU;gBACnB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC;YACzB,mBAAmB,EAAE,MAAM,CAAC,mBAAmB,IAAI,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC;gBACtF,CAAC,CAAC,MAAM,CAAC,mBAAmB;gBAC5B,CAAC,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC;YAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,IAAI;SAC9B,CAAC;QAEF,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,cAAc,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,GAAgB;QAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,IAAI,GAAG,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,UAAU,CAAC,gDAAgD,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAClF,IAAI,CAAC,sBAAsB,CACzB,GAAG,CAAC,mBAAmB,EACvB,qBAAqB,EACrB,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAChC,CAAC;QACF,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAC9D,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,QAAQ,EAAE,CAAC;YACb,4EAA4E;YAC5E,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACpC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACpC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAEhC,+DAA+D;QAC/D,+EAA+E;QAC/E,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBACpD,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,MAAsB;QACrC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QAC7C,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,IAAI,CAAC,IAAI,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,UAAU,CAAC,mDAAmD,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;QAC/F,CAAC;QACD,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAClB,2EAA2E,MAAM,CAAC,EAAE,EAAE;gBACpF,CAAC,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,CAAC,CACpD,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAE5C,oEAAoE;QACpE,8DAA8D;QAC9D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5E,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,EAAU,EAAE,IAAY;QACzC,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,SAAS,CAAC,GAAG,IAAI,gCAAgC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAC5B,MAAgC,EAChC,QAAgB,EAChB,QAAsB;QAEtB,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,UAAU,CAClB,GAAG,QAAQ,WAAW,CAAC,qCAAqC,QAAQ,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAChG,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,0BAA0B,CAChC,MAAqC,EACrC,QAAgB;QAEhB,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChD,MAAM,IAAI,UAAU,CAClB,GAAG,QAAQ,wCAAwC,CAAC,EAAE,CACvD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,MAAqB,EAAE,MAAqB;QAChE,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAChF,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,GAAW,EAAE,UAAkB;QAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,GAAW,EAAE,UAAkB;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,UAA8B;QAChD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,oBAAoB,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,UAAU,CAClB,qFAAqF,UAAU,CAAC,KAAK,EAAE,CACxG,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,UAAU,CAClB,uDAAuD,UAAU,CAAC,UAAU,EAAE,CAC/E,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;gBAC3C,IAAI,GAAG;oBAAE,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAEtD,yEAAyE;QACzE,oEAAoE;QACpE,8CAA8C;QAC9C,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,GAAG;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACI,OAAO,CAAC,IAAU;QACvB,gEAAgE;QAChE,iEAAiE;QACjE,kEAAkE;QAClE,sEAAsE;QACtE,oEAAoE;QACpE,oEAAoE;QACpE,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,UAAmB,CAAC;QACxB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK;gBACR,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1C,MAAM;YACR,KAAK,QAAQ;gBACX,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChD,MAAM;YACR,KAAK,WAAW;gBACd,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBACtD,MAAM;YACR,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;gBACjB,MAAM,IAAI,KAAK,CACb,+CAAgD,IAAa,CAAC,IAAI,EAAE,CACrE,CAAC;YACJ,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,+DAA+D;QAC/D,6DAA6D;QAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;YACvE,IAAI,OAAO,EAAE,CAAC;gBACZ,0DAA0D;gBAC1D,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAClC,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,gFAAgF;IACxE,aAAa,CAAC,IAAU;QAC9B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YAC9D,CAAC;YACD,KAAK,QAAQ,EAAE,CAAC;gBACd,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;YACvE,CAAC;YACD,KAAK,WAAW,EAAE,CAAC;gBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvD,OAAO,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;YAClF,CAAC;YACD,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;gBACjB,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACK,YAAY,CAAC,IAAU,EAAE,QAAmC;QAClE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,OAAO;gBACjB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;oBAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;wBAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;oBACxE,CAAC;gBACH,CAAC;gBACD,IAAI,QAAQ,EAAE,IAAI,KAAK,KAAK;oBAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxD,OAAO;YACT,CAAC;YACD,KAAK,QAAQ,EAAE,CAAC;gBACd,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,CAAC,MAAM;oBAAE,OAAO;gBACpB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/E,IAAI,QAAQ,EAAE,IAAI,KAAK,QAAQ;oBAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACjE,OAAO;YACT,CAAC;YACD,KAAK,WAAW,EAAE,CAAC;gBACjB,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/C,IAAI,CAAC,EAAE;oBAAE,OAAO;gBAChB,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvC,KAAK,MAAM,OAAO,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;oBACjC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;oBAC3C,IAAI,GAAG;wBAAE,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,QAAQ,EAAE,IAAI,KAAK,WAAW;oBAAE,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAC3E,OAAO;YACT,CAAC;YACD,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,4EAA4E;IAE5E;;;;;;;;;;;OAWG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED;;;;;;;;;;;OAWG;IACI,cAAc;QACnB,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;QACrF,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACI,wBAAwB;QAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEhD,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvD,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,GAAG,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAClE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACI,eAAe;QACpB,MAAM,WAAW,GAAqB,EAAE,CAAC;QACzC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9C,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;YACxC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC;YAChC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;YACpC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC;QAChC,CAAC;QACD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;IAC9D,CAAC;IAED,4EAA4E;IAC5E,2BAA2B;IAC3B,4EAA4E;IAE5E;;;;;;;OAOG;IACK,cAAc,CAAC,GAAW;QAChC,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,uCAAuC;QAC9E,IAAI,GAAG,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAA6B,EAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,SAAS;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACpC,QAAQ,IAAI,EAAE,CAAC;gBACb,KAAK,OAAO;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACvC,KAAK,OAAO;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACvC,KAAK,KAAK;oBAAE,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACxC,KAAK,MAAM;oBAAE,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAC5C,KAAK,KAAK;oBAAE,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;YACnD,CAAC;QACH,CAAC;QACD,OAAO,GAAoB,CAAC;IAC9B,CAAC;IAED;;;;;;;;OAQG;IACK,CAAC,kBAAkB,CAAC,KAAoB;QAC9C,MAAM,IAAI,GAGL;YACH,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC5C,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC5C,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE;YACnD,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE;SAChE,CAAC;QAEF,KAAK,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,SAAS;YACvC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACjC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,OAAsB;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,qBAAqB,CAAC,MAAqB,EAAE,MAAqB;QACvE,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,OAAsB;QACrC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACvC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,MAAqB,EAAE,MAAqB;QAC7D,MAAM,OAAO,GAAqB,EAAE,CAAC;QAErC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACnD,IACE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;gBACxC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACxC,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,UAAU;QACf,OAAO,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACI,YAAY;QACjB,OAAO,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,6EAA6E;QAC7E,6EAA6E;QAC7E,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;YAAE,YAAY,IAAI,IAAI,CAAC,IAAI,CAAC;QACvE,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YACtB,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;YAC9B,eAAe,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI;YAC1C,iBAAiB,EAAE,IAAI,CAAC,iBAAiB,CAAC,IAAI;YAC9C,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACnC,YAAY;YACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,OAAsB;QAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1E,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QACjF,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QAC5E,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE3E,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAgB,EAAE,KAAoB;QAC5D,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,mBAAmB,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;gBACrF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,CAAgB,EAAE,CAAgB;QACrD,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,OAAO,CACrB,IAA4B,EAC5B,OAAkC,EAClC,UAAwC,EACxC,MAAoB;IAEpB,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5C,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACrD,KAAK,MAAM,SAAS,IAAI,UAAU;QAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["/**\n * Universal Physics Tensor\n *\n * Core implementation of the rank-N tensor living in product space:\n * Π ∈ H_scale ⊗ H_force ⊗ H_symmetry ⊗ H_info ⊗ H_dim ⊗ H_topo\n *\n * Decomposition: Π = L + B + E\n * Where:\n * - L: Known laws (diagonal elements)\n * - B: Bridge equations (off-diagonal elements)\n * - E: Emergent phenomena (higher-order correlations)\n */\n\nimport type {\n  TensorConfig,\n  TensorIndices,\n  PhysicalLaw,\n  BridgeEquation,\n  EmergentPhenomenon,\n  PhysicalScale,\n  Force,\n} from './types.js';\nimport type {\n  Cell,\n  CellConfidence,\n  LawCell,\n  BridgeCell,\n  EmergenceCell,\n} from './cell.js';\nimport { lawToCell, bridgeToCell, emergenceToCell } from './cell.js';\nimport type { FluxRule, FluxReport, FluxDiagnostic } from './flux-rules.js';\nimport { runRules, V07_CELL_RULES, FluxViolationError } from './flux-rules.js';\n\n/**\n * The entry an `addCell` call is about to replace, held so a flux-rule\n * failure can put it back (fail-atomic on a replacement, not only on a\n * fresh id).\n */\ntype PreviousEntry =\n  | { readonly kind: 'law'; readonly law: PhysicalLaw }\n  | { readonly kind: 'bridge'; readonly bridge: BridgeEquation }\n  | { readonly kind: 'emergence'; readonly phenomenon: EmergentPhenomenon };\n\n/**\n * Map the string-vocabulary {@link CellConfidence} to a representative\n * numeric value in [0,1] for the legacy `addLaw` / `addBridge` /\n * `addEmergence` path (each validates `confidence >= 0 && <= 1`).\n *\n * Internal-only — consumers see the string vocabulary on `Cell`. The\n * numeric value is a storage detail, not a public-API contract. Per\n * Adam+Eve Eve-R3, this is the REVERSE direction of the (rejected)\n * `confidenceToStatus` adapter: that one was rejected because it\n * could overwrite curated catalog `status` fields with derived labels.\n * This one is safe because the caller has already declared their\n * string intent; the function just picks a representative number for\n * the legacy path's range check.\n *\n * @internal\n */\nfunction statusToConfidenceNumber(c: CellConfidence): number {\n  switch (c) {\n    case 'established': return 0.95;\n    case 'speculative': return 0.6;\n    case 'highly-speculative': return 0.3;\n    default: {\n      const _exhaustive: never = c;\n      void _exhaustive;\n      throw new Error(`Unknown CellConfidence: ${c as string}`);\n    }\n  }\n}\n\n/**\n * Adapter: `LawCell` → `PhysicalLaw` (legacy shape). Internal-only.\n * @internal\n */\nfunction cellToLaw(cell: LawCell): PhysicalLaw {\n  return {\n    id: cell.id,\n    name: cell.name,\n    equation: cell.equation,\n    scales: [...cell.scales],\n    forces: [...cell.forces],\n    symmetries: [...cell.symmetries],\n    confidence: statusToConfidenceNumber(cell.confidence),\n    ...(cell.informationMeasures ? { informationMeasures: [...cell.informationMeasures] } : {}),\n    ...(cell.dimensions ? { dimensions: [...cell.dimensions] } : {}),\n    ...(cell.topologies ? { topologies: [...cell.topologies] } : {}),\n    ...(cell.references ? { references: [...cell.references] } : {}),\n  };\n}\n\n/**\n * Adapter: `BridgeCell` → `BridgeEquation` (legacy shape). Internal-only.\n * @internal\n */\nfunction cellToBridge(cell: BridgeCell): BridgeEquation {\n  return {\n    id: cell.id,\n    name: cell.name,\n    source: cell.source,\n    target: cell.target,\n    equation: cell.equation,\n    confidence: statusToConfidenceNumber(cell.confidence),\n    validated: cell.validated,\n    description: cell.description,\n  };\n}\n\n/**\n * Adapter: `EmergenceCell` → `EmergentPhenomenon` (legacy shape).\n * Maps `cell.equation` to `EmergentPhenomenon.description` (the legacy\n * interface uses `description` for the mathematical content); a\n * separate `cell.description` (prose context) is appended if present.\n * @internal\n */\nfunction cellToEmergence(cell: EmergenceCell): EmergentPhenomenon {\n  const description = cell.description\n    ? `${cell.equation}\\n\\n${cell.description}`\n    : cell.equation;\n  return {\n    id: cell.id,\n    name: cell.name,\n    order: cell.order,\n    indices: [...cell.indices],\n    description,\n    confidence: statusToConfidenceNumber(cell.confidence),\n  };\n}\n\n/**\n * The rank-6 universal physics tensor Π = L + B + E: a sparse store of\n * physical-law / bridge / emergence cells indexed by regime coordinates.\n *\n * @public\n */\nexport class UniversalTensor {\n  private readonly config: Required<TensorConfig>;\n  private readonly knownLaws: Map<string, PhysicalLaw>;\n  private readonly bridgeEquations: Map<string, BridgeEquation>;\n  private readonly emergentPhenomena: Map<string, EmergentPhenomenon>;\n\n  /**\n   * Sparse tensor storage: only store non-zero elements.\n   * Key: serialized tensor indices\n   * Value: set of equation IDs occupying that cell (multiple laws/bridges\n   * may coexist in a single tensor cell without overwriting each other).\n   */\n  private readonly tensorData: Map<string, Set<string>>;\n\n  /**\n   * v0.7-p2 Phase 2 Task 2.3: Rule set used by `addCell` (ERROR-tier\n   * violations throw) and by `fluxDiagnostics()` (re-runs across all\n   * populated cells). Default = `V07_CELL_RULES` (Rule 2 + Rule 3\n   * from `flux-rules.ts`). Rule 1 (dimensional consistency) fires\n   * from the catalog adapter (Phase 3), not from `addCell`.\n   *\n   * Per Decision #9, this field is `@internal`. No public mutator\n   * is exposed in v0.7 (rule customization is a v0.8+ concern).\n   */\n  private readonly fluxRules: ReadonlyArray<FluxRule>;\n\n  constructor(config: TensorConfig) {\n    // Runtime validation (strict TS catches these at compile time, but JS\n    // consumers bypass the type system — we validate defensively here).\n    if (![3, 4, 5, 6].includes(config.rank)) {\n      throw new RangeError(`TensorConfig.rank must be 3, 4, 5, or 6; got ${config.rank}`);\n    }\n    if (!Array.isArray(config.scales) || config.scales.length === 0) {\n      throw new TypeError('TensorConfig.scales must be a non-empty array');\n    }\n    if (!Array.isArray(config.forces) || config.forces.length === 0) {\n      throw new TypeError('TensorConfig.forces must be a non-empty array');\n    }\n\n    // Apply defaults\n    this.config = {\n      rank: config.rank,\n      scales: config.scales,\n      forces: config.forces,\n      symmetries: config.symmetries && config.symmetries.length > 0\n        ? config.symmetries\n        : ['poincare', 'gauge'],\n      informationMeasures: config.informationMeasures && config.informationMeasures.length > 0\n        ? config.informationMeasures\n        : ['vonNeumann', 'shannon'],\n      sparse: config.sparse ?? true,\n    };\n\n    this.knownLaws = new Map();\n    this.bridgeEquations = new Map();\n    this.emergentPhenomena = new Map();\n    this.tensorData = new Map();\n    this.fluxRules = V07_CELL_RULES;\n  }\n\n  /**\n   * Add a known physical law to the tensor.\n   * Returns true if newly added, false if it replaced an existing law with the same id.\n   * If replacing, stale cell entries from the previous law are removed first.\n   */\n  public addLaw(law: PhysicalLaw): boolean {\n    this.validateId(law.id, 'PhysicalLaw');\n    if (!(law.confidence >= 0 && law.confidence <= 1)) {\n      throw new RangeError(`PhysicalLaw.confidence must be in [0,1]; got ${law.confidence}`);\n    }\n    this.validateAxisMembership(law.scales, 'scales', this.config.scales);\n    this.validateAxisMembership(law.forces, 'forces', this.config.forces);\n    this.validateAxisMembership(law.symmetries, 'symmetries', this.config.symmetries);\n    this.validateAxisMembership(\n      law.informationMeasures,\n      'informationMeasures',\n      this.config.informationMeasures\n    );\n    this.validateFiniteIntegerArray(law.dimensions, 'dimensions');\n    this.validateFiniteIntegerArray(law.topologies, 'topologies');\n    const previous = this.knownLaws.get(law.id);\n    if (previous) {\n      // Remove stale cell entries from the prior version before writing new ones.\n      for (const scale of previous.scales) {\n        for (const force of previous.forces) {\n          this.removeFromCell(this.serializeIndices({ scale, force }), law.id);\n        }\n      }\n    }\n    this.knownLaws.set(law.id, law);\n\n    // Store in diagonal elements for all scale/force combinations.\n    // Multiple laws may occupy the same cell; we accumulate rather than overwrite.\n    for (const scale of law.scales) {\n      for (const force of law.forces) {\n        const key = this.serializeIndices({ scale, force });\n        this.addToCell(key, law.id);\n      }\n    }\n    return previous === undefined;\n  }\n\n  /**\n   * Add a bridge equation connecting regimes.\n   * Returns true if newly added, false if it replaced an existing bridge with the same id.\n   * If replacing, stale cell entries from the previous bridge are removed first.\n   */\n  public addBridge(bridge: BridgeEquation): boolean {\n    this.validateId(bridge.id, 'BridgeEquation');\n    if (!(bridge.confidence >= 0 && bridge.confidence <= 1)) {\n      throw new RangeError(`BridgeEquation.confidence must be in [0,1]; got ${bridge.confidence}`);\n    }\n    // Bridges are off-diagonal by definition — reject source == target\n    // (including the degenerate case where both are empty {}).\n    const sourceKey = this.serializeIndices(bridge.source);\n    const targetKey = this.serializeIndices(bridge.target);\n    if (sourceKey === targetKey) {\n      throw new RangeError(\n        `BridgeEquation source must differ from target in at least one index; id=${bridge.id}` +\n          (sourceKey === '' ? ' (both were empty {})' : '')\n      );\n    }\n    const previous = this.bridgeEquations.get(bridge.id);\n    if (previous) {\n      this.removeFromCell(this.bridgeCellKey(previous.source, previous.target), bridge.id);\n    }\n    this.bridgeEquations.set(bridge.id, bridge);\n\n    // Store in off-diagonal elements. Multiple bridges between the same\n    // source/target regime pair are accumulated in the same cell.\n    this.addToCell(this.bridgeCellKey(bridge.source, bridge.target), bridge.id);\n    return previous === undefined;\n  }\n\n  /**\n   * Reject empty or whitespace-only IDs — almost always caller error.\n   */\n  private validateId(id: string, kind: string): void {\n    if (typeof id !== 'string' || id.trim() === '') {\n      throw new TypeError(`${kind}.id must be a non-empty string`);\n    }\n  }\n\n  /**\n   * Reject axis values that are not declared in the tensor's config.\n   * Prevents silent drift between TensorConfig (declared axes) and actual stored content.\n   */\n  private validateAxisMembership<T extends string>(\n    values: readonly T[] | undefined,\n    axisName: string,\n    declared: readonly T[]\n  ): void {\n    if (!values) return;\n    for (const v of values) {\n      if (!declared.includes(v)) {\n        throw new RangeError(\n          `${axisName} value '${v}' is not declared in TensorConfig.${axisName}=[${declared.join(', ')}]`\n        );\n      }\n    }\n  }\n\n  /**\n   * Reject non-finite or non-integer numeric axis values (dimensions, topologies).\n   * Integer values (including 0, negative integers) are allowed;\n   * NaN, Infinity, and non-integers are rejected.\n   */\n  private validateFiniteIntegerArray(\n    values: readonly number[] | undefined,\n    axisName: string\n  ): void {\n    if (!values) return;\n    for (const v of values) {\n      if (!Number.isFinite(v) || !Number.isInteger(v)) {\n        throw new RangeError(\n          `${axisName} values must be finite integers; got ${v}`\n        );\n      }\n    }\n  }\n\n  /**\n   * Compose the cell key for a bridge equation's source→target indices.\n   */\n  private bridgeCellKey(source: TensorIndices, target: TensorIndices): string {\n    return this.serializeIndices(source) + ' -> ' + this.serializeIndices(target);\n  }\n\n  /**\n   * Accumulate an equation ID into the tensor cell at the given key.\n   * Creates a new Set if the cell is empty.\n   */\n  private addToCell(key: string, equationId: string): void {\n    let cell = this.tensorData.get(key);\n    if (!cell) {\n      cell = new Set();\n      this.tensorData.set(key, cell);\n    }\n    cell.add(equationId);\n  }\n\n  /**\n   * Remove an equation ID from a tensor cell. Prunes empty cells.\n   */\n  private removeFromCell(key: string, equationId: string): void {\n    const cell = this.tensorData.get(key);\n    if (!cell) return;\n    cell.delete(equationId);\n    if (cell.size === 0) this.tensorData.delete(key);\n  }\n\n  /**\n   * Add an emergent phenomenon.\n   * Returns true if newly added, false if it replaced an existing phenomenon.\n   */\n  public addEmergence(phenomenon: EmergentPhenomenon): boolean {\n    this.validateId(phenomenon.id, 'EmergentPhenomenon');\n    if (!Number.isInteger(phenomenon.order) || phenomenon.order < 3) {\n      throw new RangeError(\n        `EmergentPhenomenon.order must be an integer >= 3 (higher-order correlations); got ${phenomenon.order}`\n      );\n    }\n    if (!(phenomenon.confidence >= 0 && phenomenon.confidence <= 1)) {\n      throw new RangeError(\n        `EmergentPhenomenon.confidence must be in [0,1]; got ${phenomenon.confidence}`\n      );\n    }\n    const previous = this.emergentPhenomena.get(phenomenon.id);\n    if (previous) {\n      for (const indices of previous.indices) {\n        const key = this.serializeIndices(indices);\n        if (key) this.removeFromCell(key, phenomenon.id);\n      }\n    }\n    this.emergentPhenomena.set(phenomenon.id, phenomenon);\n\n    // Populate tensorData at each declared index-tuple, matching the L and B\n    // components' storage pattern so the Π = L + B + E decomposition is\n    // uniformly represented in the sparse tensor.\n    for (const indices of phenomenon.indices) {\n      const key = this.serializeIndices(indices);\n      if (key) this.addToCell(key, phenomenon.id);\n    }\n    return previous === undefined;\n  }\n\n  /**\n   * Add a typed `Cell` (LawCell, BridgeCell, or EmergenceCell) to the\n   * tensor. Dispatches by the cell's `kind` discriminator to the\n   * existing `addLaw` / `addBridge` / `addEmergence` paths via internal\n   * adapters that translate the string-vocabulary `confidence` to the\n   * legacy numeric range.\n   *\n   * Returns the same boolean the dispatched method returns: `true` if\n   * newly added, `false` if it replaced an existing entry with the same\n   * id.\n   *\n   * v0.7 Proposal 3 Phase 2 Task 2.1. Internal callers that want\n   * type-safe ingestion through the discriminated union use `addCell`;\n   * callers that want the old typed methods continue to use `addLaw` /\n   * `addBridge` / `addEmergence` directly.\n   *\n   * @public\n   */\n  public addCell(cell: Cell): boolean {\n    // v0.7-p2 Phase 2 Task 2.3: dispatch to legacy add method FIRST\n    // (catches structural-validation throws on bad inputs), then run\n    // flux rules. ERROR-tier diagnostics throw FluxViolationError and\n    // roll back the legacy add (fail-atomic per Decision #4). The add may\n    // REPLACE an entry with the same id, so the entry that was there is\n    // snapshotted first and put back on rollback; deleting the id would\n    // erase a good record because its replacement was bad.\n    const previous = this.snapshotEntry(cell);\n    let newlyAdded: boolean;\n    switch (cell.kind) {\n      case 'law':\n        newlyAdded = this.addLaw(cellToLaw(cell));\n        break;\n      case 'bridge':\n        newlyAdded = this.addBridge(cellToBridge(cell));\n        break;\n      case 'emergence':\n        newlyAdded = this.addEmergence(cellToEmergence(cell));\n        break;\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n        throw new Error(\n          `UniversalTensor.addCell: unknown cell kind: ${(cell as Cell).kind}`,\n        );\n      }\n    }\n\n    // Run rules. WARNING/INFO diagnostics are accumulated for the\n    // next fluxDiagnostics() call (recomputed on demand per Eve-R8\n    // — no mutable pendingDiagnostics field). ERROR-tier throws.\n    const report = runRules(cell, this.fluxRules);\n    if (report.errorCount > 0) {\n      const errDiag = report.diagnostics.find((d) => d.severity === 'error');\n      if (errDiag) {\n        // Roll back the legacy add before throwing (fail-atomic).\n        this.rollbackCell(cell, previous);\n        throw new FluxViolationError(errDiag.ruleName, errDiag.cellId, errDiag.message);\n      }\n    }\n    return newlyAdded;\n  }\n\n  /** The stored entry `cell.id` currently names in its own kind's map, if any. */\n  private snapshotEntry(cell: Cell): PreviousEntry | undefined {\n    switch (cell.kind) {\n      case 'law': {\n        const law = this.knownLaws.get(cell.id);\n        return law === undefined ? undefined : { kind: 'law', law };\n      }\n      case 'bridge': {\n        const bridge = this.bridgeEquations.get(cell.id);\n        return bridge === undefined ? undefined : { kind: 'bridge', bridge };\n      }\n      case 'emergence': {\n        const phenomenon = this.emergentPhenomena.get(cell.id);\n        return phenomenon === undefined ? undefined : { kind: 'emergence', phenomenon };\n      }\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n        return undefined;\n      }\n    }\n  }\n\n  /**\n   * Internal helper: roll back the legacy `addLaw`/`addBridge`/\n   * `addEmergence` storage for a cell that just failed a rule check.\n   * Removes the freshly stored entry and, when the add replaced an\n   * existing entry, stores that entry again through the same add path\n   * (it passed structural validation when it was first stored). Used by\n   * `addCell` to maintain fail-atomic semantics on ERROR-tier rule\n   * violations.\n   *\n   * @internal\n   */\n  private rollbackCell(cell: Cell, previous: PreviousEntry | undefined): void {\n    switch (cell.kind) {\n      case 'law': {\n        const law = this.knownLaws.get(cell.id);\n        if (!law) return;\n        this.knownLaws.delete(cell.id);\n        for (const scale of law.scales) {\n          for (const force of law.forces) {\n            this.removeFromCell(this.serializeIndices({ scale, force }), cell.id);\n          }\n        }\n        if (previous?.kind === 'law') this.addLaw(previous.law);\n        return;\n      }\n      case 'bridge': {\n        const bridge = this.bridgeEquations.get(cell.id);\n        if (!bridge) return;\n        this.bridgeEquations.delete(cell.id);\n        this.removeFromCell(this.bridgeCellKey(bridge.source, bridge.target), cell.id);\n        if (previous?.kind === 'bridge') this.addBridge(previous.bridge);\n        return;\n      }\n      case 'emergence': {\n        const ph = this.emergentPhenomena.get(cell.id);\n        if (!ph) return;\n        this.emergentPhenomena.delete(cell.id);\n        for (const indices of ph.indices) {\n          const key = this.serializeIndices(indices);\n          if (key) this.removeFromCell(key, cell.id);\n        }\n        if (previous?.kind === 'emergence') this.addEmergence(previous.phenomenon);\n        return;\n      }\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n      }\n    }\n  }\n\n  // -------------------------------------------------------------------------\n  // v0.7-p2 Phase 2 Tasks 2.1, 2.2, 2.3 — populated-cells query + flux\n  // -------------------------------------------------------------------------\n\n  /**\n   * Number of distinct (key, value) pairs in the underlying sparse\n   * storage. Counts UNIQUE coordinates that hold at least one entry.\n   *\n   * Note: a single multi-scale `LawCell` (e.g.\n   * `scales: ['quantum', 'classical']`, `forces: ['gravitational']`)\n   * fans out to 2 coordinates, so `populatedCount()` returns 2.\n   * Use `populatedCells()` for the deduped count of distinct `Cell`\n   * objects.\n   *\n   * @public\n   */\n  public populatedCount(): number {\n    return this.tensorData.size;\n  }\n\n  /**\n   * All cells currently in the tensor, deduplicated by `id`. Each\n   * underlying entry (law, bridge, emergence) is converted back to\n   * its `Cell` representation via the inverse adapters in `cell.ts`.\n   *\n   * Per Eve-R15 semantics: `populatedCells().length` is the count of\n   * distinct `Cell` objects (one per `id`). `populatedCount()` counts\n   * unique TENSOR COORDINATES (one per fan-out per Decision #6),\n   * which may be larger.\n   *\n   * @public\n   */\n  public populatedCells(): ReadonlyArray<Cell> {\n    const cells: Cell[] = [];\n    for (const law of this.knownLaws.values()) cells.push(lawToCell(law));\n    for (const bridge of this.bridgeEquations.values()) cells.push(bridgeToCell(bridge));\n    for (const ph of this.emergentPhenomena.values()) cells.push(emergenceToCell(ph));\n    return cells;\n  }\n\n  /**\n   * For each populated coordinate, enumerate the single-axis-flip\n   * neighbors that are NOT currently populated. Each \"neighbor\" is\n   * a `TensorIndices` value that differs from a populated coordinate\n   * in exactly one axis, where the differing axis value is drawn\n   * from the config-declared set for that axis (Decision #10).\n   *\n   * Integer axes (`dimension`, `topology`) are NOT enumerable from\n   * `TensorConfig` (no declared range exists) and are treated as\n   * wildcards — single-axis flips along those axes are NOT\n   * generated.\n   *\n   * Returns a deduplicated `ReadonlyArray<TensorIndices>` (no two\n   * elements serialize to the same key under `serializeIndices`).\n   *\n   * @public\n   */\n  public unpopulatedNeighborhoods(): ReadonlyArray<TensorIndices> {\n    const populated = new Set(this.tensorData.keys());\n    const unique = new Map<string, TensorIndices>();\n\n    for (const populatedKey of this.tensorData.keys()) {\n      const parsed = this.deserializeKey(populatedKey);\n      if (!parsed) continue;\n      for (const neighbor of this.enumerateAxisFlips(parsed)) {\n        const key = this.serializeIndices(neighbor);\n        if (key === '' || populated.has(key) || unique.has(key)) continue;\n        unique.set(key, neighbor);\n      }\n    }\n    return [...unique.values()];\n  }\n\n  /**\n   * Run the registered flux rules across every populated cell and\n   * return an aggregated `FluxReport`. Re-runs on every call\n   * (no cached `pendingDiagnostics` field — Eve-R8 resolution).\n   *\n   * @public\n   */\n  public fluxDiagnostics(): FluxReport {\n    const diagnostics: FluxDiagnostic[] = [];\n    let errorCount = 0;\n    let warningCount = 0;\n    let infoCount = 0;\n\n    for (const cell of this.populatedCells()) {\n      const report = runRules(cell, this.fluxRules);\n      diagnostics.push(...report.diagnostics);\n      errorCount += report.errorCount;\n      warningCount += report.warningCount;\n      infoCount += report.infoCount;\n    }\n    return { diagnostics, errorCount, warningCount, infoCount };\n  }\n\n  // -------------------------------------------------------------------------\n  // Phase 2 internal helpers\n  // -------------------------------------------------------------------------\n\n  /**\n   * Parse a key produced by `serializeIndices` back into a\n   * `TensorIndices` value. Returns null if the key includes a bridge\n   * separator (' -> '), since bridge keys are off-diagonal and don't\n   * correspond to a single `TensorIndices` coordinate.\n   *\n   * @internal\n   */\n  private deserializeKey(key: string): TensorIndices | null {\n    if (key.includes(' -> ')) return null; // bridge key — not a single coordinate\n    if (key === '') return {};\n    const out: { [k: string]: unknown } = {};\n    for (const part of key.split('|')) {\n      const colon = part.indexOf(':');\n      if (colon === -1) continue;\n      const axis = part.slice(0, colon);\n      const value = part.slice(colon + 1);\n      switch (axis) {\n        case 'scale': out.scale = value; break;\n        case 'force': out.force = value; break;\n        case 'sym': out.symmetry = value; break;\n        case 'info': out.information = value; break;\n        case 'dim': out.dimension = Number(value); break;\n        case 'topo': out.topology = Number(value); break;\n      }\n    }\n    return out as TensorIndices;\n  }\n\n  /**\n   * Enumerate single-axis-flip neighbors of `coord`. For each\n   * enumerable axis (scale, force, symmetry, information), generate\n   * a neighbor with that axis replaced by every OTHER config-declared\n   * value. The integer axes (dimension, topology) are wildcards\n   * and not enumerated.\n   *\n   * @internal\n   */\n  private *enumerateAxisFlips(coord: TensorIndices): Generator<TensorIndices> {\n    const axes: Array<{\n      key: keyof TensorIndices;\n      values: readonly string[];\n    }> = [\n      { key: 'scale', values: this.config.scales },\n      { key: 'force', values: this.config.forces },\n      { key: 'symmetry', values: this.config.symmetries },\n      { key: 'information', values: this.config.informationMeasures },\n    ];\n\n    for (const { key, values } of axes) {\n      if (coord[key] === undefined) continue;\n      for (const alt of values) {\n        if (alt === coord[key]) continue;\n        yield { ...coord, [key]: alt };\n      }\n    }\n  }\n\n  /**\n   * Return the IDs of laws and emergent phenomena stored at the diagonal cell\n   * addressed by the given indices.\n   * For bridge-equation cells (off-diagonal, source→target), use getBridgeCellContents instead.\n   */\n  public getCellContents(indices: TensorIndices): string[] {\n    const key = this.serializeIndices(indices);\n    const cell = this.tensorData.get(key);\n    return cell ? [...cell] : [];\n  }\n\n  /**\n   * Return the IDs of bridge equations stored at the off-diagonal cell\n   * addressed by the given source/target indices.\n   */\n  public getBridgeCellContents(source: TensorIndices, target: TensorIndices): string[] {\n    const key = this.bridgeCellKey(source, target);\n    const cell = this.tensorData.get(key);\n    return cell ? [...cell] : [];\n  }\n\n  /**\n   * Query tensor for laws applicable to specific regime\n   */\n  public queryLaws(indices: TensorIndices): PhysicalLaw[] {\n    const results: PhysicalLaw[] = [];\n\n    for (const law of this.knownLaws.values()) {\n      if (this.lawMatchesQuery(law, indices)) {\n        results.push(law);\n      }\n    }\n\n    return results;\n  }\n\n  /**\n   * Find bridge equations connecting two regimes\n   */\n  public findBridges(source: TensorIndices, target: TensorIndices): BridgeEquation[] {\n    const results: BridgeEquation[] = [];\n\n    for (const bridge of this.bridgeEquations.values()) {\n      if (\n        this.indicesMatch(bridge.source, source) &&\n        this.indicesMatch(bridge.target, target)\n      ) {\n        results.push(bridge);\n      }\n    }\n\n    return results;\n  }\n\n  /**\n   * Get all known laws\n   */\n  public getLaws(): PhysicalLaw[] {\n    return [...this.knownLaws.values()];\n  }\n\n  /**\n   * Get all bridge equations\n   */\n  public getBridges(): BridgeEquation[] {\n    return [...this.bridgeEquations.values()];\n  }\n\n  /**\n   * Get all emergent phenomena\n   */\n  public getEmergence(): EmergentPhenomenon[] {\n    return [...this.emergentPhenomena.values()];\n  }\n\n  /**\n   * Get tensor statistics\n   */\n  public getStats() {\n    // occupiedCells = number of distinct (diagonal or off-diagonal) tensor cells\n    // that hold at least one equation ID. Each cell may hold multiple IDs (Set).\n    let totalEntries = 0;\n    for (const cell of this.tensorData.values()) totalEntries += cell.size;\n    return {\n      rank: this.config.rank,\n      knownLaws: this.knownLaws.size,\n      bridgeEquations: this.bridgeEquations.size,\n      emergentPhenomena: this.emergentPhenomena.size,\n      occupiedCells: this.tensorData.size,\n      totalEntries,\n      sparse: this.config.sparse,\n    };\n  }\n\n  /**\n   * Serialize tensor indices to string key.\n   * Uses !== undefined checks so that dimension/topology values of 0\n   * (e.g., trivial winding number, genus-0 surface) are preserved.\n   */\n  private serializeIndices(indices: TensorIndices): string {\n    const parts: string[] = [];\n\n    if (indices.scale !== undefined) parts.push(`scale:${indices.scale}`);\n    if (indices.force !== undefined) parts.push(`force:${indices.force}`);\n    if (indices.symmetry !== undefined) parts.push(`sym:${indices.symmetry}`);\n    if (indices.information !== undefined) parts.push(`info:${indices.information}`);\n    if (indices.dimension !== undefined) parts.push(`dim:${indices.dimension}`);\n    if (indices.topology !== undefined) parts.push(`topo:${indices.topology}`);\n\n    return parts.join('|');\n  }\n\n  /**\n   * Check if a law matches query indices.\n   * If the query specifies an index dimension that the law does not declare\n   * (e.g., the law has no informationMeasures but the query asks for one),\n   * the law is excluded — querying on an undeclared index cannot match.\n   */\n  private lawMatchesQuery(law: PhysicalLaw, query: TensorIndices): boolean {\n    if (query.scale && !law.scales.includes(query.scale)) {\n      return false;\n    }\n\n    if (query.force && !law.forces.includes(query.force)) {\n      return false;\n    }\n\n    if (query.symmetry && !law.symmetries.includes(query.symmetry)) {\n      return false;\n    }\n\n    if (query.information) {\n      if (!law.informationMeasures || !law.informationMeasures.includes(query.information)) {\n        return false;\n      }\n    }\n\n    if (query.dimension !== undefined) {\n      if (!law.dimensions || !law.dimensions.includes(query.dimension)) {\n        return false;\n      }\n    }\n\n    if (query.topology !== undefined) {\n      if (!law.topologies || !law.topologies.includes(query.topology)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Check if two tensor indices match\n   */\n  private indicesMatch(a: TensorIndices, b: TensorIndices): boolean {\n    if (b.scale && a.scale !== b.scale) {\n      return false;\n    }\n\n    if (b.force && a.force !== b.force) {\n      return false;\n    }\n\n    if (b.symmetry && a.symmetry !== b.symmetry) {\n      return false;\n    }\n\n    if (b.information && a.information !== b.information) {\n      return false;\n    }\n\n    if (b.dimension !== undefined && a.dimension !== b.dimension) {\n      return false;\n    }\n\n    if (b.topology !== undefined && a.topology !== b.topology) {\n      return false;\n    }\n\n    return true;\n  }\n}\n\n/**\n * Factory: build a populated `UniversalTensor` from three typed cell\n * arrays plus a `TensorConfig`.\n *\n * Makes the \"'+' in Π = L + B + E is disjoint union, not algebraic\"\n * invariant concrete: the only way to construct a populated\n * `UniversalTensor` from typed cells is to pass three typed arrays.\n * There is no `add(c1: Cell, c2: Cell): Cell` because cells never\n * compose at the cell level — composition happens at the tensor\n * level (Proposals 2 and 6 territory).\n *\n * **Provenance note**: the proposals doc §4.2 line 299 sketches\n * `compose(L, B, E): UniversalTensor` without a `config` argument.\n * This signature closes a proposals-doc gap — `UniversalTensor`'s\n * constructor requires `rank` / `scales` / `forces`, none of which\n * can be inferred from the three cell arrays alone. `compose` is\n * this sprint's invention, not a proposals-doc commitment.\n *\n * Co-located with `UniversalTensor` (moved from `cell.ts`, 2026-06-19) to\n * break the `tensor.ts ↔ cell.ts` RUNTIME import cycle: `cell.ts` now depends\n * on `tensor.ts` for types only, while this factory — the one cell-side symbol\n * that instantiated `UniversalTensor` at runtime — lives beside the class.\n *\n * @public\n */\nexport function compose(\n  laws: ReadonlyArray<LawCell>,\n  bridges: ReadonlyArray<BridgeCell>,\n  emergences: ReadonlyArray<EmergenceCell>,\n  config: TensorConfig,\n): UniversalTensor {\n  const tensor = new UniversalTensor(config);\n  for (const law of laws) tensor.addCell(law);\n  for (const bridge of bridges) tensor.addCell(bridge);\n  for (const emergence of emergences) tensor.addCell(emergence);\n  return tensor;\n}\n"]}
+{"version":3,"file":"tensor.js","sourceRoot":"","sources":["../../src/core/tensor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAkBH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACrE,OAAO,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAE1C,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAY/E;;;;;;;;;;;;;;;GAeG;AACH,SAAS,wBAAwB,CAAC,CAAiB;IACjD,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,aAAa,EAAE,OAAO,IAAI,CAAC;QAChC,KAAK,aAAa,EAAE,OAAO,GAAG,CAAC;QAC/B,KAAK,oBAAoB,EAAE,OAAO,GAAG,CAAC;QACtC,SAAS,CAAC;YACR,MAAM,WAAW,GAAU,CAAC,CAAC;YAC7B,KAAK,WAAW,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAW,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,IAAa;IAC9B,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAChC,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QACrD,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjE,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,IAAgB;IACpC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QACrD,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,WAAW,EAAE,IAAI,CAAC,WAAW;KAC9B,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,IAAmB;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW;QAClC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,OAAO,IAAI,CAAC,WAAW,EAAE;QAC3C,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IAClB,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,WAAW;QACX,UAAU,EAAE,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;KACtD,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAAa,EAAE,MAA0B,EAAE,QAA2C;IAC/G,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,gBAAgB,KAAK,mBAAmB,CAAC,CAAC;IAC1F,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,UAAU,CAAC,gBAAgB,KAAK,MAAM,MAAM,CAAC,KAAK,CAAC,8CAA8C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjI,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,eAAe;IACT,MAAM,CAAyB;IAC/B,SAAS,CAA2B;IACpC,eAAe,CAA8B;IAC7C,iBAAiB,CAAkC;IAEpE;;;;;OAKG;IACc,UAAU,CAA2B;IAEtD;;;;;;;;;OASG;IACc,SAAS,CAA0B;IAEpD,YAAY,MAAoB;QAC9B,sEAAsE;QACtE,oEAAoE;QACpE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,UAAU,CAAC,gDAAgD,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACtF,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAC;QACvE,CAAC;QACD,4FAA4F;QAC5F,mDAAmD;QACnD,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS;YAAE,iBAAiB,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvG,IAAI,MAAM,CAAC,mBAAmB,KAAK,SAAS,EAAE,CAAC;YAC7C,iBAAiB,CAAC,qBAAqB,EAAE,MAAM,CAAC,mBAAmB,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzF,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,MAAM,GAAG;YACZ,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;gBAC3D,CAAC,CAAC,MAAM,CAAC,UAAU;gBACnB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC;YACzB,mBAAmB,EAAE,MAAM,CAAC,mBAAmB,IAAI,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC;gBACtF,CAAC,CAAC,MAAM,CAAC,mBAAmB;gBAC5B,CAAC,CAAC,CAAC,YAAY,EAAE,SAAS,CAAC;YAC7B,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,IAAI;SAC9B,CAAC;QAEF,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,cAAc,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,GAAgB;QAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QACvC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,IAAI,GAAG,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,UAAU,CAAC,gDAAgD,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtE,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAClF,IAAI,CAAC,sBAAsB,CACzB,GAAG,CAAC,mBAAmB,EACvB,qBAAqB,EACrB,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAChC,CAAC;QACF,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAC9D,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,QAAQ,EAAE,CAAC;YACb,4EAA4E;YAC5E,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACpC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACpC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAEhC,+DAA+D;QAC/D,+EAA+E;QAC/E,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBACpD,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,MAAsB;QACrC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;QAC7C,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,IAAI,CAAC,IAAI,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,UAAU,CAAC,mDAAmD,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;QAC/F,CAAC;QACD,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,IAAI,UAAU,CAClB,2EAA2E,MAAM,CAAC,EAAE,EAAE;gBACpF,CAAC,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,CAAC,CACpD,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAE5C,oEAAoE;QACpE,8DAA8D;QAC9D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5E,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,EAAU,EAAE,IAAY;QACzC,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,SAAS,CAAC,GAAG,IAAI,gCAAgC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,sBAAsB,CAC5B,MAAgC,EAChC,QAAgB,EAChB,QAAsB;QAEtB,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,UAAU,CAClB,GAAG,QAAQ,WAAW,CAAC,qCAAqC,QAAQ,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAChG,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,0BAA0B,CAChC,MAAqC,EACrC,QAAgB;QAEhB,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChD,MAAM,IAAI,UAAU,CAClB,GAAG,QAAQ,wCAAwC,CAAC,EAAE,CACvD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,MAAqB,EAAE,MAAqB;QAChE,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAChF,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,GAAW,EAAE,UAAkB;QAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,GAAW,EAAE,UAAkB;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,UAA8B;QAChD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,oBAAoB,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,UAAU,CAClB,qFAAqF,UAAU,CAAC,KAAK,EAAE,CACxG,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,UAAU,CAAC,UAAU,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,UAAU,CAClB,uDAAuD,UAAU,CAAC,UAAU,EAAE,CAC/E,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3D,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;gBAC3C,IAAI,GAAG;oBAAE,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAEtD,yEAAyE;QACzE,oEAAoE;QACpE,8CAA8C;QAC9C,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,GAAG;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,QAAQ,KAAK,SAAS,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACI,OAAO,CAAC,IAAU;QACvB,gEAAgE;QAChE,iEAAiE;QACjE,kEAAkE;QAClE,sEAAsE;QACtE,oEAAoE;QACpE,oEAAoE;QACpE,uDAAuD;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,UAAmB,CAAC;QACxB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK;gBACR,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1C,MAAM;YACR,KAAK,QAAQ;gBACX,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChD,MAAM;YACR,KAAK,WAAW;gBACd,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;gBACtD,MAAM;YACR,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;gBACjB,MAAM,IAAI,KAAK,CACb,+CAAgD,IAAa,CAAC,IAAI,EAAE,CACrE,CAAC;YACJ,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,+DAA+D;QAC/D,6DAA6D;QAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;YACvE,IAAI,OAAO,EAAE,CAAC;gBACZ,0DAA0D;gBAC1D,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAClC,MAAM,IAAI,kBAAkB,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,gFAAgF;IACxE,aAAa,CAAC,IAAU;QAC9B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;YAC9D,CAAC;YACD,KAAK,QAAQ,EAAE,CAAC;gBACd,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;YACvE,CAAC;YACD,KAAK,WAAW,EAAE,CAAC;gBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvD,OAAO,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC;YAClF,CAAC;YACD,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;gBACjB,OAAO,SAAS,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACK,YAAY,CAAC,IAAU,EAAE,QAAmC;QAClE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,EAAE,CAAC;gBACX,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,OAAO;gBACjB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;oBAC/B,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;wBAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;oBACxE,CAAC;gBACH,CAAC;gBACD,IAAI,QAAQ,EAAE,IAAI,KAAK,KAAK;oBAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBACxD,OAAO;YACT,CAAC;YACD,KAAK,QAAQ,EAAE,CAAC;gBACd,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,CAAC,MAAM;oBAAE,OAAO;gBACpB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/E,IAAI,QAAQ,EAAE,IAAI,KAAK,QAAQ;oBAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACjE,OAAO;YACT,CAAC;YACD,KAAK,WAAW,EAAE,CAAC;gBACjB,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/C,IAAI,CAAC,EAAE;oBAAE,OAAO;gBAChB,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvC,KAAK,MAAM,OAAO,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;oBACjC,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;oBAC3C,IAAI,GAAG;wBAAE,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,QAAQ,EAAE,IAAI,KAAK,WAAW;oBAAE,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAC3E,OAAO;YACT,CAAC;YACD,SAAS,CAAC;gBACR,MAAM,WAAW,GAAU,IAAI,CAAC;gBAChC,KAAK,WAAW,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,4EAA4E;IAE5E;;;;;;;;;;;OAWG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED;;;;;;;;;;;OAWG;IACI,cAAc;QACnB,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;QACrF,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACI,wBAAwB;QAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEhD,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvD,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,GAAG,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAClE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACI,eAAe;QACpB,MAAM,WAAW,GAAqB,EAAE,CAAC;QACzC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9C,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;YACxC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC;YAChC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;YACpC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC;QAChC,CAAC;QACD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;IAC9D,CAAC;IAED,4EAA4E;IAC5E,2BAA2B;IAC3B,4EAA4E;IAE5E;;;;;;;OAOG;IACK,cAAc,CAAC,GAAW;QAChC,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,uCAAuC;QAC9E,IAAI,GAAG,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAA6B,EAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,CAAC,CAAC;gBAAE,SAAS;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACpC,QAAQ,IAAI,EAAE,CAAC;gBACb,KAAK,OAAO;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACvC,KAAK,OAAO;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACvC,KAAK,KAAK;oBAAE,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC;oBAAC,MAAM;gBACxC,KAAK,MAAM;oBAAE,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAC5C,KAAK,KAAK;oBAAE,GAAG,CAAC,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;gBACjD,KAAK,MAAM;oBAAE,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBAAC,MAAM;YACnD,CAAC;QACH,CAAC;QACD,OAAO,GAAoB,CAAC;IAC9B,CAAC;IAED;;;;;;;;OAQG;IACK,CAAC,kBAAkB,CAAC,KAAoB;QAC9C,MAAM,IAAI,GAGL;YACH,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC5C,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC5C,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE;YACnD,EAAE,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE;SAChE,CAAC;QAEF,KAAK,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,SAAS;YACvC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,IAAI,GAAG,KAAK,KAAK,CAAC,GAAG,CAAC;oBAAE,SAAS;gBACjC,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,OAAsB;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,qBAAqB,CAAC,MAAqB,EAAE,MAAqB;QACvE,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,OAAsB;QACrC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACvC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,MAAqB,EAAE,MAAqB;QAC7D,MAAM,OAAO,GAAqB,EAAE,CAAC;QAErC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACnD,IACE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;gBACxC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACxC,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,UAAU;QACf,OAAO,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACI,YAAY;QACjB,OAAO,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,6EAA6E;QAC7E,6EAA6E;QAC7E,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;YAAE,YAAY,IAAI,IAAI,CAAC,IAAI,CAAC;QACvE,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YACtB,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;YAC9B,eAAe,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI;YAC1C,iBAAiB,EAAE,IAAI,CAAC,iBAAiB,CAAC,IAAI;YAC9C,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YACnC,YAAY;YACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,OAAsB;QAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1E,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QACjF,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QAC5E,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE3E,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,GAAgB,EAAE,KAAoB;QAC5D,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,mBAAmB,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;gBACrF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,CAAgB,EAAE,CAAgB;QACrD,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACrD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,OAAO,CACrB,IAA4B,EAC5B,OAAkC,EAClC,UAAwC,EACxC,MAAoB;IAEpB,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5C,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACrD,KAAK,MAAM,SAAS,IAAI,UAAU;QAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["/**\n * Universal Physics Tensor\n *\n * Core implementation of the rank-N tensor living in product space:\n * Π ∈ H_scale ⊗ H_force ⊗ H_symmetry ⊗ H_info ⊗ H_dim ⊗ H_topo\n *\n * Decomposition: Π = L + B + E\n * Where:\n * - L: Known laws (diagonal elements)\n * - B: Bridge equations (off-diagonal elements)\n * - E: Emergent phenomena (higher-order correlations)\n */\n\nimport type {\n  TensorConfig,\n  TensorIndices,\n  PhysicalLaw,\n  BridgeEquation,\n  EmergentPhenomenon,\n  PhysicalScale,\n  Force,\n} from './types.js';\nimport type {\n  Cell,\n  CellConfidence,\n  LawCell,\n  BridgeCell,\n  EmergenceCell,\n} from './cell.js';\nimport { lawToCell, bridgeToCell, emergenceToCell } from './cell.js';\nimport { Axes } from './axes-registry.js';\nimport type { FluxRule, FluxReport, FluxDiagnostic } from './flux-rules.js';\nimport { runRules, V07_CELL_RULES, FluxViolationError } from './flux-rules.js';\n\n/**\n * The entry an `addCell` call is about to replace, held so a flux-rule\n * failure can put it back (fail-atomic on a replacement, not only on a\n * fresh id).\n */\ntype PreviousEntry =\n  | { readonly kind: 'law'; readonly law: PhysicalLaw }\n  | { readonly kind: 'bridge'; readonly bridge: BridgeEquation }\n  | { readonly kind: 'emergence'; readonly phenomenon: EmergentPhenomenon };\n\n/**\n * Map the string-vocabulary {@link CellConfidence} to a representative\n * numeric value in [0,1] for the legacy `addLaw` / `addBridge` /\n * `addEmergence` path (each validates `confidence >= 0 && <= 1`).\n *\n * Internal-only — consumers see the string vocabulary on `Cell`. The\n * numeric value is a storage detail, not a public-API contract. Per\n * Adam+Eve Eve-R3, this is the REVERSE direction of the (rejected)\n * `confidenceToStatus` adapter: that one was rejected because it\n * could overwrite curated catalog `status` fields with derived labels.\n * This one is safe because the caller has already declared their\n * string intent; the function just picks a representative number for\n * the legacy path's range check.\n *\n * @internal\n */\nfunction statusToConfidenceNumber(c: CellConfidence): number {\n  switch (c) {\n    case 'established': return 0.95;\n    case 'speculative': return 0.6;\n    case 'highly-speculative': return 0.3;\n    default: {\n      const _exhaustive: never = c;\n      void _exhaustive;\n      throw new Error(`Unknown CellConfidence: ${c as string}`);\n    }\n  }\n}\n\n/**\n * Adapter: `LawCell` → `PhysicalLaw` (legacy shape). Internal-only.\n * @internal\n */\nfunction cellToLaw(cell: LawCell): PhysicalLaw {\n  return {\n    id: cell.id,\n    name: cell.name,\n    equation: cell.equation,\n    scales: [...cell.scales],\n    forces: [...cell.forces],\n    symmetries: [...cell.symmetries],\n    confidence: statusToConfidenceNumber(cell.confidence),\n    ...(cell.informationMeasures ? { informationMeasures: [...cell.informationMeasures] } : {}),\n    ...(cell.dimensions ? { dimensions: [...cell.dimensions] } : {}),\n    ...(cell.topologies ? { topologies: [...cell.topologies] } : {}),\n    ...(cell.references ? { references: [...cell.references] } : {}),\n  };\n}\n\n/**\n * Adapter: `BridgeCell` → `BridgeEquation` (legacy shape). Internal-only.\n * @internal\n */\nfunction cellToBridge(cell: BridgeCell): BridgeEquation {\n  return {\n    id: cell.id,\n    name: cell.name,\n    source: cell.source,\n    target: cell.target,\n    equation: cell.equation,\n    confidence: statusToConfidenceNumber(cell.confidence),\n    validated: cell.validated,\n    description: cell.description,\n  };\n}\n\n/**\n * Adapter: `EmergenceCell` → `EmergentPhenomenon` (legacy shape).\n * Maps `cell.equation` to `EmergentPhenomenon.description` (the legacy\n * interface uses `description` for the mathematical content); a\n * separate `cell.description` (prose context) is appended if present.\n * @internal\n */\nfunction cellToEmergence(cell: EmergenceCell): EmergentPhenomenon {\n  const description = cell.description\n    ? `${cell.equation}\\n\\n${cell.description}`\n    : cell.equation;\n  return {\n    id: cell.id,\n    name: cell.name,\n    order: cell.order,\n    indices: [...cell.indices],\n    description,\n    confidence: statusToConfidenceNumber(cell.confidence),\n  };\n}\n\n/**\n * Refuse a configured axis value the registry does not name. `admitted` is the\n * registry namespace for that axis (`Axes.scale`, …), whose keys are the values.\n */\nfunction requireAxisValues(field: string, values: readonly unknown[], admitted: Readonly<Record<string, unknown>>): void {\n  if (!Array.isArray(values)) throw new TypeError(`TensorConfig.${field} must be an array`);\n  const known = Object.keys(admitted);\n  for (const value of values) {\n    if (typeof value !== 'string' || !known.includes(value)) {\n      throw new RangeError(`TensorConfig.${field}: '${String(value)}' is not an axis value; the registry names ${known.join(', ')}`);\n    }\n  }\n}\n\n/**\n * The rank-6 universal physics tensor Π = L + B + E: a sparse store of\n * physical-law / bridge / emergence cells indexed by regime coordinates.\n *\n * @public\n */\nexport class UniversalTensor {\n  private readonly config: Required<TensorConfig>;\n  private readonly knownLaws: Map<string, PhysicalLaw>;\n  private readonly bridgeEquations: Map<string, BridgeEquation>;\n  private readonly emergentPhenomena: Map<string, EmergentPhenomenon>;\n\n  /**\n   * Sparse tensor storage: only store non-zero elements.\n   * Key: serialized tensor indices\n   * Value: set of equation IDs occupying that cell (multiple laws/bridges\n   * may coexist in a single tensor cell without overwriting each other).\n   */\n  private readonly tensorData: Map<string, Set<string>>;\n\n  /**\n   * v0.7-p2 Phase 2 Task 2.3: Rule set used by `addCell` (ERROR-tier\n   * violations throw) and by `fluxDiagnostics()` (re-runs across all\n   * populated cells). Default = `V07_CELL_RULES` (Rule 2 + Rule 3\n   * from `flux-rules.ts`). Rule 1 (dimensional consistency) fires\n   * from the catalog adapter (Phase 3), not from `addCell`.\n   *\n   * Per Decision #9, this field is `@internal`. No public mutator\n   * is exposed in v0.7 (rule customization is a v0.8+ concern).\n   */\n  private readonly fluxRules: ReadonlyArray<FluxRule>;\n\n  constructor(config: TensorConfig) {\n    // Runtime validation (strict TS catches these at compile time, but JS\n    // consumers bypass the type system — we validate defensively here).\n    if (![3, 4, 5, 6].includes(config.rank)) {\n      throw new RangeError(`TensorConfig.rank must be 3, 4, 5, or 6; got ${config.rank}`);\n    }\n    if (!Array.isArray(config.scales) || config.scales.length === 0) {\n      throw new TypeError('TensorConfig.scales must be a non-empty array');\n    }\n    if (!Array.isArray(config.forces) || config.forces.length === 0) {\n      throw new TypeError('TensorConfig.forces must be a non-empty array');\n    }\n    // Each value is one the axis registry names: `scales: ['nope']` used to build a tensor over\n    // an axis value nothing else in the library knows.\n    requireAxisValues('scales', config.scales, Axes.scale);\n    requireAxisValues('forces', config.forces, Axes.force);\n    if (config.symmetries !== undefined) requireAxisValues('symmetries', config.symmetries, Axes.symmetry);\n    if (config.informationMeasures !== undefined) {\n      requireAxisValues('informationMeasures', config.informationMeasures, Axes.information);\n    }\n\n    // Apply defaults\n    this.config = {\n      rank: config.rank,\n      scales: config.scales,\n      forces: config.forces,\n      symmetries: config.symmetries && config.symmetries.length > 0\n        ? config.symmetries\n        : ['poincare', 'gauge'],\n      informationMeasures: config.informationMeasures && config.informationMeasures.length > 0\n        ? config.informationMeasures\n        : ['vonNeumann', 'shannon'],\n      sparse: config.sparse ?? true,\n    };\n\n    this.knownLaws = new Map();\n    this.bridgeEquations = new Map();\n    this.emergentPhenomena = new Map();\n    this.tensorData = new Map();\n    this.fluxRules = V07_CELL_RULES;\n  }\n\n  /**\n   * Add a known physical law to the tensor.\n   * Returns true if newly added, false if it replaced an existing law with the same id.\n   * If replacing, stale cell entries from the previous law are removed first.\n   */\n  public addLaw(law: PhysicalLaw): boolean {\n    this.validateId(law.id, 'PhysicalLaw');\n    if (!(law.confidence >= 0 && law.confidence <= 1)) {\n      throw new RangeError(`PhysicalLaw.confidence must be in [0,1]; got ${law.confidence}`);\n    }\n    this.validateAxisMembership(law.scales, 'scales', this.config.scales);\n    this.validateAxisMembership(law.forces, 'forces', this.config.forces);\n    this.validateAxisMembership(law.symmetries, 'symmetries', this.config.symmetries);\n    this.validateAxisMembership(\n      law.informationMeasures,\n      'informationMeasures',\n      this.config.informationMeasures\n    );\n    this.validateFiniteIntegerArray(law.dimensions, 'dimensions');\n    this.validateFiniteIntegerArray(law.topologies, 'topologies');\n    const previous = this.knownLaws.get(law.id);\n    if (previous) {\n      // Remove stale cell entries from the prior version before writing new ones.\n      for (const scale of previous.scales) {\n        for (const force of previous.forces) {\n          this.removeFromCell(this.serializeIndices({ scale, force }), law.id);\n        }\n      }\n    }\n    this.knownLaws.set(law.id, law);\n\n    // Store in diagonal elements for all scale/force combinations.\n    // Multiple laws may occupy the same cell; we accumulate rather than overwrite.\n    for (const scale of law.scales) {\n      for (const force of law.forces) {\n        const key = this.serializeIndices({ scale, force });\n        this.addToCell(key, law.id);\n      }\n    }\n    return previous === undefined;\n  }\n\n  /**\n   * Add a bridge equation connecting regimes.\n   * Returns true if newly added, false if it replaced an existing bridge with the same id.\n   * If replacing, stale cell entries from the previous bridge are removed first.\n   */\n  public addBridge(bridge: BridgeEquation): boolean {\n    this.validateId(bridge.id, 'BridgeEquation');\n    if (!(bridge.confidence >= 0 && bridge.confidence <= 1)) {\n      throw new RangeError(`BridgeEquation.confidence must be in [0,1]; got ${bridge.confidence}`);\n    }\n    // Bridges are off-diagonal by definition — reject source == target\n    // (including the degenerate case where both are empty {}).\n    const sourceKey = this.serializeIndices(bridge.source);\n    const targetKey = this.serializeIndices(bridge.target);\n    if (sourceKey === targetKey) {\n      throw new RangeError(\n        `BridgeEquation source must differ from target in at least one index; id=${bridge.id}` +\n          (sourceKey === '' ? ' (both were empty {})' : '')\n      );\n    }\n    const previous = this.bridgeEquations.get(bridge.id);\n    if (previous) {\n      this.removeFromCell(this.bridgeCellKey(previous.source, previous.target), bridge.id);\n    }\n    this.bridgeEquations.set(bridge.id, bridge);\n\n    // Store in off-diagonal elements. Multiple bridges between the same\n    // source/target regime pair are accumulated in the same cell.\n    this.addToCell(this.bridgeCellKey(bridge.source, bridge.target), bridge.id);\n    return previous === undefined;\n  }\n\n  /**\n   * Reject empty or whitespace-only IDs — almost always caller error.\n   */\n  private validateId(id: string, kind: string): void {\n    if (typeof id !== 'string' || id.trim() === '') {\n      throw new TypeError(`${kind}.id must be a non-empty string`);\n    }\n  }\n\n  /**\n   * Reject axis values that are not declared in the tensor's config.\n   * Prevents silent drift between TensorConfig (declared axes) and actual stored content.\n   */\n  private validateAxisMembership<T extends string>(\n    values: readonly T[] | undefined,\n    axisName: string,\n    declared: readonly T[]\n  ): void {\n    if (!values) return;\n    for (const v of values) {\n      if (!declared.includes(v)) {\n        throw new RangeError(\n          `${axisName} value '${v}' is not declared in TensorConfig.${axisName}=[${declared.join(', ')}]`\n        );\n      }\n    }\n  }\n\n  /**\n   * Reject non-finite or non-integer numeric axis values (dimensions, topologies).\n   * Integer values (including 0, negative integers) are allowed;\n   * NaN, Infinity, and non-integers are rejected.\n   */\n  private validateFiniteIntegerArray(\n    values: readonly number[] | undefined,\n    axisName: string\n  ): void {\n    if (!values) return;\n    for (const v of values) {\n      if (!Number.isFinite(v) || !Number.isInteger(v)) {\n        throw new RangeError(\n          `${axisName} values must be finite integers; got ${v}`\n        );\n      }\n    }\n  }\n\n  /**\n   * Compose the cell key for a bridge equation's source→target indices.\n   */\n  private bridgeCellKey(source: TensorIndices, target: TensorIndices): string {\n    return this.serializeIndices(source) + ' -> ' + this.serializeIndices(target);\n  }\n\n  /**\n   * Accumulate an equation ID into the tensor cell at the given key.\n   * Creates a new Set if the cell is empty.\n   */\n  private addToCell(key: string, equationId: string): void {\n    let cell = this.tensorData.get(key);\n    if (!cell) {\n      cell = new Set();\n      this.tensorData.set(key, cell);\n    }\n    cell.add(equationId);\n  }\n\n  /**\n   * Remove an equation ID from a tensor cell. Prunes empty cells.\n   */\n  private removeFromCell(key: string, equationId: string): void {\n    const cell = this.tensorData.get(key);\n    if (!cell) return;\n    cell.delete(equationId);\n    if (cell.size === 0) this.tensorData.delete(key);\n  }\n\n  /**\n   * Add an emergent phenomenon.\n   * Returns true if newly added, false if it replaced an existing phenomenon.\n   */\n  public addEmergence(phenomenon: EmergentPhenomenon): boolean {\n    this.validateId(phenomenon.id, 'EmergentPhenomenon');\n    if (!Number.isInteger(phenomenon.order) || phenomenon.order < 3) {\n      throw new RangeError(\n        `EmergentPhenomenon.order must be an integer >= 3 (higher-order correlations); got ${phenomenon.order}`\n      );\n    }\n    if (!(phenomenon.confidence >= 0 && phenomenon.confidence <= 1)) {\n      throw new RangeError(\n        `EmergentPhenomenon.confidence must be in [0,1]; got ${phenomenon.confidence}`\n      );\n    }\n    const previous = this.emergentPhenomena.get(phenomenon.id);\n    if (previous) {\n      for (const indices of previous.indices) {\n        const key = this.serializeIndices(indices);\n        if (key) this.removeFromCell(key, phenomenon.id);\n      }\n    }\n    this.emergentPhenomena.set(phenomenon.id, phenomenon);\n\n    // Populate tensorData at each declared index-tuple, matching the L and B\n    // components' storage pattern so the Π = L + B + E decomposition is\n    // uniformly represented in the sparse tensor.\n    for (const indices of phenomenon.indices) {\n      const key = this.serializeIndices(indices);\n      if (key) this.addToCell(key, phenomenon.id);\n    }\n    return previous === undefined;\n  }\n\n  /**\n   * Add a typed `Cell` (LawCell, BridgeCell, or EmergenceCell) to the\n   * tensor. Dispatches by the cell's `kind` discriminator to the\n   * existing `addLaw` / `addBridge` / `addEmergence` paths via internal\n   * adapters that translate the string-vocabulary `confidence` to the\n   * legacy numeric range.\n   *\n   * Returns the same boolean the dispatched method returns: `true` if\n   * newly added, `false` if it replaced an existing entry with the same\n   * id.\n   *\n   * v0.7 Proposal 3 Phase 2 Task 2.1. Internal callers that want\n   * type-safe ingestion through the discriminated union use `addCell`;\n   * callers that want the old typed methods continue to use `addLaw` /\n   * `addBridge` / `addEmergence` directly.\n   *\n   * @public\n   */\n  public addCell(cell: Cell): boolean {\n    // v0.7-p2 Phase 2 Task 2.3: dispatch to legacy add method FIRST\n    // (catches structural-validation throws on bad inputs), then run\n    // flux rules. ERROR-tier diagnostics throw FluxViolationError and\n    // roll back the legacy add (fail-atomic per Decision #4). The add may\n    // REPLACE an entry with the same id, so the entry that was there is\n    // snapshotted first and put back on rollback; deleting the id would\n    // erase a good record because its replacement was bad.\n    const previous = this.snapshotEntry(cell);\n    let newlyAdded: boolean;\n    switch (cell.kind) {\n      case 'law':\n        newlyAdded = this.addLaw(cellToLaw(cell));\n        break;\n      case 'bridge':\n        newlyAdded = this.addBridge(cellToBridge(cell));\n        break;\n      case 'emergence':\n        newlyAdded = this.addEmergence(cellToEmergence(cell));\n        break;\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n        throw new Error(\n          `UniversalTensor.addCell: unknown cell kind: ${(cell as Cell).kind}`,\n        );\n      }\n    }\n\n    // Run rules. WARNING/INFO diagnostics are accumulated for the\n    // next fluxDiagnostics() call (recomputed on demand per Eve-R8\n    // — no mutable pendingDiagnostics field). ERROR-tier throws.\n    const report = runRules(cell, this.fluxRules);\n    if (report.errorCount > 0) {\n      const errDiag = report.diagnostics.find((d) => d.severity === 'error');\n      if (errDiag) {\n        // Roll back the legacy add before throwing (fail-atomic).\n        this.rollbackCell(cell, previous);\n        throw new FluxViolationError(errDiag.ruleName, errDiag.cellId, errDiag.message);\n      }\n    }\n    return newlyAdded;\n  }\n\n  /** The stored entry `cell.id` currently names in its own kind's map, if any. */\n  private snapshotEntry(cell: Cell): PreviousEntry | undefined {\n    switch (cell.kind) {\n      case 'law': {\n        const law = this.knownLaws.get(cell.id);\n        return law === undefined ? undefined : { kind: 'law', law };\n      }\n      case 'bridge': {\n        const bridge = this.bridgeEquations.get(cell.id);\n        return bridge === undefined ? undefined : { kind: 'bridge', bridge };\n      }\n      case 'emergence': {\n        const phenomenon = this.emergentPhenomena.get(cell.id);\n        return phenomenon === undefined ? undefined : { kind: 'emergence', phenomenon };\n      }\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n        return undefined;\n      }\n    }\n  }\n\n  /**\n   * Internal helper: roll back the legacy `addLaw`/`addBridge`/\n   * `addEmergence` storage for a cell that just failed a rule check.\n   * Removes the freshly stored entry and, when the add replaced an\n   * existing entry, stores that entry again through the same add path\n   * (it passed structural validation when it was first stored). Used by\n   * `addCell` to maintain fail-atomic semantics on ERROR-tier rule\n   * violations.\n   *\n   * @internal\n   */\n  private rollbackCell(cell: Cell, previous: PreviousEntry | undefined): void {\n    switch (cell.kind) {\n      case 'law': {\n        const law = this.knownLaws.get(cell.id);\n        if (!law) return;\n        this.knownLaws.delete(cell.id);\n        for (const scale of law.scales) {\n          for (const force of law.forces) {\n            this.removeFromCell(this.serializeIndices({ scale, force }), cell.id);\n          }\n        }\n        if (previous?.kind === 'law') this.addLaw(previous.law);\n        return;\n      }\n      case 'bridge': {\n        const bridge = this.bridgeEquations.get(cell.id);\n        if (!bridge) return;\n        this.bridgeEquations.delete(cell.id);\n        this.removeFromCell(this.bridgeCellKey(bridge.source, bridge.target), cell.id);\n        if (previous?.kind === 'bridge') this.addBridge(previous.bridge);\n        return;\n      }\n      case 'emergence': {\n        const ph = this.emergentPhenomena.get(cell.id);\n        if (!ph) return;\n        this.emergentPhenomena.delete(cell.id);\n        for (const indices of ph.indices) {\n          const key = this.serializeIndices(indices);\n          if (key) this.removeFromCell(key, cell.id);\n        }\n        if (previous?.kind === 'emergence') this.addEmergence(previous.phenomenon);\n        return;\n      }\n      default: {\n        const _exhaustive: never = cell;\n        void _exhaustive;\n      }\n    }\n  }\n\n  // -------------------------------------------------------------------------\n  // v0.7-p2 Phase 2 Tasks 2.1, 2.2, 2.3 — populated-cells query + flux\n  // -------------------------------------------------------------------------\n\n  /**\n   * Number of distinct (key, value) pairs in the underlying sparse\n   * storage. Counts UNIQUE coordinates that hold at least one entry.\n   *\n   * Note: a single multi-scale `LawCell` (e.g.\n   * `scales: ['quantum', 'classical']`, `forces: ['gravitational']`)\n   * fans out to 2 coordinates, so `populatedCount()` returns 2.\n   * Use `populatedCells()` for the deduped count of distinct `Cell`\n   * objects.\n   *\n   * @public\n   */\n  public populatedCount(): number {\n    return this.tensorData.size;\n  }\n\n  /**\n   * All cells currently in the tensor, deduplicated by `id`. Each\n   * underlying entry (law, bridge, emergence) is converted back to\n   * its `Cell` representation via the inverse adapters in `cell.ts`.\n   *\n   * Per Eve-R15 semantics: `populatedCells().length` is the count of\n   * distinct `Cell` objects (one per `id`). `populatedCount()` counts\n   * unique TENSOR COORDINATES (one per fan-out per Decision #6),\n   * which may be larger.\n   *\n   * @public\n   */\n  public populatedCells(): ReadonlyArray<Cell> {\n    const cells: Cell[] = [];\n    for (const law of this.knownLaws.values()) cells.push(lawToCell(law));\n    for (const bridge of this.bridgeEquations.values()) cells.push(bridgeToCell(bridge));\n    for (const ph of this.emergentPhenomena.values()) cells.push(emergenceToCell(ph));\n    return cells;\n  }\n\n  /**\n   * For each populated coordinate, enumerate the single-axis-flip\n   * neighbors that are NOT currently populated. Each \"neighbor\" is\n   * a `TensorIndices` value that differs from a populated coordinate\n   * in exactly one axis, where the differing axis value is drawn\n   * from the config-declared set for that axis (Decision #10).\n   *\n   * Integer axes (`dimension`, `topology`) are NOT enumerable from\n   * `TensorConfig` (no declared range exists) and are treated as\n   * wildcards — single-axis flips along those axes are NOT\n   * generated.\n   *\n   * Returns a deduplicated `ReadonlyArray<TensorIndices>` (no two\n   * elements serialize to the same key under `serializeIndices`).\n   *\n   * @public\n   */\n  public unpopulatedNeighborhoods(): ReadonlyArray<TensorIndices> {\n    const populated = new Set(this.tensorData.keys());\n    const unique = new Map<string, TensorIndices>();\n\n    for (const populatedKey of this.tensorData.keys()) {\n      const parsed = this.deserializeKey(populatedKey);\n      if (!parsed) continue;\n      for (const neighbor of this.enumerateAxisFlips(parsed)) {\n        const key = this.serializeIndices(neighbor);\n        if (key === '' || populated.has(key) || unique.has(key)) continue;\n        unique.set(key, neighbor);\n      }\n    }\n    return [...unique.values()];\n  }\n\n  /**\n   * Run the registered flux rules across every populated cell and\n   * return an aggregated `FluxReport`. Re-runs on every call\n   * (no cached `pendingDiagnostics` field — Eve-R8 resolution).\n   *\n   * @public\n   */\n  public fluxDiagnostics(): FluxReport {\n    const diagnostics: FluxDiagnostic[] = [];\n    let errorCount = 0;\n    let warningCount = 0;\n    let infoCount = 0;\n\n    for (const cell of this.populatedCells()) {\n      const report = runRules(cell, this.fluxRules);\n      diagnostics.push(...report.diagnostics);\n      errorCount += report.errorCount;\n      warningCount += report.warningCount;\n      infoCount += report.infoCount;\n    }\n    return { diagnostics, errorCount, warningCount, infoCount };\n  }\n\n  // -------------------------------------------------------------------------\n  // Phase 2 internal helpers\n  // -------------------------------------------------------------------------\n\n  /**\n   * Parse a key produced by `serializeIndices` back into a\n   * `TensorIndices` value. Returns null if the key includes a bridge\n   * separator (' -> '), since bridge keys are off-diagonal and don't\n   * correspond to a single `TensorIndices` coordinate.\n   *\n   * @internal\n   */\n  private deserializeKey(key: string): TensorIndices | null {\n    if (key.includes(' -> ')) return null; // bridge key — not a single coordinate\n    if (key === '') return {};\n    const out: { [k: string]: unknown } = {};\n    for (const part of key.split('|')) {\n      const colon = part.indexOf(':');\n      if (colon === -1) continue;\n      const axis = part.slice(0, colon);\n      const value = part.slice(colon + 1);\n      switch (axis) {\n        case 'scale': out.scale = value; break;\n        case 'force': out.force = value; break;\n        case 'sym': out.symmetry = value; break;\n        case 'info': out.information = value; break;\n        case 'dim': out.dimension = Number(value); break;\n        case 'topo': out.topology = Number(value); break;\n      }\n    }\n    return out as TensorIndices;\n  }\n\n  /**\n   * Enumerate single-axis-flip neighbors of `coord`. For each\n   * enumerable axis (scale, force, symmetry, information), generate\n   * a neighbor with that axis replaced by every OTHER config-declared\n   * value. The integer axes (dimension, topology) are wildcards\n   * and not enumerated.\n   *\n   * @internal\n   */\n  private *enumerateAxisFlips(coord: TensorIndices): Generator<TensorIndices> {\n    const axes: Array<{\n      key: keyof TensorIndices;\n      values: readonly string[];\n    }> = [\n      { key: 'scale', values: this.config.scales },\n      { key: 'force', values: this.config.forces },\n      { key: 'symmetry', values: this.config.symmetries },\n      { key: 'information', values: this.config.informationMeasures },\n    ];\n\n    for (const { key, values } of axes) {\n      if (coord[key] === undefined) continue;\n      for (const alt of values) {\n        if (alt === coord[key]) continue;\n        yield { ...coord, [key]: alt };\n      }\n    }\n  }\n\n  /**\n   * Return the IDs of laws and emergent phenomena stored at the diagonal cell\n   * addressed by the given indices.\n   * For bridge-equation cells (off-diagonal, source→target), use getBridgeCellContents instead.\n   */\n  public getCellContents(indices: TensorIndices): string[] {\n    const key = this.serializeIndices(indices);\n    const cell = this.tensorData.get(key);\n    return cell ? [...cell] : [];\n  }\n\n  /**\n   * Return the IDs of bridge equations stored at the off-diagonal cell\n   * addressed by the given source/target indices.\n   */\n  public getBridgeCellContents(source: TensorIndices, target: TensorIndices): string[] {\n    const key = this.bridgeCellKey(source, target);\n    const cell = this.tensorData.get(key);\n    return cell ? [...cell] : [];\n  }\n\n  /**\n   * Query tensor for laws applicable to specific regime\n   */\n  public queryLaws(indices: TensorIndices): PhysicalLaw[] {\n    const results: PhysicalLaw[] = [];\n\n    for (const law of this.knownLaws.values()) {\n      if (this.lawMatchesQuery(law, indices)) {\n        results.push(law);\n      }\n    }\n\n    return results;\n  }\n\n  /**\n   * Find bridge equations connecting two regimes\n   */\n  public findBridges(source: TensorIndices, target: TensorIndices): BridgeEquation[] {\n    const results: BridgeEquation[] = [];\n\n    for (const bridge of this.bridgeEquations.values()) {\n      if (\n        this.indicesMatch(bridge.source, source) &&\n        this.indicesMatch(bridge.target, target)\n      ) {\n        results.push(bridge);\n      }\n    }\n\n    return results;\n  }\n\n  /**\n   * Get all known laws\n   */\n  public getLaws(): PhysicalLaw[] {\n    return [...this.knownLaws.values()];\n  }\n\n  /**\n   * Get all bridge equations\n   */\n  public getBridges(): BridgeEquation[] {\n    return [...this.bridgeEquations.values()];\n  }\n\n  /**\n   * Get all emergent phenomena\n   */\n  public getEmergence(): EmergentPhenomenon[] {\n    return [...this.emergentPhenomena.values()];\n  }\n\n  /**\n   * Get tensor statistics\n   */\n  public getStats() {\n    // occupiedCells = number of distinct (diagonal or off-diagonal) tensor cells\n    // that hold at least one equation ID. Each cell may hold multiple IDs (Set).\n    let totalEntries = 0;\n    for (const cell of this.tensorData.values()) totalEntries += cell.size;\n    return {\n      rank: this.config.rank,\n      knownLaws: this.knownLaws.size,\n      bridgeEquations: this.bridgeEquations.size,\n      emergentPhenomena: this.emergentPhenomena.size,\n      occupiedCells: this.tensorData.size,\n      totalEntries,\n      sparse: this.config.sparse,\n    };\n  }\n\n  /**\n   * Serialize tensor indices to string key.\n   * Uses !== undefined checks so that dimension/topology values of 0\n   * (e.g., trivial winding number, genus-0 surface) are preserved.\n   */\n  private serializeIndices(indices: TensorIndices): string {\n    const parts: string[] = [];\n\n    if (indices.scale !== undefined) parts.push(`scale:${indices.scale}`);\n    if (indices.force !== undefined) parts.push(`force:${indices.force}`);\n    if (indices.symmetry !== undefined) parts.push(`sym:${indices.symmetry}`);\n    if (indices.information !== undefined) parts.push(`info:${indices.information}`);\n    if (indices.dimension !== undefined) parts.push(`dim:${indices.dimension}`);\n    if (indices.topology !== undefined) parts.push(`topo:${indices.topology}`);\n\n    return parts.join('|');\n  }\n\n  /**\n   * Check if a law matches query indices.\n   * If the query specifies an index dimension that the law does not declare\n   * (e.g., the law has no informationMeasures but the query asks for one),\n   * the law is excluded — querying on an undeclared index cannot match.\n   */\n  private lawMatchesQuery(law: PhysicalLaw, query: TensorIndices): boolean {\n    if (query.scale && !law.scales.includes(query.scale)) {\n      return false;\n    }\n\n    if (query.force && !law.forces.includes(query.force)) {\n      return false;\n    }\n\n    if (query.symmetry && !law.symmetries.includes(query.symmetry)) {\n      return false;\n    }\n\n    if (query.information) {\n      if (!law.informationMeasures || !law.informationMeasures.includes(query.information)) {\n        return false;\n      }\n    }\n\n    if (query.dimension !== undefined) {\n      if (!law.dimensions || !law.dimensions.includes(query.dimension)) {\n        return false;\n      }\n    }\n\n    if (query.topology !== undefined) {\n      if (!law.topologies || !law.topologies.includes(query.topology)) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Check if two tensor indices match\n   */\n  private indicesMatch(a: TensorIndices, b: TensorIndices): boolean {\n    if (b.scale && a.scale !== b.scale) {\n      return false;\n    }\n\n    if (b.force && a.force !== b.force) {\n      return false;\n    }\n\n    if (b.symmetry && a.symmetry !== b.symmetry) {\n      return false;\n    }\n\n    if (b.information && a.information !== b.information) {\n      return false;\n    }\n\n    if (b.dimension !== undefined && a.dimension !== b.dimension) {\n      return false;\n    }\n\n    if (b.topology !== undefined && a.topology !== b.topology) {\n      return false;\n    }\n\n    return true;\n  }\n}\n\n/**\n * Factory: build a populated `UniversalTensor` from three typed cell\n * arrays plus a `TensorConfig`.\n *\n * Makes the \"'+' in Π = L + B + E is disjoint union, not algebraic\"\n * invariant concrete: the only way to construct a populated\n * `UniversalTensor` from typed cells is to pass three typed arrays.\n * There is no `add(c1: Cell, c2: Cell): Cell` because cells never\n * compose at the cell level — composition happens at the tensor\n * level (Proposals 2 and 6 territory).\n *\n * **Provenance note**: the proposals doc §4.2 line 299 sketches\n * `compose(L, B, E): UniversalTensor` without a `config` argument.\n * This signature closes a proposals-doc gap — `UniversalTensor`'s\n * constructor requires `rank` / `scales` / `forces`, none of which\n * can be inferred from the three cell arrays alone. `compose` is\n * this sprint's invention, not a proposals-doc commitment.\n *\n * Co-located with `UniversalTensor` (moved from `cell.ts`, 2026-06-19) to\n * break the `tensor.ts ↔ cell.ts` RUNTIME import cycle: `cell.ts` now depends\n * on `tensor.ts` for types only, while this factory — the one cell-side symbol\n * that instantiated `UniversalTensor` at runtime — lives beside the class.\n *\n * @public\n */\nexport function compose(\n  laws: ReadonlyArray<LawCell>,\n  bridges: ReadonlyArray<BridgeCell>,\n  emergences: ReadonlyArray<EmergenceCell>,\n  config: TensorConfig,\n): UniversalTensor {\n  const tensor = new UniversalTensor(config);\n  for (const law of laws) tensor.addCell(law);\n  for (const bridge of bridges) tensor.addCell(bridge);\n  for (const emergence of emergences) tensor.addCell(emergence);\n  return tensor;\n}\n"]}

package/dist/core/types.d.ts

@@ -125,13 +125,13 @@ export declare const PhysicalConstants: {
     readonly c: 299792458;
     readonly h: 6.62607015e-34;
     readonly hbar: number;
-    readonly G: 6.6743e-11;
+    readonly G: number;
     readonly kB: 1.380649e-23;
     readonly e: 1.602176634e-19;
-    readonly alpha: 0.0072973525693;
-    readonly lP: 1.616255e-35;
-    readonly tP: 5.391247e-44;
-    readonly mP: 2.176434e-8;
+    readonly alpha: number;
+    readonly lP: number;
+    readonly tP: number;
+    readonly mP: number;
     readonly H0: number;
 };
 //# sourceMappingURL=types.d.ts.map

package/dist/diff/bridge-ast-gradient.d.ts

@@ -1,25 +1,24 @@
 /**
- * Exact bridge-gradients via reverse-mode AD over the symbolic RHS AST.
+ * Exact bridge-gradients over the symbolic RHS AST.
  *
  * The catalog's plain-JS evaluators cannot be differentiated by AD (they run
  * raw `Math.*` arithmetic and return a number, which carries no tape; see
  * `bridge-gradient.ts`). But each bridge also carries a faithful symbolic
  * encoding of its RHS (`*_RHS: ExprNode`). This module lowers that scalar AST
- * through `@danielsimonjr/mathts-autograd`'s `TapedTensor` ops — binding the
- * chosen variable to a traced input and every other symbol to a constant tape
- * leaf — so `reverseGrad` returns the EXACT derivative (machine precision), with
- * the plain-JS evaluators left untouched (P8 Decision #1).
+ * with the MathTS scalar builder and differentiates it with MathTS
+ * `compileScalarGradient`: the chosen variable is the one parameter, and every
+ * other symbol is a constant. The result is the EXACT derivative (machine
+ * precision); the plain-JS evaluators stay untouched (P8 Decision #1).
  *
- * Scope: the dimensional scalar grammar is `symbol` + `op(+ − * / ^)` (the
- * transcendentals of a bridge are absorbed into typed-stub *symbols*, so they
- * appear as opaque constants here). A bridge encoded with a typed stub therefore
- * differentiates with respect to the stub, not the physics inside it — faithful,
- * fully-expanded encodings (e.g. BE-42 `ℏc³/(8πGM·k_B)`) differentiate exactly.
- * `^` exponents must be constant (the differentiation variable may not appear in
- * an exponent).
+ * Scope: the scalar grammar is `symbol` + `op(+ − * / ^)` + `transcendental` +
+ * `abs`. A bridge encoded with a typed stub differentiates with respect to the
+ * stub, not the physics inside it; fully-expanded encodings (e.g. BE-42
+ * `ℏc³/(8πGM·k_B)`) differentiate exactly. A `^` exponent must be constant: a
+ * UPT pre-check refuses the differentiation variable in an exponent before
+ * MathTS sees the tree.
  *
- * Loads `@danielsimonjr/mathts-autograd` at the call and throws
- * `EngineCapabilityError` when that import fails.
+ * A point where the value overflows gives `NaN` for the value and the
+ * gradient (MathTS marks the row invalid), not `±Infinity`.
  *
  * @module diff/bridge-ast-gradient
  */
@@ -35,31 +34,36 @@ export interface ASTGradientResult {
     readonly gradient: number;
 }
 /**
- * Differentiate a scalar bridge RHS AST with respect to one symbol via
- * reverse-mode AD. Every symbol other than `varName` is resolved to a constant
- * (caller `bindings`, then {@link NAMED_CONSTANTS}, then numeric literal); the
- * `bindings` must contain `varName` (its value sets the point of evaluation).
+ * Differentiate a scalar bridge RHS AST with respect to one symbol through
+ * MathTS `compileScalarGradient`. Every symbol other than `varName` is resolved
+ * to a constant (caller `bindings`, then {@link NAMED_CONSTANTS}, then numeric
+ * literal); the `bindings` must contain `varName` (its value sets the point of
+ * evaluation).
  *
+ * @throws TypeError when `varName` is not bound, a symbol cannot be resolved,
+ * `varName` appears in an exponent, or a node kind is outside the scalar grammar.
  * @public
  */
-export declare function bridgeGradientAST(rhs: ExprNode, varName: string, bindings: Record<string, number>): Promise<ASTGradientResult>;
+export declare function bridgeGradientAST(rhs: ExprNode, varName: string, bindings: Record<string, number>): ASTGradientResult;
 /**
  * Convenience wrapper around {@link bridgeGradientAST} that looks the RHS AST up
  * by catalog bridge id. `bridgeId` accepts a number, `'42'`, or `'BE-42'`.
  *
  * Throws if the id has no encoded RHS in {@link BRIDGE_RHS_BY_ID} (e.g. BE-51/52,
  * which are closed-form evaluators without an AST). If the bridge's RHS is not in
- * the differentiable scalar grammar (a tensor/integral/curvature encoding), the
+ * the differentiable scalar grammar (a tensor, integral or curvature encoding), the
  * delegated `bridgeGradientAST` throws the "unsupported node kind" error — use
  * {@link astDifferentiableBridgeIds} to discover which ids are AD-eligible.
  *
  * @public
  */
-export declare function bridgeGradientASTById(bridgeId: number | string, varName: string, bindings: Record<string, number>): Promise<ASTGradientResult>;
+export declare function bridgeGradientASTById(bridgeId: number | string, varName: string, bindings: Record<string, number>): ASTGradientResult;
 /**
  * The catalog bridge ids whose encoded RHS lies entirely in the differentiable
- * scalar grammar — i.e. those `bridgeGradientASTById` can differentiate exactly.
- * Bridges encoded with tensor/integral/curvature nodes (or whose physics is
+ * scalar grammar. `bridgeGradientASTById` differentiates each of them exactly
+ * with respect to any variable that is not in an exponent; a variable in an
+ * exponent is refused (`checkExponents`).
+ * Bridges encoded with tensor, integral or curvature nodes (or whose physics is
  * hidden behind a typed-stub symbol) are excluded from EXACT differentiation
  * (a stub still differentiates w.r.t. the stub symbol, but not the physics
  * inside it). Returned sorted ascending.

package/dist/diff/bridge-ast-gradient.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bridge-ast-gradient.d.ts","sourceRoot":"","sources":["../../src/diff/bridge-ast-gradient.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAoB,MAAM,6BAA6B,CAAC;AAM9E;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AA2ID;;;;;;;GAOG;AACH,wBAAsB,iBAAiB,CACrC,GAAG,EAAE,QAAQ,EACb,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CAgI5B;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,MAAM,GAAG,MAAM,EACzB,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CAU5B;AAwBD;;;;;;;;;GASG;AACH,wBAAgB,0BAA0B,IAAI,MAAM,EAAE,CAMrD"}
+{"version":3,"file":"bridge-ast-gradient.d.ts","sourceRoot":"","sources":["../../src/diff/bridge-ast-gradient.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAM5D;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAgFD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,QAAQ,EACb,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,iBAAiB,CAkCnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,MAAM,GAAG,MAAM,EACzB,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC/B,iBAAiB,CAUnB;AAaD;;;;;;;;;;;GAWG;AACH,wBAAgB,0BAA0B,IAAI,MAAM,EAAE,CAMrD"}