@llui/compiler 0.5.1 → 0.5.2

package/dist/modules/core-synthesis.js.map

@@ -1 +1 @@
-{"version":3,"file":"core-synthesis.js","sourceRoot":"","sources":["../../src/modules/core-synthesis.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,wEAAwE;AACxE,iEAAiE;AACjE,yEAAyE;AACzE,EAAE;AACF,uEAAuE;AACvE,2DAA2D;AAC3D,iEAAiE;AACjE,wEAAwE;AACxE,qEAAqE;AACrE,sEAAsE;AACtE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,wDAAwD;AACxD,8DAA8D;AAC9D,iEAAiE;AACjE,kEAAkE;AAClE,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,mEAAmE;AACnE,qEAAqE;AACrE,wEAAwE;AACxE,iDAAiD;AAEjD,OAAO,EAAE,MAAM,YAAY,CAAA;AAE3B,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAA;AAiBzF,MAAM,CAAC,MAAM,mBAAmB,GAAG,sBAAsB,CAAA;AAEzD,MAAM,UAAU,mBAAmB,CAAC,IAAgC;IAClE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,IAAI,CAAA;IACnD,OAAO;QACL,IAAI,EAAE,gBAAgB;QACtB,eAAe,EAAE,QAAQ;QACzB,WAAW,EAAE,EAAE;QACf,QAAQ,EAAE,EAAE;QAEZ,kBAAkB,CAAC,GAAG,EAAE,IAAI;YAC1B,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,UAAU,CAAC;gBAAE,OAAO,IAAI,CAAA;YACnD,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAA;YAC3E,IAAI,CAAC,SAAS;gBAAE,OAAO,IAAI,CAAA;YAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,mBAAmB,CAAkC,CAAA;YAC7F,IAAI,IAAI;gBAAE,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAA;;gBAEpC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,mBAAmB,EAAE;oBAC9C,gBAAgB,EAAE,IAAI;iBACF,CAAC,CAAA;YACzB,OAAO,SAAS,CAAA;QAClB,CAAC;KACF,CAAA;AACH,CAAC;AAED,uEAAuE;AAEvE,SAAS,cAAc,CACrB,IAAuB,EACvB,SAA8B,EAC9B,CAAiB,EACjB,cAAmC,IAAI,GAAG,EAAE;IAE5C,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IACnC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAA;IAEvE,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QACxC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC5B,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,+DAA+D;IAC/D,sEAAsE;IACtE,oEAAoE;IACpE,qDAAqD;IACrD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QACpC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;IACrE,CAAC;IACD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA;IAChD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QACpC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;IACzE,CAAC;IAED,wCAAwC;IACxC,MAAM,cAAc,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IAElE,kEAAkE;IAClE,kEAAkE;IAClE,sEAAsE;IACtE,wEAAwE;IACxE,2DAA2D;IAC3D,8DAA8D;IAE9D,6DAA6D;IAC7D,kEAAkE;IAClE,yEAAyE;IACzE,4DAA4D;IAC5D,sEAAsE;IACtE,kDAAkD;IAClD,MAAM,YAAY,GAAG,gBAAgB,CAAC,SAAS,EAAE,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA;IAEjG,mEAAmE;IACnE,sEAAsE;IACtE,8DAA8D;IAC9D,MAAM,UAAU,GAAkC,EAAE,CAAA;IACpD,IAAI,YAAY;QAAE,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;IAE/C,gDAAgD;IAChD,gEAAgE;IAChE,qEAAqE;IACrE,sEAAsE;IACtE,+DAA+D;IAC/D,8DAA8D;IAC9D,iEAAiE;IACjE,sEAAsE;IACtE,mEAAmE;IACnE,EAAE;IACF,iEAAiE;IACjE,2CAA2C;IAC3C,4DAA4D;IAC5D,gEAAgE;IAChE,iEAAiE;IACjE,iEAAiE;IACjE,gEAAgE;IAChE,iEAAiE;IACjE,0DAA0D;IAC1D,MAAM,YAAY,GAAG,iBAAiB,CAAC,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC,CAAA;IACjE,IAAI,YAAY;QAAE,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;IAE/C,MAAM,SAAS,GAAG,CAAC,CAAC,6BAA6B,CAAC,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,GAAG,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;IAEjG,iEAAiE;IACjE,oEAAoE;IACpE,gEAAgE;IAChE,gEAAgE;IAChE,mEAAmE;IACnE,OAAO,CAAC,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE;QACvE,SAAS;QACT,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;KAC3B,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,gBAAgB,CACvB,SAAqC,EACrC,YAAiC,EACjC,cAAmC,EACnC,cAAsB,EACtB,CAAiB;IAEjB,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAErE,mDAAmD;IACnD,IAAI,QAAQ,GAAoD,IAAI,CAAA;IACpE,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QACxC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAC3B,CAAC;YACD,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtF,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAA;YAC7B,CAAC;YACD,MAAK;QACP,CAAC;IACH,CAAC;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAA;IAE1B,+CAA+C;IAC/C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IAC7D,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAEtB,IAAI,UAAU,GAA8B,IAAI,CAAA;IAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,UAAU,GAAG,IAAI,CAAA;YACjB,MAAK;QACP,CAAC;IACH,CAAC;IACD,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAA;IAE5B,oDAAoD;IACpD,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAA;IAC/C,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAA;IAC7C,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC;QACxF,OAAO,IAAI,CAAA;IACb,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAA;IAEjC,2BAA2B;IAC3B,MAAM,QAAQ,GAA4B,EAAE,CAAA;IAE5C,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC;YAAE,SAAQ;QAEtC,kEAAkE;QAClE,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC;YAAE,SAAQ;QACpD,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAA;QAEtC,yEAAyE;QACzE,2EAA2E;QAC3E,oEAAoE;QACpE,MAAM,WAAW,GAAgC,EAAE,CAAA;QACnD,MAAM,cAAc,GAAG,CAAC,IAAa,EAAQ,EAAE;YAC7C,IACE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC;gBAC1B,IAAI,CAAC,UAAU;gBACf,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC5C,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EACpC,CAAC;gBACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;gBACjC,OAAM;YACR,CAAC;YACD,qEAAqE;YACrE,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;gBAC9B,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;gBACxB,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAC5B,CAAC;gBACD,OAAM;YACR,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACvC,CAAC,CAAA;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACrC,cAAc,CAAC,IAAI,CAAC,CAAA;QACtB,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAEtC,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;QACrC,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAA;YACzC,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,cAAc,CAAC,CAAA;YACxF,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,GAAG,IAAI,CAAA;gBACd,MAAK;YACP,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,IAAI,OAAO;YAAE,SAAQ,CAAC,2CAA2C;QAEjE,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAE9C,iEAAiE;QACjE,kEAAkE;QAClE,4DAA4D;QAC5D,4DAA4D;QAC5D,uCAAuC;QACvC,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,IAAI,WAAW,GAAG,CAAC,CAAA;QACnB,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAClC,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YACpC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,SAAS,IAAI,UAAU,GAAG,CAAC,CAAA;YAC7B,CAAC;iBAAM,CAAC;gBACN,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAS,IAAI,EAAE,CAAA;gBACrC,IAAI,EAAE,KAAK,SAAS;oBAAE,WAAW,IAAI,EAAE,CAAA;YACzC,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,SAAS,CAAC,CAAA;QAEhF,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,CAAC,CAAA;QACpE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;IACpF,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAEtC,OAAO,CAAC,CAAC,wBAAwB,CAAC,YAAY,EAAE,CAAC,CAAC,6BAA6B,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;AAClG,CAAC;AAUD;;;;;;GAMG;AACH,SAAS,aAAa,CACpB,MAAqB,EACrB,cAAwB,EACxB,eAAwB,EACxB,UAAmB;IAEnB,qEAAqE;IACrE,kEAAkE;IAClE,yDAAyD;IACzD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAA;IAE9C,+DAA+D;IAC/D,sEAAsE;IACtE,oEAAoE;IACpE,kEAAkE;IAClE,kEAAkE;IAClE,kEAAkE;IAClE,oEAAoE;IACpE,gEAAgE;IAChE,mEAAmE;IACnE,4DAA4D;IAC5D,EAAE;IACF,oEAAoE;IACpE,oEAAoE;IACpE,kEAAkE;IAClE,+DAA+D;IAC/D,gEAAgE;IAChE,kEAAkE;IAClE,6DAA6D;IAC7D,mEAAmE;IACnE,kEAAkE;IAClE,EAAE;IACF,gEAAgE;IAChE,oEAAoE;IACpE,mEAAmE;IACnE,iEAAiE;IACjE,mEAAmE;IACnE,EAAE;IACF,qEAAqE;IACrE,qEAAqE;IACrE,2EAA2E;IAC3E,uEAAuE;IACvE,qCAAqC;IACrC,EAAE;IACF,oBAAoB;IACpB,uFAAuF;IACvF,QAAQ;IACR,EAAE;IACF,4DAA4D;IAC5D,gEAAgE;IAChE,EAAE;IACF,4DAA4D;IAC5D,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,qEAAqE;IACrE,sCAAsC;IACtC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACjD,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAE,CAAA;IAEpC,qDAAqD;IACrD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,UAAU;YAAE,SAAQ;QAEzB,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QACxC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC;YAAE,SAAQ;QAEpE,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,GACR,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzD,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAChB,CAAC,CAAC,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC;oBACtC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CAAA;YACZ,IAAI,CAAC,IAAI;gBAAE,SAAQ;YACnB,4DAA4D;YAC5D,2DAA2D;YAC3D,6DAA6D;YAC7D,8DAA8D;YAC9D,qDAAqD;YACrD,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAQ;YAEhC,6CAA6C;YAC7C,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC7C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACtC,CAAC;gBACD,OAAO,OAAO,CAAA;YAChB,CAAC;YAED,8EAA8E;YAC9E,4FAA4F;YAC5F,IAAI,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAC9B,IAAI,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;oBACxC,2EAA2E;oBAC3E,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;oBAChD,IAAI,MAAM,GAAG,CAAC;wBAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAA;oBAClD,OAAO,QAAQ,CAAA;gBACjB,CAAC;YACH,CAAC;YAED,8EAA8E;YAC9E,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAA;gBAC7B,IACE,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC;oBAC9C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EACtC,CAAC;oBACD,OAAO,QAAQ,CAAA;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,eAAe,CAAC,IAAkB;IACzC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QAC/F,OAAO,IAAI,CAAC,UAAU,CAAA;IACxB,IAAI,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;YACrC,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,MAAqB,EAAE,QAAgB;IAC/D,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAChD,iCAAiC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAA;YAC5B,IACE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC;gBAC1B,GAAG,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,eAAe;gBACxD,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAC9B,CAAC;gBACD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;gBAC3C,IAAI,MAAM,GAAG,CAAC;oBAAE,OAAO,MAAM,CAAA;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IACzC,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,MAAM,GAAG,CAAC;YAAE,OAAO,MAAM,CAAA;IAC/B,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAqB,EAAE,OAAe;IAChE,SAAS,IAAI,CAAC,IAAa;QACzB,oDAAoD;QACpD,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;YAC9B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO;YAC1B,IAAI,CAAC,WAAW,EAChB,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAA;YAC7B,IACE,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC;gBACzB,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC9C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EACrC,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAA;IAC7C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAA;IAC7B,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,SAAwB,EACxB,SAAiB,EACjB,YAAiC,EACjC,iBAAsC,IAAI,GAAG,EAAE;IAE/C,oEAAoE;IACpE,wDAAwD;IACxD,mEAAmE;IACnE,qDAAqD;IACrD,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC/F,kFAAkF;IAClF,IAAI,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAa,EAAE,CAAA;QAC7B,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACxC,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,mEAAmE;gBACnE,8DAA8D;gBAC9D,8DAA8D;gBAC9D,iEAAiE;gBACjE,6DAA6D;gBAC7D,oDAAoD;gBACpD,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC3E,SAAQ;gBACV,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAChC,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;YACD,sEAAsE;YACtE,IAAI,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAChC,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;IAC9C,CAAC;IAED,4CAA4C;IAC5C,IAAI,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/D,OAAO,EAAE,CAAA,CAAC,qBAAqB;IACjC,CAAC;IAED,OAAO,IAAI,CAAA,CAAC,cAAc;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH;;;GAGG;AACH,SAAS,gBAAgB,CACvB,CAAiB,EACjB,SAAiB,EACjB,WAAmB,EACnB,OAAgB;IAEhB,MAAM,MAAM,GACV,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QACvD,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,+BAA+B;QACrD,CAAC,CAAC,OAAO,KAAK,MAAM;YAClB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,OAAO,KAAK,QAAQ;gBACpB,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,KAAK,OAAO;oBACnB,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,OAAO,KAAK,QAAQ;wBACpB,CAAC,CAAC,CAAC;wBACH,CAAC,CAAC,CAAC,CAAA,CAAC,UAAU;IAE1B,kEAAkE;IAClE,MAAM,IAAI,GAAoB;QAC5B,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAC1B,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACzB,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC;QAC/B,MAAM,IAAI,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,2BAA2B,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;KACvF,CAAA;IACD,qEAAqE;IACrE,mEAAmE;IACnE,uEAAuE;IACvE,IAAI,WAAW,KAAK,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAA;IACnE,OAAO,CAAC,CAAC,mBAAmB,CAC1B,SAAS,EACT,SAAS,EACT;QACE,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;QAC1D,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC;KAC1D,EACD,SAAS,EACT,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC,EACnD,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAC3E,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,SAAqC,EACrC,SAA8B;IAE9B,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CACvF,CAAA;IACD,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,QAAQ,CAAC;QAAE,OAAO,UAAU,GAAG,CAAC,CAAA;IAE1E,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,eAAe,GAAG,KAAK,CAAA;IAE3B,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;YACzE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5E,eAAe,GAAG,IAAI,CAAA;gBACtB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBAC9B,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvC,0EAA0E;oBAC1E,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACnC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;4BAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;4BAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAC3B,CAAC;4BACD,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gCAC1C,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;gCAC3C,OAAM;4BACR,CAAC;4BACD,IAAI,EAAE,CAAC,uBAAuB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gCACjD,mCAAmC;gCACnC,IAAI,GAAG,UAAU,GAAG,CAAC,CAAA;gCACrB,OAAM;4BACR,CAAC;wBACH,CAAC;oBACH,CAAC;oBACD,8CAA8C;oBAC9C,MAAM,UAAU,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAA;oBAChF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACnC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;4BAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;4BAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,EAC7B,CAAC;4BACD,IACE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC;gCACpC,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EACzC,CAAC;gCACD,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAA;gCACpE,IAAI,IAAI,CAAC,IAAI,UAAU,GAAG,CAAC,CAAA;4BAC7B,CAAC;4BACD,MAAK;wBACP,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAA;IAC1B,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,iBAAiB,CACxB,SAA8B,EAC9B,WAAgC,EAChC,CAAiB;IAEjB,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/D,mEAAmE;IACnE,sEAAsE;IACtE,8DAA8D;IAC9D,mEAAmE;IACnE,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;SACvC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;SAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAChC,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1E,MAAM,UAAU,GAAG,CAAC,IAAY,EAAoB,EAAE;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAC7B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QACvC,OAAO,CAAC,CAAC,mBAAmB,CAC1B,SAAS,EACT,SAAS,EACT,CAAC,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,EACzD,SAAS,EACT,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC,EACnD,IAAI,CACL,CAAA;IACH,CAAC,CAAA;IACD,MAAM,MAAM,GAAG;QACb,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9C,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;KAC/C,CAAA;IACD,OAAO,CAAC,CAAC,wBAAwB,CAAC,YAAY,EAAE,CAAC,CAAC,4BAA4B,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAA;AAChG,CAAC;AAED,SAAS,WAAW,CAAC,CAAiB,EAAE,IAAY,EAAE,KAAe;IACnE,IAAI,IAAI,GAAkB,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAA;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,yCAAyC;QACzC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,CAAA;QAC/F,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["// `core-synthesis` — owns the co-emitted core trio:\n//   - `__update`         — Phase 1/2 dispatcher; reads `structuralMask`\n//   - `__handlers`       — per-message-type specialized handlers\n//   - `__prefixes`       — array of path-keyed reference-stable closures\n//\n// The three are NOT decomposable into separate modules (per v2c §7.9.2\n// design decision (a) vs (b)): they share `topLevelBits` /\n// `structuralMask` / `fieldBits` intermediates, and `__prefixes`\n// ordering is bit-position-keyed (the array index *is* the bit position\n// used by every binding's mask). Producing them in three independent\n// emit passes would either duplicate the analysis or require a shared\n// scratchpad slot — both lose vs the function's existing single pass.\n//\n// So this module owns the entire synthesis: `tryInjectDirty` plus its\n// ~600 lines of supporting helpers (`tryBuildHandlers`,\n// `buildCaseHandler`, `buildUpdateBody`, `buildPrefixesProp`,\n// `computeStructuralMask`, `buildAccess`, plus the case-analysis\n// helpers `detectArrayOp`, `findReturnArray`, `detectStrideLoop`,\n// `hasSliceAssignment`, `analyzeModifiedFields`). Moved verbatim from\n// transform.ts in v2c/decomp-21.\n//\n// Side-effect: the inline call sets `usesApplyBinding = true` when\n// the rewrite fires (drives `__runPhase2` + `__handleMsg` imports in\n// `cleanupImports`). The module surfaces this via `CORE_SYNTHESIS_SLOT`\n// for the umbrella to read after `registry.run`.\n\nimport ts from 'typescript'\nimport type { CompilerModule } from '../module.js'\nimport { computeAccessorMask, createMaskLiteral, isComponentCall } from '../transform.js'\n\nexport interface CoreSynthesisModuleOptions {\n  fieldBits: Map<string, number>\n  fieldBitsHi: Map<string, number>\n  /** Component() call detection requires the @llui/dom import binding\n   *  to disambiguate from user-local `component` identifiers. */\n  lluiImport: ts.ImportDeclaration\n}\n\nexport interface CoreSynthesisSlot {\n  /** True when at least one component() call got the __update/__handlers/__prefixes\n   *  trio injected — drives `cleanupImports`'s decision about `__runPhase2`\n   *  + `__handleMsg` runtime imports. */\n  usesApplyBinding: boolean\n}\n\nexport const CORE_SYNTHESIS_SLOT = 'core-synthesis:state'\n\nexport function coreSynthesisModule(opts: CoreSynthesisModuleOptions): CompilerModule {\n  const { fieldBits, fieldBitsHi, lluiImport } = opts\n  return {\n    name: 'core-synthesis',\n    compilerVersion: '^0.3.0',\n    diagnostics: [],\n    visitors: {},\n\n    transformCallEnter(ctx, node) {\n      if (!isComponentCall(node, lluiImport)) return null\n      const rewritten = tryInjectDirty(node, fieldBits, ctx.factory, fieldBitsHi)\n      if (!rewritten) return null\n      const slot = ctx.analysis.perModule.get(CORE_SYNTHESIS_SLOT) as CoreSynthesisSlot | undefined\n      if (slot) slot.usesApplyBinding = true\n      else\n        ctx.analysis.perModule.set(CORE_SYNTHESIS_SLOT, {\n          usesApplyBinding: true,\n        } as CoreSynthesisSlot)\n      return rewritten\n    },\n  }\n}\n\n// ─── Synthesis implementation (moved verbatim from transform.ts) ────\n\nfunction tryInjectDirty(\n  node: ts.CallExpression,\n  fieldBits: Map<string, number>,\n  f: ts.NodeFactory,\n  fieldBitsHi: Map<string, number> = new Map(),\n): ts.CallExpression | null {\n  if (fieldBits.size === 0 && fieldBitsHi.size === 0) return null\n  const configArg = node.arguments[0]\n  if (!configArg || !ts.isObjectLiteralExpression(configArg)) return null\n\n  // Check if __dirty already exists\n  for (const prop of configArg.properties) {\n    if (\n      ts.isPropertyAssignment(prop) &&\n      ts.isIdentifier(prop.name) &&\n      prop.name.text === '__dirty'\n    ) {\n      return null\n    }\n  }\n\n  // Top-level field → aggregated bit mask. Sub-paths under one field\n  // (`route.page`, `route.data`) collapse into a single entry so\n  // `tryBuildHandlers` can reason per-field. Positions 0..30 live here;\n  // 31..61 in the parallel high-word map below. `__maskLegend` itself\n  // is now owned by `maskLegendModule` (v2c/decomp-9).\n  const topLevelBits = new Map<string, number>()\n  for (const [path, bit] of fieldBits) {\n    const topField = path.split('.')[0]!\n    topLevelBits.set(topField, (topLevelBits.get(topField) ?? 0) | bit)\n  }\n  const topLevelBitsHi = new Map<string, number>()\n  for (const [path, bit] of fieldBitsHi) {\n    const topField = path.split('.')[0]!\n    topLevelBitsHi.set(topField, (topLevelBitsHi.get(topField) ?? 0) | bit)\n  }\n\n  // Structural mask — used by __handlers.\n  const structuralMask = computeStructuralMask(configArg, fieldBits)\n\n  // v0.4 size-cut (Tier 2.4): the `__update` fast-path emission was\n  // removed. Empirically (see benchmarks/bundle-baseline.json + the\n  // strategy comparison in earlier work) it provided only ~3% wall-time\n  // improvement on a 200-binding sparse-update workload, but cost 200-400\n  // bytes per compiled component plus the dispatch branch in\n  // processMessages. The runtime always uses genericUpdate now.\n\n  // __handlers: per-message-type specialized update functions.\n  // Analyzes the update() switch/case and generates direct handlers\n  // that bypass the generic Phase 1/2 pipeline for single-message updates.\n  // Tier 5 (drop __handlers) was attempted and REVERTED — see\n  // benchmarks/bundle-baseline.json#/abandoned. The 1.4 kB savings cost\n  // 23-89% perf on jfb's swap/remove/update/select.\n  const handlersProp = tryBuildHandlers(configArg, topLevelBits, topLevelBitsHi, structuralMask, f)\n\n  // `__maskLegend` is emitted by `maskLegendModule` via the registry\n  // bridge (v2c/decomp-9); the umbrella's `applyRegistryEmissions` step\n  // splices it into the same config-arg literal we return here.\n  const extraProps: ts.ObjectLiteralElementLike[] = []\n  if (handlersProp) extraProps.push(handlersProp)\n\n  // __prefixes: opt-in path-keyed reactivity (see\n  // docs/proposals/unified-composition-model.md). One closure per\n  // distinct path that an accessor reads, hoisted into a stable array;\n  // the array position IS the bit position used by the path's bindings.\n  // The runtime prefers __prefixes when present and computes the\n  // combinedDirty mask by reference-comparing `prefix(prev)` vs\n  // `prefix(next)` for each entry — strictly more precise than the\n  // top-level-conflated __dirty (which always co-fires bindings sharing\n  // a top-level field even when only one sub-path actually mutated).\n  //\n  // Emit `__prefixes` whenever any reactive paths are present. For\n  // components with ≤31 paths, the runtime's\n  // `computeDirtyFromPrefixes` returns a single `number`; for\n  // 32..61-path components it returns a `[lo, hi]` tuple that the\n  // runtime fans out into `combinedDirty` + `combinedDirtyHi`. The\n  // binding-level mask gating is still single-word at the compiler\n  // emit layer today, so high-position bindings still re-evaluate\n  // every cycle — but the dirty computation itself is now precise,\n  // which lets memo()'d aggregates short-circuit correctly.\n  const prefixesProp = buildPrefixesProp(fieldBits, fieldBitsHi, f)\n  if (prefixesProp) extraProps.push(prefixesProp)\n\n  const newConfig = f.createObjectLiteralExpression([...configArg.properties, ...extraProps], true)\n\n  // `updateCallExpression` (not `createCallExpression`) so the new\n  // node inherits `node.pos` / `node.end` from the original. Phase 2b\n  // downstream consumers (componentMetaModule, etc.) read pos via\n  // `getStart(sf)` for line info; a synthetic node (pos=-1) would\n  // collapse every `component()` call's `__componentMeta.line` to 0.\n  return f.updateCallExpression(node, node.expression, node.typeArguments, [\n    newConfig,\n    ...node.arguments.slice(1),\n  ])\n}\n\n/**\n * Analyze update() switch/case and generate per-message-type handlers.\n *\n * Each handler receives (inst, msg) and returns [newState, effects].\n * The handler calls update() to get the new state, then directly invokes\n * the appropriate runtime primitives (reconcileItems, __directUpdate, etc.)\n * instead of going through the generic Phase 1/2 pipeline.\n *\n * Conservative: only generates handlers for cases where the field\n * modifications are statically determinable. Complex cases are skipped.\n */\nfunction tryBuildHandlers(\n  configArg: ts.ObjectLiteralExpression,\n  topLevelBits: Map<string, number>,\n  topLevelBitsHi: Map<string, number>,\n  structuralMask: number,\n  f: ts.NodeFactory,\n): ts.PropertyAssignment | null {\n  if (topLevelBits.size === 0 && topLevelBitsHi.size === 0) return null\n\n  // Find the update function in the component config\n  let updateFn: ts.ArrowFunction | ts.FunctionExpression | null = null\n  for (const prop of configArg.properties) {\n    if (\n      ts.isPropertyAssignment(prop) &&\n      ts.isIdentifier(prop.name) &&\n      prop.name.text === 'update'\n    ) {\n      if (ts.isArrowFunction(prop.initializer) || ts.isFunctionExpression(prop.initializer)) {\n        updateFn = prop.initializer\n      }\n      break\n    }\n  }\n  if (!updateFn) return null\n\n  // Find the switch statement in the update body\n  const body = ts.isBlock(updateFn.body) ? updateFn.body : null\n  if (!body) return null\n\n  let switchStmt: ts.SwitchStatement | null = null\n  for (const stmt of body.statements) {\n    if (ts.isSwitchStatement(stmt)) {\n      switchStmt = stmt\n      break\n    }\n  }\n  if (!switchStmt) return null\n\n  // Check the switch discriminant is msg.type pattern\n  const stateParam = updateFn.parameters[0]?.name\n  const msgParam = updateFn.parameters[1]?.name\n  if (!stateParam || !msgParam || !ts.isIdentifier(stateParam) || !ts.isIdentifier(msgParam))\n    return null\n  const stateName = stateParam.text\n\n  // Analyze each case clause\n  const handlers: ts.PropertyAssignment[] = []\n\n  for (const clause of switchStmt.caseBlock.clauses) {\n    if (!ts.isCaseClause(clause)) continue\n\n    // Extract the case label — must be a string literal like 'select'\n    if (!ts.isStringLiteral(clause.expression)) continue\n    const msgType = clause.expression.text\n\n    // Collect ALL return [newState, effects] statements recursively from the\n    // case body. Multiple returns (from if/else branches) must all be analyzed\n    // so the handler's dirty mask covers every possible modified field.\n    const returnExprs: ts.ArrayLiteralExpression[] = []\n    const collectReturns = (node: ts.Node): void => {\n      if (\n        ts.isReturnStatement(node) &&\n        node.expression &&\n        ts.isArrayLiteralExpression(node.expression) &&\n        node.expression.elements.length >= 2\n      ) {\n        returnExprs.push(node.expression)\n        return\n      }\n      // Don't descend into nested functions — their returns are unrelated.\n      if (\n        ts.isFunctionDeclaration(node) ||\n        ts.isFunctionExpression(node) ||\n        ts.isArrowFunction(node) ||\n        ts.isMethodDeclaration(node)\n      ) {\n        return\n      }\n      ts.forEachChild(node, collectReturns)\n    }\n    for (const stmt of clause.statements) {\n      collectReturns(stmt)\n    }\n    if (returnExprs.length === 0) continue\n\n    // Union modified fields across all return paths.\n    const allModified = new Set<string>()\n    let bailOut = false\n    for (const returnExpr of returnExprs) {\n      const stateExpr = returnExpr.elements[0]!\n      const fields = analyzeModifiedFields(stateExpr, stateName, topLevelBits, topLevelBitsHi)\n      if (!fields) {\n        bailOut = true\n        break\n      }\n      for (const f of fields) allModified.add(f)\n    }\n    if (bailOut) continue // at least one return path was too complex\n\n    const modifiedFields = Array.from(allModified)\n\n    // Compute the dirty mask for this case across both words. Fields\n    // tracked in `topLevelBitsHi` contribute to `caseDirtyHi`; fields\n    // tracked nowhere (`undefined` lookup in both) fall back to\n    // FULL_MASK in the low word — same conservative behavior as\n    // before, just preserved per-word now.\n    let caseDirty = 0\n    let caseDirtyHi = 0\n    for (const field of modifiedFields) {\n      const lo = topLevelBits.get(field)\n      const hi = topLevelBitsHi.get(field)\n      if (lo === undefined && hi === undefined) {\n        caseDirty |= 0xffffffff | 0\n      } else {\n        if (lo !== undefined) caseDirty |= lo\n        if (hi !== undefined) caseDirtyHi |= hi\n      }\n    }\n\n    // Detect array operation pattern for structural block optimization\n    const arrayOp = detectArrayOp(clause, modifiedFields, structuralMask, caseDirty)\n\n    const handler = buildCaseHandler(f, caseDirty, caseDirtyHi, arrayOp)\n    handlers.push(f.createPropertyAssignment(f.createStringLiteral(msgType), handler))\n  }\n\n  if (handlers.length === 0) return null\n\n  return f.createPropertyAssignment('__handlers', f.createObjectLiteralExpression(handlers, true))\n}\n\ntype ArrayOp =\n  | 'none'\n  | 'clear'\n  | 'mutate'\n  | 'remove'\n  | 'general'\n  | { type: 'strided'; stride: number } // for (i = 0; i < len; i += stride) pattern\n\n/**\n * Detect the array operation pattern in a case body.\n * - 'none': no array field modified (e.g., only `selected` changes)\n * - 'clear': array set to empty literal `[]`\n * - 'mutate': array created via `.slice()` then mutated in place (same keys)\n * - 'general': unknown pattern, use generic reconcile\n */\nfunction detectArrayOp(\n  clause: ts.CaseClause,\n  modifiedFields: string[],\n  _structuralMask?: number,\n  _caseDirty?: number,\n): ArrayOp {\n  // No fields modified → no Phase 1 needed (no bindings can care if no\n  // state field changed). Safe to return 'none' here because it's a\n  // tautology: every binding mask ANDed with zero is zero.\n  if (modifiedFields.length === 0) return 'none'\n\n  // The specialized methods (`reconcileClear`, `reconcileItems`,\n  // `reconcileRemove`, `reconcileChanged`) only exist on `each` blocks.\n  // Non-each blocks (`show`, `branch`, `scope`) leave them undefined,\n  // so a method other than 0 (general reconcile) silently no-ops on\n  // those blocks at runtime. If the case modifies fields BEYOND the\n  // array op (e.g. `{ ...state, open: true, name: '', tags: [] }`),\n  // any show/branch block whose mask intersects the case's dirty bits\n  // would be selected for reconcile but then skipped by the no-op\n  // method invocation — its `when`/`on` accessor never re-evaluates,\n  // and the component appears structurally inert after mount.\n  //\n  // Conservative correctness: only emit a non-general method when the\n  // array op is the SOLE field modification. With one modified field,\n  // the only blocks selected by mask gating are ones that read that\n  // single field — and the optimization is well-defined for that\n  // narrow case (each blocks operating on the array). Multi-field\n  // cases fall through to `'general'` (method=0), so every selected\n  // block runs the standard `reconcile` path. We trade a niche\n  // optimization (small benefit even when applicable) for guaranteed\n  // structural reconciliation across the framework's primitive set.\n  //\n  // Sister of show-helper-reconcile.test.ts, which fixed the same\n  // class of bug on the method=-1 path. Same architectural principle:\n  // the compiler can't see every block in the view, so optimizations\n  // that route around `reconcile` must be ironclad. When in doubt,\n  // emit method=0 and let `_handleMsg`'s per-block mask gate filter.\n  //\n  // Previously: if `(structuralMask & caseDirty) === 0`, return 'none'\n  // on the theory that no structural block's mask could intersect this\n  // case's dirty bits. That optimization was UNSAFE: `computeStructuralMask`\n  // only walks the view function's lexical AST and does not descend into\n  // helper function calls. A view like\n  //\n  //     view: () => [\n  //       ...show({ when: s => s.mode === 'signin', render: () => [signinFormBody()] }),\n  //     ]\n  //\n  // where `signinFormBody()` is a helper that internally does\n  //     ...show({ when: s => s.errors.email !== undefined, ... })\n  //\n  // produces a `structuralMask` that covers `mode` but MISSES\n  // `errors.email`. At runtime the inner show block is still registered\n  // in `inst.structuralBlocks`, and it legitimately needs to reconcile\n  // when `errors` changes — but the compiler was emitting `method = -1`\n  // (skip blocks entirely) for cases that only touch `errors`, and the\n  // error paragraphs would never mount.\n  if (modifiedFields.length !== 1) return 'general'\n  const onlyField = modifiedFields[0]!\n\n  // Look at the return expression's array field values\n  for (const stmt of clause.statements) {\n    const returnExpr = findReturnArray(stmt)\n    if (!returnExpr) continue\n\n    const stateExpr = returnExpr.elements[0]\n    if (!stateExpr || !ts.isObjectLiteralExpression(stateExpr)) continue\n\n    for (const prop of stateExpr.properties) {\n      const name =\n        ts.isPropertyAssignment(prop) && ts.isIdentifier(prop.name)\n          ? prop.name.text\n          : ts.isShorthandPropertyAssignment(prop)\n            ? prop.name.text\n            : null\n      if (!name) continue\n      // The optimization only applies when the array op is on the\n      // single tracked field. A `field: []` on a different field\n      // (one not in modifiedFields, e.g. an untracked field) would\n      // still no-op safely on each blocks via the mask gate, but to\n      // keep the analysis tight we require an exact match.\n      if (name !== onlyField) continue\n\n      // Check for empty array literal: `field: []`\n      if (\n        ts.isPropertyAssignment(prop) &&\n        ts.isArrayLiteralExpression(prop.initializer) &&\n        prop.initializer.elements.length === 0\n      ) {\n        return 'clear'\n      }\n\n      // Check for shorthand `field` where field was assigned via `.slice()` earlier\n      // This catches: `const rows = state.rows.slice(); rows[i] = ...; return { ...state, rows }`\n      if (ts.isShorthandPropertyAssignment(prop)) {\n        const varName = prop.name.text\n        if (hasSliceAssignment(clause, varName)) {\n          // Check for strided for-loop: for (let i = 0; i < arr.length; i += STRIDE)\n          const stride = detectStrideLoop(clause, varName)\n          if (stride > 1) return { type: 'strided', stride }\n          return 'mutate'\n        }\n      }\n\n      // Check for property assignment with filter: `field: state.field.filter(...)`\n      if (ts.isPropertyAssignment(prop) && ts.isCallExpression(prop.initializer)) {\n        const call = prop.initializer\n        if (\n          ts.isPropertyAccessExpression(call.expression) &&\n          call.expression.name.text === 'filter'\n        ) {\n          return 'remove'\n        }\n      }\n    }\n  }\n\n  return 'general'\n}\n\nfunction findReturnArray(stmt: ts.Statement): ts.ArrayLiteralExpression | null {\n  if (ts.isReturnStatement(stmt) && stmt.expression && ts.isArrayLiteralExpression(stmt.expression))\n    return stmt.expression\n  if (ts.isBlock(stmt)) {\n    for (const inner of stmt.statements) {\n      const result = findReturnArray(inner)\n      if (result) return result\n    }\n  }\n  return null\n}\n\n/**\n * Detect a strided for-loop: `for (let i = 0; i < arr.length; i += STRIDE)`\n * where `arr` is the named variable. Returns the stride or 0 if not found.\n */\nfunction detectStrideLoop(clause: ts.CaseClause, _arrName: string): number {\n  function walk(node: ts.Node): number {\n    if (ts.isForStatement(node) && node.incrementor) {\n      // Check incrementor: i += STRIDE\n      const inc = node.incrementor\n      if (\n        ts.isBinaryExpression(inc) &&\n        inc.operatorToken.kind === ts.SyntaxKind.PlusEqualsToken &&\n        ts.isNumericLiteral(inc.right)\n      ) {\n        const stride = parseInt(inc.right.text, 10)\n        if (stride > 1) return stride\n      }\n    }\n    return ts.forEachChild(node, walk) ?? 0\n  }\n  for (const stmt of clause.statements) {\n    const result = walk(stmt)\n    if (result > 0) return result\n  }\n  return 0\n}\n\nfunction hasSliceAssignment(clause: ts.CaseClause, varName: string): boolean {\n  function walk(node: ts.Node): boolean {\n    // Look for: const varName = stateName.field.slice()\n    if (\n      ts.isVariableDeclaration(node) &&\n      ts.isIdentifier(node.name) &&\n      node.name.text === varName &&\n      node.initializer\n    ) {\n      const init = node.initializer\n      if (\n        ts.isCallExpression(init) &&\n        ts.isPropertyAccessExpression(init.expression) &&\n        init.expression.name.text === 'slice'\n      ) {\n        return true\n      }\n    }\n    return ts.forEachChild(node, walk) ?? false\n  }\n  for (const stmt of clause.statements) {\n    if (walk(stmt)) return true\n  }\n  return false\n}\n\n/**\n * Analyze which top-level state fields are modified in a return expression.\n * Returns the set of field names, or null if too complex to determine.\n */\nfunction analyzeModifiedFields(\n  stateExpr: ts.Expression,\n  stateName: string,\n  topLevelBits: Map<string, number>,\n  topLevelBitsHi: Map<string, number> = new Map(),\n): string[] | null {\n  // Recognize fields tracked in EITHER the low-word or high-word map.\n  // 32..61-prefix components have their overflow paths in\n  // `topLevelBitsHi`; the case handler's `caseDirty` / `caseDirtyHi`\n  // logic depends on us recognizing those fields here.\n  const isTracked = (name: string): boolean => topLevelBits.has(name) || topLevelBitsHi.has(name)\n  // Pattern: { ...state, field1: ..., field2: ... } or { field1: ..., field2: ... }\n  if (ts.isObjectLiteralExpression(stateExpr)) {\n    const modified: string[] = []\n    for (const prop of stateExpr.properties) {\n      if (ts.isSpreadAssignment(prop)) {\n        // Only `...state` is safe to ignore — re-spreading state back into\n        // state doesn't change any field's identity. ANY other spread\n        // (e.g. `...msg.props`, `...someObj`) can overwrite arbitrary\n        // top-level fields with new references, and we cannot know which\n        // ones statically. Bail out so the generic Phase 2 path runs\n        // `__dirty` at runtime and produces a correct mask.\n        if (ts.isIdentifier(prop.expression) && prop.expression.text === stateName) {\n          continue\n        }\n        return null\n      }\n      if (ts.isPropertyAssignment(prop) && ts.isIdentifier(prop.name)) {\n        const fieldName = prop.name.text\n        if (isTracked(fieldName)) {\n          modified.push(fieldName)\n        }\n      }\n      // Handle shorthand: { ...state, rows } where rows is a local variable\n      if (ts.isShorthandPropertyAssignment(prop)) {\n        const fieldName = prop.name.text\n        if (isTracked(fieldName)) {\n          modified.push(fieldName)\n        }\n      }\n    }\n    return modified.length > 0 ? modified : null\n  }\n\n  // Pattern: state (no change — early return)\n  if (ts.isIdentifier(stateExpr) && stateExpr.text === stateName) {\n    return [] // no fields modified\n  }\n\n  return null // too complex\n}\n\n/**\n * Build a handler function for a specific message type case.\n *\n * Generated: (inst, msg) => {\n *   const [s, e] = inst.def.update(inst.state, msg)\n *   inst.state = s\n *   const bl = inst.structuralBlocks, b = inst.allBindings, p = b.length\n *   // Phase 1: gated by caseDirty\n *   for (let i = 0; i < bl.length; i++) {\n *     if (bl[i].mask & caseDirty) bl[i].reconcile(s, caseDirty)\n *   }\n *   // Phase 2\n *   __runPhase2(s, caseDirty, b, p)\n *   return [s, e]\n * }\n */\n/**\n * Build a handler that delegates to __handleMsg(inst, msg, dirty, method).\n * method: 0=reconcile, 1=reconcileItems, 2=reconcileClear, 3=reconcileRemove, -1=skip blocks\n */\nfunction buildCaseHandler(\n  f: ts.NodeFactory,\n  caseDirty: number,\n  caseDirtyHi: number,\n  arrayOp: ArrayOp,\n): ts.ArrowFunction {\n  const method =\n    typeof arrayOp === 'object' && arrayOp.type === 'strided'\n      ? 10 + arrayOp.stride // reconcileChanged with stride\n      : arrayOp === 'none'\n        ? -1\n        : arrayOp === 'mutate'\n          ? 1\n          : arrayOp === 'clear'\n            ? 2\n            : arrayOp === 'remove'\n              ? 3\n              : 0 // general\n\n  // (inst, msg) => __handleMsg(inst, msg, dirty, method, [dirtyHi])\n  const args: ts.Expression[] = [\n    f.createIdentifier('inst'),\n    f.createIdentifier('msg'),\n    createMaskLiteral(f, caseDirty),\n    method >= 0\n      ? f.createNumericLiteral(method)\n      : f.createPrefixUnaryExpression(ts.SyntaxKind.MinusToken, f.createNumericLiteral(1)),\n  ]\n  // Emit the 5th positional arg only when the case touches a high-word\n  // field. Stale runtime bundles' _handleMsg signatures ignored that\n  // slot anyway; new ones (defaulted to 0) make it explicit when needed.\n  if (caseDirtyHi !== 0) args.push(createMaskLiteral(f, caseDirtyHi))\n  return f.createArrowFunction(\n    undefined,\n    undefined,\n    [\n      f.createParameterDeclaration(undefined, undefined, 'inst'),\n      f.createParameterDeclaration(undefined, undefined, 'msg'),\n    ],\n    undefined,\n    f.createToken(ts.SyntaxKind.EqualsGreaterThanToken),\n    f.createCallExpression(f.createIdentifier('__handleMsg'), undefined, args),\n  )\n}\n\n/**\n * Compute the OR of all structural block masks found in the view function.\n * Returns FULL_MASK if any structural block uses FULL_MASK or if no blocks found.\n */\nfunction computeStructuralMask(\n  configArg: ts.ObjectLiteralExpression,\n  fieldBits: Map<string, number>,\n): number {\n  const viewProp = configArg.properties.find(\n    (p) => ts.isPropertyAssignment(p) && ts.isIdentifier(p.name) && p.name.text === 'view',\n  )\n  if (!viewProp || !ts.isPropertyAssignment(viewProp)) return 0xffffffff | 0\n\n  let mask = 0\n  let foundStructural = false\n\n  function walk(node: ts.Node): void {\n    if (ts.isCallExpression(node)) {\n      const name = ts.isIdentifier(node.expression) ? node.expression.text : ''\n      if (['each', 'branch', 'scope', 'show'].includes(name) && node.arguments[0]) {\n        foundStructural = true\n        const opts = node.arguments[0]\n        if (ts.isObjectLiteralExpression(opts)) {\n          // Check for __mask property (already injected by tryInjectStructuralMask)\n          for (const prop of opts.properties) {\n            if (\n              ts.isPropertyAssignment(prop) &&\n              ts.isIdentifier(prop.name) &&\n              prop.name.text === '__mask'\n            ) {\n              if (ts.isNumericLiteral(prop.initializer)) {\n                mask |= parseInt(prop.initializer.text, 10)\n                return\n              }\n              if (ts.isPrefixUnaryExpression(prop.initializer)) {\n                // Handle negative literals like -1\n                mask = 0xffffffff | 0\n                return\n              }\n            }\n          }\n          // No __mask found — use driving accessor mask\n          const driverProp = name === 'each' ? 'items' : name === 'branch' ? 'on' : 'when'\n          for (const prop of opts.properties) {\n            if (\n              ts.isPropertyAssignment(prop) &&\n              ts.isIdentifier(prop.name) &&\n              prop.name.text === driverProp\n            ) {\n              if (\n                ts.isArrowFunction(prop.initializer) ||\n                ts.isFunctionExpression(prop.initializer)\n              ) {\n                const { mask: m } = computeAccessorMask(prop.initializer, fieldBits)\n                mask |= m || 0xffffffff | 0\n              }\n              break\n            }\n          }\n        }\n      }\n    }\n    ts.forEachChild(node, walk)\n  }\n\n  walk(viewProp.initializer)\n  return foundStructural ? mask || 0xffffffff | 0 : 0\n}\n\n/**\n * Build the `__prefixes` property assignment from path → bit maps.\n *\n * Emits one arrow `(s) => s.<path>` per distinct path. Array index =\n * the path's bit position: positions 0..30 come from `fieldBits` (low\n * word), positions 31..61 from `fieldBitsHi` (high word). The runtime\n * walks this array and reference-compares `prefix(prev)` vs\n * `prefix(next)` per entry, fanning bits into a `(lo, hi)` pair when\n * the array length exceeds 31.\n *\n * Returns null if no paths are present.\n */\nfunction buildPrefixesProp(\n  fieldBits: Map<string, number>,\n  fieldBitsHi: Map<string, number>,\n  f: ts.NodeFactory,\n): ts.PropertyAssignment | null {\n  if (fieldBits.size === 0 && fieldBitsHi.size === 0) return null\n  // Sort paths by bit value within each word. Bits are powers of two\n  // inside their word (1, 2, 4, …, 1<<30), so sorting numerically gives\n  // ascending bit position. FULL_MASK (-1) entries from past-61\n  // overflow shouldn't drive a prefix entry — defensively skip them.\n  const orderedLo = [...fieldBits.entries()]\n    .filter(([, bit]) => bit > 0)\n    .sort(([, a], [, b]) => a - b)\n  const orderedHi = [...fieldBitsHi.entries()].sort(([, a], [, b]) => a - b)\n  const buildArrow = (path: string): ts.ArrowFunction => {\n    const parts = path.split('.')\n    const body = buildAccess(f, 's', parts)\n    return f.createArrowFunction(\n      undefined,\n      undefined,\n      [f.createParameterDeclaration(undefined, undefined, 's')],\n      undefined,\n      f.createToken(ts.SyntaxKind.EqualsGreaterThanToken),\n      body,\n    )\n  }\n  const arrows = [\n    ...orderedLo.map(([path]) => buildArrow(path)),\n    ...orderedHi.map(([path]) => buildArrow(path)),\n  ]\n  return f.createPropertyAssignment('__prefixes', f.createArrayLiteralExpression(arrows, false))\n}\n\nfunction buildAccess(f: ts.NodeFactory, root: string, parts: string[]): ts.Expression {\n  let expr: ts.Expression = f.createIdentifier(root)\n  for (const part of parts) {\n    // Use optional chaining for nested paths\n    if (parts.length > 1) {\n      expr = f.createPropertyAccessChain(expr, f.createToken(ts.SyntaxKind.QuestionDotToken), part)\n    } else {\n      expr = f.createPropertyAccessExpression(expr, part)\n    }\n  }\n  return expr\n}\n"]}
+{"version":3,"file":"core-synthesis.js","sourceRoot":"","sources":["../../src/modules/core-synthesis.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,wEAAwE;AACxE,iEAAiE;AACjE,yEAAyE;AACzE,EAAE;AACF,uEAAuE;AACvE,2DAA2D;AAC3D,iEAAiE;AACjE,wEAAwE;AACxE,qEAAqE;AACrE,sEAAsE;AACtE,sEAAsE;AACtE,EAAE;AACF,sEAAsE;AACtE,wDAAwD;AACxD,8DAA8D;AAC9D,iEAAiE;AACjE,kEAAkE;AAClE,sEAAsE;AACtE,iCAAiC;AACjC,EAAE;AACF,mEAAmE;AACnE,qEAAqE;AACrE,wEAAwE;AACxE,iDAAiD;AAEjD,OAAO,EAAE,MAAM,YAAY,CAAA;AAE3B,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAA;AAwBzF,MAAM,CAAC,MAAM,mBAAmB,GAAG,sBAAsB,CAAA;AAEzD,MAAM,UAAU,mBAAmB,CAAC,IAAgC;IAClE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,iBAAiB,GAAG,KAAK,EAAE,GAAG,IAAI,CAAA;IAC9E,OAAO;QACL,IAAI,EAAE,gBAAgB;QACtB,eAAe,EAAE,QAAQ;QACzB,WAAW,EAAE,EAAE;QACf,QAAQ,EAAE,EAAE;QAEZ,kBAAkB,CAAC,GAAG,EAAE,IAAI;YAC1B,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,UAAU,CAAC;gBAAE,OAAO,IAAI,CAAA;YACnD,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,OAAO,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAA;YAC9F,IAAI,CAAC,SAAS;gBAAE,OAAO,IAAI,CAAA;YAC3B,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,mBAAmB,CAAkC,CAAA;YAC7F,IAAI,IAAI;gBAAE,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAA;;gBAEpC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,mBAAmB,EAAE;oBAC9C,gBAAgB,EAAE,IAAI;iBACF,CAAC,CAAA;YACzB,OAAO,SAAS,CAAA;QAClB,CAAC;KACF,CAAA;AACH,CAAC;AAED,uEAAuE;AAEvE,SAAS,cAAc,CACrB,IAAuB,EACvB,SAA8B,EAC9B,CAAiB,EACjB,cAAmC,IAAI,GAAG,EAAE,EAC5C,oBAA6B,KAAK;IAElC,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,iBAAiB;QAAE,OAAO,IAAI,CAAA;IACrF,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IACnC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAA;IAEvE,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QACxC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAC5B,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,+DAA+D;IAC/D,sEAAsE;IACtE,oEAAoE;IACpE,qDAAqD;IACrD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QACpC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;IACrE,CAAC;IACD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA;IAChD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAA;QACpC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;IACzE,CAAC;IAED,wCAAwC;IACxC,MAAM,cAAc,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IAElE,kEAAkE;IAClE,kEAAkE;IAClE,sEAAsE;IACtE,wEAAwE;IACxE,2DAA2D;IAC3D,8DAA8D;IAE9D,6DAA6D;IAC7D,kEAAkE;IAClE,yEAAyE;IACzE,4DAA4D;IAC5D,sEAAsE;IACtE,kDAAkD;IAClD,MAAM,YAAY,GAAG,gBAAgB,CAAC,SAAS,EAAE,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,CAAC,CAAC,CAAA;IAEjG,mEAAmE;IACnE,sEAAsE;IACtE,8DAA8D;IAC9D,MAAM,UAAU,GAAkC,EAAE,CAAA;IACpD,IAAI,YAAY;QAAE,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;IAE/C,gDAAgD;IAChD,gEAAgE;IAChE,qEAAqE;IACrE,sEAAsE;IACtE,+DAA+D;IAC/D,8DAA8D;IAC9D,iEAAiE;IACjE,sEAAsE;IACtE,mEAAmE;IACnE,EAAE;IACF,iEAAiE;IACjE,2CAA2C;IAC3C,4DAA4D;IAC5D,gEAAgE;IAChE,iEAAiE;IACjE,iEAAiE;IACjE,gEAAgE;IAChE,iEAAiE;IACjE,0DAA0D;IAC1D,MAAM,YAAY,GAAG,iBAAiB,CAAC,SAAS,EAAE,WAAW,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAA;IACpF,IAAI,YAAY;QAAE,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;IAE/C,MAAM,SAAS,GAAG,CAAC,CAAC,6BAA6B,CAAC,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,GAAG,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;IAEjG,iEAAiE;IACjE,oEAAoE;IACpE,gEAAgE;IAChE,gEAAgE;IAChE,mEAAmE;IACnE,OAAO,CAAC,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE;QACvE,SAAS;QACT,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;KAC3B,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,gBAAgB,CACvB,SAAqC,EACrC,YAAiC,EACjC,cAAmC,EACnC,cAAsB,EACtB,CAAiB;IAEjB,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAErE,mDAAmD;IACnD,IAAI,QAAQ,GAAoD,IAAI,CAAA;IACpE,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;QACxC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAC3B,CAAC;YACD,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtF,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAA;YAC7B,CAAC;YACD,MAAK;QACP,CAAC;IACH,CAAC;IACD,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAA;IAE1B,+CAA+C;IAC/C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IAC7D,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAEtB,IAAI,UAAU,GAA8B,IAAI,CAAA;IAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,UAAU,GAAG,IAAI,CAAA;YACjB,MAAK;QACP,CAAC;IACH,CAAC;IACD,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAA;IAE5B,oDAAoD;IACpD,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAA;IAC/C,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAA;IAC7C,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC;QACxF,OAAO,IAAI,CAAA;IACb,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAA;IAEjC,2BAA2B;IAC3B,MAAM,QAAQ,GAA4B,EAAE,CAAA;IAE5C,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC;YAAE,SAAQ;QAEtC,kEAAkE;QAClE,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC;YAAE,SAAQ;QACpD,MAAM,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAA;QAEtC,yEAAyE;QACzE,2EAA2E;QAC3E,oEAAoE;QACpE,MAAM,WAAW,GAAgC,EAAE,CAAA;QACnD,MAAM,cAAc,GAAG,CAAC,IAAa,EAAQ,EAAE;YAC7C,IACE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC;gBAC1B,IAAI,CAAC,UAAU;gBACf,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC5C,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EACpC,CAAC;gBACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;gBACjC,OAAM;YACR,CAAC;YACD,qEAAqE;YACrE,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;gBAC9B,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;gBACxB,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAC5B,CAAC;gBACD,OAAM;YACR,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACvC,CAAC,CAAA;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACrC,cAAc,CAAC,IAAI,CAAC,CAAA;QACtB,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAEtC,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;QACrC,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAA;YACzC,MAAM,MAAM,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,cAAc,CAAC,CAAA;YACxF,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,GAAG,IAAI,CAAA;gBACd,MAAK;YACP,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,IAAI,OAAO;YAAE,SAAQ,CAAC,2CAA2C;QAEjE,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAE9C,iEAAiE;QACjE,kEAAkE;QAClE,4DAA4D;QAC5D,4DAA4D;QAC5D,uCAAuC;QACvC,IAAI,SAAS,GAAG,CAAC,CAAA;QACjB,IAAI,WAAW,GAAG,CAAC,CAAA;QACnB,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAClC,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YACpC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,SAAS,IAAI,UAAU,GAAG,CAAC,CAAA;YAC7B,CAAC;iBAAM,CAAC;gBACN,IAAI,EAAE,KAAK,SAAS;oBAAE,SAAS,IAAI,EAAE,CAAA;gBACrC,IAAI,EAAE,KAAK,SAAS;oBAAE,WAAW,IAAI,EAAE,CAAA;YACzC,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,SAAS,CAAC,CAAA;QAEhF,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,CAAC,CAAA;QACpE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAA;IACpF,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAEtC,OAAO,CAAC,CAAC,wBAAwB,CAAC,YAAY,EAAE,CAAC,CAAC,6BAA6B,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAA;AAClG,CAAC;AAUD;;;;;;GAMG;AACH,SAAS,aAAa,CACpB,MAAqB,EACrB,cAAwB,EACxB,eAAwB,EACxB,UAAmB;IAEnB,qEAAqE;IACrE,kEAAkE;IAClE,yDAAyD;IACzD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAA;IAE9C,+DAA+D;IAC/D,sEAAsE;IACtE,oEAAoE;IACpE,kEAAkE;IAClE,kEAAkE;IAClE,kEAAkE;IAClE,oEAAoE;IACpE,gEAAgE;IAChE,mEAAmE;IACnE,4DAA4D;IAC5D,EAAE;IACF,oEAAoE;IACpE,oEAAoE;IACpE,kEAAkE;IAClE,+DAA+D;IAC/D,gEAAgE;IAChE,kEAAkE;IAClE,6DAA6D;IAC7D,mEAAmE;IACnE,kEAAkE;IAClE,EAAE;IACF,gEAAgE;IAChE,oEAAoE;IACpE,mEAAmE;IACnE,iEAAiE;IACjE,mEAAmE;IACnE,EAAE;IACF,qEAAqE;IACrE,qEAAqE;IACrE,2EAA2E;IAC3E,uEAAuE;IACvE,qCAAqC;IACrC,EAAE;IACF,oBAAoB;IACpB,uFAAuF;IACvF,QAAQ;IACR,EAAE;IACF,4DAA4D;IAC5D,gEAAgE;IAChE,EAAE;IACF,4DAA4D;IAC5D,sEAAsE;IACtE,qEAAqE;IACrE,sEAAsE;IACtE,qEAAqE;IACrE,sCAAsC;IACtC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACjD,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAE,CAAA;IAEpC,qDAAqD;IACrD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,UAAU;YAAE,SAAQ;QAEzB,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;QACxC,IAAI,CAAC,SAAS,IAAI,CAAC,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC;YAAE,SAAQ;QAEpE,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,GACR,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzD,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAChB,CAAC,CAAC,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC;oBACtC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CAAA;YACZ,IAAI,CAAC,IAAI;gBAAE,SAAQ;YACnB,4DAA4D;YAC5D,2DAA2D;YAC3D,6DAA6D;YAC7D,8DAA8D;YAC9D,qDAAqD;YACrD,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAQ;YAEhC,6CAA6C;YAC7C,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;gBAC7B,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC7C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACtC,CAAC;gBACD,OAAO,OAAO,CAAA;YAChB,CAAC;YAED,8EAA8E;YAC9E,4FAA4F;YAC5F,IAAI,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAC9B,IAAI,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;oBACxC,2EAA2E;oBAC3E,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;oBAChD,IAAI,MAAM,GAAG,CAAC;wBAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAA;oBAClD,OAAO,QAAQ,CAAA;gBACjB,CAAC;YACH,CAAC;YAED,8EAA8E;YAC9E,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAA;gBAC7B,IACE,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC;oBAC9C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EACtC,CAAC;oBACD,OAAO,QAAQ,CAAA;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,eAAe,CAAC,IAAkB;IACzC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC;QAC/F,OAAO,IAAI,CAAC,UAAU,CAAA;IACxB,IAAI,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;YACrC,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,MAAqB,EAAE,QAAgB;IAC/D,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAChD,iCAAiC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAA;YAC5B,IACE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC;gBAC1B,GAAG,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,eAAe;gBACxD,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAC9B,CAAC;gBACD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;gBAC3C,IAAI,MAAM,GAAG,CAAC;oBAAE,OAAO,MAAM,CAAA;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;IACzC,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,MAAM,GAAG,CAAC;YAAE,OAAO,MAAM,CAAA;IAC/B,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAqB,EAAE,OAAe;IAChE,SAAS,IAAI,CAAC,IAAa;QACzB,oDAAoD;QACpD,IACE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;YAC9B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO;YAC1B,IAAI,CAAC,WAAW,EAChB,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAA;YAC7B,IACE,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC;gBACzB,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC9C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EACrC,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAA;IAC7C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAA;IAC7B,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,SAAwB,EACxB,SAAiB,EACjB,YAAiC,EACjC,iBAAsC,IAAI,GAAG,EAAE;IAE/C,oEAAoE;IACpE,wDAAwD;IACxD,mEAAmE;IACnE,qDAAqD;IACrD,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC/F,kFAAkF;IAClF,IAAI,EAAE,CAAC,yBAAyB,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAa,EAAE,CAAA;QAC7B,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,EAAE,CAAC;YACxC,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,mEAAmE;gBACnE,8DAA8D;gBAC9D,8DAA8D;gBAC9D,iEAAiE;gBACjE,6DAA6D;gBAC7D,oDAAoD;gBACpD,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;oBAC3E,SAAQ;gBACV,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAChC,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;YACD,sEAAsE;YACtE,IAAI,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;gBAChC,IAAI,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAA;IAC9C,CAAC;IAED,4CAA4C;IAC5C,IAAI,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/D,OAAO,EAAE,CAAA,CAAC,qBAAqB;IACjC,CAAC;IAED,OAAO,IAAI,CAAA,CAAC,cAAc;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH;;;GAGG;AACH,SAAS,gBAAgB,CACvB,CAAiB,EACjB,SAAiB,EACjB,WAAmB,EACnB,OAAgB;IAEhB,MAAM,MAAM,GACV,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QACvD,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,+BAA+B;QACrD,CAAC,CAAC,OAAO,KAAK,MAAM;YAClB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,OAAO,KAAK,QAAQ;gBACpB,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,OAAO,KAAK,OAAO;oBACnB,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,OAAO,KAAK,QAAQ;wBACpB,CAAC,CAAC,CAAC;wBACH,CAAC,CAAC,CAAC,CAAA,CAAC,UAAU;IAE1B,kEAAkE;IAClE,MAAM,IAAI,GAAoB;QAC5B,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAC1B,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACzB,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC;QAC/B,MAAM,IAAI,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,2BAA2B,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;KACvF,CAAA;IACD,qEAAqE;IACrE,mEAAmE;IACnE,uEAAuE;IACvE,IAAI,WAAW,KAAK,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAA;IACnE,OAAO,CAAC,CAAC,mBAAmB,CAC1B,SAAS,EACT,SAAS,EACT;QACE,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC;QAC1D,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC;KAC1D,EACD,SAAS,EACT,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC,EACnD,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,gBAAgB,CAAC,aAAa,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAC3E,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,SAAqC,EACrC,SAA8B;IAE9B,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CACvF,CAAA;IACD,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,QAAQ,CAAC;QAAE,OAAO,UAAU,GAAG,CAAC,CAAA;IAE1E,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,eAAe,GAAG,KAAK,CAAA;IAE3B,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;YACzE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5E,eAAe,GAAG,IAAI,CAAA;gBACtB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBAC9B,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvC,0EAA0E;oBAC1E,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACnC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;4BAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;4BAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAC3B,CAAC;4BACD,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gCAC1C,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;gCAC3C,OAAM;4BACR,CAAC;4BACD,IAAI,EAAE,CAAC,uBAAuB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gCACjD,mCAAmC;gCACnC,IAAI,GAAG,UAAU,GAAG,CAAC,CAAA;gCACrB,OAAM;4BACR,CAAC;wBACH,CAAC;oBACH,CAAC;oBACD,8CAA8C;oBAC9C,MAAM,UAAU,GAAG,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAA;oBAChF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACnC,IACE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;4BAC7B,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;4BAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,EAC7B,CAAC;4BACD,IACE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC;gCACpC,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,CAAC,EACzC,CAAC;gCACD,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAA;gCACpE,IAAI,IAAI,CAAC,IAAI,UAAU,GAAG,CAAC,CAAA;4BAC7B,CAAC;4BACD,MAAK;wBACP,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC7B,CAAC;IAED,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAA;IAC1B,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,iBAAiB,CACxB,SAA8B,EAC9B,WAAgC,EAChC,CAAiB,EACjB,oBAA6B,KAAK;IAElC,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,iBAAiB;QAAE,OAAO,IAAI,CAAA;IACrF,mEAAmE;IACnE,sEAAsE;IACtE,8DAA8D;IAC9D,mEAAmE;IACnE,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;SACvC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;SAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAChC,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1E,MAAM,UAAU,GAAG,CAAC,KAAe,EAAoB,EAAE;QACvD,kEAAkE;QAClE,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;QACtF,OAAO,CAAC,CAAC,mBAAmB,CAC1B,SAAS,EACT,SAAS,EACT,CAAC,CAAC,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,EACzD,SAAS,EACT,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC,EACnD,IAAI,CACL,CAAA;IACH,CAAC,CAAA;IACD,MAAM,MAAM,GAAuB;QACjC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;KAC1D,CAAA;IACD,kEAAkE;IAClE,iEAAiE;IACjE,mEAAmE;IACnE,kEAAkE;IAClE,gEAAgE;IAChE,6DAA6D;IAC7D,8DAA8D;IAC9D,8DAA8D;IAC9D,8BAA8B;IAC9B,IAAI,iBAAiB;QAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAA;IAClD,OAAO,CAAC,CAAC,wBAAwB,CAAC,YAAY,EAAE,CAAC,CAAC,4BAA4B,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAA;AAChG,CAAC;AAED,SAAS,WAAW,CAAC,CAAiB,EAAE,IAAY,EAAE,KAAe;IACnE,IAAI,IAAI,GAAkB,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAA;IAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,yCAAyC;QACzC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,CAAA;QAC/F,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["// `core-synthesis` — owns the co-emitted core trio:\n//   - `__update`         — Phase 1/2 dispatcher; reads `structuralMask`\n//   - `__handlers`       — per-message-type specialized handlers\n//   - `__prefixes`       — array of path-keyed reference-stable closures\n//\n// The three are NOT decomposable into separate modules (per v2c §7.9.2\n// design decision (a) vs (b)): they share `topLevelBits` /\n// `structuralMask` / `fieldBits` intermediates, and `__prefixes`\n// ordering is bit-position-keyed (the array index *is* the bit position\n// used by every binding's mask). Producing them in three independent\n// emit passes would either duplicate the analysis or require a shared\n// scratchpad slot — both lose vs the function's existing single pass.\n//\n// So this module owns the entire synthesis: `tryInjectDirty` plus its\n// ~600 lines of supporting helpers (`tryBuildHandlers`,\n// `buildCaseHandler`, `buildUpdateBody`, `buildPrefixesProp`,\n// `computeStructuralMask`, `buildAccess`, plus the case-analysis\n// helpers `detectArrayOp`, `findReturnArray`, `detectStrideLoop`,\n// `hasSliceAssignment`, `analyzeModifiedFields`). Moved verbatim from\n// transform.ts in v2c/decomp-21.\n//\n// Side-effect: the inline call sets `usesApplyBinding = true` when\n// the rewrite fires (drives `__runPhase2` + `__handleMsg` imports in\n// `cleanupImports`). The module surfaces this via `CORE_SYNTHESIS_SLOT`\n// for the umbrella to read after `registry.run`.\n\nimport ts from 'typescript'\nimport type { CompilerModule } from '../module.js'\nimport { computeAccessorMask, createMaskLiteral, isComponentCall } from '../transform.js'\n\nexport interface CoreSynthesisModuleOptions {\n  fieldBits: Map<string, number>\n  fieldBitsHi: Map<string, number>\n  /** Component() call detection requires the @llui/dom import binding\n   *  to disambiguate from user-local `component` identifiers. */\n  lluiImport: ts.ImportDeclaration\n  /** At least one reactive accessor in the file flows the state\n   *  identifier into an expression the walker can't trace (opaque\n   *  callee, spread, ternary branch, dynamic key, …). Forces emission\n   *  of a `(s) => s` whole-state sentinel at the tail of `__prefixes`\n   *  so FULL_MASK bindings catch a dirty bit on every update,\n   *  regardless of which fields the opaque expression actually reads. */\n  hasOpaqueAccessor?: boolean\n}\n\nexport interface CoreSynthesisSlot {\n  /** True when at least one component() call got the __update/__handlers/__prefixes\n   *  trio injected — drives `cleanupImports`'s decision about `__runPhase2`\n   *  + `__handleMsg` runtime imports. */\n  usesApplyBinding: boolean\n}\n\nexport const CORE_SYNTHESIS_SLOT = 'core-synthesis:state'\n\nexport function coreSynthesisModule(opts: CoreSynthesisModuleOptions): CompilerModule {\n  const { fieldBits, fieldBitsHi, lluiImport, hasOpaqueAccessor = false } = opts\n  return {\n    name: 'core-synthesis',\n    compilerVersion: '^0.3.0',\n    diagnostics: [],\n    visitors: {},\n\n    transformCallEnter(ctx, node) {\n      if (!isComponentCall(node, lluiImport)) return null\n      const rewritten = tryInjectDirty(node, fieldBits, ctx.factory, fieldBitsHi, hasOpaqueAccessor)\n      if (!rewritten) return null\n      const slot = ctx.analysis.perModule.get(CORE_SYNTHESIS_SLOT) as CoreSynthesisSlot | undefined\n      if (slot) slot.usesApplyBinding = true\n      else\n        ctx.analysis.perModule.set(CORE_SYNTHESIS_SLOT, {\n          usesApplyBinding: true,\n        } as CoreSynthesisSlot)\n      return rewritten\n    },\n  }\n}\n\n// ─── Synthesis implementation (moved verbatim from transform.ts) ────\n\nfunction tryInjectDirty(\n  node: ts.CallExpression,\n  fieldBits: Map<string, number>,\n  f: ts.NodeFactory,\n  fieldBitsHi: Map<string, number> = new Map(),\n  hasOpaqueAccessor: boolean = false,\n): ts.CallExpression | null {\n  if (fieldBits.size === 0 && fieldBitsHi.size === 0 && !hasOpaqueAccessor) return null\n  const configArg = node.arguments[0]\n  if (!configArg || !ts.isObjectLiteralExpression(configArg)) return null\n\n  // Check if __dirty already exists\n  for (const prop of configArg.properties) {\n    if (\n      ts.isPropertyAssignment(prop) &&\n      ts.isIdentifier(prop.name) &&\n      prop.name.text === '__dirty'\n    ) {\n      return null\n    }\n  }\n\n  // Top-level field → aggregated bit mask. Sub-paths under one field\n  // (`route.page`, `route.data`) collapse into a single entry so\n  // `tryBuildHandlers` can reason per-field. Positions 0..30 live here;\n  // 31..61 in the parallel high-word map below. `__maskLegend` itself\n  // is now owned by `maskLegendModule` (v2c/decomp-9).\n  const topLevelBits = new Map<string, number>()\n  for (const [path, bit] of fieldBits) {\n    const topField = path.split('.')[0]!\n    topLevelBits.set(topField, (topLevelBits.get(topField) ?? 0) | bit)\n  }\n  const topLevelBitsHi = new Map<string, number>()\n  for (const [path, bit] of fieldBitsHi) {\n    const topField = path.split('.')[0]!\n    topLevelBitsHi.set(topField, (topLevelBitsHi.get(topField) ?? 0) | bit)\n  }\n\n  // Structural mask — used by __handlers.\n  const structuralMask = computeStructuralMask(configArg, fieldBits)\n\n  // v0.4 size-cut (Tier 2.4): the `__update` fast-path emission was\n  // removed. Empirically (see benchmarks/bundle-baseline.json + the\n  // strategy comparison in earlier work) it provided only ~3% wall-time\n  // improvement on a 200-binding sparse-update workload, but cost 200-400\n  // bytes per compiled component plus the dispatch branch in\n  // processMessages. The runtime always uses genericUpdate now.\n\n  // __handlers: per-message-type specialized update functions.\n  // Analyzes the update() switch/case and generates direct handlers\n  // that bypass the generic Phase 1/2 pipeline for single-message updates.\n  // Tier 5 (drop __handlers) was attempted and REVERTED — see\n  // benchmarks/bundle-baseline.json#/abandoned. The 1.4 kB savings cost\n  // 23-89% perf on jfb's swap/remove/update/select.\n  const handlersProp = tryBuildHandlers(configArg, topLevelBits, topLevelBitsHi, structuralMask, f)\n\n  // `__maskLegend` is emitted by `maskLegendModule` via the registry\n  // bridge (v2c/decomp-9); the umbrella's `applyRegistryEmissions` step\n  // splices it into the same config-arg literal we return here.\n  const extraProps: ts.ObjectLiteralElementLike[] = []\n  if (handlersProp) extraProps.push(handlersProp)\n\n  // __prefixes: opt-in path-keyed reactivity (see\n  // docs/proposals/unified-composition-model.md). One closure per\n  // distinct path that an accessor reads, hoisted into a stable array;\n  // the array position IS the bit position used by the path's bindings.\n  // The runtime prefers __prefixes when present and computes the\n  // combinedDirty mask by reference-comparing `prefix(prev)` vs\n  // `prefix(next)` for each entry — strictly more precise than the\n  // top-level-conflated __dirty (which always co-fires bindings sharing\n  // a top-level field even when only one sub-path actually mutated).\n  //\n  // Emit `__prefixes` whenever any reactive paths are present. For\n  // components with ≤31 paths, the runtime's\n  // `computeDirtyFromPrefixes` returns a single `number`; for\n  // 32..61-path components it returns a `[lo, hi]` tuple that the\n  // runtime fans out into `combinedDirty` + `combinedDirtyHi`. The\n  // binding-level mask gating is still single-word at the compiler\n  // emit layer today, so high-position bindings still re-evaluate\n  // every cycle — but the dirty computation itself is now precise,\n  // which lets memo()'d aggregates short-circuit correctly.\n  const prefixesProp = buildPrefixesProp(fieldBits, fieldBitsHi, f, hasOpaqueAccessor)\n  if (prefixesProp) extraProps.push(prefixesProp)\n\n  const newConfig = f.createObjectLiteralExpression([...configArg.properties, ...extraProps], true)\n\n  // `updateCallExpression` (not `createCallExpression`) so the new\n  // node inherits `node.pos` / `node.end` from the original. Phase 2b\n  // downstream consumers (componentMetaModule, etc.) read pos via\n  // `getStart(sf)` for line info; a synthetic node (pos=-1) would\n  // collapse every `component()` call's `__componentMeta.line` to 0.\n  return f.updateCallExpression(node, node.expression, node.typeArguments, [\n    newConfig,\n    ...node.arguments.slice(1),\n  ])\n}\n\n/**\n * Analyze update() switch/case and generate per-message-type handlers.\n *\n * Each handler receives (inst, msg) and returns [newState, effects].\n * The handler calls update() to get the new state, then directly invokes\n * the appropriate runtime primitives (reconcileItems, __directUpdate, etc.)\n * instead of going through the generic Phase 1/2 pipeline.\n *\n * Conservative: only generates handlers for cases where the field\n * modifications are statically determinable. Complex cases are skipped.\n */\nfunction tryBuildHandlers(\n  configArg: ts.ObjectLiteralExpression,\n  topLevelBits: Map<string, number>,\n  topLevelBitsHi: Map<string, number>,\n  structuralMask: number,\n  f: ts.NodeFactory,\n): ts.PropertyAssignment | null {\n  if (topLevelBits.size === 0 && topLevelBitsHi.size === 0) return null\n\n  // Find the update function in the component config\n  let updateFn: ts.ArrowFunction | ts.FunctionExpression | null = null\n  for (const prop of configArg.properties) {\n    if (\n      ts.isPropertyAssignment(prop) &&\n      ts.isIdentifier(prop.name) &&\n      prop.name.text === 'update'\n    ) {\n      if (ts.isArrowFunction(prop.initializer) || ts.isFunctionExpression(prop.initializer)) {\n        updateFn = prop.initializer\n      }\n      break\n    }\n  }\n  if (!updateFn) return null\n\n  // Find the switch statement in the update body\n  const body = ts.isBlock(updateFn.body) ? updateFn.body : null\n  if (!body) return null\n\n  let switchStmt: ts.SwitchStatement | null = null\n  for (const stmt of body.statements) {\n    if (ts.isSwitchStatement(stmt)) {\n      switchStmt = stmt\n      break\n    }\n  }\n  if (!switchStmt) return null\n\n  // Check the switch discriminant is msg.type pattern\n  const stateParam = updateFn.parameters[0]?.name\n  const msgParam = updateFn.parameters[1]?.name\n  if (!stateParam || !msgParam || !ts.isIdentifier(stateParam) || !ts.isIdentifier(msgParam))\n    return null\n  const stateName = stateParam.text\n\n  // Analyze each case clause\n  const handlers: ts.PropertyAssignment[] = []\n\n  for (const clause of switchStmt.caseBlock.clauses) {\n    if (!ts.isCaseClause(clause)) continue\n\n    // Extract the case label — must be a string literal like 'select'\n    if (!ts.isStringLiteral(clause.expression)) continue\n    const msgType = clause.expression.text\n\n    // Collect ALL return [newState, effects] statements recursively from the\n    // case body. Multiple returns (from if/else branches) must all be analyzed\n    // so the handler's dirty mask covers every possible modified field.\n    const returnExprs: ts.ArrayLiteralExpression[] = []\n    const collectReturns = (node: ts.Node): void => {\n      if (\n        ts.isReturnStatement(node) &&\n        node.expression &&\n        ts.isArrayLiteralExpression(node.expression) &&\n        node.expression.elements.length >= 2\n      ) {\n        returnExprs.push(node.expression)\n        return\n      }\n      // Don't descend into nested functions — their returns are unrelated.\n      if (\n        ts.isFunctionDeclaration(node) ||\n        ts.isFunctionExpression(node) ||\n        ts.isArrowFunction(node) ||\n        ts.isMethodDeclaration(node)\n      ) {\n        return\n      }\n      ts.forEachChild(node, collectReturns)\n    }\n    for (const stmt of clause.statements) {\n      collectReturns(stmt)\n    }\n    if (returnExprs.length === 0) continue\n\n    // Union modified fields across all return paths.\n    const allModified = new Set<string>()\n    let bailOut = false\n    for (const returnExpr of returnExprs) {\n      const stateExpr = returnExpr.elements[0]!\n      const fields = analyzeModifiedFields(stateExpr, stateName, topLevelBits, topLevelBitsHi)\n      if (!fields) {\n        bailOut = true\n        break\n      }\n      for (const f of fields) allModified.add(f)\n    }\n    if (bailOut) continue // at least one return path was too complex\n\n    const modifiedFields = Array.from(allModified)\n\n    // Compute the dirty mask for this case across both words. Fields\n    // tracked in `topLevelBitsHi` contribute to `caseDirtyHi`; fields\n    // tracked nowhere (`undefined` lookup in both) fall back to\n    // FULL_MASK in the low word — same conservative behavior as\n    // before, just preserved per-word now.\n    let caseDirty = 0\n    let caseDirtyHi = 0\n    for (const field of modifiedFields) {\n      const lo = topLevelBits.get(field)\n      const hi = topLevelBitsHi.get(field)\n      if (lo === undefined && hi === undefined) {\n        caseDirty |= 0xffffffff | 0\n      } else {\n        if (lo !== undefined) caseDirty |= lo\n        if (hi !== undefined) caseDirtyHi |= hi\n      }\n    }\n\n    // Detect array operation pattern for structural block optimization\n    const arrayOp = detectArrayOp(clause, modifiedFields, structuralMask, caseDirty)\n\n    const handler = buildCaseHandler(f, caseDirty, caseDirtyHi, arrayOp)\n    handlers.push(f.createPropertyAssignment(f.createStringLiteral(msgType), handler))\n  }\n\n  if (handlers.length === 0) return null\n\n  return f.createPropertyAssignment('__handlers', f.createObjectLiteralExpression(handlers, true))\n}\n\ntype ArrayOp =\n  | 'none'\n  | 'clear'\n  | 'mutate'\n  | 'remove'\n  | 'general'\n  | { type: 'strided'; stride: number } // for (i = 0; i < len; i += stride) pattern\n\n/**\n * Detect the array operation pattern in a case body.\n * - 'none': no array field modified (e.g., only `selected` changes)\n * - 'clear': array set to empty literal `[]`\n * - 'mutate': array created via `.slice()` then mutated in place (same keys)\n * - 'general': unknown pattern, use generic reconcile\n */\nfunction detectArrayOp(\n  clause: ts.CaseClause,\n  modifiedFields: string[],\n  _structuralMask?: number,\n  _caseDirty?: number,\n): ArrayOp {\n  // No fields modified → no Phase 1 needed (no bindings can care if no\n  // state field changed). Safe to return 'none' here because it's a\n  // tautology: every binding mask ANDed with zero is zero.\n  if (modifiedFields.length === 0) return 'none'\n\n  // The specialized methods (`reconcileClear`, `reconcileItems`,\n  // `reconcileRemove`, `reconcileChanged`) only exist on `each` blocks.\n  // Non-each blocks (`show`, `branch`, `scope`) leave them undefined,\n  // so a method other than 0 (general reconcile) silently no-ops on\n  // those blocks at runtime. If the case modifies fields BEYOND the\n  // array op (e.g. `{ ...state, open: true, name: '', tags: [] }`),\n  // any show/branch block whose mask intersects the case's dirty bits\n  // would be selected for reconcile but then skipped by the no-op\n  // method invocation — its `when`/`on` accessor never re-evaluates,\n  // and the component appears structurally inert after mount.\n  //\n  // Conservative correctness: only emit a non-general method when the\n  // array op is the SOLE field modification. With one modified field,\n  // the only blocks selected by mask gating are ones that read that\n  // single field — and the optimization is well-defined for that\n  // narrow case (each blocks operating on the array). Multi-field\n  // cases fall through to `'general'` (method=0), so every selected\n  // block runs the standard `reconcile` path. We trade a niche\n  // optimization (small benefit even when applicable) for guaranteed\n  // structural reconciliation across the framework's primitive set.\n  //\n  // Sister of show-helper-reconcile.test.ts, which fixed the same\n  // class of bug on the method=-1 path. Same architectural principle:\n  // the compiler can't see every block in the view, so optimizations\n  // that route around `reconcile` must be ironclad. When in doubt,\n  // emit method=0 and let `_handleMsg`'s per-block mask gate filter.\n  //\n  // Previously: if `(structuralMask & caseDirty) === 0`, return 'none'\n  // on the theory that no structural block's mask could intersect this\n  // case's dirty bits. That optimization was UNSAFE: `computeStructuralMask`\n  // only walks the view function's lexical AST and does not descend into\n  // helper function calls. A view like\n  //\n  //     view: () => [\n  //       ...show({ when: s => s.mode === 'signin', render: () => [signinFormBody()] }),\n  //     ]\n  //\n  // where `signinFormBody()` is a helper that internally does\n  //     ...show({ when: s => s.errors.email !== undefined, ... })\n  //\n  // produces a `structuralMask` that covers `mode` but MISSES\n  // `errors.email`. At runtime the inner show block is still registered\n  // in `inst.structuralBlocks`, and it legitimately needs to reconcile\n  // when `errors` changes — but the compiler was emitting `method = -1`\n  // (skip blocks entirely) for cases that only touch `errors`, and the\n  // error paragraphs would never mount.\n  if (modifiedFields.length !== 1) return 'general'\n  const onlyField = modifiedFields[0]!\n\n  // Look at the return expression's array field values\n  for (const stmt of clause.statements) {\n    const returnExpr = findReturnArray(stmt)\n    if (!returnExpr) continue\n\n    const stateExpr = returnExpr.elements[0]\n    if (!stateExpr || !ts.isObjectLiteralExpression(stateExpr)) continue\n\n    for (const prop of stateExpr.properties) {\n      const name =\n        ts.isPropertyAssignment(prop) && ts.isIdentifier(prop.name)\n          ? prop.name.text\n          : ts.isShorthandPropertyAssignment(prop)\n            ? prop.name.text\n            : null\n      if (!name) continue\n      // The optimization only applies when the array op is on the\n      // single tracked field. A `field: []` on a different field\n      // (one not in modifiedFields, e.g. an untracked field) would\n      // still no-op safely on each blocks via the mask gate, but to\n      // keep the analysis tight we require an exact match.\n      if (name !== onlyField) continue\n\n      // Check for empty array literal: `field: []`\n      if (\n        ts.isPropertyAssignment(prop) &&\n        ts.isArrayLiteralExpression(prop.initializer) &&\n        prop.initializer.elements.length === 0\n      ) {\n        return 'clear'\n      }\n\n      // Check for shorthand `field` where field was assigned via `.slice()` earlier\n      // This catches: `const rows = state.rows.slice(); rows[i] = ...; return { ...state, rows }`\n      if (ts.isShorthandPropertyAssignment(prop)) {\n        const varName = prop.name.text\n        if (hasSliceAssignment(clause, varName)) {\n          // Check for strided for-loop: for (let i = 0; i < arr.length; i += STRIDE)\n          const stride = detectStrideLoop(clause, varName)\n          if (stride > 1) return { type: 'strided', stride }\n          return 'mutate'\n        }\n      }\n\n      // Check for property assignment with filter: `field: state.field.filter(...)`\n      if (ts.isPropertyAssignment(prop) && ts.isCallExpression(prop.initializer)) {\n        const call = prop.initializer\n        if (\n          ts.isPropertyAccessExpression(call.expression) &&\n          call.expression.name.text === 'filter'\n        ) {\n          return 'remove'\n        }\n      }\n    }\n  }\n\n  return 'general'\n}\n\nfunction findReturnArray(stmt: ts.Statement): ts.ArrayLiteralExpression | null {\n  if (ts.isReturnStatement(stmt) && stmt.expression && ts.isArrayLiteralExpression(stmt.expression))\n    return stmt.expression\n  if (ts.isBlock(stmt)) {\n    for (const inner of stmt.statements) {\n      const result = findReturnArray(inner)\n      if (result) return result\n    }\n  }\n  return null\n}\n\n/**\n * Detect a strided for-loop: `for (let i = 0; i < arr.length; i += STRIDE)`\n * where `arr` is the named variable. Returns the stride or 0 if not found.\n */\nfunction detectStrideLoop(clause: ts.CaseClause, _arrName: string): number {\n  function walk(node: ts.Node): number {\n    if (ts.isForStatement(node) && node.incrementor) {\n      // Check incrementor: i += STRIDE\n      const inc = node.incrementor\n      if (\n        ts.isBinaryExpression(inc) &&\n        inc.operatorToken.kind === ts.SyntaxKind.PlusEqualsToken &&\n        ts.isNumericLiteral(inc.right)\n      ) {\n        const stride = parseInt(inc.right.text, 10)\n        if (stride > 1) return stride\n      }\n    }\n    return ts.forEachChild(node, walk) ?? 0\n  }\n  for (const stmt of clause.statements) {\n    const result = walk(stmt)\n    if (result > 0) return result\n  }\n  return 0\n}\n\nfunction hasSliceAssignment(clause: ts.CaseClause, varName: string): boolean {\n  function walk(node: ts.Node): boolean {\n    // Look for: const varName = stateName.field.slice()\n    if (\n      ts.isVariableDeclaration(node) &&\n      ts.isIdentifier(node.name) &&\n      node.name.text === varName &&\n      node.initializer\n    ) {\n      const init = node.initializer\n      if (\n        ts.isCallExpression(init) &&\n        ts.isPropertyAccessExpression(init.expression) &&\n        init.expression.name.text === 'slice'\n      ) {\n        return true\n      }\n    }\n    return ts.forEachChild(node, walk) ?? false\n  }\n  for (const stmt of clause.statements) {\n    if (walk(stmt)) return true\n  }\n  return false\n}\n\n/**\n * Analyze which top-level state fields are modified in a return expression.\n * Returns the set of field names, or null if too complex to determine.\n */\nfunction analyzeModifiedFields(\n  stateExpr: ts.Expression,\n  stateName: string,\n  topLevelBits: Map<string, number>,\n  topLevelBitsHi: Map<string, number> = new Map(),\n): string[] | null {\n  // Recognize fields tracked in EITHER the low-word or high-word map.\n  // 32..61-prefix components have their overflow paths in\n  // `topLevelBitsHi`; the case handler's `caseDirty` / `caseDirtyHi`\n  // logic depends on us recognizing those fields here.\n  const isTracked = (name: string): boolean => topLevelBits.has(name) || topLevelBitsHi.has(name)\n  // Pattern: { ...state, field1: ..., field2: ... } or { field1: ..., field2: ... }\n  if (ts.isObjectLiteralExpression(stateExpr)) {\n    const modified: string[] = []\n    for (const prop of stateExpr.properties) {\n      if (ts.isSpreadAssignment(prop)) {\n        // Only `...state` is safe to ignore — re-spreading state back into\n        // state doesn't change any field's identity. ANY other spread\n        // (e.g. `...msg.props`, `...someObj`) can overwrite arbitrary\n        // top-level fields with new references, and we cannot know which\n        // ones statically. Bail out so the generic Phase 2 path runs\n        // `__dirty` at runtime and produces a correct mask.\n        if (ts.isIdentifier(prop.expression) && prop.expression.text === stateName) {\n          continue\n        }\n        return null\n      }\n      if (ts.isPropertyAssignment(prop) && ts.isIdentifier(prop.name)) {\n        const fieldName = prop.name.text\n        if (isTracked(fieldName)) {\n          modified.push(fieldName)\n        }\n      }\n      // Handle shorthand: { ...state, rows } where rows is a local variable\n      if (ts.isShorthandPropertyAssignment(prop)) {\n        const fieldName = prop.name.text\n        if (isTracked(fieldName)) {\n          modified.push(fieldName)\n        }\n      }\n    }\n    return modified.length > 0 ? modified : null\n  }\n\n  // Pattern: state (no change — early return)\n  if (ts.isIdentifier(stateExpr) && stateExpr.text === stateName) {\n    return [] // no fields modified\n  }\n\n  return null // too complex\n}\n\n/**\n * Build a handler function for a specific message type case.\n *\n * Generated: (inst, msg) => {\n *   const [s, e] = inst.def.update(inst.state, msg)\n *   inst.state = s\n *   const bl = inst.structuralBlocks, b = inst.allBindings, p = b.length\n *   // Phase 1: gated by caseDirty\n *   for (let i = 0; i < bl.length; i++) {\n *     if (bl[i].mask & caseDirty) bl[i].reconcile(s, caseDirty)\n *   }\n *   // Phase 2\n *   __runPhase2(s, caseDirty, b, p)\n *   return [s, e]\n * }\n */\n/**\n * Build a handler that delegates to __handleMsg(inst, msg, dirty, method).\n * method: 0=reconcile, 1=reconcileItems, 2=reconcileClear, 3=reconcileRemove, -1=skip blocks\n */\nfunction buildCaseHandler(\n  f: ts.NodeFactory,\n  caseDirty: number,\n  caseDirtyHi: number,\n  arrayOp: ArrayOp,\n): ts.ArrowFunction {\n  const method =\n    typeof arrayOp === 'object' && arrayOp.type === 'strided'\n      ? 10 + arrayOp.stride // reconcileChanged with stride\n      : arrayOp === 'none'\n        ? -1\n        : arrayOp === 'mutate'\n          ? 1\n          : arrayOp === 'clear'\n            ? 2\n            : arrayOp === 'remove'\n              ? 3\n              : 0 // general\n\n  // (inst, msg) => __handleMsg(inst, msg, dirty, method, [dirtyHi])\n  const args: ts.Expression[] = [\n    f.createIdentifier('inst'),\n    f.createIdentifier('msg'),\n    createMaskLiteral(f, caseDirty),\n    method >= 0\n      ? f.createNumericLiteral(method)\n      : f.createPrefixUnaryExpression(ts.SyntaxKind.MinusToken, f.createNumericLiteral(1)),\n  ]\n  // Emit the 5th positional arg only when the case touches a high-word\n  // field. Stale runtime bundles' _handleMsg signatures ignored that\n  // slot anyway; new ones (defaulted to 0) make it explicit when needed.\n  if (caseDirtyHi !== 0) args.push(createMaskLiteral(f, caseDirtyHi))\n  return f.createArrowFunction(\n    undefined,\n    undefined,\n    [\n      f.createParameterDeclaration(undefined, undefined, 'inst'),\n      f.createParameterDeclaration(undefined, undefined, 'msg'),\n    ],\n    undefined,\n    f.createToken(ts.SyntaxKind.EqualsGreaterThanToken),\n    f.createCallExpression(f.createIdentifier('__handleMsg'), undefined, args),\n  )\n}\n\n/**\n * Compute the OR of all structural block masks found in the view function.\n * Returns FULL_MASK if any structural block uses FULL_MASK or if no blocks found.\n */\nfunction computeStructuralMask(\n  configArg: ts.ObjectLiteralExpression,\n  fieldBits: Map<string, number>,\n): number {\n  const viewProp = configArg.properties.find(\n    (p) => ts.isPropertyAssignment(p) && ts.isIdentifier(p.name) && p.name.text === 'view',\n  )\n  if (!viewProp || !ts.isPropertyAssignment(viewProp)) return 0xffffffff | 0\n\n  let mask = 0\n  let foundStructural = false\n\n  function walk(node: ts.Node): void {\n    if (ts.isCallExpression(node)) {\n      const name = ts.isIdentifier(node.expression) ? node.expression.text : ''\n      if (['each', 'branch', 'scope', 'show'].includes(name) && node.arguments[0]) {\n        foundStructural = true\n        const opts = node.arguments[0]\n        if (ts.isObjectLiteralExpression(opts)) {\n          // Check for __mask property (already injected by tryInjectStructuralMask)\n          for (const prop of opts.properties) {\n            if (\n              ts.isPropertyAssignment(prop) &&\n              ts.isIdentifier(prop.name) &&\n              prop.name.text === '__mask'\n            ) {\n              if (ts.isNumericLiteral(prop.initializer)) {\n                mask |= parseInt(prop.initializer.text, 10)\n                return\n              }\n              if (ts.isPrefixUnaryExpression(prop.initializer)) {\n                // Handle negative literals like -1\n                mask = 0xffffffff | 0\n                return\n              }\n            }\n          }\n          // No __mask found — use driving accessor mask\n          const driverProp = name === 'each' ? 'items' : name === 'branch' ? 'on' : 'when'\n          for (const prop of opts.properties) {\n            if (\n              ts.isPropertyAssignment(prop) &&\n              ts.isIdentifier(prop.name) &&\n              prop.name.text === driverProp\n            ) {\n              if (\n                ts.isArrowFunction(prop.initializer) ||\n                ts.isFunctionExpression(prop.initializer)\n              ) {\n                const { mask: m } = computeAccessorMask(prop.initializer, fieldBits)\n                mask |= m || 0xffffffff | 0\n              }\n              break\n            }\n          }\n        }\n      }\n    }\n    ts.forEachChild(node, walk)\n  }\n\n  walk(viewProp.initializer)\n  return foundStructural ? mask || 0xffffffff | 0 : 0\n}\n\n/**\n * Build the `__prefixes` property assignment from path → bit maps.\n *\n * Emits one arrow `(s) => s.<path>` per distinct path. Array index =\n * the path's bit position: positions 0..30 come from `fieldBits` (low\n * word), positions 31..61 from `fieldBitsHi` (high word). The runtime\n * walks this array and reference-compares `prefix(prev)` vs\n * `prefix(next)` per entry, fanning bits into a `(lo, hi)` pair when\n * the array length exceeds 31.\n *\n * Returns null if no paths are present.\n */\nfunction buildPrefixesProp(\n  fieldBits: Map<string, number>,\n  fieldBitsHi: Map<string, number>,\n  f: ts.NodeFactory,\n  hasOpaqueAccessor: boolean = false,\n): ts.PropertyAssignment | null {\n  if (fieldBits.size === 0 && fieldBitsHi.size === 0 && !hasOpaqueAccessor) return null\n  // Sort paths by bit value within each word. Bits are powers of two\n  // inside their word (1, 2, 4, …, 1<<30), so sorting numerically gives\n  // ascending bit position. FULL_MASK (-1) entries from past-61\n  // overflow shouldn't drive a prefix entry — defensively skip them.\n  const orderedLo = [...fieldBits.entries()]\n    .filter(([, bit]) => bit > 0)\n    .sort(([, a], [, b]) => a - b)\n  const orderedHi = [...fieldBitsHi.entries()].sort(([, a], [, b]) => a - b)\n  const buildArrow = (parts: string[]): ts.ArrowFunction => {\n    // Empty parts → `(s) => s` (whole-state sentinel). Any other path\n    // builds the optional-chain access expression.\n    const body = parts.length === 0 ? f.createIdentifier('s') : buildAccess(f, 's', parts)\n    return f.createArrowFunction(\n      undefined,\n      undefined,\n      [f.createParameterDeclaration(undefined, undefined, 's')],\n      undefined,\n      f.createToken(ts.SyntaxKind.EqualsGreaterThanToken),\n      body,\n    )\n  }\n  const arrows: ts.ArrowFunction[] = [\n    ...orderedLo.map(([path]) => buildArrow(path.split('.'))),\n    ...orderedHi.map(([path]) => buildArrow(path.split('.'))),\n  ]\n  // Append the whole-state sentinel `(s) => s` when any accessor in\n  // the file flows state opaquely. Its prefix bit dirties on every\n  // update (immutable reducers always return a new object identity),\n  // so FULL_MASK bindings — whose mask covers every bit — fire even\n  // when the changed field has no traceable prefix entry. Without\n  // this, a field read ONLY through an opaque expression would\n  // disappear from `__prefixes`; computeDirtyFromPrefixes would\n  // return 0 for changes to it; (-1) & 0 = 0; the binding would\n  // silently never re-evaluate.\n  if (hasOpaqueAccessor) arrows.push(buildArrow([]))\n  return f.createPropertyAssignment('__prefixes', f.createArrayLiteralExpression(arrows, false))\n}\n\nfunction buildAccess(f: ts.NodeFactory, root: string, parts: string[]): ts.Expression {\n  let expr: ts.Expression = f.createIdentifier(root)\n  for (const part of parts) {\n    // Use optional chaining for nested paths\n    if (parts.length > 1) {\n      expr = f.createPropertyAccessChain(expr, f.createToken(ts.SyntaxKind.QuestionDotToken), part)\n    } else {\n      expr = f.createPropertyAccessExpression(expr, part)\n    }\n  }\n  return expr\n}\n"]}

package/dist/modules/opaque-state-flow.d.ts

@@ -0,0 +1,3 @@
+import type { CompilerModule } from '../module.js';
+export declare function opaqueStateFlowModule(): CompilerModule;
+//# sourceMappingURL=opaque-state-flow.d.ts.map

package/dist/modules/opaque-state-flow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"opaque-state-flow.d.ts","sourceRoot":"","sources":["../../src/modules/opaque-state-flow.ts"],"names":[],"mappings":"AAwCA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAA;AAiIlD,wBAAgB,qBAAqB,IAAI,cAAc,CAyCtD"}

package/dist/modules/opaque-state-flow.js

@@ -0,0 +1,208 @@
+// `opaque-state-flow` — errors when a reactive accessor's body flows
+// the state identifier into an expression the walker can't statically
+// trace. The compiler still produces a *correct* binding by forcing
+// FULL_MASK and emitting a whole-state `(s) => s` sentinel into
+// `__prefixes` (see `02 Compiler.md` § "Opaque-flow classifier"), but
+// the binding then re-evaluates on every state change rather than
+// only when its actual reads change. This rule surfaces the leak so
+// authors can either:
+//
+//   - Rewrite the accessor as direct property access (`s.foo`,
+//     `s.foo['literal']`), the form the walker can resolve.
+//   - Declare the reads explicitly via `track({ deps: (s) => [...] })`
+//     — the compile-time escape hatch the framework provides for cases
+//     where the read genuinely can't be expressed inline.
+//
+// Detected leak shapes (mirrors the classifier in
+// `transform.ts:computeAccessorMask`):
+//   - `helper(s)` with an Identifier callee that can't be resolved to
+//     a local declaration (function parameter, import, destructured
+//     binding) — the callee may read any field of `s`.
+//
+// NOT flagged (intentional): `obj.helper(s)` / `lib.fn(s)` —
+// PropertyAccessExpression callees. This is the documented headless-
+// components idiom (`pr.valueText(s)` where `pr` comes from
+// `progress.connect()`), and refactoring it defeats the API surface.
+// The runtime sentinel keeps such bindings correct — the cost is a
+// per-update re-evaluation, which is a property of the composition
+// pattern rather than an author mistake worth blocking.
+//   - `new Wrapper(s)` — NewExpression with state as an argument.
+//   - `` tag`${s}` `` — TaggedTemplate with state in a span.
+//   - `{ ...s }` / `[...s]` — spread of state.
+//   - `const x = s` — const aliasing.
+//   - `cond ? s : other` — state in a conditional branch (state
+//     reaches the binding via a path the walker can't trace).
+//   - `s[expr]` — dynamic element access (literal keys are tracked).
+//   - State passed as `arg1+` to any call (the existing delegation
+//     branch only inspects `arg0`).
+import ts from 'typescript';
+import { rangeFromOffsets } from '../diagnostic.js';
+import { isReactiveAccessor } from '../collect-deps.js';
+import { resolveAccessorBody } from '../accessor-resolver.js';
+// Mirrors the file-local list in collect-deps.ts. Calls to these
+// framework primitives are visited as accessor positions in their
+// own right, so we don't double-classify.
+const NON_DELEGATION_HELPERS = new Set(['sample', 'item', 'memo', 'text', 'unsafeHtml']);
+function findFirstLeakInAccessor(accessor) {
+    if (accessor.parameters.length !== 1)
+        return null;
+    const param = accessor.parameters[0];
+    if (!ts.isIdentifier(param.name))
+        return null;
+    if (!accessor.body)
+        return null;
+    const stateParam = param.name.text;
+    let leak = null;
+    const visit = (node) => {
+        if (leak)
+            return;
+        if (ts.isIdentifier(node) && node.text === stateParam) {
+            const parent = node.parent;
+            if (!parent || ts.isParameter(parent)) {
+                ts.forEachChild(node, visit);
+                return;
+            }
+            // Tracked containers — the same set the mask classifier honors.
+            let tracked = false;
+            let shape = '';
+            let hint = '';
+            if (ts.isPropertyAccessExpression(parent) && parent.expression === node) {
+                tracked = true;
+            }
+            else if (ts.isElementAccessExpression(parent) && parent.expression === node) {
+                if (ts.isStringLiteralLike(parent.argumentExpression) ||
+                    ts.isNumericLiteral(parent.argumentExpression)) {
+                    tracked = true;
+                }
+                else {
+                    shape = `dynamic element access \`s[<expr>]\``;
+                    hint =
+                        'replace the dynamic key with a literal property (e.g. `s.foo`), or declare the read via `track({ deps: (s) => [s[key]] })`.';
+                }
+            }
+            else if (ts.isCallExpression(parent) && parent.arguments[0] === node) {
+                if (ts.isIdentifier(parent.expression) &&
+                    !NON_DELEGATION_HELPERS.has(parent.expression.text)) {
+                    // Identifier-callee delegation. Recurse into the callee's
+                    // body via the same resolver the mask walker uses. If it
+                    // resolves to a local accessor, the helper's reads are
+                    // walked transitively and the call is tracked. If the
+                    // callee is a function parameter, import, destructured
+                    // binding, or otherwise unresolvable, this IS the leak
+                    // shape — flag it here so the diagnostic points at the
+                    // call site rather than at some deeper unresolvable read.
+                    const resolved = resolveAccessorBody(parent.expression);
+                    if (resolved) {
+                        tracked = true;
+                    }
+                    else {
+                        shape = `call to an unresolvable callee \`${parent.expression.text}(s)\` (function parameter, import, or destructured binding)`;
+                        hint =
+                            'inline the read against `s` directly, refactor the callee into a same-module `const`/`function` declaration, or declare the dependencies via `track({ deps: (s) => [...] })`.';
+                    }
+                }
+                else if (!ts.isIdentifier(parent.expression)) {
+                    // Method-call / computed callee with state arg —
+                    // `obj.helper(s)`, `lib.fn(s)`. This is the documented
+                    // headless-components idiom (`pr.valueText(s)` where `pr`
+                    // comes from `progress.connect()`); refactoring it would
+                    // defeat the API surface. The runtime sentinel keeps the
+                    // binding correct — just at the cost of re-evaluating on
+                    // every update. Treat as tracked from the lint's POV so
+                    // legitimate composition doesn't error the build; the
+                    // perf cost is a property of the composition pattern, not
+                    // an author mistake worth blocking.
+                    tracked = true;
+                }
+            }
+            else if (ts.isNewExpression(parent)) {
+                shape = 'state passed as a constructor argument (`new X(s)`)';
+                hint =
+                    'compute the derived value inline against direct state reads, or use `track({ deps: (s) => [...] })` to declare the reads.';
+            }
+            else if (ts.isSpreadElement(parent) || ts.isSpreadAssignment(parent)) {
+                shape = 'state spread (`{...s}` / `[...s]`)';
+                hint =
+                    'spread only the fields you actually need (`{...s.user}`), or use `track({ deps: (s) => [...] })`.';
+            }
+            else if (ts.isVariableDeclaration(parent)) {
+                shape = 'const alias (`const x = s; … x.foo`)';
+                hint =
+                    'inline the alias to `s.foo`, or split the deeper read into a separate single-assignment alias `const foo = s.foo`.';
+            }
+            else if (ts.isConditionalExpression(parent)) {
+                shape = 'state in a conditional branch (`cond ? s : other`)';
+                hint = 'move the conditional inside the property access: `cond ? s.foo : other.foo`.';
+            }
+            else if (ts.isAsExpression(parent) || ts.isTypeAssertionExpression(parent)) {
+                shape = 'type assertion wrapping state (`(s as T).foo`)';
+                hint = 'drop the assertion — the chain `s.foo` already carries the type.';
+            }
+            else if (ts.isParenthesizedExpression(parent)) {
+                // Walk up through parens transparently. Don't flag here; the
+                // outer parent classifies.
+                ts.forEachChild(node, visit);
+                return;
+            }
+            else {
+                shape = `state used outside a tracked container (${describe(parent)})`;
+                hint =
+                    'restructure the expression so `s` appears only as the root of a property/element-access chain, or declare the read via `track({ deps: (s) => [...] })`.';
+            }
+            if (!tracked) {
+                leak = { node, shape, hint };
+                return;
+            }
+        }
+        ts.forEachChild(node, visit);
+    };
+    visit(accessor.body);
+    return leak;
+}
+function describe(node) {
+    if (ts.isIdentifier(node))
+        return node.text;
+    if (ts.isPropertyAccessExpression(node))
+        return `${describe(node.expression)}.${node.name.text}`;
+    return ts.SyntaxKind[node.kind];
+}
+export function opaqueStateFlowModule() {
+    return {
+        name: 'opaque-state-flow',
+        compilerVersion: '^0.3.0',
+        diagnostics: [
+            {
+                id: 'llui/opaque-state-flow',
+                description: "Reactive accessor flows state into an opaque expression the walker can't trace. The runtime stays correct via a FULL_MASK binding + whole-state sentinel in `__prefixes`, but the binding then re-evaluates on every state change.",
+            },
+        ],
+        visitors: {
+            [ts.SyntaxKind.SourceFile]: (ctx, node) => {
+                const visited = node;
+                const sf = ts.createSourceFile(visited.fileName, visited.text, ts.ScriptTarget.Latest, true);
+                const walk = (n) => {
+                    if ((ts.isArrowFunction(n) || ts.isFunctionExpression(n)) && isReactiveAccessor(n)) {
+                        const leak = findFirstLeakInAccessor(n);
+                        if (leak) {
+                            ctx.reportDiagnostic({
+                                id: 'llui/opaque-state-flow',
+                                severity: 'error',
+                                category: 'perf',
+                                message: `Reactive accessor flows state opaquely — ${leak.shape}. ` +
+                                    `The compiler ships a correct binding (FULL_MASK + whole-state sentinel), ` +
+                                    `but it re-evaluates on every state change. ${leak.hint}`,
+                                location: {
+                                    file: sf.fileName,
+                                    range: rangeFromOffsets(sf.text, leak.node.getStart(sf), leak.node.getEnd()),
+                                },
+                            });
+                        }
+                    }
+                    ts.forEachChild(n, walk);
+                };
+                walk(sf);
+            },
+        },
+    };
+}
+//# sourceMappingURL=opaque-state-flow.js.map

package/dist/modules/opaque-state-flow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"opaque-state-flow.js","sourceRoot":"","sources":["../../src/modules/opaque-state-flow.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,sEAAsE;AACtE,oEAAoE;AACpE,gEAAgE;AAChE,sEAAsE;AACtE,kEAAkE;AAClE,oEAAoE;AACpE,sBAAsB;AACtB,EAAE;AACF,+DAA+D;AAC/D,4DAA4D;AAC5D,uEAAuE;AACvE,uEAAuE;AACvE,0DAA0D;AAC1D,EAAE;AACF,kDAAkD;AAClD,uCAAuC;AACvC,sEAAsE;AACtE,oEAAoE;AACpE,uDAAuD;AACvD,EAAE;AACF,6DAA6D;AAC7D,qEAAqE;AACrE,4DAA4D;AAC5D,qEAAqE;AACrE,mEAAmE;AACnE,mEAAmE;AACnE,wDAAwD;AACxD,kEAAkE;AAClE,6DAA6D;AAC7D,+CAA+C;AAC/C,sCAAsC;AACtC,gEAAgE;AAChE,8DAA8D;AAC9D,qEAAqE;AACrE,mEAAmE;AACnE,oCAAoC;AAEpC,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAA;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAA;AAE7D,iEAAiE;AACjE,kEAAkE;AAClE,0CAA0C;AAC1C,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAA;AAQxF,SAAS,uBAAuB,CAC9B,QAA2E;IAE3E,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAE,CAAA;IACrC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IAC7C,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAC/B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAA;IAElC,IAAI,IAAI,GAAoB,IAAI,CAAA;IAChC,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;QACpC,IAAI,IAAI;YAAE,OAAM;QAChB,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACtD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YAC1B,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC5B,OAAM;YACR,CAAC;YACD,gEAAgE;YAChE,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,IAAI,KAAK,GAAG,EAAE,CAAA;YACd,IAAI,IAAI,GAAG,EAAE,CAAA;YACb,IAAI,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxE,OAAO,GAAG,IAAI,CAAA;YAChB,CAAC;iBAAM,IAAI,EAAE,CAAC,yBAAyB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;gBAC9E,IACE,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,kBAAkB,CAAC;oBACjD,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,kBAAkB,CAAC,EAC9C,CAAC;oBACD,OAAO,GAAG,IAAI,CAAA;gBAChB,CAAC;qBAAM,CAAC;oBACN,KAAK,GAAG,sCAAsC,CAAA;oBAC9C,IAAI;wBACF,6HAA6H,CAAA;gBACjI,CAAC;YACH,CAAC;iBAAM,IAAI,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACvE,IACE,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC;oBAClC,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EACnD,CAAC;oBACD,0DAA0D;oBAC1D,yDAAyD;oBACzD,uDAAuD;oBACvD,sDAAsD;oBACtD,uDAAuD;oBACvD,uDAAuD;oBACvD,uDAAuD;oBACvD,0DAA0D;oBAC1D,MAAM,QAAQ,GAAG,mBAAmB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;oBACvD,IAAI,QAAQ,EAAE,CAAC;wBACb,OAAO,GAAG,IAAI,CAAA;oBAChB,CAAC;yBAAM,CAAC;wBACN,KAAK,GAAG,oCAAoC,MAAM,CAAC,UAAU,CAAC,IAAI,6DAA6D,CAAA;wBAC/H,IAAI;4BACF,+KAA+K,CAAA;oBACnL,CAAC;gBACH,CAAC;qBAAM,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC/C,iDAAiD;oBACjD,uDAAuD;oBACvD,0DAA0D;oBAC1D,yDAAyD;oBACzD,yDAAyD;oBACzD,yDAAyD;oBACzD,wDAAwD;oBACxD,sDAAsD;oBACtD,0DAA0D;oBAC1D,oCAAoC;oBACpC,OAAO,GAAG,IAAI,CAAA;gBAChB,CAAC;YACH,CAAC;iBAAM,IAAI,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,KAAK,GAAG,qDAAqD,CAAA;gBAC7D,IAAI;oBACF,2HAA2H,CAAA;YAC/H,CAAC;iBAAM,IAAI,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACvE,KAAK,GAAG,oCAAoC,CAAA;gBAC5C,IAAI;oBACF,mGAAmG,CAAA;YACvG,CAAC;iBAAM,IAAI,EAAE,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5C,KAAK,GAAG,sCAAsC,CAAA;gBAC9C,IAAI;oBACF,oHAAoH,CAAA;YACxH,CAAC;iBAAM,IAAI,EAAE,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9C,KAAK,GAAG,oDAAoD,CAAA;gBAC5D,IAAI,GAAG,8EAA8E,CAAA;YACvF,CAAC;iBAAM,IAAI,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,yBAAyB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7E,KAAK,GAAG,gDAAgD,CAAA;gBACxD,IAAI,GAAG,kEAAkE,CAAA;YAC3E,CAAC;iBAAM,IAAI,EAAE,CAAC,yBAAyB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAChD,6DAA6D;gBAC7D,2BAA2B;gBAC3B,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC5B,OAAM;YACR,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,2CAA2C,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAA;gBACtE,IAAI;oBACF,yJAAyJ,CAAA;YAC7J,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;gBAC5B,OAAM;YACR,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC,CAAA;IACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACpB,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,IAAa;IAC7B,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAA;IAC3C,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;IAChG,OAAO,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACjC,CAAC;AAED,MAAM,UAAU,qBAAqB;IACnC,OAAO;QACL,IAAI,EAAE,mBAAmB;QACzB,eAAe,EAAE,QAAQ;QACzB,WAAW,EAAE;YACX;gBACE,EAAE,EAAE,wBAAwB;gBAC5B,WAAW,EACT,oOAAoO;aACvO;SACF;QACD,QAAQ,EAAE;YACR,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;gBACxC,MAAM,OAAO,GAAG,IAAqB,CAAA;gBACrC,MAAM,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;gBAE5F,MAAM,IAAI,GAAG,CAAC,CAAU,EAAQ,EAAE;oBAChC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;wBACnF,MAAM,IAAI,GAAG,uBAAuB,CAAC,CAAC,CAAC,CAAA;wBACvC,IAAI,IAAI,EAAE,CAAC;4BACT,GAAG,CAAC,gBAAgB,CAAC;gCACnB,EAAE,EAAE,wBAAwB;gCAC5B,QAAQ,EAAE,OAAO;gCACjB,QAAQ,EAAE,MAAM;gCAChB,OAAO,EACL,4CAA4C,IAAI,CAAC,KAAK,IAAI;oCAC1D,2EAA2E;oCAC3E,8CAA8C,IAAI,CAAC,IAAI,EAAE;gCAC3D,QAAQ,EAAE;oCACR,IAAI,EAAE,EAAE,CAAC,QAAQ;oCACjB,KAAK,EAAE,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;iCAC7E;6BACF,CAAC,CAAA;wBACJ,CAAC;oBACH,CAAC;oBACD,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBAC1B,CAAC,CAAA;gBACD,IAAI,CAAC,EAAE,CAAC,CAAA;YACV,CAAC;SACF;KACF,CAAA;AACH,CAAC","sourcesContent":["// `opaque-state-flow` — errors when a reactive accessor's body flows\n// the state identifier into an expression the walker can't statically\n// trace. The compiler still produces a *correct* binding by forcing\n// FULL_MASK and emitting a whole-state `(s) => s` sentinel into\n// `__prefixes` (see `02 Compiler.md` § \"Opaque-flow classifier\"), but\n// the binding then re-evaluates on every state change rather than\n// only when its actual reads change. This rule surfaces the leak so\n// authors can either:\n//\n//   - Rewrite the accessor as direct property access (`s.foo`,\n//     `s.foo['literal']`), the form the walker can resolve.\n//   - Declare the reads explicitly via `track({ deps: (s) => [...] })`\n//     — the compile-time escape hatch the framework provides for cases\n//     where the read genuinely can't be expressed inline.\n//\n// Detected leak shapes (mirrors the classifier in\n// `transform.ts:computeAccessorMask`):\n//   - `helper(s)` with an Identifier callee that can't be resolved to\n//     a local declaration (function parameter, import, destructured\n//     binding) — the callee may read any field of `s`.\n//\n// NOT flagged (intentional): `obj.helper(s)` / `lib.fn(s)` —\n// PropertyAccessExpression callees. This is the documented headless-\n// components idiom (`pr.valueText(s)` where `pr` comes from\n// `progress.connect()`), and refactoring it defeats the API surface.\n// The runtime sentinel keeps such bindings correct — the cost is a\n// per-update re-evaluation, which is a property of the composition\n// pattern rather than an author mistake worth blocking.\n//   - `new Wrapper(s)` — NewExpression with state as an argument.\n//   - `` tag`${s}` `` — TaggedTemplate with state in a span.\n//   - `{ ...s }` / `[...s]` — spread of state.\n//   - `const x = s` — const aliasing.\n//   - `cond ? s : other` — state in a conditional branch (state\n//     reaches the binding via a path the walker can't trace).\n//   - `s[expr]` — dynamic element access (literal keys are tracked).\n//   - State passed as `arg1+` to any call (the existing delegation\n//     branch only inspects `arg0`).\n\nimport ts from 'typescript'\nimport { rangeFromOffsets } from '../diagnostic.js'\nimport type { CompilerModule } from '../module.js'\nimport { isReactiveAccessor } from '../collect-deps.js'\nimport { resolveAccessorBody } from '../accessor-resolver.js'\n\n// Mirrors the file-local list in collect-deps.ts. Calls to these\n// framework primitives are visited as accessor positions in their\n// own right, so we don't double-classify.\nconst NON_DELEGATION_HELPERS = new Set(['sample', 'item', 'memo', 'text', 'unsafeHtml'])\n\ninterface LeakSite {\n  node: ts.Node\n  shape: string\n  hint: string\n}\n\nfunction findFirstLeakInAccessor(\n  accessor: ts.ArrowFunction | ts.FunctionExpression | ts.FunctionDeclaration,\n): LeakSite | null {\n  if (accessor.parameters.length !== 1) return null\n  const param = accessor.parameters[0]!\n  if (!ts.isIdentifier(param.name)) return null\n  if (!accessor.body) return null\n  const stateParam = param.name.text\n\n  let leak: LeakSite | null = null\n  const visit = (node: ts.Node): void => {\n    if (leak) return\n    if (ts.isIdentifier(node) && node.text === stateParam) {\n      const parent = node.parent\n      if (!parent || ts.isParameter(parent)) {\n        ts.forEachChild(node, visit)\n        return\n      }\n      // Tracked containers — the same set the mask classifier honors.\n      let tracked = false\n      let shape = ''\n      let hint = ''\n      if (ts.isPropertyAccessExpression(parent) && parent.expression === node) {\n        tracked = true\n      } else if (ts.isElementAccessExpression(parent) && parent.expression === node) {\n        if (\n          ts.isStringLiteralLike(parent.argumentExpression) ||\n          ts.isNumericLiteral(parent.argumentExpression)\n        ) {\n          tracked = true\n        } else {\n          shape = `dynamic element access \\`s[<expr>]\\``\n          hint =\n            'replace the dynamic key with a literal property (e.g. `s.foo`), or declare the read via `track({ deps: (s) => [s[key]] })`.'\n        }\n      } else if (ts.isCallExpression(parent) && parent.arguments[0] === node) {\n        if (\n          ts.isIdentifier(parent.expression) &&\n          !NON_DELEGATION_HELPERS.has(parent.expression.text)\n        ) {\n          // Identifier-callee delegation. Recurse into the callee's\n          // body via the same resolver the mask walker uses. If it\n          // resolves to a local accessor, the helper's reads are\n          // walked transitively and the call is tracked. If the\n          // callee is a function parameter, import, destructured\n          // binding, or otherwise unresolvable, this IS the leak\n          // shape — flag it here so the diagnostic points at the\n          // call site rather than at some deeper unresolvable read.\n          const resolved = resolveAccessorBody(parent.expression)\n          if (resolved) {\n            tracked = true\n          } else {\n            shape = `call to an unresolvable callee \\`${parent.expression.text}(s)\\` (function parameter, import, or destructured binding)`\n            hint =\n              'inline the read against `s` directly, refactor the callee into a same-module `const`/`function` declaration, or declare the dependencies via `track({ deps: (s) => [...] })`.'\n          }\n        } else if (!ts.isIdentifier(parent.expression)) {\n          // Method-call / computed callee with state arg —\n          // `obj.helper(s)`, `lib.fn(s)`. This is the documented\n          // headless-components idiom (`pr.valueText(s)` where `pr`\n          // comes from `progress.connect()`); refactoring it would\n          // defeat the API surface. The runtime sentinel keeps the\n          // binding correct — just at the cost of re-evaluating on\n          // every update. Treat as tracked from the lint's POV so\n          // legitimate composition doesn't error the build; the\n          // perf cost is a property of the composition pattern, not\n          // an author mistake worth blocking.\n          tracked = true\n        }\n      } else if (ts.isNewExpression(parent)) {\n        shape = 'state passed as a constructor argument (`new X(s)`)'\n        hint =\n          'compute the derived value inline against direct state reads, or use `track({ deps: (s) => [...] })` to declare the reads.'\n      } else if (ts.isSpreadElement(parent) || ts.isSpreadAssignment(parent)) {\n        shape = 'state spread (`{...s}` / `[...s]`)'\n        hint =\n          'spread only the fields you actually need (`{...s.user}`), or use `track({ deps: (s) => [...] })`.'\n      } else if (ts.isVariableDeclaration(parent)) {\n        shape = 'const alias (`const x = s; … x.foo`)'\n        hint =\n          'inline the alias to `s.foo`, or split the deeper read into a separate single-assignment alias `const foo = s.foo`.'\n      } else if (ts.isConditionalExpression(parent)) {\n        shape = 'state in a conditional branch (`cond ? s : other`)'\n        hint = 'move the conditional inside the property access: `cond ? s.foo : other.foo`.'\n      } else if (ts.isAsExpression(parent) || ts.isTypeAssertionExpression(parent)) {\n        shape = 'type assertion wrapping state (`(s as T).foo`)'\n        hint = 'drop the assertion — the chain `s.foo` already carries the type.'\n      } else if (ts.isParenthesizedExpression(parent)) {\n        // Walk up through parens transparently. Don't flag here; the\n        // outer parent classifies.\n        ts.forEachChild(node, visit)\n        return\n      } else {\n        shape = `state used outside a tracked container (${describe(parent)})`\n        hint =\n          'restructure the expression so `s` appears only as the root of a property/element-access chain, or declare the read via `track({ deps: (s) => [...] })`.'\n      }\n      if (!tracked) {\n        leak = { node, shape, hint }\n        return\n      }\n    }\n    ts.forEachChild(node, visit)\n  }\n  visit(accessor.body)\n  return leak\n}\n\nfunction describe(node: ts.Node): string {\n  if (ts.isIdentifier(node)) return node.text\n  if (ts.isPropertyAccessExpression(node)) return `${describe(node.expression)}.${node.name.text}`\n  return ts.SyntaxKind[node.kind]\n}\n\nexport function opaqueStateFlowModule(): CompilerModule {\n  return {\n    name: 'opaque-state-flow',\n    compilerVersion: '^0.3.0',\n    diagnostics: [\n      {\n        id: 'llui/opaque-state-flow',\n        description:\n          \"Reactive accessor flows state into an opaque expression the walker can't trace. The runtime stays correct via a FULL_MASK binding + whole-state sentinel in `__prefixes`, but the binding then re-evaluates on every state change.\",\n      },\n    ],\n    visitors: {\n      [ts.SyntaxKind.SourceFile]: (ctx, node) => {\n        const visited = node as ts.SourceFile\n        const sf = ts.createSourceFile(visited.fileName, visited.text, ts.ScriptTarget.Latest, true)\n\n        const walk = (n: ts.Node): void => {\n          if ((ts.isArrowFunction(n) || ts.isFunctionExpression(n)) && isReactiveAccessor(n)) {\n            const leak = findFirstLeakInAccessor(n)\n            if (leak) {\n              ctx.reportDiagnostic({\n                id: 'llui/opaque-state-flow',\n                severity: 'error',\n                category: 'perf',\n                message:\n                  `Reactive accessor flows state opaquely — ${leak.shape}. ` +\n                  `The compiler ships a correct binding (FULL_MASK + whole-state sentinel), ` +\n                  `but it re-evaluates on every state change. ${leak.hint}`,\n                location: {\n                  file: sf.fileName,\n                  range: rangeFromOffsets(sf.text, leak.node.getStart(sf), leak.node.getEnd()),\n                },\n              })\n            }\n          }\n          ts.forEachChild(n, walk)\n        }\n        walk(sf)\n      },\n    },\n  }\n}\n"]}

package/dist/transform.d.ts

@@ -56,7 +56,7 @@ export interface PreExtractedSchemas {
     stateSchema?: ReturnType<typeof extractStateSchema>;
     effectSchema?: ReturnType<typeof extractEffectSchema>;
 }
-export declare function transformLlui(source: string, _filename: string, devMode?: boolean, emitAgentMetadata?: boolean, mcpPort?: number | null, verbose?: boolean, typeSources?: ExternalTypeSources, preExtracted?: PreExtractedSchemas, crossFilePaths?: ReadonlySet<string>): {
+export declare function transformLlui(source: string, _filename: string, devMode?: boolean, emitAgentMetadata?: boolean, mcpPort?: number | null, verbose?: boolean, typeSources?: ExternalTypeSources, preExtracted?: PreExtractedSchemas, crossFilePaths?: ReadonlySet<string>, crossFileOpaque?: boolean): {
     output: string;
     edits: TransformEdit[];
     diagnostics: Diagnostic[];

package/dist/transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"transform.d.ts","sourceRoot":"","sources":["../src/transform.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AAG3B,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAA;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAA;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAA;AAOtD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AAiCjD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC,UAAU,CAQhF;AAwED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,WAAW,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;IAC5C,GAAG,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;IAC1C,MAAM,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;CAC9C;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,mBAAmB;IAClC,SAAS,CAAC,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAA;IAC/C,cAAc,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAA;IACzD,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAA;IACnD,YAAY,CAAC,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAA;CACtD;AAED,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,OAAO,UAAQ,EACf,iBAAiB,UAAQ,EACzB,OAAO,GAAE,MAAM,GAAG,IAAW,EAC7B,OAAO,UAAQ,EACf,WAAW,CAAC,EAAE,mBAAmB,EACjC,YAAY,CAAC,EAAE,mBAAmB,EAClC,cAAc,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GACnC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,aAAa,EAAE,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,GAAG,IAAI,CAywB9E;AA2cD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,EAAE,CAAC,cAAc,EACvB,UAAU,EAAE,EAAE,CAAC,iBAAiB,GAC/B,OAAO,CAUT;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,EAAE,CAAC,UAAU,EACnB,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EACxB,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5B,OAAO,CAgBT;AAgLD,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,EAAE,CAAC,aAAa,GAAG,EAAE,CAAC,kBAAkB,GAAG,EAAE,CAAC,mBAAmB,EAC3E,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC9B,OAAO,GAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAa,EACjC,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,OAAO,CAAA;CAAE,CAkHvD;AAkBD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI3D;AAED;;;GAGG;AACH,wBAAgB,8BAA8B,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,GAAG,MAAM,GAAG,IAAI,CAcrF;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CASzF;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,MAAM,EACd,cAAc,EAAE,KAAK,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,CAAC,GAChE,MAAM,CAYR"}
+{"version":3,"file":"transform.d.ts","sourceRoot":"","sources":["../src/transform.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AAG3B,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAA;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAA;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAA;AAOtD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AAiCjD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC,UAAU,CAQhF;AAwED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,WAAW,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;IAC5C,GAAG,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;IAC1C,MAAM,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAA;CAC9C;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,mBAAmB;IAClC,SAAS,CAAC,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAA;IAC/C,cAAc,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAA;IACzD,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,kBAAkB,CAAC,CAAA;IACnD,YAAY,CAAC,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAA;CACtD;AAED,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,OAAO,UAAQ,EACf,iBAAiB,UAAQ,EACzB,OAAO,GAAE,MAAM,GAAG,IAAW,EAC7B,OAAO,UAAQ,EACf,WAAW,CAAC,EAAE,mBAAmB,EACjC,YAAY,CAAC,EAAE,mBAAmB,EAClC,cAAc,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,EACpC,eAAe,UAAQ,GACtB;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,aAAa,EAAE,CAAC;IAAC,WAAW,EAAE,UAAU,EAAE,CAAA;CAAE,GAAG,IAAI,CAkxB9E;AA2cD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,EAAE,CAAC,cAAc,EACvB,UAAU,EAAE,EAAE,CAAC,iBAAiB,GAC/B,OAAO,CAUT;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,IAAI,EAAE,EAAE,CAAC,UAAU,EACnB,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EACxB,OAAO,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5B,OAAO,CAgBT;AAgLD,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,EAAE,CAAC,aAAa,GAAG,EAAE,CAAC,kBAAkB,GAAG,EAAE,CAAC,mBAAmB,EAC3E,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC9B,OAAO,GAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAa,EACjC,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,OAAO,CAAA;CAAE,CAiLvD;AAkBD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI3D;AAED;;;GAGG;AACH,wBAAgB,8BAA8B,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,GAAG,MAAM,GAAG,IAAI,CAcrF;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,CASzF;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,MAAM,EACd,cAAc,EAAE,KAAK,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,CAAC,GAChE,MAAM,CAYR"}