@smthrs/plan 0.0.0-stage → 1.0.0-rc.12

package/dist/esm/Plan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Plan.js","sourceRoot":"","sources":["../../src/Plan.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,cAAc,CAAA;AAEpD,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,WAAW,MAAM,oBAAoB,CAAA;AACjD,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AACvC,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AACtD,OAAO,KAAK,SAAS,MAAM,kCAAkC,CAAA;AAC7D,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAA;AACrD,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAC/C,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AAEvC;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;IACvC,8FAA8F;IAC9F,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC;IAC5C,iFAAiF;IACjF,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;IACzC;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACvD,4DAA4D;IAC5D,YAAY,EAAE,OAAO,CAAC,YAAY;CACnC,CAAC,CAAA;AAUF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC,gBAAgB,CAAA;AAUpD;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC,CAAA;AAU9E,eAAe;AACf,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAA;AAE5D;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;IAC9C,IAAI,EAAE,MAAM,CAAC,cAAc;IAC3B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;IAClC,QAAQ,EAAE,YAAY;IACtB,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAUF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,EAAE,EAAE,MAAM,CAAC,cAAc;IACzB,IAAI,EAAE,QAAQ;IACd,GAAG,EAAE,SAAS;IACd,QAAQ,EAAE,WAAW,CAAC,WAAW;IACjC,OAAO,EAAE,WAAW;IACpB,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC;IAC9C,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC;IAC3C,QAAQ,EAAE,YAAY;IACtB,OAAO,EAAE,eAAe;IACxB,QAAQ,EAAE,MAAM,CAAC,GAAG;IACpB,UAAU,EAAE,MAAM,CAAC,GAAG;CACvB,CAAC,CAAA;AAUF;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAChC,MAAM,EAAE,MAAM,CAAC,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC,cAAc;IAC3B,UAAU,EAAE,MAAM,CAAC,GAAG;IACtB,UAAU,EAAE,SAAS;IACrB,MAAM,EAAE,SAAS;IACjB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC;CAC9B,CAAC,CAAA;AAiCF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,SAAU,SAAQ,MAAM,CAAC,WAAW,EAAa,CAAC,wBAAwB,EAAE;IACvF,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC;QACpB,OAAO;QACP,oBAAoB;QACpB,gBAAgB;QAChB,mBAAmB;QACnB,iBAAiB;QACjB,cAAc;QACd,cAAc;QACd,iBAAiB;KAClB,CAAC;IACF,OAAO,EAAE,MAAM,CAAC,MAAM;CACvB,CAAC;CAAG;AAEL;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAA;AAEtC,eAAe;AACf,MAAM,cAAc,GAAG,CAAC,IAAY,EAAa,EAAE,CACjD,IAAI,SAAS,CAAC;IACZ,IAAI,EAAE,iBAAiB;IACvB,OAAO,EAAE,8BAA8B,gBAAgB,oBAAoB,IAAI,EAAE;CAClF,CAAC,CAAA;AAOJ;;;;;GAKG;AACH,MAAM,WAAW,GAAG,CAAC,MAAgC,EAAE,KAA0B,EAAW,EAAE;IAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;IAC9D,MAAM,OAAO,GAAqB,EAAE,CAAA;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAA;IAMpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,MAAM;YAAE,SAAQ;QAC5C,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,UAAU,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAiB,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QACxG,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAA;YACtC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;gBAC7C,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;gBACjC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;gBACzB,KAAK,CAAC,GAAG,EAAE,CAAA;gBACX,SAAQ;YACV,CAAC;YACD,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAE,CAAA;YACpD,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAQ;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YACjC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO;oBACL,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,IAAI,SAAS,CAAC;wBACnB,IAAI,EAAE,oBAAoB;wBAC1B,OAAO,EAAE,QAAQ,KAAK,CAAC,KAAK,CAAC,EAAE,4BAA4B,UAAU,EAAE;qBACxE,CAAC;iBACH,CAAA;YACH,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC/B,IAAI,IAAI,KAAK,MAAM;gBAAE,SAAQ;YAC7B,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;gBACxB,OAAO;oBACL,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,2BAA2B,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC;iBACvF,CAAA;YACH,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAA;YAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QAC7F,CAAC;IACH,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAA;AACtC,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,QAAQ,GAAG,CACf,KAA8B,EAC9B,MAA2B,EAC3B,iBAAiB,GAAG,KAAK,EAC0B,EAAE,CACrD,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC,IAAI,CAC5D,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC,EACpD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,CACrC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;IACjB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAA;IACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;IACzC,OAAO,UAAU,CAAC;QAChB,GAAG,IAAI;QACP,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;QACvC,SAAS,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,CAAC;KAC/E,CAAC,CAAA;AACJ,CAAC,CAAC,CACH,CACF,CAAA;AAEH;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,CACtB,MAAc,EACd,IAAY,EACZ,KAA8B,EAC9B,EAAE,CAAC,CAAC;IACJ,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE;IACpC,MAAM,EAAE;QACN,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC1B,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CAAC;KACJ;IACD,MAAM,EAAE,EAAE;IACV,YAAY,EAAE,EAAE;CACjB,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,QAAQ,GAAG,CACf,MAAc,EACd,IAAY,EACZ,KAA8B,EACgE,EAAE,CAChG,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;AAEvD,eAAe;AACf,MAAM,wBAAwB,GAAG,GAAG,CAAA;AAEpC,eAAe;AACf,MAAM,aAAa,GAAG,CAAC,KAAc,EAAU,EAAE;IAC/C,MAAM,QAAQ,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC1G,OAAO,QAAQ,CAAC,MAAM,GAAG,wBAAwB;QAC/C,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,GAAG,CAAC,CAAC,KAAK;QACzD,CAAC,CAAC,QAAQ,CAAA;AACd,CAAC,CAAA;AAED,eAAe;AACf,MAAM,cAAc,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,wBAAwB,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;AAE5G,eAAe;AACf,MAAM,gBAAgB,GAAG,CAAC,MAAe,EAAE,IAAa,EAAyB,EAAE;IACjF,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtD,OAAO,IAAI,SAAS,CAAC;YACnB,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,2DAA2D,aAAa,CAAC,MAAM,CAAC,EAAE;SAC5F,CAAC,CAAA;IACJ,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,OAAO,IAAI,SAAS,CAAC;YACnB,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,yDAAyD,aAAa,CAAC,IAAI,CAAC,EAAE;SACxF,CAAC,CAAA;IACJ,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,kEAAkE;AAClE,MAAM,mBAAmB,GAAG,CAAC,KAAc,EAAmB,EAAE;IAC9D,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAC7D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAA;IAC9C,OAAO,SAAS,KAAK,MAAM,CAAC,SAAS,IAAI,SAAS,KAAK,IAAI,CAAA;AAC7D,CAAC,CAAA;AAED,kFAAkF;AAClF,MAAM,aAAa,GAAG,CAAC,MAAc,EAAU,EAAE,CAC/C,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAW,CAAA;AAErF;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAG,CAAmB,KAAQ,EAAK,EAAE;IACjD,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,CAAA;IACjC,MAAM,IAAI,GAAG,IAAI,OAAO,CAAiB,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;IACzD,MAAM,OAAO,GAAgE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;IAC9G,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,CAAA;IAEtB,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,EAAG,CAAA;QACzC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,GAAG,CAAE,CAAA;YAChE,IAAI,OAAO,IAAI,UAAU,IAAI,mBAAmB,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;gBACtC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,GAAG,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;oBACvC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;oBACjC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAA;oBACzD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACrB,CAAC;gBACD,UAAU,CAAC,KAAK,GAAG,KAAK,CAAA;YAC1B,CAAC;YACD,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,UAAU,CAAC,CAAA;QAChD,CAAC;IACH,CAAC;IAED,KAAK,MAAM,SAAS,IAAI,OAAO;QAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;IACzD,OAAO,IAAS,CAAA;AAClB,CAAC,CAAA;AAED,mFAAmF;AACnF,MAAM,UAAU,GAAG,CAAC,IAAc,EAAY,EAAE,CAC9C,MAAM,CAAC,MAAM,CAAC;IACZ,GAAG,IAAI;IACP,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7C,SAAS,EAAE,MAAM,CAAC,MAAM,CACtB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAC5G;CACF,CAAC,CAAA;AAEJ,0EAA0E;AAC1E,MAAM,WAAW,GAAG,IAAI,OAAO,EAAQ,CAAA;AAEvC,+DAA+D;AAC/D,MAAM,UAAU,GAAG,CAAC,IAAU,EAAQ,EAAE;IACtC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;IAChF,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACvB,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED;;;;;;;;GAQG;AACH,MAAM,cAAc,GAAG,CACrB,MAAgC,EACoB,EAAE,CACtD,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAC/B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,IAAI,OAAO,KAAK,CAAC,EAAE,KAAK,QAAQ,IAAI,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,gDAAgD,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;SACnF,CAAC,CACH,CAAA;IACH,CAAC;IACD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACvC,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1E,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,QAAQ,MAAM,8CAA8C,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE;SACrG,CAAC,CACH,CAAA;IACH,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACjE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,QAAQ,MAAM,iDAAiD,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;SACpG,CAAC,CACH,CAAA;IACH,CAAC;IACD,IAAI,KAAK,CAAC,gBAAgB,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAC7F,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,QAAQ,MAAM,gEACrB,aAAa,CAAC,KAAK,CAAC,gBAAgB,CACtC,EAAE;SACH,CAAC,CACH,CAAA;IACH,CAAC;IACD,IAAI,KAAK,CAAC,eAAe,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC;QAC9F,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,QAAQ,MAAM,iEACrB,aAAa,CAAC,KAAK,CAAC,eAAe,CACrC,EAAE;SACH,CAAC,CACH,CAAA;IACH,CAAC;IACD,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CACrG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,SAAS,CAAC;QACZ,IAAI,EAAE,cAAc;QACpB,OAAO,EAAE,QAAQ,MAAM,0BAA0B,KAAK,CAAC,OAAO,EAAE;KACjE,CAAC,CACH,CACF,CAAA;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CACvF,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CACxB,IAAI,SAAS,CAAC;QACZ,IAAI,EAAE,cAAc;QACpB,OAAO,EAAE,QAAQ,MAAM,yBAAyB,KAAK,CAAC,OAAO,EAAE;KAChE,CAAC,CACH,CACF,CAAA;IACD,IAAI,QAAiC,CAAA;IACrC,IAAI,CAAC;QACH,QAAQ,GAAG,QAAQ,CACjB,UAAU,CAAC,EAAE,GAAG,eAAe,EAAE,OAAO,EAAE,cAAc,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAA4B,CAC7G,CAAA;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,KAAK,YAAY,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;QAC/D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;YACZ,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,QAAQ,MAAM,oCAAoC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;SACtF,CAAC,CACH,CAAA;IACH,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,GAAG,KAAK;QACR,QAAQ;QACR,OAAO,EAAE,QAAQ,CAAC,OAAsB;KACzC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAC,CAAA;AAEP;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,CAAC,EAAU,EAAE,OAAoB,EAAyB,EAAE;IAClF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAA;IACrC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7C,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;YAC7D,OAAO,IAAI,SAAS,CAAC;gBACnB,IAAI,EAAE,iBAAiB;gBACvB,OAAO,EAAE,QAAQ,EAAE,aAAa,OAAO,gCAAgC;aACxE,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,eAAe;AACf,MAAM,QAAQ,GAAG,CACf,MAAgC,EAChC,QAAiC,EACjC,UAAkB,EAKlB,EAAE,CACF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,OAAO,GAA2B,MAAM,CAAC,MAAM,CAAC,IAAI,CAA2B,CAAA;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE;YACtC,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,IAAI;YAChB,KAAK,EAAE,IAAI,CAAC,GAAG;YACf,QAAQ,EAAE,IAAI;SACf,CAAC,CAAA;QACF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACpB,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,QAAQ,KAAK,CAAC,EAAE,yBAAyB,EAAE,CAAC,CAC9F,CAAA;QACH,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACrB,CAAC;IACD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC5E,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACvD,MAAM,KAAK,GAAoB,EAAE,CAAA;IACjC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,CAAA;QACxD,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC7D,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;QAChE,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE;YACvC,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,IAAI;YAChB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,IAAI;SACf,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;YACpB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,MAAM;YAC1B,GAAG;YACH,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,SAAS,EAAE,WAAW,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC;YACnD,SAAS,EAAE,EAAE;YACb,QAAQ,EAAE,KAAK,CAAC,gBAAgB,IAAI,WAAW;YAC/C,OAAO,EAAE,KAAK,CAAC,eAAe,IAAI,cAAc;YAChD,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,CAAC;YAC7B,UAAU;SACX,CAAC,CAAC,CAAA;IACL,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAC,CAAA;AAEJ;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,OAIvB,EAAiG,EAAE;IAClG,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;IAClC,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,eAAe,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;QACxE,IAAI,eAAe,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;QAC7E,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,gBAAgB;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;QAC9G,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;QAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACrE,OAAO,UAAU,CAAC;YAChB,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,MAAM;YAClB,MAAM;YACN,KAAK;SACN,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,IAAU,EACV,MAAgC,EAC+D,EAAE;IACjG,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAC/D,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAA;IACvC,OAAO,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QACzB,MAAM,eAAe,GAAG,gBAAgB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;QAC1E,IAAI,eAAe,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;QAC7E,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;QAC7C,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAA;QAClE,IAAI,QAAQ,GAAG,gBAAgB;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAA;QACpF,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,cAAc,CAAC,CAAA;QACvD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;gBACZ,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,QAAQ,YAAY,CAAC,MAAM,qCAAqC;aAC1E,CAAC,CACH,CAAA;QACH,CAAC;QACD,MAAM,UAAU,GAAG,YAAY,CAAC,UAAU,GAAG,CAAC,CAAA;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;QACxE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAC3B,CAAC,GAAG,YAAY,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,EACjC,IAAI,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CACnD,CAAA;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC7E,OAAO,UAAU,CAAC,EAAE,GAAG,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAA;IACnE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CACpB,KAAc,EACiF,EAAE,CACjG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC,KAAa,CAAC;QAAE,OAAO,KAAa,CAAA;IACvG,qEAAqE;IACrE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAClG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,gBAAgB;YAAE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAA;IAC1G,CAAC;IACD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAA;IAC9D,MAAM,OAAO,GAAG,CAAC,OAAe,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAA;IACrF,IACE,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAChH,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,OAAO,CAAC,yFAAyF,CAAC,CACnG,CAAA;IACH,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC7C,IAAI,QAAQ,GAAG,CAAC,CAAA;IAChB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,QAAQ,IAAI,IAAI,CAAC,UAAU,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC3G,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,EAAE,4CAA4C,CAAC,CAAC,CAAA;QACjG,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QACzC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAA;IAC5B,CAAC;IACD,IAAI,QAAQ,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,iDAAiD,CAAC,CAAC,CAAA;IACvF,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACjC,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjE,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YAC9C,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC7D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,CAAC,EAAE,gCAAgC,CAAC,CAAC,CAAA;YACrF,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAChE,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,gBAAgB,EAAE,IAAI,CAAC,QAAQ;QAC/B,eAAe,EAAE,IAAI,CAAC,OAAO;QAC7B,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC,CAAC,CAAC,CAAA;IACJ,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAC1D,UAAU,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,EAAE,CAAC,CAC/D,CAAA;IACD,wEAAwE;IACxE,yEAAyE;IACzE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,CAAA;IACrD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAA;IAC/G,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC3G,IAAI,OAAO,CAAC,UAAU,KAAK,UAAU,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QACnE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,0DAA0D,CAAC,CAAC,CAAA;IAChG,CAAC;IACD,yEAAyE;IACzE,0EAA0E;IAC1E,MAAM,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAA;IACnD,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC1D,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,OAAO,CAAC,gFAAgF,CAAC,CAC1F,CAAA;IACH,CAAC;IACD,OAAO,UAAU,CAAC,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,CAAC,CAAA;AAC1C,CAAC,CAAC,CAAA;AAEJ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,IAAU,EAA2B,EAAE,CACrE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU,CAAC,CAAA;AAElE;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAiB,EAAE,CAC1D,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC,KAAa,CAAC,CAAA;AAE/E;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,IAAU,EACoF,EAAE,CAChG,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAA","sourcesContent":["/**\n * The plan: a node graph with every step key computed, inert until run.\n *\n * The way a plan is produced is a law: **planning performs no I/O**.\n * Everything in this module is therefore a pure function of declarations plus\n * the injected `Crypto` service: no filesystem, no clock, no network. A node's\n * key is a function of what it consumes, so an edited declaration re-keys that\n * node and everything downstream of it, and nothing else. That is the entire\n * invalidation mechanism. Invalidation is re-keying, which **rejects**\n * Skyframe's reverse-dependency index and invalidating node visitor outright\n * because content addressing subsumes them. Key invalidation never retains a\n * reverse-dependency index; annotation uses only a temporary reachability cache.\n *\n * Growth is append-only: {@link append} adds a pre-keyed subgraph to the same\n * plan and never rewrites a node already in it.\n *\n * @since 0.1.0\n */\n\nimport { DerivedKey, StoredKey } from \"@smthrs/keys\"\nimport type * as Crypto from \"effect/Crypto\"\nimport * as Effect from \"effect/Effect\"\nimport * as Inspectable from \"effect/Inspectable\"\nimport * as Schema from \"effect/Schema\"\nimport * as Effects from \"./Effects.ts\"\nimport * as FileSet from \"./FileSet.ts\"\nimport { GraphBuildError } from \"./GraphBuildError.ts\"\nimport * as Conflicts from \"./internal/ConflictAnnotation.ts\"\nimport { jsonMirror } from \"./internal/JsonMirror.ts\"\nimport * as KeyMaterial from \"./KeyMaterial.ts\"\nimport * as StepKey from \"./StepKey.ts\"\n\n/**\n * What a node does to the world, declared. Paths only — measuring them is\n * run-time work, so a digest here would break the no-I/O law.\n *\n * Decoding fails with a `SchemaError` when a path is not workspace-relative.\n * {@link compile} also refuses a node whose `removes` overlaps its `writes`\n * with an `invalid_effects` {@link PlanError}.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const NodeEffects = Schema.Struct({\n  /** Paths the node reads. A read orders the node after every writer of an overlapping path. */\n  reads: Schema.Array(FileSet.ReadDeclaration),\n  /** Paths the node writes. Two writers of an overlapping path form a conflict. */\n  writes: Schema.Array(FileSet.Declaration),\n  /**\n   * Paths the node declares it will DELETE. A removal mutates the world exactly\n   * as a write does, so {@link produces} folds the two together and both the\n   * conflict pass and the reader-after-writer pass see them as one set.\n   */\n  removes: Schema.optional(Schema.Array(FileSet.Pattern)),\n  /** How strictly the sandbox enforces these declarations. */\n  boundaryMode: FileSet.BoundaryMode\n})\n\n/**\n * The value form of {@link NodeEffects}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type NodeEffects = typeof NodeEffects.Type\n\n/**\n * The plan-time verdict for two writers of an overlapping path:\n * `serialize` gives the later writer an ordering edge, `lane` records a lane\n * annotation on both writers and adds no edge, and `fail` refuses the plan\n * with `overlap_forbidden`. For a pair, `fail` dominates `lane`, which\n * dominates `serialize`. The same schema as `Effects.ConflictStrategy`.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const PairStrategy = Effects.ConflictStrategy\n\n/**\n * The value form of {@link PairStrategy}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type PairStrategy = typeof PairStrategy.Type\n\n/**\n * The runtime half of a conflict annotation: what the scheduler\n * does when the overlap the plan predicted actually bites, or when a\n * scheduled node's inputs are invalidated under it. For a pair,\n * `stop-merge` dominates `delay-rebase`.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const RuntimeStrategy = Schema.Literals([\"delay-rebase\", \"stop-merge\"])\n\n/**\n * The value form of {@link RuntimeStrategy}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type RuntimeStrategy = typeof RuntimeStrategy.Type\n\n/** @private */\nconst NodeKind = Schema.Literals([\"step\", \"agent\", \"merge\"])\n\n/**\n * One resolved overlap between two writers that no dependency path already\n * orders. Conflict is a property of the PAIR, not of one declaration.\n *\n * `with` names the other node, `paths` lists the overlapping declarations,\n * and `strategy` and `runtime` are the verdicts resolved for the pair.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const ConflictAnnotation = Schema.Struct({\n  with: Schema.NonEmptyString,\n  paths: Schema.Array(Schema.String),\n  strategy: PairStrategy,\n  runtime: RuntimeStrategy\n})\n\n/**\n * The value form of {@link ConflictAnnotation}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type ConflictAnnotation = typeof ConflictAnnotation.Type\n\n/**\n * A keyed node of the plan.\n *\n * `dependsOn` is the *edge* set: material references, any ordering edge a\n * `serialize` verdict added, and the reader-after-writer edges that put a\n * node behind whoever produces the paths it reads. Ordering edges are\n * deliberately NOT part of the key — a node ordered behind another still\n * computes the same result, so re-keying it would throw away a legitimate\n * cache hit.\n *\n * `strategy` and `runtime` are this declaration's own preferences, recorded so\n * a later elaboration can resolve a pair against them without re-reading the\n * flow source.\n *\n * `generation` is 0 for nodes from {@link compile} and grows by one with each\n * {@link append}.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const PlanNode = Schema.Struct({\n  id: Schema.NonEmptyString,\n  kind: NodeKind,\n  key: StoredKey,\n  material: KeyMaterial.KeyMaterial,\n  effects: NodeEffects,\n  dependsOn: Schema.Array(Schema.NonEmptyString),\n  conflicts: Schema.Array(ConflictAnnotation),\n  strategy: PairStrategy,\n  runtime: RuntimeStrategy,\n  priority: Schema.Int,\n  generation: Schema.Int\n})\n\n/**\n * The value form of {@link PlanNode}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type PlanNode = typeof PlanNode.Type\n\n/**\n * A plan: the whole keyed graph plus the digest an approval binds to.\n *\n * `nodes` follows material-dependency order within each generation. Inferred\n * edges can point to later entries; schedule from the complete `dependsOn`\n * graph, never by iterating the array alone.\n *\n * `baseDigest` is the digest at generation 0: what a human approved and what\n * a `RUNNING` run pins. `digest` advances with every appended elaboration.\n *\n * Decoding checks only the shape. Use {@link verify} to check that keys,\n * edges, and digests match the declarations.\n *\n * @since 0.1.0\n * @category schemas\n */\nexport const Plan = Schema.Struct({\n  planId: Schema.NonEmptyString,\n  flow: Schema.NonEmptyString,\n  generation: Schema.Int,\n  baseDigest: StoredKey,\n  digest: StoredKey,\n  nodes: Schema.Array(PlanNode)\n})\n\n/**\n * The value form of {@link Plan}.\n *\n * @since 0.1.0\n * @category models\n */\nexport type Plan = typeof Plan.Type\n\n/**\n * What a planner hands {@link compile}: a node without its key.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface NodeDraft {\n  /** A non-empty id, unique within the plan. */\n  readonly id: string\n  /** The key inputs. Its `Ref` inputs name the node's material dependencies. */\n  readonly material: KeyMaterial.KeyMaterial\n  /** The declared reads, writes, and removals. They replace `material.effects`. */\n  readonly effects: NodeEffects\n  /** `step`, `agent`, or `merge`. Defaults to `step`. */\n  readonly kind?: PlanNode[\"kind\"] | undefined\n  /** A safe integer scheduling priority. Defaults to 0. */\n  readonly priority?: number | undefined\n  /** This declaration's preferred plan-time verdict for a detected overlap. */\n  readonly conflictStrategy?: PairStrategy | undefined\n  /** This declaration's preferred runtime response. */\n  readonly runtimeStrategy?: RuntimeStrategy | undefined\n}\n\n/**\n * A graph the compiler refuses. `code` names the rule:\n *\n * - `cycle`: material or inferred edges form a cycle.\n * - `unknown_dependency`: a `Ref` names a node that is not in the plan.\n * - `duplicate_node`: two nodes share an id.\n * - `overlap_forbidden`: two unordered writers overlap and the pair's\n *   strategy is `fail`.\n * - `invalid_effects`: a node both writes and removes one path.\n * - `invalid_node`: a draft field, the plan id, or the flow name is malformed.\n * - `invalid_plan`: {@link verify} found a plan that does not match its\n *   declarations.\n * - `graph_too_large`: the plan exceeds {@link maximumPlanNodes} or the\n *   effect-analysis work budget.\n *\n * @since 0.1.0\n * @category errors\n */\nexport class PlanError extends Schema.TaggedError<PlanError>()(\"@smthrs/plan/PlanError\", {\n  code: Schema.Literals([\n    \"cycle\",\n    \"unknown_dependency\",\n    \"duplicate_node\",\n    \"overlap_forbidden\",\n    \"invalid_effects\",\n    \"invalid_node\",\n    \"invalid_plan\",\n    \"graph_too_large\"\n  ]),\n  message: Schema.String\n}) {}\n\n/**\n * Maximum number of nodes retained by one compiled plan.\n *\n * Effect analysis also has a yielding work budget, since a node ceiling alone\n * does not bound dense conflicts to practical work.\n *\n * @since 1.0.0\n * @category limits\n */\nexport const maximumPlanNodes = 10_000\n\n/** @private */\nconst graphSizeError = (size: number): PlanError =>\n  new PlanError({\n    code: \"graph_too_large\",\n    message: `A plan may contain at most ${maximumPlanNodes} nodes, received ${size}`\n  })\n\n/** @private */\ntype Ordered =\n  | { readonly ok: true; readonly drafts: ReadonlyArray<NodeDraft> }\n  | { readonly ok: false; readonly error: PlanError }\n\n/**\n * Topologically orders drafts by their MATERIAL dependencies — the only edges\n * that exist before keys do.\n *\n * @private\n */\nconst topological = (drafts: ReadonlyArray<NodeDraft>, known: ReadonlySet<string>): Ordered => {\n  const byId = new Map(drafts.map((draft) => [draft.id, draft]))\n  const ordered: Array<NodeDraft> = []\n  const state = new Map<string, \"visiting\" | \"done\">()\n  interface Frame {\n    readonly draft: NodeDraft\n    readonly dependencies: ReadonlyArray<string>\n    next: number\n  }\n  for (const draft of drafts) {\n    if (state.get(draft.id) === \"done\") continue\n    state.set(draft.id, \"visiting\")\n    const stack: Array<Frame> = [{ draft, dependencies: KeyMaterial.dependencies(draft.material), next: 0 }]\n    while (stack.length > 0) {\n      const frame = stack[stack.length - 1]!\n      if (frame.next === frame.dependencies.length) {\n        state.set(frame.draft.id, \"done\")\n        ordered.push(frame.draft)\n        stack.pop()\n        continue\n      }\n      const dependency = frame.dependencies[frame.next++]!\n      if (known.has(dependency)) continue\n      const next = byId.get(dependency)\n      if (next === undefined) {\n        return {\n          ok: false,\n          error: new PlanError({\n            code: \"unknown_dependency\",\n            message: `Node ${frame.draft.id} depends on unknown node ${dependency}`\n          })\n        }\n      }\n      const mark = state.get(next.id)\n      if (mark === \"done\") continue\n      if (mark === \"visiting\") {\n        return {\n          ok: false,\n          error: new PlanError({ code: \"cycle\", message: `Plan cycle through node ${next.id}` })\n        }\n      }\n      state.set(next.id, \"visiting\")\n      stack.push({ draft: next, dependencies: KeyMaterial.dependencies(next.material), next: 0 })\n    }\n  }\n  return { ok: true, drafts: ordered }\n}\n\n/**\n * Runs the conflict and reader-after-writer passes and records what they found\n * on every node outside `frozen`, whose rows an append never rewrites. A\n * refused graph fails as a `PlanError` carrying the pass's code and message.\n *\n * @private\n */\nconst annotate = (\n  nodes: ReadonlyArray<PlanNode>,\n  frozen: ReadonlySet<string>,\n  replayGenerations = false\n): Effect.Effect<ReadonlyArray<PlanNode>, PlanError> =>\n  Conflicts.annotate(nodes, frozen.size, replayGenerations).pipe(\n    Effect.mapError((refusal) => new PlanError(refusal)),\n    Effect.map(({ conflicts, ordering }) =>\n      nodes.map((node) => {\n        if (frozen.has(node.id)) return node\n        const added = ordering.get(node.id) ?? []\n        return freezeNode({\n          ...node,\n          conflicts: conflicts.get(node.id) ?? [],\n          dependsOn: added.length === 0 ? node.dependsOn : [...node.dependsOn, ...added]\n        })\n      })\n    )\n  )\n\n/**\n * The single approval projection. Its node list is the complete reviewable and\n * behavior-bearing contract: id, kind, key, edges, conflict annotations,\n * declared effects, conflict strategy, runtime strategy, and priority.\n *\n * @private\n */\nconst approvalPayload = (\n  planId: string,\n  flow: string,\n  nodes: ReadonlyArray<PlanNode>\n) => ({\n  body: { kind: \"plan\", planId, flow },\n  inputs: {\n    nodes: nodes.map((node) => ({\n      id: node.id,\n      kind: node.kind,\n      key: node.key,\n      dependsOn: node.dependsOn,\n      conflicts: node.conflicts,\n      effects: node.effects,\n      strategy: node.strategy,\n      runtime: node.runtime,\n      priority: node.priority\n    }))\n  },\n  layers: [],\n  capabilities: {}\n})\n\n/**\n * The plan's digest: what an approval binds to. Deriving it only from\n * {@link approvalPayload} keeps the approved field list in one place.\n *\n * @private\n */\nconst digestOf = (\n  planId: string,\n  flow: string,\n  nodes: ReadonlyArray<PlanNode>\n): Effect.Effect<StepKey.StepKey, StepKey.KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  StepKey.content(approvalPayload(planId, flow, nodes))\n\n/** @private */\nconst maximumDescriptionLength = 256\n\n/** @private */\nconst describeValue = (value: unknown): string => {\n  const rendered = typeof value === \"string\" ? JSON.stringify(value) : Inspectable.toStringUnknown(value, 0)\n  return rendered.length > maximumDescriptionLength\n    ? `${rendered.slice(0, maximumDescriptionLength - 3)}...`\n    : rendered\n}\n\n/** @private */\nconst describeNodeId = (id: string): string => id.length > maximumDescriptionLength ? describeValue(id) : id\n\n/** @private */\nconst validateIdentity = (planId: unknown, flow: unknown): PlanError | undefined => {\n  if (typeof planId !== \"string\" || planId.length === 0) {\n    return new PlanError({\n      code: \"invalid_node\",\n      message: `Plan option planId must be a non-empty string, received ${describeValue(planId)}`\n    })\n  }\n  if (typeof flow !== \"string\" || flow.length === 0) {\n    return new PlanError({\n      code: \"invalid_node\",\n      message: `Plan option flow must be a non-empty string, received ${describeValue(flow)}`\n    })\n  }\n  return undefined\n}\n\n/** Whether `value` is a container this module may safely copy. */\nconst isSnapshotContainer = (value: unknown): value is object => {\n  if (typeof value !== \"object\" || value === null) return false\n  if (Array.isArray(value)) return true\n  const prototype = Object.getPrototypeOf(value)\n  return prototype === Object.prototype || prototype === null\n}\n\n/** Creates an empty container with the source container's supported prototype. */\nconst emptySnapshot = (source: object): object =>\n  Array.isArray(source) ? [] : Object.create(Object.getPrototypeOf(source)) as object\n\n/**\n * Copies and freezes plain structural containers without interpreting them as\n * JSON. Shared references and cycles point at one cloned container through\n * `memo`; every other value passes through by reference and remains unfrozen.\n * In particular, this does not probe a `Planned` proxy. `validateDrafts`\n * creates the inert material mirror inside the Effect while retaining that\n * proxy, so the canonical serializer still reaches and refuses it.\n */\nconst snapshot = <A extends object>(value: A): A => {\n  const root = emptySnapshot(value)\n  const memo = new WeakMap<object, object>([[value, root]])\n  const pending: Array<{ readonly source: object; readonly target: object }> = [{ source: value, target: root }]\n  const created = [root]\n\n  while (pending.length > 0) {\n    const { source, target } = pending.pop()!\n    for (const key of Reflect.ownKeys(source)) {\n      const descriptor = Object.getOwnPropertyDescriptor(source, key)!\n      if (\"value\" in descriptor && isSnapshotContainer(descriptor.value)) {\n        let child = memo.get(descriptor.value)\n        if (child === undefined) {\n          child = emptySnapshot(descriptor.value)\n          memo.set(descriptor.value, child)\n          pending.push({ source: descriptor.value, target: child })\n          created.push(child)\n        }\n        descriptor.value = child\n      }\n      Object.defineProperty(target, key, descriptor)\n    }\n  }\n\n  for (const container of created) Object.freeze(container)\n  return root as A\n}\n\n/** Freezes one node built by this module while retaining its material snapshot. */\nconst freezeNode = (node: PlanNode): PlanNode =>\n  Object.freeze({\n    ...node,\n    dependsOn: Object.freeze([...node.dependsOn]),\n    conflicts: Object.freeze(\n      node.conflicts.map((conflict) => Object.freeze({ ...conflict, paths: Object.freeze([...conflict.paths]) }))\n    )\n  })\n\n/** Plans whose complete immutable snapshot was created by this module. */\nconst frozenPlans = new WeakSet<Plan>()\n\n/** Freezes the plan envelope and its newly built node list. */\nconst freezePlan = (plan: Plan): Plan => {\n  const frozen = Object.freeze({ ...plan, nodes: Object.freeze([...plan.nodes]) })\n  frozenPlans.add(frozen)\n  return frozen\n}\n\n/**\n * Validates the runtime-only parts of `NodeDraft` without replacing effect\n * admission. Effect 4 Struct decoding strips excess properties and copies its\n * schema arrays. The decoded effect declaration replaces any caller-supplied\n * `material.effects`, and every accepted draft receives one deeply frozen JSON\n * mirror for both storage and hashing.\n *\n * @private\n */\nconst validateDrafts = (\n  drafts: ReadonlyArray<NodeDraft>\n): Effect.Effect<ReadonlyArray<NodeDraft>, PlanError> =>\n  Effect.forEach(drafts, (draft) =>\n    Effect.gen(function*() {\n      if (typeof draft.id !== \"string\" || draft.id.length === 0) {\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node id must be a non-empty string, received ${describeValue(draft.id)}`\n          })\n        )\n      }\n      const nodeId = describeNodeId(draft.id)\n      if (draft.priority !== undefined && !Number.isSafeInteger(draft.priority)) {\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} priority must be a safe integer, received ${describeValue(draft.priority)}`\n          })\n        )\n      }\n      if (draft.kind !== undefined && !Schema.is(NodeKind)(draft.kind)) {\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} kind must be step, agent, or merge, received ${describeValue(draft.kind)}`\n          })\n        )\n      }\n      if (draft.conflictStrategy !== undefined && !Schema.is(PairStrategy)(draft.conflictStrategy)) {\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} conflictStrategy must be serialize, lane, or fail, received ${\n              describeValue(draft.conflictStrategy)\n            }`\n          })\n        )\n      }\n      if (draft.runtimeStrategy !== undefined && !Schema.is(RuntimeStrategy)(draft.runtimeStrategy)) {\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} runtimeStrategy must be delay-rebase or stop-merge, received ${\n              describeValue(draft.runtimeStrategy)\n            }`\n          })\n        )\n      }\n      const decodedMaterial = yield* Schema.decodeUnknownEffect(KeyMaterial.KeyMaterial)(draft.material).pipe(\n        Effect.mapError((cause) =>\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} has invalid material: ${cause.message}`\n          })\n        )\n      )\n      const decodedEffects = yield* Schema.decodeUnknownEffect(NodeEffects)(draft.effects).pipe(\n        Effect.mapError((cause) =>\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} has invalid effects: ${cause.message}`\n          })\n        )\n      )\n      let material: KeyMaterial.KeyMaterial\n      try {\n        material = snapshot(\n          jsonMirror({ ...decodedMaterial, effects: decodedEffects }, (planned) => planned) as KeyMaterial.KeyMaterial\n        )\n      } catch (cause) {\n        const path = cause instanceof GraphBuildError ? cause.path : []\n        return yield* Effect.fail(\n          new PlanError({\n            code: \"invalid_node\",\n            message: `Node ${nodeId} has invalid material payload at ${[\"$\", ...path].join(\".\")}`\n          })\n        )\n      }\n      return Object.freeze({\n        ...draft,\n        material,\n        effects: material.effects as NodeEffects\n      })\n    }))\n\n/**\n * The effects schema admits each individual declaration in `validateDrafts`.\n * This pass enforces the cross-field invariant that one path cannot be both a\n * write and a removal.\n *\n * @private\n */\nconst validateEffects = (id: string, effects: NodeEffects): PlanError | undefined => {\n  const removes = effects.removes ?? []\n  const writes = FileSet.expand(effects.writes)\n  for (const removal of removes) {\n    if (writes.some((entry) => FileSet.overlaps(entry, removal))) {\n      return new PlanError({\n        code: \"invalid_effects\",\n        message: `Node ${id} declares ${removal} as both a write and a removal`\n      })\n    }\n  }\n  return undefined\n}\n\n/** @private */\nconst keyNodes = (\n  drafts: ReadonlyArray<NodeDraft>,\n  existing: ReadonlyArray<PlanNode>,\n  generation: number\n): Effect.Effect<\n  ReadonlyArray<PlanNode>,\n  PlanError | StepKey.KeyMaterialError | Schema.SchemaError,\n  Crypto.Crypto\n> =>\n  Effect.gen(function*() {\n    const digests: Record<string, string> = Object.create(null) as Record<string, string>\n    const known = new Set<string>()\n    for (const node of existing) {\n      Object.defineProperty(digests, node.id, {\n        configurable: true,\n        enumerable: true,\n        value: node.key,\n        writable: true\n      })\n      known.add(node.id)\n    }\n    for (const draft of drafts) {\n      if (known.has(draft.id)) {\n        return yield* Effect.fail(\n          new PlanError({ code: \"duplicate_node\", message: `Node ${draft.id} is already in the plan` })\n        )\n      }\n      known.add(draft.id)\n    }\n    const sorted = topological(drafts, new Set(existing.map((node) => node.id)))\n    if (!sorted.ok) return yield* Effect.fail(sorted.error)\n    const keyed: Array<PlanNode> = []\n    for (const draft of sorted.drafts) {\n      const invalid = validateEffects(draft.id, draft.effects)\n      if (invalid !== undefined) return yield* Effect.fail(invalid)\n      const key = yield* StepKey.planIdentity(draft.material, digests)\n      Object.defineProperty(digests, draft.id, {\n        configurable: true,\n        enumerable: true,\n        value: key,\n        writable: true\n      })\n      keyed.push(freezeNode({\n        id: draft.id,\n        kind: draft.kind ?? \"step\",\n        key,\n        material: draft.material,\n        effects: draft.effects,\n        dependsOn: KeyMaterial.dependencies(draft.material),\n        conflicts: [],\n        strategy: draft.conflictStrategy ?? \"serialize\",\n        runtime: draft.runtimeStrategy ?? \"delay-rebase\",\n        priority: draft.priority ?? 0,\n        generation\n      }))\n    }\n    return keyed\n  })\n\n/**\n * Compiles drafts into a plan: material-dependency order, dependency-digest\n * substitution, overlap annotation, and the plan digest. No I/O.\n * Inferred edges extend `dependsOn` without reordering the node array.\n *\n * Traversal uses explicit stacks. Because the conflict and reader/writer\n * passes consider a quadratic number of node pairs, plans are bounded by\n * {@link maximumPlanNodes} and fail with `graph_too_large` above that limit\n * or the effect-analysis work budget. Analysis yields periodically.\n *\n * The options and drafts are copied when `compile` is called, so later\n * caller mutation does not reach the plan. The result is deeply frozen.\n *\n * @param options - `planId` and `flow` name the plan; `nodes` are the drafts.\n * @returns The generation-0 plan, whose `baseDigest` equals its `digest`.\n * Fails with {@link PlanError} for a refused graph, `KeyMaterialError` or\n * `SchemaError` when a key cannot be derived.\n * @since 0.1.0\n * @category constructors\n */\nexport const compile = (options: {\n  readonly planId: string\n  readonly flow: string\n  readonly nodes: ReadonlyArray<NodeDraft>\n}): Effect.Effect<Plan, PlanError | StepKey.KeyMaterialError | Schema.SchemaError, Crypto.Crypto> => {\n  const captured = snapshot(options)\n  return Effect.gen(function*() {\n    const invalidIdentity = validateIdentity(captured.planId, captured.flow)\n    if (invalidIdentity !== undefined) return yield* Effect.fail(invalidIdentity)\n    if (captured.nodes.length > maximumPlanNodes) return yield* Effect.fail(graphSizeError(captured.nodes.length))\n    const drafts = yield* validateDrafts(captured.nodes)\n    const keyed = yield* keyNodes(drafts, [], 0)\n    const nodes = yield* annotate(keyed, new Set())\n    const digest = yield* digestOf(captured.planId, captured.flow, nodes)\n    return freezePlan({\n      planId: captured.planId,\n      flow: captured.flow,\n      generation: 0,\n      baseDigest: digest,\n      digest,\n      nodes\n    })\n  })\n}\n\n/**\n * Appends an elaborated subgraph to an existing plan.\n *\n * The plan GROWS; it is never invalidated. Nodes already in it keep their id,\n * key, edges, and generation byte for byte, and the new nodes arrive pre-keyed\n * against them, so a `hit` shows instantly. New nodes retain their material\n * dependency order; scheduling must honor their complete `dependsOn` graph.\n * Re-ordering after a reconciliation happens by re-keying *future* steps,\n * never by rewriting history.\n *\n * A plan not produced by this module is checked with {@link verify} first.\n *\n * @param plan - The plan to grow.\n * @param drafts - At least one new node. Ids must not repeat existing ones;\n *   `Ref` inputs may name existing nodes.\n * @returns The plan with one more generation and a new `digest`. Fails with\n * {@link PlanError} (`invalid_node` for an empty `drafts`, `invalid_plan` for a\n * plan that fails verification), `KeyMaterialError`, or `SchemaError`.\n * @since 0.1.0\n * @category constructors\n */\nexport const append = (\n  plan: Plan,\n  drafts: ReadonlyArray<NodeDraft>\n): Effect.Effect<Plan, PlanError | StepKey.KeyMaterialError | Schema.SchemaError, Crypto.Crypto> => {\n  const candidate = frozenPlans.has(plan) ? plan : snapshot(plan)\n  const capturedDrafts = snapshot(drafts)\n  return Effect.gen(function*() {\n    const invalidIdentity = validateIdentity(candidate.planId, candidate.flow)\n    if (invalidIdentity !== undefined) return yield* Effect.fail(invalidIdentity)\n    const capturedPlan = yield* verify(candidate)\n    const nextSize = capturedPlan.nodes.length + capturedDrafts.length\n    if (nextSize > maximumPlanNodes) return yield* Effect.fail(graphSizeError(nextSize))\n    const validated = yield* validateDrafts(capturedDrafts)\n    if (validated.length === 0) {\n      return yield* Effect.fail(\n        new PlanError({\n          code: \"invalid_node\",\n          message: `Plan ${capturedPlan.planId} append requires at least one draft`\n        })\n      )\n    }\n    const generation = capturedPlan.generation + 1\n    const keyed = yield* keyNodes(validated, capturedPlan.nodes, generation)\n    const nodes = yield* annotate(\n      [...capturedPlan.nodes, ...keyed],\n      new Set(capturedPlan.nodes.map((node) => node.id))\n    )\n    const digest = yield* digestOf(capturedPlan.planId, capturedPlan.flow, nodes)\n    return freezePlan({ ...capturedPlan, generation, digest, nodes })\n  })\n}\n\n/**\n * Verifies an imported plan against the same key and topology rules as the\n * compiler. Valid compiler-owned immutable values need no second compilation.\n *\n * Generation boundaries are replayed when reconstructing conflict annotations:\n * an append may annotate new nodes, but cannot rewrite an earlier generation.\n * Recorded material-dependency order is verified without sorting inferred edges.\n * Keys and approval digests retain their existing format. The returned snapshot\n * is immutable; later caller mutation cannot change the verified value.\n *\n * @since 1.0.0\n * @category validation\n */\nexport const verify = (\n  input: unknown\n): Effect.Effect<Plan, PlanError | StepKey.KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  Effect.gen(function*() {\n    if (typeof input === \"object\" && input !== null && frozenPlans.has(input as Plan)) return input as Plan\n    // Check the array ceiling before schema decoding copies its members.\n    if (typeof input === \"object\" && input !== null && \"nodes\" in input && Array.isArray(input.nodes)) {\n      if (input.nodes.length > maximumPlanNodes) return yield* Effect.fail(graphSizeError(input.nodes.length))\n    }\n    const decoded = yield* Schema.decodeUnknownEffect(Plan)(input)\n    const invalid = (message: string) => new PlanError({ code: \"invalid_plan\", message })\n    if (\n      !Number.isSafeInteger(decoded.generation) || decoded.generation < 0 || decoded.generation > decoded.nodes.length\n    ) {\n      return yield* Effect.fail(\n        invalid(\"Plan generation must be a non-negative safe integer with a nonempty appended generation\")\n      )\n    }\n    const generations = new Map<string, number>()\n    let previous = 0\n    for (const node of decoded.nodes) {\n      if (!Number.isSafeInteger(node.generation) || node.generation < previous || node.generation > previous + 1) {\n        return yield* Effect.fail(invalid(`Node ${node.id} has an invalid or out-of-order generation`))\n      }\n      generations.set(node.id, node.generation)\n      previous = node.generation\n    }\n    if (previous !== decoded.generation) {\n      return yield* Effect.fail(invalid(\"Plan generation does not match its newest nodes\"))\n    }\n    for (const node of decoded.nodes) {\n      for (const dependency of KeyMaterial.dependencies(node.material)) {\n        const generation = generations.get(dependency)\n        if (generation !== undefined && generation > node.generation) {\n          return yield* Effect.fail(invalid(`Node ${node.id} refers to a future generation`))\n        }\n      }\n    }\n    const drafts = yield* validateDrafts(decoded.nodes.map((node) => ({\n      id: node.id,\n      kind: node.kind,\n      material: node.material,\n      effects: node.effects,\n      conflictStrategy: node.strategy,\n      runtimeStrategy: node.runtime,\n      priority: node.priority\n    })))\n    const keyed = (yield* keyNodes(drafts, [], 0)).map((node) =>\n      freezeNode({ ...node, generation: generations.get(node.id)! })\n    )\n    // Replay boundaries within one annotation pass, retaining its expansion\n    // map, candidate trie, inferred graph and reachability cache throughout.\n    const nodes = yield* annotate(keyed, new Set(), true)\n    const baseDigest = yield* digestOf(decoded.planId, decoded.flow, nodes.filter((node) => node.generation === 0))\n    const digest = decoded.generation === 0 ? baseDigest : yield* digestOf(decoded.planId, decoded.flow, nodes)\n    if (decoded.baseDigest !== baseDigest || decoded.digest !== digest) {\n      return yield* Effect.fail(invalid(\"Plan approval digest does not match its compiled content\"))\n    }\n    // Compare the complete node contract, including material and generation,\n    // rather than trusting the claimed keys or the approval projection alone.\n    const hash = Schema.decodeUnknownEffect(DerivedKey)\n    if ((yield* hash(decoded.nodes)) !== (yield* hash(nodes))) {\n      return yield* Effect.fail(\n        invalid(\"Plan nodes do not match their compiled keys, effects, ordering, or generations\")\n      )\n    }\n    return freezePlan({ ...decoded, nodes })\n  })\n\n/**\n * The nodes added by the newest generation: what {@link module:PlanStore}\n * appends and what the `subgraph-appended` journal record names.\n *\n * @param plan - A plan.\n * @returns The nodes whose generation equals `plan.generation`, in order.\n * @since 0.1.0\n * @category accessors\n */\nexport const generationNodes = (plan: Plan): ReadonlyArray<PlanNode> =>\n  plan.nodes.filter((node) => node.generation === plan.generation)\n\n/**\n * Whether `input` is a compiler-owned immutable snapshot that already passed\n * {@link verify}: such values take verify's trusted fast path and need no\n * second schema validation.\n *\n * @param input - Any value.\n * @returns `true` only for a plan returned by {@link compile},\n * {@link append}, or {@link verify}; a structurally equal copy returns `false`.\n * @since 1.0.0\n * @category guards\n */\nexport const isVerified = (input: unknown): input is Plan =>\n  typeof input === \"object\" && input !== null && frozenPlans.has(input as Plan)\n\n/**\n * The approval digest of every generation before the newest: the digest this\n * plan carried before its last append. {@link module:PlanStore}'s append\n * matches it against the stored envelope, so an append proves the recorded\n * plan's integrity from the already-verified prefix instead of decoding and\n * re-verifying every stored row.\n *\n * For a generation-0 plan no generation precedes the newest, so this is the\n * digest of an empty node list.\n *\n * @param plan - A plan.\n * @returns The approval digest of the nodes older than `plan.generation`.\n * @since 1.0.0\n * @category accessors\n */\nexport const prefixDigest = (\n  plan: Plan\n): Effect.Effect<StepKey.StepKey, StepKey.KeyMaterialError | Schema.SchemaError, Crypto.Crypto> =>\n  digestOf(plan.planId, plan.flow, plan.nodes.filter((node) => node.generation < plan.generation))\n"]}

