@llui/dom 0.0.40 → 0.2.0

package/dist/primitives/each.js.map

@@ -1 +1 @@
-{"version":3,"file":"each.js","sourceRoot":"","sources":["../../src/primitives/each.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,aAAa,EACb,YAAY,GAEb,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EACL,cAAc,EACd,eAAe,EACf,oBAAoB,EACpB,WAAW,EACX,sBAAsB,GACvB,MAAM,gBAAgB,CAAA;AACvB,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAA;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AAE/C,6FAA6F;AAC7F,kFAAkF;AAClF,IAAI,oBAAoB,GAA6B,IAAI,CAAA;AACzD,IAAI,qBAAqB,GAAiD,IAAI,CAAA;AAE9E,uEAAuE;AACvE,MAAM,UAAU,eAAe,CAAC,EAAc;IAC5C,IAAI,oBAAoB;QAAE,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACzD,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,gBAAgB,CAAC,EAAkC;IACjE,IAAI,qBAAqB;QAAE,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AAC3D,CAAC;AAED,6EAA6E;AAC7E,4EAA4E;AAC5E,yEAAyE;AACzE,SAAS,SAAS,CAAO,IAA8B,EAAE,KAAQ;IAC/D,aAAa,CAAC,cAAc,CAAC,CAAA;IAC7B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAA;IAChB,CAAC;AACH,CAAC;AACD,SAAS,OAAO,CAAI,IAAwC,EAAE,IAAO;IACnE,aAAa,CAAC,YAAY,CAAC,CAAA;IAC3B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAA;IAChB,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,6EAA6E;AAC7E,gFAAgF;AAChF,eAAe;AACf,MAAM,QAAQ,GAAkB;IAC9B,YAAY,EAAE,IAA2B;IACzC,KAAK,EAAE,IAAI;IACX,WAAW,EAAE,EAAE;IACf,gBAAgB,EAAE,EAAE;IACpB,GAAG,EAAE,IAAiD;CACvD,CAAA;AAED,4EAA4E;AAC5E,MAAM,QAAQ,GAA4B;IACxC,IAAI,EAAE,IAAI;IACV,IAAI,IAAI;QACN,OAAQ,QAAQ,CAAC,aAA+B,EAAE,CAAA;IACpD,CAAC;IACD,GAAG,EAAE,IAAI;IACT,KAAK,EAAE,IAAI;IACX,aAAa,EAAE,IAAI;CACpB,CAAA;AAaD,MAAM,UAAU,IAAI,CAAoB,IAA0B;IAChE,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAA;IACpC,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,CAAA;IACvC,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IAEnC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;IAC5C,uEAAuE;IACvE,sEAAsE;IACtE,sEAAsE;IACtE,wEAAwE;IACxE,yEAAyE;IACzE,sEAAsE;IACtE,uEAAuE;IACvE,gEAAgE;IAChE,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,CAAA;IACnD,MAAM,OAAO,GAAe,EAAE,CAAA;IAC9B,MAAM,cAAc,GAAsB,EAAE,CAAA;IAC5C,MAAM,eAAe,GAA0C,EAAE,CAAA;IACjE,sEAAsE;IACtE,yDAAyD;IACzD,MAAM,OAAO,GAAe,EAAE,CAAA;IAE9B,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,KAAU,CAAC,CAAA;IACpD,IAAI,YAAY,GAAG,YAAY,CAAA;IAE/B,sEAAsE;IACtE,iEAAiE;IACjE,qEAAqE;IACrE,iEAAiE;IACjE,qEAAqE;IACrE,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAA;IACzB,MAAM,UAAU,GAAG,IAAI,EAAE,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;IAClF,MAAM,YAAY,GAAG,GAAoB,EAAE;QACzC,IAAI,IAAI,EAAE,YAAY,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACjD,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3E,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IACD,MAAM,QAAQ,GAAG,CAAC,OAAwB,EAAQ,EAAE;QAClD,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,EAAE,YAAY,KAAK,SAAS;YAAE,OAAM;QAChE,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,MAAM,KAAK,GAAqD,EAAE,CAAA;QAClE,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC7D,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;YACrB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YAC/B,IAAI,IAAI,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;;gBAC9C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;YACrB,WAAW,EAAE,IAAI,CAAC,cAAc,IAAI,CAAC;YACrC,UAAU;YACV,KAAK;YACL,OAAO;YACP,KAAK;YACL,MAAM;SACP,CAAC,CAAA;IACJ,CAAC,CAAA;IAED,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAG,IAA4B,CAAC,MAAM,IAAI,SAAS;QACvD,SAAS,CAAC,KAAc;YACtB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAE5C,mDAAmD;YACnD,IAAI,QAAQ,KAAK,YAAY;gBAAE,OAAM;YACrC,YAAY,GAAG,QAAQ,CAAA;YAEvB,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAY,EAAE,OAAO,EAAE,EAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;YAC3F,gBAAgB,CACd,OAAO,EACP,QAAQ,EACR,IAAI,EACJ,cAAc,EACd,MAAM,EACN,MAAM,EACN,SAAS,EACT,GAAG,EACH,KAAK,EACL,OAAO,EACP,MAAM,CACP,CAAA;YACD,IAAI,IAAI,CAAC,YAAY,IAAI,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAA;YACnF,CAAC;YACD,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;kFAC0E;QAC1E,cAAc,CAAC,KAAc;YAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;gBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC3B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,cAAc;YACZ,YAAY,GAAG,EAAoB,CAAA;YACnC,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YACnB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAM;YAEhC,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAE9B,oEAAoE;YACpE,kEAAkE;YAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,cAAc,CAAC,CAAC,CAAE,EAAE,CAAA;YAEpE,qEAAqE;YACrE,qEAAqE;YACrE,oDAAoD;YACpD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;YAEtB,uEAAuE;YACvE,0CAA0C;YAC1C,MAAM,MAAM,GAAe,EAAE,CAAA;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;gBAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;gBAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAChB,CAAC;YACD,oBAAoB,CAAC,MAAM,CAAC,CAAA;YAC5B,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAElB,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;;4EAEoE;QACpE,eAAe,CAAC,KAAc;YAC5B,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;YAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;YAC9B,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;gBACrB,6EAA6E;gBAC7E,gBAAgB,CACd,OAAO,EACP,QAAQ,EACR,IAAI,EACJ,cAAc,EACd,MAAM,EACN,MAAM,EACN,SAAS,EACT,GAAG,EACH,KAAK,EACL,OAAO,EACP,IAAI,CACL,CAAA;gBACD,QAAQ,CAAC,OAAO,CAAC,CAAA;gBACjB,OAAM;YACR,CAAC;YAED,qFAAqF;YACrF,IAAI,EAAE,GAAG,CAAC,CAAA;YACV,IAAI,SAAS,GAAG,KAAK,CAAA;YACrB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAE,CAAA;gBAC1B,IAAI,EAAE,GAAG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAE,CAAC,EAAE,CAAC;oBAC9D,8CAA8C;oBAC9C,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;wBAChC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAE,EAAE,EAAE,CAAC,CAAA;oBACvC,CAAC;oBACD,EAAE,EAAE,CAAA;gBACN,CAAC;qBAAM,CAAC;oBACN,yDAAyD;oBACzD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,EAAE;wBAAE,eAAe,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;oBACnF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;wBAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;oBACxD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;oBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;oBAClC,OAAO,CAAC,EAAE,CAAC,GAAG,IAAK,CAAA;oBACnB,SAAS,GAAG,IAAI,CAAA;gBAClB,CAAC;YACH,CAAC;YAED,wBAAwB;YACxB,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC,GAAG,CAAC,CAAA;gBACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,IAAI,OAAO,CAAC,CAAC,CAAC;wBAAE,OAAO,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBAC5C,CAAC;gBACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;gBAClB,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACxC,CAAC;YAED,uCAAuC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,GAAG,CAAC,CAAA;YACvB,CAAC;YAED,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;iFACyE;QACzE,gBAAgB,CAAC,KAAc,EAAE,MAAc;YAC7C,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;gBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC3B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAA;IAED,sEAAsE;IACtE,wEAAwE;IACxE,uEAAuE;IACvE,uEAAuE;IACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,oBAAoB,GAAG,cAAc,CAAA;IACrC,qBAAqB,GAAG,eAAe,CAAA;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAE,CAAA;QAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,CAAC,CAAA;QAC5D,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACrB,CAAC;IACD,oBAAoB,GAAG,IAAI,CAAA;IAC3B,qBAAqB,GAAG,IAAI,CAAA;IAE5B,0CAA0C;IAC1C,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED,WAAW,CAAC,cAAc,EAAE,GAAG,EAAE;QAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACjC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACrC,uEAAuE;QACvE,kEAAkE;QAClE,yCAAyC;QACzC,EAAE;QACF,kEAAkE;QAClE,8DAA8D;QAC9D,6DAA6D;QAC7D,kEAAkE;QAClE,+DAA+D;QAC/D,kEAAkE;QAClE,0BAA0B;QAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACpC,CAAC;QACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QAClB,IAAI,MAAM,CAAC,UAAU;YAAE,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QAC5D,IAAI,SAAS,CAAC,UAAU;YAAE,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;QACrE,iDAAiD;QACjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACpC,CAAC;QACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACpB,CAAC,CAAC,CAAA;IAEF,MAAM,MAAM,GAAW,CAAC,MAAM,CAAC,CAAA;IAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IAC/D,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACtB,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAClB,KAAe,EACf,IAAyD,EACzD,OAAmB;IAEnB,MAAM,SAAS,GAAG,GAAS,EAAE;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,UAAU;gBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;QACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAClC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACxC,CAAC,CAAA;IACD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,MAAM,IAAI,OAAQ,MAAwB,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACnE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAClB;YAAC,MAAwB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YAC1C,OAAM;QACR,CAAC;IACH,CAAC;IACD,SAAS,EAAE,CAAA;AACb,CAAC;AAED,SAAS,SAAS,CAChB,KAAe,EACf,IAAyD;IAEzD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC9B,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,IAAO,EACP,KAAa,EACb,IAA0B,EAC1B,cAAwB,EACxB,GAAwC,EACxC,KAAe;IAEf,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC/B,2EAA2E;IAC3E,2EAA2E;IAC3E,qEAAqE;IACrE,MAAM,KAAK,GAAG,cAAc,CAAC,cAAc,CAAC,CAAA;IAC5C,KAAK,CAAC,KAAK,GAAG,MAAM,CAAA;IACpB,MAAM,YAAY,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAM,CAAA;IAC9C,MAAM,IAAI,GAAG,GAAG,CAAC,IAAwB,CAAA;IAEzC,qEAAqE;IACrE,MAAM,KAAK,GAAa,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAE9F,yDAAyD;IACzD,MAAM,MAAM,GAAG,CAAI,QAAqB,EAAa,EAAE;QACrD,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;QAC9C,QAAQ,CAAC,SAAS,GAAG,IAAa,CAAA;QAClC,OAAO,QAAQ,CAAA;IACjB,CAAC,CAAA;IAED,qEAAqE;IACrE,oEAAoE;IACpE,mEAAmE;IACnE,iDAAiD;IACjD,IAAI,SAAS,GAA2B,IAAI,CAAA;IAC5C,MAAM,YAAY,GAAG,GAAoB,EAAE;QACzC,IAAI,SAAS;YAAE,OAAO,SAAS,CAAA;QAC/B,IAAI,UAAU,GAAsC,IAAI,CAAA;QACxD,SAAS,GAAG,IAAI,KAAK,CAAC,MAAgB,EAAE;YACtC,GAAG,CAAC,MAAM,EAAE,IAAI;gBACd,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;oBACxE,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;gBAClC,CAAC;gBACD,MAAM,GAAG,GAAG,IAAc,CAAA;gBAC1B,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBAClC,IAAI,MAAM;wBAAE,OAAO,MAAM,CAAA;gBAC3B,CAAC;qBAAM,CAAC;oBACN,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;gBACxB,CAAC;gBACD,+DAA+D;gBAC/D,kEAAkE;gBAClE,uDAAuD;gBACvD,MAAM,QAAQ,GACZ,GAAG,KAAK,SAAS;oBACf,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO;oBACrB,CAAC,CAAC,GAAG,EAAE,CAAE,KAAK,CAAC,OAAmC,CAAC,GAAG,CAAC,CAC1D;gBAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;gBAC9D,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;gBAC7B,OAAO,QAAQ,CAAA;YACjB,CAAC;SACF,CAAoB,CAAA;QACrB,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,MAAM,aAAa,GAAG,GAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAA;IAE/C,qEAAqE;IACrE,kEAAkE;IAClE,oEAAoE;IACpE,qEAAqE;IACrE,wEAAwE;IACxE,qEAAqE;IACrE,mEAAmE;IACnE,yBAAyB;IACzB,QAAQ,CAAC,YAAY,GAAG,KAAK,CAAA;IAC7B,QAAQ,CAAC,KAAK,GAAG,YAAY,CAAA;IAC7B,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;IACtC,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC,gBAAgB,CAAA;IAChD,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;IACtB,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;IAChC,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA;IACxB,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;IAClC,MAAM,gBAAgB,GAAG,eAAe,EAAE,CAAA;IAC1C,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChC,gBAAgB,CAAC,QAAQ,CAAC,CAAA;IAE1B,qEAAqE;IACrE,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;IACpB,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,GAAG,aAAa,CAAA;IAC9B,QAAQ,CAAC,aAAa,GAAG,YAAY,CAAA;IACrC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;IACtB,uEAAuE;IACvE,qEAAqE;IACrE,iEAAiE;IACjE,QAAQ,CAAC,CAAC,GAAG,UAAU,CAAO,IAAI,CAAC,CAAA;IACnC,mFAAmF;IACnF,MAAM,MAAM,GAAG,IAA0C,CAAA;IACzD,IAAI,MAAM,CAAC,KAAK;QAAE,QAAQ,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;IAC/C,IAAI,MAAM,CAAC,QAAQ;QAAE,QAAQ,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAA;IACxD,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAA6C,CAAC,CAAA;IAExE,8EAA8E;IAC9E,uEAAuE;IACvE,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAA;QACnC,KAAK,CAAC,YAAY,GAAG,EAAE,CAAA;IACzB,CAAC;IAED,kBAAkB,EAAE,CAAA;IACpB,eAAe,CAAC,gBAAgB,CAAC,CAAA;IACjC,gBAAgB,CAAC,GAAG,CAAC,CAAA;IAErB,OAAO,KAAK,CAAA;AACd,CAAC;AAOD,SAAS,YAAY,CAAC,MAAc,EAAE,KAAa;IACjD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACvC,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAmB,EACnB,QAAa,EACb,IAAuB,EACvB,cAAwB,EACxB,MAAY,EACZ,MAAY,EACZ,SAAe,EACf,GAAwC,EACxC,KAAc,EACd,OAAmB,EACnB,MAA+B;IAE/B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;IAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;IAC9B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;IAE7B,6CAA6C;IAC7C,sEAAsE;IACtE,sEAAsE;IACtE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,KAAK,IAAI,OAAO;gBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QACxE,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,CAAA;YAChC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAClB,KAAK,MAAM,KAAK,IAAI,QAAQ;gBAAE,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YAC/D,OAAM;QACR,CAAC;QACD,iEAAiE;QACjE,mEAAmE;QACnE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;QACxB,CAAC;QACD,0EAA0E;QAC1E,MAAM,MAAM,GAAe,EAAE,CAAA;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;YAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;YAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChB,CAAC;QACD,oBAAoB,CAAC,MAAM,CAAC,CAAA;QAC5B,sBAAsB,CAAC,cAAc,CAAC,CAAA;QACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QAClB,OAAM;IACR,CAAC;IAED,+DAA+D;IAC/D,IAAI,MAAM,GAAG,MAAM,IAAI,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAA;QAC3C,CAAC;QACD,+EAA+E;QAC/E,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAA;QAC1D,MAAM,GAAG,GAAG,SAAS;YACnB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,WAAW;YAC1D,CAAC,CAAC,MAAM,CAAC,WAAW,CAAA;QACtB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;QAC7C,MAAM,UAAU,GAAe,EAAE,CAAA;QACjC,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;YAC3E,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACnB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,KAAK,IAAI,UAAU;gBAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5E,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACtD,OAAM;IACR,CAAC;IAED,uEAAuE;IACvE,6DAA6D;IAC7D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAA;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAA;QAClB,IAAI,aAAa,GAAG,CAAC,CAAA;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;YACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;gBAAE,SAAQ;YACpC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;YACrC,IAAI,KAAK,CAAC,GAAG,KAAK,MAAM,EAAE,CAAC;gBACzB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAC9B,SAAQ;YACV,CAAC;YACD,0CAA0C;YAC1C,aAAa,EAAE,CAAA;YACf,IAAI,aAAa,KAAK,CAAC;gBAAE,SAAS,GAAG,CAAC,CAAA;iBACjC,IAAI,aAAa,KAAK,CAAC;gBAAE,SAAS,GAAG,CAAC,CAAA;;gBACtC,MAAK,CAAC,+CAA+C;QAC5D,CAAC;QAED,uDAAuD;QACvD,IAAI,aAAa,KAAK,CAAC;YAAE,OAAM;QAE/B,kDAAkD;QAClD,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAE,CAAA;YAC9B,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAE,CAAA;YAC9B,IACE,EAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAE,CAAC;gBAC9C,EAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAE,CAAC,EAC9C,CAAC;gBACD,WAAW;gBACX,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,SAAS,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,WAAW,CAAA;gBAC5D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK;oBAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;gBAC5D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK;oBAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;gBACjE,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,CAAA;gBACvB,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,SAAS,CAAE,EAAE,SAAS,CAAC,CAAA;gBAChD,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,SAAS,CAAE,EAAE,SAAS,CAAC,CAAA;gBAChD,OAAM;YACR,CAAC;QACH,CAAC;QACD,6DAA6D;IAC/D,CAAC;IAED,kEAAkE;IAClE,8EAA8E;IAC9E,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,EAAE,CAAC;QAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAA;QAC1C,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACnD,IAAI,SAAS,GAAG,KAAK,CAAA;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC;gBAC7C,SAAS,GAAG,IAAI,CAAA;gBAChB,MAAK;YACP,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,OAAO;oBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YACxE,CAAC;YACD,gEAAgE;YAChE,8DAA8D;YAC9D,mCAAmC;YACnC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;YACtB,8BAA8B;YAC9B,MAAM,YAAY,GAAe,EAAE,CAAA;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;gBAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;gBAC/B,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACtB,CAAC;YACD,oBAAoB,CAAC,YAAY,CAAC,CAAA;YAClC,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAClB,wCAAwC;YACxC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;YAC7C,MAAM,UAAU,GAAe,EAAE,CAAA;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC3E,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACnB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;oBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAA;YAC7C,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,UAAU;oBAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YAC5E,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,UAAU;gBAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YACtD,OAAM;QACR,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAA;IACrD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAChC,CAAC;IAED,MAAM,UAAU,GAAe,EAAE,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC3C,MAAM,UAAU,GAAe,EAAE,CAAA;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAEjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;YAC9B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3B,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;YACnE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACtB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,kEAAkE;IAClE,8DAA8D;IAC9D,IAAI,aAAa,GAAG,KAAK,CAAA;IACzB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,MAAM;gBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YACrD,IAAI,QAAQ,EAAE,CAAC;gBACb,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YACnC,CAAC;iBAAM,CAAC;gBACN,mEAAmE;gBACnE,6DAA6D;gBAC7D,6DAA6D;gBAC7D,8DAA8D;gBAC9D,8DAA8D;gBAC9D,8DAA8D;gBAC9D,uDAAuD;gBACvD,mCAAmC;gBACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM;wBAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;gBAC1D,CAAC;gBACD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAClC,aAAa,GAAG,IAAI,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,aAAa;QAAE,sBAAsB,CAAC,cAAc,CAAC,CAAA;IAEzD,cAAc;IACd,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAEhE,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;QACtE,qCAAqC;QACrC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;QAC7C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAA;IAC/C,CAAC;SAAM,CAAC;QACN,kEAAkE;QAClE,IAAI,IAAI,GAA4B,IAAI,CAAA;QACxC,IAAI,SAAS,GAAqB,MAAM,CAAC,WAAW,CAAA;QACpD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,kDAAkD;gBAClD,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;oBACpC,IAAI,GAAG,IAAI,CAAA;gBACb,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;gBACpD,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;YACzD,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,IAAI,CAAC,IAAI;oBAAE,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;gBAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;oBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;QACD,IAAI,IAAI;YAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAChD,CAAC;IAED,OAAO,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAA;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAA;IAEvE,IAAI,MAAM,EAAE,CAAC;QACX,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5E,CAAC;IAED,2DAA2D;IAC3D,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IACxD,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAI,KAAe,EAAE,IAAO,EAAE,KAAa;IAC7D,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC5C,KAAK,CAAC,IAAI,GAAG,IAAI,CAAA;IACjB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAA;IACpB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;IACnB,kCAAkC;IAClC,sEAAsE;IACtE,IAAI,OAAO,EAAE,CAAC;QACZ,+DAA+D;QAC/D,MAAM,MAAM,GAAI,KAA4C,CAAC,WAEhD,CAAA;QACb,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,KAAK,CAAC,CAAA;QACf,CAAC;aAAM,CAAC;YACN,yBAAyB;YACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAA;YACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAO,OAAmB,EAAE,QAAa,EAAE,IAAuB;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC;YAAE,OAAO,KAAK,CAAA;IACnE,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,gBAAgB,CACvB,UAAsB,EACtB,UAAsB,EACtB,QAA8B;IAE9B,oCAAoC;IACpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAA;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACrC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACxC,CAAC;IACH,CAAC;IACD,0EAA0E;IAC1E,IAAI,WAAW,GAAG,CAAC,CAAC,CAAA;IACpB,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACzC,IAAI,MAAM,KAAK,SAAS;YAAE,SAAQ,CAAC,kBAAkB;QACrD,IAAI,MAAM,GAAG,WAAW;YAAE,OAAO,KAAK,CAAA;QACtC,WAAW,GAAG,MAAM,CAAA;IACtB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["import type { EachOptions, ItemAccessor, Lifetime } from '../types.js'\nimport {\n  getRenderContext,\n  setRenderContext,\n  clearRenderContext,\n  enterAccessor,\n  exitAccessor,\n  type RenderContext,\n} from '../render-context.js'\nimport {\n  createLifetime,\n  disposeLifetime,\n  disposeLifetimesBulk,\n  addDisposer,\n  removeOrphanedChildren,\n} from '../lifetime.js'\nimport { getFlatBindings, setFlatBindings } from '../binding.js'\nimport { FULL_MASK } from '../update-loop.js'\nimport type { StructuralBlock } from '../structural.js'\nimport { createView } from '../view-helpers.js'\n\n// Clear callbacks — registered by selector.bind() during render, called by reconcileClear().\n// Eliminates per-row disposers (1000 Set.delete calls → 1 registry.clear() call).\nlet activeClearCallbacks: Array<() => void> | null = null\nlet activeRemoveCallbacks: Array<(key: string | number) => void> | null = null\n\n/** Register a callback to run when the current each() block clears. */\nexport function registerOnClear(cb: () => void): void {\n  if (activeClearCallbacks) activeClearCallbacks.push(cb)\n}\n\n/** Register a callback to run when a single row is removed by key. */\nexport function registerOnRemove(cb: (key: string | number) => void): void {\n  if (activeRemoveCallbacks) activeRemoveCallbacks.push(cb)\n}\n\n// Wrap accessor invocations so `sample()` calls inside them throw a targeted\n// error. The wrappers also localise the contract: every items/key call goes\n// through these, so a future change (e.g. instrumentation) has one site.\nfunction callItems<S, T>(opts: { items: (s: S) => T[] }, state: S): T[] {\n  enterAccessor('each().items')\n  try {\n    return opts.items(state)\n  } finally {\n    exitAccessor()\n  }\n}\nfunction callKey<T>(opts: { key: (t: T) => string | number }, item: T): string | number {\n  enterAccessor('each().key')\n  try {\n    return opts.key(item)\n  } finally {\n    exitAccessor()\n  }\n}\n\n// Reusable render context for buildEntry — avoids object allocation per entry.\n// Every field is overwritten from the surrounding context per reconcile call\n// (see buildEntry), so the initial shape's null/empty values are never observed\n// in practice.\nconst buildCtx: RenderContext = {\n  rootLifetime: null as unknown as Lifetime,\n  state: null,\n  allBindings: [],\n  structuralBlocks: [],\n  dom: null as unknown as import('../dom-env.js').DomEnv,\n}\n\n// Reusable render bag — mutated per entry instead of allocating new objects\nconst buildBag: Record<string, unknown> = {\n  send: null,\n  get item() {\n    return (buildBag._getItemProxy as () => unknown)()\n  },\n  acc: null,\n  index: null,\n  _getItemProxy: null,\n}\n\ninterface Entry<T> {\n  key: string | number\n  item: T\n  current: T\n  index: number\n  scope: Lifetime\n  nodes: Node[]\n  /** Per-item updaters — stored on entry directly to avoid scope overhead for leaf rows */\n  updaters: Array<() => void>\n}\n\nexport function each<S, T, M = unknown>(opts: EachOptions<S, T, M>): Node[] {\n  const ctx = getRenderContext('each')\n  const parentLifetime = ctx.rootLifetime\n  const blocks = ctx.structuralBlocks\n\n  const anchor = ctx.dom.createComment('each')\n  // End-of-territory sentinel. Bulk Range ops (reconcileClear, Fast path\n  // 1, Fast path 5) used to setEndAfter the last entry's last node, but\n  // when a nested structural primitive replaced its own entries between\n  // the outer render snapshot and the next outer reconcile, that captured\n  // node could be detached — Range#setEndAfter throws InvalidNodeTypeError\n  // on a parent-less node. Anchoring the range with two stable comments\n  // (owned by this each) makes the bulk-remove correct regardless of any\n  // inner-each / show / branch mutation that happened in between.\n  const endAnchor = ctx.dom.createComment('each-end')\n  const entries: Entry<T>[] = []\n  const clearCallbacks: Array<() => void> = []\n  const removeCallbacks: Array<(key: string | number) => void> = []\n  // Entries whose leave animation is still in progress. Their DOM nodes\n  // remain in the parent until the leave Promise resolves.\n  const leaving: Entry<T>[] = []\n\n  const initialItems = callItems(opts, ctx.state as S)\n  let lastItemsRef = initialItems\n\n  // Dev-only diff tracking: if the owning component has an _eachDiffLog\n  // (installed by devtools), we capture key sets before/after each\n  // key-mutating reconcile call and emit an EachDiff entry. The siteId\n  // is derived from this each() block's position in the flat block\n  // array at registration time — stable for the lifetime of the block.\n  const inst = ctx.instance\n  const eachSiteId = inst?._eachDiffLog !== undefined ? `each#${blocks.length}` : ''\n  const snapshotKeys = (): string[] | null => {\n    if (inst?._eachDiffLog === undefined) return null\n    const keys: string[] = []\n    for (let i = 0; i < entries.length; i++) keys.push(String(entries[i]!.key))\n    return keys\n  }\n  const emitDiff = (oldKeys: string[] | null): void => {\n    if (oldKeys === null || inst?._eachDiffLog === undefined) return\n    const newKeys: string[] = []\n    for (let i = 0; i < entries.length; i++) newKeys.push(String(entries[i]!.key))\n    const oldKeySet = new Set(oldKeys)\n    const newKeySet = new Set(newKeys)\n    const added: string[] = []\n    const removed: string[] = []\n    const moved: Array<{ key: string; from: number; to: number }> = []\n    const reused: string[] = []\n    for (const k of newKeys) if (!oldKeySet.has(k)) added.push(k)\n    for (const k of oldKeys) if (!newKeySet.has(k)) removed.push(k)\n    for (let i = 0; i < newKeys.length; i++) {\n      const k = newKeys[i]!\n      if (!oldKeySet.has(k)) continue\n      const from = oldKeys.indexOf(k)\n      if (from !== i) moved.push({ key: k, from, to: i })\n      else reused.push(k)\n    }\n    inst._eachDiffLog.push({\n      updateIndex: inst._updateCounter ?? 0,\n      eachSiteId,\n      added,\n      removed,\n      moved,\n      reused,\n    })\n  }\n\n  const block: StructuralBlock = {\n    mask: (opts as { __mask?: number }).__mask ?? FULL_MASK,\n    reconcile(state: unknown) {\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const newItems = callItems(opts, state as S)\n\n      // Fast path: same array reference → skip entirely.\n      if (newItems === lastItemsRef) return\n      lastItemsRef = newItems\n\n      const oldKeys = snapshotKeys()\n      const report = opts.onTransition ? { entering: [] as Node[], leaving: [] as Node[] } : null\n      reconcileEntries(\n        entries,\n        newItems,\n        opts,\n        parentLifetime,\n        parent,\n        anchor,\n        endAnchor,\n        ctx,\n        state,\n        leaving,\n        report,\n      )\n      if (opts.onTransition && report) {\n        opts.onTransition({ entering: report.entering, leaving: report.leaving, parent })\n      }\n      emitDiff(oldKeys)\n    },\n\n    /** Same keys, only item data changed — skip mismatch/swap detection.\n     *  Compiler calls this when it knows the array structure is unchanged. */\n    reconcileItems(state: unknown) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      const len = Math.min(entries.length, newItems.length)\n      for (let i = 0; i < len; i++) {\n        const entry = entries[i]!\n        const newItem = newItems[i]!\n        if (entry.item !== newItem) {\n          updateEntry(entry, newItem, i)\n        }\n      }\n    },\n\n    /** Remove all items — skip items accessor, go straight to clear path. */\n    reconcileClear() {\n      lastItemsRef = [] as unknown as T[]\n      const parent = anchor.parentNode\n      if (!parent) return\n      if (entries.length === 0) return\n\n      const oldKeys = snapshotKeys()\n\n      // Call registered clear callbacks (e.g., selector registry.clear())\n      // BEFORE scope disposal — avoids 1000 individual Set.delete calls\n      for (let i = 0; i < clearCallbacks.length; i++) clearCallbacks[i]!()\n\n      // Bulk DOM removal — anchored on this each's own start/end sentinels\n      // so a nested primitive that replaced its own captured nodes between\n      // the outer snapshot and now can't make this throw.\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n\n      // Bulk scope disposal — disposers that were replaced by clearCallbacks\n      // are now no-ops, making this much faster\n      const scopes: Lifetime[] = []\n      for (let i = 0; i < entries.length; i++) {\n        const s = entries[i]!.scope\n        s.disposalCause = 'each-remove'\n        scopes.push(s)\n      }\n      disposeLifetimesBulk(scopes)\n      removeOrphanedChildren(parentLifetime)\n      entries.length = 0\n\n      emitDiff(oldKeys)\n    },\n\n    /** Remove entries not present in the new items. Optimized for filter()\n     *  patterns where items are removed but order is preserved. Walks old\n     *  and new arrays in parallel — O(n) with no Map/Set allocation. */\n    reconcileRemove(state: unknown) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const oldKeys = snapshotKeys()\n      const oldLen = entries.length\n      const newLen = newItems.length\n      if (newLen >= oldLen) {\n        // Not a removal — fallback (shouldn't happen if compiler detected correctly)\n        reconcileEntries(\n          entries,\n          newItems,\n          opts,\n          parentLifetime,\n          parent,\n          anchor,\n          endAnchor,\n          ctx,\n          state,\n          leaving,\n          null,\n        )\n        emitDiff(oldKeys)\n        return\n      }\n\n      // Parallel walk: new items are a subsequence of old items (same order, some removed)\n      let ni = 0\n      let didRemove = false\n      for (let oi = 0; oi < oldLen; oi++) {\n        const entry = entries[oi]!\n        if (ni < newLen && entry.key === callKey(opts, newItems[ni]!)) {\n          // Entry survives — update if item ref changed\n          if (entry.item !== newItems[ni]) {\n            updateEntry(entry, newItems[ni]!, ni)\n          }\n          ni++\n        } else {\n          // Entry removed — notify selectors before scope disposal\n          for (let ci = 0; ci < removeCallbacks.length; ci++) removeCallbacks[ci]!(entry.key)\n          for (const node of entry.nodes) parent.removeChild(node)\n          entry.scope.disposalCause = 'each-remove'\n          disposeLifetime(entry.scope, true)\n          entries[oi] = null!\n          didRemove = true\n        }\n      }\n\n      // Compact entries array\n      if (didRemove) {\n        let w = 0\n        for (let r = 0; r < oldLen; r++) {\n          if (entries[r]) entries[w++] = entries[r]!\n        }\n        entries.length = w\n        removeOrphanedChildren(parentLifetime)\n      }\n\n      // Update indices for remaining entries\n      for (let i = 0; i < entries.length; i++) {\n        entries[i]!.index = i\n      }\n\n      emitDiff(oldKeys)\n    },\n\n    /** Update only entries at stride intervals — O(k) where k = n/stride.\n     *  The compiler passes the stride from the detected for-loop pattern. */\n    reconcileChanged(state: unknown, stride: number) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      for (let i = 0; i < entries.length && i < newItems.length; i += stride) {\n        const entry = entries[i]!\n        const newItem = newItems[i]!\n        if (entry.item !== newItem) {\n          updateEntry(entry, newItem, i)\n        }\n      }\n    },\n  }\n\n  // Register the block BEFORE building initial row entries so that this\n  // each() block precedes any nested structural blocks its rows register.\n  // Parents must come first in the flat blocks array — see branch.ts for\n  // the full rationale (Phase 1 iteration safety when disposing nested).\n  blocks.push(block)\n\n  activeClearCallbacks = clearCallbacks\n  activeRemoveCallbacks = removeCallbacks\n  for (let i = 0; i < initialItems.length; i++) {\n    const item = initialItems[i]!\n    const entry = buildEntry(item, i, opts, parentLifetime, ctx)\n    entries.push(entry)\n  }\n  activeClearCallbacks = null\n  activeRemoveCallbacks = null\n\n  // Fire initial enter for mount-time items\n  if (opts.enter) {\n    for (const entry of entries) {\n      if (entry.nodes.length > 0) opts.enter(entry.nodes)\n    }\n  }\n\n  addDisposer(parentLifetime, () => {\n    const idx = blocks.indexOf(block)\n    if (idx !== -1) blocks.splice(idx, 1)\n    // parentLifetime is being disposed — its children array is about to be\n    // cleared by the recursive dispose pass, so skip per-entry parent\n    // removal (avoids O(N²) indexOf+splice).\n    //\n    // Rows created AFTER the parent's initial render (each reconciled\n    // with a new item list) are siblings of the anchor inside the\n    // parent's DOM container, but aren't tracked by the parent's\n    // snapshot (e.g. an outer branch's currentNodes). Walking entries\n    // here and removing their DOM — guarded by parentNode — closes\n    // the leak: cascade-removed subtrees no-op, live-parent cases get\n    // the orphans cleaned up.\n    for (const entry of entries) {\n      for (const node of entry.nodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n      disposeLifetime(entry.scope, true)\n    }\n    entries.length = 0\n    if (anchor.parentNode) anchor.parentNode.removeChild(anchor)\n    if (endAnchor.parentNode) endAnchor.parentNode.removeChild(endAnchor)\n    // Force-remove any mid-leave entries immediately\n    for (const entry of leaving) {\n      for (const node of entry.nodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n      disposeLifetime(entry.scope, true)\n    }\n    leaving.length = 0\n  })\n\n  const result: Node[] = [anchor]\n  for (const entry of entries) {\n    const nodes = entry.nodes\n    for (let i = 0; i < nodes.length; i++) result.push(nodes[i]!)\n  }\n  result.push(endAnchor)\n  return result\n}\n\n/**\n * Remove an entry's DOM + dispose its scope, running opts.leave first if\n * provided. When leave returns a Promise, the DOM removal is deferred until\n * resolution (entry is tracked in `leaving`).\n */\nfunction removeEntry<T>(\n  entry: Entry<T>,\n  opts: { leave?: (nodes: Node[]) => void | Promise<void> },\n  leaving: Entry<T>[],\n): void {\n  const removeNow = (): void => {\n    for (const node of entry.nodes) {\n      if (node.parentNode) node.parentNode.removeChild(node)\n    }\n    entry.scope.disposalCause = 'each-remove'\n    disposeLifetime(entry.scope)\n    const idx = leaving.indexOf(entry)\n    if (idx !== -1) leaving.splice(idx, 1)\n  }\n  if (opts.leave && entry.nodes.length > 0) {\n    const result = opts.leave(entry.nodes)\n    if (result && typeof (result as Promise<void>).then === 'function') {\n      leaving.push(entry)\n      ;(result as Promise<void>).then(removeNow)\n      return\n    }\n  }\n  removeNow()\n}\n\nfunction fireEnter<T>(\n  entry: Entry<T>,\n  opts: { enter?: (nodes: Node[]) => void | Promise<void> },\n): void {\n  if (opts.enter && entry.nodes.length > 0) {\n    void opts.enter(entry.nodes)\n  }\n}\n\nfunction buildEntry<S, T, M>(\n  item: T,\n  index: number,\n  opts: EachOptions<S, T, M>,\n  parentLifetime: Lifetime,\n  ctx: ReturnType<typeof getRenderContext>,\n  state?: unknown,\n): Entry<T> {\n  const key = callKey(opts, item)\n  // Use a lightweight scope — just needs itemUpdaters for per-item bindings.\n  // Full scope features (disposers, bindings, children) are only needed when\n  // the render callback uses structural primitives or selector.bind().\n  const scope = createLifetime(parentLifetime)\n  scope._kind = 'each'\n  const currentState = (state ?? ctx.state) as S\n  const send = ctx.send as (msg: M) => void\n\n  // Create entry before render so itemAccessor closures can capture it\n  const entry: Entry<T> = { key, item, current: item, index, scope, nodes: null!, updaters: [] }\n\n  // Base callable: item(selector) for computed expressions\n  const itemFn = <R>(selector: (t: T) => R): (() => R) => {\n    const accessor = () => selector(entry.current)\n    accessor.__perItem = true as const\n    return accessor\n  }\n\n  // Proxy for item.field shorthand: LAZILY created. Compiled code uses\n  // `acc(fn)` instead (the compiler rewrites item.x → acc(r => r.x)),\n  // so the Proxy is never constructed in the common case. This saves\n  // ~300ns × N Proxy allocations per create cycle.\n  let itemProxy: ItemAccessor<T> | null = null\n  const getItemProxy = (): ItemAccessor<T> => {\n    if (itemProxy) return itemProxy\n    let fieldCache: Map<string, () => unknown> | null = null\n    itemProxy = new Proxy(itemFn as object, {\n      get(target, prop) {\n        if (typeof prop === 'symbol' || prop === 'then' || prop === 'prototype') {\n          return Reflect.get(target, prop)\n        }\n        const key = prop as string\n        if (fieldCache) {\n          const cached = fieldCache.get(key)\n          if (cached) return cached\n        } else {\n          fieldCache = new Map()\n        }\n        // `current` returns the whole item — essential for primitive T\n        // (where the field map is useless) and for whole-record sampling.\n        // Caller must call it like a method: `item.current()`.\n        const accessor =\n          key === 'current'\n            ? () => entry.current\n            : () => (entry.current as Record<string, unknown>)[key]\n        ;(accessor as unknown as { __perItem: true }).__perItem = true\n        fieldCache.set(key, accessor)\n        return accessor\n      },\n    }) as ItemAccessor<T>\n    return itemProxy\n  }\n\n  const indexAccessor = (): number => entry.index\n\n  // Reuse a single context object to avoid allocation per entry. Every\n  // non-rootLifetime/non-state field is copied from the surrounding\n  // context — including `send` and `container`, which were dropped by\n  // earlier versions. Missing `send` silently broke `child({ onMsg })`\n  // bubble-up from inside an each() row (child.ts reads `parentCtx.send`,\n  // got `undefined`, and skipped the bubble). Missing `container` made\n  // `onMount(cb)` fall back to `document.body` instead of the parent\n  // component's container.\n  buildCtx.rootLifetime = scope\n  buildCtx.state = currentState\n  buildCtx.allBindings = ctx.allBindings\n  buildCtx.structuralBlocks = ctx.structuralBlocks\n  buildCtx.dom = ctx.dom\n  buildCtx.instance = ctx.instance\n  buildCtx.send = ctx.send\n  buildCtx.container = ctx.container\n  const prevFlatBindings = getFlatBindings()\n  setFlatBindings(ctx.allBindings)\n  setRenderContext(buildCtx)\n\n  // Reuse a single render bag object across entries — mutate `acc` and\n  // `index` per entry to avoid per-entry object allocation.\n  buildBag.send = send\n  buildBag.acc = itemFn\n  buildBag.index = indexAccessor\n  buildBag._getItemProxy = getItemProxy\n  buildBag.entry = entry\n  // The View bag — lets each.render use `h.text`, `h.scope`, `h.sample`,\n  // etc. without reaching for the top-level imports. Each entry gets a\n  // fresh View so its `send` is bound to this row's dispatch path.\n  buildBag.h = createView<S, M>(send)\n  // Row factory: pass compiler-injected template + update function through to render\n  const rfOpts = opts as unknown as Record<string, unknown>\n  if (rfOpts.__tpl) buildBag.__tpl = rfOpts.__tpl\n  if (rfOpts.__rowUpd) buildBag.__rowUpd = rfOpts.__rowUpd\n  entry.nodes = opts.render(buildBag as Parameters<typeof opts.render>[0])\n\n  // Move itemUpdaters from scope to entry for direct access during updateEntry.\n  // This avoids scope.itemUpdaters lookup overhead on every item update.\n  if (scope.itemUpdaters.length > 0) {\n    entry.updaters = scope.itemUpdaters\n    scope.itemUpdaters = []\n  }\n\n  clearRenderContext()\n  setFlatBindings(prevFlatBindings)\n  setRenderContext(ctx)\n\n  return entry\n}\n\ninterface TransitionReport {\n  entering: Node[]\n  leaving: Node[]\n}\n\nfunction collectNodes(target: Node[], nodes: Node[]): void {\n  for (const n of nodes) target.push(n)\n}\n\nfunction reconcileEntries<S, T>(\n  entries: Entry<T>[],\n  newItems: T[],\n  opts: EachOptions<S, T>,\n  parentLifetime: Lifetime,\n  parent: Node,\n  anchor: Node,\n  endAnchor: Node,\n  ctx: ReturnType<typeof getRenderContext>,\n  state: unknown,\n  leaving: Entry<T>[],\n  report: TransitionReport | null,\n): void {\n  const oldLen = entries.length\n  const newLen = newItems.length\n  const hasLeave = !!opts.leave\n\n  // Fast path 1: clear all — bulk DOM removal.\n  // When opts.leave is set, each item needs its own leave animation, so\n  // fall through to per-item removal instead of Range.deleteContents().\n  if (newLen === 0) {\n    if (report) {\n      for (const entry of entries) collectNodes(report.leaving, entry.nodes)\n    }\n    if (hasLeave) {\n      const toRemove = entries.slice()\n      entries.length = 0\n      for (const entry of toRemove) removeEntry(entry, opts, leaving)\n      return\n    }\n    // Remove all DOM nodes in one operation using Range. Anchored on\n    // start + end sentinels — see endAnchor comment in each() for why.\n    if (entries.length > 0) {\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n    }\n    // Bulk dispose all entry scopes — avoids per-scope function call overhead\n    const scopes: Lifetime[] = []\n    for (let i = 0; i < entries.length; i++) {\n      const s = entries[i]!.scope\n      s.disposalCause = 'each-remove'\n      scopes.push(s)\n    }\n    disposeLifetimesBulk(scopes)\n    removeOrphanedChildren(parentLifetime)\n    entries.length = 0\n    return\n  }\n\n  // Fast path 2: append-only — old keys are a prefix of new keys\n  if (newLen > oldLen && isAppendOnly(entries, newItems, opts)) {\n    for (let i = 0; i < oldLen; i++) {\n      updateEntry(entries[i]!, newItems[i]!, i)\n    }\n    // Find insertion point: after last existing entry's last node, or after anchor\n    const lastEntry = oldLen > 0 ? entries[oldLen - 1]! : null\n    const ref = lastEntry\n      ? lastEntry.nodes[lastEntry.nodes.length - 1]!.nextSibling\n      : anchor.nextSibling\n    const frag = ctx.dom.createDocumentFragment()\n    const newlyAdded: Entry<T>[] = []\n    for (let i = oldLen; i < newLen; i++) {\n      const entry = buildEntry(newItems[i]!, i, opts, parentLifetime, ctx, state)\n      entries.push(entry)\n      newlyAdded.push(entry)\n      for (const node of entry.nodes) frag.appendChild(node)\n    }\n    parent.insertBefore(frag, ref)\n    if (report) {\n      for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n    }\n    for (const entry of newlyAdded) fireEnter(entry, opts)\n    return\n  }\n\n  // Fast path 3: same length — single pass handles both same-keys update\n  // and two-element swap detection. Avoids a second O(n) pass.\n  if (newLen === oldLen) {\n    let mismatch1 = -1\n    let mismatch2 = -1\n    let mismatchCount = 0\n\n    for (let i = 0; i < newLen; i++) {\n      const entry = entries[i]!\n      const newItem = newItems[i]!\n      if (entry.item === newItem) continue\n      const newKey = callKey(opts, newItem)\n      if (entry.key === newKey) {\n        updateEntry(entry, newItem, i)\n        continue\n      }\n      // Key mismatch — track for swap detection\n      mismatchCount++\n      if (mismatchCount === 1) mismatch1 = i\n      else if (mismatchCount === 2) mismatch2 = i\n      else break // 3+ mismatches → fall through to general path\n    }\n\n    // All keys matched (with possible item updates) → done\n    if (mismatchCount === 0) return\n\n    // Exactly 2 key mismatches — check if it's a swap\n    if (mismatchCount === 2) {\n      const e1 = entries[mismatch1]!\n      const e2 = entries[mismatch2]!\n      if (\n        e1.key === callKey(opts, newItems[mismatch2]!) &&\n        e2.key === callKey(opts, newItems[mismatch1]!)\n      ) {\n        // DOM swap\n        const refI = e1.nodes[0]!\n        const refAfterJ = e2.nodes[e2.nodes.length - 1]!.nextSibling\n        for (const node of e2.nodes) parent.insertBefore(node, refI)\n        for (const node of e1.nodes) parent.insertBefore(node, refAfterJ)\n        entries[mismatch1] = e2\n        entries[mismatch2] = e1\n        updateEntry(e2, newItems[mismatch1]!, mismatch1)\n        updateEntry(e1, newItems[mismatch2]!, mismatch2)\n        return\n      }\n    }\n    // Fall through to general path for 3+ mismatches or non-swap\n  }\n\n  // Fast path 5: full replace — no shared keys between old and new.\n  // Skipped when opts.leave is set so departing items can animate individually.\n  if (!hasLeave && oldLen > 0 && callKey(opts, newItems[0]!) !== entries[0]!.key) {\n    const oldKeys = new Set<string | number>()\n    for (const entry of entries) oldKeys.add(entry.key)\n    let anyShared = false\n    for (let i = 0; i < newLen; i++) {\n      if (oldKeys.has(callKey(opts, newItems[i]!))) {\n        anyShared = true\n        break\n      }\n    }\n    if (!anyShared) {\n      if (report) {\n        for (const entry of entries) collectNodes(report.leaving, entry.nodes)\n      }\n      // Bulk DOM removal using Range — anchored on this each's stable\n      // sentinels so a stale lastEntry node from a nested-primitive\n      // mutation can't trip setEndAfter.\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n      // Bulk dispose all old scopes\n      const oldLifetimes: Lifetime[] = []\n      for (let i = 0; i < entries.length; i++) {\n        const s = entries[i]!.scope\n        s.disposalCause = 'each-remove'\n        oldLifetimes.push(s)\n      }\n      disposeLifetimesBulk(oldLifetimes)\n      removeOrphanedChildren(parentLifetime)\n      entries.length = 0\n      // Build all new entries into a fragment\n      const frag = ctx.dom.createDocumentFragment()\n      const newlyAdded: Entry<T>[] = []\n      for (let i = 0; i < newLen; i++) {\n        const entry = buildEntry(newItems[i]!, i, opts, parentLifetime, ctx, state)\n        entries.push(entry)\n        newlyAdded.push(entry)\n        for (const node of entry.nodes) frag.appendChild(node)\n      }\n      parent.insertBefore(frag, anchor.nextSibling)\n      if (report) {\n        for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n      }\n      for (const entry of newlyAdded) fireEnter(entry, opts)\n      return\n    }\n  }\n\n  // General path: keyed reconciliation\n  const oldByKey = new Map<string | number, Entry<T>>()\n  for (const entry of entries) {\n    oldByKey.set(entry.key, entry)\n  }\n\n  const newEntries: Entry<T>[] = []\n  const usedKeys = new Set<string | number>()\n  const newlyAdded: Entry<T>[] = []\n\n  for (let i = 0; i < newLen; i++) {\n    const item = newItems[i]!\n    const key = callKey(opts, item)\n    usedKeys.add(key)\n\n    const existing = oldByKey.get(key)\n    if (existing) {\n      updateEntry(existing, item, i)\n      newEntries.push(existing)\n    } else {\n      const entry = buildEntry(item, i, opts, parentLifetime, ctx, state)\n      newEntries.push(entry)\n      newlyAdded.push(entry)\n    }\n  }\n\n  // Remove entries not in the new list. Use bulk-detach pattern so\n  // disposing K removals costs O(K+P) rather than O(K*P) where P is\n  // parentLifetime.children.length (avoids K * indexOf+splice).\n  let didBulkDetach = false\n  for (const entry of entries) {\n    if (!usedKeys.has(entry.key)) {\n      if (report) collectNodes(report.leaving, entry.nodes)\n      if (hasLeave) {\n        removeEntry(entry, opts, leaving)\n      } else {\n        // Defensive guard: a nested primitive (inner each / show / branch)\n        // may have replaced its own captured nodes between the outer\n        // render snapshot and now. Those replaced nodes are still in\n        // entry.nodes but no longer children of `parent`. Skip them —\n        // the inner-primitive's addDisposer cascade (run by the scope\n        // disposal below) cleans up the orphan replacement nodes that\n        // ARE attached. Without this guard, removeChild throws\n        // NotFoundError on the stale ones.\n        for (const node of entry.nodes) {\n          if (node.parentNode === parent) parent.removeChild(node)\n        }\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope, true)\n        didBulkDetach = true\n      }\n    }\n  }\n  if (didBulkDetach) removeOrphanedChildren(parentLifetime)\n\n  // Reorder DOM\n  const hasSurvivors = newEntries.some((e) => oldByKey.has(e.key))\n\n  if (!hasSurvivors || !survivorsInOrder(entries, newEntries, usedKeys)) {\n    // Full fragment rebuild — one reflow\n    const frag = ctx.dom.createDocumentFragment()\n    for (const entry of newEntries) {\n      for (const node of entry.nodes) frag.appendChild(node)\n    }\n    parent.insertBefore(frag, anchor.nextSibling)\n  } else {\n    // Survivors in order — batch-insert new entries between survivors\n    let frag: DocumentFragment | null = null\n    let insertRef: ChildNode | null = anchor.nextSibling\n    for (const entry of newEntries) {\n      if (oldByKey.has(entry.key)) {\n        // Flush any pending fragment before this survivor\n        if (frag) {\n          parent.insertBefore(frag, insertRef)\n          frag = null\n        }\n        // Skip past survivor's nodes\n        const lastNode = entry.nodes[entry.nodes.length - 1]\n        insertRef = lastNode ? lastNode.nextSibling : insertRef\n      } else {\n        // Batch new entries into a fragment\n        if (!frag) frag = ctx.dom.createDocumentFragment()\n        for (const node of entry.nodes) frag.appendChild(node)\n      }\n    }\n    if (frag) parent.insertBefore(frag, insertRef)\n  }\n\n  entries.length = newEntries.length\n  for (let i = 0; i < newEntries.length; i++) entries[i] = newEntries[i]!\n\n  if (report) {\n    for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n  }\n\n  // Fire enter for newly-added entries (after DOM insertion)\n  if (opts.enter) {\n    for (const entry of newlyAdded) fireEnter(entry, opts)\n  }\n}\n\nfunction updateEntry<T>(entry: Entry<T>, item: T, index: number): void {\n  const changed = !Object.is(entry.item, item)\n  entry.item = item\n  entry.current = item\n  entry.index = index\n  // eachItemStable removed — unused\n  // Directly run per-item updaters when item changed — bypasses Phase 2\n  if (changed) {\n    // Row factory fast path: shared update function, zero closures\n    const rowUpd = (entry as unknown as Record<string, unknown>).__rowUpdate as\n      | ((e: Entry<T>) => void)\n      | undefined\n    if (rowUpd) {\n      rowUpd(entry)\n    } else {\n      // Closure-based fallback\n      const updaters = entry.updaters.length > 0 ? entry.updaters : entry.scope.itemUpdaters\n      for (let i = 0; i < updaters.length; i++) {\n        updaters[i]!()\n      }\n    }\n  }\n}\n\nfunction isAppendOnly<S, T>(entries: Entry<T>[], newItems: T[], opts: EachOptions<S, T>): boolean {\n  for (let i = 0; i < entries.length; i++) {\n    if (entries[i]!.key !== callKey(opts, newItems[i]!)) return false\n  }\n  return true\n}\n\nfunction survivorsInOrder<T>(\n  oldEntries: Entry<T>[],\n  newEntries: Entry<T>[],\n  usedKeys: Set<string | number>,\n): boolean {\n  // Build old-index map for survivors\n  const oldIndexMap = new Map<string | number, number>()\n  for (let i = 0; i < oldEntries.length; i++) {\n    if (usedKeys.has(oldEntries[i]!.key)) {\n      oldIndexMap.set(oldEntries[i]!.key, i)\n    }\n  }\n  // Check that survivors appear in increasing old-index order in newEntries\n  let maxOldIndex = -1\n  for (const entry of newEntries) {\n    const oldIdx = oldIndexMap.get(entry.key)\n    if (oldIdx === undefined) continue // new entry, skip\n    if (oldIdx < maxOldIndex) return false\n    maxOldIndex = oldIdx\n  }\n  return true\n}\n"]}
+{"version":3,"file":"each.js","sourceRoot":"","sources":["../../src/primitives/each.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,aAAa,EACb,YAAY,GAEb,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EACL,cAAc,EACd,eAAe,EACf,oBAAoB,EACpB,WAAW,EACX,sBAAsB,GACvB,MAAM,gBAAgB,CAAA;AACvB,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAA;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AAE/C,6FAA6F;AAC7F,kFAAkF;AAClF,IAAI,oBAAoB,GAA6B,IAAI,CAAA;AACzD,IAAI,qBAAqB,GAAiD,IAAI,CAAA;AAE9E,uEAAuE;AACvE,MAAM,UAAU,eAAe,CAAC,EAAc;IAC5C,IAAI,oBAAoB;QAAE,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACzD,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,gBAAgB,CAAC,EAAkC;IACjE,IAAI,qBAAqB;QAAE,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AAC3D,CAAC;AAED,6EAA6E;AAC7E,4EAA4E;AAC5E,yEAAyE;AACzE,SAAS,SAAS,CAAO,IAA8B,EAAE,KAAQ;IAC/D,aAAa,CAAC,cAAc,CAAC,CAAA;IAC7B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAA;IAChB,CAAC;AACH,CAAC;AACD,SAAS,OAAO,CAAI,IAAwC,EAAE,IAAO;IACnE,aAAa,CAAC,YAAY,CAAC,CAAA;IAC3B,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;YAAS,CAAC;QACT,YAAY,EAAE,CAAA;IAChB,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,6EAA6E;AAC7E,gFAAgF;AAChF,eAAe;AACf,MAAM,QAAQ,GAAkB;IAC9B,YAAY,EAAE,IAA2B;IACzC,KAAK,EAAE,IAAI;IACX,WAAW,EAAE,EAAE;IACf,gBAAgB,EAAE,EAAE;IACpB,GAAG,EAAE,IAAiD;CACvD,CAAA;AAED,4EAA4E;AAC5E,MAAM,QAAQ,GAA4B;IACxC,IAAI,EAAE,IAAI;IACV,IAAI,IAAI;QACN,OAAQ,QAAQ,CAAC,aAA+B,EAAE,CAAA;IACpD,CAAC;IACD,GAAG,EAAE,IAAI;IACT,KAAK,EAAE,IAAI;IACX,aAAa,EAAE,IAAI;CACpB,CAAA;AAaD,MAAM,UAAU,IAAI,CAAoB,IAA0B;IAChE,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAA;IACpC,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,CAAA;IACvC,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IAEnC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;IAC5C,uEAAuE;IACvE,sEAAsE;IACtE,sEAAsE;IACtE,wEAAwE;IACxE,yEAAyE;IACzE,sEAAsE;IACtE,uEAAuE;IACvE,gEAAgE;IAChE,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,CAAA;IACnD,MAAM,OAAO,GAAe,EAAE,CAAA;IAC9B,MAAM,cAAc,GAAsB,EAAE,CAAA;IAC5C,MAAM,eAAe,GAA0C,EAAE,CAAA;IACjE,sEAAsE;IACtE,yDAAyD;IACzD,MAAM,OAAO,GAAe,EAAE,CAAA;IAE9B,MAAM,YAAY,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,KAAU,CAAC,CAAA;IACpD,IAAI,YAAY,GAAG,YAAY,CAAA;IAE/B,sEAAsE;IACtE,iEAAiE;IACjE,qEAAqE;IACrE,iEAAiE;IACjE,qEAAqE;IACrE,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAA;IACzB,MAAM,UAAU,GAAG,IAAI,EAAE,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;IAClF,MAAM,YAAY,GAAG,GAAoB,EAAE;QACzC,IAAI,IAAI,EAAE,YAAY,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACjD,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3E,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IACD,MAAM,QAAQ,GAAG,CAAC,OAAwB,EAAQ,EAAE;QAClD,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,EAAE,YAAY,KAAK,SAAS;YAAE,OAAM;QAChE,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,MAAM,KAAK,GAAqD,EAAE,CAAA;QAClE,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC7D,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;YACrB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;YAC/B,IAAI,IAAI,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;;gBAC9C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;YACrB,WAAW,EAAE,IAAI,CAAC,cAAc,IAAI,CAAC;YACrC,UAAU;YACV,KAAK;YACL,OAAO;YACP,KAAK;YACL,MAAM;SACP,CAAC,CAAA;IACJ,CAAC,CAAA;IAED,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAG,IAA4B,CAAC,MAAM,IAAI,SAAS;QACvD,MAAM,EAAG,IAA8B,CAAC,QAAQ,IAAI,CAAC;QACrD,SAAS,CAAC,KAAc;YACtB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAE5C,mDAAmD;YACnD,IAAI,QAAQ,KAAK,YAAY;gBAAE,OAAM;YACrC,YAAY,GAAG,QAAQ,CAAA;YAEvB,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAY,EAAE,OAAO,EAAE,EAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;YAC3F,gBAAgB,CACd,OAAO,EACP,QAAQ,EACR,IAAI,EACJ,cAAc,EACd,MAAM,EACN,MAAM,EACN,SAAS,EACT,GAAG,EACH,KAAK,EACL,OAAO,EACP,MAAM,CACP,CAAA;YACD,IAAI,IAAI,CAAC,YAAY,IAAI,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,YAAY,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAA;YACnF,CAAC;YACD,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;kFAC0E;QAC1E,cAAc,CAAC,KAAc;YAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;gBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC3B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,cAAc;YACZ,YAAY,GAAG,EAAoB,CAAA;YACnC,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YACnB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAM;YAEhC,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAE9B,oEAAoE;YACpE,kEAAkE;YAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,cAAc,CAAC,CAAC,CAAE,EAAE,CAAA;YAEpE,qEAAqE;YACrE,qEAAqE;YACrE,oDAAoD;YACpD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;YAEtB,uEAAuE;YACvE,0CAA0C;YAC1C,MAAM,MAAM,GAAe,EAAE,CAAA;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;gBAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;gBAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAChB,CAAC;YACD,oBAAoB,CAAC,MAAM,CAAC,CAAA;YAC5B,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAElB,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;;4EAEoE;QACpE,eAAe,CAAC,KAAc;YAC5B,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,OAAO,GAAG,YAAY,EAAE,CAAA;YAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;YAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;YAC9B,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;gBACrB,6EAA6E;gBAC7E,gBAAgB,CACd,OAAO,EACP,QAAQ,EACR,IAAI,EACJ,cAAc,EACd,MAAM,EACN,MAAM,EACN,SAAS,EACT,GAAG,EACH,KAAK,EACL,OAAO,EACP,IAAI,CACL,CAAA;gBACD,QAAQ,CAAC,OAAO,CAAC,CAAA;gBACjB,OAAM;YACR,CAAC;YAED,qFAAqF;YACrF,IAAI,EAAE,GAAG,CAAC,CAAA;YACV,IAAI,SAAS,GAAG,KAAK,CAAA;YACrB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAE,CAAA;gBAC1B,IAAI,EAAE,GAAG,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAE,CAAC,EAAE,CAAC;oBAC9D,8CAA8C;oBAC9C,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;wBAChC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAE,EAAE,EAAE,CAAC,CAAA;oBACvC,CAAC;oBACD,EAAE,EAAE,CAAA;gBACN,CAAC;qBAAM,CAAC;oBACN,yDAAyD;oBACzD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,EAAE;wBAAE,eAAe,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;oBACnF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;wBAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;oBACxD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;oBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;oBAClC,OAAO,CAAC,EAAE,CAAC,GAAG,IAAK,CAAA;oBACnB,SAAS,GAAG,IAAI,CAAA;gBAClB,CAAC;YACH,CAAC;YAED,wBAAwB;YACxB,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC,GAAG,CAAC,CAAA;gBACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,IAAI,OAAO,CAAC,CAAC,CAAC;wBAAE,OAAO,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBAC5C,CAAC;gBACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;gBAClB,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACxC,CAAC;YAED,uCAAuC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,GAAG,CAAC,CAAA;YACvB,CAAC;YAED,QAAQ,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC;QAED;iFACyE;QACzE,gBAAgB,CAAC,KAAc,EAAE,MAAc;YAC7C,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,KAAU,CAAC,CAAA;YAC5C,YAAY,GAAG,QAAQ,CAAA;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;gBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC3B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;KACF,CAAA;IAED,sEAAsE;IACtE,wEAAwE;IACxE,uEAAuE;IACvE,uEAAuE;IACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,oBAAoB,GAAG,cAAc,CAAA;IACrC,qBAAqB,GAAG,eAAe,CAAA;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAE,CAAA;QAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,CAAC,CAAA;QAC5D,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACrB,CAAC;IACD,oBAAoB,GAAG,IAAI,CAAA;IAC3B,qBAAqB,GAAG,IAAI,CAAA;IAE5B,0CAA0C;IAC1C,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED,WAAW,CAAC,cAAc,EAAE,GAAG,EAAE;QAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACjC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACrC,uEAAuE;QACvE,kEAAkE;QAClE,yCAAyC;QACzC,EAAE;QACF,kEAAkE;QAClE,8DAA8D;QAC9D,6DAA6D;QAC7D,kEAAkE;QAClE,+DAA+D;QAC/D,kEAAkE;QAClE,0BAA0B;QAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACpC,CAAC;QACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QAClB,IAAI,MAAM,CAAC,UAAU;YAAE,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;QAC5D,IAAI,SAAS,CAAC,UAAU;YAAE,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAA;QACrE,iDAAiD;QACjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACpC,CAAC;QACD,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;IACpB,CAAC,CAAC,CAAA;IAEF,MAAM,MAAM,GAAW,CAAC,MAAM,CAAC,CAAA;IAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IAC/D,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IACtB,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAClB,KAAe,EACf,IAAyD,EACzD,OAAmB;IAEnB,MAAM,SAAS,GAAG,GAAS,EAAE;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,UAAU;gBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;QACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAClC,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACxC,CAAC,CAAA;IACD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,MAAM,IAAI,OAAQ,MAAwB,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACnE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAClB;YAAC,MAAwB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YAC1C,OAAM;QACR,CAAC;IACH,CAAC;IACD,SAAS,EAAE,CAAA;AACb,CAAC;AAED,SAAS,SAAS,CAChB,KAAe,EACf,IAAyD;IAEzD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC9B,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CACjB,IAAO,EACP,KAAa,EACb,IAA0B,EAC1B,cAAwB,EACxB,GAAwC,EACxC,KAAe;IAEf,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC/B,2EAA2E;IAC3E,2EAA2E;IAC3E,qEAAqE;IACrE,MAAM,KAAK,GAAG,cAAc,CAAC,cAAc,CAAC,CAAA;IAC5C,KAAK,CAAC,KAAK,GAAG,MAAM,CAAA;IACpB,MAAM,YAAY,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAM,CAAA;IAC9C,MAAM,IAAI,GAAG,GAAG,CAAC,IAAwB,CAAA;IAEzC,qEAAqE;IACrE,MAAM,KAAK,GAAa,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAA;IAE9F,yDAAyD;IACzD,MAAM,MAAM,GAAG,CAAI,QAAqB,EAAa,EAAE;QACrD,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;QAC9C,QAAQ,CAAC,SAAS,GAAG,IAAa,CAAA;QAClC,OAAO,QAAQ,CAAA;IACjB,CAAC,CAAA;IAED,qEAAqE;IACrE,oEAAoE;IACpE,mEAAmE;IACnE,iDAAiD;IACjD,IAAI,SAAS,GAA2B,IAAI,CAAA;IAC5C,MAAM,YAAY,GAAG,GAAoB,EAAE;QACzC,IAAI,SAAS;YAAE,OAAO,SAAS,CAAA;QAC/B,IAAI,UAAU,GAAsC,IAAI,CAAA;QACxD,SAAS,GAAG,IAAI,KAAK,CAAC,MAAgB,EAAE;YACtC,GAAG,CAAC,MAAM,EAAE,IAAI;gBACd,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;oBACxE,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;gBAClC,CAAC;gBACD,MAAM,GAAG,GAAG,IAAc,CAAA;gBAC1B,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;oBAClC,IAAI,MAAM;wBAAE,OAAO,MAAM,CAAA;gBAC3B,CAAC;qBAAM,CAAC;oBACN,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;gBACxB,CAAC;gBACD,+DAA+D;gBAC/D,kEAAkE;gBAClE,uDAAuD;gBACvD,MAAM,QAAQ,GACZ,GAAG,KAAK,SAAS;oBACf,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO;oBACrB,CAAC,CAAC,GAAG,EAAE,CAAE,KAAK,CAAC,OAAmC,CAAC,GAAG,CAAC,CAC1D;gBAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;gBAC9D,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;gBAC7B,OAAO,QAAQ,CAAA;YACjB,CAAC;SACF,CAAoB,CAAA;QACrB,OAAO,SAAS,CAAA;IAClB,CAAC,CAAA;IAED,MAAM,aAAa,GAAG,GAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAA;IAE/C,qEAAqE;IACrE,kEAAkE;IAClE,oEAAoE;IACpE,qEAAqE;IACrE,wEAAwE;IACxE,qEAAqE;IACrE,mEAAmE;IACnE,yBAAyB;IACzB,QAAQ,CAAC,YAAY,GAAG,KAAK,CAAA;IAC7B,QAAQ,CAAC,KAAK,GAAG,YAAY,CAAA;IAC7B,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;IACtC,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC,gBAAgB,CAAA;IAChD,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;IACtB,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;IAChC,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA;IACxB,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;IAClC,MAAM,gBAAgB,GAAG,eAAe,EAAE,CAAA;IAC1C,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChC,gBAAgB,CAAC,QAAQ,CAAC,CAAA;IAE1B,qEAAqE;IACrE,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;IACpB,QAAQ,CAAC,GAAG,GAAG,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,GAAG,aAAa,CAAA;IAC9B,QAAQ,CAAC,aAAa,GAAG,YAAY,CAAA;IACrC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;IACtB,uEAAuE;IACvE,qEAAqE;IACrE,iEAAiE;IACjE,QAAQ,CAAC,CAAC,GAAG,UAAU,CAAO,IAAI,CAAC,CAAA;IACnC,mFAAmF;IACnF,MAAM,MAAM,GAAG,IAA0C,CAAA;IACzD,IAAI,MAAM,CAAC,KAAK;QAAE,QAAQ,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAA;IAC/C,IAAI,MAAM,CAAC,QAAQ;QAAE,QAAQ,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAA;IACxD,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAA6C,CAAC,CAAA;IAExE,8EAA8E;IAC9E,uEAAuE;IACvE,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAA;QACnC,KAAK,CAAC,YAAY,GAAG,EAAE,CAAA;IACzB,CAAC;IAED,kBAAkB,EAAE,CAAA;IACpB,eAAe,CAAC,gBAAgB,CAAC,CAAA;IACjC,gBAAgB,CAAC,GAAG,CAAC,CAAA;IAErB,OAAO,KAAK,CAAA;AACd,CAAC;AAOD,SAAS,YAAY,CAAC,MAAc,EAAE,KAAa;IACjD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACvC,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAmB,EACnB,QAAa,EACb,IAAuB,EACvB,cAAwB,EACxB,MAAY,EACZ,MAAY,EACZ,SAAe,EACf,GAAwC,EACxC,KAAc,EACd,OAAmB,EACnB,MAA+B;IAE/B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAA;IAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAA;IAC9B,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;IAE7B,6CAA6C;IAC7C,sEAAsE;IACtE,sEAAsE;IACtE,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,KAAK,IAAI,OAAO;gBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QACxE,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,CAAA;YAChC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAClB,KAAK,MAAM,KAAK,IAAI,QAAQ;gBAAE,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YAC/D,OAAM;QACR,CAAC;QACD,iEAAiE;QACjE,mEAAmE;QACnE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;QACxB,CAAC;QACD,0EAA0E;QAC1E,MAAM,MAAM,GAAe,EAAE,CAAA;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;YAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;YAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChB,CAAC;QACD,oBAAoB,CAAC,MAAM,CAAC,CAAA;QAC5B,sBAAsB,CAAC,cAAc,CAAC,CAAA;QACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;QAClB,OAAM;IACR,CAAC;IAED,+DAA+D;IAC/D,IAAI,MAAM,GAAG,MAAM,IAAI,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAA;QAC3C,CAAC;QACD,+EAA+E;QAC/E,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAA;QAC1D,MAAM,GAAG,GAAG,SAAS;YACnB,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,WAAW;YAC1D,CAAC,CAAC,MAAM,CAAC,WAAW,CAAA;QACtB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;QAC7C,MAAM,UAAU,GAAe,EAAE,CAAA;QACjC,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;YAC3E,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACnB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,KAAK,IAAI,UAAU;gBAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QAC5E,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACtD,OAAM;IACR,CAAC;IAED,uEAAuE;IACvE,6DAA6D;IAC7D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAA;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAA;QAClB,IAAI,aAAa,GAAG,CAAC,CAAA;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;YACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;gBAAE,SAAQ;YACpC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;YACrC,IAAI,KAAK,CAAC,GAAG,KAAK,MAAM,EAAE,CAAC;gBACzB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,CAAA;gBAC9B,SAAQ;YACV,CAAC;YACD,0CAA0C;YAC1C,aAAa,EAAE,CAAA;YACf,IAAI,aAAa,KAAK,CAAC;gBAAE,SAAS,GAAG,CAAC,CAAA;iBACjC,IAAI,aAAa,KAAK,CAAC;gBAAE,SAAS,GAAG,CAAC,CAAA;;gBACtC,MAAK,CAAC,+CAA+C;QAC5D,CAAC;QAED,uDAAuD;QACvD,IAAI,aAAa,KAAK,CAAC;YAAE,OAAM;QAE/B,kDAAkD;QAClD,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAE,CAAA;YAC9B,MAAM,EAAE,GAAG,OAAO,CAAC,SAAS,CAAE,CAAA;YAC9B,IACE,EAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAE,CAAC;gBAC9C,EAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAE,CAAC,EAC9C,CAAC;gBACD,WAAW;gBACX,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAE,CAAA;gBACzB,MAAM,SAAS,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,WAAW,CAAA;gBAC5D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK;oBAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;gBAC5D,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK;oBAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;gBACjE,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,CAAA;gBACvB,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,CAAA;gBACvB,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,SAAS,CAAE,EAAE,SAAS,CAAC,CAAA;gBAChD,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,SAAS,CAAE,EAAE,SAAS,CAAC,CAAA;gBAChD,OAAM;YACR,CAAC;QACH,CAAC;QACD,6DAA6D;IAC/D,CAAC;IAED,kEAAkE;IAClE,8EAA8E;IAC9E,IAAI,CAAC,QAAQ,IAAI,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,EAAE,CAAC;QAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAA;QAC1C,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACnD,IAAI,SAAS,GAAG,KAAK,CAAA;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,EAAE,CAAC;gBAC7C,SAAS,GAAG,IAAI,CAAA;gBAChB,MAAK;YACP,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,OAAO;oBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YACxE,CAAC;YACD,gEAAgE;YAChE,8DAA8D;YAC9D,mCAAmC;YACnC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;YAC3B,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAA;YAC7B,KAAK,CAAC,cAAc,EAAE,CAAA;YACtB,8BAA8B;YAC9B,MAAM,YAAY,GAAe,EAAE,CAAA;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;gBAC3B,CAAC,CAAC,aAAa,GAAG,aAAa,CAAA;gBAC/B,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACtB,CAAC;YACD,oBAAoB,CAAC,YAAY,CAAC,CAAA;YAClC,sBAAsB,CAAC,cAAc,CAAC,CAAA;YACtC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAA;YAClB,wCAAwC;YACxC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;YAC7C,MAAM,UAAU,GAAe,EAAE,CAAA;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;gBAC3E,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACnB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;oBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;YACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAA;YAC7C,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,UAAU;oBAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YAC5E,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,UAAU;gBAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;YACtD,OAAM;QACR,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAA;IACrD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAChC,CAAC;IAED,MAAM,UAAU,GAAe,EAAE,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC3C,MAAM,UAAU,GAAe,EAAE,CAAA;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAEjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,WAAW,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;YAC9B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3B,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;YACnE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACtB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,kEAAkE;IAClE,8DAA8D;IAC9D,IAAI,aAAa,GAAG,KAAK,CAAA;IACzB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,IAAI,MAAM;gBAAE,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;YACrD,IAAI,QAAQ,EAAE,CAAC;gBACb,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YACnC,CAAC;iBAAM,CAAC;gBACN,mEAAmE;gBACnE,6DAA6D;gBAC7D,6DAA6D;gBAC7D,8DAA8D;gBAC9D,8DAA8D;gBAC9D,8DAA8D;gBAC9D,uDAAuD;gBACvD,mCAAmC;gBACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM;wBAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;gBAC1D,CAAC;gBACD,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAClC,aAAa,GAAG,IAAI,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,aAAa;QAAE,sBAAsB,CAAC,cAAc,CAAC,CAAA;IAEzD,cAAc;IACd,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAEhE,IAAI,CAAC,YAAY,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;QACtE,qCAAqC;QACrC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;QAC7C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACxD,CAAC;QACD,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAA;IAC/C,CAAC;SAAM,CAAC;QACN,kEAAkE;QAClE,IAAI,IAAI,GAA4B,IAAI,CAAA;QACxC,IAAI,SAAS,GAAqB,MAAM,CAAC,WAAW,CAAA;QACpD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,kDAAkD;gBAClD,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;oBACpC,IAAI,GAAG,IAAI,CAAA;gBACb,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;gBACpD,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;YACzD,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,IAAI,CAAC,IAAI;oBAAE,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,sBAAsB,EAAE,CAAA;gBAClD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK;oBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;QACD,IAAI,IAAI;YAAE,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAChD,CAAC;IAED,OAAO,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAA;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAA;IAEvE,IAAI,MAAM,EAAE,CAAC;QACX,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5E,CAAC;IAED,2DAA2D;IAC3D,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,UAAU;YAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IACxD,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAI,KAAe,EAAE,IAAO,EAAE,KAAa;IAC7D,MAAM,OAAO,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC5C,KAAK,CAAC,IAAI,GAAG,IAAI,CAAA;IACjB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAA;IACpB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;IACnB,kCAAkC;IAClC,sEAAsE;IACtE,IAAI,OAAO,EAAE,CAAC;QACZ,+DAA+D;QAC/D,MAAM,MAAM,GAAI,KAA4C,CAAC,WAEhD,CAAA;QACb,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,KAAK,CAAC,CAAA;QACf,CAAC;aAAM,CAAC;YACN,yBAAyB;YACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAA;YACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAA;YAChB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAO,OAAmB,EAAE,QAAa,EAAE,IAAuB;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,CAAC,CAAE,CAAC,GAAG,KAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC;YAAE,OAAO,KAAK,CAAA;IACnE,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,gBAAgB,CACvB,UAAsB,EACtB,UAAsB,EACtB,QAA8B;IAE9B,oCAAoC;IACpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAA;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACrC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACxC,CAAC;IACH,CAAC;IACD,0EAA0E;IAC1E,IAAI,WAAW,GAAG,CAAC,CAAC,CAAA;IACpB,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACzC,IAAI,MAAM,KAAK,SAAS;YAAE,SAAQ,CAAC,kBAAkB;QACrD,IAAI,MAAM,GAAG,WAAW;YAAE,OAAO,KAAK,CAAA;QACtC,WAAW,GAAG,MAAM,CAAA;IACtB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["import type { EachOptions, ItemAccessor, Lifetime } from '../types.js'\nimport {\n  getRenderContext,\n  setRenderContext,\n  clearRenderContext,\n  enterAccessor,\n  exitAccessor,\n  type RenderContext,\n} from '../render-context.js'\nimport {\n  createLifetime,\n  disposeLifetime,\n  disposeLifetimesBulk,\n  addDisposer,\n  removeOrphanedChildren,\n} from '../lifetime.js'\nimport { getFlatBindings, setFlatBindings } from '../binding.js'\nimport { FULL_MASK } from '../update-loop.js'\nimport type { StructuralBlock } from '../structural.js'\nimport { createView } from '../view-helpers.js'\n\n// Clear callbacks — registered by selector.bind() during render, called by reconcileClear().\n// Eliminates per-row disposers (1000 Set.delete calls → 1 registry.clear() call).\nlet activeClearCallbacks: Array<() => void> | null = null\nlet activeRemoveCallbacks: Array<(key: string | number) => void> | null = null\n\n/** Register a callback to run when the current each() block clears. */\nexport function registerOnClear(cb: () => void): void {\n  if (activeClearCallbacks) activeClearCallbacks.push(cb)\n}\n\n/** Register a callback to run when a single row is removed by key. */\nexport function registerOnRemove(cb: (key: string | number) => void): void {\n  if (activeRemoveCallbacks) activeRemoveCallbacks.push(cb)\n}\n\n// Wrap accessor invocations so `sample()` calls inside them throw a targeted\n// error. The wrappers also localise the contract: every items/key call goes\n// through these, so a future change (e.g. instrumentation) has one site.\nfunction callItems<S, T>(opts: { items: (s: S) => T[] }, state: S): T[] {\n  enterAccessor('each().items')\n  try {\n    return opts.items(state)\n  } finally {\n    exitAccessor()\n  }\n}\nfunction callKey<T>(opts: { key: (t: T) => string | number }, item: T): string | number {\n  enterAccessor('each().key')\n  try {\n    return opts.key(item)\n  } finally {\n    exitAccessor()\n  }\n}\n\n// Reusable render context for buildEntry — avoids object allocation per entry.\n// Every field is overwritten from the surrounding context per reconcile call\n// (see buildEntry), so the initial shape's null/empty values are never observed\n// in practice.\nconst buildCtx: RenderContext = {\n  rootLifetime: null as unknown as Lifetime,\n  state: null,\n  allBindings: [],\n  structuralBlocks: [],\n  dom: null as unknown as import('../dom-env.js').DomEnv,\n}\n\n// Reusable render bag — mutated per entry instead of allocating new objects\nconst buildBag: Record<string, unknown> = {\n  send: null,\n  get item() {\n    return (buildBag._getItemProxy as () => unknown)()\n  },\n  acc: null,\n  index: null,\n  _getItemProxy: null,\n}\n\ninterface Entry<T> {\n  key: string | number\n  item: T\n  current: T\n  index: number\n  scope: Lifetime\n  nodes: Node[]\n  /** Per-item updaters — stored on entry directly to avoid scope overhead for leaf rows */\n  updaters: Array<() => void>\n}\n\nexport function each<S, T, M = unknown>(opts: EachOptions<S, T, M>): Node[] {\n  const ctx = getRenderContext('each')\n  const parentLifetime = ctx.rootLifetime\n  const blocks = ctx.structuralBlocks\n\n  const anchor = ctx.dom.createComment('each')\n  // End-of-territory sentinel. Bulk Range ops (reconcileClear, Fast path\n  // 1, Fast path 5) used to setEndAfter the last entry's last node, but\n  // when a nested structural primitive replaced its own entries between\n  // the outer render snapshot and the next outer reconcile, that captured\n  // node could be detached — Range#setEndAfter throws InvalidNodeTypeError\n  // on a parent-less node. Anchoring the range with two stable comments\n  // (owned by this each) makes the bulk-remove correct regardless of any\n  // inner-each / show / branch mutation that happened in between.\n  const endAnchor = ctx.dom.createComment('each-end')\n  const entries: Entry<T>[] = []\n  const clearCallbacks: Array<() => void> = []\n  const removeCallbacks: Array<(key: string | number) => void> = []\n  // Entries whose leave animation is still in progress. Their DOM nodes\n  // remain in the parent until the leave Promise resolves.\n  const leaving: Entry<T>[] = []\n\n  const initialItems = callItems(opts, ctx.state as S)\n  let lastItemsRef = initialItems\n\n  // Dev-only diff tracking: if the owning component has an _eachDiffLog\n  // (installed by devtools), we capture key sets before/after each\n  // key-mutating reconcile call and emit an EachDiff entry. The siteId\n  // is derived from this each() block's position in the flat block\n  // array at registration time — stable for the lifetime of the block.\n  const inst = ctx.instance\n  const eachSiteId = inst?._eachDiffLog !== undefined ? `each#${blocks.length}` : ''\n  const snapshotKeys = (): string[] | null => {\n    if (inst?._eachDiffLog === undefined) return null\n    const keys: string[] = []\n    for (let i = 0; i < entries.length; i++) keys.push(String(entries[i]!.key))\n    return keys\n  }\n  const emitDiff = (oldKeys: string[] | null): void => {\n    if (oldKeys === null || inst?._eachDiffLog === undefined) return\n    const newKeys: string[] = []\n    for (let i = 0; i < entries.length; i++) newKeys.push(String(entries[i]!.key))\n    const oldKeySet = new Set(oldKeys)\n    const newKeySet = new Set(newKeys)\n    const added: string[] = []\n    const removed: string[] = []\n    const moved: Array<{ key: string; from: number; to: number }> = []\n    const reused: string[] = []\n    for (const k of newKeys) if (!oldKeySet.has(k)) added.push(k)\n    for (const k of oldKeys) if (!newKeySet.has(k)) removed.push(k)\n    for (let i = 0; i < newKeys.length; i++) {\n      const k = newKeys[i]!\n      if (!oldKeySet.has(k)) continue\n      const from = oldKeys.indexOf(k)\n      if (from !== i) moved.push({ key: k, from, to: i })\n      else reused.push(k)\n    }\n    inst._eachDiffLog.push({\n      updateIndex: inst._updateCounter ?? 0,\n      eachSiteId,\n      added,\n      removed,\n      moved,\n      reused,\n    })\n  }\n\n  const block: StructuralBlock = {\n    mask: (opts as { __mask?: number }).__mask ?? FULL_MASK,\n    maskHi: (opts as { __maskHi?: number }).__maskHi ?? 0,\n    reconcile(state: unknown) {\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const newItems = callItems(opts, state as S)\n\n      // Fast path: same array reference → skip entirely.\n      if (newItems === lastItemsRef) return\n      lastItemsRef = newItems\n\n      const oldKeys = snapshotKeys()\n      const report = opts.onTransition ? { entering: [] as Node[], leaving: [] as Node[] } : null\n      reconcileEntries(\n        entries,\n        newItems,\n        opts,\n        parentLifetime,\n        parent,\n        anchor,\n        endAnchor,\n        ctx,\n        state,\n        leaving,\n        report,\n      )\n      if (opts.onTransition && report) {\n        opts.onTransition({ entering: report.entering, leaving: report.leaving, parent })\n      }\n      emitDiff(oldKeys)\n    },\n\n    /** Same keys, only item data changed — skip mismatch/swap detection.\n     *  Compiler calls this when it knows the array structure is unchanged. */\n    reconcileItems(state: unknown) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      const len = Math.min(entries.length, newItems.length)\n      for (let i = 0; i < len; i++) {\n        const entry = entries[i]!\n        const newItem = newItems[i]!\n        if (entry.item !== newItem) {\n          updateEntry(entry, newItem, i)\n        }\n      }\n    },\n\n    /** Remove all items — skip items accessor, go straight to clear path. */\n    reconcileClear() {\n      lastItemsRef = [] as unknown as T[]\n      const parent = anchor.parentNode\n      if (!parent) return\n      if (entries.length === 0) return\n\n      const oldKeys = snapshotKeys()\n\n      // Call registered clear callbacks (e.g., selector registry.clear())\n      // BEFORE scope disposal — avoids 1000 individual Set.delete calls\n      for (let i = 0; i < clearCallbacks.length; i++) clearCallbacks[i]!()\n\n      // Bulk DOM removal — anchored on this each's own start/end sentinels\n      // so a nested primitive that replaced its own captured nodes between\n      // the outer snapshot and now can't make this throw.\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n\n      // Bulk scope disposal — disposers that were replaced by clearCallbacks\n      // are now no-ops, making this much faster\n      const scopes: Lifetime[] = []\n      for (let i = 0; i < entries.length; i++) {\n        const s = entries[i]!.scope\n        s.disposalCause = 'each-remove'\n        scopes.push(s)\n      }\n      disposeLifetimesBulk(scopes)\n      removeOrphanedChildren(parentLifetime)\n      entries.length = 0\n\n      emitDiff(oldKeys)\n    },\n\n    /** Remove entries not present in the new items. Optimized for filter()\n     *  patterns where items are removed but order is preserved. Walks old\n     *  and new arrays in parallel — O(n) with no Map/Set allocation. */\n    reconcileRemove(state: unknown) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const oldKeys = snapshotKeys()\n      const oldLen = entries.length\n      const newLen = newItems.length\n      if (newLen >= oldLen) {\n        // Not a removal — fallback (shouldn't happen if compiler detected correctly)\n        reconcileEntries(\n          entries,\n          newItems,\n          opts,\n          parentLifetime,\n          parent,\n          anchor,\n          endAnchor,\n          ctx,\n          state,\n          leaving,\n          null,\n        )\n        emitDiff(oldKeys)\n        return\n      }\n\n      // Parallel walk: new items are a subsequence of old items (same order, some removed)\n      let ni = 0\n      let didRemove = false\n      for (let oi = 0; oi < oldLen; oi++) {\n        const entry = entries[oi]!\n        if (ni < newLen && entry.key === callKey(opts, newItems[ni]!)) {\n          // Entry survives — update if item ref changed\n          if (entry.item !== newItems[ni]) {\n            updateEntry(entry, newItems[ni]!, ni)\n          }\n          ni++\n        } else {\n          // Entry removed — notify selectors before scope disposal\n          for (let ci = 0; ci < removeCallbacks.length; ci++) removeCallbacks[ci]!(entry.key)\n          for (const node of entry.nodes) parent.removeChild(node)\n          entry.scope.disposalCause = 'each-remove'\n          disposeLifetime(entry.scope, true)\n          entries[oi] = null!\n          didRemove = true\n        }\n      }\n\n      // Compact entries array\n      if (didRemove) {\n        let w = 0\n        for (let r = 0; r < oldLen; r++) {\n          if (entries[r]) entries[w++] = entries[r]!\n        }\n        entries.length = w\n        removeOrphanedChildren(parentLifetime)\n      }\n\n      // Update indices for remaining entries\n      for (let i = 0; i < entries.length; i++) {\n        entries[i]!.index = i\n      }\n\n      emitDiff(oldKeys)\n    },\n\n    /** Update only entries at stride intervals — O(k) where k = n/stride.\n     *  The compiler passes the stride from the detected for-loop pattern. */\n    reconcileChanged(state: unknown, stride: number) {\n      const newItems = callItems(opts, state as S)\n      lastItemsRef = newItems\n      for (let i = 0; i < entries.length && i < newItems.length; i += stride) {\n        const entry = entries[i]!\n        const newItem = newItems[i]!\n        if (entry.item !== newItem) {\n          updateEntry(entry, newItem, i)\n        }\n      }\n    },\n  }\n\n  // Register the block BEFORE building initial row entries so that this\n  // each() block precedes any nested structural blocks its rows register.\n  // Parents must come first in the flat blocks array — see branch.ts for\n  // the full rationale (Phase 1 iteration safety when disposing nested).\n  blocks.push(block)\n\n  activeClearCallbacks = clearCallbacks\n  activeRemoveCallbacks = removeCallbacks\n  for (let i = 0; i < initialItems.length; i++) {\n    const item = initialItems[i]!\n    const entry = buildEntry(item, i, opts, parentLifetime, ctx)\n    entries.push(entry)\n  }\n  activeClearCallbacks = null\n  activeRemoveCallbacks = null\n\n  // Fire initial enter for mount-time items\n  if (opts.enter) {\n    for (const entry of entries) {\n      if (entry.nodes.length > 0) opts.enter(entry.nodes)\n    }\n  }\n\n  addDisposer(parentLifetime, () => {\n    const idx = blocks.indexOf(block)\n    if (idx !== -1) blocks.splice(idx, 1)\n    // parentLifetime is being disposed — its children array is about to be\n    // cleared by the recursive dispose pass, so skip per-entry parent\n    // removal (avoids O(N²) indexOf+splice).\n    //\n    // Rows created AFTER the parent's initial render (each reconciled\n    // with a new item list) are siblings of the anchor inside the\n    // parent's DOM container, but aren't tracked by the parent's\n    // snapshot (e.g. an outer branch's currentNodes). Walking entries\n    // here and removing their DOM — guarded by parentNode — closes\n    // the leak: cascade-removed subtrees no-op, live-parent cases get\n    // the orphans cleaned up.\n    for (const entry of entries) {\n      for (const node of entry.nodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n      disposeLifetime(entry.scope, true)\n    }\n    entries.length = 0\n    if (anchor.parentNode) anchor.parentNode.removeChild(anchor)\n    if (endAnchor.parentNode) endAnchor.parentNode.removeChild(endAnchor)\n    // Force-remove any mid-leave entries immediately\n    for (const entry of leaving) {\n      for (const node of entry.nodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n      disposeLifetime(entry.scope, true)\n    }\n    leaving.length = 0\n  })\n\n  const result: Node[] = [anchor]\n  for (const entry of entries) {\n    const nodes = entry.nodes\n    for (let i = 0; i < nodes.length; i++) result.push(nodes[i]!)\n  }\n  result.push(endAnchor)\n  return result\n}\n\n/**\n * Remove an entry's DOM + dispose its scope, running opts.leave first if\n * provided. When leave returns a Promise, the DOM removal is deferred until\n * resolution (entry is tracked in `leaving`).\n */\nfunction removeEntry<T>(\n  entry: Entry<T>,\n  opts: { leave?: (nodes: Node[]) => void | Promise<void> },\n  leaving: Entry<T>[],\n): void {\n  const removeNow = (): void => {\n    for (const node of entry.nodes) {\n      if (node.parentNode) node.parentNode.removeChild(node)\n    }\n    entry.scope.disposalCause = 'each-remove'\n    disposeLifetime(entry.scope)\n    const idx = leaving.indexOf(entry)\n    if (idx !== -1) leaving.splice(idx, 1)\n  }\n  if (opts.leave && entry.nodes.length > 0) {\n    const result = opts.leave(entry.nodes)\n    if (result && typeof (result as Promise<void>).then === 'function') {\n      leaving.push(entry)\n      ;(result as Promise<void>).then(removeNow)\n      return\n    }\n  }\n  removeNow()\n}\n\nfunction fireEnter<T>(\n  entry: Entry<T>,\n  opts: { enter?: (nodes: Node[]) => void | Promise<void> },\n): void {\n  if (opts.enter && entry.nodes.length > 0) {\n    void opts.enter(entry.nodes)\n  }\n}\n\nfunction buildEntry<S, T, M>(\n  item: T,\n  index: number,\n  opts: EachOptions<S, T, M>,\n  parentLifetime: Lifetime,\n  ctx: ReturnType<typeof getRenderContext>,\n  state?: unknown,\n): Entry<T> {\n  const key = callKey(opts, item)\n  // Use a lightweight scope — just needs itemUpdaters for per-item bindings.\n  // Full scope features (disposers, bindings, children) are only needed when\n  // the render callback uses structural primitives or selector.bind().\n  const scope = createLifetime(parentLifetime)\n  scope._kind = 'each'\n  const currentState = (state ?? ctx.state) as S\n  const send = ctx.send as (msg: M) => void\n\n  // Create entry before render so itemAccessor closures can capture it\n  const entry: Entry<T> = { key, item, current: item, index, scope, nodes: null!, updaters: [] }\n\n  // Base callable: item(selector) for computed expressions\n  const itemFn = <R>(selector: (t: T) => R): (() => R) => {\n    const accessor = () => selector(entry.current)\n    accessor.__perItem = true as const\n    return accessor\n  }\n\n  // Proxy for item.field shorthand: LAZILY created. Compiled code uses\n  // `acc(fn)` instead (the compiler rewrites item.x → acc(r => r.x)),\n  // so the Proxy is never constructed in the common case. This saves\n  // ~300ns × N Proxy allocations per create cycle.\n  let itemProxy: ItemAccessor<T> | null = null\n  const getItemProxy = (): ItemAccessor<T> => {\n    if (itemProxy) return itemProxy\n    let fieldCache: Map<string, () => unknown> | null = null\n    itemProxy = new Proxy(itemFn as object, {\n      get(target, prop) {\n        if (typeof prop === 'symbol' || prop === 'then' || prop === 'prototype') {\n          return Reflect.get(target, prop)\n        }\n        const key = prop as string\n        if (fieldCache) {\n          const cached = fieldCache.get(key)\n          if (cached) return cached\n        } else {\n          fieldCache = new Map()\n        }\n        // `current` returns the whole item — essential for primitive T\n        // (where the field map is useless) and for whole-record sampling.\n        // Caller must call it like a method: `item.current()`.\n        const accessor =\n          key === 'current'\n            ? () => entry.current\n            : () => (entry.current as Record<string, unknown>)[key]\n        ;(accessor as unknown as { __perItem: true }).__perItem = true\n        fieldCache.set(key, accessor)\n        return accessor\n      },\n    }) as ItemAccessor<T>\n    return itemProxy\n  }\n\n  const indexAccessor = (): number => entry.index\n\n  // Reuse a single context object to avoid allocation per entry. Every\n  // non-rootLifetime/non-state field is copied from the surrounding\n  // context — including `send` and `container`, which were dropped by\n  // earlier versions. Missing `send` silently broke `child({ onMsg })`\n  // bubble-up from inside an each() row (child.ts reads `parentCtx.send`,\n  // got `undefined`, and skipped the bubble). Missing `container` made\n  // `onMount(cb)` fall back to `document.body` instead of the parent\n  // component's container.\n  buildCtx.rootLifetime = scope\n  buildCtx.state = currentState\n  buildCtx.allBindings = ctx.allBindings\n  buildCtx.structuralBlocks = ctx.structuralBlocks\n  buildCtx.dom = ctx.dom\n  buildCtx.instance = ctx.instance\n  buildCtx.send = ctx.send\n  buildCtx.container = ctx.container\n  const prevFlatBindings = getFlatBindings()\n  setFlatBindings(ctx.allBindings)\n  setRenderContext(buildCtx)\n\n  // Reuse a single render bag object across entries — mutate `acc` and\n  // `index` per entry to avoid per-entry object allocation.\n  buildBag.send = send\n  buildBag.acc = itemFn\n  buildBag.index = indexAccessor\n  buildBag._getItemProxy = getItemProxy\n  buildBag.entry = entry\n  // The View bag — lets each.render use `h.text`, `h.scope`, `h.sample`,\n  // etc. without reaching for the top-level imports. Each entry gets a\n  // fresh View so its `send` is bound to this row's dispatch path.\n  buildBag.h = createView<S, M>(send)\n  // Row factory: pass compiler-injected template + update function through to render\n  const rfOpts = opts as unknown as Record<string, unknown>\n  if (rfOpts.__tpl) buildBag.__tpl = rfOpts.__tpl\n  if (rfOpts.__rowUpd) buildBag.__rowUpd = rfOpts.__rowUpd\n  entry.nodes = opts.render(buildBag as Parameters<typeof opts.render>[0])\n\n  // Move itemUpdaters from scope to entry for direct access during updateEntry.\n  // This avoids scope.itemUpdaters lookup overhead on every item update.\n  if (scope.itemUpdaters.length > 0) {\n    entry.updaters = scope.itemUpdaters\n    scope.itemUpdaters = []\n  }\n\n  clearRenderContext()\n  setFlatBindings(prevFlatBindings)\n  setRenderContext(ctx)\n\n  return entry\n}\n\ninterface TransitionReport {\n  entering: Node[]\n  leaving: Node[]\n}\n\nfunction collectNodes(target: Node[], nodes: Node[]): void {\n  for (const n of nodes) target.push(n)\n}\n\nfunction reconcileEntries<S, T>(\n  entries: Entry<T>[],\n  newItems: T[],\n  opts: EachOptions<S, T>,\n  parentLifetime: Lifetime,\n  parent: Node,\n  anchor: Node,\n  endAnchor: Node,\n  ctx: ReturnType<typeof getRenderContext>,\n  state: unknown,\n  leaving: Entry<T>[],\n  report: TransitionReport | null,\n): void {\n  const oldLen = entries.length\n  const newLen = newItems.length\n  const hasLeave = !!opts.leave\n\n  // Fast path 1: clear all — bulk DOM removal.\n  // When opts.leave is set, each item needs its own leave animation, so\n  // fall through to per-item removal instead of Range.deleteContents().\n  if (newLen === 0) {\n    if (report) {\n      for (const entry of entries) collectNodes(report.leaving, entry.nodes)\n    }\n    if (hasLeave) {\n      const toRemove = entries.slice()\n      entries.length = 0\n      for (const entry of toRemove) removeEntry(entry, opts, leaving)\n      return\n    }\n    // Remove all DOM nodes in one operation using Range. Anchored on\n    // start + end sentinels — see endAnchor comment in each() for why.\n    if (entries.length > 0) {\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n    }\n    // Bulk dispose all entry scopes — avoids per-scope function call overhead\n    const scopes: Lifetime[] = []\n    for (let i = 0; i < entries.length; i++) {\n      const s = entries[i]!.scope\n      s.disposalCause = 'each-remove'\n      scopes.push(s)\n    }\n    disposeLifetimesBulk(scopes)\n    removeOrphanedChildren(parentLifetime)\n    entries.length = 0\n    return\n  }\n\n  // Fast path 2: append-only — old keys are a prefix of new keys\n  if (newLen > oldLen && isAppendOnly(entries, newItems, opts)) {\n    for (let i = 0; i < oldLen; i++) {\n      updateEntry(entries[i]!, newItems[i]!, i)\n    }\n    // Find insertion point: after last existing entry's last node, or after anchor\n    const lastEntry = oldLen > 0 ? entries[oldLen - 1]! : null\n    const ref = lastEntry\n      ? lastEntry.nodes[lastEntry.nodes.length - 1]!.nextSibling\n      : anchor.nextSibling\n    const frag = ctx.dom.createDocumentFragment()\n    const newlyAdded: Entry<T>[] = []\n    for (let i = oldLen; i < newLen; i++) {\n      const entry = buildEntry(newItems[i]!, i, opts, parentLifetime, ctx, state)\n      entries.push(entry)\n      newlyAdded.push(entry)\n      for (const node of entry.nodes) frag.appendChild(node)\n    }\n    parent.insertBefore(frag, ref)\n    if (report) {\n      for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n    }\n    for (const entry of newlyAdded) fireEnter(entry, opts)\n    return\n  }\n\n  // Fast path 3: same length — single pass handles both same-keys update\n  // and two-element swap detection. Avoids a second O(n) pass.\n  if (newLen === oldLen) {\n    let mismatch1 = -1\n    let mismatch2 = -1\n    let mismatchCount = 0\n\n    for (let i = 0; i < newLen; i++) {\n      const entry = entries[i]!\n      const newItem = newItems[i]!\n      if (entry.item === newItem) continue\n      const newKey = callKey(opts, newItem)\n      if (entry.key === newKey) {\n        updateEntry(entry, newItem, i)\n        continue\n      }\n      // Key mismatch — track for swap detection\n      mismatchCount++\n      if (mismatchCount === 1) mismatch1 = i\n      else if (mismatchCount === 2) mismatch2 = i\n      else break // 3+ mismatches → fall through to general path\n    }\n\n    // All keys matched (with possible item updates) → done\n    if (mismatchCount === 0) return\n\n    // Exactly 2 key mismatches — check if it's a swap\n    if (mismatchCount === 2) {\n      const e1 = entries[mismatch1]!\n      const e2 = entries[mismatch2]!\n      if (\n        e1.key === callKey(opts, newItems[mismatch2]!) &&\n        e2.key === callKey(opts, newItems[mismatch1]!)\n      ) {\n        // DOM swap\n        const refI = e1.nodes[0]!\n        const refAfterJ = e2.nodes[e2.nodes.length - 1]!.nextSibling\n        for (const node of e2.nodes) parent.insertBefore(node, refI)\n        for (const node of e1.nodes) parent.insertBefore(node, refAfterJ)\n        entries[mismatch1] = e2\n        entries[mismatch2] = e1\n        updateEntry(e2, newItems[mismatch1]!, mismatch1)\n        updateEntry(e1, newItems[mismatch2]!, mismatch2)\n        return\n      }\n    }\n    // Fall through to general path for 3+ mismatches or non-swap\n  }\n\n  // Fast path 5: full replace — no shared keys between old and new.\n  // Skipped when opts.leave is set so departing items can animate individually.\n  if (!hasLeave && oldLen > 0 && callKey(opts, newItems[0]!) !== entries[0]!.key) {\n    const oldKeys = new Set<string | number>()\n    for (const entry of entries) oldKeys.add(entry.key)\n    let anyShared = false\n    for (let i = 0; i < newLen; i++) {\n      if (oldKeys.has(callKey(opts, newItems[i]!))) {\n        anyShared = true\n        break\n      }\n    }\n    if (!anyShared) {\n      if (report) {\n        for (const entry of entries) collectNodes(report.leaving, entry.nodes)\n      }\n      // Bulk DOM removal using Range — anchored on this each's stable\n      // sentinels so a stale lastEntry node from a nested-primitive\n      // mutation can't trip setEndAfter.\n      const range = ctx.dom.createRange()\n      range.setStartAfter(anchor)\n      range.setEndBefore(endAnchor)\n      range.deleteContents()\n      // Bulk dispose all old scopes\n      const oldLifetimes: Lifetime[] = []\n      for (let i = 0; i < entries.length; i++) {\n        const s = entries[i]!.scope\n        s.disposalCause = 'each-remove'\n        oldLifetimes.push(s)\n      }\n      disposeLifetimesBulk(oldLifetimes)\n      removeOrphanedChildren(parentLifetime)\n      entries.length = 0\n      // Build all new entries into a fragment\n      const frag = ctx.dom.createDocumentFragment()\n      const newlyAdded: Entry<T>[] = []\n      for (let i = 0; i < newLen; i++) {\n        const entry = buildEntry(newItems[i]!, i, opts, parentLifetime, ctx, state)\n        entries.push(entry)\n        newlyAdded.push(entry)\n        for (const node of entry.nodes) frag.appendChild(node)\n      }\n      parent.insertBefore(frag, anchor.nextSibling)\n      if (report) {\n        for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n      }\n      for (const entry of newlyAdded) fireEnter(entry, opts)\n      return\n    }\n  }\n\n  // General path: keyed reconciliation\n  const oldByKey = new Map<string | number, Entry<T>>()\n  for (const entry of entries) {\n    oldByKey.set(entry.key, entry)\n  }\n\n  const newEntries: Entry<T>[] = []\n  const usedKeys = new Set<string | number>()\n  const newlyAdded: Entry<T>[] = []\n\n  for (let i = 0; i < newLen; i++) {\n    const item = newItems[i]!\n    const key = callKey(opts, item)\n    usedKeys.add(key)\n\n    const existing = oldByKey.get(key)\n    if (existing) {\n      updateEntry(existing, item, i)\n      newEntries.push(existing)\n    } else {\n      const entry = buildEntry(item, i, opts, parentLifetime, ctx, state)\n      newEntries.push(entry)\n      newlyAdded.push(entry)\n    }\n  }\n\n  // Remove entries not in the new list. Use bulk-detach pattern so\n  // disposing K removals costs O(K+P) rather than O(K*P) where P is\n  // parentLifetime.children.length (avoids K * indexOf+splice).\n  let didBulkDetach = false\n  for (const entry of entries) {\n    if (!usedKeys.has(entry.key)) {\n      if (report) collectNodes(report.leaving, entry.nodes)\n      if (hasLeave) {\n        removeEntry(entry, opts, leaving)\n      } else {\n        // Defensive guard: a nested primitive (inner each / show / branch)\n        // may have replaced its own captured nodes between the outer\n        // render snapshot and now. Those replaced nodes are still in\n        // entry.nodes but no longer children of `parent`. Skip them —\n        // the inner-primitive's addDisposer cascade (run by the scope\n        // disposal below) cleans up the orphan replacement nodes that\n        // ARE attached. Without this guard, removeChild throws\n        // NotFoundError on the stale ones.\n        for (const node of entry.nodes) {\n          if (node.parentNode === parent) parent.removeChild(node)\n        }\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope, true)\n        didBulkDetach = true\n      }\n    }\n  }\n  if (didBulkDetach) removeOrphanedChildren(parentLifetime)\n\n  // Reorder DOM\n  const hasSurvivors = newEntries.some((e) => oldByKey.has(e.key))\n\n  if (!hasSurvivors || !survivorsInOrder(entries, newEntries, usedKeys)) {\n    // Full fragment rebuild — one reflow\n    const frag = ctx.dom.createDocumentFragment()\n    for (const entry of newEntries) {\n      for (const node of entry.nodes) frag.appendChild(node)\n    }\n    parent.insertBefore(frag, anchor.nextSibling)\n  } else {\n    // Survivors in order — batch-insert new entries between survivors\n    let frag: DocumentFragment | null = null\n    let insertRef: ChildNode | null = anchor.nextSibling\n    for (const entry of newEntries) {\n      if (oldByKey.has(entry.key)) {\n        // Flush any pending fragment before this survivor\n        if (frag) {\n          parent.insertBefore(frag, insertRef)\n          frag = null\n        }\n        // Skip past survivor's nodes\n        const lastNode = entry.nodes[entry.nodes.length - 1]\n        insertRef = lastNode ? lastNode.nextSibling : insertRef\n      } else {\n        // Batch new entries into a fragment\n        if (!frag) frag = ctx.dom.createDocumentFragment()\n        for (const node of entry.nodes) frag.appendChild(node)\n      }\n    }\n    if (frag) parent.insertBefore(frag, insertRef)\n  }\n\n  entries.length = newEntries.length\n  for (let i = 0; i < newEntries.length; i++) entries[i] = newEntries[i]!\n\n  if (report) {\n    for (const entry of newlyAdded) collectNodes(report.entering, entry.nodes)\n  }\n\n  // Fire enter for newly-added entries (after DOM insertion)\n  if (opts.enter) {\n    for (const entry of newlyAdded) fireEnter(entry, opts)\n  }\n}\n\nfunction updateEntry<T>(entry: Entry<T>, item: T, index: number): void {\n  const changed = !Object.is(entry.item, item)\n  entry.item = item\n  entry.current = item\n  entry.index = index\n  // eachItemStable removed — unused\n  // Directly run per-item updaters when item changed — bypasses Phase 2\n  if (changed) {\n    // Row factory fast path: shared update function, zero closures\n    const rowUpd = (entry as unknown as Record<string, unknown>).__rowUpdate as\n      | ((e: Entry<T>) => void)\n      | undefined\n    if (rowUpd) {\n      rowUpd(entry)\n    } else {\n      // Closure-based fallback\n      const updaters = entry.updaters.length > 0 ? entry.updaters : entry.scope.itemUpdaters\n      for (let i = 0; i < updaters.length; i++) {\n        updaters[i]!()\n      }\n    }\n  }\n}\n\nfunction isAppendOnly<S, T>(entries: Entry<T>[], newItems: T[], opts: EachOptions<S, T>): boolean {\n  for (let i = 0; i < entries.length; i++) {\n    if (entries[i]!.key !== callKey(opts, newItems[i]!)) return false\n  }\n  return true\n}\n\nfunction survivorsInOrder<T>(\n  oldEntries: Entry<T>[],\n  newEntries: Entry<T>[],\n  usedKeys: Set<string | number>,\n): boolean {\n  // Build old-index map for survivors\n  const oldIndexMap = new Map<string | number, number>()\n  for (let i = 0; i < oldEntries.length; i++) {\n    if (usedKeys.has(oldEntries[i]!.key)) {\n      oldIndexMap.set(oldEntries[i]!.key, i)\n    }\n  }\n  // Check that survivors appear in increasing old-index order in newEntries\n  let maxOldIndex = -1\n  for (const entry of newEntries) {\n    const oldIdx = oldIndexMap.get(entry.key)\n    if (oldIdx === undefined) continue // new entry, skip\n    if (oldIdx < maxOldIndex) return false\n    maxOldIndex = oldIdx\n  }\n  return true\n}\n"]}

package/dist/primitives/memo.d.ts

@@ -1,3 +1,3 @@
-export declare function setCurrentDirtyMask(mask: number): void;
-export declare function memo<S, T>(accessor: (s: S) => T, mask?: number): (s: S) => T;
+export declare function setCurrentDirtyMask(mask: number, maskHi?: number): void;
+export declare function memo<S, T>(accessor: (s: S) => T, mask?: number, maskHi?: number): (s: S) => T;
 //# sourceMappingURL=memo.d.ts.map

package/dist/primitives/memo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memo.d.ts","sourceRoot":"","sources":["../../src/primitives/memo.ts"],"names":[],"mappings":"AAGA,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAEtD;AAID,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CA0B5E"}
+{"version":3,"file":"memo.d.ts","sourceRoot":"","sources":["../../src/primitives/memo.ts"],"names":[],"mappings":"AAQA,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAE,MAAU,GAAG,IAAI,CAG1E;AAID,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,GAAE,MAAU,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CA8BhG"}

package/dist/primitives/memo.js

@@ -1,15 +1,23 @@
-// Current dirty mask — set by the update loop during Phase 2
+// Current dirty mask — set by the update loop during Phase 2.
+// Split into two words for the multi-word `__prefixes` path: bits 0..30
+// in `currentDirtyMask`, bits 31..61 in `currentDirtyMaskHi`. For ≤31-
+// prefix components the high word stays 0 — gates collapse to the
+// single-word check under V8's inline caches.
 let currentDirtyMask = 0;
-export function setCurrentDirtyMask(mask) {
+let currentDirtyMaskHi = 0;
+export function setCurrentDirtyMask(mask, maskHi = 0) {
     currentDirtyMask = mask;
+    currentDirtyMaskHi = maskHi;
 }
 const UNSET = Symbol('unset');
-export function memo(accessor, mask) {
+export function memo(accessor, mask, maskHi = 0) {
     let lastInput = UNSET;
     let lastOutput;
     return (s) => {
-        // Level 1: bitmask fast path — skip if dirty mask doesn't overlap
-        if (lastInput !== UNSET && mask !== undefined && (mask & currentDirtyMask) === 0) {
+        // Level 1: bitmask fast path — skip if neither low nor high masks overlap
+        if (lastInput !== UNSET &&
+            mask !== undefined &&
+            !((mask & currentDirtyMask) | (maskHi & currentDirtyMaskHi))) {
             return lastOutput;
         }
         // Same state reference — skip

package/dist/primitives/memo.js.map

@@ -1 +1 @@
-{"version":3,"file":"memo.js","sourceRoot":"","sources":["../../src/primitives/memo.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAC7D,IAAI,gBAAgB,GAAG,CAAC,CAAA;AAExB,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,gBAAgB,GAAG,IAAI,CAAA;AACzB,CAAC;AAED,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;AAE7B,MAAM,UAAU,IAAI,CAAO,QAAqB,EAAE,IAAa;IAC7D,IAAI,SAAS,GAAqB,KAAK,CAAA;IACvC,IAAI,UAAa,CAAA;IAEjB,OAAO,CAAC,CAAI,EAAE,EAAE;QACd,kEAAkE;QAClE,IAAI,SAAS,KAAK,KAAK,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACjF,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,8BAA8B;QAC9B,IAAI,SAAS,KAAK,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;YACnD,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,2EAA2E;QAC3E,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,SAAS,KAAK,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC;YACzD,SAAS,GAAG,CAAC,CAAA;YACb,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,SAAS,GAAG,CAAC,CAAA;QACb,UAAU,GAAG,MAAM,CAAA;QACnB,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;AACH,CAAC","sourcesContent":["// Current dirty mask — set by the update loop during Phase 2\nlet currentDirtyMask = 0\n\nexport function setCurrentDirtyMask(mask: number): void {\n  currentDirtyMask = mask\n}\n\nconst UNSET = Symbol('unset')\n\nexport function memo<S, T>(accessor: (s: S) => T, mask?: number): (s: S) => T {\n  let lastInput: S | typeof UNSET = UNSET\n  let lastOutput: T\n\n  return (s: S) => {\n    // Level 1: bitmask fast path — skip if dirty mask doesn't overlap\n    if (lastInput !== UNSET && mask !== undefined && (mask & currentDirtyMask) === 0) {\n      return lastOutput\n    }\n\n    // Same state reference — skip\n    if (lastInput !== UNSET && Object.is(s, lastInput)) {\n      return lastOutput\n    }\n\n    // Level 2: output stability — re-evaluate but return cached if same result\n    const result = accessor(s)\n    if (lastInput !== UNSET && Object.is(result, lastOutput)) {\n      lastInput = s\n      return lastOutput\n    }\n\n    lastInput = s\n    lastOutput = result\n    return result\n  }\n}\n"]}
+{"version":3,"file":"memo.js","sourceRoot":"","sources":["../../src/primitives/memo.ts"],"names":[],"mappings":"AAAA,8DAA8D;AAC9D,wEAAwE;AACxE,uEAAuE;AACvE,kEAAkE;AAClE,8CAA8C;AAC9C,IAAI,gBAAgB,GAAG,CAAC,CAAA;AACxB,IAAI,kBAAkB,GAAG,CAAC,CAAA;AAE1B,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,SAAiB,CAAC;IAClE,gBAAgB,GAAG,IAAI,CAAA;IACvB,kBAAkB,GAAG,MAAM,CAAA;AAC7B,CAAC;AAED,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAA;AAE7B,MAAM,UAAU,IAAI,CAAO,QAAqB,EAAE,IAAa,EAAE,SAAiB,CAAC;IACjF,IAAI,SAAS,GAAqB,KAAK,CAAA;IACvC,IAAI,UAAa,CAAA;IAEjB,OAAO,CAAC,CAAI,EAAE,EAAE;QACd,0EAA0E;QAC1E,IACE,SAAS,KAAK,KAAK;YACnB,IAAI,KAAK,SAAS;YAClB,CAAC,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAC5D,CAAC;YACD,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,8BAA8B;QAC9B,IAAI,SAAS,KAAK,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;YACnD,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,2EAA2E;QAC3E,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,SAAS,KAAK,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC;YACzD,SAAS,GAAG,CAAC,CAAA;YACb,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,SAAS,GAAG,CAAC,CAAA;QACb,UAAU,GAAG,MAAM,CAAA;QACnB,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;AACH,CAAC","sourcesContent":["// Current dirty mask — set by the update loop during Phase 2.\n// Split into two words for the multi-word `__prefixes` path: bits 0..30\n// in `currentDirtyMask`, bits 31..61 in `currentDirtyMaskHi`. For ≤31-\n// prefix components the high word stays 0 — gates collapse to the\n// single-word check under V8's inline caches.\nlet currentDirtyMask = 0\nlet currentDirtyMaskHi = 0\n\nexport function setCurrentDirtyMask(mask: number, maskHi: number = 0): void {\n  currentDirtyMask = mask\n  currentDirtyMaskHi = maskHi\n}\n\nconst UNSET = Symbol('unset')\n\nexport function memo<S, T>(accessor: (s: S) => T, mask?: number, maskHi: number = 0): (s: S) => T {\n  let lastInput: S | typeof UNSET = UNSET\n  let lastOutput: T\n\n  return (s: S) => {\n    // Level 1: bitmask fast path — skip if neither low nor high masks overlap\n    if (\n      lastInput !== UNSET &&\n      mask !== undefined &&\n      !((mask & currentDirtyMask) | (maskHi & currentDirtyMaskHi))\n    ) {\n      return lastOutput\n    }\n\n    // Same state reference — skip\n    if (lastInput !== UNSET && Object.is(s, lastInput)) {\n      return lastOutput\n    }\n\n    // Level 2: output stability — re-evaluate but return cached if same result\n    const result = accessor(s)\n    if (lastInput !== UNSET && Object.is(result, lastOutput)) {\n      lastInput = s\n      return lastOutput\n    }\n\n    lastInput = s\n    lastOutput = result\n    return result\n  }\n}\n"]}

package/dist/primitives/sample.d.ts

@@ -13,8 +13,8 @@
  * rows" recipe in the cookbook.
  *
  * **Don't use inside an accessor** (`each().key`, `each().items`,
- * `branch().on`, `show().when`, `scope().on`, `child().props`,
- * `foreign().props`, or a binding accessor like `text(s => …)`).
+ * `branch().on`, `show().when`, `scope().on`, `foreign().props`, or a
+ * binding accessor like `text(s => …)`).
  * Accessors must be pure functions of their parameter — the compiler's
  * mask analysis only sees reads of the parameter, so a `sample()` read
  * is invisible. The result is a hidden dependency that breaks

package/dist/primitives/sample.js

@@ -14,8 +14,8 @@ import { getRenderContext, currentAccessor } from '../render-context.js';
  * rows" recipe in the cookbook.
  *
  * **Don't use inside an accessor** (`each().key`, `each().items`,
- * `branch().on`, `show().when`, `scope().on`, `child().props`,
- * `foreign().props`, or a binding accessor like `text(s => …)`).
+ * `branch().on`, `show().when`, `scope().on`, `foreign().props`, or a
+ * binding accessor like `text(s => …)`).
  * Accessors must be pure functions of their parameter — the compiler's
  * mask analysis only sees reads of the parameter, so a `sample()` read
  * is invisible. The result is a hidden dependency that breaks

package/dist/primitives/sample.js.map

@@ -1 +1 @@
-{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../src/primitives/sample.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0DG;AACH,MAAM,UAAU,MAAM,CAAO,QAAqB;IAChD,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAA;IAClC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CACb,kDAAkD,QAAQ,IAAI;YAC5D,uEAAuE;YACvE,yEAAyE;YACzE,yCAAyC;YACzC,uEAAuE;YACvE,mEAAmE;YACnE,gBAAgB;YAChB,YAAY;YACZ,6BAA6B;YAC7B,0DAA0D;YAC1D,QAAQ;YACR,gBAAgB;YAChB,YAAY;YACZ,+DAA+D;YAC/D,8CAA8C;YAC9C,MAAM,CACT,CAAA;IACH,CAAC;IACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAA;IACtC,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;AACjC,CAAC","sourcesContent":["import { getRenderContext, currentAccessor } from '../render-context.js'\n\n/**\n * Read current state inside a render context and return the result of\n * `selector(state)`. No binding is created, no mask is assigned — this\n * is a one-shot imperative read at view-construction time.\n *\n * **Don't use for variable-length lists.** Wrapping a list-render in\n * `sample` looks idiomatic but silently breaks reactivity: the\n * `.map(...)` runs once at construction, captures the row objects in\n * closure, and never re-runs when state updates in place. The cells\n * inside the captured rows show stale data; only a full structural\n * rebuild (e.g. a parent `branch` swapping arms) will refresh them.\n * Use `each` + `ItemAccessor` instead — see the \"List of editable\n * rows\" recipe in the cookbook.\n *\n * **Don't use inside an accessor** (`each().key`, `each().items`,\n * `branch().on`, `show().when`, `scope().on`, `child().props`,\n * `foreign().props`, or a binding accessor like `text(s => …)`).\n * Accessors must be pure functions of their parameter — the compiler's\n * mask analysis only sees reads of the parameter, so a `sample()` read\n * is invisible. The result is a hidden dependency that breaks\n * reconciliation: structural blocks gate out updates that should fire,\n * binding accessors miss state changes, and `key` callbacks create\n * keys that don't track outer state correctly.\n *\n * To depend on outer state inside an accessor, **lift it into the\n * accessor's parameter**. For `each().key` reading a sibling field\n * `rev`:\n *\n * ```ts\n * // ❌ wrong — sample() in key is invisible to mask gating\n * each({\n *   items: (s) => s.items,\n *   key: (it) => `${it.id}|${sample(s => s.rev)}`,\n *   render: …,\n * })\n *\n * // ✅ right — bake outer state into items, key is pure of T\n * each({\n *   items: (s) => s.items.map((it) => ({ it, rev: s.rev })),\n *   key: (r) => `${r.it.id}|${r.rev}`,\n *   render: …,\n * })\n * ```\n *\n * **Use for** passing a state snapshot to an imperative renderer\n * (foreign libraries, third-party canvas/svg builders), reading a\n * value to compute a static piece of structure that doesn't need to\n * react, or any case where a reactive binding would be semantically\n * wrong (e.g. capturing a value at *this exact moment* for a\n * one-shot side effect).\n *\n * Also exposed as `h.sample` on the View bag for destructure-from-`h`\n * ergonomics. The top-level import form works everywhere a render\n * context is live — including `each.render`, whose bag intentionally\n * does not carry View methods.\n *\n * Throws if called outside a render context, or from inside an\n * accessor.\n */\nexport function sample<S, R>(selector: (s: S) => R): R {\n  const accessor = currentAccessor()\n  if (accessor !== null) {\n    throw new Error(\n      `[LLui] sample() must not be called from inside ${accessor}. ` +\n        `Accessors must be pure functions of their parameter — sample() reads ` +\n        `state outside the parameter, which is invisible to the compiler's mask ` +\n        `analysis and breaks reconciliation.\\n\\n` +\n        `To depend on outer state, lift it into the accessor's parameter. For ` +\n        `each().key reading a sibling field, bake it into the items map:\\n` +\n        `  // ❌ wrong\\n` +\n        `  each({\\n` +\n        `    items: (s) => s.rows,\\n` +\n        `    key: (it) => \\`\\${it.id}|\\${sample(s => s.rev)}\\`,\\n` +\n        `  })\\n` +\n        `  // ✅ right\\n` +\n        `  each({\\n` +\n        `    items: (s) => s.rows.map((it) => ({ it, rev: s.rev })),\\n` +\n        `    key: (r) => \\`\\${r.it.id}|\\${r.rev}\\`,\\n` +\n        `  })`,\n    )\n  }\n  const ctx = getRenderContext('sample')\n  return selector(ctx.state as S)\n}\n"]}
+{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../src/primitives/sample.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0DG;AACH,MAAM,UAAU,MAAM,CAAO,QAAqB;IAChD,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAA;IAClC,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CACb,kDAAkD,QAAQ,IAAI;YAC5D,uEAAuE;YACvE,yEAAyE;YACzE,yCAAyC;YACzC,uEAAuE;YACvE,mEAAmE;YACnE,gBAAgB;YAChB,YAAY;YACZ,6BAA6B;YAC7B,0DAA0D;YAC1D,QAAQ;YACR,gBAAgB;YAChB,YAAY;YACZ,+DAA+D;YAC/D,8CAA8C;YAC9C,MAAM,CACT,CAAA;IACH,CAAC;IACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAA;IACtC,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;AACjC,CAAC","sourcesContent":["import { getRenderContext, currentAccessor } from '../render-context.js'\n\n/**\n * Read current state inside a render context and return the result of\n * `selector(state)`. No binding is created, no mask is assigned — this\n * is a one-shot imperative read at view-construction time.\n *\n * **Don't use for variable-length lists.** Wrapping a list-render in\n * `sample` looks idiomatic but silently breaks reactivity: the\n * `.map(...)` runs once at construction, captures the row objects in\n * closure, and never re-runs when state updates in place. The cells\n * inside the captured rows show stale data; only a full structural\n * rebuild (e.g. a parent `branch` swapping arms) will refresh them.\n * Use `each` + `ItemAccessor` instead — see the \"List of editable\n * rows\" recipe in the cookbook.\n *\n * **Don't use inside an accessor** (`each().key`, `each().items`,\n * `branch().on`, `show().when`, `scope().on`, `foreign().props`, or a\n * binding accessor like `text(s => …)`).\n * Accessors must be pure functions of their parameter — the compiler's\n * mask analysis only sees reads of the parameter, so a `sample()` read\n * is invisible. The result is a hidden dependency that breaks\n * reconciliation: structural blocks gate out updates that should fire,\n * binding accessors miss state changes, and `key` callbacks create\n * keys that don't track outer state correctly.\n *\n * To depend on outer state inside an accessor, **lift it into the\n * accessor's parameter**. For `each().key` reading a sibling field\n * `rev`:\n *\n * ```ts\n * // ❌ wrong — sample() in key is invisible to mask gating\n * each({\n *   items: (s) => s.items,\n *   key: (it) => `${it.id}|${sample(s => s.rev)}`,\n *   render: …,\n * })\n *\n * // ✅ right — bake outer state into items, key is pure of T\n * each({\n *   items: (s) => s.items.map((it) => ({ it, rev: s.rev })),\n *   key: (r) => `${r.it.id}|${r.rev}`,\n *   render: …,\n * })\n * ```\n *\n * **Use for** passing a state snapshot to an imperative renderer\n * (foreign libraries, third-party canvas/svg builders), reading a\n * value to compute a static piece of structure that doesn't need to\n * react, or any case where a reactive binding would be semantically\n * wrong (e.g. capturing a value at *this exact moment* for a\n * one-shot side effect).\n *\n * Also exposed as `h.sample` on the View bag for destructure-from-`h`\n * ergonomics. The top-level import form works everywhere a render\n * context is live — including `each.render`, whose bag intentionally\n * does not carry View methods.\n *\n * Throws if called outside a render context, or from inside an\n * accessor.\n */\nexport function sample<S, R>(selector: (s: S) => R): R {\n  const accessor = currentAccessor()\n  if (accessor !== null) {\n    throw new Error(\n      `[LLui] sample() must not be called from inside ${accessor}. ` +\n        `Accessors must be pure functions of their parameter — sample() reads ` +\n        `state outside the parameter, which is invisible to the compiler's mask ` +\n        `analysis and breaks reconciliation.\\n\\n` +\n        `To depend on outer state, lift it into the accessor's parameter. For ` +\n        `each().key reading a sibling field, bake it into the items map:\\n` +\n        `  // ❌ wrong\\n` +\n        `  each({\\n` +\n        `    items: (s) => s.rows,\\n` +\n        `    key: (it) => \\`\\${it.id}|\\${sample(s => s.rev)}\\`,\\n` +\n        `  })\\n` +\n        `  // ✅ right\\n` +\n        `  each({\\n` +\n        `    items: (s) => s.rows.map((it) => ({ it, rev: s.rev })),\\n` +\n        `    key: (r) => \\`\\${r.it.id}|\\${r.rev}\\`,\\n` +\n        `  })`,\n    )\n  }\n  const ctx = getRenderContext('sample')\n  return selector(ctx.state as S)\n}\n"]}

package/dist/primitives/unsafe-html.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unsafe-html.d.ts","sourceRoot":"","sources":["../../src/primitives/unsafe-html.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,MAAM,EACtD,IAAI,CAAC,EAAE,MAAM,GACZ,IAAI,EAAE,CA8CR"}
+{"version":3,"file":"unsafe-html.d.ts","sourceRoot":"","sources":["../../src/primitives/unsafe-html.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,MAAM,EACtD,IAAI,CAAC,EAAE,MAAM,GACZ,IAAI,EAAE,CA+CR"}

package/dist/primitives/unsafe-html.js

@@ -38,6 +38,7 @@ export function unsafeHtml(accessor, mask) {
     let currentNodes = parseHtmlToNodes(ctx, currentHtml);
     const block = {
         mask: blockMask,
+        maskHi: 0,
         reconcile(state) {
             const newHtml = accessor(state);
             // Identity short-circuit — don't rebuild the subtree when the

package/dist/primitives/unsafe-html.js.map

@@ -1 +1 @@
-{"version":3,"file":"unsafe-html.js","sourceRoot":"","sources":["../../src/primitives/unsafe-html.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAA;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,UAAU,CACxB,QAAsD,EACtD,IAAa;IAEb,MAAM,GAAG,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAA;IAC1C,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,gBAAgB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;IACxC,CAAC;IAED,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IACnC,MAAM,SAAS,GAAG,IAAI,IAAI,SAAS,CAAA;IAEnC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,YAAY,CAAC,CAAA;IAClD,IAAI,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAC1C,IAAI,YAAY,GAAW,gBAAgB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAA;IAE7D,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAE,SAAS;QACf,SAAS,CAAC,KAAc;YACtB,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAU,CAAC,CAAA;YACpC,8DAA8D;YAC9D,gEAAgE;YAChE,sDAAsD;YACtD,IAAI,OAAO,KAAK,WAAW;gBAAE,OAAM;YAEnC,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,QAAQ,GAAG,YAAY,CAAA;YAC7B,YAAY,GAAG,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;YAC7C,WAAW,GAAG,OAAO,CAAA;YAErB,gEAAgE;YAChE,kEAAkE;YAClE,4DAA4D;YAC5D,kEAAkE;YAClE,qCAAqC;YACrC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAA;YAC9B,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YAChC,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;KACF,CAAA;IACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,OAAO,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAA;AAClC,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAiD,EAAE,IAAY;IACvF,oEAAoE;IACpE,oEAAoE;IACpE,iEAAiE;IACjE,sEAAsE;IACtE,0DAA0D;IAC1D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAA;AAC/D,CAAC","sourcesContent":["import type { StructuralBlock } from '../structural.js'\nimport { getRenderContext } from '../render-context.js'\nimport { FULL_MASK } from '../update-loop.js'\n\n/**\n * Insert raw HTML into the DOM tree.\n *\n * **Security.** The caller is responsible for sanitizing `html`. Never\n * interpolate unsanitized user input — this is the XSS escape hatch and\n * the name carries the warning deliberately.\n *\n * **Opaque to the framework.** The parsed subtree is treated as a black\n * box by LLui — no bindings, events, `each`, `show`, or `child` inside\n * it will be discovered or driven by the framework. Use element helpers\n * for anything that needs to react to state or dispatch messages.\n *\n * **Static form.** `unsafeHtml('<b>hi</b>')` parses once at view time\n * and returns the parsed nodes. Zero reactive overhead.\n *\n * **Reactive form.** `unsafeHtml((s) => s.markdownHtml)` registers a\n * structural block that re-parses when the returned string differs\n * (strict `===`) from the previous value. Unchanged strings short-\n * circuit — existing DOM identity (focus, selection, listeners\n * attached outside LLui) is preserved.\n *\n * **Mask hint.** The second parameter mirrors `text()`: the compiler\n * passes a precise mask derived from which state fields the accessor\n * reads. Phase 2 / Phase 1 skip the reconcile when no interesting bit\n * is set. Defaults to FULL_MASK for hand-written components.\n */\nexport function unsafeHtml<S>(\n  accessor: ((s: S) => string) | (() => string) | string,\n  mask?: number,\n): Node[] {\n  const ctx = getRenderContext('unsafeHtml')\n  if (typeof accessor === 'string') {\n    return parseHtmlToNodes(ctx, accessor)\n  }\n\n  const blocks = ctx.structuralBlocks\n  const blockMask = mask ?? FULL_MASK\n\n  const anchor = ctx.dom.createComment('unsafeHtml')\n  let currentHtml = accessor(ctx.state as S)\n  let currentNodes: Node[] = parseHtmlToNodes(ctx, currentHtml)\n\n  const block: StructuralBlock = {\n    mask: blockMask,\n    reconcile(state: unknown) {\n      const newHtml = accessor(state as S)\n      // Identity short-circuit — don't rebuild the subtree when the\n      // author handed us the same string. Preserves focus, selection,\n      // and any listeners outside LLui's view of the world.\n      if (newHtml === currentHtml) return\n\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const oldNodes = currentNodes\n      currentNodes = parseHtmlToNodes(ctx, newHtml)\n      currentHtml = newHtml\n\n      // The anchor sits immediately before the current node range, so\n      // `anchor.nextSibling` is the first old node (or whatever follows\n      // when the old list is empty). Insert new nodes there, then\n      // remove the old ones — matches `branch()`'s enter/leave order so\n      // transitions can inspect both sets.\n      const ref = anchor.nextSibling\n      for (const node of currentNodes) {\n        parent.insertBefore(node, ref)\n      }\n      for (const node of oldNodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n    },\n  }\n  blocks.push(block)\n\n  return [anchor, ...currentNodes]\n}\n\nfunction parseHtmlToNodes(ctx: import('../render-context.js').RenderContext, html: string): Node[] {\n  // Delegates to the env — jsdom/linkedom adapters may implement this\n  // via DOMParser instead of the browser `<template>` trick, but both\n  // return an inert DocumentFragment that doesn't execute scripts.\n  // Snapshot — moving nodes to a parent drains fragment.childNodes, but\n  // callers hold this array and we iterate it on reconcile.\n  return Array.from(ctx.dom.parseHtmlFragment(html).childNodes)\n}\n"]}
+{"version":3,"file":"unsafe-html.js","sourceRoot":"","sources":["../../src/primitives/unsafe-html.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAA;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,UAAU,CACxB,QAAsD,EACtD,IAAa;IAEb,MAAM,GAAG,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAA;IAC1C,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACjC,OAAO,gBAAgB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;IACxC,CAAC;IAED,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IACnC,MAAM,SAAS,GAAG,IAAI,IAAI,SAAS,CAAA;IAEnC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,YAAY,CAAC,CAAA;IAClD,IAAI,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAC1C,IAAI,YAAY,GAAW,gBAAgB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAA;IAE7D,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAE,SAAS;QACf,MAAM,EAAE,CAAC;QACT,SAAS,CAAC,KAAc;YACtB,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAU,CAAC,CAAA;YACpC,8DAA8D;YAC9D,gEAAgE;YAChE,sDAAsD;YACtD,IAAI,OAAO,KAAK,WAAW;gBAAE,OAAM;YAEnC,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;YAChC,IAAI,CAAC,MAAM;gBAAE,OAAM;YAEnB,MAAM,QAAQ,GAAG,YAAY,CAAA;YAC7B,YAAY,GAAG,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;YAC7C,WAAW,GAAG,OAAO,CAAA;YAErB,gEAAgE;YAChE,kEAAkE;YAClE,4DAA4D;YAC5D,kEAAkE;YAClE,qCAAqC;YACrC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAA;YAC9B,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YAChC,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,IAAI,CAAC,UAAU;oBAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;KACF,CAAA;IACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,OAAO,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC,CAAA;AAClC,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAiD,EAAE,IAAY;IACvF,oEAAoE;IACpE,oEAAoE;IACpE,iEAAiE;IACjE,sEAAsE;IACtE,0DAA0D;IAC1D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAA;AAC/D,CAAC","sourcesContent":["import type { StructuralBlock } from '../structural.js'\nimport { getRenderContext } from '../render-context.js'\nimport { FULL_MASK } from '../update-loop.js'\n\n/**\n * Insert raw HTML into the DOM tree.\n *\n * **Security.** The caller is responsible for sanitizing `html`. Never\n * interpolate unsanitized user input — this is the XSS escape hatch and\n * the name carries the warning deliberately.\n *\n * **Opaque to the framework.** The parsed subtree is treated as a black\n * box by LLui — no bindings, events, `each`, `show`, or `child` inside\n * it will be discovered or driven by the framework. Use element helpers\n * for anything that needs to react to state or dispatch messages.\n *\n * **Static form.** `unsafeHtml('<b>hi</b>')` parses once at view time\n * and returns the parsed nodes. Zero reactive overhead.\n *\n * **Reactive form.** `unsafeHtml((s) => s.markdownHtml)` registers a\n * structural block that re-parses when the returned string differs\n * (strict `===`) from the previous value. Unchanged strings short-\n * circuit — existing DOM identity (focus, selection, listeners\n * attached outside LLui) is preserved.\n *\n * **Mask hint.** The second parameter mirrors `text()`: the compiler\n * passes a precise mask derived from which state fields the accessor\n * reads. Phase 2 / Phase 1 skip the reconcile when no interesting bit\n * is set. Defaults to FULL_MASK for hand-written components.\n */\nexport function unsafeHtml<S>(\n  accessor: ((s: S) => string) | (() => string) | string,\n  mask?: number,\n): Node[] {\n  const ctx = getRenderContext('unsafeHtml')\n  if (typeof accessor === 'string') {\n    return parseHtmlToNodes(ctx, accessor)\n  }\n\n  const blocks = ctx.structuralBlocks\n  const blockMask = mask ?? FULL_MASK\n\n  const anchor = ctx.dom.createComment('unsafeHtml')\n  let currentHtml = accessor(ctx.state as S)\n  let currentNodes: Node[] = parseHtmlToNodes(ctx, currentHtml)\n\n  const block: StructuralBlock = {\n    mask: blockMask,\n    maskHi: 0,\n    reconcile(state: unknown) {\n      const newHtml = accessor(state as S)\n      // Identity short-circuit — don't rebuild the subtree when the\n      // author handed us the same string. Preserves focus, selection,\n      // and any listeners outside LLui's view of the world.\n      if (newHtml === currentHtml) return\n\n      const parent = anchor.parentNode\n      if (!parent) return\n\n      const oldNodes = currentNodes\n      currentNodes = parseHtmlToNodes(ctx, newHtml)\n      currentHtml = newHtml\n\n      // The anchor sits immediately before the current node range, so\n      // `anchor.nextSibling` is the first old node (or whatever follows\n      // when the old list is empty). Insert new nodes there, then\n      // remove the old ones — matches `branch()`'s enter/leave order so\n      // transitions can inspect both sets.\n      const ref = anchor.nextSibling\n      for (const node of currentNodes) {\n        parent.insertBefore(node, ref)\n      }\n      for (const node of oldNodes) {\n        if (node.parentNode) node.parentNode.removeChild(node)\n      }\n    },\n  }\n  blocks.push(block)\n\n  return [anchor, ...currentNodes]\n}\n\nfunction parseHtmlToNodes(ctx: import('../render-context.js').RenderContext, html: string): Node[] {\n  // Delegates to the env — jsdom/linkedom adapters may implement this\n  // via DOMParser instead of the browser `<template>` trick, but both\n  // return an inert DocumentFragment that doesn't execute scripts.\n  // Snapshot — moving nodes to a parent drains fragment.childNodes, but\n  // callers hold this array and we iterate it on reconcile.\n  return Array.from(ctx.dom.parseHtmlFragment(html).childNodes)\n}\n"]}

package/dist/primitives/virtual-each.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"virtual-each.d.ts","sourceRoot":"","sources":["../../src/primitives/virtual-each.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAY,IAAI,EAAE,MAAM,aAAa,CAAA;AAc/D,MAAM,WAAW,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO;IACnD,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;IACpB,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAA;IACjC,qFAAqF;IACrF,UAAU,EAAE,MAAM,CAAA;IAClB,6CAA6C;IAC7C,eAAe,EAAE,MAAM,CAAA;IACvB,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,+CAA+C;IAC/C,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,EAAE,CAAC,IAAI,EAAE;QACb,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAA;QACrB,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,CAAA;QAC1C,KAAK,EAAE,MAAM,MAAM,CAAA;KACpB,KAAK,IAAI,EAAE,CAAA;CACb;AAkBD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CA6NxF"}
+{"version":3,"file":"virtual-each.d.ts","sourceRoot":"","sources":["../../src/primitives/virtual-each.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAY,IAAI,EAAE,MAAM,aAAa,CAAA;AAc/D,MAAM,WAAW,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO;IACnD,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAA;IACpB,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAA;IACjC,qFAAqF;IACrF,UAAU,EAAE,MAAM,CAAA;IAClB,6CAA6C;IAC7C,eAAe,EAAE,MAAM,CAAA;IACvB,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,+CAA+C;IAC/C,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,EAAE,CAAC,IAAI,EAAE;QACb,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAA;QACrB,GAAG,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,CAAA;QAC1C,KAAK,EAAE,MAAM,MAAM,CAAA;KACpB,KAAK,IAAI,EAAE,CAAA;CACb;AAkBD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,IAAI,EAAE,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAgOxF"}

package/dist/primitives/virtual-each.js

@@ -125,10 +125,12 @@ export function virtualEach(opts) {
         };
         const indexAccessor = () => entry.index;
         // Every non-rootLifetime/non-state field is copied from the
-        // surrounding context — including `send` and `container`. See the
-        // matching note in `each.ts`: missing `send` broke
-        // `child({ onMsg })` bubble-up from inside virtual-each rows;
-        // missing `container` would point `onMount` at `document.body`.
+        // surrounding context — including `send` and `container`. The
+        // historical motivation: missing `send` broke row-internal message
+        // dispatch (originally surfaced via the removed `child({ onMsg })`
+        // primitive; equivalent today is a row-internal event handler
+        // calling the parent's `send`); missing `container` would point
+        // `onMount` at `document.body`.
         buildCtx.rootLifetime = scope;
         buildCtx.state = state;
         buildCtx.allBindings = ctx.allBindings;
@@ -214,6 +216,7 @@ export function virtualEach(opts) {
     // full rationale (Phase 1 iteration safety).
     const block = {
         mask: FULL_MASK,
+        maskHi: 0,
         reconcile(state) {
             const newItems = callItems(state);
             if (newItems === lastItems)

package/dist/primitives/virtual-each.js.map

@@ -1 +1 @@
-{"version":3,"file":"virtual-each.js","sourceRoot":"","sources":["../../src/primitives/virtual-each.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,aAAa,EACb,YAAY,GAEb,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAC7E,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAA;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AA8B7C,MAAM,QAAQ,GAAkB;IAC9B,YAAY,EAAE,IAA2B;IACzC,KAAK,EAAE,IAAI;IACX,WAAW,EAAE,EAAE;IACf,gBAAgB,EAAE,EAAE;IACpB,GAAG,EAAE,IAAiD;CACvD,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,WAAW,CAAoB,IAAiC;IAC9E,MAAM,GAAG,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAA;IAC3C,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,CAAA;IACvC,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IACnC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAwB,CAAA;IAEzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;IAEnC,mBAAmB;IACnB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;IAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAA;IAC9B,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;IAClC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,IAAI,CAAA;IACjD,MAAM,CAAC,OAAO,CAAC,gBAAgB,GAAG,EAAE,CAAA;IACpC,IAAI,IAAI,CAAC,KAAK;QAAE,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;IAE7C,4CAA4C;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;IAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;IAClC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAA;IAC3B,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,EAAE,CAAA;IACjC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAE1B,qBAAqB;IACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAA;IAC3D,IAAI,SAAS,GAAQ,EAAE,CAAA;IACvB,IAAI,SAAS,GAAG,CAAC,CAAA;IAEjB,MAAM,YAAY,GAAG,CAAC,MAAc,EAAoB,EAAE;QACxD,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAA;QAC7E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAClB,MAAM,EACN,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,QAAQ,CAC3E,CAAA;QACD,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACrB,CAAC,CAAA;IAED,uEAAuE;IACvE,mDAAmD;IACnD,MAAM,SAAS,GAAG,CAAC,KAAQ,EAAO,EAAE;QAClC,aAAa,CAAC,qBAAqB,CAAC,CAAA;QACpC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC1B,CAAC;gBAAS,CAAC;YACT,YAAY,EAAE,CAAA;QAChB,CAAC;IACH,CAAC,CAAA;IACD,MAAM,OAAO,GAAG,CAAC,IAAO,EAAmB,EAAE;QAC3C,aAAa,CAAC,mBAAmB,CAAC,CAAA;QAClC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;gBAAS,CAAC;YACT,YAAY,EAAE,CAAA;QAChB,CAAC;IACH,CAAC,CAAA;IAED,MAAM,UAAU,GAAG,CAAC,IAAO,EAAE,KAAa,EAAE,KAAQ,EAAmB,EAAE;QACvE,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;QACzB,MAAM,KAAK,GAAG,cAAc,CAAC,cAAc,CAAC,CAAA;QAE5C,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;QAC9D,OAAO,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;QACnC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAClD,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAA;QACxB,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAA;QACzB,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAC7C,OAAO,CAAC,OAAO,CAAC,WAAW,GAAG,EAAE,CAAA;QAChC,OAAO,CAAC,OAAO,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;QAExC,MAAM,KAAK,GAAoB,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;QAE5E,+CAA+C;QAC/C,MAAM,MAAM,GAAG,CAAI,QAAqB,EAAa,EAAE;YACrD,MAAM,QAAQ,GAAG,GAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAChD;YAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;YAC9D,OAAO,QAAQ,CAAA;QACjB,CAAC,CAAA;QAED,IAAI,SAAS,GAA2B,IAAI,CAAA;QAC5C,MAAM,YAAY,GAAG,GAAoB,EAAE;YACzC,IAAI,SAAS;gBAAE,OAAO,SAAS,CAAA;YAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAA;YACnD,SAAS,GAAG,IAAI,KAAK,CAAC,MAAgB,EAAE;gBACtC,GAAG,CAAC,MAAM,EAAE,IAAI;oBACd,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;wBACxE,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;oBAClC,CAAC;oBACD,MAAM,CAAC,GAAG,IAAc,CAAA;oBACxB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBAChC,IAAI,MAAM;wBAAE,OAAO,MAAM,CAAA;oBACzB,MAAM,QAAQ,GAAG,GAAY,EAAE,CAAE,KAAK,CAAC,OAAmC,CAAC,CAAC,CAAC,CAC5E;oBAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;oBAC9D,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;oBAC3B,OAAO,QAAQ,CAAA;gBACjB,CAAC;aACF,CAAoB,CAAA;YACrB,OAAO,SAAS,CAAA;QAClB,CAAC,CAAA;QAED,MAAM,aAAa,GAAG,GAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAA;QAE/C,4DAA4D;QAC5D,kEAAkE;QAClE,mDAAmD;QACnD,8DAA8D;QAC9D,gEAAgE;QAChE,QAAQ,CAAC,YAAY,GAAG,KAAK,CAAA;QAC7B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;QACtB,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;QACtC,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC,gBAAgB,CAAA;QAChD,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;QACtB,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;QAChC,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA;QACxB,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;QAClC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAA;QAClC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAChC,gBAAgB,CAAC,QAAQ,CAAC,CAAA;QAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,IAAI;YACJ,IAAI,EAAE,YAAY,EAAE;YACpB,GAAG,EAAE,MAAM;YACX,KAAK,EAAE,aAAa;SACrB,CAAC,CAAA;QAEF,kBAAkB,EAAE,CAAA;QACpB,eAAe,CAAC,QAAQ,CAAC,CAAA;QACzB,gBAAgB,CAAC,GAAG,CAAC,CAAA;QAErB,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACnD,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IAED,MAAM,SAAS,GAAG,CAAC,KAAQ,EAAQ,EAAE;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;QAC9B,SAAS,GAAG,KAAK,CAAA;QAEjB,6BAA6B;QAC7B,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAE3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACrC,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;gBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU;oBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnF,CAAC;YACD,OAAO,CAAC,KAAK,EAAE,CAAA;YACf,OAAM;QACR,CAAC;QAED,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAE/C,2DAA2D;QAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+C,CAAA;QAC1E,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;YACtB,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;QACpD,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;gBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU;oBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;gBACjF,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACrB,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACjC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAA;gBACvB,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;oBAC7B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;oBACtB,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;gBAC7D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC5C,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBACvB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnC,CAAC;QACH,CAAC;IACH,CAAC,CAAA;IAED,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,GAAS,EAAE;QAC1B,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;QAC5B,SAAS,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAC3B,CAAC,CAAA;IACD,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IAE9D,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAE,SAAS;QACf,SAAS,CAAC,KAAc;YACtB,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAU,CAAC,CAAA;YACtC,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAM;YAClC,SAAS,CAAC,KAAU,CAAC,CAAA;QACvB,CAAC;KACF,CAAA;IACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,iBAAiB;IACjB,SAAS,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAEzB,6BAA6B;IAC7B,WAAW,CAAC,cAAc,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAC9C,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC;QACD,OAAO,CAAC,KAAK,EAAE,CAAA;IACjB,CAAC,CAAC,CAAA;IAEF,OAAO,CAAC,MAAM,CAAC,CAAA;AACjB,CAAC","sourcesContent":["import type { ItemAccessor, Lifetime, Send } from '../types.js'\nimport {\n  getRenderContext,\n  setRenderContext,\n  clearRenderContext,\n  enterAccessor,\n  exitAccessor,\n  type RenderContext,\n} from '../render-context.js'\nimport { createLifetime, disposeLifetime, addDisposer } from '../lifetime.js'\nimport { getFlatBindings, setFlatBindings } from '../binding.js'\nimport { FULL_MASK } from '../update-loop.js'\nimport type { StructuralBlock } from '../structural.js'\n\nexport interface VirtualEachOptions<S, T, M = unknown> {\n  items: (s: S) => T[]\n  key: (item: T) => string | number\n  /** Fixed pixel height per item. Required — dynamic heights are not supported yet. */\n  itemHeight: number\n  /** Scrollable container height in pixels. */\n  containerHeight: number\n  /** Extra rows to render above/below the viewport for smooth scrolling. Default: 3. */\n  overscan?: number\n  /** Optional class for the scroll container. */\n  class?: string\n  render: (opts: {\n    send: Send<M>\n    item: ItemAccessor<T>\n    acc: <R>(selector: (t: T) => R) => () => R\n    index: () => number\n  }) => Node[]\n}\n\ninterface VirtualEntry<T> {\n  key: string | number\n  current: T\n  index: number\n  scope: Lifetime\n  wrapper: HTMLElement\n}\n\nconst buildCtx: RenderContext = {\n  rootLifetime: null as unknown as Lifetime,\n  state: null,\n  allBindings: [],\n  structuralBlocks: [],\n  dom: null as unknown as import('../dom-env.js').DomEnv,\n}\n\n/**\n * Virtualized list — renders only the rows visible in the scroll viewport.\n * Use for lists with 1k+ items where a regular `each()` would be too slow.\n *\n * Current limitations:\n * - Fixed row height (`itemHeight`) — dynamic heights not supported\n * - No transitions / animations\n * - No cross-container reuse (items outside view are fully disposed)\n *\n * ```ts\n * view: ({ text }) => [\n *   ...virtualEach({\n *     items: (s) => s.rows,\n *     key: (r) => r.id,\n *     itemHeight: 40,\n *     containerHeight: 600,\n *     render: ({ item }) => [\n *       div({ class: 'row' }, [text(item.label)]),\n *     ],\n *   }),\n * ]\n * ```\n */\nexport function virtualEach<S, T, M = unknown>(opts: VirtualEachOptions<S, T, M>): Node[] {\n  const ctx = getRenderContext('virtualEach')\n  const parentLifetime = ctx.rootLifetime\n  const blocks = ctx.structuralBlocks\n  const send = ctx.send as (msg: M) => void\n\n  const overscan = opts.overscan ?? 3\n\n  // Scroll container\n  const scroll = ctx.dom.createElement('div') as HTMLDivElement\n  scroll.style.overflow = 'auto'\n  scroll.style.position = 'relative'\n  scroll.style.height = `${opts.containerHeight}px`\n  scroll.dataset.virtualContainer = ''\n  if (opts.class) scroll.className = opts.class\n\n  // Inner spacer sized to full content height\n  const spacer = ctx.dom.createElement('div') as HTMLDivElement\n  spacer.style.position = 'relative'\n  spacer.style.width = '100%'\n  spacer.dataset.virtualSpacer = ''\n  scroll.appendChild(spacer)\n\n  // Map of key → entry\n  const entries = new Map<string | number, VirtualEntry<T>>()\n  let lastItems: T[] = []\n  let scrollTop = 0\n\n  const computeRange = (length: number): [number, number] => {\n    if (length === 0) return [0, 0]\n    const start = Math.max(0, Math.floor(scrollTop / opts.itemHeight) - overscan)\n    const end = Math.min(\n      length,\n      Math.ceil((scrollTop + opts.containerHeight) / opts.itemHeight) + overscan,\n    )\n    return [start, end]\n  }\n\n  // Wrap accessor invocations to make sample()/h.sample() inside throw a\n  // targeted error. Mirrors the wrappers in each.ts.\n  const callItems = (state: S): T[] => {\n    enterAccessor('virtualEach().items')\n    try {\n      return opts.items(state)\n    } finally {\n      exitAccessor()\n    }\n  }\n  const callKey = (item: T): string | number => {\n    enterAccessor('virtualEach().key')\n    try {\n      return opts.key(item)\n    } finally {\n      exitAccessor()\n    }\n  }\n\n  const buildEntry = (item: T, index: number, state: S): VirtualEntry<T> => {\n    const key = callKey(item)\n    const scope = createLifetime(parentLifetime)\n\n    const wrapper = ctx.dom.createElement('div') as HTMLDivElement\n    wrapper.style.position = 'absolute'\n    wrapper.style.top = `${index * opts.itemHeight}px`\n    wrapper.style.left = '0'\n    wrapper.style.right = '0'\n    wrapper.style.height = `${opts.itemHeight}px`\n    wrapper.dataset.virtualItem = ''\n    wrapper.dataset.virtualKey = String(key)\n\n    const entry: VirtualEntry<T> = { key, current: item, index, scope, wrapper }\n\n    // Item accessor: item(selector) and item.field\n    const itemFn = <R>(selector: (t: T) => R): (() => R) => {\n      const accessor = (): R => selector(entry.current)\n      ;(accessor as unknown as { __perItem: true }).__perItem = true\n      return accessor\n    }\n\n    let itemProxy: ItemAccessor<T> | null = null\n    const getItemProxy = (): ItemAccessor<T> => {\n      if (itemProxy) return itemProxy\n      const fieldCache = new Map<string, () => unknown>()\n      itemProxy = new Proxy(itemFn as object, {\n        get(target, prop) {\n          if (typeof prop === 'symbol' || prop === 'then' || prop === 'prototype') {\n            return Reflect.get(target, prop)\n          }\n          const k = prop as string\n          const cached = fieldCache.get(k)\n          if (cached) return cached\n          const accessor = (): unknown => (entry.current as Record<string, unknown>)[k]\n          ;(accessor as unknown as { __perItem: true }).__perItem = true\n          fieldCache.set(k, accessor)\n          return accessor\n        },\n      }) as ItemAccessor<T>\n      return itemProxy\n    }\n\n    const indexAccessor = (): number => entry.index\n\n    // Every non-rootLifetime/non-state field is copied from the\n    // surrounding context — including `send` and `container`. See the\n    // matching note in `each.ts`: missing `send` broke\n    // `child({ onMsg })` bubble-up from inside virtual-each rows;\n    // missing `container` would point `onMount` at `document.body`.\n    buildCtx.rootLifetime = scope\n    buildCtx.state = state\n    buildCtx.allBindings = ctx.allBindings\n    buildCtx.structuralBlocks = ctx.structuralBlocks\n    buildCtx.dom = ctx.dom\n    buildCtx.instance = ctx.instance\n    buildCtx.send = ctx.send\n    buildCtx.container = ctx.container\n    const prevFlat = getFlatBindings()\n    setFlatBindings(ctx.allBindings)\n    setRenderContext(buildCtx)\n\n    const nodes = opts.render({\n      send,\n      item: getItemProxy(),\n      acc: itemFn,\n      index: indexAccessor,\n    })\n\n    clearRenderContext()\n    setFlatBindings(prevFlat)\n    setRenderContext(ctx)\n\n    for (const node of nodes) wrapper.appendChild(node)\n    return entry\n  }\n\n  const reconcile = (state: S): void => {\n    const items = callItems(state)\n    lastItems = items\n\n    // Update spacer total height\n    spacer.style.height = `${items.length * opts.itemHeight}px`\n\n    if (items.length === 0) {\n      // Dispose all entries\n      for (const entry of entries.values()) {\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope)\n        if (entry.wrapper.parentNode) entry.wrapper.parentNode.removeChild(entry.wrapper)\n      }\n      entries.clear()\n      return\n    }\n\n    const [start, end] = computeRange(items.length)\n\n    // Build a map of key → {item, index} for the visible range\n    const visibleKeys = new Map<string | number, { item: T; index: number }>()\n    for (let i = start; i < end; i++) {\n      const item = items[i]!\n      visibleKeys.set(callKey(item), { item, index: i })\n    }\n\n    // Dispose entries no longer visible\n    for (const [key, entry] of entries) {\n      if (!visibleKeys.has(key)) {\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope)\n        if (entry.wrapper.parentNode) entry.wrapper.parentNode.removeChild(entry.wrapper)\n        entries.delete(key)\n      }\n    }\n\n    // Create new entries + update existing\n    for (const [key, { item, index }] of visibleKeys) {\n      const existing = entries.get(key)\n      if (existing) {\n        existing.current = item\n        if (existing.index !== index) {\n          existing.index = index\n          existing.wrapper.style.top = `${index * opts.itemHeight}px`\n        }\n      } else {\n        const entry = buildEntry(item, index, state)\n        entries.set(key, entry)\n        spacer.appendChild(entry.wrapper)\n      }\n    }\n  }\n\n  // Scroll handler — reconcile visible range without touching component state\n  const onScroll = (): void => {\n    scrollTop = scroll.scrollTop\n    reconcile(ctx.state as S)\n  }\n  scroll.addEventListener('scroll', onScroll, { passive: true })\n\n  // Register as a structural block BEFORE initial render so this block\n  // precedes any nested blocks its rows register. See branch.ts for the\n  // full rationale (Phase 1 iteration safety).\n  const block: StructuralBlock = {\n    mask: FULL_MASK,\n    reconcile(state: unknown) {\n      const newItems = callItems(state as S)\n      if (newItems === lastItems) return\n      reconcile(state as S)\n    },\n  }\n  blocks.push(block)\n\n  // Initial render\n  reconcile(ctx.state as S)\n\n  // Cleanup on parent disposal\n  addDisposer(parentLifetime, () => {\n    scroll.removeEventListener('scroll', onScroll)\n    for (const entry of entries.values()) {\n      disposeLifetime(entry.scope)\n    }\n    entries.clear()\n  })\n\n  return [scroll]\n}\n"]}
+{"version":3,"file":"virtual-each.js","sourceRoot":"","sources":["../../src/primitives/virtual-each.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,kBAAkB,EAClB,aAAa,EACb,YAAY,GAEb,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAC7E,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,eAAe,CAAA;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AA8B7C,MAAM,QAAQ,GAAkB;IAC9B,YAAY,EAAE,IAA2B;IACzC,KAAK,EAAE,IAAI;IACX,WAAW,EAAE,EAAE;IACf,gBAAgB,EAAE,EAAE;IACpB,GAAG,EAAE,IAAiD;CACvD,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,WAAW,CAAoB,IAAiC;IAC9E,MAAM,GAAG,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAA;IAC3C,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY,CAAA;IACvC,MAAM,MAAM,GAAG,GAAG,CAAC,gBAAgB,CAAA;IACnC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAwB,CAAA;IAEzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;IAEnC,mBAAmB;IACnB,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;IAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAA;IAC9B,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;IAClC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,IAAI,CAAA;IACjD,MAAM,CAAC,OAAO,CAAC,gBAAgB,GAAG,EAAE,CAAA;IACpC,IAAI,IAAI,CAAC,KAAK;QAAE,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;IAE7C,4CAA4C;IAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;IAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;IAClC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAA;IAC3B,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,EAAE,CAAA;IACjC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IAE1B,qBAAqB;IACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAA;IAC3D,IAAI,SAAS,GAAQ,EAAE,CAAA;IACvB,IAAI,SAAS,GAAG,CAAC,CAAA;IAEjB,MAAM,YAAY,GAAG,CAAC,MAAc,EAAoB,EAAE;QACxD,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAA;QAC7E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAClB,MAAM,EACN,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,QAAQ,CAC3E,CAAA;QACD,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IACrB,CAAC,CAAA;IAED,uEAAuE;IACvE,mDAAmD;IACnD,MAAM,SAAS,GAAG,CAAC,KAAQ,EAAO,EAAE;QAClC,aAAa,CAAC,qBAAqB,CAAC,CAAA;QACpC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC1B,CAAC;gBAAS,CAAC;YACT,YAAY,EAAE,CAAA;QAChB,CAAC;IACH,CAAC,CAAA;IACD,MAAM,OAAO,GAAG,CAAC,IAAO,EAAmB,EAAE;QAC3C,aAAa,CAAC,mBAAmB,CAAC,CAAA;QAClC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;gBAAS,CAAC;YACT,YAAY,EAAE,CAAA;QAChB,CAAC;IACH,CAAC,CAAA;IAED,MAAM,UAAU,GAAG,CAAC,IAAO,EAAE,KAAa,EAAE,KAAQ,EAAmB,EAAE;QACvE,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;QACzB,MAAM,KAAK,GAAG,cAAc,CAAC,cAAc,CAAC,CAAA;QAE5C,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAmB,CAAA;QAC9D,OAAO,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAA;QACnC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAClD,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAA;QACxB,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAA;QACzB,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAC7C,OAAO,CAAC,OAAO,CAAC,WAAW,GAAG,EAAE,CAAA;QAChC,OAAO,CAAC,OAAO,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;QAExC,MAAM,KAAK,GAAoB,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;QAE5E,+CAA+C;QAC/C,MAAM,MAAM,GAAG,CAAI,QAAqB,EAAa,EAAE;YACrD,MAAM,QAAQ,GAAG,GAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAChD;YAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;YAC9D,OAAO,QAAQ,CAAA;QACjB,CAAC,CAAA;QAED,IAAI,SAAS,GAA2B,IAAI,CAAA;QAC5C,MAAM,YAAY,GAAG,GAAoB,EAAE;YACzC,IAAI,SAAS;gBAAE,OAAO,SAAS,CAAA;YAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAA;YACnD,SAAS,GAAG,IAAI,KAAK,CAAC,MAAgB,EAAE;gBACtC,GAAG,CAAC,MAAM,EAAE,IAAI;oBACd,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;wBACxE,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;oBAClC,CAAC;oBACD,MAAM,CAAC,GAAG,IAAc,CAAA;oBACxB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;oBAChC,IAAI,MAAM;wBAAE,OAAO,MAAM,CAAA;oBACzB,MAAM,QAAQ,GAAG,GAAY,EAAE,CAAE,KAAK,CAAC,OAAmC,CAAC,CAAC,CAAC,CAC5E;oBAAC,QAA2C,CAAC,SAAS,GAAG,IAAI,CAAA;oBAC9D,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;oBAC3B,OAAO,QAAQ,CAAA;gBACjB,CAAC;aACF,CAAoB,CAAA;YACrB,OAAO,SAAS,CAAA;QAClB,CAAC,CAAA;QAED,MAAM,aAAa,GAAG,GAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAA;QAE/C,4DAA4D;QAC5D,8DAA8D;QAC9D,mEAAmE;QACnE,mEAAmE;QACnE,8DAA8D;QAC9D,gEAAgE;QAChE,gCAAgC;QAChC,QAAQ,CAAC,YAAY,GAAG,KAAK,CAAA;QAC7B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;QACtB,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAA;QACtC,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC,gBAAgB,CAAA;QAChD,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;QACtB,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;QAChC,QAAQ,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAA;QACxB,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAA;QAClC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAA;QAClC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAChC,gBAAgB,CAAC,QAAQ,CAAC,CAAA;QAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,IAAI;YACJ,IAAI,EAAE,YAAY,EAAE;YACpB,GAAG,EAAE,MAAM;YACX,KAAK,EAAE,aAAa;SACrB,CAAC,CAAA;QAEF,kBAAkB,EAAE,CAAA;QACpB,eAAe,CAAC,QAAQ,CAAC,CAAA;QACzB,gBAAgB,CAAC,GAAG,CAAC,CAAA;QAErB,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACnD,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IAED,MAAM,SAAS,GAAG,CAAC,KAAQ,EAAQ,EAAE;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;QAC9B,SAAS,GAAG,KAAK,CAAA;QAEjB,6BAA6B;QAC7B,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;QAE3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,sBAAsB;YACtB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACrC,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;gBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU;oBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnF,CAAC;YACD,OAAO,CAAC,KAAK,EAAE,CAAA;YACf,OAAM;QACR,CAAC;QAED,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAE/C,2DAA2D;QAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+C,CAAA;QAC1E,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;YACtB,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;QACpD,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,KAAK,CAAC,aAAa,GAAG,aAAa,CAAA;gBACzC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;gBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU;oBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;gBACjF,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACrB,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,KAAK,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;YACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACjC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAA;gBACvB,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;oBAC7B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAA;oBACtB,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,IAAI,CAAA;gBAC7D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC5C,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBACvB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YACnC,CAAC;QACH,CAAC;IACH,CAAC,CAAA;IAED,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,GAAS,EAAE;QAC1B,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;QAC5B,SAAS,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAC3B,CAAC,CAAA;IACD,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAA;IAE9D,qEAAqE;IACrE,sEAAsE;IACtE,6CAA6C;IAC7C,MAAM,KAAK,GAAoB;QAC7B,IAAI,EAAE,SAAS;QACf,MAAM,EAAE,CAAC;QACT,SAAS,CAAC,KAAc;YACtB,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAU,CAAC,CAAA;YACtC,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAM;YAClC,SAAS,CAAC,KAAU,CAAC,CAAA;QACvB,CAAC;KACF,CAAA;IACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAElB,iBAAiB;IACjB,SAAS,CAAC,GAAG,CAAC,KAAU,CAAC,CAAA;IAEzB,6BAA6B;IAC7B,WAAW,CAAC,cAAc,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAC9C,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QAC9B,CAAC;QACD,OAAO,CAAC,KAAK,EAAE,CAAA;IACjB,CAAC,CAAC,CAAA;IAEF,OAAO,CAAC,MAAM,CAAC,CAAA;AACjB,CAAC","sourcesContent":["import type { ItemAccessor, Lifetime, Send } from '../types.js'\nimport {\n  getRenderContext,\n  setRenderContext,\n  clearRenderContext,\n  enterAccessor,\n  exitAccessor,\n  type RenderContext,\n} from '../render-context.js'\nimport { createLifetime, disposeLifetime, addDisposer } from '../lifetime.js'\nimport { getFlatBindings, setFlatBindings } from '../binding.js'\nimport { FULL_MASK } from '../update-loop.js'\nimport type { StructuralBlock } from '../structural.js'\n\nexport interface VirtualEachOptions<S, T, M = unknown> {\n  items: (s: S) => T[]\n  key: (item: T) => string | number\n  /** Fixed pixel height per item. Required — dynamic heights are not supported yet. */\n  itemHeight: number\n  /** Scrollable container height in pixels. */\n  containerHeight: number\n  /** Extra rows to render above/below the viewport for smooth scrolling. Default: 3. */\n  overscan?: number\n  /** Optional class for the scroll container. */\n  class?: string\n  render: (opts: {\n    send: Send<M>\n    item: ItemAccessor<T>\n    acc: <R>(selector: (t: T) => R) => () => R\n    index: () => number\n  }) => Node[]\n}\n\ninterface VirtualEntry<T> {\n  key: string | number\n  current: T\n  index: number\n  scope: Lifetime\n  wrapper: HTMLElement\n}\n\nconst buildCtx: RenderContext = {\n  rootLifetime: null as unknown as Lifetime,\n  state: null,\n  allBindings: [],\n  structuralBlocks: [],\n  dom: null as unknown as import('../dom-env.js').DomEnv,\n}\n\n/**\n * Virtualized list — renders only the rows visible in the scroll viewport.\n * Use for lists with 1k+ items where a regular `each()` would be too slow.\n *\n * Current limitations:\n * - Fixed row height (`itemHeight`) — dynamic heights not supported\n * - No transitions / animations\n * - No cross-container reuse (items outside view are fully disposed)\n *\n * ```ts\n * view: ({ text }) => [\n *   ...virtualEach({\n *     items: (s) => s.rows,\n *     key: (r) => r.id,\n *     itemHeight: 40,\n *     containerHeight: 600,\n *     render: ({ item }) => [\n *       div({ class: 'row' }, [text(item.label)]),\n *     ],\n *   }),\n * ]\n * ```\n */\nexport function virtualEach<S, T, M = unknown>(opts: VirtualEachOptions<S, T, M>): Node[] {\n  const ctx = getRenderContext('virtualEach')\n  const parentLifetime = ctx.rootLifetime\n  const blocks = ctx.structuralBlocks\n  const send = ctx.send as (msg: M) => void\n\n  const overscan = opts.overscan ?? 3\n\n  // Scroll container\n  const scroll = ctx.dom.createElement('div') as HTMLDivElement\n  scroll.style.overflow = 'auto'\n  scroll.style.position = 'relative'\n  scroll.style.height = `${opts.containerHeight}px`\n  scroll.dataset.virtualContainer = ''\n  if (opts.class) scroll.className = opts.class\n\n  // Inner spacer sized to full content height\n  const spacer = ctx.dom.createElement('div') as HTMLDivElement\n  spacer.style.position = 'relative'\n  spacer.style.width = '100%'\n  spacer.dataset.virtualSpacer = ''\n  scroll.appendChild(spacer)\n\n  // Map of key → entry\n  const entries = new Map<string | number, VirtualEntry<T>>()\n  let lastItems: T[] = []\n  let scrollTop = 0\n\n  const computeRange = (length: number): [number, number] => {\n    if (length === 0) return [0, 0]\n    const start = Math.max(0, Math.floor(scrollTop / opts.itemHeight) - overscan)\n    const end = Math.min(\n      length,\n      Math.ceil((scrollTop + opts.containerHeight) / opts.itemHeight) + overscan,\n    )\n    return [start, end]\n  }\n\n  // Wrap accessor invocations to make sample()/h.sample() inside throw a\n  // targeted error. Mirrors the wrappers in each.ts.\n  const callItems = (state: S): T[] => {\n    enterAccessor('virtualEach().items')\n    try {\n      return opts.items(state)\n    } finally {\n      exitAccessor()\n    }\n  }\n  const callKey = (item: T): string | number => {\n    enterAccessor('virtualEach().key')\n    try {\n      return opts.key(item)\n    } finally {\n      exitAccessor()\n    }\n  }\n\n  const buildEntry = (item: T, index: number, state: S): VirtualEntry<T> => {\n    const key = callKey(item)\n    const scope = createLifetime(parentLifetime)\n\n    const wrapper = ctx.dom.createElement('div') as HTMLDivElement\n    wrapper.style.position = 'absolute'\n    wrapper.style.top = `${index * opts.itemHeight}px`\n    wrapper.style.left = '0'\n    wrapper.style.right = '0'\n    wrapper.style.height = `${opts.itemHeight}px`\n    wrapper.dataset.virtualItem = ''\n    wrapper.dataset.virtualKey = String(key)\n\n    const entry: VirtualEntry<T> = { key, current: item, index, scope, wrapper }\n\n    // Item accessor: item(selector) and item.field\n    const itemFn = <R>(selector: (t: T) => R): (() => R) => {\n      const accessor = (): R => selector(entry.current)\n      ;(accessor as unknown as { __perItem: true }).__perItem = true\n      return accessor\n    }\n\n    let itemProxy: ItemAccessor<T> | null = null\n    const getItemProxy = (): ItemAccessor<T> => {\n      if (itemProxy) return itemProxy\n      const fieldCache = new Map<string, () => unknown>()\n      itemProxy = new Proxy(itemFn as object, {\n        get(target, prop) {\n          if (typeof prop === 'symbol' || prop === 'then' || prop === 'prototype') {\n            return Reflect.get(target, prop)\n          }\n          const k = prop as string\n          const cached = fieldCache.get(k)\n          if (cached) return cached\n          const accessor = (): unknown => (entry.current as Record<string, unknown>)[k]\n          ;(accessor as unknown as { __perItem: true }).__perItem = true\n          fieldCache.set(k, accessor)\n          return accessor\n        },\n      }) as ItemAccessor<T>\n      return itemProxy\n    }\n\n    const indexAccessor = (): number => entry.index\n\n    // Every non-rootLifetime/non-state field is copied from the\n    // surrounding context — including `send` and `container`. The\n    // historical motivation: missing `send` broke row-internal message\n    // dispatch (originally surfaced via the removed `child({ onMsg })`\n    // primitive; equivalent today is a row-internal event handler\n    // calling the parent's `send`); missing `container` would point\n    // `onMount` at `document.body`.\n    buildCtx.rootLifetime = scope\n    buildCtx.state = state\n    buildCtx.allBindings = ctx.allBindings\n    buildCtx.structuralBlocks = ctx.structuralBlocks\n    buildCtx.dom = ctx.dom\n    buildCtx.instance = ctx.instance\n    buildCtx.send = ctx.send\n    buildCtx.container = ctx.container\n    const prevFlat = getFlatBindings()\n    setFlatBindings(ctx.allBindings)\n    setRenderContext(buildCtx)\n\n    const nodes = opts.render({\n      send,\n      item: getItemProxy(),\n      acc: itemFn,\n      index: indexAccessor,\n    })\n\n    clearRenderContext()\n    setFlatBindings(prevFlat)\n    setRenderContext(ctx)\n\n    for (const node of nodes) wrapper.appendChild(node)\n    return entry\n  }\n\n  const reconcile = (state: S): void => {\n    const items = callItems(state)\n    lastItems = items\n\n    // Update spacer total height\n    spacer.style.height = `${items.length * opts.itemHeight}px`\n\n    if (items.length === 0) {\n      // Dispose all entries\n      for (const entry of entries.values()) {\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope)\n        if (entry.wrapper.parentNode) entry.wrapper.parentNode.removeChild(entry.wrapper)\n      }\n      entries.clear()\n      return\n    }\n\n    const [start, end] = computeRange(items.length)\n\n    // Build a map of key → {item, index} for the visible range\n    const visibleKeys = new Map<string | number, { item: T; index: number }>()\n    for (let i = start; i < end; i++) {\n      const item = items[i]!\n      visibleKeys.set(callKey(item), { item, index: i })\n    }\n\n    // Dispose entries no longer visible\n    for (const [key, entry] of entries) {\n      if (!visibleKeys.has(key)) {\n        entry.scope.disposalCause = 'each-remove'\n        disposeLifetime(entry.scope)\n        if (entry.wrapper.parentNode) entry.wrapper.parentNode.removeChild(entry.wrapper)\n        entries.delete(key)\n      }\n    }\n\n    // Create new entries + update existing\n    for (const [key, { item, index }] of visibleKeys) {\n      const existing = entries.get(key)\n      if (existing) {\n        existing.current = item\n        if (existing.index !== index) {\n          existing.index = index\n          existing.wrapper.style.top = `${index * opts.itemHeight}px`\n        }\n      } else {\n        const entry = buildEntry(item, index, state)\n        entries.set(key, entry)\n        spacer.appendChild(entry.wrapper)\n      }\n    }\n  }\n\n  // Scroll handler — reconcile visible range without touching component state\n  const onScroll = (): void => {\n    scrollTop = scroll.scrollTop\n    reconcile(ctx.state as S)\n  }\n  scroll.addEventListener('scroll', onScroll, { passive: true })\n\n  // Register as a structural block BEFORE initial render so this block\n  // precedes any nested blocks its rows register. See branch.ts for the\n  // full rationale (Phase 1 iteration safety).\n  const block: StructuralBlock = {\n    mask: FULL_MASK,\n    maskHi: 0,\n    reconcile(state: unknown) {\n      const newItems = callItems(state as S)\n      if (newItems === lastItems) return\n      reconcile(state as S)\n    },\n  }\n  blocks.push(block)\n\n  // Initial render\n  reconcile(ctx.state as S)\n\n  // Cleanup on parent disposal\n  addDisposer(parentLifetime, () => {\n    scroll.removeEventListener('scroll', onScroll)\n    for (const entry of entries.values()) {\n      disposeLifetime(entry.scope)\n    }\n    entries.clear()\n  })\n\n  return [scroll]\n}\n"]}

package/dist/render-context.js

@@ -55,7 +55,7 @@ export function getRenderContext(primitiveName) {
             `  3. Calling a primitive from a setTimeout / Promise / event handler — ` +
             `the render context only persists during the synchronous view() call.\n` +
             `  4. Calling a primitive from a structural accessor (each().key, ` +
-            `each().items, branch().on, show().when, child().props, …) or a ` +
+            `each().items, branch().on, show().when, scope().on, …) or a ` +
             `binding accessor (text(s => …), el({attr: s => …})) during reconcile — ` +
             `accessors run during the update phase with no render context. They must ` +
             `be pure functions of their parameter; reads outside the parameter break ` +