stimeo-ui 0.17.0 → 0.18.0

package/dist/controllers/conditional_fields_controller.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/event_owner.ts","../../src/utils/focus_candidate.ts","../../src/utils/form_reset_watcher.ts","../../src/utils/listener_set.ts","../../src/utils/microtask_coalescer.ts","../../src/utils/morph_render_watcher.ts","../../src/utils/query_open_descendants.ts","../../src/utils/shared_registry.ts","../../src/utils/tabindex_loan.ts","../../src/controllers/conditional_fields_controller.ts"],"names":["above"],"mappings":";;AAgCO,SAAS,UAAA,CACd,YACA,IAAA,EACQ;AACR,EAAA,IAAI,EAAE,IAAA,YAAgB,IAAA,CAAA,EAAO,OAAO,EAAA;AACpC,EAAA,OAAO,WAAW,SAAA,CAAU,CAAC,cAAc,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC,CAAA;AACrE;;AC3BO,SAAS,yBAAyB,OAAA,EAA+B;AACtE,EAAA,IAAI,QAAA,GAA2B,OAAA,CAAQ,OAAA,CAAQ,oBAAoB,CAAA;AACnE,EAAA,OAAO,QAAA,EAAU;AACf,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,OAAA,KAAY,QAAQ,CAAA;AACvF,IAAA,IAAI,CAAC,MAAA,EAAQ,QAAA,CAAS,OAAO,GAAG,OAAO,IAAA;AACvC,IAAA,QAAA,GAAW,QAAA,CAAS,aAAA,EAAe,OAAA,CAAQ,oBAAoB,CAAA,IAAK,IAAA;AAAA,EACtE;AACA,EAAA,OAAO,KAAA;AACT;AAOA,SAAS,UAAU,OAAA,EAA2B;AAC5C,EAAA,OAAO,OAAA,CAAQ,YAAA,KAAiB,IAAA,IAAQ,OAAA,CAAQ,eAAe,UAAA,IAAc,IAAA;AAC/E;AASO,SAAS,eAAe,OAAA,EAAkC;AAC/D,EAAA,IAAI,SAAA,CAAU,OAAO,CAAA,EAAG,OAAO,IAAA;AAC/B,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,IAAgB,OAAA,CAAQ,UAAA;AAC/C,EAAA,IAAI,MAAA,YAAkB,UAAA,EAAY,OAAO,MAAA,CAAO,IAAA;AAChD,EAAA,OAAO,MAAA,YAAkB,UAAU,MAAA,GAAS,IAAA;AAC9C;AA2EO,SAAS,aAAa,OAAA,EAA+B;AAC1D,EAAA,KAAA,IAAS,OAAuB,OAAA,EAAS,IAAA,EAAM,IAAA,GAAO,cAAA,CAAe,IAAI,CAAA,EAAG;AAC1E,IAAA,IAAI,UAAU,IAAI,CAAA,IAAK,KAAK,OAAA,CAAQ,mBAAmB,GAAG,OAAO,KAAA;AAAA,EACnE;AACA,EAAA,IAAI,OAAA,YAAmB,gBAAA,IAAoB,OAAA,CAAQ,IAAA,KAAS,UAAU,OAAO,KAAA;AAC7E,EAAA,IAAI,EAAE,UAAA,IAAc,OAAA,CAAA,EAAU,OAAO,IAAA;AACrC,EAAA,IAAK,OAAA,CAAgD,UAAU,OAAO,KAAA;AACtE,EAAA,OAAO,CAAC,yBAAyB,OAAO,CAAA;AAC1C;;AChFO,IAAM,mBAAN,MAAuB;AAAA,EACnB,KAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA,uBAAc,GAAA,EAAY;AAAA,EACnC,WAAA,GAAc,CAAA;AAAA,EAMd,WAAA,CAAY,MAA0C,OAAA,EAAqB;AACzE,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAAA,EAClB;AAAA,EAGA,OAAA,GAAgB;AACd,IAAA,QAAA,CAAS,gBAAA,CAAiB,OAAA,EAAS,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAAA,EAC5D;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,QAAA,CAAS,mBAAA,CAAoB,OAAA,EAAS,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAC7D,IAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AACpB,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,OAAA,EAAS,oBAAA,CAAqB,KAAK,CAAA;AAC5D,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA,EAES,YAAA,GAAe,CAAC,KAAA,KAAuB;AAC9C,IAAA,MAAM,OAAO,KAAA,CAAM,MAAA;AACnB,IAAA,IAAI,EAAE,IAAA,YAAgB,eAAA,CAAA,IAAoB,CAAC,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,EAAG;AAC7D,IAAA,MAAM,aAAa,IAAA,CAAK,WAAA;AACxB,IAAA,cAAA,CAAe,MAAM;AAEnB,MAAA,IAAI,UAAA,KAAe,KAAK,WAAA,EAAa;AACrC,MAAA,IAAI,KAAA,CAAM,UAAA,KAAe,KAAA,CAAM,IAAA,EAAM;AACnC,QAAA,IAAA,CAAK,QAAQ,KAAK,CAAA;AAClB,QAAA;AAAA,MACF;AACA,MAAA,MAAM,KAAA,GAAQ,sBAAsB,MAAM;AACxC,QAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,KAAK,CAAA;AACzB,QAAA,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,MACpB,CAAC,CAAA;AACD,MAAA,IAAA,CAAK,OAAA,CAAQ,IAAI,KAAK,CAAA;AAAA,IACxB,CAAC,CAAA;AAAA,EACH,CAAA;AAAA,EAGA,QAAQ,KAAA,EAAoB;AAC1B,IAAA,IAAI,CAAC,KAAA,CAAM,gBAAA,EAAkB,IAAA,CAAK,QAAA,EAAS;AAAA,EAC7C;AACF,CAAA;;AC9CO,IAAM,cAAN,MAAkB;AAAA,EAEvB,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EAS7B,GAAA,CACE,MAAA,EACA,IAAA,EACA,OAAA,EACA,OAAA,EACM;AACN,IAAA,MAAA,CAAO,gBAAA,CAAiB,IAAA,EAAM,OAAA,EAAS,EAAE,GAAG,SAAS,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA;AAAA,EACnF;AAAA,EAMA,OAAA,GAAgB;AACd,IAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,IAAA,IAAA,CAAK,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EACpC;AACF,CAAA;;AC7BO,IAAM,qBAAN,MAAyB;AAAA,EACrB,IAAA;AAAA,EACT,OAAA,GAAU,KAAA;AAAA,EACV,OAAA,GAAU,KAAA;AAAA,EACV,WAAA,GAAc,CAAA;AAAA,EAGd,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,IAAA,GAAO,GAAA;AAAA,EACd;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACjB;AAAA,EAGA,MAAA,GAAe;AACb,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AAAA,EACtB;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,OAAA,EAAS;AACnC,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AACf,IAAA,MAAM,aAAa,IAAA,CAAK,WAAA;AACxB,IAAA,cAAA,CAAe,MAAM;AAEnB,MAAA,IAAI,UAAA,KAAe,KAAK,WAAA,IAAe,CAAC,KAAK,OAAA,IAAW,CAAC,KAAK,OAAA,EAAS;AACvE,MAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAC,CAAA;AAAA,EACH;AACF,CAAA;;ACxEO,IAAM,qBAAN,MAAyB;AAAA,EACrB,UAAA,GAAa,IAAI,WAAA,EAAY;AAAA,EAC7B,KAAA;AAAA,EACT,QAAA,GAA2B,IAAA;AAAA,EAClB,QAAA,GAAW,MAAY,IAAA,CAAK,KAAA,CAAM,QAAA,EAAS;AAAA,EAGpD,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,kBAAA,CAAmB,GAAG,CAAA;AAAA,EACzC;AAAA,EAGA,QAAQ,OAAA,EAAwB;AAC9B,IAAA,IAAI,IAAA,CAAK,aAAa,OAAA,EAAS;AAC/B,IAAA,IAAA,CAAK,UAAA,EAAW;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AACpB,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,OAAA,EAAS,qBAAA,EAAuB,KAAK,QAAQ,CAAA;AAAA,EACnE;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AAAA,EACtB;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AACxB,IAAA,IAAA,CAAK,MAAM,MAAA,EAAO;AAClB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAAA,EAClB;AACF,CAAA;;AC1CO,SAAS,oBAAA,CACd,MACA,QAAA,EACK;AACL,EAAA,MAAM,UAAe,EAAC;AACtB,EAAA,MAAM,KAAA,GAAsB,CAAC,IAAI,CAAA;AACjC,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAA,CAAM,gBAAA,CAAoB,QAAQ,CAAC,CAAA;AACnD,IAAA,IAAI,KAAA,CAAM,QAAA,KAAa,IAAA,CAAK,YAAA,EAAc;AACxC,MAAA,MAAM,SAAU,KAAA,CAAkB,UAAA;AAClC,MAAA,IAAI,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAAA,IAC/B;AACA,IAAA,KAAA,MAAW,OAAA,IAAW,KAAA,CAAM,gBAAA,CAAiB,GAAG,CAAA,EAAG;AACjD,MAAA,IAAI,OAAA,CAAQ,UAAA,EAAY,KAAA,CAAM,IAAA,CAAK,QAAQ,UAAU,CAAA;AAAA,IACvD;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;;ACUO,SAAS,cAAA,CAAiC,KAAa,MAAA,EAAoB;AAChF,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC7B,EAAA,MAAM,KAAA,GAAQ,UAAA;AACd,EAAA,MAAM,QAAA,GAAW,MAAM,MAAM,CAAA;AAC7B,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AACnC,EAAA,MAAM,WAAW,MAAA,EAAO;AACxB,EAAA,MAAA,CAAO,eAAe,UAAA,EAAY,MAAA,EAAQ,EAAE,KAAA,EAAO,UAAU,CAAA;AAC7D,EAAA,OAAO,QAAA;AACT;;ACmDO,IAAM,YAAA,GAAN,MAAM,aAAA,CAAkD;AAAA,EAE7D,OAAgB,SAAA,GAAY,cAAA;AAAA,IAC1B,qCAAA;AAAA,IACA,OAA6B,EAAE,MAAA,kBAAQ,IAAI,SAAQ,EAAG,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAE;AAAA,GACzE;AAAA,EACS,MAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAO;AAAA,EAQ5B,WAAA,CAAY,OAAe,KAAA,EAAe;AACxC,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,OAAA,GAAU,QAAQ,KAAK,CAAA,cAAA,CAAA;AAC5B,IAAA,aAAA,CAAa,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AAAA,EAC/C;AAAA,EAMA,KAAK,OAAA,EAAkB;AACrB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,IAAA,GACJ,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,IAAI,CAAA,IACvC,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,KAAA,KAAU,IAAA,CAAK;AAAA,KACtF;AACF,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,EAAA,CAAG,EAAE,GAAG,KAAA,KAAU,OAAA;AACvC,IAAA,IAAI,CAAC,IAAA,IAAQ,OAAA,KAAY,IAAA,IAAQ,CAAC,MAAA,EAAQ;AAC1C,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,OAAO,CAAA;AACtB,IAAA,IAAI,IAAA,OAAW,IAAA,GAAO,IAAA;AAAA,SACjB,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,EAAM,MAAA,EAAQ,IAAA,CAAK,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,MAAA,EAAQ,CAAA;AAChF,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AACzB,IAAA,IAAI,YAAY,IAAA,IAAS,CAAC,IAAA,IAAQ,OAAA,KAAY,KAAK,MAAA,EAAS;AAC1D,MAAA,OAAA,CAAQ,YAAA,CAAa,UAAA,EAAY,IAAA,CAAK,MAAM,CAAA;AAAA,IAC9C;AAAA,EACF;AAAA,EAGA,SAAA,GAAkB;AAChB,IAAA,KAAA,MAAW,OAAA,IAAW,KAAK,KAAA,EAAO;AAChC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,MAAA,MAAM,OAAO,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,SAAS,IAAI,CAAA;AACpD,MAAA,IAAI,IAAA,EAAM,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,OAAO,IAAI,CAAA;AAAA,IAC9C;AACA,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACnB;AAAA,EAMA,QAAQ,OAAA,EAA4B;AAClC,IAAA,IAAI,QAAQ,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,KAAM,KAAK,MAAA,EAAQ;AACxD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAO,CAAA;AACpF,IAAA,IAAI,IAAA,IAAQ,CAAC,OAAA,CAAQ,OAAA,CAAQ,QAAQ,GAAG,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,KAAA,EAAO,IAAI,CAAA;AAAA,EAC5E;AAAA,EAGA,cAAc,IAAA,EAAwB;AACpC,IAAA,KAAA,MAAW,WAAW,oBAAA,CAAkC,IAAA,EAAM,IAAI,IAAA,CAAK,OAAO,GAAG,CAAA,EAAG;AAClF,MAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,IACtB;AAAA,EACF;AAAA,EAGA,OAAO,OAAA,EAAkC;AACvC,IAAA,MAAM,MAAA,GAAS,cAAa,SAAA,CAAU,MAAA;AACtC,IAAA,MAAM,QAAQ,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,CAAK,MAAM,OAAO,CAAA;AACvD,IAAA,MAAA,CAAO,GAAA,CAAI,SAAS,KAAK,CAAA;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAGA,MAAM,OAAA,EAAkC;AACtC,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,QAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,MAAA,IAAU,aAAA,CAAa,SAAA,CAAU,KAAA,EAAO;AACjD,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,MAAM,CAAA;AACzC,MAAA,IAAI,KAAA,KAAU,IAAA,EAAM,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,CAAA;AAAA,IAC5E;AACA,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,GAAA,EAAK,KAAA,KAAU,MAAA,CAAO,GAAA,CAAI,KAAA,KAAU,OAAO,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,KAAA,KAAU,OAAO,CAAC,CAAA;AAC1F,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,MAAM,OAAA,EAAQ,EAAG,IAAA,CAAK,MAAA,GAAS,KAAA,GAAQ,CAAA;AACnE,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAGA,QAAA,CAAS,OAAA,EAAsB,KAAA,EAAmB,IAAA,EAAsB;AACtE,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA;AAChC,IAAA,MAAM,IAAA,GACJ,OAAA,KAAY,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA,CAAM,KAAA,GAAQ,CAAC,EAAE,IAAA,CAAK,CAACA,MAAAA,KAAUA,MAAAA,CAAM,UAAU,OAAO,CAAA;AAC3F,IAAA,KAAA,CAAM,MAAA,CAAO,OAAO,CAAC,CAAA;AACrB,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAK,CAAA;AACzB,IAAA,IAAI,KAAA,EAAO,KAAA,CAAM,MAAA,KAAW,IAAA,CAAK,MAAA;AACjC,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AACzB,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,GAAS,KAAA,CAAM,KAAA,GAAQ,CAAC,CAAA,GAAI,MAAA;AAC/C,IAAA,IAAI,CAAC,KAAA,EAAO,OAAA,CAAQ,eAAA,CAAgB,UAAU,CAAA;AAAA,SAAA,IACrC,MAAM,KAAA,KAAU,OAAA,UAAiB,YAAA,CAAa,UAAA,EAAY,MAAM,KAAK,CAAA;AAAA,EAChF;AAAA,EAGA,KAAA,CAAM,SAAsB,KAAA,EAAkC;AAC5D,IAAA,MAAM,OAAA,uBAAc,GAAA,CAA2B,CAAC,CAAC,IAAA,CAAK,OAAA,EAAS,IAAI,CAAC,CAAC,CAAA;AACrE,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO,OAAA,CAAQ,IAAI,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAC7D,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,CAAA,IAAK,OAAA,EAAS;AACtC,MAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA,KAAM,QAAA,EAAU;AAC7C,MAAA,IAAI,QAAA,KAAa,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,IAAI,CAAA;AAAA,WAC9C,OAAA,CAAQ,YAAA,CAAa,IAAA,EAAM,QAAQ,CAAA;AAAA,IAC1C;AAAA,EACF;AACF,CAAA;;AC/LA,IAAM,eAAA,GAAkB,2BAAA;AAGxB,IAAM,QAAA,GAAW,iCAAA;AAGjB,IAAM,mBAAA,GAAsB;AAAA,EAC1B,QAAA;AAAA,EACA,aAAA;AAAA,EACA,cAAA;AAAA,EACA,eAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,qBAAA;AAAA,EACA,iBAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AAkDO,IAAM,2BAAA,GAAN,cAA0C,UAAA,CAAwB;AAAA,EACvE,OAAgB,OAAA,GAAU,CAAC,SAAA,EAAW,QAAQ,CAAA;AAAA,EAC9C,OAAgB,MAAA,GAAS;AAAA,IACvB,aAAA,EAAe,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,IAAA,EAAK;AAAA,IAC9C,KAAA,EAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,KAAA;AAAM,GACxC;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,UAAU,CAAA;AAAA,EAC5B,OAAO,MAAA,GAAS,CAAC,QAAA,EAAU,WAAW,CAAA;AAAA,EAStC,YAAA,uBAAmB,OAAA,EAA8B;AAAA,EAEjD,eAAA,uBAAsB,OAAA,EAAiD;AAAA,EACvE,UAAA,GAAa,KAAA;AAAA,EAEJ,SAAA,uBAAgB,GAAA,EAAiB;AAAA,EAEjC,UAAA,uBAAiB,OAAA,EAAqB;AAAA,EAGtC,aAAa,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,eAAe,CAAA;AAAA,EAC9D,UAAA,GAAa,IAAI,WAAA,EAAY;AAAA,EAC7B,aAAa,IAAI,gBAAA;AAAA,IACxB,CAAC,IAAA,KAAS,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAAA,IACtC,MAAM,IAAA,CAAK,UAAA,CAAW,QAAA;AAAS,GACjC;AAAA,EAES,aAAA,GAAgB,IAAI,YAAA,CAA0B,IAAA,EAAM,KAAK,UAAU,CAAA;AAAA,EAEnE,SAAA,GAAY,IAAI,gBAAA,CAAiB,CAAC,YAAY,IAAA,CAAK,YAAA,CAAa,OAAO,CAAC,CAAA;AAAA,EAGxE,eAAA,GAAkB,CAAC,KAAA,KAAuB;AACjD,IAAA,MAAM,SAAS,KAAA,CAAM,MAAA;AACrB,IAAA,MAAM,WAAW,IAAA,CAAK,cAAA;AACtB,IAAA,IAAI,MAAA,YAAkB,WAAW,QAAA,CAAS,IAAA,CAAK,CAAC,OAAA,KAAY,OAAA,KAAY,MAAM,CAAA,EAAG;AAC/E,MAAA,IAAA,CAAK,cAAc,QAAQ,CAAA;AAAA,IAC7B;AAAA,EACF,CAAA;AAAA,EAGS,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,aAAA,CAAc,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACvC,IAAA,IAAA,CAAK,YAAA,uBAAmB,OAAA,EAAQ;AAChC,IAAA,IAAA,CAAK,eAAA,uBAAsB,OAAA,EAAQ;AACnC,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS;AAAA,MACnC,UAAA,EAAY,IAAA;AAAA,MACZ,eAAA,EAAiB,mBAAA;AAAA,MACjB,SAAA,EAAW,IAAA;AAAA,MACX,OAAA,EAAS;AAAA,KACV,CAAA;AACD,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAClB,IAAA,IAAA,CAAK,WAAW,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,QAAA,EAAU,KAAK,eAAe,CAAA;AAChE,IAAA,IAAA,CAAK,WAAW,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,OAAA,EAAS,KAAK,eAAe,CAAA;AAC/D,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AAAA,EAC1B;AAAA,EAGS,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,UAAA,GAAa,KAAA;AAClB,IAAA,IAAA,CAAK,UAAU,UAAA,EAAW;AAC1B,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AACxB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,cAAc,SAAA,EAAU;AAAA,EAC/B;AAAA,EAGA,sBAAA,GAA+B;AAC7B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,yBAAA,GAAkC;AAChC,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAWA,yBAAyB,MAAA,EAA2B;AAClD,IAAA,IAAA,CAAK,SAAA,CAAU,IAAI,MAAM,CAAA;AACzB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,yBAAA,GAAkC;AAChC,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,aAAA,EAAc;AAAA,EACrB;AAAA,EASA,OAAA,CAAQ,QAAA,GAAsB,IAAA,CAAK,cAAA,EAAoC;AACrE,IAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,IAAA,MAAM,IAAA,uBAAW,GAAA,EAA0B;AAC3C,IAAA,KAAA,MAAW,MAAA,IAAU,SAAS,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,UAAA,CAAW,MAAA,EAAQ,QAAQ,CAAC,CAAA;AAChF,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,SAAA,EAAW;AACrC,MAAA,IAAI,CAAC,KAAK,GAAA,CAAI,QAAQ,GAAG,IAAA,CAAK,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACvD;AACA,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AAErB,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAiB;AACrC,IAAA,MAAM,gBAAA,GAAmB;AAAA,MACvB,GAAG,QAAQ,MAAA,CAAO,CAAC,WAAW,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,KAAM,IAAI,CAAA;AAAA,MACvD,GAAG,QAAQ,MAAA,CAAO,CAAC,WAAW,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,KAAM,KAAK;AAAA,KAC1D;AACA,IAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA;AAC/B,MAAA,IAAI,YAAY,MAAA,IAAa,IAAA,CAAK,aAAa,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA,EAAG;AACrE,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAAA,MACpB;AAAA,IACF;AAEA,IAAA,OAAO,OAAA,CACJ,OAAO,CAAC,MAAA,KAAW,QAAQ,GAAA,CAAI,MAAM,CAAC,CAAA,CACtC,GAAA,CAAI,CAAC,MAAA,MAAY,EAAE,QAAQ,OAAA,EAAS,IAAA,CAAK,IAAI,MAAM,CAAA,KAAM,MAAK,CAAE,CAAA;AAAA,EACrE;AAAA,EAGA,aAAA,CAAc,QAAA,GAAsB,IAAA,CAAK,cAAA,EAAsB;AAC7D,IAAA,KAAA,MAAW,MAAA,IAAU,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,EAAG;AAC3C,MAAA,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,EAAE,MAAA,EAAQ,CAAA;AAAA,IACpC;AAAA,EACF;AAAA,EAGA,aAAA,GAAsB;AACpB,IAAA,KAAA,MAAW,MAAA,IAAU,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnC,MAAA,IAAA,CAAK,QAAA,CAAS,WAAA,EAAa,EAAE,MAAA,EAAQ,CAAA;AAAA,IACvC;AAAA,EACF;AAAA,EAGA,YAAA,CACE,MAAA,EACA,OAAA,EACA,IAAA,EACS;AACT,IAAA,MAAM,WAAW,IAAA,CAAK,YAAA,CAAa,IAAI,MAAM,CAAA,IAAK,CAAC,MAAA,CAAO,MAAA;AAC1D,IAAA,MAAM,UAAU,OAAA,KAAY,QAAA;AAC5B,IAAA,IAAA,CAAK,YAAA,CAAa,GAAA,CAAI,MAAA,EAAQ,OAAO,CAAA;AAErC,IAAA,IAAI,CAAC,OAAA,EAAS,IAAA,CAAK,aAAA,CAAc,QAAQ,IAAI,CAAA;AAC7C,IAAA,IAAA,CAAK,gBAAA,CAAiB,QAAQ,OAAO,CAAA;AACrC,IAAA,IAAA,CAAK,mBAAA,CAAoB,QAAQ,OAAO,CAAA;AACxC,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAMA,gBAAA,CAAiB,QAAqB,OAAA,EAAwB;AAC5D,IAAA,IAAI,CAAC,OAAA,IAAW,IAAA,CAAK,aAAA,CAAc,MAAM,MAAM,IAAA,EAAM,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA;AAAA,SAC1E,IAAA,CAAK,UAAA,CAAW,MAAA,CAAO,MAAM,CAAA;AAClC,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,QAAA,EAAU,OAAA,GAAU,OAAO,EAAE,CAAA;AAC1D,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,aAAA,EAAe,OAAA,GAAU,OAAO,MAAM,CAAA;AACnE,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,cAAA,EAAgB,OAAA,GAAU,SAAS,IAAI,CAAA;AAAA,EACtE;AAAA,EAGA,mBAAA,CAAoB,QAAqB,OAAA,EAAwB;AAC/D,IAAA,MAAM,aAAA,GAAgB,CAAC,OAAA,IAAW,IAAA,CAAK,kBAAA;AACvC,IAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,gBAAA,CAA8B,QAAQ,CAAA,EAAG;AACpE,MAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,CAAa,eAAe,CAAA;AACnD,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,IAAI,CAAC,QAAQ,QAAA,EAAU;AACrB,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,UAAA,EAAY,EAAE,CAAA;AAC5C,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,MAAM,CAAA;AAAA,QACvD,WAAW,MAAA,IAAU,OAAA,CAAQ,YAAA,CAAa,eAAe,MAAM,MAAA,EAAQ;AACrE,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,MAAM,CAAA;AAAA,QACvD;AAAA,MACF,WAAW,MAAA,EAAQ;AACjB,QAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA,EAGA,QAAQ,OAAA,EAA4B;AAClC,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,UAAA,EAAY,IAAI,CAAA;AAC9C,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,IAAI,CAAA;AAAA,EACrD;AAAA,EAMA,QAAA,CAAS,SAAsB,IAAA,EAA+C;AAC5E,IAAA,IAAA,CAAK,YAAA,CAAa,OAAO,OAAO,CAAA;AAChC,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,CAAO,OAAO,GAAG,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,QAAA,EAAU,IAAI,CAAA;AACjF,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,aAAA,EAAe,IAAI,CAAA;AACjD,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,cAAA,EAAgB,IAAI,CAAA;AAClD,IAAA,KAAA,MAAW,OAAA,IAAW,OAAA,CAAQ,gBAAA,CAA8B,QAAQ,CAAA,EAAG;AACrE,MAAA,IAAI,OAAA,CAAQ,aAAa,eAAe,CAAA,IAAK,KAAK,aAAA,CAAc,OAAA,EAAS,IAAI,CAAA,EAAG;AAC9E,QAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA,EAGA,UAAA,CAAW,QAAqB,QAAA,EAA8B;AAC5D,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,aAAA,CAAc,MAAM,CAAA;AAC3C,IAAA,IAAI,SAAA,KAAc,IAAA,EAAM,OAAO,CAAC,MAAA,CAAO,MAAA;AACvC,IAAA,OACE,QAAA,CAAS,MAAA,GAAS,CAAA,KACjB,IAAA,CAAK,UAAA,KAAe,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,SAAS,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,SAAS,CAAA,CAAA;AAAA,EAEpF;AAAA,EAGA,cAAc,MAAA,EAA6D;AACzE,IAAA,IAAI,MAAA,CAAO,YAAA,CAAa,mBAAmB,CAAA,EAAG;AAC5C,MAAA,OAAO,CAAC,OAAA,KAAY,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AAAA,IAC7C;AACA,IAAA,IAAI,MAAA,CAAO,YAAA,CAAa,qBAAqB,CAAA,EAAG;AAC9C,MAAA,OAAO,CAAC,OAAA,KAAY,CAAC,IAAA,CAAK,WAAW,OAAO,CAAA;AAAA,IAC9C;AACA,IAAA,MAAM,MAAA,GAAS,OAAO,OAAA,CAAQ,SAAA;AAC9B,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,OAAO,CAAC,OAAA,KAAY,IAAA,CAAK,aAAA,CAAc,SAAS,MAAM,CAAA;AAAA,IACxD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,WAAW,OAAA,EAA2B;AACpC,IAAA,OAAO,OAAA,YAAmB,oBAAoB,OAAA,CAAQ,OAAA;AAAA,EACxD;AAAA,EAGA,aAAA,CAAc,SAAkB,MAAA,EAAyB;AACvD,IAAA,IACE,mBAAmB,gBAAA,KAClB,OAAA,CAAQ,SAAS,UAAA,IAAc,OAAA,CAAQ,SAAS,OAAA,CAAA,EACjD;AACA,MAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,OAAA,CAAQ,KAAA,KAAU,MAAA;AAAA,IAC9C;AACA,IAAA,OAAO,QAAQ,KAAA,KAAU,MAAA;AAAA,EAC3B;AAAA,EAGA,aAAA,CAAc,QAAqB,IAAA,EAA+C;AAChF,IAAA,MAAM,SAAS,QAAA,CAAS,aAAA;AACxB,IAAA,IAAI,UAAU,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,EAAG,IAAA,CAAK,WAAW,IAAI,CAAA;AAAA,EAC7D;AAAA,EAGA,WAAW,IAAA,EAA+C;AACxD,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,CAAe,IAAA;AAAA,MACtC,CAAC,YAAY,YAAA,CAAa,OAAO,KAAK,IAAA,CAAK,aAAA,CAAc,SAAS,IAAI;AAAA,KACxE;AACA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,IAAA,CAAK,cAAc,SAAA,EAAU;AAC7B,MAAA,WAAA,CAAY,KAAA,EAAM;AAClB,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA,EAGA,aAAA,CAAc,WAAwB,IAAA,EAAkD;AACtF,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,MAAM,CAAC,CAAC,MAAA,EAAQ,OAAO,MAAM,OAAA,IAAW,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAC,CAAA;AAAA,EACtF;AAAA,EAGA,eAAA,CAAgB,OAAA,EAAkB,IAAA,EAAc,KAAA,EAAgC;AAC9E,IAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA,KAAM,KAAA,EAAO;AACxC,MAAA,IAAI,KAAK,UAAA,EAAY;AACnB,QAAA,IAAI,MAAA,GAAS,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,OAAO,CAAA;AAC7C,QAAA,IAAI,CAAC,MAAA,EAAQ;AACX,UAAA,MAAA,uBAAa,GAAA,EAAI;AACjB,UAAA,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,OAAA,EAAS,MAAM,CAAA;AAAA,QAC1C;AACA,QAAA,MAAA,CAAO,GAAA,CAAI,MAAM,KAAK,CAAA;AAAA,MACxB;AACA,MAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,IAAI,CAAA;AAAA,WAC3C,OAAA,CAAQ,YAAA,CAAa,IAAA,EAAM,KAAK,CAAA;AAAA,IACvC;AAAA,EACF;AAAA,EAGA,aAAa,OAAA,EAAiC;AAC5C,IAAA,MAAM,WAAW,IAAA,CAAK,cAAA;AACtB,IAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,IAAA,MAAM,aAAA,uBAAoB,GAAA,EAA0B;AACpD,IAAA,IAAI,cAAA,GAAiB,KAAA;AAErB,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,MAAA,IAAI,MAAA,CAAO,IAAA,KAAS,YAAA,IAAgB,MAAA,CAAO,kBAAkB,OAAA,EAAS;AACpE,QAAA,MAAM,OAAO,MAAA,CAAO,aAAA;AACpB,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,OAAO,MAAM,CAAA;AACrD,QAAA,IAAI,IAAA,IAAQ,MAAA,EAAQ,GAAA,CAAI,IAAI,CAAA,EAAG;AAC7B,UAAA,IAAI,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,MAAA,CAAO,MAAM,CAAA;AAC3C,UAAA,IAAI,CAAC,KAAA,EAAO;AACV,YAAA,KAAA,uBAAY,GAAA,EAAI;AAChB,YAAA,aAAA,CAAc,GAAA,CAAI,MAAA,CAAO,MAAA,EAAQ,KAAK,CAAA;AAAA,UACxC;AACA,UAAA,KAAA,CAAM,IAAI,IAAI,CAAA;AACd,UAAA,IAAI,MAAA,CAAO,OAAO,YAAA,CAAa,IAAI,MAAM,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAG;AAAA,QAC7D;AAAA,MACF;AACA,MAAA,IACE,MAAA,CAAO,kBAAkB,OAAA,IACzB,IAAA,CAAK,qBAAqB,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAO,CAAA,EAC1D;AACA,QAAA,cAAA,GAAiB,IAAA;AAAA,MACnB;AAAA,IACF;AAEA,IAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,aAAA,EAAe;AAC5C,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,eAAA,CAAgB,GAAA,CAAI,OAAO,CAAA;AAC/C,MAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,MAAA,EAAQ,MAAA,CAAO,IAAI,CAAA;AAAA,IAC/C;AACA,IAAA,IAAI,cAAA,EAAgB,IAAA,CAAK,UAAA,CAAW,QAAA,EAAS;AAAA,EAC/C;AAAA,EAGA,oBAAA,CAAqB,MAAA,EAAiB,QAAA,EAAqB,OAAA,EAAiC;AAC1F,IAAA,OAAO,UAAA,CAAW,UAAU,MAAM,CAAA,KAAM,MAAM,UAAA,CAAW,OAAA,EAAS,MAAM,CAAA,KAAM,EAAA;AAAA,EAChF;AAAA,EAGA,mBAAmB,IAAA,EAAgC;AACjD,IAAA,OAAO,KAAK,cAAA,CAAe,IAAA,CAAK,CAAC,OAAA,KAAY,OAAA,CAAQ,SAAS,IAAI,CAAA;AAAA,EACpE;AACF","file":"conditional_fields_controller.js","sourcesContent":["/**\n * Resolves which of a controller's elements owns a node.\n *\n * A delegated listener hears events from a whole subtree, so the handler's first\n * job is almost always the same question: which item, handle, or control does\n * this `event.target` belong to? The same question comes up for a\n * `MutationRecord.target`, for `document.activeElement`, and for a\n * `relatedTarget` on the way out of a hover region.\n *\n * The answer is `Node.contains()`, which is **inclusive** — an element contains\n * itself — so testing the candidate for identity as well would be redundant.\n *\n * **The guard is what makes this safe to call with a raw event target.**\n * `event.target` is typed `EventTarget | null`, and `contains()` takes a `Node?`:\n * browsers throw `TypeError` for anything else, and `window` — the everyday\n * `EventTarget` that is not a `Node` — is what an event dispatched at it carries.\n * Narrowing here means a caller never has to cast, and the rule cannot drift\n * between the places that ask the question.\n *\n * Scope stays with the caller. These helpers say *which candidate owns the node*,\n * not *whether the node belongs to this controller at all* — a component with\n * nested instances of itself decides that first (by comparing the closest\n * annotated ancestor) and passes the candidates it owns.\n */\n\n/**\n * Index in `candidates` of the first one that is, or contains, `node`.\n *\n * `-1` when none does, when `node` is absent, and when it is an `EventTarget`\n * that is not a `Node`. Candidates are tested in array order, so a nested pair\n * resolves to whichever the caller listed first.\n */\nexport function ownerIndex<T extends Element>(\n  candidates: readonly T[],\n  node: EventTarget | null | undefined,\n): number {\n  if (!(node instanceof Node)) return -1;\n  return candidates.findIndex((candidate) => candidate.contains(node));\n}\n\n/**\n * The first candidate that is, or contains, `node`; `null` when none does.\n *\n * A miss indexes the array at `-1`, which reads as `undefined` and lands on the\n * same `null` the absent cases produce.\n */\nexport function ownerOf<T extends Element>(\n  candidates: readonly T[],\n  node: EventTarget | null | undefined,\n): T | null {\n  return candidates[ownerIndex(candidates, node)] ?? null;\n}\n","/**\n * Whether a disabled `<fieldset>` ancestor actually reaches `control`.\n *\n * HTML exempts the contents of a fieldset's **first direct-child `<legend>`**, and\n * the exemption is per fieldset — a control legal in one legend can still be\n * disabled by a second, outer fieldset, so the walk continues upward.\n *\n * Exported on its own for callers that need the disabled-inheritance rule without\n * the rest of {@link canTakeFocus} — a control's availability check, or a `hidden`\n * walk bounded at a widget root, which is a different rule to compose with.\n */\nexport function inheritsFieldsetDisabled(control: HTMLElement): boolean {\n  let fieldset: Element | null = control.closest(\"fieldset[disabled]\");\n  while (fieldset) {\n    const legend = Array.from(fieldset.children).find((child) => child.tagName === \"LEGEND\");\n    if (!legend?.contains(control)) return true;\n    fieldset = fieldset.parentElement?.closest(\"fieldset[disabled]\") ?? null;\n  }\n  return false;\n}\n\n/**\n * Whether the engine reports `element` assigned to no slot of the open shadow root its parent\n * hosts: such an element is not in the flat tree, so it and what it holds are rendered nowhere\n * and cannot take focus.\n */\nfunction unslotted(element: Element): boolean {\n  return element.assignedSlot === null && element.parentElement?.shadowRoot != null;\n}\n\n/**\n * The parent of `element` in the flat tree: the slot it is assigned to, its parent element,\n * or the host of the shadow root it is a child of; `null` at the top of the document or of a\n * detached tree, and for an element the engine assigns to no slot of the open shadow root its\n * parent hosts, which is outside the flat tree. A closed shadow root does not report its slots,\n * so an element assigned to one climbs to the host.\n */\nexport function flatTreeParent(element: Element): Element | null {\n  if (unslotted(element)) return null;\n  const parent = element.assignedSlot ?? element.parentNode;\n  if (parent instanceof ShadowRoot) return parent.host;\n  return parent instanceof Element ? parent : null;\n}\n\n/** Whether `element` is `ancestor` or one of its descendants in the flat tree. */\nexport function flatTreeContains(ancestor: Element, element: Element | null): boolean {\n  for (let node = element; node; node = flatTreeParent(node)) {\n    if (node === ancestor) return true;\n  }\n  return false;\n}\n\n/** The nearest of `element` and its flat-tree ancestors that matches `selector`, or `null`. */\nexport function closestInFlatTree(element: Element, selector: string): Element | null {\n  for (let node: Element | null = element; node; node = flatTreeParent(node)) {\n    if (node.matches(selector)) return node;\n  }\n  return null;\n}\n\n/**\n * The children of `element` in the flat tree: its open shadow root's children, a slot's\n * assigned elements (its own children when nothing is assigned to it), or its children.\n */\nexport function flatTreeChildren(element: Element): Element[] {\n  return ownedScope(element) ?? Array.from(element.children);\n}\n\n/**\n * Whether an element can actually take focus, checked **before** `focus()` runs.\n *\n * A controller that must move focus off a control it is about to disable or hide\n * picks a destination and calls `focus()` on it. If that destination cannot take\n * focus, the call **fails silently**: `hidden` and natively `disabled` elements\n * swallow it, so the caret stays in the subtree that is disappearing and lands on\n * `<body>` a frame later — the exact outcome the rescue exists to prevent, minus\n * any signal that it happened.\n *\n * Testing after the fact is the obvious alternative and is deliberately not the\n * rule. Reading `document.activeElement` back only works in a real browser, and\n * looping over candidates that way performs a real focus move per failure —\n * observable to assistive technology. Checking first costs nothing and catches\n * the cases that actually occur.\n *\n * **`aria-disabled` is not disqualifying.** It is the attribute an author uses\n * for a control that must stay *discoverable*, and the roving contract keeps\n * such items reachable. Only the conditions that make the platform refuse\n * focus are checked: `hidden` / `inert` on the element or a flat-tree ancestor\n * (the host of an open shadow root it sits in, the slot it is assigned to), the\n * element or an ancestor left out of the flat tree (one the engine assigns to no\n * slot of the open shadow root its parent hosts), `input[type=\"hidden\"]`, the\n * native `disabled` property, and `disabled` inherited from an ancestor\n * `fieldset`. CSS-only invisibility is handled by {@link isRenderedForFocus}\n * when a consumer needs sequential-focus semantics.\n *\n * Reading `:disabled` instead of walking the fieldset chain would be shorter, but\n * that pseudo-class is not evaluated consistently outside real browsers and this\n * has to be right headlessly too. happy-dom in particular focuses a `<button>`\n * inside a disabled fieldset where a real engine refuses, so the inheritance is\n * spelled out rather than delegated.\n *\n * What a consumer does when nothing survives is its own call: some fall back to\n * their landmark, while a widget whose caret already sits somewhere legitimate\n * refuses the move outright rather than relocating it.\n *\n * @example\n * ```ts\n * const target = candidates.find(canTakeFocus);\n * if (target) target.focus();\n * else {\n *   this.#tabindex.lend(this.element); // nothing left: fall back to the landmark\n *   this.element.focus();\n * }\n * ```\n *\n * @param element - the candidate destination\n */\nexport function canTakeFocus(element: HTMLElement): boolean {\n  for (let node: Element | null = element; node; node = flatTreeParent(node)) {\n    if (unslotted(node) || node.matches(\"[hidden], [inert]\")) return false;\n  }\n  if (element instanceof HTMLInputElement && element.type === \"hidden\") return false;\n  if (!(\"disabled\" in element)) return true;\n  if ((element as HTMLElement & { disabled: boolean }).disabled) return false;\n  return !inheritsFieldsetDisabled(element);\n}\n\n/** Elements whose semantics or authored attributes can place them in sequential focus order. */\nexport const TAB_STOP_CANDIDATE_SELECTOR = [\n  \"a[href]\",\n  \"area[href]\",\n  \"button\",\n  \"input\",\n  \"select\",\n  \"textarea\",\n  \"summary\",\n  \"iframe\",\n  \"audio[controls]\",\n  \"video[controls]\",\n  \"[tabindex]\",\n  \"[contenteditable]\",\n].join(\",\");\n\n/** Optional browser visibility API used to exclude CSS-hidden candidates. */\ninterface VisibilityCheckable {\n  checkVisibility?: (options?: { visibilityProperty?: boolean }) => boolean;\n}\n\n/** Whether CSS visibility allows an otherwise eligible element to participate in focus order. */\nexport function isRenderedForFocus(element: HTMLElement): boolean {\n  const check = (element as HTMLElement & VisibilityCheckable).checkVisibility;\n  return typeof check === \"function\" ? check.call(element, { visibilityProperty: true }) : true;\n}\n\n/** Parses an authored `tabindex`; invalid syntax has no explicit focus-order meaning. */\nfunction authoredTabindex(element: Element): number | null {\n  const value = element.getAttribute(\"tabindex\");\n  if (value === null || !/^[+-]?\\d+$/.test(value.trim())) return null;\n  return Number(value);\n}\n\n/** Whether the element's native semantics place it in sequential focus order. */\nfunction hasNativeTabStop(element: HTMLElement): boolean {\n  if (element instanceof HTMLAnchorElement || element instanceof HTMLAreaElement) {\n    return element.hasAttribute(\"href\");\n  }\n  if (\n    element instanceof HTMLButtonElement ||\n    element instanceof HTMLSelectElement ||\n    element instanceof HTMLTextAreaElement\n  ) {\n    return true;\n  }\n  if (element instanceof HTMLInputElement) return element.type !== \"hidden\";\n  if (element instanceof HTMLIFrameElement) return true;\n  if (element.tagName === \"AUDIO\" || element.tagName === \"VIDEO\") {\n    return element.hasAttribute(\"controls\");\n  }\n  if (element instanceof HTMLElement && element.tagName === \"SUMMARY\") {\n    const details = element.parentElement;\n    return (\n      details instanceof HTMLDetailsElement &&\n      Array.from(details.children).find((child) => child.tagName === \"SUMMARY\") === element\n    );\n  }\n  return false;\n}\n\n/** Whether an explicit `contenteditable` value creates an editable tab stop. */\nfunction hasEditableTabStop(element: HTMLElement): boolean {\n  const value = element.getAttribute(\"contenteditable\")?.toLowerCase();\n  return value === \"\" || value === \"true\" || value === \"plaintext-only\";\n}\n\n/**\n * Whether an element is a usable sequential Tab stop right now.\n *\n * Native semantics, authored `tabindex`, editable hosts, inherited disabled state,\n * HTML `hidden`/`inert`, and CSS visibility are evaluated together. `aria-disabled`\n * remains focusable because it communicates unavailability without removing the\n * control from discovery order.\n */\nexport function isTabStop(element: HTMLElement): boolean {\n  if (!canTakeFocus(element) || !isRenderedForFocus(element)) return false;\n\n  const tabindex = authoredTabindex(element);\n  if (tabindex !== null) return tabindex >= 0;\n  return hasNativeTabStop(element) || hasEditableTabStop(element);\n}\n\n/** Returns every usable sequential Tab stop below `root` in document order. */\nexport function tabStopsWithin(root: ParentNode): HTMLElement[] {\n  return Array.from(root.querySelectorAll<HTMLElement>(TAB_STOP_CANDIDATE_SELECTOR)).filter(\n    isTabStop,\n  );\n}\n\n/** Returns the first usable sequential Tab stop below `root`, if one exists. */\nexport function firstTabStop(root: ParentNode): HTMLElement | null {\n  for (const candidate of root.querySelectorAll<HTMLElement>(TAB_STOP_CANDIDATE_SELECTOR)) {\n    if (isTabStop(candidate)) return candidate;\n  }\n  return null;\n}\n\n/** Whether `root` contains at least one usable sequential Tab stop. */\nexport function hasTabStop(root: ParentNode): boolean {\n  return firstTabStop(root) !== null;\n}\n\n/** An element sequential focus navigation can stop on. */\nexport type TabStopElement = HTMLElement | SVGElement;\n\n/** Whether the element is a radio button. */\nfunction isRadio(element: Element | null): element is HTMLInputElement {\n  return element instanceof HTMLInputElement && element.type === \"radio\";\n}\n\n/**\n * Whether two radios form one group: the same non-empty `name`, the same form owner and\n * the same tree. A radio without a name is a group of its own.\n */\nfunction sameRadioGroup(a: HTMLInputElement, b: HTMLInputElement): boolean {\n  return (\n    a.name !== \"\" && a.name === b.name && a.form === b.form && a.getRootNode() === b.getRootNode()\n  );\n}\n\n/**\n * Whether the element is part of editable content: the nearest ancestor that sets a valid\n * `contenteditable` decides. `false` ends the editable region (a non-editable island\n * inside an editor); an invalid value inherits from further up.\n */\nfunction isInEditableContent(element: Element): boolean {\n  for (let node = element.parentElement; node; node = node.parentElement) {\n    if (node.getAttribute(\"contenteditable\")?.toLowerCase() === \"false\") return false;\n    if (hasEditableTabStop(node)) return true;\n  }\n  return false;\n}\n\n/** The XLink namespace, where an SVG link may carry its `href`. */\nconst XLINK_NAMESPACE = \"http://www.w3.org/1999/xlink\";\n\n/** Whether the element is an SVG link: an SVG `a` with `href` or `xlink:href`. */\nfunction isSvgLink(element: Element): boolean {\n  return (\n    element instanceof SVGElement &&\n    element.localName === \"a\" &&\n    (element.hasAttribute(\"href\") || element.hasAttributeNS(XLINK_NAMESPACE, \"href\"))\n  );\n}\n\n/**\n * Whether an image-map area has a rendered image: an `img` in the area's tree whose\n * `usemap` names the area's map (by `name`, or by `id` without one) and that is rendered.\n * The area has no box of its own for {@link isRenderedForFocus} to check.\n */\nfunction hasRenderedImage(area: HTMLAreaElement): boolean {\n  const map = area.closest(\"map\");\n  const key = map?.name || map?.id;\n  if (!map || !key) return false;\n  const root = map.getRootNode() as Document | ShadowRoot;\n  return Array.from(root.querySelectorAll<HTMLElement>(\"img[usemap]\")).some(\n    (image) => image.getAttribute(\"usemap\") === `#${key}` && isRenderedForFocus(image),\n  );\n}\n\n/** Whether the element can take focus and has no negative `tabindex`. */\nfunction isFocusableInOrder(element: TabStopElement): boolean {\n  const tabindex = authoredTabindex(element);\n  return (tabindex === null || tabindex >= 0) && canTakeFocus(element as HTMLElement);\n}\n\n/**\n * The engine's verdict for the stops {@link isTabStop} does not judge the way sequential\n * navigation does, or `null` for every other element: an image-map area with an `href` or\n * its own `tabindex` stops while an image that uses its map is rendered; an object stops\n * while it holds a nested document, as an iframe does; an SVG link stops while it is\n * rendered. Each also needs to take focus and not be taken out of the order with a\n * negative `tabindex`.\n */\nfunction extraStop(element: TabStopElement): boolean | null {\n  if (element instanceof HTMLAreaElement) {\n    const focusable = element.hasAttribute(\"href\") || authoredTabindex(element) !== null;\n    return focusable && isFocusableInOrder(element) && hasRenderedImage(element);\n  }\n  if (element instanceof HTMLObjectElement) {\n    return (\n      isFocusableInOrder(element) && isRenderedForFocus(element) && element.contentWindow !== null\n    );\n  }\n  if (isSvgLink(element))\n    return isFocusableInOrder(element) && isRenderedForFocus(element as HTMLElement);\n  return null;\n}\n\n/**\n * Whether sequential navigation stops on the element: a usable Tab stop\n * ({@link isTabStop}), or one of the stops `extraStop` judges, except a link inside\n * editable content without a `tabindex` of its own, which the engine leaves to editing.\n * Other controls inside an editing host, and the host itself, stay stops.\n */\nfunction isSequentialStop(element: TabStopElement): boolean {\n  const stop =\n    extraStop(element) ??\n    (element.matches(TAB_STOP_CANDIDATE_SELECTOR) && isTabStop(element as HTMLElement));\n  if (!stop) return false;\n  const link =\n    element instanceof HTMLAnchorElement ||\n    element instanceof HTMLAreaElement ||\n    isSvgLink(element);\n  return !(link && authoredTabindex(element) === null && isInEditableContent(element));\n}\n\n/**\n * The elements of the focus navigation scope `element` owns: its open shadow root's\n * children, or a slot's assigned elements (its fallback content when nothing is\n * assigned). `null` when it owns no scope. A closed shadow root cannot be read, so its\n * host owns none.\n */\nfunction ownedScope(element: Element): Element[] | null {\n  if (element.shadowRoot) return Array.from(element.shadowRoot.children);\n  if (element instanceof HTMLSlotElement) {\n    const assigned = element.assignedElements();\n    return assigned.length > 0 ? assigned : Array.from(element.children);\n  }\n  return null;\n}\n\n/** One member of a focus navigation scope: its tabindex and the stops it contributes. */\ninterface ScopeEntry {\n  readonly tabindex: number;\n  readonly stops: TabStopElement[];\n}\n\n/** What a walk of the order records besides the order itself. */\ninterface OrderWalk {\n  /** The element a move starts from. */\n  readonly from: Element | null;\n  /** Every stop, in flat-tree order. */\n  readonly tree: TabStopElement[];\n  /** How many entries of {@link OrderWalk.tree} come before `from`; `-1` until the walk meets it. */\n  fromAt: number;\n}\n\n/**\n * Orders one focus navigation scope the way HTML's sequential navigation does: members\n * with a positive `tabindex` first, ascending, ties in tree order, then the rest in tree\n * order. A member that owns a scope (a shadow host, a slot) is followed by that scope's\n * own order; one taken out of the order with a negative `tabindex` takes its scope with it.\n */\nfunction orderScope(elements: Element[], walk: OrderWalk): TabStopElement[] {\n  const entries: ScopeEntry[] = [];\n  const visit = (element: Element): void => {\n    if (element === walk.from) walk.fromAt = walk.tree.length;\n    const tabindex = authoredTabindex(element) ?? 0;\n    const stop =\n      (element instanceof HTMLElement || element instanceof SVGElement) && isSequentialStop(element)\n        ? element\n        : null;\n    if (stop) walk.tree.push(stop);\n    const owned = ownedScope(element);\n    if (owned) {\n      if (tabindex >= 0) {\n        entries.push({ tabindex, stops: [...(stop ? [stop] : []), ...orderScope(owned, walk)] });\n      }\n      return;\n    }\n    if (stop) entries.push({ tabindex, stops: [stop] });\n    for (const child of Array.from(element.children)) visit(child);\n  };\n  for (const element of elements) visit(element);\n  const positive = entries.filter((entry) => entry.tabindex > 0);\n  positive.sort((a, b) => a.tabindex - b.tabindex);\n  const rest = entries.filter((entry) => entry.tabindex === 0);\n  return [...positive, ...rest].flatMap((entry) => entry.stops);\n}\n\n/**\n * Whether a candidate passes the radio-group rule the engine applies: a checked radio\n * among the stops always does; an unchecked one only as the first radio of a group with\n * no checked stop, and not while focus is on a radio of that group. `tree` is the walk's\n * stops in flat-tree order, so a group is counted within the walked root only.\n */\nfunction passesRadioRule(\n  element: TabStopElement,\n  tree: TabStopElement[],\n  focusedRadio: HTMLInputElement | null,\n): boolean {\n  if (!isRadio(element) || element.checked) return true;\n  const group = tree.filter(\n    (stop): stop is HTMLInputElement =>\n      stop === element || (isRadio(stop) && sameRadioGroup(stop, element)),\n  );\n  if (group.some((radio) => radio.checked)) return false;\n  if (group[0] !== element) return false;\n  return focusedRadio === null || !sameRadioGroup(focusedRadio, element);\n}\n\n/**\n * The index in `order` a move from the walk's `from` visits first. A start the walk did\n * not meet is outside: the move enters at the first stop, or the last going backward. A\n * start that is a stop moves one place along the order. Any other start (the root, an\n * element with a negative `tabindex`) moves to the nearest stop after it in tree order,\n * or before it going backward, and wraps when there is none.\n */\nfunction startIndex(\n  order: TabStopElement[],\n  walk: OrderWalk,\n  backward: boolean,\n  isStop: (element: TabStopElement) => boolean,\n): number {\n  if (walk.fromAt < 0) return backward ? order.length - 1 : 0;\n  const at = order.indexOf(walk.from as TabStopElement);\n  if (at >= 0) return backward ? at - 1 : at + 1;\n  const neighbour = backward\n    ? walk.tree.slice(0, walk.fromAt).reverse().find(isStop)\n    : walk.tree.slice(walk.fromAt).find(isStop);\n  if (neighbour) return order.indexOf(neighbour);\n  return backward ? order.length - 1 : 0;\n}\n\n/**\n * The stops below `root` in the order a sequential move from `from` visits them: the\n * next stop first (the previous one when `backward`), wrapping at the ends, with `from`\n * itself left out. Without a `from` — or with one outside `root` — the list starts at the\n * first stop, or at the last one when `backward`.\n *\n * The order is HTML's sequential navigation order within `root`: positive `tabindex`\n * first, ascending, then `tabindex=\"0\"` and native stops in tree order. Open shadow roots\n * are walked in flat-tree order, slots expanded, each scope ordered on its own; a closed\n * shadow root is not read. A radio group, counted within `root`, stops once: on its\n * checked radio when that radio can take focus, even with focus elsewhere in the group,\n * and otherwise on its first radio that can, unless focus is already in the group.\n * A link inside editable content without its own `tabindex` is not a stop. Every stop\n * also passes its applicable focusability and rendering checks.\n *\n * @param root - The element whose descendants are ordered; it is not a stop itself.\n * @param from - Where the move starts, usually {@link deepActiveElement}.\n * @param backward - Whether the move goes backward (`Shift+Tab`).\n */\nexport function sequentialTabStops(\n  root: Element,\n  from: Element | null = null,\n  backward = false,\n): TabStopElement[] {\n  const walk: OrderWalk = { from, tree: [], fromAt: from === root ? 0 : -1 };\n  const order = orderScope(ownedScope(root) ?? Array.from(root.children), walk);\n  const focusedRadio = walk.fromAt >= 0 && isRadio(from) ? from : null;\n  const isStop = (element: TabStopElement): boolean =>\n    passesRadioRule(element, walk.tree, focusedRadio);\n  const start = startIndex(order, walk, backward, isStop);\n  const visited = backward\n    ? [...order.slice(0, start + 1).reverse(), ...order.slice(start + 1).reverse()]\n    : [...order.slice(start), ...order.slice(0, start)];\n  return visited.filter((element) => element !== from && isStop(element));\n}\n\n/**\n * The element that holds focus in `ownerDocument`, looking through open shadow roots:\n * `document.activeElement` stops at a shadow host. A closed shadow root cannot be read,\n * so focus inside one reads as its host.\n */\nexport function deepActiveElement(ownerDocument: Document): Element | null {\n  let active = ownerDocument.activeElement;\n  while (active?.shadowRoot?.activeElement) active = active.shadowRoot.activeElement;\n  return active;\n}\n","/**\n * Runs a controller's reconciliation pass after a native form reset has\n * restored the form's own controls.\n *\n * **A microtask alone is not \"after the reset\", and the reason is where the\n * dispatch came from.** `form.reset()` fires the event and restores the\n * controls inside one script frame, so a microtask queued from a listener lands\n * after both. A reset the user triggers — activating a `reset` button — is\n * dispatched by the browser with an empty script stack, so the microtask\n * checkpoint runs the moment the listener returns: still inside the dispatch,\n * before the controls are restored and before a later listener has had its\n * chance to cancel. Reconciling there reads the pre-reset values and treats a\n * cancelled reset as a real one.\n *\n * The event itself tells the two origins apart. `eventPhase` returns to\n * `Event.NONE` at the end of dispatch, so a microtask that sees `NONE` is\n * already past the default action and settles on the spot — that is the\n * scripted path, and its timing is exactly a microtask. A microtask\n * that still sees a dispatch phase is the browser-driven path and settles on\n * the next animation frame instead: the default action completes before that\n * frame, and `defaultPrevented` has reached its final value. A frame is only\n * ever reached from a real user interaction, which requires a rendered\n * document, so the frame cannot starve.\n *\n * Pending frames are held per handle rather than collapsed into one slot: a set\n * needs no branch to stay accurate, and every handle in it is cancellable at\n * teardown.\n *\n * Scope is the timing and the ownership test only. *What* to reconcile — an\n * aggregate, a visibility pass, a re-read of every field — stays in the\n * controller, because no two consumers answer it the same way. Ownership stays\n * there too: a control associated through `form=` is reached by the consumer's\n * own `control.form` read.\n *\n * @example\n * ```ts\n * readonly #formReset = new FormResetWatcher(\n *   (form) => this.fieldTargets.some((field) => field.form === form),\n *   () => this.#reconcile.schedule(),\n * );\n *\n * connect()    { this.#formReset.observe(); }\n * disconnect() { this.#formReset.disconnect(); }\n * ```\n */\nexport class FormResetWatcher {\n  readonly #owns: (form: HTMLFormElement) => boolean;\n  readonly #onReset: () => void;\n  readonly #frames = new Set<number>();\n  #generation = 0;\n\n  /**\n   * @param owns - whether `form` owns a control this controller derives from.\n   * @param onReset - the reconciliation pass, run once per honoured reset.\n   */\n  constructor(owns: (form: HTMLFormElement) => boolean, onReset: () => void) {\n    this.#owns = owns;\n    this.#onReset = onReset;\n  }\n\n  /** Subscribes to `reset` at the document; call from `connect()`. Idempotent. */\n  observe(): void {\n    document.addEventListener(\"reset\", this.#handleReset, true);\n  }\n\n  /** Unsubscribes and drops every pending pass; call from `disconnect()`. */\n  disconnect(): void {\n    document.removeEventListener(\"reset\", this.#handleReset, true);\n    this.#generation += 1;\n    for (const frame of this.#frames) cancelAnimationFrame(frame);\n    this.#frames.clear();\n  }\n\n  readonly #handleReset = (event: Event): void => {\n    const form = event.target;\n    if (!(form instanceof HTMLFormElement) || !this.#owns(form)) return;\n    const generation = this.#generation;\n    queueMicrotask(() => {\n      // A pass queued before teardown must not reach a disconnected controller.\n      if (generation !== this.#generation) return;\n      if (event.eventPhase === Event.NONE) {\n        this.#settle(event);\n        return;\n      }\n      const frame = requestAnimationFrame(() => {\n        this.#frames.delete(frame);\n        this.#settle(event);\n      });\n      this.#frames.add(frame);\n    });\n  };\n\n  /** Runs the pass unless a listener cancelled the reset before it landed. */\n  #settle(event: Event): void {\n    if (!event.defaultPrevented) this.#onReset();\n  }\n}\n","/**\n * Owns every listener a controller attaches for one connected lifetime and\n * releases them together, so an event name is spelled once and the release\n * cannot drift from the registration.\n *\n * Detaching by hand repeats three things at the release site — the type, the\n * handler reference and the capture flag — and any one of them drifting leaves\n * a listener alive on an element the controller no longer drives. Aborting the\n * signal a registration was created with releases it whatever it was made of,\n * so the release site names nothing.\n *\n * One set per lifetime, held as a field and never rebuilt. {@link\n * ListenerSet.dispose} is the only thing that closes a generation, and it opens\n * the next one in the same step, so the lifecycle hooks can call `add` and\n * `dispose` in any order any number of times, and no `add` ever meets an\n * already aborted signal — a DOM that registers a listener on such a signal\n * would keep it forever. Rebuilding the set instead would leak:\n * `addEventListener` matches an existing registration on target, type, callback\n * and capture alone, so re-adding the same handler while the first registration\n * is live is discarded, and that live registration keeps the signal it was\n * attached with — a set built by a second `connect()` can never release what it\n * appears to own.\n *\n * Scope is the registration only. Timers, observers, leases and the order they\n * are unwound in stay with the controller, which places `dispose()` in its\n * cleanup sequence. A receiver that changes at runtime (a\n * swapped target) is rebound by calling `dispose()` and then `add()` again from\n * the rebind, not by a second set.\n *\n * The set must own every registration of a tuple it holds: a listener the same\n * target already carries for the same type, callback and capture flag keeps the\n * right to remove it, and this set's `add` for that tuple is discarded. A\n * subscription shared between instances behind a participant count, or one that\n * lives for less than the connection, keeps its own pair of calls.\n *\n * @example\n * ```ts\n * readonly #listeners = new ListenerSet();\n *\n * connect(): void {\n *   this.#listeners.add(this.element, \"submit\", this.#onNativeSubmit, { capture: true });\n *   this.#listeners.add(this.element, \"turbo:submit-start\", this.#onSubmitStart);\n *   this.#listeners.add(this.element, \"turbo:submit-end\", this.#onSubmitEnd);\n * }\n *\n * disconnect(): void {\n *   this.#listeners.dispose();\n * }\n * ```\n */\nexport class ListenerSet {\n  /** The generation every `add` joins until the next `dispose()`. */\n  #abort = new AbortController();\n\n  /**\n   * Attaches `handler` to the open generation, exactly as the caller spelled it.\n   *\n   * The set supplies the signal, so `options` carries everything else the DOM\n   * accepts — `capture` included, which has to match at release time and no\n   * longer has a second place to drift from.\n   */\n  add(\n    target: EventTarget,\n    type: string,\n    handler: EventListener,\n    options?: Omit<AddEventListenerOptions, \"signal\">,\n  ): void {\n    target.addEventListener(type, handler, { ...options, signal: this.#abort.signal });\n  }\n\n  /**\n   * Releases every listener of the open generation, synchronously, and opens the\n   * next one. Idempotent, and safe before anything has been added.\n   */\n  dispose(): void {\n    this.#abort.abort();\n    this.#abort = new AbortController();\n  }\n}\n","/**\n * Collapses many Stimulus lifecycle callbacks from one DOM mutation into a\n * single pass.\n *\n * Stimulus fires `<name>TargetConnected` / `Disconnected` once per element and\n * `<name>ValueChanged` once per changed attribute. Replacing a list of N options\n * or morphing several render Values therefore delivers N callbacks — but the\n * useful unit of work is \"reconcile against the resulting declarative input\",\n * once, after the batch has settled. Every controller with reconcilable targets\n * or render Values needs the same shape: a `queued` flag plus `queueMicrotask`.\n *\n * **A microtask is the right horizon, and the reason is specific.** Stimulus\n * drives these callbacks from a `MutationObserver`, whose own callback already\n * runs as a microtask with the whole batch in hand; scheduling one more lands\n * after the last sibling callback of that batch and still before paint or any\n * event handler. A timer would be later than it needs to be, and reconciling\n * synchronously would run once per element against a half-applied DOM.\n *\n * **The two guards are not the same guard.** Scheduling is refused before the\n * controller connects, and running is refused after it disconnects:\n *\n * - **Before `connect()`** — Stimulus delivers initial target and Value callbacks\n *   ahead of `connect()`. Reconciling there would compute output against a\n *   controller whose own state has not been initialised, and `connect()` is\n *   about to do a full pass anyway.\n * - **After `disconnect()`** — Stimulus fires a callback for **every** target\n *   during teardown, and a microtask queued just before it would otherwise run\n *   against a detached tree. {@link MicrotaskCoalescer.cancel} exists for the\n *   teardown path to drop the pending pass outright.\n *\n * Both guards are part of one contract here rather than something each consumer\n * has to remember separately.\n *\n * Scope is the scheduling only. *What* to reconcile — keep the surviving active\n * option, fall back to the next / previous / first visible one, rebuild derived\n * chips or hidden fields — stays in the controller, because no two consumers\n * answer it the same way.\n *\n * @example\n * ```ts\n * readonly #reconcile = new MicrotaskCoalescer(() => this.#reconcileOptions());\n *\n * connect()    { this.#reconcile.activate(); }\n * disconnect() { this.#reconcile.cancel(); }\n *\n * optionTargetConnected()    { this.#reconcile.schedule(); }\n * optionTargetDisconnected() { this.#reconcile.schedule(); }\n * ```\n */\nexport class MicrotaskCoalescer {\n  readonly #run: () => void;\n  #queued = false;\n  #active = false;\n  #generation = 0;\n\n  /** @param run - the single reconciliation pass, invoked at most once per batch. */\n  constructor(run: () => void) {\n    this.#run = run;\n  }\n\n  /** Opens the window in which {@link schedule} is honoured; call from `connect()`. */\n  activate(): void {\n    this.#active = true;\n  }\n\n  /** Closes the window and drops any pending pass; call from `disconnect()`. */\n  cancel(): void {\n    this.#active = false;\n    this.#queued = false;\n    this.#generation += 1;\n  }\n\n  /** Requests one pass after the batch settles. Idempotent; inert outside the window. */\n  schedule(): void {\n    if (!this.#active || this.#queued) return;\n    this.#queued = true;\n    const generation = this.#generation;\n    queueMicrotask(() => {\n      // A cancelled callback must not consume a pass queued after reconnect.\n      if (generation !== this.#generation || !this.#queued || !this.#active) return;\n      this.#queued = false;\n      this.#run();\n    });\n  }\n}\n","import { ListenerSet } from \"./listener_set\";\nimport { MicrotaskCoalescer } from \"./microtask_coalescer\";\n\n/**\n * Coalesces retained-element morphs and explicit lifecycle requests into one pass.\n *\n * Observe the controller's element after its initial state is settled. Morphs on\n * that element and bubbling morphs on its descendants share the same microtask\n * as {@link schedule}. The callback repairs derived output; the controller owns\n * any logical transition reporting. {@link disconnect} releases the listener and\n * cancels pending work, including work from an earlier connected lifetime.\n */\nexport class MorphRenderWatcher {\n  readonly #listeners = new ListenerSet();\n  readonly #pass: MicrotaskCoalescer;\n  #element: Element | null = null;\n  readonly #onMorph = (): void => this.#pass.schedule();\n\n  /** @param run - the single pass that repairs the settled controller's output. */\n  constructor(run: () => void) {\n    this.#pass = new MicrotaskCoalescer(run);\n  }\n\n  /** Opens observation; observing the same element again preserves queued work. */\n  observe(element: Element): void {\n    if (this.#element === element) return;\n    this.disconnect();\n    this.#element = element;\n    this.#pass.activate();\n    this.#listeners.add(element, \"turbo:morph-element\", this.#onMorph);\n  }\n\n  /** Requests one pass; requests outside an observed lifetime are ignored. */\n  schedule(): void {\n    this.#pass.schedule();\n  }\n\n  /** Releases observation and pending work synchronously; safe to repeat. */\n  disconnect(): void {\n    this.#listeners.dispose();\n    this.#pass.cancel();\n    this.#element = null;\n  }\n}\n","/** Queries physical descendants and nested open shadow trees, including `root`'s own. */\nexport function queryOpenDescendants<T extends Element = Element>(\n  root: ParentNode,\n  selector: string,\n): T[] {\n  const matches: T[] = [];\n  const roots: ParentNode[] = [root];\n  for (const scope of roots) {\n    matches.push(...scope.querySelectorAll<T>(selector));\n    if (scope.nodeType === Node.ELEMENT_NODE) {\n      const shadow = (scope as Element).shadowRoot;\n      if (shadow) roots.push(shadow);\n    }\n    for (const element of scope.querySelectorAll(\"*\")) {\n      if (element.shadowRoot) roots.push(element.shadowRoot);\n    }\n  }\n  return matches;\n}\n","/**\n * One registry per page for every copy of the library.\n *\n * Each `stimeo-ui/controllers/*` file, and each opt-in entry, is built on its own and carries\n * its own copy of every utility it uses, so a page that imports controllers one by one, or one\n * of them next to the barrel, evaluates a utility several times. A registry that coordinates\n * instances of different controllers — the stacks of leased values, the loans of a\n * `tabindex`, the Escape layers, the focus traps — must not be split by that: a dialog inside\n * a drawer, or a character counter and a form field on one input, coordinate whichever files\n * they came from. So such a registry lives once on `globalThis`, under a `Symbol.for` key the\n * copies agree on, and the first copy to ask for it creates it.\n *\n * The key names the registry and the version of its shape\n * (`stimeo-ui.<utility>.registry.v<n>`). Copies whose registries have the same shape share\n * one; a release that changes the shape changes the version, so a copy of another release\n * keeps a registry of its own instead of reading entries it does not understand — the two\n * then coordinate within each release only. An entry another copy put in a registry is read\n * through its fields alone, never through `#private` members, which belong to the class of\n * the copy that created it.\n */\n\n/**\n * The registry stored under `key`, created by `create` on first use.\n *\n * @param key - `stimeo-ui.<utility>.registry.v<n>`: the version is that of the shape `create`\n *   returns.\n * @param create - Builds the empty registry.\n */\nexport function sharedRegistry<T extends object>(key: string, create: () => T): T {\n  const symbol = Symbol.for(key);\n  const scope = globalThis as unknown as Record<symbol, T | undefined>;\n  const existing = scope[symbol];\n  if (existing !== undefined) return existing;\n  const registry = create();\n  Object.defineProperty(globalThis, symbol, { value: registry });\n  return registry;\n}\n","import { queryOpenDescendants } from \"./query_open_descendants\";\nimport { sharedRegistry } from \"./shared_registry\";\n\n/** One loan's hold on one element's `tabindex`, in the stack every loan of it shares. */\ninterface LoanHold {\n  /** The loan holding it; `null` for a loan read from a copy's record until a loan takes it. */\n  loan: object | null;\n  readonly record: string;\n  readonly value: string;\n  /** Whether it hands back the value of the hold beneath it; otherwise no `tabindex`. */\n  linked: boolean;\n}\n\n/** The loans on each element, bottom first, and every loan's record name. */\ninterface TabindexLoanRegistry {\n  readonly stacks: WeakMap<HTMLElement, LoanHold[]>;\n  readonly names: Set<string>;\n}\n\n/**\n * Shared bookkeeping for a `tabindex` a controller lends an element temporarily.\n *\n * A controller that must move focus somewhere the author never made focusable\n * (a landmark root, a scroll destination) reaches for the same trick: add a\n * `tabindex` just-in-time and hand it back once it is no longer needed. The\n * borrow is the easy half; the return is what the two conditions below are for.\n *\n * **Returning needs two conditions, not one.** Owning the borrow is not enough:\n * the attribute must also still hold the value this instance wrote. A consumer\n * that changed it afterwards — `tabindex=\"0\"` to make the root its own Tab stop\n * — owns it now, and removing it there silently discards authored markup. The\n * bookkeeping is dropped either way, since the loan is over regardless of who\n * ends up owning the value.\n *\n * **Never borrow over a value no loan holds.** An element whose `tabindex` no loan\n * holds — the author's, or one the page wrote over the loans — is the author's to\n * control, so there is nothing to lend and nothing to return.\n *\n * **Every loan of an element shares one stack of loans**, whatever its owner and\n * whichever file of the package constructed it (the stacks are one per page). A loan\n * lends over the loans that hold the element while its `tabindex` is theirs — sharing\n * their value, or covering it with its own — and lends again where the page removed\n * the `tabindex`. The `tabindex` is the highest loan's that lends its value: returning\n * that loan gives the element the value of the loan beneath it, or no `tabindex`, and\n * any other return only leaves the stack. So two loans of one value — every focus trap\n * lends its container under one owner — keep it until the last of them returns, and a\n * loan lent after the page removed an earlier one's `tabindex` keeps it when the\n * earlier one returns.\n *\n * **A loan is recorded on the element.** Lending writes\n * `data-<owner>-tabindex-loan` holding the value the owner's topmost loan lends next\n * to the `tabindex`, and the owner's last loan to end removes it. A copy of the\n * element — a page Turbo restores from its cache is one — so tells its owners' loans\n * from an authored `tabindex`: `lend()` takes over a loan its owner recorded, and\n * `reclaim()` gives back one no loan has taken over; the `tabindex` goes with the last\n * of them. A copy keeps no order of its loans beyond putting those of the value it\n * carries on top. Without a record a `tabindex` is the author's. Nothing returns a\n * live loan before Turbo caches the page: `turbo:before-cache` also fires on pages\n * that stay, and the loan is still in use there.\n *\n * The registry is keyed by element, so a controller borrowing on a single\n * element (`this.element`) and one borrowing across a changing set of targets\n * use the same API — the single-element case is a set of one. It holds no\n * opinion about *when* to borrow or where focus goes next; that stays in the\n * controller.\n *\n * **The API is deliberately small.** Each consumer entry includes its own copy\n * of the class, so unused methods still increase its runtime output.\n *\n * @example\n * ```ts\n * readonly #tabindex = new TabindexLoan(\"-1\", this.identifier);\n *\n * connect() {\n *   this.#tabindex.reclaim(this.element);\n * }\n *\n * #rescueFocus() {\n *   this.#tabindex.lend(this.element);\n *   this.element.focus();\n * }\n *\n * disconnect() {\n *   this.#tabindex.returnAll();\n * }\n * ```\n */\nexport class TabindexLoan<T extends HTMLElement = HTMLElement> {\n  /** The loans on each element and the record names, one per page. */\n  static readonly #registry = sharedRegistry(\n    \"stimeo-ui.tabindex-loan.registry.v1\",\n    (): TabindexLoanRegistry => ({ stacks: new WeakMap(), names: new Set() }),\n  );\n  readonly #value: string;\n  readonly #record: string;\n  readonly #lent = new Set<T>();\n\n  /**\n   * @param value - the `tabindex` to lend. `\"-1\"` is programmatically focusable but\n   *   not a Tab stop; `\"0\"` is a real Tab stop, which a scroll region with no\n   *   focusable content of its own needs.\n   * @param owner - Names the record on the element; the controller's identifier.\n   */\n  constructor(value: string, owner: string) {\n    this.#value = value;\n    this.#record = `data-${owner}-tabindex-loan`;\n    TabindexLoan.#registry.names.add(this.#record);\n  }\n\n  /**\n   * Lends `element` the value over the loans holding its `tabindex`, or where the page removed\n   * it; a `tabindex` no loan holds is left alone, and a loan recorded on a copy taken over.\n   */\n  lend(element: T): void {\n    const stack = this.#stack(element);\n    const current = element.getAttribute(\"tabindex\");\n    const held =\n      stack.find((hold) => hold.loan === this) ??\n      stack.find(\n        (hold) => hold.loan === null && hold.record === this.#record && hold.value === this.#value,\n      );\n    const linked = stack.at(-1)?.value === current;\n    if (!held && current !== null && !linked) return;\n    this.#lent.add(element);\n    if (held) held.loan = this;\n    else stack.push({ loan: this, record: this.#record, value: this.#value, linked });\n    this.#mark(element, stack);\n    if (current === null || (!held && current !== this.#value)) {\n      element.setAttribute(\"tabindex\", this.#value);\n    }\n  }\n\n  /** Takes back every loan; one whose value the element shows hands it to the loan beneath. */\n  returnAll(): void {\n    for (const element of this.#lent) {\n      const stack = this.#stack(element);\n      const hold = stack.find((held) => held.loan === this);\n      if (hold) this.#release(element, stack, hold);\n    }\n    this.#lent.clear();\n  }\n\n  /**\n   * Gives back a loan its owner recorded on a restored copy that no loan has taken over, unless\n   * the record holds another value or the element holds focus.\n   */\n  reclaim(element: HTMLElement): void {\n    if (element.getAttribute(this.#record) !== this.#value) return;\n    const stack = this.#stack(element);\n    const hold = stack.find((held) => held.loan === null && held.record === this.#record);\n    if (hold && !element.matches(\":focus\")) this.#release(element, stack, hold);\n  }\n\n  /** Gives back, as {@link reclaim} does, every loan of its owner recorded inside `root`. */\n  reclaimWithin(root: ParentNode): void {\n    for (const element of queryOpenDescendants<HTMLElement>(root, `[${this.#record}]`)) {\n      this.reclaim(element);\n    }\n  }\n\n  /** The element's loans, read from its records the first time. */\n  #stack(element: HTMLElement): LoanHold[] {\n    const stacks = TabindexLoan.#registry.stacks;\n    const stack = stacks.get(element) ?? this.#seed(element);\n    stacks.set(element, stack);\n    return stack;\n  }\n\n  /** The loans a copy's records describe, those of the value it carries on top. */\n  #seed(element: HTMLElement): LoanHold[] {\n    const current = element.getAttribute(\"tabindex\");\n    const holds: LoanHold[] = [];\n    for (const record of TabindexLoan.#registry.names) {\n      const value = element.getAttribute(record);\n      if (value !== null) holds.push({ loan: null, record, value, linked: true });\n    }\n    holds.sort((one, other) => Number(one.value === current) - Number(other.value === current));\n    for (const [index, hold] of holds.entries()) hold.linked = index > 0;\n    return holds;\n  }\n\n  /** Takes `hold` off, handing the value it shows to the loan beneath. */\n  #release(element: HTMLElement, stack: LoanHold[], hold: LoanHold): void {\n    const current = element.getAttribute(\"tabindex\");\n    const index = stack.indexOf(hold);\n    const owns =\n      current === hold.value && !stack.slice(index + 1).some((above) => above.value === current);\n    stack.splice(index, 1);\n    const above = stack[index];\n    if (above) above.linked &&= hold.linked;\n    this.#mark(element, stack);\n    if (!owns) return;\n    const below = hold.linked ? stack[index - 1] : undefined;\n    if (!below) element.removeAttribute(\"tabindex\");\n    else if (below.value !== current) element.setAttribute(\"tabindex\", below.value);\n  }\n\n  /** Leaves each owner's record of the value its topmost loan lends. */\n  #mark(element: HTMLElement, stack: readonly LoanHold[]): void {\n    const records = new Map<string, string | null>([[this.#record, null]]);\n    for (const hold of stack) records.set(hold.record, hold.value);\n    for (const [name, recorded] of records) {\n      if (element.getAttribute(name) === recorded) continue;\n      if (recorded === null) element.removeAttribute(name);\n      else element.setAttribute(name, recorded);\n    }\n  }\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { ownerIndex } from \"../utils/event_owner\";\nimport { canTakeFocus } from \"../utils/focus_candidate\";\nimport { FormResetWatcher } from \"../utils/form_reset_watcher\";\nimport { ListenerSet } from \"../utils/listener_set\";\nimport { MorphRenderWatcher } from \"../utils/morph_render_watcher\";\nimport { TabindexLoan } from \"../utils/tabindex_loan\";\n\n/** Trigger controls whose live state drives region visibility. */\ntype Trigger = HTMLInputElement | HTMLSelectElement;\n/** Form controls inside a region that can be excluded from submission. */\ntype Disableable = HTMLInputElement | HTMLTextAreaElement | HTMLSelectElement | HTMLButtonElement;\n/** One logical visibility transition settled during an evaluation pass. */\ntype RegionTransition = { region: HTMLElement; visible: boolean };\n\n/** Marker on controls this component disabled, so authored disabled state remains untouched. */\nconst DISABLED_MARKER = \"data-conditional-disabled\";\n\n/** Descendant controls whose `disabled` state a region manages. */\nconst CONTROLS = \"input, textarea, select, button\";\n\n/** Retained-DOM inputs and controller outputs that can require reconciliation. */\nconst OBSERVED_ATTRIBUTES = [\n  \"hidden\",\n  \"aria-hidden\",\n  \"data-visible\",\n  DISABLED_MARKER,\n  \"disabled\",\n  \"data-when-checked\",\n  \"data-when-unchecked\",\n  \"data-when-value\",\n  \"checked\",\n  \"selected\",\n  \"value\",\n  \"type\",\n];\n\n/** Attribute value expected after one controller-owned DOM write. */\ntype ExpectedAttribute = string | null;\n\n/**\n * Headless dependent-fields behavior: shows/hides (and enables/disables) regions\n * from trigger control values while keeping submission and accessibility state in\n * sync (no dedicated APG pattern).\n *\n * Markup contract (identifier: `stimeo--conditional-fields`):\n *   <form data-controller=\"stimeo--conditional-fields\">\n *     <input type=\"checkbox\" data-stimeo--conditional-fields-target=\"trigger\">\n *     <fieldset data-stimeo--conditional-fields-target=\"region\" data-when-checked>\n *       …address…\n *     </fieldset>\n *   </form>\n *\n * A region declares one condition: `data-when-checked`, `data-when-unchecked`,\n * or `data-when-value=\"x\"`. The condition is combined across all triggers using\n * `match` (`\"any\"` by default, or `\"all\"`). A region with no condition preserves\n * its authored `hidden` state; a declared condition with no triggers is false.\n *\n * Hidden regions receive `hidden` and `aria-hidden=\"true\"`; visible regions expose\n * `data-visible=\"true\"`. With `disableHidden`, descendant controls are disabled and\n * marked with `data-conditional-disabled=\"true\"`, and only marked controls are\n * re-enabled. Before a focused region is hidden, focus moves to the first trigger\n * that can actually receive it. If every trigger is unsafe — including one inside\n * another region being hidden in the same pass — the controller root temporarily\n * receives `tabindex=\"-1\"` and focus.\n *\n * An element that stops being a region gets back what this controller wrote on\n * it: `aria-hidden`, `data-visible`, the `hidden` a declared condition set, and\n * the marked `disabled` of each control no hidden region still covers. The\n * `hidden` of a region without a condition and every authored `disabled` stay.\n *\n * `change` and `reconcile` dispatch `{ region, visible }`.\n *\n * @remarks\n * Behavior only. Trigger `input` / `change`, dynamic targets and descendants,\n * condition attributes, Values, native form reset, and Turbo retained-element\n * morphs all reconcile against the live DOM. Direct writes to an input's live\n * `checked` / `value` property remain observable only when the caller also emits\n * the corresponding native event. DOM repair is silent. User input or the public\n * action dispatches `stimeo--conditional-fields:change`; a lifecycle, Value,\n * reset, mutation, or morph reconciliation dispatches\n * `stimeo--conditional-fields:reconcile` instead. Initial connection is silent.\n * Every listener, observer, queued pass, and borrowed root `tabindex` is released\n * on `disconnect()`.\n */\nexport class ConditionalFieldsController extends Controller<HTMLElement> {\n  static override targets = [\"trigger\", \"region\"];\n  static override values = {\n    disableHidden: { type: Boolean, default: true },\n    match: { type: String, default: \"any\" },\n  };\n  static actions = [\"evaluate\"] as const;\n  static events = [\"change\", \"reconcile\"] as const;\n\n  declare readonly triggerTargets: Trigger[];\n  declare readonly regionTargets: HTMLElement[];\n\n  declare disableHiddenValue: boolean;\n  declare matchValue: string;\n\n  /** Logical state last committed for each current region; rebuilt on every connect. */\n  #lastVisible = new WeakMap<HTMLElement, boolean>();\n  /** Controller writes awaiting an observer callback, separated from authored morphs. */\n  #internalWrites = new WeakMap<Element, Map<string, ExpectedAttribute>>();\n  #observing = false;\n  /** Elements that left the region set, held until a pass gives back what was written on them. */\n  readonly #departed = new Set<HTMLElement>();\n  /** Regions whose `hidden` this controller set because their declared condition is false. */\n  readonly #concealed = new WeakSet<HTMLElement>();\n\n  /** Coalesces one target/morph/mutation batch into one full DOM reconciliation. */\n  readonly #reconcile = new MorphRenderWatcher(() => this.#reconcileDom());\n  readonly #listeners = new ListenerSet();\n  readonly #formReset = new FormResetWatcher(\n    (form) => this.#hasTriggerOwnedBy(form),\n    () => this.#reconcile.schedule(),\n  );\n  /** Provides the last-resort focus landmark without claiming an authored tabindex. */\n  readonly #rootTabindex = new TabindexLoan<HTMLElement>(\"-1\", this.identifier);\n  /** Watches retained targets and controls whose declarative or reflected state changed. */\n  readonly #observer = new MutationObserver((records) => this.#onMutations(records));\n\n  /** Evaluates only events whose source is one of this instance's live trigger targets. */\n  readonly #onTriggerInput = (event: Event): void => {\n    const target = event.target;\n    const triggers = this.triggerTargets;\n    if (target instanceof Element && triggers.some((trigger) => trigger === target)) {\n      this.#commitChange(triggers);\n    }\n  };\n\n  /** Reflects initial live state and opens every retained-DOM reconciliation path. */\n  override connect(): void {\n    this.#rootTabindex.reclaim(this.element);\n    this.#lastVisible = new WeakMap();\n    this.#internalWrites = new WeakMap();\n    this.#settle();\n    this.#reconcile.observe(this.element);\n    this.#observer.observe(this.element, {\n      attributes: true,\n      attributeFilter: OBSERVED_ATTRIBUTES,\n      childList: true,\n      subtree: true,\n    });\n    this.#observing = true;\n    this.#listeners.add(this.element, \"change\", this.#onTriggerInput);\n    this.#listeners.add(this.element, \"input\", this.#onTriggerInput);\n    this.#formReset.observe();\n  }\n\n  /** Releases all external resources and returns the temporary focus landmark loan. */\n  override disconnect(): void {\n    this.#reconcile.disconnect();\n    this.#observing = false;\n    this.#observer.disconnect();\n    this.#listeners.dispose();\n    this.#formReset.disconnect();\n    this.#rootTabindex.returnAll();\n  }\n\n  /** Reconciles after a trigger target is inserted or restored. */\n  triggerTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles after a trigger target is removed or replaced. */\n  triggerTargetDisconnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Initializes a region target inserted or restored at runtime. */\n  regionTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Queues a departed region for the return of its written state and reconciles the rest.\n   *\n   * The return is queued rather than immediate because teardown reports every\n   * region as disconnected, and a disconnected controller leaves its derived state\n   * in the DOM. The pass that drains the queue skips an element that is still a\n   * region, which drops what teardown queued, and keeps a departure queued before\n   * a disconnect for the pass after the reconnect.\n   */\n  regionTargetDisconnected(region: HTMLElement): void {\n    this.#departed.add(region);\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles when application code or a morph changes the match policy. */\n  matchValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles control ownership when hidden controls become enabled or excluded. */\n  disableHiddenValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-evaluates every region and repairs all reflected DOM state. */\n  evaluate(): void {\n    this.#commitChange();\n  }\n\n  /**\n   * Computes one settled plan, gives back what departed regions carry, shows\n   * destinations before hiding sources, and then returns logical transitions in\n   * DOM order after every region is internally coherent.\n   *\n   * @stimeoRenderRoot\n   */\n  #settle(triggers: Trigger[] = this.triggerTargets): RegionTransition[] {\n    const regions = this.regionTargets;\n    const plan = new Map<HTMLElement, boolean>();\n    for (const region of regions) plan.set(region, this.#isVisible(region, triggers));\n    for (const departed of this.#departed) {\n      if (!plan.has(departed)) this.#release(departed, plan);\n    }\n    this.#departed.clear();\n\n    const changed = new Set<HTMLElement>();\n    const applicationOrder = [\n      ...regions.filter((region) => plan.get(region) === true),\n      ...regions.filter((region) => plan.get(region) === false),\n    ];\n    for (const region of applicationOrder) {\n      const visible = plan.get(region);\n      if (visible !== undefined && this.#applyRegion(region, visible, plan)) {\n        changed.add(region);\n      }\n    }\n\n    return regions\n      .filter((region) => changed.has(region))\n      .map((region) => ({ region, visible: plan.get(region) === true }));\n  }\n\n  /** Reports logical transitions caused by user input or the public action. */\n  #commitChange(triggers: Trigger[] = this.triggerTargets): void {\n    for (const detail of this.#settle(triggers)) {\n      this.dispatch(\"change\", { detail });\n    }\n  }\n\n  /** Reports logical transitions derived from DOM, lifecycle, reset, or Value state. */\n  #reconcileDom(): void {\n    for (const detail of this.#settle()) {\n      this.dispatch(\"reconcile\", { detail });\n    }\n  }\n\n  /** Applies one planned state while keeping event history separate from DOM repair. */\n  #applyRegion(\n    region: HTMLElement,\n    visible: boolean,\n    plan: ReadonlyMap<HTMLElement, boolean>,\n  ): boolean {\n    const previous = this.#lastVisible.get(region) ?? !region.hidden;\n    const changed = visible !== previous;\n    this.#lastVisible.set(region, visible);\n\n    if (!visible) this.#retreatFocus(region, plan);\n    this.#syncRegionState(region, visible);\n    this.#syncRegionControls(region, visible);\n    return changed;\n  }\n\n  /**\n   * Reflects visibility idempotently, recording writes so the observer ignores its\n   * own work, and notes whether the `hidden` comes from a declared condition.\n   */\n  #syncRegionState(region: HTMLElement, visible: boolean): void {\n    if (!visible && this.#predicateFor(region) !== null) this.#concealed.add(region);\n    else this.#concealed.delete(region);\n    this.#writeAttribute(region, \"hidden\", visible ? null : \"\");\n    this.#writeAttribute(region, \"aria-hidden\", visible ? null : \"true\");\n    this.#writeAttribute(region, \"data-visible\", visible ? \"true\" : null);\n  }\n\n  /** Enables/disables descendant controls, touching only state carrying our marker. */\n  #syncRegionControls(region: HTMLElement, visible: boolean): void {\n    const shouldDisable = !visible && this.disableHiddenValue;\n    for (const control of region.querySelectorAll<Disableable>(CONTROLS)) {\n      const marked = control.hasAttribute(DISABLED_MARKER);\n      if (shouldDisable) {\n        if (!control.disabled) {\n          this.#writeAttribute(control, \"disabled\", \"\");\n          this.#writeAttribute(control, DISABLED_MARKER, \"true\");\n        } else if (marked && control.getAttribute(DISABLED_MARKER) !== \"true\") {\n          this.#writeAttribute(control, DISABLED_MARKER, \"true\");\n        }\n      } else if (marked) {\n        this.#enable(control);\n      }\n    }\n  }\n\n  /** Removes a `disabled` this controller owns together with its marker. */\n  #enable(control: Disableable): void {\n    this.#writeAttribute(control, \"disabled\", null);\n    this.#writeAttribute(control, DISABLED_MARKER, null);\n  }\n\n  /**\n   * Gives back what this controller wrote on an element that left the region set.\n   * A marked control inside a region this pass hides stays disabled for that region.\n   */\n  #release(element: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): void {\n    this.#lastVisible.delete(element);\n    if (this.#concealed.delete(element)) this.#writeAttribute(element, \"hidden\", null);\n    this.#writeAttribute(element, \"aria-hidden\", null);\n    this.#writeAttribute(element, \"data-visible\", null);\n    for (const control of element.querySelectorAll<Disableable>(CONTROLS)) {\n      if (control.hasAttribute(DISABLED_MARKER) && this.#survivesPlan(control, plan)) {\n        this.#enable(control);\n      }\n    }\n  }\n\n  /** Whether a region's declared condition holds across `triggers` per `match`. */\n  #isVisible(region: HTMLElement, triggers: Trigger[]): boolean {\n    const predicate = this.#predicateFor(region);\n    if (predicate === null) return !region.hidden;\n    return (\n      triggers.length > 0 &&\n      (this.matchValue === \"all\" ? triggers.every(predicate) : triggers.some(predicate))\n    );\n  }\n\n  /** Builds the deterministic per-trigger predicate from the region's condition. */\n  #predicateFor(region: HTMLElement): ((trigger: Trigger) => boolean) | null {\n    if (region.hasAttribute(\"data-when-checked\")) {\n      return (trigger) => this.#isChecked(trigger);\n    }\n    if (region.hasAttribute(\"data-when-unchecked\")) {\n      return (trigger) => !this.#isChecked(trigger);\n    }\n    const wanted = region.dataset.whenValue;\n    if (wanted !== undefined) {\n      return (trigger) => this.#matchesValue(trigger, wanted);\n    }\n    return null;\n  }\n\n  #isChecked(trigger: Trigger): boolean {\n    return trigger instanceof HTMLInputElement && trigger.checked;\n  }\n\n  /** A trigger has a value when a radio/checkbox is selected, or its control value matches. */\n  #matchesValue(trigger: Trigger, wanted: string): boolean {\n    if (\n      trigger instanceof HTMLInputElement &&\n      (trigger.type === \"checkbox\" || trigger.type === \"radio\")\n    ) {\n      return trigger.checked && trigger.value === wanted;\n    }\n    return trigger.value === wanted;\n  }\n\n  /** Moves focus to the first safe trigger, or to the controller landmark as a fallback. */\n  #retreatFocus(region: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): void {\n    const active = document.activeElement;\n    if (active && region.contains(active)) this.#moveFocus(plan);\n  }\n\n  /** Moves focus after the caller establishes that the active node is being hidden. */\n  #moveFocus(plan: ReadonlyMap<HTMLElement, boolean>): void {\n    const destination = this.triggerTargets.find(\n      (trigger) => canTakeFocus(trigger) && this.#survivesPlan(trigger, plan),\n    );\n    if (destination) {\n      this.#rootTabindex.returnAll();\n      destination.focus();\n      return;\n    }\n\n    this.#rootTabindex.lend(this.element);\n    this.element.focus();\n  }\n\n  /** Whether a focus candidate or a control sits outside every region this pass will hide. */\n  #survivesPlan(candidate: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): boolean {\n    return [...plan].every(([region, visible]) => visible || !region.contains(candidate));\n  }\n\n  /** Records one idempotent attribute write before MutationObserver sees it. */\n  #writeAttribute(element: Element, name: string, value: ExpectedAttribute): void {\n    if (element.getAttribute(name) !== value) {\n      if (this.#observing) {\n        let writes = this.#internalWrites.get(element);\n        if (!writes) {\n          writes = new Map();\n          this.#internalWrites.set(element, writes);\n        }\n        writes.set(name, value);\n      }\n      if (value === null) element.removeAttribute(name);\n      else element.setAttribute(name, value);\n    }\n  }\n\n  /** Separates authored records from controller writes and queues one relevant repair. */\n  #onMutations(records: MutationRecord[]): void {\n    const triggers = this.triggerTargets;\n    const regions = this.regionTargets;\n    const touchedWrites = new Map<Element, Set<string>>();\n    let needsReconcile = false;\n\n    for (const record of records) {\n      if (record.type === \"attributes\" && record.target instanceof Element) {\n        const name = record.attributeName;\n        const writes = this.#internalWrites.get(record.target);\n        if (name && writes?.has(name)) {\n          let names = touchedWrites.get(record.target);\n          if (!names) {\n            names = new Set();\n            touchedWrites.set(record.target, names);\n          }\n          names.add(name);\n          if (record.target.getAttribute(name) === writes.get(name)) continue;\n        }\n      }\n      if (\n        record.target instanceof Element &&\n        this.#elementAffectsState(record.target, triggers, regions)\n      ) {\n        needsReconcile = true;\n      }\n    }\n\n    for (const [element, names] of touchedWrites) {\n      const writes = this.#internalWrites.get(element);\n      for (const name of names) writes?.delete(name);\n    }\n    if (needsReconcile) this.#reconcile.schedule();\n  }\n\n  /** Whether an authored mutation target belongs to a trigger, region, or managed control. */\n  #elementAffectsState(target: Element, triggers: Trigger[], regions: HTMLElement[]): boolean {\n    return ownerIndex(triggers, target) !== -1 || ownerIndex(regions, target) !== -1;\n  }\n\n  /** Whether a form owns at least one current trigger, including `form=` associations. */\n  #hasTriggerOwnedBy(form: HTMLFormElement): boolean {\n    return this.triggerTargets.some((trigger) => trigger.form === form);\n  }\n}\n"]}
+{"version":3,"sources":["../../src/utils/attribute_write.ts","../../src/utils/authored_mutation_watcher.ts","../../src/utils/event_owner.ts","../../src/utils/focus_candidate.ts","../../src/utils/form_reset_watcher.ts","../../src/utils/listener_set.ts","../../src/utils/microtask_coalescer.ts","../../src/utils/morph_render_watcher.ts","../../src/utils/query_open_descendants.ts","../../src/utils/shared_registry.ts","../../src/utils/tabindex_loan.ts","../../src/controllers/conditional_fields_controller.ts"],"names":["pending","above"],"mappings":";;AAaO,SAAS,qBAAA,CACd,OAAA,EACA,IAAA,EACA,KAAA,EACA,WAAA,EACS;AACT,EAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA,KAAM,OAAO,OAAO,KAAA;AACjD,EAAA,WAAA,IAAc;AACd,EAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,IAAI,CAAA;AAAA,OAC3C,OAAA,CAAQ,YAAA,CAAa,IAAA,EAAM,KAAK,CAAA;AACrC,EAAA,OAAO,IAAA;AACT;;ACaO,IAAM,0BAAN,MAA8B;AAAA,EAC1B,WAAA;AAAA,EACT,OAAA,GAAiC,IAAA;AAAA,EACjC,SAAA,GAAqC,IAAA;AAAA,EAGrC,YAAY,UAAA,EAAiD;AAC3D,IAAA,IAAA,CAAK,WAAA,GAAc,UAAA;AAAA,EACrB;AAAA,EAGA,OAAA,CAAQ,MAAe,OAAA,EAAwC;AAC7D,IAAA,IAAA,CAAK,UAAA,EAAW;AAChB,IAAA,MAAM,QAAA,GAAW,IAAI,gBAAA,CAAiB,CAAC,OAAA,KAAY;AACjD,MAAA,IAAI,IAAA,CAAK,cAAc,QAAA,EAAU;AACjC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA;AACrC,MAAA,IAAI,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG,IAAA,CAAK,YAAY,QAAQ,CAAA;AAAA,IACpD,CAAC,CAAA;AACD,IAAA,IAAA,CAAK,SAAA,GAAY,QAAA;AACjB,IAAA,IAAA,CAAK,OAAA,GAAU,EAAE,UAAA,kBAAY,IAAI,KAAI,EAAG,QAAA,kBAAU,IAAI,GAAA,EAAI,EAAE;AAC5D,IAAA,QAAA,CAAS,QAAQ,IAAA,EAAM;AAAA,MACrB,UAAA,EAAY,IAAA;AAAA,MACZ,eAAA,EAAiB,CAAC,GAAG,OAAA,CAAQ,UAAU,CAAA;AAAA,MACvC,OAAA,EAAS,QAAQ,OAAA,IAAW,KAAA;AAAA,MAC5B,SAAA,EAAW,QAAQ,SAAA,IAAa;AAAA,KACjC,CAAA;AACD,IAAA,IAAI,QAAQ,kBAAA,EAAoB;AAC9B,MAAA,IAAI,WAAW,IAAA,CAAK,aAAA;AACpB,MAAA,OAAO,QAAA,EAAU;AACf,QAAA,QAAA,CAAS,QAAQ,QAAA,EAAU;AAAA,UACzB,UAAA,EAAY,IAAA;AAAA,UACZ,eAAA,EAAiB,CAAC,GAAG,OAAA,CAAQ,kBAAkB;AAAA,SAChD,CAAA;AACD,QAAA,QAAA,GAAW,QAAA,CAAS,aAAA;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA,EAGA,KAAA,CAAM,MAAA,EAAiB,IAAA,EAAc,KAAA,EAA4B;AAC/D,IAAA,MAAM,MAAA,GAAS,KAAK,OAAA,EAAS,UAAA;AAC7B,IAAA,IAAI,UAAA,GAAa,MAAA,EAAQ,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,UAAA,uBAAiB,GAAA,EAAI;AACrB,MAAA,MAAA,EAAQ,GAAA,CAAI,QAAQ,UAAU,CAAA;AAAA,IAChC;AACA,IAAA,MAAM,OAAA,GAAU,UAAA,CAAW,GAAA,CAAI,IAAI,CAAA;AACnC,IAAA,UAAA,CAAW,GAAA,CAAI,MAAM,EAAE,KAAA,EAAO,QAAQ,OAAA,EAAS,KAAA,IAAS,CAAA,IAAK,CAAA,EAAG,CAAA;AAAA,EAClE;AAAA,EAGA,YAAA,CAAa,QAAiB,IAAA,EAAoB;AAChD,IAAA,IAAA,CAAK,MAAM,MAAA,EAAQ,IAAA,EAAM,MAAA,CAAO,YAAA,CAAa,IAAI,CAAC,CAAA;AAAA,EACpD;AAAA,EAGA,cAAA,CAAe,MAAA,EAAc,KAAA,EAAwB,OAAA,EAAgC;AACnF,IAAA,MAAM,MAAA,GAAS,KAAK,OAAA,EAAS,QAAA;AAC7B,IAAA,MAAM,OAAA,GAAU,MAAA,EAAQ,GAAA,CAAI,MAAM,CAAA,IAAK,EAAE,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAG,OAAA,kBAAS,IAAI,KAAI,EAAE;AAC9E,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,IAAA,EAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AACpF,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,EAAS,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAA,EAAA,CAAO,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAC1F,IAAA,MAAA,EAAQ,GAAA,CAAI,QAAQ,OAAO,CAAA;AAAA,EAC7B;AAAA,EAGA,IAAA,GAAyB;AACvB,IAAA,OAAO,KAAK,OAAA,CAAQ,IAAA,CAAK,WAAW,WAAA,EAAY,IAAK,EAAE,CAAA;AAAA,EACzD;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACjB;AAAA,EAGA,QAAQ,OAAA,EAA6C;AACnD,IAAA,MAAM,QAAA,GAAW,QAAQ,MAAA,CAAO,CAAC,WAAW,CAAC,IAAA,CAAK,QAAA,CAAS,MAAM,CAAC,CAAA;AAClE,IAAA,IAAA,CAAK,OAAA,EAAS,WAAW,KAAA,EAAM;AAC/B,IAAA,IAAA,CAAK,OAAA,EAAS,SAAS,KAAA,EAAM;AAC7B,IAAA,OAAO,QAAA;AAAA,EACT;AAAA,EAMA,SAAS,MAAA,EAAiC;AACxC,IAAA,IAAI,MAAA,CAAO,SAAS,YAAA,EAAc;AAChC,MAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AACtB,MAAA,MAAMA,QAAAA,GAAU,KAAK,OAAA,EAAS,UAAA,CAAW,IAAI,MAAM,CAAA,EAAG,GAAA,CAAI,MAAA,CAAO,aAAuB,CAAA;AACxF,MAAA,IACE,CAACA,QAAAA,IACDA,QAAAA,CAAQ,KAAA,KAAU,CAAA,IAClB,MAAA,CAAO,YAAA,CAAa,MAAA,CAAO,aAAuB,CAAA,KAAMA,QAAAA,CAAQ,KAAA,EAChE;AACA,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAAA,SAAQ,KAAA,IAAS,CAAA;AACjB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,MAAM,UAAU,IAAA,CAAK,OAAA,EAAS,QAAA,CAAS,GAAA,CAAI,OAAO,MAAM,CAAA;AACxD,IAAA,IAAI,CAAC,SAAS,OAAO,KAAA;AACrB,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,MAAA,CAAO,UAAU,CAAA;AACnC,IAAA,MAAM,OAAA,GAAU,CAAC,GAAG,MAAA,CAAO,YAAY,CAAA;AACvC,IAAA,IACE,KAAA,CAAM,KAAK,CAAC,IAAA,KAAS,CAAC,OAAA,CAAQ,KAAA,CAAM,IAAI,IAAI,CAAC,KAC7C,OAAA,CAAQ,IAAA,CAAK,CAAC,IAAA,KAAS,CAAC,QAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAC,CAAA,EACjD;AACA,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,IAAA,EAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AACpF,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,EAAS,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAA,EAAA,CAAO,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAC1F,IAAA,OAAO,IAAA;AAAA,EACT;AACF,CAAA;;ACtHO,SAAS,UAAA,CACd,YACA,IAAA,EACQ;AACR,EAAA,IAAI,EAAE,IAAA,YAAgB,IAAA,CAAA,EAAO,OAAO,EAAA;AACpC,EAAA,OAAO,WAAW,SAAA,CAAU,CAAC,cAAc,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC,CAAA;AACrE;;AC9BO,SAAS,yBAAyB,OAAA,EAA+B;AACtE,EAAA,IAAI,QAAA,GAA2B,OAAA,CAAQ,OAAA,CAAQ,oBAAoB,CAAA;AACnE,EAAA,OAAO,QAAA,EAAU;AACf,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,OAAA,KAAY,QAAQ,CAAA;AACvF,IAAA,IAAI,CAAC,MAAA,EAAQ,QAAA,CAAS,OAAO,GAAG,OAAO,IAAA;AACvC,IAAA,QAAA,GAAW,QAAA,CAAS,aAAA,EAAe,OAAA,CAAQ,oBAAoB,CAAA,IAAK,IAAA;AAAA,EACtE;AACA,EAAA,OAAO,KAAA;AACT;AAOA,SAAS,UAAU,OAAA,EAA2B;AAC5C,EAAA,OAAO,OAAA,CAAQ,YAAA,KAAiB,IAAA,IAAQ,OAAA,CAAQ,eAAe,UAAA,IAAc,IAAA;AAC/E;AASO,SAAS,eAAe,OAAA,EAAkC;AAC/D,EAAA,IAAI,SAAA,CAAU,OAAO,CAAA,EAAG,OAAO,IAAA;AAC/B,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,IAAgB,OAAA,CAAQ,UAAA;AAC/C,EAAA,IAAI,MAAA,YAAkB,UAAA,EAAY,OAAO,MAAA,CAAO,IAAA;AAChD,EAAA,OAAO,MAAA,YAAkB,UAAU,MAAA,GAAS,IAAA;AAC9C;AA2EO,SAAS,aAAa,OAAA,EAA+B;AAC1D,EAAA,KAAA,IAAS,OAAuB,OAAA,EAAS,IAAA,EAAM,IAAA,GAAO,cAAA,CAAe,IAAI,CAAA,EAAG;AAC1E,IAAA,IAAI,UAAU,IAAI,CAAA,IAAK,KAAK,OAAA,CAAQ,mBAAmB,GAAG,OAAO,KAAA;AAAA,EACnE;AACA,EAAA,IAAI,OAAA,YAAmB,gBAAA,IAAoB,OAAA,CAAQ,IAAA,KAAS,UAAU,OAAO,KAAA;AAC7E,EAAA,IAAI,EAAE,UAAA,IAAc,OAAA,CAAA,EAAU,OAAO,IAAA;AACrC,EAAA,IAAK,OAAA,CAAgD,UAAU,OAAO,KAAA;AACtE,EAAA,OAAO,CAAC,yBAAyB,OAAO,CAAA;AAC1C;AA0WO,SAAS,kBAAkB,aAAA,EAAyC;AACzE,EAAA,IAAI,SAAS,aAAA,CAAc,aAAA;AAC3B,EAAA,OAAO,MAAA,EAAQ,UAAA,EAAY,aAAA,EAAe,MAAA,GAAS,OAAO,UAAA,CAAW,aAAA;AACrE,EAAA,OAAO,MAAA;AACT;;AC9bO,IAAM,mBAAN,MAAuB;AAAA,EACnB,KAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA,uBAAc,GAAA,EAAY;AAAA,EACnC,WAAA,GAAc,CAAA;AAAA,EAMd,WAAA,CAAY,MAA0C,OAAA,EAAqB;AACzE,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAAA,EAClB;AAAA,EAGA,OAAA,GAAgB;AACd,IAAA,QAAA,CAAS,gBAAA,CAAiB,OAAA,EAAS,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAAA,EAC5D;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,QAAA,CAAS,mBAAA,CAAoB,OAAA,EAAS,IAAA,CAAK,YAAA,EAAc,IAAI,CAAA;AAC7D,IAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AACpB,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,OAAA,EAAS,oBAAA,CAAqB,KAAK,CAAA;AAC5D,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA,EAES,YAAA,GAAe,CAAC,KAAA,KAAuB;AAC9C,IAAA,MAAM,OAAO,KAAA,CAAM,MAAA;AACnB,IAAA,IAAI,EAAE,IAAA,YAAgB,eAAA,CAAA,IAAoB,CAAC,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA,EAAG;AAC7D,IAAA,MAAM,aAAa,IAAA,CAAK,WAAA;AACxB,IAAA,cAAA,CAAe,MAAM;AAEnB,MAAA,IAAI,UAAA,KAAe,KAAK,WAAA,EAAa;AACrC,MAAA,IAAI,KAAA,CAAM,UAAA,KAAe,KAAA,CAAM,IAAA,EAAM;AACnC,QAAA,IAAA,CAAK,QAAQ,KAAK,CAAA;AAClB,QAAA;AAAA,MACF;AACA,MAAA,MAAM,KAAA,GAAQ,sBAAsB,MAAM;AACxC,QAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,KAAK,CAAA;AACzB,QAAA,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,MACpB,CAAC,CAAA;AACD,MAAA,IAAA,CAAK,OAAA,CAAQ,IAAI,KAAK,CAAA;AAAA,IACxB,CAAC,CAAA;AAAA,EACH,CAAA;AAAA,EAGA,QAAQ,KAAA,EAAoB;AAC1B,IAAA,IAAI,CAAC,KAAA,CAAM,gBAAA,EAAkB,IAAA,CAAK,QAAA,EAAS;AAAA,EAC7C;AACF,CAAA;;AClBO,IAAM,cAAN,MAAkB;AAAA,EAEvB,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EAqB7B,GAAA,CAAI,MAAA,EAAqB,IAAA,EAAc,OAAA,EAAwB,OAAA,EAAiC;AAC9F,IAAA,MAAA,CAAO,gBAAA,CAAiB,IAAA,EAAM,OAAA,EAAS,EAAE,GAAG,SAAS,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA;AAAA,EACnF;AAAA,EAMA,OAAA,GAAgB;AACd,IAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,IAAA,IAAA,CAAK,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EACpC;AACF,CAAA;;AChEO,IAAM,qBAAN,MAAyB;AAAA,EACrB,IAAA;AAAA,EACT,OAAA,GAAU,KAAA;AAAA,EACV,OAAA,GAAU,KAAA;AAAA,EACV,WAAA,GAAc,CAAA;AAAA,EAGd,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,IAAA,GAAO,GAAA;AAAA,EACd;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACjB;AAAA,EAGA,MAAA,GAAe;AACb,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AAAA,EACtB;AAAA,EAGA,IAAI,OAAA,GAAmB;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,OAAA,EAAS;AACnC,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AACf,IAAA,MAAM,aAAa,IAAA,CAAK,WAAA;AACxB,IAAA,cAAA,CAAe,MAAM;AAEnB,MAAA,IAAI,UAAA,KAAe,KAAK,WAAA,IAAe,CAAC,KAAK,OAAA,IAAW,CAAC,KAAK,OAAA,EAAS;AACvE,MAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAC,CAAA;AAAA,EACH;AACF,CAAA;;AC7EO,IAAM,qBAAN,MAAyB;AAAA,EACrB,UAAA,GAAa,IAAI,WAAA,EAAY;AAAA,EAC7B,KAAA;AAAA,EACT,QAAA,GAA2B,IAAA;AAAA,EAClB,QAAA,GAAW,MAAY,IAAA,CAAK,KAAA,CAAM,QAAA,EAAS;AAAA,EAGpD,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,kBAAA,CAAmB,GAAG,CAAA;AAAA,EACzC;AAAA,EAGA,QAAQ,OAAA,EAAwB;AAC9B,IAAA,IAAI,IAAA,CAAK,aAAa,OAAA,EAAS;AAC/B,IAAA,IAAA,CAAK,UAAA,EAAW;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AACpB,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,OAAA,EAAS,qBAAA,EAAuB,KAAK,QAAQ,CAAA;AAAA,EACnE;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AAAA,EACtB;AAAA,EAGA,IAAI,OAAA,GAAmB;AACrB,IAAA,OAAO,KAAK,KAAA,CAAM,OAAA;AAAA,EACpB;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AACxB,IAAA,IAAA,CAAK,MAAM,MAAA,EAAO;AAClB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAAA,EAClB;AACF,CAAA;;AC/CO,SAAS,oBAAA,CACd,MACA,QAAA,EACK;AACL,EAAA,MAAM,UAAe,EAAC;AACtB,EAAA,MAAM,KAAA,GAAsB,CAAC,IAAI,CAAA;AACjC,EAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,IAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,KAAA,CAAM,gBAAA,CAAoB,QAAQ,CAAC,CAAA;AACnD,IAAA,IAAI,KAAA,CAAM,QAAA,KAAa,IAAA,CAAK,YAAA,EAAc;AACxC,MAAA,MAAM,SAAU,KAAA,CAAkB,UAAA;AAClC,MAAA,IAAI,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA;AAAA,IAC/B;AACA,IAAA,KAAA,MAAW,OAAA,IAAW,KAAA,CAAM,gBAAA,CAAiB,GAAG,CAAA,EAAG;AACjD,MAAA,IAAI,OAAA,CAAQ,UAAA,EAAY,KAAA,CAAM,IAAA,CAAK,QAAQ,UAAU,CAAA;AAAA,IACvD;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;;ACUO,SAAS,cAAA,CAAiC,KAAa,MAAA,EAAoB;AAChF,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC7B,EAAA,MAAM,KAAA,GAAQ,UAAA;AACd,EAAA,MAAM,QAAA,GAAW,MAAM,MAAM,CAAA;AAC7B,EAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AACnC,EAAA,MAAM,WAAW,MAAA,EAAO;AACxB,EAAA,MAAA,CAAO,eAAe,UAAA,EAAY,MAAA,EAAQ,EAAE,KAAA,EAAO,UAAU,CAAA;AAC7D,EAAA,OAAO,QAAA;AACT;;ACdA,SAAS,WAAW,OAAA,EAA+B;AACjD,EAAA,OAAO,QAAQ,OAAA,CAAQ,QAAQ,KAAK,iBAAA,CAAkB,OAAA,CAAQ,aAAa,CAAA,KAAM,OAAA;AACnF;AAsEO,IAAM,YAAA,GAAN,MAAM,aAAA,CAAkD;AAAA,EAE7D,OAAgB,SAAA,GAAY,cAAA;AAAA,IAC1B,qCAAA;AAAA,IACA,OAA6B,EAAE,MAAA,kBAAQ,IAAI,SAAQ,EAAG,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAE;AAAA,GACzE;AAAA,EACS,MAAA;AAAA,EACA,OAAA;AAAA,EACA,cAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAO;AAAA,EAS5B,WAAA,CAAY,KAAA,EAAe,KAAA,EAAe,OAAA,GAAgD,EAAC,EAAG;AAC5F,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAA,CAAK,OAAA,GAAU,QAAQ,KAAK,CAAA,cAAA,CAAA;AAC5B,IAAA,IAAA,CAAK,cAAA,GAAiB,QAAQ,aAAA,KAAkB,IAAA;AAChD,IAAA,aAAA,CAAa,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,OAAO,CAAA;AAAA,EAC/C;AAAA,EAQA,IAAA,CAAK,OAAA,EAAY,OAAA,GAAoD,EAAC,EAAS;AAC7E,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,IAAA,GACJ,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,IAAI,CAAA,IACvC,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,KAAA,KAAU,IAAA,CAAK;AAAA,KACtF;AACF,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,EAAA,CAAG,EAAE,GAAG,KAAA,KAAU,OAAA;AACvC,IAAA,IAAI,CAAC,QAAQ,OAAA,CAAQ,iBAAA,KAAsB,YAAY,IAAA,IAAQ,OAAA,CAAQ,YAAY,CAAA,CAAA,EAAI;AACvF,IAAA,IAAI,CAAC,IAAA,IAAQ,OAAA,KAAY,IAAA,IAAQ,CAAC,MAAA,EAAQ;AAC1C,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,OAAO,CAAA;AACtB,IAAA,IAAI,IAAA,OAAW,IAAA,GAAO,IAAA;AAAA,SACjB,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,EAAM,MAAA,EAAQ,IAAA,CAAK,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,MAAA,EAAQ,MAAA,EAAQ,CAAA;AAChF,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AACzB,IAAA,IAAI,YAAY,IAAA,IAAS,CAAC,IAAA,IAAQ,OAAA,KAAY,KAAK,MAAA,EAAS;AAC1D,MAAA,OAAA,CAAQ,YAAA,CAAa,UAAA,EAAY,IAAA,CAAK,MAAM,CAAA;AAAA,IAC9C;AAAA,EACF;AAAA,EAGA,OAAO,OAAA,EAAqB;AAC1B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,IAAA,GACJ,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,IAAA,KAAS,IAAI,CAAA,IACvC,KAAA,CAAM,IAAA;AAAA,MACJ,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,KAAA,KAAU,IAAA,CAAK;AAAA,KACtF;AACF,IAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,IAAA,IAAI,CAAC,KAAK,QAAA,CAAS,OAAA,EAAS,OAAO,IAAA,EAAM,IAAA,CAAK,cAAc,CAAA,EAAG;AAC7D,MAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,MAAA,IAAA,CAAK,KAAA,CAAM,IAAI,OAAO,CAAA;AACtB,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,OAAO,OAAO,CAAA;AACzB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAGA,SAAA,GAAkB;AAChB,IAAA,KAAA,MAAW,OAAA,IAAW,MAAM,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA,EAAG,IAAA,CAAK,OAAO,OAAO,CAAA;AAAA,EACnE;AAAA,EAMA,QAAQ,OAAA,EAA4B;AAClC,IAAA,IAAI,QAAQ,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,KAAM,KAAK,MAAA,EAAQ;AACxD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,OAAO,CAAA;AACpF,IAAA,IAAI,IAAA,IAAQ,CAAC,UAAA,CAAW,OAAO,GAAG,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,KAAA,EAAO,IAAI,CAAA;AAAA,EACtE;AAAA,EAGA,cAAc,IAAA,EAAwB;AACpC,IAAA,KAAA,MAAW,WAAW,oBAAA,CAAkC,IAAA,EAAM,IAAI,IAAA,CAAK,OAAO,GAAG,CAAA,EAAG;AAClF,MAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,IACtB;AAAA,EACF;AAAA,EAGA,OAAO,OAAA,EAAkC;AACvC,IAAA,MAAM,MAAA,GAAS,cAAa,SAAA,CAAU,MAAA;AACtC,IAAA,MAAM,QAAQ,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA,IAAK,IAAA,CAAK,MAAM,OAAO,CAAA;AACvD,IAAA,MAAA,CAAO,GAAA,CAAI,SAAS,KAAK,CAAA;AACzB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAGA,MAAM,OAAA,EAAkC;AACtC,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,QAAoB,EAAC;AAC3B,IAAA,KAAA,MAAW,MAAA,IAAU,aAAA,CAAa,SAAA,CAAU,KAAA,EAAO;AACjD,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,MAAM,CAAA;AACzC,MAAA,IAAI,KAAA,KAAU,IAAA,EAAM,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,CAAA;AAAA,IAC5E;AACA,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,GAAA,EAAK,KAAA,KAAU,MAAA,CAAO,GAAA,CAAI,KAAA,KAAU,OAAO,CAAA,GAAI,MAAA,CAAO,KAAA,CAAM,KAAA,KAAU,OAAO,CAAC,CAAA;AAC1F,IAAA,KAAA,MAAW,CAAC,OAAO,IAAI,CAAA,IAAK,MAAM,OAAA,EAAQ,EAAG,IAAA,CAAK,MAAA,GAAS,KAAA,GAAQ,CAAA;AACnE,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAGA,QAAA,CACE,OAAA,EACA,KAAA,EACA,IAAA,EACA,gBAAgB,KAAA,EACP;AACT,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC/C,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA;AAChC,IAAA,MAAM,IAAA,GACJ,OAAA,KAAY,IAAA,CAAK,KAAA,IAAS,CAAC,KAAA,CAAM,KAAA,CAAM,KAAA,GAAQ,CAAC,EAAE,IAAA,CAAK,CAACC,MAAAA,KAAUA,MAAAA,CAAM,UAAU,OAAO,CAAA;AAC3F,IAAA,IAAI,IAAA,IAAQ,aAAA,IAAiB,UAAA,CAAW,OAAO,GAAG,OAAO,KAAA;AACzD,IAAA,KAAA,CAAM,MAAA,CAAO,OAAO,CAAC,CAAA;AACrB,IAAA,MAAM,KAAA,GAAQ,MAAM,KAAK,CAAA;AACzB,IAAA,IAAI,KAAA,EAAO,KAAA,CAAM,MAAA,KAAW,IAAA,CAAK,MAAA;AACjC,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AACzB,IAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,IAAA,MAAM,QAAQ,IAAA,CAAK,MAAA,GAAS,KAAA,CAAM,KAAA,GAAQ,CAAC,CAAA,GAAI,MAAA;AAC/C,IAAA,IAAI,CAAC,KAAA,EAAO,OAAA,CAAQ,eAAA,CAAgB,UAAU,CAAA;AAAA,SAAA,IACrC,MAAM,KAAA,KAAU,OAAA,UAAiB,YAAA,CAAa,UAAA,EAAY,MAAM,KAAK,CAAA;AAC9E,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAGA,KAAA,CAAM,SAAsB,KAAA,EAAkC;AAC5D,IAAA,MAAM,OAAA,uBAAc,GAAA,CAA2B,CAAC,CAAC,IAAA,CAAK,OAAA,EAAS,IAAI,CAAC,CAAC,CAAA;AACrE,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO,OAAA,CAAQ,IAAI,IAAA,CAAK,MAAA,EAAQ,KAAK,KAAK,CAAA;AAC7D,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,QAAQ,CAAA,IAAK,OAAA,EAAS;AACtC,MAAA,qBAAA,CAAsB,OAAA,EAAS,MAAM,QAAQ,CAAA;AAAA,IAC/C;AAAA,EACF;AACF,CAAA;;AC5NA,IAAM,eAAA,GAAkB,2BAAA;AAGxB,IAAM,QAAA,GAAW,iCAAA;AAGjB,IAAM,mBAAA,GAAsB;AAAA,EAC1B,QAAA;AAAA,EACA,aAAA;AAAA,EACA,cAAA;AAAA,EACA,eAAA;AAAA,EACA,UAAA;AAAA,EACA,mBAAA;AAAA,EACA,qBAAA;AAAA,EACA,iBAAA;AAAA,EACA,SAAA;AAAA,EACA,UAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF,CAAA;AAkDO,IAAM,2BAAA,GAAN,cAA0C,UAAA,CAAwB;AAAA,EACvE,OAAgB,OAAA,GAAU,CAAC,SAAA,EAAW,QAAQ,CAAA;AAAA,EAC9C,OAAgB,MAAA,GAAS;AAAA,IACvB,aAAA,EAAe,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,IAAA,EAAK;AAAA,IAC9C,KAAA,EAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,KAAA;AAAM,GACxC;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,UAAU,CAAA;AAAA,EAC5B,OAAO,MAAA,GAAS,CAAC,QAAA,EAAU,WAAW,CAAA;AAAA,EAStC,YAAA,uBAAmB,OAAA,EAA8B;AAAA,EAExC,SAAA,uBAAgB,GAAA,EAAiB;AAAA,EAEjC,UAAA,uBAAiB,OAAA,EAAqB;AAAA,EAGtC,aAAa,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,eAAe,CAAA;AAAA,EAC9D,UAAA,GAAa,IAAI,WAAA,EAAY;AAAA,EAC7B,aAAa,IAAI,gBAAA;AAAA,IACxB,CAAC,IAAA,KAAS,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA;AAAA,IACtC,MAAM,IAAA,CAAK,UAAA,CAAW,QAAA;AAAS,GACjC;AAAA,EAES,aAAA,GAAgB,IAAI,YAAA,CAA0B,IAAA,EAAM,KAAK,UAAU,CAAA;AAAA,EAEnE,SAAA,GAAY,IAAI,uBAAA,CAAwB,CAAC,YAAY,IAAA,CAAK,YAAA,CAAa,OAAO,CAAC,CAAA;AAAA,EAG/E,eAAA,GAAkB,CAAC,KAAA,KAAuB;AACjD,IAAA,MAAM,SAAS,KAAA,CAAM,MAAA;AACrB,IAAA,MAAM,WAAW,IAAA,CAAK,cAAA;AACtB,IAAA,IAAI,MAAA,YAAkB,WAAW,QAAA,CAAS,IAAA,CAAK,CAAC,OAAA,KAAY,OAAA,KAAY,MAAM,CAAA,EAAG;AAC/E,MAAA,IAAA,CAAK,cAAc,QAAQ,CAAA;AAAA,IAC7B;AAAA,EACF,CAAA;AAAA,EAGS,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,aAAA,CAAc,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACvC,IAAA,IAAA,CAAK,YAAA,uBAAmB,OAAA,EAAQ;AAChC,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS;AAAA,MACnC,UAAA,EAAY,mBAAA;AAAA,MACZ,SAAA,EAAW,IAAA;AAAA,MACX,OAAA,EAAS;AAAA,KACV,CAAA;AACD,IAAA,IAAA,CAAK,WAAW,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,QAAA,EAAU,KAAK,eAAe,CAAA;AAChE,IAAA,IAAA,CAAK,WAAW,GAAA,CAAI,IAAA,CAAK,OAAA,EAAS,OAAA,EAAS,KAAK,eAAe,CAAA;AAC/D,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AAAA,EAC1B;AAAA,EAGS,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,UAAU,UAAA,EAAW;AAC1B,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AACxB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,cAAc,SAAA,EAAU;AAAA,EAC/B;AAAA,EAGA,sBAAA,GAA+B;AAC7B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,yBAAA,GAAkC;AAChC,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAWA,yBAAyB,MAAA,EAA2B;AAClD,IAAA,IAAA,CAAK,SAAA,CAAU,IAAI,MAAM,CAAA;AACzB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,yBAAA,GAAkC;AAChC,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,aAAA,EAAc;AAAA,EACrB;AAAA,EASA,OAAA,CAAQ,QAAA,GAAsB,IAAA,CAAK,cAAA,EAAoC;AACrE,IAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,IAAA,MAAM,IAAA,uBAAW,GAAA,EAA0B;AAC3C,IAAA,KAAA,MAAW,MAAA,IAAU,SAAS,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,UAAA,CAAW,MAAA,EAAQ,QAAQ,CAAC,CAAA;AAChF,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,SAAA,EAAW;AACrC,MAAA,IAAI,CAAC,KAAK,GAAA,CAAI,QAAQ,GAAG,IAAA,CAAK,QAAA,CAAS,UAAU,IAAI,CAAA;AAAA,IACvD;AACA,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AAErB,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAiB;AACrC,IAAA,MAAM,gBAAA,GAAmB;AAAA,MACvB,GAAG,QAAQ,MAAA,CAAO,CAAC,WAAW,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,KAAM,IAAI,CAAA;AAAA,MACvD,GAAG,QAAQ,MAAA,CAAO,CAAC,WAAW,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,KAAM,KAAK;AAAA,KAC1D;AACA,IAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA;AAC/B,MAAA,IAAI,YAAY,MAAA,IAAa,IAAA,CAAK,aAAa,MAAA,EAAQ,OAAA,EAAS,IAAI,CAAA,EAAG;AACrE,QAAA,OAAA,CAAQ,IAAI,MAAM,CAAA;AAAA,MACpB;AAAA,IACF;AAEA,IAAA,OAAO,OAAA,CACJ,OAAO,CAAC,MAAA,KAAW,QAAQ,GAAA,CAAI,MAAM,CAAC,CAAA,CACtC,GAAA,CAAI,CAAC,MAAA,MAAY,EAAE,QAAQ,OAAA,EAAS,IAAA,CAAK,IAAI,MAAM,CAAA,KAAM,MAAK,CAAE,CAAA;AAAA,EACrE;AAAA,EAGA,aAAA,CAAc,QAAA,GAAsB,IAAA,CAAK,cAAA,EAAsB;AAC7D,IAAA,KAAA,MAAW,MAAA,IAAU,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,EAAG;AAC3C,MAAA,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,EAAE,MAAA,EAAQ,CAAA;AAAA,IACpC;AAAA,EACF;AAAA,EAGA,aAAA,GAAsB;AACpB,IAAA,KAAA,MAAW,MAAA,IAAU,IAAA,CAAK,OAAA,EAAQ,EAAG;AACnC,MAAA,IAAA,CAAK,QAAA,CAAS,WAAA,EAAa,EAAE,MAAA,EAAQ,CAAA;AAAA,IACvC;AAAA,EACF;AAAA,EAGA,YAAA,CACE,MAAA,EACA,OAAA,EACA,IAAA,EACS;AACT,IAAA,MAAM,WAAW,IAAA,CAAK,YAAA,CAAa,IAAI,MAAM,CAAA,IAAK,CAAC,MAAA,CAAO,MAAA;AAC1D,IAAA,MAAM,UAAU,OAAA,KAAY,QAAA;AAC5B,IAAA,IAAA,CAAK,YAAA,CAAa,GAAA,CAAI,MAAA,EAAQ,OAAO,CAAA;AAErC,IAAA,IAAI,CAAC,OAAA,EAAS,IAAA,CAAK,aAAA,CAAc,QAAQ,IAAI,CAAA;AAC7C,IAAA,IAAA,CAAK,gBAAA,CAAiB,QAAQ,OAAO,CAAA;AACrC,IAAA,IAAA,CAAK,mBAAA,CAAoB,QAAQ,OAAO,CAAA;AACxC,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAMA,gBAAA,CAAiB,QAAqB,OAAA,EAAwB;AAC5D,IAAA,IAAI,CAAC,OAAA,IAAW,IAAA,CAAK,aAAA,CAAc,MAAM,MAAM,IAAA,EAAM,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA;AAAA,SAC1E,IAAA,CAAK,UAAA,CAAW,MAAA,CAAO,MAAM,CAAA;AAClC,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,QAAA,EAAU,OAAA,GAAU,OAAO,EAAE,CAAA;AAC1D,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,aAAA,EAAe,OAAA,GAAU,OAAO,MAAM,CAAA;AACnE,IAAA,IAAA,CAAK,eAAA,CAAgB,MAAA,EAAQ,cAAA,EAAgB,OAAA,GAAU,SAAS,IAAI,CAAA;AAAA,EACtE;AAAA,EAGA,mBAAA,CAAoB,QAAqB,OAAA,EAAwB;AAC/D,IAAA,MAAM,aAAA,GAAgB,CAAC,OAAA,IAAW,IAAA,CAAK,kBAAA;AACvC,IAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,gBAAA,CAA8B,QAAQ,CAAA,EAAG;AACpE,MAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,YAAA,CAAa,eAAe,CAAA;AACnD,MAAA,IAAI,aAAA,EAAe;AACjB,QAAA,IAAI,CAAC,QAAQ,QAAA,EAAU;AACrB,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,UAAA,EAAY,EAAE,CAAA;AAC5C,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,MAAM,CAAA;AAAA,QACvD,WAAW,MAAA,IAAU,OAAA,CAAQ,YAAA,CAAa,eAAe,MAAM,MAAA,EAAQ;AACrE,UAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,MAAM,CAAA;AAAA,QACvD;AAAA,MACF,WAAW,MAAA,EAAQ;AACjB,QAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA,EAGA,QAAQ,OAAA,EAA4B;AAClC,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,UAAA,EAAY,IAAI,CAAA;AAC9C,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,eAAA,EAAiB,IAAI,CAAA;AAAA,EACrD;AAAA,EAMA,QAAA,CAAS,SAAsB,IAAA,EAA+C;AAC5E,IAAA,IAAA,CAAK,YAAA,CAAa,OAAO,OAAO,CAAA;AAChC,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,CAAO,OAAO,GAAG,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,QAAA,EAAU,IAAI,CAAA;AACjF,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,aAAA,EAAe,IAAI,CAAA;AACjD,IAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,cAAA,EAAgB,IAAI,CAAA;AAClD,IAAA,KAAA,MAAW,OAAA,IAAW,OAAA,CAAQ,gBAAA,CAA8B,QAAQ,CAAA,EAAG;AACrE,MAAA,IAAI,OAAA,CAAQ,aAAa,eAAe,CAAA,IAAK,KAAK,aAAA,CAAc,OAAA,EAAS,IAAI,CAAA,EAAG;AAC9E,QAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA,EAGA,UAAA,CAAW,QAAqB,QAAA,EAA8B;AAC5D,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,aAAA,CAAc,MAAM,CAAA;AAC3C,IAAA,IAAI,SAAA,KAAc,IAAA,EAAM,OAAO,CAAC,MAAA,CAAO,MAAA;AACvC,IAAA,OACE,QAAA,CAAS,MAAA,GAAS,CAAA,KACjB,IAAA,CAAK,UAAA,KAAe,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,SAAS,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,SAAS,CAAA,CAAA;AAAA,EAEpF;AAAA,EAGA,cAAc,MAAA,EAA6D;AACzE,IAAA,IAAI,MAAA,CAAO,YAAA,CAAa,mBAAmB,CAAA,EAAG;AAC5C,MAAA,OAAO,CAAC,OAAA,KAAY,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AAAA,IAC7C;AACA,IAAA,IAAI,MAAA,CAAO,YAAA,CAAa,qBAAqB,CAAA,EAAG;AAC9C,MAAA,OAAO,CAAC,OAAA,KAAY,CAAC,IAAA,CAAK,WAAW,OAAO,CAAA;AAAA,IAC9C;AACA,IAAA,MAAM,MAAA,GAAS,OAAO,OAAA,CAAQ,SAAA;AAC9B,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,OAAO,CAAC,OAAA,KAAY,IAAA,CAAK,aAAA,CAAc,SAAS,MAAM,CAAA;AAAA,IACxD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,WAAW,OAAA,EAA2B;AACpC,IAAA,OAAO,OAAA,YAAmB,oBAAoB,OAAA,CAAQ,OAAA;AAAA,EACxD;AAAA,EAGA,aAAA,CAAc,SAAkB,MAAA,EAAyB;AACvD,IAAA,IACE,mBAAmB,gBAAA,KAClB,OAAA,CAAQ,SAAS,UAAA,IAAc,OAAA,CAAQ,SAAS,OAAA,CAAA,EACjD;AACA,MAAA,OAAO,OAAA,CAAQ,OAAA,IAAW,OAAA,CAAQ,KAAA,KAAU,MAAA;AAAA,IAC9C;AACA,IAAA,OAAO,QAAQ,KAAA,KAAU,MAAA;AAAA,EAC3B;AAAA,EAGA,aAAA,CAAc,QAAqB,IAAA,EAA+C;AAChF,IAAA,MAAM,SAAS,QAAA,CAAS,aAAA;AACxB,IAAA,IAAI,UAAU,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,EAAG,IAAA,CAAK,WAAW,IAAI,CAAA;AAAA,EAC7D;AAAA,EAGA,WAAW,IAAA,EAA+C;AACxD,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,CAAe,IAAA;AAAA,MACtC,CAAC,YAAY,YAAA,CAAa,OAAO,KAAK,IAAA,CAAK,aAAA,CAAc,SAAS,IAAI;AAAA,KACxE;AACA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,IAAA,CAAK,cAAc,SAAA,EAAU;AAC7B,MAAA,WAAA,CAAY,KAAA,EAAM;AAClB,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA;AACpC,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA,EAGA,aAAA,CAAc,WAAwB,IAAA,EAAkD;AACtF,IAAA,OAAO,CAAC,GAAG,IAAI,CAAA,CAAE,MAAM,CAAC,CAAC,MAAA,EAAQ,OAAO,MAAM,OAAA,IAAW,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAC,CAAA;AAAA,EACtF;AAAA,EAGA,eAAA,CAAgB,OAAA,EAAkB,IAAA,EAAc,KAAA,EAAgC;AAC9E,IAAA,qBAAA,CAAsB,OAAA,EAAS,IAAA,EAAM,KAAA,EAAO,MAAM,IAAA,CAAK,UAAU,KAAA,CAAM,OAAA,EAAS,IAAA,EAAM,KAAK,CAAC,CAAA;AAAA,EAC9F;AAAA,EAGA,aAAa,OAAA,EAAiC;AAC5C,IAAA,MAAM,WAAW,IAAA,CAAK,cAAA;AACtB,IAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,IAAA,IACE,OAAA,CAAQ,IAAA;AAAA,MACN,CAAC,MAAA,KACC,MAAA,CAAO,MAAA,YAAkB,OAAA,IACzB,KAAK,oBAAA,CAAqB,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAO;AAAA,KAC9D,EACA;AACA,MAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,IAC3B;AAAA,EACF;AAAA,EAGA,oBAAA,CAAqB,MAAA,EAAiB,QAAA,EAAqB,OAAA,EAAiC;AAC1F,IAAA,OAAO,UAAA,CAAW,UAAU,MAAM,CAAA,KAAM,MAAM,UAAA,CAAW,OAAA,EAAS,MAAM,CAAA,KAAM,EAAA;AAAA,EAChF;AAAA,EAGA,mBAAmB,IAAA,EAAgC;AACjD,IAAA,OAAO,KAAK,cAAA,CAAe,IAAA,CAAK,CAAC,OAAA,KAAY,OAAA,CAAQ,SAAS,IAAI,CAAA;AAAA,EACpE;AACF","file":"conditional_fields_controller.js","sourcesContent":["/**\n * Reflects a serialized attribute value only when the current value differs.\n *\n * A same-value `setAttribute` still queues a mutation record for every observer, so an\n * unchanged value writes nothing.\n *\n * @param element - The element whose attribute is reflected.\n * @param name - The attribute name, using the non-namespaced DOM API.\n * @param value - The serialized value, or null to remove the attribute.\n * @param beforeWrite - Called only for a change, before the DOM mutation, so the\n * caller can record ownership or identify its own observer records.\n * @returns Whether an attribute was written or removed.\n */\nexport function setAttributeIfChanged(\n  element: Element,\n  name: string,\n  value: string | null,\n  beforeWrite?: () => void,\n): boolean {\n  if (element.getAttribute(name) === value) return false;\n  beforeWrite?.();\n  if (value === null) element.removeAttribute(name);\n  else element.setAttribute(name, value);\n  return true;\n}\n","/** The retained attributes, descendants, and inherited state one connection watches. */\nexport interface AuthoredMutationOptions {\n  readonly attributes: readonly string[];\n  readonly subtree?: boolean;\n  readonly childList?: boolean;\n  readonly ancestorAttributes?: readonly string[];\n}\n\n/** A final attribute value and the number of records its writes produce. */\ninterface AttributeClaim {\n  value: string | null;\n  count: number;\n}\n\n/** Added and removed nodes still represented by controller-owned child-list records. */\ninterface ChildClaim {\n  readonly added: Map<Node, number>;\n  readonly removed: Map<Node, number>;\n}\n\n/** Pending claims belong only to the active observed lifetime. */\ninterface MutationClaims {\n  readonly attributes: Map<Element, Map<string, AttributeClaim>>;\n  readonly children: Map<Node, ChildClaim>;\n}\n\n/**\n * Watches authored mutations without suspending observation during DOM repair.\n *\n * The consumer claims only actual writes, before an attribute write or immediately\n * after a synchronous helper writes. Matching uses the final value and one claim\n * per record, so an extra same-value page write remains authored. Child-list claims\n * identify the nodes a replacement adds and removes, independently of how the DOM\n * implementation splits those nodes into records. Every delivery or synchronous\n * take expires all claims before the consumer can move focus or notify subscribers.\n * Ownership, reconciliation, and DOM writes remain the consumer's responsibility.\n */\nexport class AuthoredMutationWatcher {\n  readonly #onAuthored: (records: MutationRecord[]) => void;\n  #claims: MutationClaims | null = null;\n  #observer: MutationObserver | null = null;\n\n  /** @param onAuthored - Receives a nonempty batch after controller records are excluded. */\n  constructor(onAuthored: (records: MutationRecord[]) => void) {\n    this.#onAuthored = onAuthored;\n  }\n\n  /** Starts a new connected lifetime, including the root's current ancestor chain. */\n  observe(root: Element, options: AuthoredMutationOptions): void {\n    this.disconnect();\n    const observer = new MutationObserver((records) => {\n      if (this.#observer !== observer) return;\n      const authored = this.#filter(records);\n      if (authored.length > 0) this.#onAuthored(authored);\n    });\n    this.#observer = observer;\n    this.#claims = { attributes: new Map(), children: new Map() };\n    observer.observe(root, {\n      attributes: true,\n      attributeFilter: [...options.attributes],\n      subtree: options.subtree ?? false,\n      childList: options.childList ?? false,\n    });\n    if (options.ancestorAttributes) {\n      let ancestor = root.parentElement;\n      while (ancestor) {\n        observer.observe(ancestor, {\n          attributes: true,\n          attributeFilter: [...options.ancestorAttributes],\n        });\n        ancestor = ancestor.parentElement;\n      }\n    }\n  }\n\n  /** Claims one actual attribute write; calls outside observation own no records. */\n  claim(target: Element, name: string, value: string | null): void {\n    const claims = this.#claims?.attributes;\n    let attributes = claims?.get(target);\n    if (!attributes) {\n      attributes = new Map();\n      claims?.set(target, attributes);\n    }\n    const pending = attributes.get(name);\n    attributes.set(name, { value, count: (pending?.count ?? 0) + 1 });\n  }\n\n  /** Claims a synchronous helper's actual attribute write before any external callback runs. */\n  claimCurrent(target: Element, name: string): void {\n    this.claim(target, name, target.getAttribute(name));\n  }\n\n  /** Claims the actual nodes added and removed by one synchronous child replacement. */\n  claimChildList(target: Node, added: readonly Node[], removed: readonly Node[]): void {\n    const claims = this.#claims?.children;\n    const pending = claims?.get(target) ?? { added: new Map(), removed: new Map() };\n    for (const node of added) pending.added.set(node, (pending.added.get(node) ?? 0) + 1);\n    for (const node of removed) pending.removed.set(node, (pending.removed.get(node) ?? 0) + 1);\n    claims?.set(target, pending);\n  }\n\n  /** Returns queued authored records synchronously and expires every pending claim. */\n  take(): MutationRecord[] {\n    return this.#filter(this.#observer?.takeRecords() ?? []);\n  }\n\n  /** Releases observation and claims; safe to repeat and reuse on a later connection. */\n  disconnect(): void {\n    this.#observer?.disconnect();\n    this.#observer = null;\n    this.#claims = null;\n  }\n\n  /** Applies one batch's claims before handing control back to the consumer. */\n  #filter(records: MutationRecord[]): MutationRecord[] {\n    const authored = records.filter((record) => !this.#consume(record));\n    this.#claims?.attributes.clear();\n    this.#claims?.children.clear();\n    return authored;\n  }\n\n  /**\n   * Matches the native attribute or nonempty child-list records this watcher registers.\n   * @see https://dom.spec.whatwg.org/#queue-a-tree-mutation-record\n   */\n  #consume(record: MutationRecord): boolean {\n    if (record.type === \"attributes\") {\n      const target = record.target as Element;\n      const pending = this.#claims?.attributes.get(target)?.get(record.attributeName as string);\n      if (\n        !pending ||\n        pending.count === 0 ||\n        target.getAttribute(record.attributeName as string) !== pending.value\n      ) {\n        return false;\n      }\n      pending.count -= 1;\n      return true;\n    }\n    const pending = this.#claims?.children.get(record.target);\n    if (!pending) return false;\n    const added = [...record.addedNodes];\n    const removed = [...record.removedNodes];\n    if (\n      added.some((node) => !pending.added.get(node)) ||\n      removed.some((node) => !pending.removed.get(node))\n    ) {\n      return false;\n    }\n    for (const node of added) pending.added.set(node, (pending.added.get(node) ?? 0) - 1);\n    for (const node of removed) pending.removed.set(node, (pending.removed.get(node) ?? 0) - 1);\n    return true;\n  }\n}\n","/**\n * Resolves which of a controller's elements owns a node.\n *\n * A delegated listener hears events from a whole subtree, so the handler's first\n * job is almost always the same question: which item, handle, or control does\n * this `event.target` belong to? The same question comes up for a\n * `MutationRecord.target`, for `document.activeElement`, and for a\n * `relatedTarget` on the way out of a hover region.\n *\n * The answer is `Node.contains()`, which is **inclusive** — an element contains\n * itself — so testing the candidate for identity as well would be redundant.\n *\n * **The guard is what makes this safe to call with a raw event target.**\n * `event.target` is typed `EventTarget | null`, and `contains()` takes a `Node?`:\n * browsers throw `TypeError` for anything else, and `window` — the everyday\n * `EventTarget` that is not a `Node` — is what an event dispatched at it carries.\n * Narrowing here means a caller never has to cast, and the rule cannot drift\n * between the places that ask the question.\n *\n * Scope stays with the caller. These helpers say *which candidate owns the node*,\n * not *whether the node belongs to this controller at all* — a component with\n * nested instances of itself decides that first (by comparing the closest\n * annotated ancestor) and passes the candidates it owns.\n *\n * Candidates can nest, and then more than one holds the node: {@link ownerIndex}\n * and {@link ownerOf} answer the first one listed, {@link ownersOf} all of them.\n */\n\n/**\n * Index in `candidates` of the first one that is, or contains, `node`.\n *\n * `-1` when none does, when `node` is absent, and when it is an `EventTarget`\n * that is not a `Node`. Candidates are tested in array order, so a nested pair\n * resolves to whichever the caller listed first.\n */\nexport function ownerIndex<T extends Element>(\n  candidates: readonly T[],\n  node: EventTarget | null | undefined,\n): number {\n  if (!(node instanceof Node)) return -1;\n  return candidates.findIndex((candidate) => candidate.contains(node));\n}\n\n/**\n * The first candidate that is, or contains, `node`; `null` when none does.\n *\n * A miss indexes the array at `-1`, which reads as `undefined` and lands on the\n * same `null` the absent cases produce.\n */\nexport function ownerOf<T extends Element>(\n  candidates: readonly T[],\n  node: EventTarget | null | undefined,\n): T | null {\n  return candidates[ownerIndex(candidates, node)] ?? null;\n}\n\n/**\n * Every candidate that is, or contains, `node`, in array order.\n *\n * Empty when none does, when `node` is absent, and when it is an `EventTarget`\n * that is not a `Node`. A caller asking whether any owner of a node refuses\n * something reads the whole list, since an owner nested in another one holds the\n * node too.\n */\nexport function ownersOf<T extends Element>(\n  candidates: readonly T[],\n  node: EventTarget | null | undefined,\n): T[] {\n  if (!(node instanceof Node)) return [];\n  return candidates.filter((candidate) => candidate.contains(node));\n}\n","/**\n * Whether a disabled `<fieldset>` ancestor actually reaches `control`.\n *\n * HTML exempts the contents of a fieldset's **first direct-child `<legend>`**, and\n * the exemption is per fieldset — a control legal in one legend can still be\n * disabled by a second, outer fieldset, so the walk continues upward.\n *\n * Exported on its own for callers that need the disabled-inheritance rule without\n * the rest of {@link canTakeFocus} — a control's availability check, or a `hidden`\n * walk bounded at a widget root, which is a different rule to compose with.\n */\nexport function inheritsFieldsetDisabled(control: HTMLElement): boolean {\n  let fieldset: Element | null = control.closest(\"fieldset[disabled]\");\n  while (fieldset) {\n    const legend = Array.from(fieldset.children).find((child) => child.tagName === \"LEGEND\");\n    if (!legend?.contains(control)) return true;\n    fieldset = fieldset.parentElement?.closest(\"fieldset[disabled]\") ?? null;\n  }\n  return false;\n}\n\n/**\n * Whether the engine reports `element` assigned to no slot of the open shadow root its parent\n * hosts: such an element is not in the flat tree, so it and what it holds are rendered nowhere\n * and cannot take focus.\n */\nfunction unslotted(element: Element): boolean {\n  return element.assignedSlot === null && element.parentElement?.shadowRoot != null;\n}\n\n/**\n * The parent of `element` in the flat tree: the slot it is assigned to, its parent element,\n * or the host of the shadow root it is a child of; `null` at the top of the document or of a\n * detached tree, and for an element the engine assigns to no slot of the open shadow root its\n * parent hosts, which is outside the flat tree. A closed shadow root does not report its slots,\n * so an element assigned to one climbs to the host.\n */\nexport function flatTreeParent(element: Element): Element | null {\n  if (unslotted(element)) return null;\n  const parent = element.assignedSlot ?? element.parentNode;\n  if (parent instanceof ShadowRoot) return parent.host;\n  return parent instanceof Element ? parent : null;\n}\n\n/** Whether `element` is `ancestor` or one of its descendants in the flat tree. */\nexport function flatTreeContains(ancestor: Element, element: Element | null): boolean {\n  for (let node = element; node; node = flatTreeParent(node)) {\n    if (node === ancestor) return true;\n  }\n  return false;\n}\n\n/** The nearest of `element` and its flat-tree ancestors that matches `selector`, or `null`. */\nexport function closestInFlatTree(element: Element, selector: string): Element | null {\n  for (let node: Element | null = element; node; node = flatTreeParent(node)) {\n    if (node.matches(selector)) return node;\n  }\n  return null;\n}\n\n/**\n * The children of `element` in the flat tree: its open shadow root's children, a slot's\n * assigned elements (its own children when nothing is assigned to it), or its children.\n */\nexport function flatTreeChildren(element: Element): Element[] {\n  return ownedScope(element) ?? Array.from(element.children);\n}\n\n/**\n * Whether an element can actually take focus, checked **before** `focus()` runs.\n *\n * A controller that must move focus off a control it is about to disable or hide\n * picks a destination and calls `focus()` on it. If that destination cannot take\n * focus, the call **fails silently**: `hidden` and natively `disabled` elements\n * swallow it, so the caret stays in the subtree that is disappearing and lands on\n * `<body>` a frame later — the exact outcome the rescue exists to prevent, minus\n * any signal that it happened.\n *\n * Testing after the fact is the obvious alternative and is deliberately not the\n * rule. Reading `document.activeElement` back only works in a real browser, and\n * looping over candidates that way performs a real focus move per failure —\n * observable to assistive technology. Checking first costs nothing and catches\n * the cases that actually occur.\n *\n * **`aria-disabled` is not disqualifying.** It is the attribute an author uses\n * for a control that must stay *discoverable*, and the roving contract keeps\n * such items reachable. Only the conditions that make the platform refuse\n * focus are checked: `hidden` / `inert` on the element or a flat-tree ancestor\n * (the host of an open shadow root it sits in, the slot it is assigned to), the\n * element or an ancestor left out of the flat tree (one the engine assigns to no\n * slot of the open shadow root its parent hosts), `input[type=\"hidden\"]`, the\n * native `disabled` property, and `disabled` inherited from an ancestor\n * `fieldset`. CSS-only invisibility is handled by {@link isRenderedForFocus}\n * when a consumer needs sequential-focus semantics.\n *\n * Reading `:disabled` instead of walking the fieldset chain would be shorter, but\n * that pseudo-class is not evaluated consistently outside real browsers and this\n * has to be right headlessly too. happy-dom in particular focuses a `<button>`\n * inside a disabled fieldset where a real engine refuses, so the inheritance is\n * spelled out rather than delegated.\n *\n * What a consumer does when nothing survives is its own call: some fall back to\n * their landmark, while a widget whose caret already sits somewhere legitimate\n * refuses the move outright rather than relocating it.\n *\n * @example\n * ```ts\n * const target = candidates.find(canTakeFocus);\n * if (target) target.focus();\n * else {\n *   this.#tabindex.lend(this.element); // nothing left: fall back to the landmark\n *   this.element.focus();\n * }\n * ```\n *\n * @param element - the candidate destination\n */\nexport function canTakeFocus(element: HTMLElement): boolean {\n  for (let node: Element | null = element; node; node = flatTreeParent(node)) {\n    if (unslotted(node) || node.matches(\"[hidden], [inert]\")) return false;\n  }\n  if (element instanceof HTMLInputElement && element.type === \"hidden\") return false;\n  if (!(\"disabled\" in element)) return true;\n  if ((element as HTMLElement & { disabled: boolean }).disabled) return false;\n  return !inheritsFieldsetDisabled(element);\n}\n\n/** Elements whose semantics or authored attributes can place them in sequential focus order. */\nexport const TAB_STOP_CANDIDATE_SELECTOR = [\n  \"a[href]\",\n  \"area[href]\",\n  \"button\",\n  \"input\",\n  \"select\",\n  \"textarea\",\n  \"summary\",\n  \"iframe\",\n  \"audio[controls]\",\n  \"video[controls]\",\n  \"[tabindex]\",\n  \"[contenteditable]\",\n].join(\",\");\n\n/** Optional browser visibility API used to exclude CSS-hidden candidates. */\ninterface VisibilityCheckable {\n  checkVisibility?: (options?: { visibilityProperty?: boolean }) => boolean;\n}\n\n/** Whether CSS visibility allows an otherwise eligible element to participate in focus order. */\nexport function isRenderedForFocus(element: HTMLElement): boolean {\n  const check = (element as HTMLElement & VisibilityCheckable).checkVisibility;\n  return typeof check === \"function\" ? check.call(element, { visibilityProperty: true }) : true;\n}\n\n/** Parses an authored `tabindex`; invalid syntax has no explicit focus-order meaning. */\nfunction authoredTabindex(element: Element): number | null {\n  const value = element.getAttribute(\"tabindex\");\n  if (value === null || !/^[+-]?\\d+$/.test(value.trim())) return null;\n  return Number(value);\n}\n\n/** Whether the element's native semantics place it in sequential focus order. */\nfunction hasNativeTabStop(element: HTMLElement): boolean {\n  if (element instanceof HTMLAnchorElement || element instanceof HTMLAreaElement) {\n    return element.hasAttribute(\"href\");\n  }\n  if (\n    element instanceof HTMLButtonElement ||\n    element instanceof HTMLSelectElement ||\n    element instanceof HTMLTextAreaElement\n  ) {\n    return true;\n  }\n  if (element instanceof HTMLInputElement) return element.type !== \"hidden\";\n  if (element instanceof HTMLIFrameElement) return true;\n  if (element.tagName === \"AUDIO\" || element.tagName === \"VIDEO\") {\n    return element.hasAttribute(\"controls\");\n  }\n  if (element instanceof HTMLElement && element.tagName === \"SUMMARY\") {\n    const details = element.parentElement;\n    return (\n      details instanceof HTMLDetailsElement &&\n      Array.from(details.children).find((child) => child.tagName === \"SUMMARY\") === element\n    );\n  }\n  return false;\n}\n\n/** Whether an explicit `contenteditable` value creates an editable tab stop. */\nfunction hasEditableTabStop(element: HTMLElement): boolean {\n  const value = element.getAttribute(\"contenteditable\")?.toLowerCase();\n  return value === \"\" || value === \"true\" || value === \"plaintext-only\";\n}\n\n/**\n * Whether an element is a usable sequential Tab stop right now.\n *\n * Native semantics, authored `tabindex`, editable hosts, inherited disabled state,\n * HTML `hidden`/`inert`, and CSS visibility are evaluated together. `aria-disabled`\n * remains focusable because it communicates unavailability without removing the\n * control from discovery order.\n */\nexport function isTabStop(element: HTMLElement): boolean {\n  if (!canTakeFocus(element) || !isRenderedForFocus(element)) return false;\n\n  const tabindex = authoredTabindex(element);\n  if (tabindex !== null) return tabindex >= 0;\n  return hasNativeTabStop(element) || hasEditableTabStop(element);\n}\n\n/** Returns every usable sequential Tab stop below `root` in document order. */\nexport function tabStopsWithin(root: ParentNode): HTMLElement[] {\n  return Array.from(root.querySelectorAll<HTMLElement>(TAB_STOP_CANDIDATE_SELECTOR)).filter(\n    isTabStop,\n  );\n}\n\n/** Returns the first usable sequential Tab stop below `root`, if one exists. */\nexport function firstTabStop(root: ParentNode): HTMLElement | null {\n  for (const candidate of root.querySelectorAll<HTMLElement>(TAB_STOP_CANDIDATE_SELECTOR)) {\n    if (isTabStop(candidate)) return candidate;\n  }\n  return null;\n}\n\n/** Whether `root` contains at least one usable sequential Tab stop. */\nexport function hasTabStop(root: ParentNode): boolean {\n  return firstTabStop(root) !== null;\n}\n\n/** An element sequential focus navigation can stop on. */\nexport type TabStopElement = HTMLElement | SVGElement;\n\n/** Whether the element is a radio button. */\nfunction isRadio(element: Element | null): element is HTMLInputElement {\n  return element instanceof HTMLInputElement && element.type === \"radio\";\n}\n\n/**\n * Whether two radios form one group: the same non-empty `name`, the same form owner and\n * the same tree. A radio without a name is a group of its own.\n */\nfunction sameRadioGroup(a: HTMLInputElement, b: HTMLInputElement): boolean {\n  return (\n    a.name !== \"\" && a.name === b.name && a.form === b.form && a.getRootNode() === b.getRootNode()\n  );\n}\n\n/**\n * Whether the element is part of editable content: the nearest ancestor that sets a valid\n * `contenteditable` decides. `false` ends the editable region (a non-editable island\n * inside an editor); an invalid value inherits from further up.\n */\nfunction isInEditableContent(element: Element): boolean {\n  for (let node = element.parentElement; node; node = node.parentElement) {\n    if (node.getAttribute(\"contenteditable\")?.toLowerCase() === \"false\") return false;\n    if (hasEditableTabStop(node)) return true;\n  }\n  return false;\n}\n\n/** The XLink namespace, where an SVG link may carry its `href`. */\nconst XLINK_NAMESPACE = \"http://www.w3.org/1999/xlink\";\n\n/** Whether the element is an SVG link: an SVG `a` with `href` or `xlink:href`. */\nfunction isSvgLink(element: Element): boolean {\n  return (\n    element instanceof SVGElement &&\n    element.localName === \"a\" &&\n    (element.hasAttribute(\"href\") || element.hasAttributeNS(XLINK_NAMESPACE, \"href\"))\n  );\n}\n\n/**\n * Whether an image-map area has a rendered image: an `img` in the area's tree whose\n * `usemap` names the area's map (by `name`, or by `id` without one) and that is rendered.\n * The area has no box of its own for {@link isRenderedForFocus} to check.\n */\nfunction hasRenderedImage(area: HTMLAreaElement): boolean {\n  const map = area.closest(\"map\");\n  const key = map?.name || map?.id;\n  if (!map || !key) return false;\n  const root = map.getRootNode() as Document | ShadowRoot;\n  return Array.from(root.querySelectorAll<HTMLElement>(\"img[usemap]\")).some(\n    (image) => image.getAttribute(\"usemap\") === `#${key}` && isRenderedForFocus(image),\n  );\n}\n\n/** Whether the element can take focus and has no negative `tabindex`. */\nfunction isFocusableInOrder(element: TabStopElement): boolean {\n  const tabindex = authoredTabindex(element);\n  return (tabindex === null || tabindex >= 0) && canTakeFocus(element as HTMLElement);\n}\n\n/**\n * The engine's verdict for the stops {@link isTabStop} does not judge the way sequential\n * navigation does, or `null` for every other element: an image-map area with an `href` or\n * its own `tabindex` stops while an image that uses its map is rendered; an object stops\n * while it holds a nested document, as an iframe does; an SVG link stops while it is\n * rendered. Each also needs to take focus and not be taken out of the order with a\n * negative `tabindex`.\n */\nfunction extraStop(element: TabStopElement): boolean | null {\n  if (element instanceof HTMLAreaElement) {\n    const focusable = element.hasAttribute(\"href\") || authoredTabindex(element) !== null;\n    return focusable && isFocusableInOrder(element) && hasRenderedImage(element);\n  }\n  if (element instanceof HTMLObjectElement) {\n    return (\n      isFocusableInOrder(element) && isRenderedForFocus(element) && element.contentWindow !== null\n    );\n  }\n  if (isSvgLink(element))\n    return isFocusableInOrder(element) && isRenderedForFocus(element as HTMLElement);\n  return null;\n}\n\n/**\n * Whether sequential navigation stops on the element: a usable Tab stop\n * ({@link isTabStop}), or one of the stops `extraStop` judges, except a link inside\n * editable content without a `tabindex` of its own, which the engine leaves to editing.\n * Other controls inside an editing host, and the host itself, stay stops.\n */\nfunction isSequentialStop(element: TabStopElement): boolean {\n  const stop =\n    extraStop(element) ??\n    (element.matches(TAB_STOP_CANDIDATE_SELECTOR) && isTabStop(element as HTMLElement));\n  if (!stop) return false;\n  const link =\n    element instanceof HTMLAnchorElement ||\n    element instanceof HTMLAreaElement ||\n    isSvgLink(element);\n  return !(link && authoredTabindex(element) === null && isInEditableContent(element));\n}\n\n/**\n * The elements of the focus navigation scope `element` owns: its open shadow root's\n * children, or a slot's assigned elements (its fallback content when nothing is\n * assigned). `null` when it owns no scope. A closed shadow root cannot be read, so its\n * host owns none.\n */\nfunction ownedScope(element: Element): Element[] | null {\n  if (element.shadowRoot) return Array.from(element.shadowRoot.children);\n  if (element instanceof HTMLSlotElement) {\n    const assigned = element.assignedElements();\n    return assigned.length > 0 ? assigned : Array.from(element.children);\n  }\n  return null;\n}\n\n/** One member of a focus navigation scope: its tabindex and the stops it contributes. */\ninterface ScopeEntry {\n  readonly tabindex: number;\n  readonly stops: TabStopElement[];\n}\n\n/** What a walk of the order records besides the order itself. */\ninterface OrderWalk {\n  /** The element a move starts from. */\n  readonly from: Element | null;\n  /** Every stop, in flat-tree order. */\n  readonly tree: TabStopElement[];\n  /**\n   * How many entries of {@link OrderWalk.tree} come before `from`; `-1` until the walk\n   * meets it.\n   */\n  fromAt: number;\n}\n\n/**\n * Orders one focus navigation scope the way HTML's sequential navigation does: members\n * with a positive `tabindex` first, ascending, ties in tree order, then the rest in tree\n * order. A member that owns a scope (a shadow host, a slot) is followed by that scope's\n * own order; one taken out of the order with a negative `tabindex` takes its scope with it.\n */\nfunction orderScope(elements: Element[], walk: OrderWalk): TabStopElement[] {\n  const entries: ScopeEntry[] = [];\n  const visit = (element: Element): void => {\n    if (element === walk.from) walk.fromAt = walk.tree.length;\n    const tabindex = authoredTabindex(element) ?? 0;\n    const stop =\n      (element instanceof HTMLElement || element instanceof SVGElement) && isSequentialStop(element)\n        ? element\n        : null;\n    if (stop) walk.tree.push(stop);\n    const owned = ownedScope(element);\n    if (owned) {\n      if (tabindex >= 0) {\n        entries.push({ tabindex, stops: [...(stop ? [stop] : []), ...orderScope(owned, walk)] });\n      }\n      return;\n    }\n    if (stop) entries.push({ tabindex, stops: [stop] });\n    for (const child of Array.from(element.children)) visit(child);\n  };\n  for (const element of elements) visit(element);\n  const positive = entries.filter((entry) => entry.tabindex > 0);\n  positive.sort((a, b) => a.tabindex - b.tabindex);\n  const rest = entries.filter((entry) => entry.tabindex === 0);\n  return [...positive, ...rest].flatMap((entry) => entry.stops);\n}\n\n/**\n * Whether a candidate passes the radio-group rule the engine applies: a checked radio\n * among the stops always does; an unchecked one only as the first radio of a group with\n * no checked stop, and not while focus is on a radio of that group. `tree` is the walk's\n * stops in flat-tree order, so a group is counted within the walked root only.\n */\nfunction passesRadioRule(\n  element: TabStopElement,\n  tree: TabStopElement[],\n  focusedRadio: HTMLInputElement | null,\n): boolean {\n  if (!isRadio(element) || element.checked) return true;\n  const group = tree.filter(\n    (stop): stop is HTMLInputElement =>\n      stop === element || (isRadio(stop) && sameRadioGroup(stop, element)),\n  );\n  if (group.some((radio) => radio.checked)) return false;\n  if (group[0] !== element) return false;\n  return focusedRadio === null || !sameRadioGroup(focusedRadio, element);\n}\n\n/**\n * The index in `order` a move from the walk's `from` visits first. A start the walk did\n * not meet is outside: the move enters at the first stop, or the last going backward. A\n * start that is a stop moves one place along the order. Any other start (the root, an\n * element with a negative `tabindex`) moves to the nearest stop after it in tree order,\n * or before it going backward, and wraps when there is none.\n */\nfunction startIndex(\n  order: TabStopElement[],\n  walk: OrderWalk,\n  backward: boolean,\n  isStop: (element: TabStopElement) => boolean,\n): number {\n  if (walk.fromAt < 0) return backward ? order.length - 1 : 0;\n  const at = order.indexOf(walk.from as TabStopElement);\n  if (at >= 0) return backward ? at - 1 : at + 1;\n  const neighbour = backward\n    ? walk.tree.slice(0, walk.fromAt).reverse().find(isStop)\n    : walk.tree.slice(walk.fromAt).find(isStop);\n  if (neighbour) return order.indexOf(neighbour);\n  return backward ? order.length - 1 : 0;\n}\n\n/**\n * The stops below `root` in the order a sequential move from `from` visits them: the\n * next stop first (the previous one when `backward`), wrapping at the ends, with `from`\n * itself left out. Without a `from` — or with one outside `root` — the list starts at the\n * first stop, or at the last one when `backward`.\n *\n * The order is HTML's sequential navigation order within `root`: positive `tabindex`\n * first, ascending, then `tabindex=\"0\"` and native stops in tree order. Open shadow roots\n * are walked in flat-tree order, slots expanded, each scope ordered on its own; a closed\n * shadow root is not read. A radio group, counted within `root`, stops once: on its\n * checked radio when that radio can take focus, even with focus elsewhere in the group,\n * and otherwise on its first radio that can, unless focus is already in the group.\n * A link inside editable content without its own `tabindex` is not a stop. Every stop\n * also passes its applicable focusability and rendering checks.\n *\n * @param root - The element whose descendants are ordered; it is not a stop itself.\n * @param from - Where the move starts, usually {@link deepActiveElement}.\n * @param backward - Whether the move goes backward (`Shift+Tab`).\n */\nexport function sequentialTabStops(\n  root: Element,\n  from: Element | null = null,\n  backward = false,\n): TabStopElement[] {\n  const walk: OrderWalk = { from, tree: [], fromAt: from === root ? 0 : -1 };\n  const order = orderScope(ownedScope(root) ?? Array.from(root.children), walk);\n  const focusedRadio = walk.fromAt >= 0 && isRadio(from) ? from : null;\n  const isStop = (element: TabStopElement): boolean =>\n    passesRadioRule(element, walk.tree, focusedRadio);\n  const start = startIndex(order, walk, backward, isStop);\n  const visited = backward\n    ? [...order.slice(0, start + 1).reverse(), ...order.slice(start + 1).reverse()]\n    : [...order.slice(start), ...order.slice(0, start)];\n  return visited.filter((element) => element !== from && isStop(element));\n}\n\n/**\n * The element that holds focus in `ownerDocument`, looking through open shadow roots:\n * `document.activeElement` stops at a shadow host. A closed shadow root cannot be read,\n * so focus inside one reads as its host.\n */\nexport function deepActiveElement(ownerDocument: Document): Element | null {\n  let active = ownerDocument.activeElement;\n  while (active?.shadowRoot?.activeElement) active = active.shadowRoot.activeElement;\n  return active;\n}\n","/**\n * Runs a controller's reconciliation pass after a native form reset has\n * restored the form's own controls.\n *\n * **A microtask alone is not \"after the reset\", and the reason is where the\n * dispatch came from.** `form.reset()` fires the event and restores the\n * controls inside one script frame, so a microtask queued from a listener lands\n * after both. A reset the user triggers — activating a `reset` button — is\n * dispatched by the browser with an empty script stack, so the microtask\n * checkpoint runs the moment the listener returns: still inside the dispatch,\n * before the controls are restored and before a later listener has had its\n * chance to cancel. Reconciling there reads the pre-reset values and treats a\n * cancelled reset as a real one.\n *\n * The event itself tells the two origins apart. `eventPhase` returns to\n * `Event.NONE` at the end of dispatch, so a microtask that sees `NONE` is\n * already past the default action and settles on the spot — that is the\n * scripted path, and its timing is exactly a microtask. A microtask\n * that still sees a dispatch phase is the browser-driven path and settles on\n * the next animation frame instead: the default action completes before that\n * frame, and `defaultPrevented` has reached its final value. A frame is only\n * ever reached from a real user interaction, which requires a rendered\n * document, so the frame cannot starve.\n *\n * Pending frames are held per handle rather than collapsed into one slot: a set\n * needs no branch to stay accurate, and every handle in it is cancellable at\n * teardown.\n *\n * Scope is the timing and the ownership test only. *What* to reconcile — an\n * aggregate, a visibility pass, a re-read of every field — stays in the\n * controller, because no two consumers answer it the same way. Ownership stays\n * there too: a control associated through `form=` is reached by the consumer's\n * own `control.form` read.\n *\n * @example\n * ```ts\n * readonly #formReset = new FormResetWatcher(\n *   (form) => this.fieldTargets.some((field) => field.form === form),\n *   () => this.#reconcile.schedule(),\n * );\n *\n * connect()    { this.#formReset.observe(); }\n * disconnect() { this.#formReset.disconnect(); }\n * ```\n */\nexport class FormResetWatcher {\n  readonly #owns: (form: HTMLFormElement) => boolean;\n  readonly #onReset: () => void;\n  readonly #frames = new Set<number>();\n  #generation = 0;\n\n  /**\n   * @param owns - whether `form` owns a control this controller derives from.\n   * @param onReset - the reconciliation pass, run once per honoured reset.\n   */\n  constructor(owns: (form: HTMLFormElement) => boolean, onReset: () => void) {\n    this.#owns = owns;\n    this.#onReset = onReset;\n  }\n\n  /** Subscribes to `reset` at the document; call from `connect()`. Idempotent. */\n  observe(): void {\n    document.addEventListener(\"reset\", this.#handleReset, true);\n  }\n\n  /** Unsubscribes and drops every pending pass; call from `disconnect()`. */\n  disconnect(): void {\n    document.removeEventListener(\"reset\", this.#handleReset, true);\n    this.#generation += 1;\n    for (const frame of this.#frames) cancelAnimationFrame(frame);\n    this.#frames.clear();\n  }\n\n  readonly #handleReset = (event: Event): void => {\n    const form = event.target;\n    if (!(form instanceof HTMLFormElement) || !this.#owns(form)) return;\n    const generation = this.#generation;\n    queueMicrotask(() => {\n      // A pass queued before teardown must not reach a disconnected controller.\n      if (generation !== this.#generation) return;\n      if (event.eventPhase === Event.NONE) {\n        this.#settle(event);\n        return;\n      }\n      const frame = requestAnimationFrame(() => {\n        this.#frames.delete(frame);\n        this.#settle(event);\n      });\n      this.#frames.add(frame);\n    });\n  };\n\n  /** Runs the pass unless a listener cancelled the reset before it landed. */\n  #settle(event: Event): void {\n    if (!event.defaultPrevented) this.#onReset();\n  }\n}\n","/** What {@link ListenerSet.add} passes on besides the signal it supplies itself. */\nexport type ListenerOptions = Omit<AddEventListenerOptions, \"signal\">;\n\n/**\n * The event map a target's own `addEventListener` types its handlers with: the\n * window's, a document's, an HTML or SVG element's, any other element's, or a\n * media query list's. Other targets name none.\n */\ntype EventMapOf<T extends EventTarget> = T extends Window\n  ? WindowEventMap\n  : T extends Document\n    ? DocumentEventMap\n    : T extends HTMLElement\n      ? HTMLElementEventMap\n      : T extends SVGElement\n        ? SVGElementEventMap\n        : T extends Element\n          ? ElementEventMap\n          : T extends MediaQueryList\n            ? MediaQueryListEventMap\n            : Record<never, never>;\n\n/**\n * Owns every listener a controller attaches for one connected lifetime and\n * releases them together, so an event name is spelled once and the release\n * cannot drift from the registration.\n *\n * Detaching by hand repeats three things at the release site — the type, the\n * handler reference and the capture flag — and any one of them drifting leaves\n * a listener alive on an element the controller no longer drives. Aborting the\n * signal a registration was created with releases it whatever it was made of,\n * so the release site names nothing.\n *\n * One set per lifetime, held as a field and never rebuilt.\n * {@link ListenerSet.dispose} is the only thing that closes a generation, and it opens\n * the next one in the same step, so the lifecycle hooks can call `add` and\n * `dispose` in any order any number of times, and no `add` ever meets an\n * already aborted signal — a DOM that registers a listener on such a signal\n * would keep it forever. Rebuilding the set instead would leak:\n * `addEventListener` matches an existing registration on target, type, callback\n * and capture alone, so re-adding the same handler while the first registration\n * is live is discarded, and that live registration keeps the signal it was\n * attached with — a set built by a second `connect()` can never release what it\n * appears to own.\n *\n * Scope is the registration only. Timers, observers, leases and the order they\n * are unwound in stay with the controller, which places `dispose()` in its\n * cleanup sequence. A receiver that changes at runtime (a\n * swapped target) is rebound by calling `dispose()` and then `add()` again from\n * the rebind, not by a second set.\n *\n * A lifetime shorter than the connection — while a Value holds, until a first\n * load, while a subscription is open — gets a set of its own, which the end of\n * that lifetime disposes. A controller therefore holds one set per lifetime: the\n * connection's, and one for each swapped receiver or shorter span.\n *\n * The set must own every registration of a tuple it holds: a listener the same\n * target already carries for the same type, callback and capture flag keeps the\n * right to remove it, and this set's `add` for that tuple is discarded. A\n * subscription shared between instances behind a participant count, listeners of\n * several elements that come and go one at a time, and those one gesture holds\n * keep their own pair of calls or a signal of their own.\n *\n * @example\n * ```ts\n * readonly #listeners = new ListenerSet();\n *\n * connect(): void {\n *   this.#listeners.add(this.element, \"submit\", this.#onNativeSubmit, { capture: true });\n *   this.#listeners.add(this.element, \"turbo:submit-start\", this.#onSubmitStart);\n *   this.#listeners.add(this.element, \"turbo:submit-end\", this.#onSubmitEnd);\n * }\n *\n * disconnect(): void {\n *   this.#listeners.dispose();\n * }\n * ```\n */\nexport class ListenerSet {\n  /** The generation every `add` joins until the next `dispose()`. */\n  #abort = new AbortController();\n\n  /**\n   * Attaches `handler` to the open generation, exactly as the caller spelled it.\n   *\n   * The set supplies the signal, so `options` carries everything else the DOM\n   * accepts — `capture` included. A removal by hand would have to repeat that\n   * flag; aborting the signal releases the listener without it.\n   *\n   * A `type` the target's own event map names types `handler` with that event,\n   * as the target's `addEventListener` does, so a handler written for a\n   * `KeyboardEvent` is passed as it is; any other `type` takes an\n   * `EventListener`.\n   */\n  add<T extends EventTarget, K extends keyof EventMapOf<T> & string>(\n    target: T,\n    type: K,\n    handler: (event: EventMapOf<T>[K]) => void,\n    options?: ListenerOptions,\n  ): void;\n  add(target: EventTarget, type: string, handler: EventListener, options?: ListenerOptions): void;\n  add(target: EventTarget, type: string, handler: EventListener, options?: ListenerOptions): void {\n    target.addEventListener(type, handler, { ...options, signal: this.#abort.signal });\n  }\n\n  /**\n   * Releases every listener of the open generation, synchronously, and opens the\n   * next one. Idempotent, and safe before anything has been added.\n   */\n  dispose(): void {\n    this.#abort.abort();\n    this.#abort = new AbortController();\n  }\n}\n","/**\n * Collapses many Stimulus lifecycle callbacks from one DOM mutation into a\n * single pass.\n *\n * Stimulus fires `<name>TargetConnected` / `Disconnected` once per element and\n * `<name>ValueChanged` once per changed attribute. Replacing a list of N options\n * or morphing several render Values therefore delivers N callbacks — but the\n * useful unit of work is \"reconcile against the resulting declarative input\",\n * once, after the batch has settled. Every controller with reconcilable targets\n * or render Values needs the same shape: a `queued` flag plus `queueMicrotask`.\n *\n * **A microtask is the right horizon, and the reason is specific.** Stimulus\n * drives these callbacks from a `MutationObserver`, whose own callback already\n * runs as a microtask with the whole batch in hand; scheduling one more lands\n * after the last sibling callback of that batch and still before paint or any\n * event handler. A timer would be later than it needs to be, and reconciling\n * synchronously would run once per element against a half-applied DOM.\n *\n * **The two guards are not the same guard.** Scheduling is refused before the\n * controller connects, and running is refused after it disconnects:\n *\n * - **Before `connect()`** — Stimulus delivers initial target and Value callbacks\n *   ahead of `connect()`. Reconciling there would compute output against a\n *   controller whose own state has not been initialised, and `connect()` is\n *   about to do a full pass anyway.\n * - **After `disconnect()`** — Stimulus fires a callback for **every** target\n *   during teardown, and a microtask queued just before it would otherwise run\n *   against a detached tree. {@link MicrotaskCoalescer.cancel} exists for the\n *   teardown path to drop the pending pass outright.\n *\n * Both guards are part of one contract here rather than something each consumer\n * has to remember separately.\n *\n * Scope is the scheduling only. *What* to reconcile — keep the surviving active\n * option, fall back to the next / previous / first visible one, rebuild derived\n * chips or hidden fields — stays in the controller, because no two consumers\n * answer it the same way.\n *\n * @example\n * ```ts\n * readonly #reconcile = new MicrotaskCoalescer(() => this.#reconcileOptions());\n *\n * connect()    { this.#reconcile.activate(); }\n * disconnect() { this.#reconcile.cancel(); }\n *\n * optionTargetConnected()    { this.#reconcile.schedule(); }\n * optionTargetDisconnected() { this.#reconcile.schedule(); }\n * ```\n */\nexport class MicrotaskCoalescer {\n  readonly #run: () => void;\n  #queued = false;\n  #active = false;\n  #generation = 0;\n\n  /** @param run - the single reconciliation pass, invoked at most once per batch. */\n  constructor(run: () => void) {\n    this.#run = run;\n  }\n\n  /** Opens the window in which {@link schedule} is honoured; call from `connect()`. */\n  activate(): void {\n    this.#active = true;\n  }\n\n  /** Closes the window and drops any pending pass; call from `disconnect()`. */\n  cancel(): void {\n    this.#active = false;\n    this.#queued = false;\n    this.#generation += 1;\n  }\n\n  /** Whether a requested pass has yet to run. */\n  get pending(): boolean {\n    return this.#queued;\n  }\n\n  /** Requests one pass after the batch settles. Idempotent; inert outside the window. */\n  schedule(): void {\n    if (!this.#active || this.#queued) return;\n    this.#queued = true;\n    const generation = this.#generation;\n    queueMicrotask(() => {\n      // A cancelled callback must not consume a pass queued after reconnect.\n      if (generation !== this.#generation || !this.#queued || !this.#active) return;\n      this.#queued = false;\n      this.#run();\n    });\n  }\n}\n","import { ListenerSet } from \"./listener_set\";\nimport { MicrotaskCoalescer } from \"./microtask_coalescer\";\n\n/**\n * Coalesces retained-element morphs and explicit lifecycle requests into one pass.\n *\n * Observe the controller's element after its initial state is settled. Morphs on\n * that element and bubbling morphs on its descendants share the same microtask\n * as {@link schedule}. The callback repairs derived output; the controller owns\n * any logical transition reporting. {@link disconnect} releases the listener and\n * cancels pending work, including work from an earlier connected lifetime.\n */\nexport class MorphRenderWatcher {\n  readonly #listeners = new ListenerSet();\n  readonly #pass: MicrotaskCoalescer;\n  #element: Element | null = null;\n  readonly #onMorph = (): void => this.#pass.schedule();\n\n  /** @param run - the single pass that repairs the settled controller's output. */\n  constructor(run: () => void) {\n    this.#pass = new MicrotaskCoalescer(run);\n  }\n\n  /** Opens observation; observing the same element again preserves queued work. */\n  observe(element: Element): void {\n    if (this.#element === element) return;\n    this.disconnect();\n    this.#element = element;\n    this.#pass.activate();\n    this.#listeners.add(element, \"turbo:morph-element\", this.#onMorph);\n  }\n\n  /** Requests one pass; requests outside an observed lifetime are ignored. */\n  schedule(): void {\n    this.#pass.schedule();\n  }\n\n  /** Whether a pass requested by a morph or {@link schedule} has yet to run. */\n  get pending(): boolean {\n    return this.#pass.pending;\n  }\n\n  /** Releases observation and pending work synchronously; safe to repeat. */\n  disconnect(): void {\n    this.#listeners.dispose();\n    this.#pass.cancel();\n    this.#element = null;\n  }\n}\n","/** Queries physical descendants and nested open shadow trees, including `root`'s own. */\nexport function queryOpenDescendants<T extends Element = Element>(\n  root: ParentNode,\n  selector: string,\n): T[] {\n  const matches: T[] = [];\n  const roots: ParentNode[] = [root];\n  for (const scope of roots) {\n    matches.push(...scope.querySelectorAll<T>(selector));\n    if (scope.nodeType === Node.ELEMENT_NODE) {\n      const shadow = (scope as Element).shadowRoot;\n      if (shadow) roots.push(shadow);\n    }\n    for (const element of scope.querySelectorAll(\"*\")) {\n      if (element.shadowRoot) roots.push(element.shadowRoot);\n    }\n  }\n  return matches;\n}\n","/**\n * One registry per page for every copy of the library.\n *\n * Each `stimeo-ui/controllers/*` file, and each opt-in entry, is built on its own and carries\n * its own copy of every utility it uses, so a page that imports controllers one by one, or one\n * of them next to the barrel, evaluates a utility several times. A registry that coordinates\n * instances of different controllers — the stacks of leased values, the loans of a\n * `tabindex`, the Escape layers, the focus traps — must not be split by that: a dialog inside\n * a drawer, or a character counter and a form field on one input, coordinate whichever files\n * they came from. So such a registry lives once on `globalThis`, under a `Symbol.for` key the\n * copies agree on, and the first copy to ask for it creates it.\n *\n * The key names the registry and the version of its shape\n * (`stimeo-ui.<utility>.registry.v<n>`). Copies whose registries have the same shape share\n * one; a release that changes the shape changes the version, so a copy of another release\n * keeps a registry of its own instead of reading entries it does not understand — the two\n * then coordinate within each release only. An entry another copy put in a registry is read\n * through its fields alone, never through `#private` members, which belong to the class of\n * the copy that created it.\n */\n\n/**\n * The registry stored under `key`, created by `create` on first use.\n *\n * @param key - `stimeo-ui.<utility>.registry.v<n>`: the version is that of the shape `create`\n *   returns.\n * @param create - Builds the empty registry.\n */\nexport function sharedRegistry<T extends object>(key: string, create: () => T): T {\n  const symbol = Symbol.for(key);\n  const scope = globalThis as unknown as Record<symbol, T | undefined>;\n  const existing = scope[symbol];\n  if (existing !== undefined) return existing;\n  const registry = create();\n  Object.defineProperty(globalThis, symbol, { value: registry });\n  return registry;\n}\n","import { setAttributeIfChanged } from \"./attribute_write\";\nimport { deepActiveElement } from \"./focus_candidate\";\nimport { queryOpenDescendants } from \"./query_open_descendants\";\nimport { sharedRegistry } from \"./shared_registry\";\n\n/** One loan's hold on one element's `tabindex`, in the stack every loan of it shares. */\ninterface LoanHold {\n  /** The loan holding it; `null` for a loan read from a copy's record until a loan takes it. */\n  loan: object | null;\n  readonly record: string;\n  readonly value: string;\n  /** Whether it hands back the value of the hold beneath it; otherwise no `tabindex`. */\n  linked: boolean;\n}\n\n/** The loans on each element, bottom first, and every loan's record name. */\ninterface TabindexLoanRegistry {\n  readonly stacks: WeakMap<HTMLElement, LoanHold[]>;\n  readonly names: Set<string>;\n}\n\n/** Focus can be retargeted to a shadow host rather than exposed on the document. */\nfunction holdsFocus(element: HTMLElement): boolean {\n  return element.matches(\":focus\") || deepActiveElement(element.ownerDocument) === element;\n}\n\n/**\n * Shared bookkeeping for a `tabindex` a controller lends an element temporarily.\n *\n * A controller that must move focus somewhere the author never made focusable\n * (a landmark root, a scroll destination) reaches for the same trick: add a\n * `tabindex` just-in-time and hand it back once it is no longer needed. The\n * borrow is the easy half; the return is what the two conditions below are for.\n *\n * **Returning needs two conditions, not one.** Owning the borrow is not enough:\n * the attribute must also still hold the value this instance wrote. A consumer\n * that changed it afterwards — `tabindex=\"0\"` to make the root its own Tab stop\n * — owns it now, and removing it there silently discards authored markup. The\n * bookkeeping is dropped when returned. With `preserveFocus`, a focused element\n * still showing this loan keeps its hold and record until a later return can finish.\n *\n * **Never borrow over a value no loan holds.** An element whose `tabindex` no loan\n * holds — the author's, or one the page wrote over the loans — is the author's to\n * control, so there is nothing to lend and nothing to return.\n *\n * **Every loan of an element shares one stack of loans**, whatever its owner and\n * whichever file of the package constructed it (the stacks are one per page). A loan\n * lends over the loans that hold the element while its `tabindex` is theirs — sharing\n * their value, or covering it with its own — and lends again where the page removed\n * the `tabindex`. The `tabindex` is the highest loan's that lends its value: returning\n * that loan gives the element the value of the loan beneath it, or no `tabindex`, and\n * any other return only leaves the stack. So two loans of one value — every focus trap\n * lends its container under one owner — keep it until the last of them returns, and a\n * loan lent after the page removed an earlier one's `tabindex` keeps it when the\n * earlier one returns.\n *\n * **A loan is recorded on the element.** Lending writes\n * `data-<owner>-tabindex-loan` holding the value the owner's topmost loan lends next\n * to the `tabindex`, and the owner's last loan to end removes it. A copy of the\n * element — a page Turbo restores from its cache is one — so tells its owners' loans\n * from an authored `tabindex`: `lend()` takes over a loan its owner recorded, and\n * `reclaim()` gives back one no loan has taken over; the `tabindex` goes with the last\n * of them. A copy keeps no order of its loans beyond putting those of the value it\n * carries on top. Without a record a `tabindex` is the author's. Nothing returns a\n * live loan before Turbo caches the page: `turbo:before-cache` also fires on pages\n * that stay, and the loan is still in use there.\n *\n * The registry is keyed by element, so a controller borrowing on a single\n * element (`this.element`) and one borrowing across a changing set of targets\n * use the same API — the single-element case is a set of one. It holds no\n * opinion about *when* to borrow or where focus goes next; that stays in the\n * controller.\n *\n * **The API is deliberately small.** Each consumer entry includes its own copy\n * of the class, so unused methods still increase its runtime output.\n *\n * @example\n * ```ts\n * readonly #tabindex = new TabindexLoan(\"-1\", this.identifier);\n *\n * connect() {\n *   this.#tabindex.reclaim(this.element);\n * }\n *\n * #rescueFocus() {\n *   this.#tabindex.lend(this.element);\n *   this.element.focus();\n * }\n *\n * disconnect() {\n *   this.#tabindex.returnAll();\n * }\n * ```\n */\nexport class TabindexLoan<T extends HTMLElement = HTMLElement> {\n  /** The loans on each element and the record names, one per page. */\n  static readonly #registry = sharedRegistry(\n    \"stimeo-ui.tabindex-loan.registry.v1\",\n    (): TabindexLoanRegistry => ({ stacks: new WeakMap(), names: new Set() }),\n  );\n  readonly #value: string;\n  readonly #record: string;\n  readonly #preserveFocus: boolean;\n  readonly #lent = new Set<T>();\n\n  /**\n   * @param value - the `tabindex` to lend. `\"-1\"` is programmatically focusable but\n   *   not a Tab stop; `\"0\"` is a real Tab stop, which a scroll region with no\n   *   focusable content of its own needs.\n   * @param owner - Names the record on the element; the controller's identifier.\n   * @param options - `preserveFocus`: keep a shown loan while its element holds focus.\n   */\n  constructor(value: string, owner: string, options: { readonly preserveFocus?: boolean } = {}) {\n    this.#value = value;\n    this.#record = `data-${owner}-tabindex-loan`;\n    this.#preserveFocus = options.preserveFocus === true;\n    TabindexLoan.#registry.names.add(this.#record);\n  }\n\n  /**\n   * Lends `element` the value over the loans holding its `tabindex`, or where the page removed\n   * it; a `tabindex` no loan holds is left alone, and a loan recorded on a copy taken over.\n   * `onlyIfUnfocusable` starts no new loan on an element that carries any `tabindex` or is\n   * natively focusable (a `tabIndex` of `0` or more).\n   */\n  lend(element: T, options: { readonly onlyIfUnfocusable?: boolean } = {}): void {\n    const stack = this.#stack(element);\n    const current = element.getAttribute(\"tabindex\");\n    const held =\n      stack.find((hold) => hold.loan === this) ??\n      stack.find(\n        (hold) => hold.loan === null && hold.record === this.#record && hold.value === this.#value,\n      );\n    const linked = stack.at(-1)?.value === current;\n    if (!held && options.onlyIfUnfocusable && (current !== null || element.tabIndex >= 0)) return;\n    if (!held && current !== null && !linked) return;\n    this.#lent.add(element);\n    if (held) held.loan = this;\n    else stack.push({ loan: this, record: this.#record, value: this.#value, linked });\n    this.#mark(element, stack);\n    if (current === null || (!held && current !== this.#value)) {\n      element.setAttribute(\"tabindex\", this.#value);\n    }\n  }\n\n  /** Returns one live or restored loan, retaining a focus-protected hold for a later return. */\n  return(element: T): boolean {\n    const stack = this.#stack(element);\n    const hold =\n      stack.find((held) => held.loan === this) ??\n      stack.find(\n        (held) => held.loan === null && held.record === this.#record && held.value === this.#value,\n      );\n    if (!hold) return false;\n    if (!this.#release(element, stack, hold, this.#preserveFocus)) {\n      hold.loan = this;\n      this.#lent.add(element);\n      return false;\n    }\n    this.#lent.delete(element);\n    return true;\n  }\n\n  /** Returns every loan, retaining focus-protected ones even outside the current target set. */\n  returnAll(): void {\n    for (const element of Array.from(this.#lent)) this.return(element);\n  }\n\n  /**\n   * Gives back a loan its owner recorded on a restored copy that no loan has taken over, unless\n   * the record holds another value or the element holds focus.\n   */\n  reclaim(element: HTMLElement): void {\n    if (element.getAttribute(this.#record) !== this.#value) return;\n    const stack = this.#stack(element);\n    const hold = stack.find((held) => held.loan === null && held.record === this.#record);\n    if (hold && !holdsFocus(element)) this.#release(element, stack, hold);\n  }\n\n  /** Gives back, as {@link reclaim} does, every loan of its owner recorded inside `root`. */\n  reclaimWithin(root: ParentNode): void {\n    for (const element of queryOpenDescendants<HTMLElement>(root, `[${this.#record}]`)) {\n      this.reclaim(element);\n    }\n  }\n\n  /** The element's loans, read from its records the first time. */\n  #stack(element: HTMLElement): LoanHold[] {\n    const stacks = TabindexLoan.#registry.stacks;\n    const stack = stacks.get(element) ?? this.#seed(element);\n    stacks.set(element, stack);\n    return stack;\n  }\n\n  /** The loans a copy's records describe, those of the value it carries on top. */\n  #seed(element: HTMLElement): LoanHold[] {\n    const current = element.getAttribute(\"tabindex\");\n    const holds: LoanHold[] = [];\n    for (const record of TabindexLoan.#registry.names) {\n      const value = element.getAttribute(record);\n      if (value !== null) holds.push({ loan: null, record, value, linked: true });\n    }\n    holds.sort((one, other) => Number(one.value === current) - Number(other.value === current));\n    for (const [index, hold] of holds.entries()) hold.linked = index > 0;\n    return holds;\n  }\n\n  /** Takes `hold` off, handing the value it shows to the loan beneath. */\n  #release(\n    element: HTMLElement,\n    stack: LoanHold[],\n    hold: LoanHold,\n    preserveFocus = false,\n  ): boolean {\n    const current = element.getAttribute(\"tabindex\");\n    const index = stack.indexOf(hold);\n    const owns =\n      current === hold.value && !stack.slice(index + 1).some((above) => above.value === current);\n    if (owns && preserveFocus && holdsFocus(element)) return false;\n    stack.splice(index, 1);\n    const above = stack[index];\n    if (above) above.linked &&= hold.linked;\n    this.#mark(element, stack);\n    if (!owns) return true;\n    const below = hold.linked ? stack[index - 1] : undefined;\n    if (!below) element.removeAttribute(\"tabindex\");\n    else if (below.value !== current) element.setAttribute(\"tabindex\", below.value);\n    return true;\n  }\n\n  /** Leaves each owner's record of the value its topmost loan lends. */\n  #mark(element: HTMLElement, stack: readonly LoanHold[]): void {\n    const records = new Map<string, string | null>([[this.#record, null]]);\n    for (const hold of stack) records.set(hold.record, hold.value);\n    for (const [name, recorded] of records) {\n      setAttributeIfChanged(element, name, recorded);\n    }\n  }\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { setAttributeIfChanged } from \"../utils/attribute_write\";\nimport { AuthoredMutationWatcher } from \"../utils/authored_mutation_watcher\";\nimport { ownerIndex } from \"../utils/event_owner\";\nimport { canTakeFocus } from \"../utils/focus_candidate\";\nimport { FormResetWatcher } from \"../utils/form_reset_watcher\";\nimport { ListenerSet } from \"../utils/listener_set\";\nimport { MorphRenderWatcher } from \"../utils/morph_render_watcher\";\nimport { TabindexLoan } from \"../utils/tabindex_loan\";\n\n/** Trigger controls whose live state drives region visibility. */\ntype Trigger = HTMLInputElement | HTMLSelectElement;\n/** Form controls inside a region that can be excluded from submission. */\ntype Disableable = HTMLInputElement | HTMLTextAreaElement | HTMLSelectElement | HTMLButtonElement;\n/** One logical visibility transition settled during an evaluation pass. */\ntype RegionTransition = { region: HTMLElement; visible: boolean };\n\n/** Marker on controls this component disabled, so authored disabled state remains untouched. */\nconst DISABLED_MARKER = \"data-conditional-disabled\";\n\n/** Descendant controls whose `disabled` state a region manages. */\nconst CONTROLS = \"input, textarea, select, button\";\n\n/** Retained-DOM inputs and controller outputs that can require reconciliation. */\nconst OBSERVED_ATTRIBUTES = [\n  \"hidden\",\n  \"aria-hidden\",\n  \"data-visible\",\n  DISABLED_MARKER,\n  \"disabled\",\n  \"data-when-checked\",\n  \"data-when-unchecked\",\n  \"data-when-value\",\n  \"checked\",\n  \"selected\",\n  \"value\",\n  \"type\",\n];\n\n/** Attribute value expected after one controller-owned DOM write. */\ntype ExpectedAttribute = string | null;\n\n/**\n * Headless dependent-fields behavior: shows/hides (and enables/disables) regions\n * from trigger control values while keeping submission and accessibility state in\n * sync (no dedicated APG pattern).\n *\n * Markup contract (identifier: `stimeo--conditional-fields`):\n *   <form data-controller=\"stimeo--conditional-fields\">\n *     <input type=\"checkbox\" data-stimeo--conditional-fields-target=\"trigger\">\n *     <fieldset data-stimeo--conditional-fields-target=\"region\" data-when-checked>\n *       …address…\n *     </fieldset>\n *   </form>\n *\n * A region declares one condition: `data-when-checked`, `data-when-unchecked`,\n * or `data-when-value=\"x\"`. The condition is combined across all triggers using\n * `match` (`\"any\"` by default, or `\"all\"`). A region with no condition preserves\n * its authored `hidden` state; a declared condition with no triggers is false.\n *\n * Hidden regions receive `hidden` and `aria-hidden=\"true\"`; visible regions expose\n * `data-visible=\"true\"`. With `disableHidden`, descendant controls are disabled and\n * marked with `data-conditional-disabled=\"true\"`, and only marked controls are\n * re-enabled. Before a focused region is hidden, focus moves to the first trigger\n * that can actually receive it. If every trigger is unsafe — including one inside\n * another region being hidden in the same pass — the controller root temporarily\n * receives `tabindex=\"-1\"` and focus.\n *\n * An element that stops being a region gets back what this controller wrote on\n * it: `aria-hidden`, `data-visible`, the `hidden` a declared condition set, and\n * the marked `disabled` of each control no hidden region still covers. The\n * `hidden` of a region without a condition and every authored `disabled` stay.\n *\n * `change` and `reconcile` dispatch `{ region, visible }`.\n *\n * @remarks\n * Behavior only. Trigger `input` / `change`, dynamic targets and descendants,\n * condition attributes, Values, native form reset, and Turbo retained-element\n * morphs all reconcile against the live DOM. Direct writes to an input's live\n * `checked` / `value` property remain observable only when the caller also emits\n * the corresponding native event. DOM repair is silent. User input or the public\n * action dispatches `stimeo--conditional-fields:change`; a lifecycle, Value,\n * reset, mutation, or morph reconciliation dispatches\n * `stimeo--conditional-fields:reconcile` instead. Initial connection is silent.\n * Every listener, observer, queued pass, and borrowed root `tabindex` is released\n * on `disconnect()`.\n */\nexport class ConditionalFieldsController extends Controller<HTMLElement> {\n  static override targets = [\"trigger\", \"region\"];\n  static override values = {\n    disableHidden: { type: Boolean, default: true },\n    match: { type: String, default: \"any\" },\n  };\n  static actions = [\"evaluate\"] as const;\n  static events = [\"change\", \"reconcile\"] as const;\n\n  declare readonly triggerTargets: Trigger[];\n  declare readonly regionTargets: HTMLElement[];\n\n  declare disableHiddenValue: boolean;\n  declare matchValue: string;\n\n  /** Logical state last committed for each current region; rebuilt on every connect. */\n  #lastVisible = new WeakMap<HTMLElement, boolean>();\n  /** Elements that left the region set, held until a pass gives back what was written on them. */\n  readonly #departed = new Set<HTMLElement>();\n  /** Regions whose `hidden` this controller set because their declared condition is false. */\n  readonly #concealed = new WeakSet<HTMLElement>();\n\n  /** Coalesces one target/morph/mutation batch into one full DOM reconciliation. */\n  readonly #reconcile = new MorphRenderWatcher(() => this.#reconcileDom());\n  readonly #listeners = new ListenerSet();\n  readonly #formReset = new FormResetWatcher(\n    (form) => this.#hasTriggerOwnedBy(form),\n    () => this.#reconcile.schedule(),\n  );\n  /** Provides the last-resort focus landmark without claiming an authored tabindex. */\n  readonly #rootTabindex = new TabindexLoan<HTMLElement>(\"-1\", this.identifier);\n  /** Watches retained targets and controls whose declarative or reflected state changed. */\n  readonly #observer = new AuthoredMutationWatcher((records) => this.#onMutations(records));\n\n  /** Evaluates only events whose source is one of this instance's live trigger targets. */\n  readonly #onTriggerInput = (event: Event): void => {\n    const target = event.target;\n    const triggers = this.triggerTargets;\n    if (target instanceof Element && triggers.some((trigger) => trigger === target)) {\n      this.#commitChange(triggers);\n    }\n  };\n\n  /** Reflects initial live state and opens every retained-DOM reconciliation path. */\n  override connect(): void {\n    this.#rootTabindex.reclaim(this.element);\n    this.#lastVisible = new WeakMap();\n    this.#settle();\n    this.#reconcile.observe(this.element);\n    this.#observer.observe(this.element, {\n      attributes: OBSERVED_ATTRIBUTES,\n      childList: true,\n      subtree: true,\n    });\n    this.#listeners.add(this.element, \"change\", this.#onTriggerInput);\n    this.#listeners.add(this.element, \"input\", this.#onTriggerInput);\n    this.#formReset.observe();\n  }\n\n  /** Releases all external resources and returns the temporary focus landmark loan. */\n  override disconnect(): void {\n    this.#reconcile.disconnect();\n    this.#observer.disconnect();\n    this.#listeners.dispose();\n    this.#formReset.disconnect();\n    this.#rootTabindex.returnAll();\n  }\n\n  /** Reconciles after a trigger target is inserted or restored. */\n  triggerTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles after a trigger target is removed or replaced. */\n  triggerTargetDisconnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Initializes a region target inserted or restored at runtime. */\n  regionTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Queues a departed region for the return of its written state and reconciles the rest.\n   *\n   * The return is queued rather than immediate because teardown reports every\n   * region as disconnected, and a disconnected controller leaves its derived state\n   * in the DOM. The pass that drains the queue skips an element that is still a\n   * region, which drops what teardown queued, and keeps a departure queued before\n   * a disconnect for the pass after the reconnect.\n   */\n  regionTargetDisconnected(region: HTMLElement): void {\n    this.#departed.add(region);\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles when application code or a morph changes the match policy. */\n  matchValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Reconciles control ownership when hidden controls become enabled or excluded. */\n  disableHiddenValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-evaluates every region and repairs all reflected DOM state. */\n  evaluate(): void {\n    this.#commitChange();\n  }\n\n  /**\n   * Computes one settled plan, gives back what departed regions carry, shows\n   * destinations before hiding sources, and then returns logical transitions in\n   * DOM order after every region is internally coherent.\n   *\n   * @stimeoRenderRoot\n   */\n  #settle(triggers: Trigger[] = this.triggerTargets): RegionTransition[] {\n    const regions = this.regionTargets;\n    const plan = new Map<HTMLElement, boolean>();\n    for (const region of regions) plan.set(region, this.#isVisible(region, triggers));\n    for (const departed of this.#departed) {\n      if (!plan.has(departed)) this.#release(departed, plan);\n    }\n    this.#departed.clear();\n\n    const changed = new Set<HTMLElement>();\n    const applicationOrder = [\n      ...regions.filter((region) => plan.get(region) === true),\n      ...regions.filter((region) => plan.get(region) === false),\n    ];\n    for (const region of applicationOrder) {\n      const visible = plan.get(region);\n      if (visible !== undefined && this.#applyRegion(region, visible, plan)) {\n        changed.add(region);\n      }\n    }\n\n    return regions\n      .filter((region) => changed.has(region))\n      .map((region) => ({ region, visible: plan.get(region) === true }));\n  }\n\n  /** Reports logical transitions caused by user input or the public action. */\n  #commitChange(triggers: Trigger[] = this.triggerTargets): void {\n    for (const detail of this.#settle(triggers)) {\n      this.dispatch(\"change\", { detail });\n    }\n  }\n\n  /** Reports logical transitions derived from DOM, lifecycle, reset, or Value state. */\n  #reconcileDom(): void {\n    for (const detail of this.#settle()) {\n      this.dispatch(\"reconcile\", { detail });\n    }\n  }\n\n  /** Applies one planned state while keeping event history separate from DOM repair. */\n  #applyRegion(\n    region: HTMLElement,\n    visible: boolean,\n    plan: ReadonlyMap<HTMLElement, boolean>,\n  ): boolean {\n    const previous = this.#lastVisible.get(region) ?? !region.hidden;\n    const changed = visible !== previous;\n    this.#lastVisible.set(region, visible);\n\n    if (!visible) this.#retreatFocus(region, plan);\n    this.#syncRegionState(region, visible);\n    this.#syncRegionControls(region, visible);\n    return changed;\n  }\n\n  /**\n   * Reflects visibility idempotently, recording writes so the observer ignores its\n   * own work, and notes whether the `hidden` comes from a declared condition.\n   */\n  #syncRegionState(region: HTMLElement, visible: boolean): void {\n    if (!visible && this.#predicateFor(region) !== null) this.#concealed.add(region);\n    else this.#concealed.delete(region);\n    this.#writeAttribute(region, \"hidden\", visible ? null : \"\");\n    this.#writeAttribute(region, \"aria-hidden\", visible ? null : \"true\");\n    this.#writeAttribute(region, \"data-visible\", visible ? \"true\" : null);\n  }\n\n  /** Enables/disables descendant controls, touching only state carrying our marker. */\n  #syncRegionControls(region: HTMLElement, visible: boolean): void {\n    const shouldDisable = !visible && this.disableHiddenValue;\n    for (const control of region.querySelectorAll<Disableable>(CONTROLS)) {\n      const marked = control.hasAttribute(DISABLED_MARKER);\n      if (shouldDisable) {\n        if (!control.disabled) {\n          this.#writeAttribute(control, \"disabled\", \"\");\n          this.#writeAttribute(control, DISABLED_MARKER, \"true\");\n        } else if (marked && control.getAttribute(DISABLED_MARKER) !== \"true\") {\n          this.#writeAttribute(control, DISABLED_MARKER, \"true\");\n        }\n      } else if (marked) {\n        this.#enable(control);\n      }\n    }\n  }\n\n  /** Removes a `disabled` this controller owns together with its marker. */\n  #enable(control: Disableable): void {\n    this.#writeAttribute(control, \"disabled\", null);\n    this.#writeAttribute(control, DISABLED_MARKER, null);\n  }\n\n  /**\n   * Gives back what this controller wrote on an element that left the region set.\n   * A marked control inside a region this pass hides stays disabled for that region.\n   */\n  #release(element: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): void {\n    this.#lastVisible.delete(element);\n    if (this.#concealed.delete(element)) this.#writeAttribute(element, \"hidden\", null);\n    this.#writeAttribute(element, \"aria-hidden\", null);\n    this.#writeAttribute(element, \"data-visible\", null);\n    for (const control of element.querySelectorAll<Disableable>(CONTROLS)) {\n      if (control.hasAttribute(DISABLED_MARKER) && this.#survivesPlan(control, plan)) {\n        this.#enable(control);\n      }\n    }\n  }\n\n  /** Whether a region's declared condition holds across `triggers` per `match`. */\n  #isVisible(region: HTMLElement, triggers: Trigger[]): boolean {\n    const predicate = this.#predicateFor(region);\n    if (predicate === null) return !region.hidden;\n    return (\n      triggers.length > 0 &&\n      (this.matchValue === \"all\" ? triggers.every(predicate) : triggers.some(predicate))\n    );\n  }\n\n  /** Builds the deterministic per-trigger predicate from the region's condition. */\n  #predicateFor(region: HTMLElement): ((trigger: Trigger) => boolean) | null {\n    if (region.hasAttribute(\"data-when-checked\")) {\n      return (trigger) => this.#isChecked(trigger);\n    }\n    if (region.hasAttribute(\"data-when-unchecked\")) {\n      return (trigger) => !this.#isChecked(trigger);\n    }\n    const wanted = region.dataset.whenValue;\n    if (wanted !== undefined) {\n      return (trigger) => this.#matchesValue(trigger, wanted);\n    }\n    return null;\n  }\n\n  #isChecked(trigger: Trigger): boolean {\n    return trigger instanceof HTMLInputElement && trigger.checked;\n  }\n\n  /** A trigger has a value when a radio/checkbox is selected, or its control value matches. */\n  #matchesValue(trigger: Trigger, wanted: string): boolean {\n    if (\n      trigger instanceof HTMLInputElement &&\n      (trigger.type === \"checkbox\" || trigger.type === \"radio\")\n    ) {\n      return trigger.checked && trigger.value === wanted;\n    }\n    return trigger.value === wanted;\n  }\n\n  /** Moves focus to the first safe trigger, or to the controller landmark as a fallback. */\n  #retreatFocus(region: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): void {\n    const active = document.activeElement;\n    if (active && region.contains(active)) this.#moveFocus(plan);\n  }\n\n  /** Moves focus after the caller establishes that the active node is being hidden. */\n  #moveFocus(plan: ReadonlyMap<HTMLElement, boolean>): void {\n    const destination = this.triggerTargets.find(\n      (trigger) => canTakeFocus(trigger) && this.#survivesPlan(trigger, plan),\n    );\n    if (destination) {\n      this.#rootTabindex.returnAll();\n      destination.focus();\n      return;\n    }\n\n    this.#rootTabindex.lend(this.element);\n    this.element.focus();\n  }\n\n  /** Whether a focus candidate or a control sits outside every region this pass will hide. */\n  #survivesPlan(candidate: HTMLElement, plan: ReadonlyMap<HTMLElement, boolean>): boolean {\n    return [...plan].every(([region, visible]) => visible || !region.contains(candidate));\n  }\n\n  /** Records one idempotent attribute write before MutationObserver sees it. */\n  #writeAttribute(element: Element, name: string, value: ExpectedAttribute): void {\n    setAttributeIfChanged(element, name, value, () => this.#observer.claim(element, name, value));\n  }\n\n  /** Queues one relevant repair for a batch already separated from controller writes. */\n  #onMutations(records: MutationRecord[]): void {\n    const triggers = this.triggerTargets;\n    const regions = this.regionTargets;\n    if (\n      records.some(\n        (record) =>\n          record.target instanceof Element &&\n          this.#elementAffectsState(record.target, triggers, regions),\n      )\n    ) {\n      this.#reconcile.schedule();\n    }\n  }\n\n  /** Whether an authored mutation target belongs to a trigger, region, or managed control. */\n  #elementAffectsState(target: Element, triggers: Trigger[], regions: HTMLElement[]): boolean {\n    return ownerIndex(triggers, target) !== -1 || ownerIndex(regions, target) !== -1;\n  }\n\n  /** Whether a form owns at least one current trigger, including `form=` associations. */\n  #hasTriggerOwnedBy(form: HTMLFormElement): boolean {\n    return this.triggerTargets.some((trigger) => trigger.form === form);\n  }\n}\n"]}