package/dist/esm/PlanDiff.d.ts

@@ -0,0 +1,77 @@
+/**
+ * A plan comparison, as a value.
+ *
+ * A plan diff answers "which steps changed key (and _which input_
+ * changed them), what entered the envelope, what joined the release set —
+ * 'what is different about this run' is a set comparison, not archaeology."
+ * This module is the set comparison.
+ *
+ * The **verdict** is the key: two nodes with the same key are the same step,
+ * under the same id or a moved one, and nothing else needs saying. The
+ * **attribution** — `changed: ["input[1]"]` — is a report for a human, derived
+ * by comparing the declarations field by field. It is deliberately not part of any digest.
+ *
+ * @since 0.1.0
+ */
+import type * as Plan from "./Plan.ts";
+/**
+ * A node whose key moved, with the fields that moved it.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+export interface Rekeyed {
+    /** The node's id in the newer plan. */
+    readonly id: string;
+    /** The step key the paired node carried in the older plan. */
+    readonly from: string;
+    /** The step key the node carries in the newer plan. */
+    readonly to: string;
+    /**
+     * Field labels such as `"kind"`, `"body"`, `"layers"`, `"capabilities"`,
+     * `"effects"`, and `"input[0]"` whose declaration differs. `"kind"` is the
+     * effect tier (`sealed`, `compensable`, or `irreversible`). A
+     * `Pending`-referenced upstream re-key is attributed to that input position
+     * too. `changed` is empty only when none of the compared fields moved.
+     */
+    readonly changed: ReadonlyArray<string>;
+}
+/**
+ * What changed between two plans of the same flow.
+ *
+ * @since 0.1.0
+ * @category models
+ */
+export interface PlanDiff {
+    /** Ids, in the newer plan, of nodes with no counterpart in the older plan. */
+    readonly added: ReadonlyArray<string>;
+    /** Ids, in the older plan, of nodes with no counterpart in the newer plan. */
+    readonly removed: ReadonlyArray<string>;
+    /** Nodes paired by id whose step key changed, with the fields that changed it. */
+    readonly rekeyed: ReadonlyArray<Rekeyed>;
+    /** Ids, in the newer plan, of nodes whose step key is unchanged, including nodes whose id moved. */
+    readonly unchanged: ReadonlyArray<string>;
+}
+/**
+ * Compares a plan against the last plan for the same flow.
+ *
+ * Nodes pair in three passes, each over the nodes no earlier pass paired:
+ * the same id with the same key, then the same key under any id, then the
+ * same id with a different key. The second pass exists because flow node ids
+ * can be positional: inserting a step shifts the ids after it while their
+ * keys stay equal, and that is one added step, not a re-key of every later
+ * one (#3905).
+ *
+ * `added`, `rekeyed`, and `unchanged` name nodes by their id in `next`;
+ * `removed` names nodes by their id in `previous`. A moved id can therefore
+ * appear once in `removed` or `added` and once in `unchanged`.
+ *
+ * @param previous - The last plan recorded for the flow.
+ * @param next - The plan to compare against it.
+ * @returns The added, removed, re-keyed, and unchanged node ids, each in its
+ * plan's node order.
+ * @since 0.1.0
+ * @category constructors
+ */
+export declare const diff: (previous: Plan.Plan, next: Plan.Plan) => PlanDiff;
+//# sourceMappingURL=PlanDiff.d.ts.map

package/dist/esm/PlanDiff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlanDiff.d.ts","sourceRoot":"","sources":["../../src/PlanDiff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,KAAK,KAAK,IAAI,MAAM,WAAW,CAAA;AAGtC;;;;;GAKG;AACH,MAAM,WAAW,OAAO;IACtB,uCAAuC;IACvC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,8DAA8D;IAC9D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,uDAAuD;IACvD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACxC;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACrC,8EAA8E;IAC9E,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;IACvC,kFAAkF;IAClF,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,CAAA;IACxC,oGAAoG;IACpG,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CAC1C;AAuGD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,eAAO,MAAM,IAAI,GAAI,UAAU,IAAI,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,IAAI,KAAG,QA6D3D,CAAA"}

package/dist/esm/PlanDiff.js

@@ -0,0 +1,205 @@
+/**
+ * A plan comparison, as a value.
+ *
+ * A plan diff answers "which steps changed key (and _which input_
+ * changed them), what entered the envelope, what joined the release set —
+ * 'what is different about this run' is a set comparison, not archaeology."
+ * This module is the set comparison.
+ *
+ * The **verdict** is the key: two nodes with the same key are the same step,
+ * under the same id or a moved one, and nothing else needs saying. The
+ * **attribution** — `changed: ["input[1]"]` — is a report for a human, derived
+ * by comparing the declarations field by field. It is deliberately not part of any digest.
+ *
+ * @since 0.1.0
+ */
+import { jsonMirror } from "./internal/JsonMirror.js";
+/**
+ * Order-insensitive structural comparison for the attribution report only.
+ * Digests go through RFC 8785 canonical JSON; this does not have to, and
+ * saying so keeps the two from being confused.
+ *
+ * @private
+ */
+const stable = (value) => {
+    if (typeof value === "bigint")
+        return `${value}n`;
+    if (value === null || typeof value !== "object")
+        return JSON.stringify(value) ?? "undefined";
+    if (Array.isArray(value))
+        return `[${value.map(stable).join(",")}]`;
+    const entries = Object.entries(value).sort(([left], [right]) => left < right ? -1 : 1);
+    return `{${entries.map(([name, entry]) => `${JSON.stringify(name)}:${stable(entry)}`).join(",")}}`;
+};
+/**
+ * A planned value compares as the reference an AST stores for it, so the same
+ * reference at the same place is unchanged.
+ *
+ * @private
+ */
+const plannedReference = (_value, reference) => ({
+    _tag: "PlannedReference",
+    node: reference.node,
+    path: reference.path
+});
+/**
+ * Projects compared fields through the key's JSON semantics. A refused value
+ * receives an identity token scoped to its node and field, so the same value
+ * remains equal to itself without equating two distinct refused values.
+ *
+ * @private
+ */
+const fieldComparison = () => {
+    const refused = new Map();
+    const token = (input, nodeId, field) => {
+        try {
+            return stable(jsonMirror(input, plannedReference));
+        }
+        catch {
+            const address = JSON.stringify([nodeId, field]);
+            let fields = refused.get(input);
+            if (fields === undefined) {
+                fields = new Map();
+                refused.set(input, fields);
+            }
+            let sentinel = fields.get(address);
+            if (sentinel === undefined) {
+                sentinel = Symbol(address);
+                fields.set(address, sentinel);
+            }
+            return sentinel;
+        }
+    };
+    return (previous, next, nodeId, field) => token(previous, nodeId, field) === token(next, nodeId, field);
+};
+/** @private */
+const changedFields = (previous, next, rekeyedDependencies, sameField) => {
+    const changed = [];
+    // StepKey.materialBody is the identity list this attribution must mirror.
+    // Inputs, layers, and capabilities complete fromKeyMaterial's hashed value,
+    // and material.kind selects the key namespace (content versus tier-bearing
+    // plan declaration), so a tier-only move still re-keys and is blamed here.
+    if (!sameField(previous.material.version, next.material.version, next.id, "version"))
+        changed.push("version");
+    if (previous.material.kind !== next.material.kind)
+        changed.push("kind");
+    if (!sameField(previous.material.body, next.material.body, next.id, "body"))
+        changed.push("body");
+    if (!sameField(previous.material.nondeterministic, next.material.nondeterministic, next.id, "nondeterministic")) {
+        changed.push("nondeterministic");
+    }
+    if (!sameField(previous.material.effects, next.material.effects, next.id, "effects"))
+        changed.push("effects");
+    if (!sameField(previous.material.placement, next.material.placement, next.id, "placement")) {
+        changed.push("placement");
+    }
+    const width = Math.max(previous.material.inputs.length, next.material.inputs.length);
+    for (let index = 0; index < width; index++) {
+        const before = previous.material.inputs[index];
+        const after = next.material.inputs[index];
+        const field = `input[${index}]`;
+        if (before === undefined || after === undefined || !sameField(before, after, next.id, field)) {
+            changed.push(field);
+            continue;
+        }
+        if (after._tag !== "Literal" && rekeyedDependencies.has(after.from))
+            changed.push(field);
+    }
+    if (!sameField(previous.material.layers, next.material.layers, next.id, "layers"))
+        changed.push("layers");
+    if (!sameField(previous.material.capabilities, next.material.capabilities, next.id, "capabilities")) {
+        changed.push("capabilities");
+    }
+    return changed;
+};
+/**
+ * Compares a plan against the last plan for the same flow.
+ *
+ * Nodes pair in three passes, each over the nodes no earlier pass paired:
+ * the same id with the same key, then the same key under any id, then the
+ * same id with a different key. The second pass exists because flow node ids
+ * can be positional: inserting a step shifts the ids after it while their
+ * keys stay equal, and that is one added step, not a re-key of every later
+ * one (#3905).
+ *
+ * `added`, `rekeyed`, and `unchanged` name nodes by their id in `next`;
+ * `removed` names nodes by their id in `previous`. A moved id can therefore
+ * appear once in `removed` or `added` and once in `unchanged`.
+ *
+ * @param previous - The last plan recorded for the flow.
+ * @param next - The plan to compare against it.
+ * @returns The added, removed, re-keyed, and unchanged node ids, each in its
+ * plan's node order.
+ * @since 0.1.0
+ * @category constructors
+ */
+export const diff = (previous, next) => {
+    // pairs maps a next node to the previous node it is the same step as.
+    const pairs = new Map();
+    const paired = new Set();
+    const pair = (node, original) => {
+        pairs.set(node, original);
+        paired.add(original);
+    };
+    const before = new Map(previous.nodes.map((node) => [node.id, node]));
+    for (const node of next.nodes) {
+        const original = before.get(node.id);
+        if (original !== undefined && original.key === node.key)
+            pair(node, original);
+    }
+    const byKey = new Map();
+    for (const node of previous.nodes) {
+        if (paired.has(node))
+            continue;
+        const same = byKey.get(node.key);
+        if (same === undefined)
+            byKey.set(node.key, [node]);
+        else
+            same.push(node);
+    }
+    for (const node of next.nodes) {
+        if (pairs.has(node))
+            continue;
+        const original = byKey.get(node.key)?.shift();
+        if (original !== undefined)
+            pair(node, original);
+    }
+    const rekeyedIds = new Set();
+    for (const node of next.nodes) {
+        if (pairs.has(node))
+            continue;
+        const original = before.get(node.id);
+        if (original !== undefined && !paired.has(original)) {
+            pair(node, original);
+            rekeyedIds.add(node.id);
+        }
+    }
+    const added = [];
+    const rekeyed = [];
+    const unchanged = [];
+    const sameField = fieldComparison();
+    for (const node of next.nodes) {
+        const original = pairs.get(node);
+        if (original === undefined) {
+            added.push(node.id);
+            continue;
+        }
+        if (original.key === node.key) {
+            unchanged.push(node.id);
+            continue;
+        }
+        rekeyed.push({
+            id: node.id,
+            from: original.key,
+            to: node.key,
+            changed: changedFields(original, node, rekeyedIds, sameField)
+        });
+    }
+    return {
+        added,
+        removed: previous.nodes.filter((node) => !paired.has(node)).map((node) => node.id),
+        rekeyed,
+        unchanged
+    };
+};
+//# sourceMappingURL=PlanDiff.js.map

package/dist/esm/PlanDiff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlanDiff.js","sourceRoot":"","sources":["../../src/PlanDiff.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAA;AA4CrD;;;;;;GAMG;AACH,MAAM,MAAM,GAAG,CAAC,KAAc,EAAU,EAAE;IACxC,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,GAAG,KAAK,GAAG,CAAA;IACjD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,WAAW,CAAA;IAC5F,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;IACnE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjH,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAA;AACpG,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,MAAe,EAAE,SAA4B,EAAE,EAAE,CAAC,CAAC;IAC3E,IAAI,EAAE,kBAAkB;IACxB,IAAI,EAAE,SAAS,CAAC,IAAI;IACpB,IAAI,EAAE,SAAS,CAAC,IAAI;CACrB,CAAC,CAAA;AAKF;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,GAAG,EAAE;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAA;IACvD,MAAM,KAAK,GAAG,CAAC,KAAc,EAAE,MAAc,EAAE,KAAa,EAAmB,EAAE;QAC/E,IAAI,CAAC;YACH,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAA;QACpD,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAA;YAC/C,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAC/B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,GAAG,IAAI,GAAG,EAAE,CAAA;gBAClB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;YAC5B,CAAC;YACD,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;gBAC1B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;YAC/B,CAAC;YACD,OAAO,QAAQ,CAAA;QACjB,CAAC;IACH,CAAC,CAAA;IACD,OAAO,CAAC,QAAiB,EAAE,IAAa,EAAE,MAAc,EAAE,KAAa,EAAW,EAAE,CAClF,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;AACjE,CAAC,CAAA;AAED,eAAe;AACf,MAAM,aAAa,GAAG,CACpB,QAAuB,EACvB,IAAmB,EACnB,mBAAwC,EACxC,SAA6C,EACtB,EAAE;IACzB,MAAM,OAAO,GAAkB,EAAE,CAAA;IACjC,0EAA0E;IAC1E,4EAA4E;IAC5E,2EAA2E;IAC3E,2EAA2E;IAC3E,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC7G,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACvE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACjG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAC,EAAE,EAAE,kBAAkB,CAAC,EAAE,CAAC;QAChH,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAA;IAClC,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC7G,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;QAC3F,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;IAC3B,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACpF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACzC,MAAM,KAAK,GAAG,SAAS,KAAK,GAAG,CAAA;QAC/B,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;YAC7F,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACnB,SAAQ;QACV,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC1F,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACzG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,CAAC;QACpG,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;IAC9B,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,QAAmB,EAAE,IAAe,EAAY,EAAE;IACrE,sEAAsE;IACtE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAA;IACrD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;IACvC,MAAM,IAAI,GAAG,CAAC,IAAmB,EAAE,QAAuB,EAAE,EAAE;QAC5D,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACzB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACtB,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;IACrE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACpC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG;YAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC/E,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAA;IACrD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAChC,IAAI,IAAI,KAAK,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAA;;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACtB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAA;QAC7C,IAAI,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAClD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;IACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACpC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;YACpB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAkB,EAAE,CAAA;IAC/B,MAAM,OAAO,GAAmB,EAAE,CAAA;IAClC,MAAM,SAAS,GAAkB,EAAE,CAAA;IACnC,MAAM,SAAS,GAAG,eAAe,EAAE,CAAA;IACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACnB,SAAQ;QACV,CAAC;QACD,IAAI,QAAQ,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;YAC9B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACvB,SAAQ;QACV,CAAC;QACD,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,QAAQ,CAAC,GAAG;YAClB,EAAE,EAAE,IAAI,CAAC,GAAG;YACZ,OAAO,EAAE,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,CAAC;SAC9D,CAAC,CAAA;IACJ,CAAC;IACD,OAAO;QACL,KAAK;QACL,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAClF,OAAO;QACP,SAAS;KACV,CAAA;AACH,CAAC,CAAA","sourcesContent":["/**\n * A plan comparison, as a value.\n *\n * A plan diff answers \"which steps changed key (and _which input_\n * changed them), what entered the envelope, what joined the release set —\n * 'what is different about this run' is a set comparison, not archaeology.\"\n * This module is the set comparison.\n *\n * The **verdict** is the key: two nodes with the same key are the same step,\n * under the same id or a moved one, and nothing else needs saying. The\n * **attribution** — `changed: [\"input[1]\"]` — is a report for a human, derived\n * by comparing the declarations field by field. It is deliberately not part of any digest.\n *\n * @since 0.1.0\n */\n\nimport { jsonMirror } from \"./internal/JsonMirror.ts\"\nimport type * as Plan from \"./Plan.ts\"\nimport type * as Planned from \"./Planned.ts\"\n\n/**\n * A node whose key moved, with the fields that moved it.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface Rekeyed {\n  /** The node's id in the newer plan. */\n  readonly id: string\n  /** The step key the paired node carried in the older plan. */\n  readonly from: string\n  /** The step key the node carries in the newer plan. */\n  readonly to: string\n  /**\n   * Field labels such as `\"kind\"`, `\"body\"`, `\"layers\"`, `\"capabilities\"`,\n   * `\"effects\"`, and `\"input[0]\"` whose declaration differs. `\"kind\"` is the\n   * effect tier (`sealed`, `compensable`, or `irreversible`). A\n   * `Pending`-referenced upstream re-key is attributed to that input position\n   * too. `changed` is empty only when none of the compared fields moved.\n   */\n  readonly changed: ReadonlyArray<string>\n}\n\n/**\n * What changed between two plans of the same flow.\n *\n * @since 0.1.0\n * @category models\n */\nexport interface PlanDiff {\n  /** Ids, in the newer plan, of nodes with no counterpart in the older plan. */\n  readonly added: ReadonlyArray<string>\n  /** Ids, in the older plan, of nodes with no counterpart in the newer plan. */\n  readonly removed: ReadonlyArray<string>\n  /** Nodes paired by id whose step key changed, with the fields that changed it. */\n  readonly rekeyed: ReadonlyArray<Rekeyed>\n  /** Ids, in the newer plan, of nodes whose step key is unchanged, including nodes whose id moved. */\n  readonly unchanged: ReadonlyArray<string>\n}\n\n/**\n * Order-insensitive structural comparison for the attribution report only.\n * Digests go through RFC 8785 canonical JSON; this does not have to, and\n * saying so keeps the two from being confused.\n *\n * @private\n */\nconst stable = (value: unknown): string => {\n  if (typeof value === \"bigint\") return `${value}n`\n  if (value === null || typeof value !== \"object\") return JSON.stringify(value) ?? \"undefined\"\n  if (Array.isArray(value)) return `[${value.map(stable).join(\",\")}]`\n  const entries = Object.entries(value as Record<string, unknown>).sort(([left], [right]) => left < right ? -1 : 1)\n  return `{${entries.map(([name, entry]) => `${JSON.stringify(name)}:${stable(entry)}`).join(\",\")}}`\n}\n\n/**\n * A planned value compares as the reference an AST stores for it, so the same\n * reference at the same place is unchanged.\n *\n * @private\n */\nconst plannedReference = (_value: unknown, reference: Planned.Reference) => ({\n  _tag: \"PlannedReference\",\n  node: reference.node,\n  path: reference.path\n})\n\n/** @private */\ntype ComparisonToken = string | symbol\n\n/**\n * Projects compared fields through the key's JSON semantics. A refused value\n * receives an identity token scoped to its node and field, so the same value\n * remains equal to itself without equating two distinct refused values.\n *\n * @private\n */\nconst fieldComparison = () => {\n  const refused = new Map<unknown, Map<string, symbol>>()\n  const token = (input: unknown, nodeId: string, field: string): ComparisonToken => {\n    try {\n      return stable(jsonMirror(input, plannedReference))\n    } catch {\n      const address = JSON.stringify([nodeId, field])\n      let fields = refused.get(input)\n      if (fields === undefined) {\n        fields = new Map()\n        refused.set(input, fields)\n      }\n      let sentinel = fields.get(address)\n      if (sentinel === undefined) {\n        sentinel = Symbol(address)\n        fields.set(address, sentinel)\n      }\n      return sentinel\n    }\n  }\n  return (previous: unknown, next: unknown, nodeId: string, field: string): boolean =>\n    token(previous, nodeId, field) === token(next, nodeId, field)\n}\n\n/** @private */\nconst changedFields = (\n  previous: Plan.PlanNode,\n  next: Plan.PlanNode,\n  rekeyedDependencies: ReadonlySet<string>,\n  sameField: ReturnType<typeof fieldComparison>\n): ReadonlyArray<string> => {\n  const changed: Array<string> = []\n  // StepKey.materialBody is the identity list this attribution must mirror.\n  // Inputs, layers, and capabilities complete fromKeyMaterial's hashed value,\n  // and material.kind selects the key namespace (content versus tier-bearing\n  // plan declaration), so a tier-only move still re-keys and is blamed here.\n  if (!sameField(previous.material.version, next.material.version, next.id, \"version\")) changed.push(\"version\")\n  if (previous.material.kind !== next.material.kind) changed.push(\"kind\")\n  if (!sameField(previous.material.body, next.material.body, next.id, \"body\")) changed.push(\"body\")\n  if (!sameField(previous.material.nondeterministic, next.material.nondeterministic, next.id, \"nondeterministic\")) {\n    changed.push(\"nondeterministic\")\n  }\n  if (!sameField(previous.material.effects, next.material.effects, next.id, \"effects\")) changed.push(\"effects\")\n  if (!sameField(previous.material.placement, next.material.placement, next.id, \"placement\")) {\n    changed.push(\"placement\")\n  }\n  const width = Math.max(previous.material.inputs.length, next.material.inputs.length)\n  for (let index = 0; index < width; index++) {\n    const before = previous.material.inputs[index]\n    const after = next.material.inputs[index]\n    const field = `input[${index}]`\n    if (before === undefined || after === undefined || !sameField(before, after, next.id, field)) {\n      changed.push(field)\n      continue\n    }\n    if (after._tag !== \"Literal\" && rekeyedDependencies.has(after.from)) changed.push(field)\n  }\n  if (!sameField(previous.material.layers, next.material.layers, next.id, \"layers\")) changed.push(\"layers\")\n  if (!sameField(previous.material.capabilities, next.material.capabilities, next.id, \"capabilities\")) {\n    changed.push(\"capabilities\")\n  }\n  return changed\n}\n\n/**\n * Compares a plan against the last plan for the same flow.\n *\n * Nodes pair in three passes, each over the nodes no earlier pass paired:\n * the same id with the same key, then the same key under any id, then the\n * same id with a different key. The second pass exists because flow node ids\n * can be positional: inserting a step shifts the ids after it while their\n * keys stay equal, and that is one added step, not a re-key of every later\n * one (#3905).\n *\n * `added`, `rekeyed`, and `unchanged` name nodes by their id in `next`;\n * `removed` names nodes by their id in `previous`. A moved id can therefore\n * appear once in `removed` or `added` and once in `unchanged`.\n *\n * @param previous - The last plan recorded for the flow.\n * @param next - The plan to compare against it.\n * @returns The added, removed, re-keyed, and unchanged node ids, each in its\n * plan's node order.\n * @since 0.1.0\n * @category constructors\n */\nexport const diff = (previous: Plan.Plan, next: Plan.Plan): PlanDiff => {\n  // pairs maps a next node to the previous node it is the same step as.\n  const pairs = new Map<Plan.PlanNode, Plan.PlanNode>()\n  const paired = new Set<Plan.PlanNode>()\n  const pair = (node: Plan.PlanNode, original: Plan.PlanNode) => {\n    pairs.set(node, original)\n    paired.add(original)\n  }\n  const before = new Map(previous.nodes.map((node) => [node.id, node]))\n  for (const node of next.nodes) {\n    const original = before.get(node.id)\n    if (original !== undefined && original.key === node.key) pair(node, original)\n  }\n  const byKey = new Map<string, Array<Plan.PlanNode>>()\n  for (const node of previous.nodes) {\n    if (paired.has(node)) continue\n    const same = byKey.get(node.key)\n    if (same === undefined) byKey.set(node.key, [node])\n    else same.push(node)\n  }\n  for (const node of next.nodes) {\n    if (pairs.has(node)) continue\n    const original = byKey.get(node.key)?.shift()\n    if (original !== undefined) pair(node, original)\n  }\n  const rekeyedIds = new Set<string>()\n  for (const node of next.nodes) {\n    if (pairs.has(node)) continue\n    const original = before.get(node.id)\n    if (original !== undefined && !paired.has(original)) {\n      pair(node, original)\n      rekeyedIds.add(node.id)\n    }\n  }\n  const added: Array<string> = []\n  const rekeyed: Array<Rekeyed> = []\n  const unchanged: Array<string> = []\n  const sameField = fieldComparison()\n  for (const node of next.nodes) {\n    const original = pairs.get(node)\n    if (original === undefined) {\n      added.push(node.id)\n      continue\n    }\n    if (original.key === node.key) {\n      unchanged.push(node.id)\n      continue\n    }\n    rekeyed.push({\n      id: node.id,\n      from: original.key,\n      to: node.key,\n      changed: changedFields(original, node, rekeyedIds, sameField)\n    })\n  }\n  return {\n    added,\n    removed: previous.nodes.filter((node) => !paired.has(node)).map((node) => node.id),\n    rekeyed,\n    unchanged\n  }\n}\n"]}

package/dist/esm/Planned.d.ts

@@ -0,0 +1,121 @@
+/**
+ * The placeholder a body sees where a step result will be.
+ *
+ * A flow body runs at PLAN time, so its
+ * own payload is real data while every step result is a value that does not
+ * exist yet. That value has a name and one rule: a planned value may be **passed** — into a payload field,
+ * into a branch, into a map — and field access is allowed, because it records a
+ * reference path. It may never be **computed on**.
+ *
+ * {@link Planned} is branded, so arithmetic is a compile error.
+ * {@link make} returns a strict proxy
+ * whose `Symbol.toPrimitive`, `valueOf`, `toString`, `toJSON`, and call traps
+ * throw {@link module:GraphBuildError.GraphBuildError} rather than let a plan be
+ * built around `NaN` or `"[object Object]"`. The lenient proxy this adapts
+ * (`@smthrs/core`'s `Graph.plannedValue`) answered `toPrimitive` with a
+ * readable string, which is exactly the silent-wrong-plan path this module
+ * exists to close.
+ *
+ * JavaScript does not expose traps for `Boolean(value)` or strict identity
+ * (`value === other`), so those operations cannot be refused at run time.
+ * They reveal only proxy truthiness or identity and never the planned result;
+ * authors must use {@link module:Node.branch} for decisions on real values.
+ * Type-aware ESLint `@typescript-eslint/strict-boolean-expressions` rejects
+ * planned conditions, but does not reject explicit Boolean coercion or all
+ * reference comparisons. Those still require review.
+ *
+ * @since 0.1.0
+ */
+import type * as Types from "effect/Types";
+/**
+ * The brand carried by every planned value, and the key its reference is read
+ * from. Interned with `Symbol.for` so a value that crossed a module boundary is
+ * still recognised. The interned symbol is a recognition aid, not a
+ * capability, so {@link reference} validates the value stored under it.
+ *
+ * @since 0.1.0
+ * @category symbols
+ * @slop
+ */
+export declare const TypeId: unique symbol;
+/**
+ * The type-level form of {@link TypeId}.
+ *
+ * @since 0.1.0
+ * @category symbols
+ * @slop
+ */
+export type TypeId = typeof TypeId;
+/**
+ * What a planned value points at: the node that will produce the result, and
+ * the property path read from it. `path` is empty for the result itself.
+ *
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export interface Reference {
+    readonly node: string;
+    readonly path: ReadonlyArray<string>;
+}
+/**
+ * A {@link Reference} plus the phantom type of the value it stands for, so
+ * `Planned<string>` and `Planned<number>` are not interchangeable.
+ *
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export interface Identity<out T> extends Reference {
+    readonly _T: Types.Covariant<T>;
+}
+/**
+ * A step result that has not been produced yet.
+ *
+ * The brand rejects arithmetic and ordinary value arguments. The mapped half keeps field
+ * access typed — `result.files` is a `Planned` of the field, which is what
+ * makes "pass it on, never compute on it" expressible rather than merely
+ * documented.
+ *
+ * @since 0.1.0
+ * @category models
+ * @slop
+ */
+export type Planned<T> = {
+    readonly [TypeId]: Identity<T>;
+} & ([T] extends [object] ? {
+    readonly [K in keyof T]: Planned<T[K]>;
+} : unknown);
+/**
+ * Creates the strict placeholder standing for a node's result.
+ *
+ * Planning hands one of these to every builder that consumes an upstream
+ * value — a branch arm, a continuation — and reads the {@link Reference} back
+ * off whatever the builder passed it into.
+ *
+ * @since 0.1.0
+ * @category constructors
+ * @slop
+ */
+export declare const make: <T>(node: string) => Planned<T>;
+/**
+ * Reads the reference a planned value records, or `undefined` for anything
+ * else. An interned symbol is a recognition aid rather than a capability, so a
+ * forged carrier is accepted only when its node and path have the complete
+ * reference shape. This is how a payload is scanned for the upstream results
+ * it consumes.
+ *
+ * @since 0.1.0
+ * @category accessors
+ * @slop
+ */
+export declare const reference: (value: unknown) => Reference | undefined;
+/**
+ * Checks whether a value is a planned placeholder.
+ *
+ * @since 0.1.0
+ * @category guards
+ * @slop
+ */
+export declare const isPlanned: (value: unknown) => value is Planned<unknown>;
+//# sourceMappingURL=Planned.d.ts.map

package/dist/esm/Planned.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Planned.d.ts","sourceRoot":"","sources":["../../src/Planned.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,KAAK,KAAK,MAAM,cAAc,CAAA;AAG1C;;;;;;;;;GASG;AACH,eAAO,MAAM,MAAM,EAAE,OAAO,MAA2C,CAAA;AAEvE;;;;;;GAMG;AACH,MAAM,MAAM,MAAM,GAAG,OAAO,MAAM,CAAA;AAElC;;;;;;;GAOG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACrC;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,SAAQ,SAAS;IAChD,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;CAChC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,OAAO,CAAC,CAAC,IACjB;IAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAA;CAAE,GAClC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAAE,GAAG,OAAO,CAAC,CAAA;AAmEjF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,MAAM,MAAM,KAAG,OAAO,CAAC,CAAC,CAAkD,CAAA;AAalG;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,GAAI,OAAO,OAAO,KAAG,SAAS,GAAG,SAItD,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,SAAS,GAAI,OAAO,OAAO,KAAG,KAAK,IAAI,OAAO,CAAC,OAAO,CAAmC,CAAA"}