stimeo-ui 0.16.0 → 0.17.0

package/dist/controllers/nested_form_controller.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/announce.ts","../../src/utils/attribute_lease.ts","../../src/utils/before_cache_reset.ts","../../src/utils/focus_candidate.ts","../../src/utils/microtask_coalescer.ts","../../src/utils/tabindex_loan.ts","../../src/utils/target_selector.ts","../../src/controllers/nested_form_controller.ts"],"names":[],"mappings":";;;;;AAoBO,SAAS,QAAA,CAAS,OAAA,EAAiB,OAAA,GAAmC,EAAC,EAAS;AACrF,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAC1B,EAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACvB,EAAA,MAAA,CAAO,aAAA;AAAA,IACL,IAAI,YAAY,4BAAA,EAA8B;AAAA,MAC5C,QAAQ,EAAE,OAAA,EAAS,MAAM,SAAA,EAAW,OAAA,CAAQ,cAAc,IAAA;AAAK,KAChE;AAAA,GACH;AACF;AAUO,SAAS,YAAA,CAAa,UAAkB,MAAA,EAAiD;AAC9F,EAAA,OAAO,QAAA,CAAS,OAAA,CAAQ,6BAAA,EAA+B,CAAC,OAAO,IAAA,KAAiB;AAC9E,IAAA,MAAM,WAAA,GAAc,OAAO,IAAI,CAAA;AAC/B,IAAA,OAAO,WAAA,KAAgB,MAAA,GAAY,KAAA,GAAQ,MAAA,CAAO,WAAW,CAAA;AAAA,EAC/D,CAAC,CAAA;AACH;;;ACnBO,IAAM,iBAAN,MAAkD;AAAA,EAC9C,UAAA;AAAA,EACA,QAAA,uBAAe,GAAA,EAA6B;AAAA;AAAA,EAGrD,YAAY,SAAA,EAAmB;AAC7B,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAAA,EACpB;AAAA;AAAA,EAGA,KAAA,CAAM,SAAY,KAAA,EAA4B;AAC5C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AAC1C,IAAA,IAAI,QAAA,EAAU;AACZ,MAAA,QAAA,CAAS,OAAA,GAAU,KAAA;AAAA,IACrB,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,QAAA,CAAS,IAAI,OAAA,EAAS;AAAA,QACzB,QAAA,EAAU,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA;AAAA,QAC9C,OAAA,EAAS;AAAA,OACV,CAAA;AAAA,IACH;AAEA,IAAA,IAAA,CAAK,QAAA,CAAS,SAAS,KAAK,CAAA;AAAA,EAC9B;AAAA;AAAA,EAGA,OAAO,OAAA,EAAkB;AACvB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,OAAO,CAAA;AACxC,IAAA,IAAI,CAAC,MAAA,EAAQ;AACb,IAAA,IAAA,CAAK,QAAA,CAAS,OAAO,OAAO,CAAA;AAC5B,IAAA,MAAM,aAAa,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,MAAM,MAAA,CAAO,OAAA;AACpE,IAAA,IAAI,UAAA,EAAY,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,OAAO,QAAQ,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,QAAA,CAAS,SAAY,KAAA,EAA4B;AAC/C,IAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,MAAM,KAAA,EAAO;AACrD,IAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,KAAK,UAAU,CAAA;AAAA,SACtD,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA;AAAA,EAClD;AAAA;AAAA,EAGA,SAAA,GAAkB;AAChB,IAAA,KAAA,MAAW,OAAA,IAAW,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AAAA,EAC7E;AACF,CAAA;;;ACzBO,IAAM,gBAAA,GAAN,MAAM,iBAAA,CAAiB;AAAA;AAAA,EAE5B,OAAgB,YAAA,mBAAe,IAAI,GAAA,EAAsB;AAAA;AAAA,EAGzD,OAAgB,iBAAiB,MAAY;AAC3C,IAAA,KAAA,MAAW,UAAA,IAAc,iBAAA,CAAiB,YAAA,EAAc,UAAA,CAAW,OAAA,EAAQ;AAAA,EAC7E,CAAA;AAAA,EAES,OAAA;AAAA;AAAA,EAGT,YAAY,MAAA,EAAoB;AAC9B,IAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AAAA,EACjB;AAAA;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,MAAM,KAAA,GAAQ,iBAAA,CAAiB,YAAA,CAAa,IAAA,KAAS,CAAA;AACrD,IAAA,iBAAA,CAAiB,YAAA,CAAa,IAAI,IAAI,CAAA;AACtC,IAAA,IAAI,KAAA,EAAO;AACT,MAAA,QAAA,CAAS,gBAAA,CAAiB,oBAAA,EAAsB,iBAAA,CAAiB,cAAc,CAAA;AAAA,IACjF;AAAA,EACF;AAAA;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,iBAAA,CAAiB,YAAA,CAAa,OAAO,IAAI,CAAA;AACzC,IAAA,IAAI,iBAAA,CAAiB,YAAA,CAAa,IAAA,GAAO,CAAA,EAAG;AAC5C,IAAA,QAAA,CAAS,mBAAA,CAAoB,oBAAA,EAAsB,iBAAA,CAAiB,cAAc,CAAA;AAAA,EACpF;AACF,CAAA;;;AC/DO,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;AAgDO,SAAS,aAAa,OAAA,EAA+B;AAC1D,EAAA,IAAI,OAAA,CAAQ,OAAA,CAAQ,mBAAmB,CAAA,EAAG,OAAO,KAAA;AACjD,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;AAGO,IAAM,2BAAA,GAA8B;AAAA,EACzC,SAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,iBAAA;AAAA,EACA,iBAAA;AAAA,EACA,YAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,GAAG,CAAA;AAQH,SAAS,mBAAmB,OAAA,EAA+B;AAChE,EAAA,MAAM,QAAS,OAAA,CAA8C,eAAA;AAC7D,EAAA,OAAO,OAAO,KAAA,KAAU,UAAA,GAAa,KAAA,CAAM,IAAA,CAAK,SAAS,EAAE,kBAAA,EAAoB,IAAA,EAAM,CAAA,GAAI,IAAA;AAC3F;AAGA,SAAS,iBAAiB,OAAA,EAAqC;AAC7D,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,QAAQ,CAAC,YAAA,CAAa,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,IAAA;AAC/D,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAGA,SAAS,iBAAiB,OAAA,EAA+B;AACvD,EAAA,IAAI,OAAA,YAAmB,iBAAA,IAAqB,OAAA,YAAmB,eAAA,EAAiB;AAC9E,IAAA,OAAO,OAAA,CAAQ,aAAa,MAAM,CAAA;AAAA,EACpC;AACA,EAAA,IACE,OAAA,YAAmB,iBAAA,IACnB,OAAA,YAAmB,iBAAA,IACnB,mBAAmB,mBAAA,EACnB;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,YAAmB,gBAAA,EAAkB,OAAO,OAAA,CAAQ,IAAA,KAAS,QAAA;AACjE,EAAA,IAAI,OAAA,YAAmB,mBAAmB,OAAO,IAAA;AACjD,EAAA,IAAI,OAAA,CAAQ,OAAA,KAAY,OAAA,IAAW,OAAA,CAAQ,YAAY,OAAA,EAAS;AAC9D,IAAA,OAAO,OAAA,CAAQ,aAAa,UAAU,CAAA;AAAA,EACxC;AACA,EAAA,IAAI,OAAA,YAAmB,WAAA,IAAe,OAAA,CAAQ,OAAA,KAAY,SAAA,EAAW;AACnE,IAAA,MAAM,UAAU,OAAA,CAAQ,aAAA;AACxB,IAAA,OACE,OAAA,YAAmB,kBAAA,IACnB,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,OAAA,KAAY,SAAS,CAAA,KAAM,OAAA;AAAA,EAElF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,mBAAmB,OAAA,EAA+B;AACzD,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,iBAAiB,GAAG,WAAA,EAAY;AACnE,EAAA,OAAO,KAAA,KAAU,EAAA,IAAM,KAAA,KAAU,MAAA,IAAU,KAAA,KAAU,gBAAA;AACvD;AAUO,SAAS,UAAU,OAAA,EAA+B;AACvD,EAAA,IAAI,CAAC,aAAa,OAAO,CAAA,IAAK,CAAC,kBAAA,CAAmB,OAAO,GAAG,OAAO,KAAA;AAEnE,EAAA,MAAM,QAAA,GAAW,iBAAiB,OAAO,CAAA;AACzC,EAAA,IAAI,QAAA,KAAa,IAAA,EAAM,OAAO,QAAA,IAAY,CAAA;AAC1C,EAAA,OAAO,gBAAA,CAAiB,OAAO,CAAA,IAAK,kBAAA,CAAmB,OAAO,CAAA;AAChE;AAUO,SAAS,aAAa,IAAA,EAAsC;AACjE,EAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,gBAAA,CAA8B,2BAA2B,CAAA,EAAG;AACvF,IAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG,OAAO,SAAA;AAAA,EACnC;AACA,EAAA,OAAO,IAAA;AACT;;;ACtHO,IAAM,qBAAN,MAAyB;AAAA,EACrB,IAAA;AAAA,EACT,OAAA,GAAU,KAAA;AAAA,EACV,OAAA,GAAU,KAAA;AAAA,EACV,WAAA,GAAc,CAAA;AAAA;AAAA,EAGd,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,IAAA,GAAO,GAAA;AAAA,EACd;AAAA;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACjB;AAAA;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;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;;;ACpCO,IAAM,eAAN,MAAwD;AAAA,EACpD,MAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAO;AAAA;AAAA,EAEnB,eAAe,IAAI,gBAAA,CAAiB,MAAM,IAAA,CAAK,WAAW,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOnE,WAAA,CAAY,QAAgB,IAAA,EAAM;AAChC,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AAAA,EAChB;AAAA;AAAA,EAGA,KAAK,OAAA,EAAkB;AACrB,IAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA,EAAG;AACtC,IAAA,OAAA,CAAQ,YAAA,CAAa,UAAA,EAAY,IAAA,CAAK,MAAM,CAAA;AAC5C,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,OAAO,CAAA;AAGtB,IAAA,IAAA,CAAK,aAAa,QAAA,EAAS;AAAA,EAC7B;AAAA;AAAA,EAGA,SAAA,GAAkB;AAChB,IAAA,KAAA,MAAW,OAAA,IAAW,KAAK,KAAA,EAAO;AAChC,MAAA,IAAI,OAAA,CAAQ,aAAa,UAAU,CAAA,KAAM,KAAK,MAAA,EAAQ,OAAA,CAAQ,gBAAgB,UAAU,CAAA;AAAA,IAC1F;AACA,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AACjB,IAAA,IAAA,CAAK,aAAa,UAAA,EAAW;AAAA,EAC/B;AACF,CAAA;;;AC1EO,SAAS,cAAA,CAAe,YAAoB,IAAA,EAAsB;AACvE,EAAA,OAAO,CAAA,MAAA,EAAS,UAAU,CAAA,UAAA,EAAa,IAAI,CAAA,EAAA,CAAA;AAC7C;;;ACHA,IAAM,WAAA,GAAc,QAAA;AAEpB,IAAM,iBAAA,GAAoB,aAAA;AAG1B,IAAM,mCAAmB,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,MAAM,CAAC,CAAA;AA6DvC,IAAM,oBAAA,GAAN,cAAmC,UAAA,CAAwB;AAAA;AAAA,EAEhE,IAAI,aAAA,GAAwB;AAC1B,IAAA,OAAO,CAAA,mBAAA,EAAsB,KAAK,UAAU,CAAA,EAAA,CAAA;AAAA,EAC9C;AAAA;AAAA,EAGA,IAAI,eAAA,GAA0B;AAC5B,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,UAAA,EAAY,WAAW,CAAA;AAAA,EACpD;AAAA;AAAA,EAGA,IAAI,oBAAA,GAA+B;AACjC,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,UAAA,EAAY,iBAAiB,CAAA;AAAA,EAC1D;AAAA,EAEA,OAAgB,OAAA,GAAU,CAAC,QAAQ,UAAA,EAAY,KAAA,EAAO,UAAU,aAAa,CAAA;AAAA,EAC7E,OAAgB,MAAA,GAAS;AAAA,IACvB,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IAChC,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IAChC,gBAAA,EAAkB,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IACvD,QAAA,EAAU,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,IAAA,EAAK;AAAA,IACzC,YAAA,EAAc,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,EAAA;AAAG,GAC5C;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,KAAK,CAAA;AAAA,EACvB,OAAO,MAAA,GAAS,CAAC,KAAA,EAAO,UAAU,WAAW,CAAA;AAAA;AAAA,EAgB7C,UAAA,GAAa,CAAA;AAAA,EAEb,cAAA,GAAiB,KAAA;AAAA,EACjB,eAAA,GAAkB,KAAA;AAAA;AAAA,EAGlB,UAAA,GAAuE,IAAA;AAAA;AAAA,EAGvE,SAAA,GAAqC,IAAA;AAAA,EAE5B,aAAa,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,eAAe,CAAA;AAAA;AAAA,EAE9D,YAAA,GAAe,IAAI,cAAA,CAAkC,UAAU,CAAA;AAAA,EAC/D,eAAe,IAAI,gBAAA,CAAiB,MAAM,IAAA,CAAK,iBAAiB,CAAA;AAAA;AAAA,EAEhE,SAAA,GAAY,IAAI,YAAA,EAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO7B,QAAA,GAAW,CAAC,KAAA,KAAuB;AAC1C,IAAA,MAAM,SAAS,KAAA,CAAM,MAAA;AACrB,IAAA,MAAM,MAAA,GAAS,MAAA,EAAQ,OAAA,CAAqB,IAAA,CAAK,eAAe,CAAA;AAChE,IAAA,IAAI,CAAC,MAAA,IAAU,IAAA,CAAK,SAAS,MAAM,CAAA,KAAM,KAAK,OAAA,EAAS;AACvD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,cAAA,CAAe,MAAM,CAAA;AACtC,IAAA,IAAI,GAAA,EAAK,IAAA,CAAK,UAAA,CAAW,GAAG,CAAA;AAAA,EAC9B,CAAA;AAAA,EAES,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,cAAA,GAAiB,KAAA;AACtB,IAAA,IAAA,CAAK,eAAA,GAAkB,KAAA;AACvB,IAAA,IAAA,CAAK,OAAA,CAAQ,gBAAA,CAAiB,OAAA,EAAS,IAAA,CAAK,QAAQ,CAAA;AACpD,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AACzB,IAAA,IAAA,CAAK,aAAa,QAAA,EAAS;AAC3B,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,CAAC,IAAA,CAAK,iBAAA,OAAwB,YAAA,EAAa;AACtE,IAAA,IAAA,CAAK,QAAA,EAAS;AAAA,EAChB;AAAA,EAES,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQ,mBAAA,CAAoB,OAAA,EAAS,IAAA,CAAK,QAAQ,CAAA;AACvD,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAA,CAAK,WAAW,MAAA,EAAO;AACvB,IAAA,IAAA,CAAK,aAAa,UAAA,EAAW;AAC7B,IAAA,IAAA,CAAK,eAAA,EAAgB;AACrB,IAAA,IAAA,CAAK,UAAU,SAAA,EAAU;AACzB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAAA,EACpB;AAAA;AAAA,EAGA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,eAAA,EAAgB;AACrB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA;AAAA,EAGA,sBAAA,GAA+B;AAC7B,IAAA,IAAA,CAAK,eAAA,EAAgB;AACrB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACzB,IAAA,IAAA,CAAK,YAAY,IAAI,gBAAA,CAAiB,MAAM,IAAA,CAAK,UAAA,CAAW,UAAU,CAAA;AACtE,IAAA,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,IAAA,CAAK,UAAA,EAAY;AAAA,MACtC,SAAA,EAAW,IAAA;AAAA,MACX,OAAA,EAAS,IAAA;AAAA,MACT,UAAA,EAAY,IAAA;AAAA,MACZ,eAAA,EAAiB,CAAC,OAAO;AAAA,KAC1B,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,sBAAsB,MAAA,EAAiC;AACrD,IAAA,IAAA,CAAK,YAAA,CAAa,OAAO,MAAM,CAAA;AAC/B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAEA,kBAAA,GAA2B;AACzB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAA,GAAY;AACV,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,CAAC,KAAK,iBAAA,EAAmB;AAClD,MAAA,IAAA,CAAK,YAAA,EAAa;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAK,MAAA,EAAQ;AAEjB,IAAA,MAAM,KAAA,GAAQ,KAAK,UAAA,EAAW;AAC9B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,cAAA,CAAe,SAAA,CAAU,UAAA;AAAA,MAC3C,IAAA,CAAK,qBAAA;AAAA,MACL,OAAO,KAAK;AAAA,KACd;AACA,IAAA,MAAM,OAAO,IAAA,CAAK,UAAA;AAClB,IAAA,MAAM,WAAA,GAAc,KAAK,UAAA,CAAW,MAAA;AACpC,IAAA,MAAM,iBAAiB,IAAA,CAAK,iBAAA;AAC5B,IAAA,IAAA,CAAK,kBAAA,CAAmB,aAAa,MAAM,CAAA;AAC3C,IAAA,MAAM,QAAS,KAAA,CAAM,IAAA,CAAK,KAAK,QAAQ,CAAA,CAAoB,MAAM,cAAc,CAAA;AAC/E,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AAItB,MAAA,OAAO,KAAK,UAAA,CAAW,MAAA,GAAS,WAAA,EAAa,IAAA,CAAK,WAAW,MAAA,EAAO;AACpE,MAAA,IAAA,CAAK,gBAAA,CAAiB,MAAM,MAAM,CAAA;AAClC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AAInB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,IAAA,CAAK,IAAA,CAAK,UAAU,CAAA,CAAE,KAAA,CAAM,WAAW,CAAA,EAAG;AACjE,MAAA,IAAI,IAAA,KAAS,GAAA,EAAK,IAAA,CAAK,MAAA,EAAO;AAAA,IAChC;AAEA,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,YAAA,CAAa,GAAG,GAAG,KAAA,EAAM;AACzB,IAAA,IAAA,CAAK,QAAA,CAAS,OAAO,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAO,OAAA,EAAS,GAAA,EAAI,EAAG,CAAA;AACxD,IAAA,IAAA,CAAK,SAAA,EAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW,GAAA,EAAwB;AACjC,IAAA,MAAM,OAAO,IAAA,CAAK,cAAA;AAClB,IAAA,IAAI,IAAA,CAAK,UAAA,CAAW,GAAG,CAAA,EAAG;AAIxB,MAAA,GAAA,CAAI,MAAA,GAAS,IAAA;AACb,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,cAAA,CAAe,IAAA,EAAM,GAAG,CAAC,CAAA;AACrD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,QAAA,EAAU;AAElC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACjC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACpC,IAAA,MAAM,YAAY,IAAA,KAAS,IAAA;AAC3B,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,KAAA,GAAQ,GAAA;AACb,MAAA,GAAA,CAAI,MAAA,GAAS,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,MAAA,EAAO;AAAA,IACb;AAEA,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAC,CAAA;AAC5C,IAAA,IAAA,CAAK,QAAA,CAAS,UAAU,EAAE,MAAA,EAAQ,EAAE,OAAA,EAAS,GAAA,EAAK,SAAA,EAAU,EAAG,CAAA;AAC/D,IAAA,IAAA,CAAK,SAAA,EAAU;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAA,CAAe,MAAqB,GAAA,EAA0B;AAC5D,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,MACV,CAAC,SAAA,KAAA,CACE,GAAA,CAAI,wBAAwB,SAAS,CAAA,GAAI,KAAK,2BAAA,MAAiC;AAAA,KACpF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,kBAAkB,QAAA,EAAwB;AACxC,IAAA,MAAM,OAAO,IAAA,CAAK,cAAA;AAClB,IAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAA,CAAK,MAAM,QAAQ,CAAA,EAAG,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,CAAE,SAAS,CAAA;AAC9E,IAAA,KAAA,MAAW,OAAO,OAAA,EAAS;AACzB,MAAA,MAAM,IAAA,GAAO,aAAa,GAAG,CAAA;AAC7B,MAAA,IAAI,IAAA,EAAM;AACR,QAAA,IAAA,CAAK,KAAA,EAAM;AACX,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,YAAA,IAAgB,SAAA,CAAU,IAAA,CAAK,SAAS,CAAA,EAAG;AAClD,MAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA;AAChC,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAA,GAAiB;AACf,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACzB,IAAA,MAAM,KAAA,GAAQ,KAAK,cAAA,CAAe,MAAA;AAClC,IAAA,MAAM,KAAA,GAAQ,SAAS,IAAA,CAAK,QAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,GAAW,CAAA,IAAK,SAAS,IAAA,CAAK,QAAA;AACjD,IAAA,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,mBAAA,EAAqB,MAAA,CAAO,KAAK,CAAC,CAAA;AAC5D,IAAA,IAAA,CAAK,QAAA,CAAS,sBAAsB,KAAK,CAAA;AACzC,IAAA,IAAA,CAAK,QAAA,CAAS,sBAAsB,KAAK,CAAA;AACzC,IAAA,IAAI,KAAK,YAAA,EAAc;AAGrB,MAAA,IAAI,IAAA,CAAK,QAAA,GAAW,CAAA,EAAG,IAAA,CAAK,YAAA,CAAa,MAAM,IAAA,CAAK,SAAA,EAAW,KAAA,GAAQ,EAAA,GAAK,IAAI,CAAA;AAAA,WAC3E,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAA,CAAK,SAAS,CAAA;AAAA,IAC9C;AACA,IAAA,IAAA,CAAK,UAAA,GAAa,EAAE,KAAA,EAAO,KAAA,EAAO,KAAA,EAAM;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAA,GAAsB;AACpB,IAAA,MAAM,WAAW,IAAA,CAAK,UAAA;AACtB,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,MAAM,UAAU,IAAA,CAAK,UAAA;AACrB,IAAA,IAAI,CAAC,QAAA,IAAY,CAAC,OAAA,EAAS;AAC3B,IAAA,MAAM,KAAA,GACJ,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC3B,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC3B,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA;AAC7B,IAAA,IAAI,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,WAAA,EAAa,EAAE,QAAQ,EAAE,GAAG,OAAA,EAAQ,EAAG,CAAA;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAA,GAAkB;AAChB,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,IAAA,CAAK,sBAAsB,EAAA,EAAI;AAC1D,IAAA,QAAA,CAAS,YAAA,CAAa,KAAK,iBAAA,EAAmB,EAAE,OAAO,IAAA,CAAK,cAAA,CAAe,MAAA,EAAQ,CAAC,CAAA;AAAA,EACtF;AAAA;AAAA,EAGA,QAAA,CAAS,WAAmB,EAAA,EAAmB;AAC7C,IAAA,IAAI,EAAA,EAAI,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,WAAW,MAAM,CAAA;AAAA,SAC9C,IAAA,CAAK,OAAA,CAAQ,eAAA,CAAgB,SAAS,CAAA;AAAA,EAC7C;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAI,KAAK,YAAA,EAAc,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,KAAK,SAAS,CAAA;AAAA,EAChE;AAAA;AAAA,EAGA,YAAA,GAAqB;AACnB,IAAA,IAAI,KAAK,cAAA,EAAgB;AACzB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AACtB,IAAA,MAAM,OAAA,GAAU;AAAA,MACd,IAAA,CAAK,gBAAgB,IAAA,GAAO,iBAAA;AAAA,MAC5B,IAAA,CAAK,oBAAoB,IAAA,GAAO;AAAA,KAClC,CACG,OAAO,CAAC,IAAA,KAAyB,SAAS,IAAI,CAAA,CAC9C,KAAK,OAAO,CAAA;AACf,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,YAAA,EAAe,IAAA,CAAK,UAAU,CAAA,8CAAA,EAAiD,OAAO,CAAA,CAAA;AAAA,KACxF;AAAA,EACF;AAAA;AAAA,EAGA,iBAAiB,QAAA,EAAwB;AACvC,IAAA,IAAI,KAAK,eAAA,EAAiB;AAC1B,IAAA,IAAA,CAAK,eAAA,GAAkB,IAAA;AACvB,IAAA,MAAM,MAAA,GAAS,QAAA,KAAa,CAAA,GAAI,qBAAA,GAAwB,uCAAA;AACxD,IAAA,OAAA,CAAQ,KAAK,CAAA,YAAA,EAAe,IAAA,CAAK,UAAU,CAAA,oCAAA,EAAuC,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,EAC7F;AAAA;AAAA,EAGA,UAAA,GAAqB;AACnB,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAA,CAAI,IAAA,CAAK,KAAI,EAAG,IAAA,CAAK,aAAa,CAAC,CAAA;AACtD,IAAA,IAAA,CAAK,UAAA,GAAa,KAAA;AAClB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEA,IAAI,MAAA,GAAkB;AACpB,IAAA,OAAO,KAAK,QAAA,GAAW,CAAA,IAAK,IAAA,CAAK,cAAA,CAAe,UAAU,IAAA,CAAK,QAAA;AAAA,EACjE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,cAAA,GAAgC;AAClC,IAAA,OAAQ,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,QAAQ,CAAA,CAAoB,MAAA;AAAA,MAC7D,CAAC,GAAA,KAAQ,CAAC,IAAA,CAAK,WAAW,GAAG;AAAA,KAC/B;AAAA,EACF;AAAA;AAAA,EAGA,WAAW,GAAA,EAA2B;AACpC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACpC,IAAA,OAAO,IAAA,KAAS,IAAA,IAAQ,gBAAA,CAAiB,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EACzD;AAAA;AAAA,EAGA,eAAe,GAAA,EAA2C;AACxD,IAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,gBAAA,CAAmC,IAAA,CAAK,oBAAoB,CAAA,EAAG;AACpF,MAAA,IAAI,KAAK,QAAA,CAAS,IAAI,CAAA,KAAM,IAAA,CAAK,SAAS,OAAO,IAAA;AAAA,IACnD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,EAAA,EAA6B;AACpC,IAAA,OAAO,EAAA,CAAG,OAAA,CAAQ,IAAA,CAAK,aAAa,CAAA;AAAA,EACtC;AAAA;AAAA,EAGA,eAAe,EAAA,EAAiC;AAC9C,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,EAAe,OAAO,IAAA;AAChC,IAAA,IAAI,IAAA,GAAuB,EAAA;AAC3B,IAAA,OAAO,IAAA,IAAQ,IAAA,CAAK,aAAA,KAAkB,IAAA,CAAK,UAAA,EAAY;AACrD,MAAA,IAAA,GAAO,IAAA,CAAK,aAAA;AAAA,IACd;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AACF","file":"nested_form_controller.js","sourcesContent":["/**\n * Sends one message to the page's shared `stimeo--announcer`.\n *\n * A component that has to reach assistive tech does not carry a live region of its\n * own: a region only announces what changes *after* assistive tech already knows\n * about it, which a region that appears (or is un-hidden) with its message cannot\n * satisfy. The one region that can is the announcer sitting in the page from the\n * start, so state changes are handed to it as an event and it does the reading.\n *\n * The event goes to `window` because the announcer is usually a sibling high in the\n * document rather than an ancestor of the component dispatching it.\n *\n * Wording comes from the consumer — the library ships no English strings — so an\n * empty message is silently dropped and nothing is announced.\n *\n * @example\n * ```ts\n * announce(this.announceTextValue, { assertive: false });\n * ```\n */\nexport function announce(message: string, options: { assertive?: boolean } = {}): void {\n  const text = message.trim();\n  if (text.length === 0) return;\n  window.dispatchEvent(\n    new CustomEvent(\"stimeo--announcer:announce\", {\n      detail: { message: text, assertive: options.assertive === true },\n    }),\n  );\n}\n\n/**\n * Fills `{name}` placeholders in an announcement template from `values`.\n *\n * The same substitution the value-text templates use, so a consumer writes\n * `\"{percent}% complete\"` in one attribute and gets the same rules everywhere. A\n * placeholder with no matching entry is left as authored rather than blanked, which\n * keeps a typo visible instead of silently swallowing the word.\n */\nexport function fillTemplate(template: string, values: Record<string, string | number>): string {\n  return template.replace(/\\{([a-zA-Z][a-zA-Z0-9]*)\\}/g, (match, name: string) => {\n    const replacement = values[name];\n    return replacement === undefined ? match : String(replacement);\n  });\n}\n","/** One temporarily controlled attribute value and the authored value it displaced. */\ninterface AttributeLeaseRecord {\n  readonly original: string | null;\n  written: string | null;\n}\n\n/**\n * Temporarily controls one attribute across a changing set of elements.\n *\n * The first write remembers the authored value, including the distinction between\n * an absent attribute and an authored empty string. Returning a lease restores that\n * value only while the attribute still matches the controller's last write. If a\n * consumer changed it in the meantime, the consumer owns the new value and teardown\n * leaves it alone.\n *\n * A `null` write deliberately removes the attribute while retaining the lease. This\n * is useful for derived ARIA whose valid absence is itself controller state, such as\n * an unbounded `aria-valuemin` or a blank spinbutton's `aria-valuenow`.\n *\n * The lease has no lifecycle of its own, so it never subscribes to document events.\n * A consumer that must not let a derived value become the authored baseline of a\n * cached page returns its leases from its own `turbo:before-cache` rewind, where the\n * matching `disconnect()` also releases the subscription.\n */\nexport class AttributeLease<T extends Element = Element> {\n  readonly #attribute: string;\n  readonly #records = new Map<T, AttributeLeaseRecord>();\n\n  /** @param attribute - The attribute whose temporary values this lease owns. */\n  constructor(attribute: string) {\n    this.#attribute = attribute;\n  }\n\n  /** Writes or removes the leased attribute while preserving its authored value. */\n  write(element: T, value: string | null): void {\n    const existing = this.#records.get(element);\n    if (existing) {\n      existing.written = value;\n    } else {\n      this.#records.set(element, {\n        original: element.getAttribute(this.#attribute),\n        written: value,\n      });\n    }\n\n    this.#reflect(element, value);\n  }\n\n  /** Returns one lease without overwriting a value subsequently authored by a consumer. */\n  return(element: T): void {\n    const record = this.#records.get(element);\n    if (!record) return;\n    this.#records.delete(element);\n    const stillOwned = element.getAttribute(this.#attribute) === record.written;\n    if (stillOwned) this.#reflect(element, record.original);\n  }\n\n  /** Reflects only a real value transition, avoiding self-triggered mutation work. */\n  #reflect(element: T, value: string | null): void {\n    if (element.getAttribute(this.#attribute) === value) return;\n    if (value === null) element.removeAttribute(this.#attribute);\n    else element.setAttribute(this.#attribute, value);\n  }\n\n  /** Returns every outstanding lease using the same ownership check as {@link return}. */\n  returnAll(): void {\n    for (const element of Array.from(this.#records.keys())) this.return(element);\n  }\n}\n","/**\n * Runs a controller's \"return to the initial state\" pass just before Turbo\n * caches the page.\n *\n * **`disconnect()` cannot do this job, for two independent reasons.** Turbo\n * queues the clone from this event rather than taking it here, and the body swap\n * that runs the controller's `disconnect()` is queued separately — so which of\n * the two lands first is not something a controller can rely on, and a rewind\n * written in `disconnect()` may reach only the DOM being thrown away. In the\n * other direction, `disconnect()` also fires on an in-page move (Stimulus tears\n * down and reconnects the same element), where rewinding would wipe a\n * legitimately in-progress interaction — a spinner mid-load would vanish. One\n * timing is unreliable, the other is too eager; `turbo:before-cache` is the only\n * point that is exactly \"the page is about to be frozen\".\n *\n * Scope is the subscription only: registering on `activate()`, unregistering on\n * `deactivate()`, and one shared document listener no matter how many instances\n * are live. *What* to return to its initial state — which `data-state`, which\n * `hidden`, which `aria-busy` — stays in the controller, because no two\n * consumers answer it the same way.\n *\n * **Rewind state, not appearance.** The pass writes attributes the controller\n * itself owns; the visual result of those attributes is the consumer's CSS, and\n * a library that reached for style or class names would be guessing at markup\n * it does not own.\n *\n * Both entry points are idempotent, so the lifecycle hooks can call them\n * unconditionally: a second `activate()` does not double-subscribe and does not\n * make the callback run twice, and `deactivate()` on an instance that never\n * subscribed is a no-op.\n *\n * This file's own doc block is dropped from `dist`, but every member comment is\n * inlined into each consumer entry (`tsup` builds with `splitting: false`), so\n * rationale belongs here and only the contract belongs on the members.\n *\n * @example\n * ```ts\n * readonly #beforeCache = new BeforeCacheReset(() => this.#rewind());\n *\n * connect()    { this.#beforeCache.activate(); }\n * disconnect() { this.#beforeCache.deactivate(); }\n * ```\n */\nexport class BeforeCacheReset {\n  /** Every subscribed instance, iterated by the one shared document listener. */\n  static readonly #subscribers = new Set<BeforeCacheReset>();\n\n  /** The shared listener; installed while at least one instance is subscribed. */\n  static readonly #onBeforeCache = (): void => {\n    for (const subscriber of BeforeCacheReset.#subscribers) subscriber.#rewind();\n  };\n\n  readonly #rewind: () => void;\n\n  /** @param rewind - the pass that returns this controller's state to its initial form. */\n  constructor(rewind: () => void) {\n    this.#rewind = rewind;\n  }\n\n  /** Subscribes to `turbo:before-cache`; call from `connect()`. Idempotent. */\n  activate(): void {\n    const first = BeforeCacheReset.#subscribers.size === 0;\n    BeforeCacheReset.#subscribers.add(this);\n    if (first) {\n      document.addEventListener(\"turbo:before-cache\", BeforeCacheReset.#onBeforeCache);\n    }\n  }\n\n  /** Unsubscribes; call from `disconnect()`. Safe when never subscribed. */\n  deactivate(): void {\n    BeforeCacheReset.#subscribers.delete(this);\n    if (BeforeCacheReset.#subscribers.size > 0) return;\n    document.removeEventListener(\"turbo:before-cache\", BeforeCacheReset.#onBeforeCache);\n  }\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 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 four conditions that make the platform refuse\n * focus are checked: `hidden` / `inert` (an ancestor's counts),\n * `input[type=\"hidden\"]`, the native `disabled` property, and `disabled`\n * inherited from an ancestor `fieldset`. CSS-only invisibility is handled by\n * {@link isRenderedForFocus} 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  if (element.closest(\"[hidden], [inert]\")) return false;\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: HTMLElement): 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 * 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 * This file's own doc block is dropped from `dist`, but every member comment is\n * inlined into each consumer entry (`tsup` builds with `splitting: false`), so\n * rationale belongs here and only the contract belongs on the members.\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 { BeforeCacheReset } from \"./before_cache_reset\";\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 an existing value.** An element that already carries a\n * `tabindex` is the author's to control, so there is nothing to lend and nothing\n * to return.\n *\n * Every live loan also owns a shared `turbo:before-cache` subscription. The loan\n * is returned before Turbo can copy it into a snapshot, so consumers get cache\n * safety without duplicating a lifecycle hook; `returnAll()` removes the\n * subscription again as soon as no loan remains.\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 two methods.** This file's own doc block is dropped\n * from `dist`, but every member comment is inlined into **each** consumer entry\n * (`tsup` builds with `splitting: false`), so rationale belongs here, only the\n * contract belongs on the members, and every method no consumer calls is still\n * paid for once per consumer entry.\n *\n * @example\n * ```ts\n * readonly #tabindex = new TabindexLoan();\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  readonly #value: string;\n  readonly #lent = new Set<T>();\n  /** Returns live loans before Turbo can copy them into its page snapshot. */\n  readonly #beforeCache = new BeforeCacheReset(() => this.returnAll());\n\n  /**\n   * @param value - the `tabindex` to lend. `\"-1\"` (the default) is\n   *   programmatically focusable but not a Tab stop; `\"0\"` is a real Tab stop,\n   *   which a scroll region with no focusable content of its own needs.\n   */\n  constructor(value: string = \"-1\") {\n    this.#value = value;\n  }\n\n  /** Lends `element` the value; no-ops when it already carries a `tabindex`. */\n  lend(element: T): void {\n    if (element.hasAttribute(\"tabindex\")) return;\n    element.setAttribute(\"tabindex\", this.#value);\n    this.#lent.add(element);\n    // Subscribe only while a real loan exists. Keeping this guarantee here means\n    // every consumer is Turbo-safe without another lifecycle hook to remember.\n    this.#beforeCache.activate();\n  }\n\n  /** Takes back every loan whose value is still the one that was lent. */\n  returnAll(): void {\n    for (const element of this.#lent) {\n      if (element.getAttribute(\"tabindex\") === this.#value) element.removeAttribute(\"tabindex\");\n    }\n    this.#lent.clear();\n    this.#beforeCache.deactivate();\n  }\n}\n","/**\n * The attribute selector for one declared target, in a controller's own namespace.\n *\n * Stimulus reads `data-<identifier>-target` as a **space-separated token list**, so a\n * single element can carry several target names at once. Matching the attribute value\n * whole would reach only the elements that declare exactly one name, which is why the\n * name is paired with `~=`.\n *\n * `identifier` is the name the controller is registered under, so the selector reaches\n * the markup that registration renders rather than one fixed spelling.\n */\nexport function targetSelector(identifier: string, name: string): string {\n  return `[data-${identifier}-target~=\"${name}\"]`;\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { announce, fillTemplate } from \"../utils/announce\";\nimport { AttributeLease } from \"../utils/attribute_lease\";\nimport { BeforeCacheReset } from \"../utils/before_cache_reset\";\nimport { firstTabStop, isTabStop } from \"../utils/focus_candidate\";\nimport { MicrotaskCoalescer } from \"../utils/microtask_coalescer\";\nimport { TabindexLoan } from \"../utils/tabindex_loan\";\nimport { targetSelector } from \"../utils/target_selector\";\n\n/** Target name of the per-row remove buttons. */\nconst REMOVE_PART = \"remove\";\n/** Target name of the hidden `_destroy` input. */\nconst DESTROY_FLAG_PART = \"destroyFlag\";\n\n/** `_destroy` values Rails treats as truthy; the flag value is the destruction truth source. */\nconst DESTROYED_VALUES = new Set([\"1\", \"true\"]);\n\n/**\n * Headless **nested / dynamic fields** for Rails `fields_for` +\n * `accepts_nested_attributes_for` (no dedicated APG pattern — form editing).\n * Clone a `<template>` row, renumber its index, and remove rows by flagging\n * `_destroy` (persisted) or dropping them from the DOM (unsaved).\n *\n * Markup contract (identifier: `stimeo--nested-form`):\n *   <div data-controller=\"stimeo--nested-form\" data-stimeo--nested-form-min-value=\"1\">\n *     <div data-stimeo--nested-form-target=\"list\">\n *       <!-- existing rows; a persisted row carries a _destroy flag + remove button -->\n *     </div>\n *     <template data-stimeo--nested-form-target=\"template\">\n *       <fieldset>\n *         <input name=\"order[items_attributes][__INDEX__][name]\">\n *         <button type=\"button\" data-stimeo--nested-form-target=\"remove\">Remove</button>\n *       </fieldset>\n *     </template>\n *     <button type=\"button\" data-stimeo--nested-form-target=\"add\"\n *             data-action=\"click->stimeo--nested-form#add\">Add</button>\n *   </div>\n *\n * Values: `min` / `max` bound the effective row count (`max` `0` = unlimited;\n * both are followed at runtime), `indexPlaceholder` is the template token\n * replaced per row (default `__INDEX__`), and `announce` + `countMessage` (a\n * `{count}` template) opt into the announcer bridge.\n *\n * `add` dispatches `{ index, element }`; `remove` dispatches `{ element, persisted }`;\n * `reconcile` dispatches `{ count, atMin, atMax }` when a change the controller did\n * not perform itself — rows appended or removed by Turbo Streams / a morph, or a\n * runtime `min` / `max` change — moves the published state.\n *\n * @remarks\n * Behavior only — server-side `accepts_nested_attributes_for`, per-field\n * validation, and reordering are out of scope. Row state lives **only** in the DOM\n * (inserted nodes + each `_destroy` hidden input); there is no module-scope index\n * counter, so the controller stays idempotent across Turbo swaps. A row counts as\n * destroyed when its own `_destroy` flag holds a truthy value — `hidden` is the\n * visual half the controller writes alongside the flag, so a consumer hiding rows\n * for other reasons does not affect the count. Remove buttons and destroy flags\n * are resolved by **delegation scoped to their nearest nested-form root**, so\n * dynamically-added rows work without per-row `data-action` and one instance\n * nested inside another never acts on the inner instance's buttons or flags.\n * External row changes are observed on the list and reconciled once per mutation\n * batch. Adding a row moves focus to its first tab stop; removing returns focus to\n * the nearest surviving row's first tab stop, falling back to the add button and\n * finally to the root via a temporary `tabindex` (WCAG 2.2 2.4.3) — candidates\n * that cannot take focus (natively `disabled`, inside `fieldset[disabled]`, or not\n * rendered) are skipped. Count changes from the controller's own add / remove are\n * announced through the shared `stimeo--announcer` (WCAG 2.2 4.1.3) when\n * `announce` + `countMessage` are set; reconciliation stays silent to assistive\n * tech. The add button's `disabled` is managed only while `max` is set, and the\n * authored value is restored on teardown. A template must produce exactly one\n * root element; markup lacking the required `list` / `template` targets, or a\n * template producing anything else, is named on the console once per connection\n * and every operation stays a safe no-op with nothing left in the list. Clicking\n * remove on a row whose flag is already truthy only completes its hiding —\n * nothing effective changes, so no event and no announcement. The delegated\n * listener, the observer, and every lease are released on `disconnect()`.\n */\nexport class NestedFormController extends Controller<HTMLElement> {\n  /** Selects any root of this controller; the nearest one owns an element. */\n  get #rootSelector(): string {\n    return `[data-controller~=\"${this.identifier}\"]`;\n  }\n\n  /** Selects per-row remove buttons, in the namespace this controller is registered under. */\n  get #removeSelector(): string {\n    return targetSelector(this.identifier, REMOVE_PART);\n  }\n\n  /** Selects the hidden `_destroy` input a persisted row carries. */\n  get #destroyFlagSelector(): string {\n    return targetSelector(this.identifier, DESTROY_FLAG_PART);\n  }\n\n  static override targets = [\"list\", \"template\", \"add\", \"remove\", \"destroyFlag\"];\n  static override values = {\n    min: { type: Number, default: 0 },\n    max: { type: Number, default: 0 },\n    indexPlaceholder: { type: String, default: \"__INDEX__\" },\n    announce: { type: Boolean, default: true },\n    countMessage: { type: String, default: \"\" },\n  };\n  static actions = [\"add\"] as const;\n  static events = [\"add\", \"remove\", \"reconcile\"] as const;\n\n  declare readonly listTarget: HTMLElement;\n  declare readonly templateTarget: HTMLTemplateElement;\n  declare readonly addTarget: HTMLButtonElement;\n  declare readonly hasListTarget: boolean;\n  declare readonly hasTemplateTarget: boolean;\n  declare readonly hasAddTarget: boolean;\n\n  declare minValue: number;\n  declare maxValue: number;\n  declare indexPlaceholderValue: string;\n  declare announceValue: boolean;\n  declare countMessageValue: string;\n\n  /** Monotonic source for unique row indices; never a row-state counter. */\n  #lastIndex = 0;\n\n  #warnedMissing = false;\n  #warnedTemplate = false;\n\n  /** The state last written to the hooks; reconciliation reports only real moves. */\n  #published: { count: number; atMin: boolean; atMax: boolean } | null = null;\n\n  /** Watches the list for row changes the controller did not perform itself. */\n  #observer: MutationObserver | null = null;\n\n  readonly #reconcile = new MicrotaskCoalescer(() => this.#reconcileNow());\n  /** Restores the authored add-button `disabled` when a lease ends. */\n  readonly #addDisabled = new AttributeLease<HTMLButtonElement>(\"disabled\");\n  readonly #beforeCache = new BeforeCacheReset(() => this.#rewindForCache());\n  /** Makes the root a programmatic focus destination when no other candidate survives. */\n  readonly #tabindex = new TabindexLoan();\n\n  /**\n   * Delegated click handler for the per-row remove buttons (dynamic-safe). Only\n   * buttons whose nearest nested-form root is this instance are acted on, so a\n   * nested inner form's buttons never remove an outer row.\n   */\n  readonly #onClick = (event: Event): void => {\n    const target = event.target as HTMLElement | null;\n    const button = target?.closest<HTMLElement>(this.#removeSelector);\n    if (!button || this.#ownerOf(button) !== this.element) return;\n    const row = this.#rowContaining(button);\n    if (row) this.#removeRow(row);\n  };\n\n  override connect(): void {\n    this.#warnedMissing = false;\n    this.#warnedTemplate = false;\n    this.element.addEventListener(\"click\", this.#onClick);\n    this.#reconcile.activate();\n    this.#beforeCache.activate();\n    if (!this.hasListTarget || !this.hasTemplateTarget) this.#warnMissing();\n    this.#refresh();\n  }\n\n  override disconnect(): void {\n    this.element.removeEventListener(\"click\", this.#onClick);\n    this.#observer?.disconnect();\n    this.#observer = null;\n    this.#reconcile.cancel();\n    this.#beforeCache.deactivate();\n    this.#rewindForCache();\n    this.#tabindex.returnAll();\n    this.#published = null;\n  }\n\n  /** Follows an arriving or swapped-in list: rebind to the primary, then reconcile. */\n  listTargetConnected(): void {\n    this.#rebindObserver();\n    this.#reconcile.schedule();\n  }\n\n  /** Follows a departing list the same way — the primary may have changed. */\n  listTargetDisconnected(): void {\n    this.#rebindObserver();\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Points the observer at the current primary list. Re-deriving on every list\n   * arrival and departure makes the binding independent of the order Stimulus\n   * reports an overlapping swap in — a staggered swap (successor appended before\n   * the old list leaves) ends observed and reconciled either way.\n   */\n  #rebindObserver(): void {\n    this.#observer?.disconnect();\n    this.#observer = null;\n    if (!this.hasListTarget) return;\n    this.#observer = new MutationObserver(() => this.#reconcile.schedule());\n    this.#observer.observe(this.listTarget, {\n      childList: true,\n      subtree: true,\n      attributes: true,\n      attributeFilter: [\"value\"],\n    });\n  }\n\n  /** Returns the lease with a departing add button; a new one re-arms on refresh. */\n  addTargetDisconnected(target: HTMLButtonElement): void {\n    this.#addDisabled.return(target);\n    this.#reconcile.schedule();\n  }\n\n  addTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-clamps when application code or a Turbo morph changes `min`. */\n  minValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-clamps when application code or a Turbo morph changes `max`. */\n  maxValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Clones the template row, replaces the index placeholder with a unique value,\n   * appends it, focuses its first tab stop, and announces the new count. No-ops at\n   * `max`, when the required targets are missing (named on the console once per\n   * connection), or when the template does not produce exactly one root element\n   * (also named once; the insertion is rolled back so nothing accumulates).\n   */\n  add(): void {\n    if (!this.hasListTarget || !this.hasTemplateTarget) {\n      this.#warnMissing();\n      return;\n    }\n    if (this.#atMax) return;\n\n    const index = this.#nextIndex();\n    const markup = this.templateTarget.innerHTML.replaceAll(\n      this.indexPlaceholderValue,\n      String(index),\n    );\n    const list = this.listTarget;\n    const beforeNodes = list.childNodes.length;\n    const beforeElements = list.childElementCount;\n    list.insertAdjacentHTML(\"beforeend\", markup);\n    const added = (Array.from(list.children) as HTMLElement[]).slice(beforeElements);\n    if (added.length !== 1) {\n      // A row is exactly one element. Anything else — escaped text, nothing, or\n      // several roots (which the max gate above cannot account for) — rolls back\n      // so repeated clicks cannot accumulate garbage or overshoot the max.\n      while (list.childNodes.length > beforeNodes) list.lastChild?.remove();\n      this.#warnBadTemplate(added.length);\n      return;\n    }\n    const row = added[0] as HTMLElement;\n    // A template is authored across lines, so parsing its markup also yields the\n    // whitespace around the row. Dropping it leaves the row as the whole unit the\n    // removal takes back, and adds nothing to the list but the row.\n    for (const node of Array.from(list.childNodes).slice(beforeNodes)) {\n      if (node !== row) node.remove();\n    }\n\n    this.#refresh();\n    firstTabStop(row)?.focus();\n    this.dispatch(\"add\", { detail: { index, element: row } });\n    this.#announce();\n  }\n\n  /**\n   * Removes a row: a persisted row (one carrying its own `destroyFlag`) has the\n   * flag set to `1` and is hidden so Rails destroys it on submit; an unsaved row\n   * is dropped from the DOM. Returns focus to a surviving row. No-ops at `min`.\n   *\n   * @stimeoRuntimeOnly `min` decides whether this one removal is allowed.\n   */\n  #removeRow(row: HTMLElement): void {\n    const rows = this.#effectiveRows;\n    if (this.#destroyed(row)) {\n      // An already-destroyed row left visible (a server re-render keeps the\n      // flag but not the hiding): complete the visual half. The effective\n      // state does not move, so no event, no announcement, and no min gate.\n      row.hidden = true;\n      this.#focusAfterRemove(this.#positionAmong(rows, row));\n      return;\n    }\n    if (rows.length <= this.minValue) return;\n\n    const position = rows.indexOf(row);\n    const flag = this.#destroyFlagOf(row);\n    const persisted = flag !== null;\n    if (flag) {\n      flag.value = \"1\";\n      row.hidden = true;\n    } else {\n      row.remove();\n    }\n\n    this.#refresh();\n    this.#focusAfterRemove(Math.max(0, position));\n    this.dispatch(\"remove\", { detail: { element: row, persisted } });\n    this.#announce();\n  }\n\n  /**\n   * The index of the first effective row following `row` in document order.\n   * -1 (no following row) feeds the focus slices as a negative index, which\n   * yields the same fully-reversed nearest-first order as `rows.length` would.\n   */\n  #positionAmong(rows: HTMLElement[], row: HTMLElement): number {\n    return rows.findIndex(\n      (candidate) =>\n        (row.compareDocumentPosition(candidate) & Node.DOCUMENT_POSITION_FOLLOWING) !== 0,\n    );\n  }\n\n  /**\n   * Moves focus to the first tab stop of the nearest surviving row — following\n   * rows first, then preceding ones — falling back to the add button and finally\n   * to the root via a temporary `tabindex`.\n   */\n  #focusAfterRemove(position: number): void {\n    const rows = this.#effectiveRows;\n    const ordered = [...rows.slice(position), ...rows.slice(0, position).reverse()];\n    for (const row of ordered) {\n      const stop = firstTabStop(row);\n      if (stop) {\n        stop.focus();\n        return;\n      }\n    }\n    if (this.hasAddTarget && isTabStop(this.addTarget)) {\n      this.addTarget.focus();\n      return;\n    }\n    this.#tabindex.lend(this.element);\n    this.element.focus();\n  }\n\n  /**\n   * Recomputes the count and min/max hooks from the DOM and records them as published.\n   *\n   * @stimeoRenderRoot\n   */\n  #refresh(): void {\n    if (!this.hasListTarget) return;\n    const count = this.#effectiveRows.length;\n    const atMin = count <= this.minValue;\n    const atMax = this.maxValue > 0 && count >= this.maxValue;\n    this.element.setAttribute(\"data-nested-count\", String(count));\n    this.#reflect(\"data-nested-at-max\", atMax);\n    this.#reflect(\"data-nested-at-min\", atMin);\n    if (this.hasAddTarget) {\n      // The button's disabled is controller state only while a max exists;\n      // without one there is nothing to derive and the authored value stands.\n      if (this.maxValue > 0) this.#addDisabled.write(this.addTarget, atMax ? \"\" : null);\n      else this.#addDisabled.return(this.addTarget);\n    }\n    this.#published = { count, atMin, atMax };\n  }\n\n  /**\n   * Applies row changes the controller did not perform itself (Turbo Streams,\n   * morphs, runtime Value changes): refreshes the hooks and reports a moved\n   * public state as `reconcile`. The controller's own operations refresh\n   * synchronously first, so their observer echo arrives here as a no-move.\n   */\n  #reconcileNow(): void {\n    const previous = this.#published;\n    this.#refresh();\n    const current = this.#published;\n    if (!previous || !current) return;\n    const moved =\n      previous.count !== current.count ||\n      previous.atMin !== current.atMin ||\n      previous.atMax !== current.atMax;\n    if (moved) this.dispatch(\"reconcile\", { detail: { ...current } });\n  }\n\n  /**\n   * Bridges the count change to the shared announcer when configured.\n   *\n   * @stimeoRuntimeOnly `announce` and `countMessage` word the one announcement of this change.\n   */\n  #announce(): void {\n    if (!this.announceValue || this.countMessageValue === \"\") return;\n    announce(fillTemplate(this.countMessageValue, { count: this.#effectiveRows.length }));\n  }\n\n  /** Sets `attribute` to `\"true\"` when `on`, else removes it. */\n  #reflect(attribute: string, on: boolean): void {\n    if (on) this.element.setAttribute(attribute, \"true\");\n    else this.element.removeAttribute(attribute);\n  }\n\n  /** Returns the disabled lease so an authored value never leaks into a snapshot. */\n  #rewindForCache(): void {\n    if (this.hasAddTarget) this.#addDisabled.return(this.addTarget);\n  }\n\n  /** Names the missing required target(s) once per connection. */\n  #warnMissing(): void {\n    if (this.#warnedMissing) return;\n    this.#warnedMissing = true;\n    const missing = [\n      this.hasListTarget ? null : 'a \"list\" target',\n      this.hasTemplateTarget ? null : 'a \"template\" target',\n    ]\n      .filter((part): part is string => part !== null)\n      .join(\" and \");\n    console.warn(\n      `Stimeo UI: \"${this.identifier}\" cannot manage rows because its markup lacks ${missing}.`,\n    );\n  }\n\n  /** Names a template that does not produce exactly one element, once per connection. */\n  #warnBadTemplate(produced: number): void {\n    if (this.#warnedTemplate) return;\n    this.#warnedTemplate = true;\n    const reason = produced === 0 ? \"produces no element\" : \"must produce exactly one root element\";\n    console.warn(`Stimeo UI: \"${this.identifier}\" added no row because its template ${reason}.`);\n  }\n\n  /** A strictly-increasing unique index (collision-free even on rapid adds). */\n  #nextIndex(): number {\n    const index = Math.max(Date.now(), this.#lastIndex + 1);\n    this.#lastIndex = index;\n    return index;\n  }\n\n  get #atMax(): boolean {\n    return this.maxValue > 0 && this.#effectiveRows.length >= this.maxValue;\n  }\n\n  /**\n   * Direct child rows of the list whose own destroy flag is not set. Callers\n   * reach this only behind a list-presence gate (`add`, `#refresh`, and the\n   * click path through `#rowContaining`).\n   */\n  get #effectiveRows(): HTMLElement[] {\n    return (Array.from(this.listTarget.children) as HTMLElement[]).filter(\n      (row) => !this.#destroyed(row),\n    );\n  }\n\n  /** Whether `row` is flagged for destruction; the flag value is the truth source. */\n  #destroyed(row: HTMLElement): boolean {\n    const flag = this.#destroyFlagOf(row);\n    return flag !== null && DESTROYED_VALUES.has(flag.value);\n  }\n\n  /** The row's own destroy flag, skipping flags owned by a nested inner form. */\n  #destroyFlagOf(row: HTMLElement): HTMLInputElement | null {\n    for (const flag of row.querySelectorAll<HTMLInputElement>(this.#destroyFlagSelector)) {\n      if (this.#ownerOf(flag) === this.element) return flag;\n    }\n    return null;\n  }\n\n  /** The nearest nested-form root that owns `el`. */\n  #ownerOf(el: Element): Element | null {\n    return el.closest(this.#rootSelector);\n  }\n\n  /** The nearest ancestor of `el` that is a direct child of the list, else null. */\n  #rowContaining(el: Element): HTMLElement | null {\n    if (!this.hasListTarget) return null;\n    let node: Element | null = el;\n    while (node && node.parentElement !== this.listTarget) {\n      node = node.parentElement;\n    }\n    return node as HTMLElement | null;\n  }\n}\n"]}
+{"version":3,"sources":["../../src/utils/announce.ts","../../src/utils/shared_registry.ts","../../src/utils/attribute_lease.ts","../../src/utils/focus_candidate.ts","../../src/utils/listener_set.ts","../../src/utils/microtask_coalescer.ts","../../src/utils/morph_render_watcher.ts","../../src/utils/number_bounds.ts","../../src/utils/coerce.ts","../../src/utils/number_value.ts","../../src/utils/query_open_descendants.ts","../../src/utils/tabindex_loan.ts","../../src/utils/target_selector.ts","../../src/controllers/nested_form_controller.ts"],"names":["above"],"mappings":";;AAoBO,SAAS,QAAA,CAAS,OAAA,EAAiB,OAAA,GAAmC,EAAC,EAAS;AACrF,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAC1B,EAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACvB,EAAA,MAAA,CAAO,aAAA;AAAA,IACL,IAAI,YAAY,4BAAA,EAA8B;AAAA,MAC5C,QAAQ,EAAE,OAAA,EAAS,MAAM,SAAA,EAAW,OAAA,CAAQ,cAAc,IAAA;AAAK,KAChE;AAAA,GACH;AACF;AAUO,SAAS,YAAA,CAAa,UAAkB,MAAA,EAAiD;AAC9F,EAAA,OAAO,QAAA,CAAS,OAAA,CAAQ,6BAAA,EAA+B,CAAC,OAAO,IAAA,KAAiB;AAC9E,IAAA,MAAM,WAAA,GAAc,OAAO,IAAI,CAAA;AAC/B,IAAA,OAAO,WAAA,KAAgB,MAAA,GAAY,KAAA,GAAQ,MAAA,CAAO,WAAW,CAAA;AAAA,EAC/D,CAAC,CAAA;AACH;;ACfO,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;;ACLA,SAAS,iBAAiB,KAAA,EAAwC;AAChE,EAAA,OAAO,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA;AAC5C;AAOA,SAAS,eAAA,CAAgB,SAAkB,MAAA,EAAkD;AAC3F,EAAA,IAAI;AACF,IAAA,MAAM,SAAkB,IAAA,CAAK,KAAA,CAAM,QAAQ,YAAA,CAAa,MAAM,KAAK,MAAM,CAAA;AACzE,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,GAAG,OAAO,KAAA,CAAA;AACnC,IAAA,MAAM,CAAC,QAAA,EAAU,OAAA,EAAS,GAAG,IAAI,CAAA,GAAI,MAAA;AACrC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,CAAC,CAAA,KAAM,KAAA;AAC3B,IAAA,MAAM,OAAA,GAAU,MAAA,GAAS,IAAA,GAAO,IAAA,CAAK,MAAM,CAAC,CAAA;AAC5C,IAAA,IAAI,CAAC,QAAQ,KAAA,CAAM,CAAC,UAA2B,OAAO,KAAA,KAAU,QAAQ,CAAA,EAAG,OAAO,KAAA,CAAA;AAClF,IAAA,OAAO,gBAAA,CAAiB,QAAQ,CAAA,IAAK,gBAAA,CAAiB,OAAO,CAAA,GACzD,EAAE,QAAA,EAAU,OAAA,EAAS,MAAA,EAAQ,OAAA,EAAQ,GACrC,KAAA,CAAA;AAAA,EACN,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AA4EO,IAAM,cAAA,GAAN,MAAM,eAAA,CAA4C;AAAA,EAEvD,OAAgB,SAAA,GAAY,cAAA;AAAA,IAC1B,uCAAA;AAAA,IACA,OAA+B,EAAE,MAAA,kBAAQ,IAAI,SAAQ,EAAG,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAE;AAAA,GAC3E;AAAA,EACS,UAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAO;AAAA,EAO5B,WAAA,CAAY,SAAA,EAAmB,KAAA,EAAe,OAAA,GAAuC,EAAC,EAAG;AACvF,IAAA,IAAA,CAAK,UAAA,GAAa,SAAA;AAClB,IAAA,IAAA,CAAK,OAAA,GAAU,CAAA,KAAA,EAAQ,KAAK,CAAA,CAAA,EAAI,SAAS,CAAA,MAAA,CAAA;AACzC,IAAA,IAAA,CAAK,KAAA,GAAQ,QAAQ,IAAA,KAAS,IAAA;AAC9B,IAAA,MAAM,KAAA,GAAQ,gBAAe,SAAA,CAAU,KAAA;AACvC,IAAA,KAAA,CAAM,GAAA,CAAI,SAAA,EAAA,CAAY,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,oBAAK,IAAI,GAAA,EAAY,EAAG,GAAA,CAAI,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,EACpF;AAAA,EAGA,KAAA,CAAM,SAAY,KAAA,EAA4B;AAC5C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACjC,IAAA,MAAM,IAAA,GAAO,KAAK,KAAA,CAAM,KAAK,KAAK,IAAA,CAAK,QAAA,CAAS,SAAS,KAAK,CAAA;AAC9D,IAAA,IAAA,CAAK,KAAA,CAAM,IAAI,OAAO,CAAA;AACtB,IAAA,MAAM,QAAQ,CAAC,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,OAAO,IAAI,CAAA;AACjD,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,KAAA,CAAM,SAAS,KAAK,CAAA;AACzB,IAAA,IAAI,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,OAAA,EAAS,KAAK,CAAA;AAAA,EACzC;AAAA,EAQA,OAAO,OAAA,EAAqB;AAC1B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,OAAO,CAAA;AACtC,IAAA,MAAM,KAAA,GAAQ,gBAAe,SAAA,CAAU,MAAA,CAAO,IAAI,OAAO,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,UAAU,CAAA;AAC/E,IAAA,MAAM,KAAA,GAAQ,IAAA,IAAQ,KAAA,IAAS,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,GAAI,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA,GAAI,EAAC;AAC5F,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAC7B,IAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,IAAA,MAAM,UAAU,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,MAAM,IAAA,CAAK,OAAA;AAC/D,IAAA,MAAM,OAAO,OAAA,IAAW,CAAC,KAAK,QAAA,CAAS,OAAA,EAAS,OAAO,IAAI,CAAA;AAC3D,IAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA;AAChC,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,IAAA,CAAK,SAAS,OAAA,EAAS,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,KAAK,QAAQ,CAAA;AAC5D,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,EAGA,OAAO,OAAA,EAA6B;AAClC,IAAA,MAAM,MAAA,GAAS,gBAAe,SAAA,CAAU,MAAA;AACxC,IAAA,MAAM,cAAc,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA,wBAAS,GAAA,EAA6B;AAC5E,IAAA,MAAA,CAAO,GAAA,CAAI,SAAS,WAAW,CAAA;AAC/B,IAAA,MAAM,KAAA,GAAQ,YAAY,GAAA,CAAI,IAAA,CAAK,UAAU,CAAA,IAAK,IAAA,CAAK,MAAM,OAAO,CAAA;AACpE,IAAA,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA;AACtC,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAGA,MAAM,OAAA,EAA6B;AACjC,IAAA,MAAM,QAAgE,EAAC;AACvE,IAAA,KAAA,MAAW,MAAA,IAAU,gBAAe,SAAA,CAAU,KAAA,CAAM,IAAI,IAAA,CAAK,UAAU,CAAA,IAAK,EAAC,EAAG;AAC9E,MAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,OAAA,EAAS,MAAM,CAAA;AAC5C,MAAA,IAAI,MAAM,KAAA,CAAM,IAAA,CAAK,EAAE,GAAG,IAAA,EAAM,QAAQ,CAAA;AAAA,IAC1C;AACA,IAAA,MAAM,QAAQ,CAAC,EAAE,OAAA,EAAQ,KACvB,QAAQ,MAAA,CAAO,CAAC,IAAA,KAAS,KAAA,CAAM,KAAK,CAAC,KAAA,KAAU,MAAM,MAAA,KAAW,IAAI,CAAC,CAAA,CAAE,MAAA;AACzE,IAAA,OAAO,KAAA,CACJ,KAAK,CAAC,GAAA,EAAK,UAAU,KAAA,CAAM,GAAG,IAAI,KAAA,CAAM,KAAK,CAAC,CAAA,CAC9C,GAAA,CAAI,CAAC,EAAE,MAAA,EAAQ,SAAS,QAAA,EAAU,MAAA,IAAU,KAAA,MAAW;AAAA,MACtD,KAAA,EAAO,IAAA;AAAA,MACP,MAAA;AAAA,MACA,OAAA;AAAA,MACA,QAAA;AAAA,MACA,MAAA,EAAQ,UAAU,KAAA,GAAQ;AAAA,KAC5B,CAAE,CAAA;AAAA,EACN;AAAA,EAGA,MAAM,KAAA,EAAmD;AACvD,IAAA,MAAM,OACJ,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,UAAU,IAAI,CAAA,IACxC,MAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,KAAA,KAAU,QAAQ,IAAA,CAAK,MAAA,KAAW,KAAK,OAAO,CAAA;AAC1E,IAAA,IAAI,IAAA,OAAW,KAAA,GAAQ,IAAA;AACvB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAGA,QAAA,CAAS,SAAY,KAAA,EAAuC;AAC1D,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA;AACpD,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,EAAA,CAAG,EAAE,CAAA;AACvB,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,MAAM,IAAA,GAAO,GAAA,EAAK,OAAA,KAAY,OAAA,GAAU,GAAA,GAAM,MAAA;AAC9C,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,GAAQ,MAAA,GAAS,IAAA;AACnC,IAAA,MAAM,IAAA,GAAsB;AAAA,MAC1B,KAAA,EAAO,IAAA;AAAA,MACP,QAAQ,IAAA,CAAK,OAAA;AAAA,MACb,OAAA,EAAS,OAAA;AAAA,MACT,QAAA,EAAU,IAAA,GAAO,IAAA,CAAK,QAAA,GAAW,OAAA;AAAA,MACjC,MAAA,EAAQ,CAAC,IAAA,CAAK,KAAA,IAAS,IAAA,KAAS;AAAA,KAClC;AACA,IAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,MAAA,MAAA,CAAO,MAAA,GAAS,IAAA;AAChB,MAAA,KAAA,CAAM,QAAQ,IAAI,CAAA;AAAA,IACpB,CAAA,MAAO,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AACtB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAGA,QAAA,CAAS,OAAA,EAAY,KAAA,EAAiC,IAAA,EAA8B;AAClF,IAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,CAAA;AACpD,IAAA,OAAO,KAAA,CAAM,KAAA,CAAM,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,YAAY,OAAO,CAAA;AAAA,EACvF;AAAA,EAGA,KAAA,CAAM,SAAY,KAAA,EAAuC;AACvD,IAAA,MAAM,OAAA,uBAAc,GAAA,CAA2B,CAAC,CAAC,IAAA,CAAK,OAAA,EAAS,IAAI,CAAC,CAAC,CAAA;AACrE,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,EAAM,KAAA,KAAU;AAC7B,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,KAAK,EAAE,GAAA,CAAI,CAAC,KAAA,KAAU,KAAA,CAAM,MAAM,CAAA;AAC/D,MAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAI,IAAI,KAAA,CAAM,OAAA,EAAS,CAAC,EAAE,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,KAAS,KAAK,MAAM,CAAA;AACnF,MAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,OAAA,CAAQ,WAAW,CAAA,GAAI,EAAC,GAAI,CAAC,KAAK,CAAA;AAChE,MAAA,OAAA,CAAQ,GAAA;AAAA,QACN,IAAA,CAAK,MAAA;AAAA,QACL,IAAA,CAAK,YAAY,IAAA,CAAK,QAAA,IAAY,QAAQ,MAAA,KAAW,CAAA,IAAK,KAAA,KAAU,KAAA,CAAM,MAAA,GAAS,CAAA,GAC/E,OACA,IAAA,CAAK,SAAA,CAAU,CAAC,IAAA,CAAK,QAAA,EAAU,IAAA,CAAK,SAAS,GAAG,MAAA,EAAQ,GAAG,OAAO,CAAC;AAAA,OACzE;AAAA,IACF,CAAC,CAAA;AACD,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;AAAA,EAGA,QAAA,CAAS,SAAY,KAAA,EAA4B;AAC/C,IAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAU,MAAM,KAAA,EAAO;AACrD,IAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,KAAK,UAAU,CAAA;AAAA,SACtD,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA;AAAA,EAClD;AACF,CAAA;;ACrRO,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;AAGO,IAAM,2BAAA,GAA8B;AAAA,EACzC,SAAA;AAAA,EACA,YAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,iBAAA;AAAA,EACA,iBAAA;AAAA,EACA,YAAA;AAAA,EACA;AACF,CAAA,CAAE,KAAK,GAAG,CAAA;AAQH,SAAS,mBAAmB,OAAA,EAA+B;AAChE,EAAA,MAAM,QAAS,OAAA,CAA8C,eAAA;AAC7D,EAAA,OAAO,OAAO,KAAA,KAAU,UAAA,GAAa,KAAA,CAAM,IAAA,CAAK,SAAS,EAAE,kBAAA,EAAoB,IAAA,EAAM,CAAA,GAAI,IAAA;AAC3F;AAGA,SAAS,iBAAiB,OAAA,EAAiC;AACzD,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,UAAU,CAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,QAAQ,CAAC,YAAA,CAAa,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,IAAA;AAC/D,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAGA,SAAS,iBAAiB,OAAA,EAA+B;AACvD,EAAA,IAAI,OAAA,YAAmB,iBAAA,IAAqB,OAAA,YAAmB,eAAA,EAAiB;AAC9E,IAAA,OAAO,OAAA,CAAQ,aAAa,MAAM,CAAA;AAAA,EACpC;AACA,EAAA,IACE,OAAA,YAAmB,iBAAA,IACnB,OAAA,YAAmB,iBAAA,IACnB,mBAAmB,mBAAA,EACnB;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,YAAmB,gBAAA,EAAkB,OAAO,OAAA,CAAQ,IAAA,KAAS,QAAA;AACjE,EAAA,IAAI,OAAA,YAAmB,mBAAmB,OAAO,IAAA;AACjD,EAAA,IAAI,OAAA,CAAQ,OAAA,KAAY,OAAA,IAAW,OAAA,CAAQ,YAAY,OAAA,EAAS;AAC9D,IAAA,OAAO,OAAA,CAAQ,aAAa,UAAU,CAAA;AAAA,EACxC;AACA,EAAA,IAAI,OAAA,YAAmB,WAAA,IAAe,OAAA,CAAQ,OAAA,KAAY,SAAA,EAAW;AACnE,IAAA,MAAM,UAAU,OAAA,CAAQ,aAAA;AACxB,IAAA,OACE,OAAA,YAAmB,kBAAA,IACnB,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,CAAE,IAAA,CAAK,CAAC,KAAA,KAAU,KAAA,CAAM,OAAA,KAAY,SAAS,CAAA,KAAM,OAAA;AAAA,EAElF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,mBAAmB,OAAA,EAA+B;AACzD,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,YAAA,CAAa,iBAAiB,GAAG,WAAA,EAAY;AACnE,EAAA,OAAO,KAAA,KAAU,EAAA,IAAM,KAAA,KAAU,MAAA,IAAU,KAAA,KAAU,gBAAA;AACvD;AAUO,SAAS,UAAU,OAAA,EAA+B;AACvD,EAAA,IAAI,CAAC,aAAa,OAAO,CAAA,IAAK,CAAC,kBAAA,CAAmB,OAAO,GAAG,OAAO,KAAA;AAEnE,EAAA,MAAM,QAAA,GAAW,iBAAiB,OAAO,CAAA;AACzC,EAAA,IAAI,QAAA,KAAa,IAAA,EAAM,OAAO,QAAA,IAAY,CAAA;AAC1C,EAAA,OAAO,gBAAA,CAAiB,OAAO,CAAA,IAAK,kBAAA,CAAmB,OAAO,CAAA;AAChE;AAUO,SAAS,aAAa,IAAA,EAAsC;AACjE,EAAA,KAAA,MAAW,SAAA,IAAa,IAAA,CAAK,gBAAA,CAA8B,2BAA2B,CAAA,EAAG;AACvF,IAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG,OAAO,SAAA;AAAA,EACnC;AACA,EAAA,OAAO,IAAA;AACT;;AC7KO,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;;ACbO,IAAM,aAAA,GAAgB;AAAA,EAE3B,WAAA,EAAa,EAAE,MAAA,EAAQ,IAAA,EAAM,KAAK,CAAA,EAQpC,CAAA;AAMO,SAAS,mBAAA,CAAoB,OAAe,MAAA,EAA+B;AAChF,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG;AAC3B,IAAA,MAAM,YAAY,KAAA,KAAU,QAAA,GAAW,UAAA,GAAa,KAAA,KAAU,YAAY,UAAA,GAAa,IAAA;AACvF,IAAA,IAAI,SAAA,KAAc,MAAM,OAAO,KAAA;AAC/B,IAAA,IAAI,OAAO,aAAA,KAAkB,MAAA,IAAU,MAAA,CAAO,aAAA,KAAkB,WAAW,OAAO,KAAA;AAAA,EACpF;AACA,EAAA,IAAI,OAAO,GAAA,KAAQ,MAAA,IAAa,KAAA,GAAQ,MAAA,CAAO,KAAK,OAAO,KAAA;AAC3D,EAAA,IAAI,OAAO,GAAA,KAAQ,MAAA,IAAa,KAAA,GAAQ,MAAA,CAAO,KAAK,OAAO,KAAA;AAC3D,EAAA,IAAI,OAAO,YAAA,KAAiB,MAAA,IAAa,KAAA,IAAS,MAAA,CAAO,cAAc,OAAO,KAAA;AAC9E,EAAA,IAAI,OAAO,OAAA,IAAW,CAAC,OAAO,SAAA,CAAU,KAAK,GAAG,OAAO,KAAA;AACvD,EAAA,IAAI,MAAA,CAAO,kBAAkB,MAAA,IAAa,CAAC,OAAO,aAAA,CAAc,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AACxF,EAAA,OAAO,IAAA;AACT;;AChCO,SAAS,UAAA,CAAW,GAAA,EAAa,QAAA,EAAkB,MAAA,EAA8B;AACtF,EAAA,OAAO,mBAAA,CAAoB,GAAA,EAAK,MAAM,CAAA,GAAI,GAAA,GAAM,QAAA;AAClD;;AClBO,IAAM,oBAAN,MAAwB;AAAA,EAEpB,aAAA,uBAAoB,GAAA,EAAoB;AAAA,EAGjD,IAAA,CACE,KAAA,EACA,IAAA,EACA,GAAA,EACA,UACA,MAAA,EACQ;AACR,IAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,EAAK,QAAA,EAAU,MAAM,CAAA;AACjD,IAAA,IAAI,mBAAA,CAAoB,GAAA,EAAK,MAAM,CAAA,EAAG;AACpC,MAAA,IAAA,CAAK,aAAA,CAAc,OAAO,IAAI,CAAA;AAC9B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,MAAM,SAAA,GAAY,CAAA,KAAA,EAAQ,KAAA,CAAM,UAAU,IAAI,IAAA,CAAK,OAAA,CAAQ,QAAA,EAAU,CAAC,WAAW,CAAA,CAAA,EAAI,MAAA,CAAO,WAAA,EAAa,EAAE,CAAC,CAAA,MAAA,CAAA;AAC5G,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,OAAA,CAAQ,YAAA,CAAa,SAAS,CAAA;AACpD,IAAA,IAAI,YAAY,IAAA,EAAM;AACpB,MAAA,IAAA,CAAK,aAAA,CAAc,OAAO,IAAI,CAAA;AAC9B,MAAA,OAAO,QAAA;AAAA,IACT;AACA,IAAA,IAAI,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,IAAI,MAAM,OAAA,EAAS;AAC5C,MAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,IAAA,EAAM,OAAO,CAAA;AACpC,MAAA,OAAA,CAAQ,IAAA;AAAA,QACN,CAAA,YAAA,EAAe,KAAA,CAAM,UAAU,CAAA,+BAAA,EAAkC,IAAI,CAAA,cAAA,EAAiB,IAAA,CAAK,SAAA,CAAU,OAAO,CAAC,CAAA,QAAA,EAAW,QAAQ,CAAA,CAAA;AAAA,OAClI;AAAA,IACF;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AACF,CAAA;;ACxCO,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;;ACqEO,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;;ACpMO,SAAS,cAAA,CAAe,YAAoB,IAAA,EAAsB;AACvE,EAAA,OAAO,CAAA,MAAA,EAAS,UAAU,CAAA,UAAA,EAAa,IAAI,CAAA,EAAA,CAAA;AAC7C;;ACFA,IAAM,WAAA,GAAc,QAAA;AAEpB,IAAM,iBAAA,GAAoB,aAAA;AAG1B,IAAM,mCAAmB,IAAI,GAAA,CAAI,CAAC,GAAA,EAAK,MAAM,CAAC,CAAA;AA6DvC,IAAM,oBAAA,GAAN,MAAM,qBAAA,SAA6B,UAAA,CAAwB;AAAA,EAEvD,QAAA,GAAW,IAAI,iBAAA,EAAkB;AAAA,EAG1C,IAAI,aAAA,GAAwB;AAC1B,IAAA,OAAO,CAAA,mBAAA,EAAsB,KAAK,UAAU,CAAA,EAAA,CAAA;AAAA,EAC9C;AAAA,EAGA,IAAI,eAAA,GAA0B;AAC5B,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,UAAA,EAAY,WAAW,CAAA;AAAA,EACpD;AAAA,EAGA,IAAI,oBAAA,GAA+B;AACjC,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,UAAA,EAAY,iBAAiB,CAAA;AAAA,EAC1D;AAAA,EAEA,OAAgB,OAAA,GAAU,CAAC,QAAQ,UAAA,EAAY,KAAA,EAAO,UAAU,aAAa,CAAA;AAAA,EAC7E,OAAgB,MAAA,GAAS;AAAA,IACvB,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IAChC,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IAChC,gBAAA,EAAkB,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IACvD,QAAA,EAAU,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,IAAA,EAAK;AAAA,IACzC,YAAA,EAAc,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,EAAA;AAAG,GAC5C;AAAA,EAEA,OAAO,gBAAA,GAAmB;AAAA,IACxB,KAAK,aAAA,CAAc,WAAA;AAAA,IACnB,KAAK,aAAA,CAAc;AAAA,GACrB;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,KAAK,CAAA;AAAA,EACvB,OAAO,MAAA,GAAS,CAAC,KAAA,EAAO,UAAU,WAAW,CAAA;AAAA,EAgB7C,UAAA,GAAa,CAAA;AAAA,EAEb,cAAA,GAAiB,KAAA;AAAA,EACjB,eAAA,GAAkB,KAAA;AAAA,EAGlB,UAAA,GAAuE,IAAA;AAAA,EAGvE,SAAA,GAAqC,IAAA;AAAA,EAE5B,aAAa,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,eAAe,CAAA;AAAA,EAE9D,YAAA,GAAe,IAAI,cAAA,CAAkC,UAAA,EAAY,KAAK,UAAU,CAAA;AAAA,EAEhF,SAAA,GAAY,IAAI,YAAA,CAAa,IAAA,EAAM,KAAK,UAAU,CAAA;AAAA,EAOlD,QAAA,GAAW,CAAC,KAAA,KAAuB;AAC1C,IAAA,MAAM,SAAS,KAAA,CAAM,MAAA;AACrB,IAAA,MAAM,MAAA,GAAS,MAAA,EAAQ,OAAA,CAAqB,IAAA,CAAK,eAAe,CAAA;AAChE,IAAA,IAAI,CAAC,MAAA,IAAU,IAAA,CAAK,SAAS,MAAM,CAAA,KAAM,KAAK,OAAA,EAAS;AACvD,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,cAAA,CAAe,MAAM,CAAA;AACtC,IAAA,IAAI,GAAA,EAAK,IAAA,CAAK,UAAA,CAAW,GAAG,CAAA;AAAA,EAC9B,CAAA;AAAA,EAES,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACnC,IAAA,IAAA,CAAK,cAAA,GAAiB,KAAA;AACtB,IAAA,IAAA,CAAK,eAAA,GAAkB,KAAA;AACvB,IAAA,IAAA,CAAK,OAAA,CAAQ,gBAAA,CAAiB,OAAA,EAAS,IAAA,CAAK,QAAQ,CAAA;AACpD,IAAA,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AACpC,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,CAAC,IAAA,CAAK,iBAAA,OAAwB,YAAA,EAAa;AACtE,IAAA,IAAA,CAAK,QAAA,EAAS;AAAA,EAChB;AAAA,EAES,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,OAAA,CAAQ,mBAAA,CAAoB,OAAA,EAAS,IAAA,CAAK,QAAQ,CAAA;AACvD,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,aAAa,SAAA,EAAU;AAC5B,IAAA,IAAA,CAAK,UAAU,SAAA,EAAU;AACzB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAAA,EACpB;AAAA,EAGA,mBAAA,GAA4B;AAC1B,IAAA,IAAA,CAAK,eAAA,EAAgB;AACrB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,sBAAA,GAA+B;AAC7B,IAAA,IAAA,CAAK,eAAA,EAAgB;AACrB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAQA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,UAAA,EAAW;AAC3B,IAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AACjB,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACzB,IAAA,IAAA,CAAK,YAAY,IAAI,gBAAA,CAAiB,MAAM,IAAA,CAAK,UAAA,CAAW,UAAU,CAAA;AACtE,IAAA,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,IAAA,CAAK,UAAA,EAAY;AAAA,MACtC,SAAA,EAAW,IAAA;AAAA,MACX,OAAA,EAAS,IAAA;AAAA,MACT,UAAA,EAAY,IAAA;AAAA,MACZ,eAAA,EAAiB,CAAC,OAAO;AAAA,KAC1B,CAAA;AAAA,EACH;AAAA,EAGA,sBAAsB,MAAA,EAAiC;AACrD,IAAA,IAAA,CAAK,YAAA,CAAa,OAAO,MAAM,CAAA;AAC/B,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAEA,kBAAA,GAA2B;AACzB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,WAAW,QAAA,EAAS;AAAA,EAC3B;AAAA,EASA,GAAA,GAAY;AACV,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,CAAC,KAAK,iBAAA,EAAmB;AAClD,MAAA,IAAA,CAAK,YAAA,EAAa;AAClB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAK,MAAA,EAAQ;AAEjB,IAAA,MAAM,KAAA,GAAQ,KAAK,UAAA,EAAW;AAC9B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,cAAA,CAAe,SAAA,CAAU,UAAA;AAAA,MAC3C,IAAA,CAAK,qBAAA;AAAA,MACL,OAAO,KAAK;AAAA,KACd;AACA,IAAA,MAAM,OAAO,IAAA,CAAK,UAAA;AAClB,IAAA,MAAM,WAAA,GAAc,KAAK,UAAA,CAAW,MAAA;AACpC,IAAA,MAAM,iBAAiB,IAAA,CAAK,iBAAA;AAC5B,IAAA,IAAA,CAAK,kBAAA,CAAmB,aAAa,MAAM,CAAA;AAC3C,IAAA,MAAM,QAAS,KAAA,CAAM,IAAA,CAAK,KAAK,QAAQ,CAAA,CAAoB,MAAM,cAAc,CAAA;AAC/E,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AAItB,MAAA,OAAO,KAAK,UAAA,CAAW,MAAA,GAAS,WAAA,EAAa,IAAA,CAAK,WAAW,MAAA,EAAO;AACpE,MAAA,IAAA,CAAK,gBAAA,CAAiB,MAAM,MAAM,CAAA;AAClC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AAInB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,IAAA,CAAK,IAAA,CAAK,UAAU,CAAA,CAAE,KAAA,CAAM,WAAW,CAAA,EAAG;AACjE,MAAA,IAAI,IAAA,KAAS,GAAA,EAAK,IAAA,CAAK,MAAA,EAAO;AAAA,IAChC;AAEA,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,YAAA,CAAa,GAAG,GAAG,KAAA,EAAM;AACzB,IAAA,IAAA,CAAK,QAAA,CAAS,OAAO,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAO,OAAA,EAAS,GAAA,EAAI,EAAG,CAAA;AACxD,IAAA,IAAA,CAAK,SAAA,EAAU;AAAA,EACjB;AAAA,EAOA,WAAW,GAAA,EAAwB;AACjC,IAAA,MAAM,OAAO,IAAA,CAAK,cAAA;AAClB,IAAA,IAAI,IAAA,CAAK,UAAA,CAAW,GAAG,CAAA,EAAG;AAIxB,MAAA,GAAA,CAAI,MAAA,GAAS,IAAA;AACb,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,cAAA,CAAe,IAAA,EAAM,GAAG,CAAC,CAAA;AACrD,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,QAAA,EAAU;AAElC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AACjC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACpC,IAAA,MAAM,YAAY,IAAA,KAAS,IAAA;AAC3B,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,IAAA,CAAK,KAAA,GAAQ,GAAA;AACb,MAAA,GAAA,CAAI,MAAA,GAAS,IAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,MAAA,EAAO;AAAA,IACb;AAEA,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,IAAA,CAAK,iBAAA,CAAkB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAQ,CAAC,CAAA;AAC5C,IAAA,IAAA,CAAK,QAAA,CAAS,UAAU,EAAE,MAAA,EAAQ,EAAE,OAAA,EAAS,GAAA,EAAK,SAAA,EAAU,EAAG,CAAA;AAC/D,IAAA,IAAA,CAAK,SAAA,EAAU;AAAA,EACjB;AAAA,EAOA,cAAA,CAAe,MAAqB,GAAA,EAA0B;AAC5D,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,MACV,CAAC,SAAA,KAAA,CACE,GAAA,CAAI,wBAAwB,SAAS,CAAA,GAAI,KAAK,2BAAA,MAAiC;AAAA,KACpF;AAAA,EACF;AAAA,EAOA,kBAAkB,QAAA,EAAwB;AACxC,IAAA,MAAM,OAAO,IAAA,CAAK,cAAA;AAClB,IAAA,MAAM,OAAA,GAAU,CAAC,GAAG,IAAA,CAAK,MAAM,QAAQ,CAAA,EAAG,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,CAAE,SAAS,CAAA;AAC9E,IAAA,KAAA,MAAW,OAAO,OAAA,EAAS;AACzB,MAAA,MAAM,IAAA,GAAO,aAAa,GAAG,CAAA;AAC7B,MAAA,IAAI,IAAA,EAAM;AACR,QAAA,IAAA,CAAK,KAAA,EAAM;AACX,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,IAAA,CAAK,YAAA,IAAgB,SAAA,CAAU,IAAA,CAAK,SAAS,CAAA,EAAG;AAClD,MAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,MAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,SAAA,CAAU,IAAA,CAAK,IAAA,CAAK,OAAO,CAAA;AAChC,IAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,EACrB;AAAA,EAOA,QAAA,GAAiB;AACf,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACzB,IAAA,MAAM,KAAA,GAAQ,KAAK,cAAA,CAAe,MAAA;AAClC,IAAA,MAAM,KAAA,GAAQ,SAAS,IAAA,CAAK,QAAA;AAC5B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,GAAW,CAAA,IAAK,SAAS,IAAA,CAAK,QAAA;AACjD,IAAA,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,mBAAA,EAAqB,MAAA,CAAO,KAAK,CAAC,CAAA;AAC5D,IAAA,IAAA,CAAK,QAAA,CAAS,sBAAsB,KAAK,CAAA;AACzC,IAAA,IAAA,CAAK,QAAA,CAAS,sBAAsB,KAAK,CAAA;AACzC,IAAA,IAAI,KAAK,YAAA,EAAc;AAGrB,MAAA,IAAI,IAAA,CAAK,QAAA,GAAW,CAAA,EAAG,IAAA,CAAK,YAAA,CAAa,MAAM,IAAA,CAAK,SAAA,EAAW,KAAA,GAAQ,EAAA,GAAK,IAAI,CAAA;AAAA,WAC3E,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAA,CAAK,SAAS,CAAA;AAAA,IAC9C;AACA,IAAA,IAAA,CAAK,UAAA,GAAa,EAAE,KAAA,EAAO,KAAA,EAAO,KAAA,EAAM;AAAA,EAC1C;AAAA,EAQA,aAAA,GAAsB;AACpB,IAAA,MAAM,WAAW,IAAA,CAAK,UAAA;AACtB,IAAA,IAAA,CAAK,QAAA,EAAS;AACd,IAAA,MAAM,UAAU,IAAA,CAAK,UAAA;AACrB,IAAA,IAAI,CAAC,QAAA,IAAY,CAAC,OAAA,EAAS;AAC3B,IAAA,MAAM,KAAA,GACJ,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC3B,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC3B,QAAA,CAAS,KAAA,KAAU,OAAA,CAAQ,KAAA;AAC7B,IAAA,IAAI,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,WAAA,EAAa,EAAE,QAAQ,EAAE,GAAG,OAAA,EAAQ,EAAG,CAAA;AAAA,EAClE;AAAA,EAOA,SAAA,GAAkB;AAChB,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,IAAA,CAAK,sBAAsB,EAAA,EAAI;AAC1D,IAAA,QAAA,CAAS,YAAA,CAAa,KAAK,iBAAA,EAAmB,EAAE,OAAO,IAAA,CAAK,cAAA,CAAe,MAAA,EAAQ,CAAC,CAAA;AAAA,EACtF;AAAA,EAGA,QAAA,CAAS,WAAmB,EAAA,EAAmB;AAC7C,IAAA,IAAI,EAAA,EAAI,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,WAAW,MAAM,CAAA;AAAA,SAC9C,IAAA,CAAK,OAAA,CAAQ,eAAA,CAAgB,SAAS,CAAA;AAAA,EAC7C;AAAA,EAGA,YAAA,GAAqB;AACnB,IAAA,IAAI,KAAK,cAAA,EAAgB;AACzB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AACtB,IAAA,MAAM,OAAA,GAAU;AAAA,MACd,IAAA,CAAK,gBAAgB,IAAA,GAAO,iBAAA;AAAA,MAC5B,IAAA,CAAK,oBAAoB,IAAA,GAAO;AAAA,KAClC,CACG,OAAO,CAAC,IAAA,KAAyB,SAAS,IAAI,CAAA,CAC9C,KAAK,OAAO,CAAA;AACf,IAAA,OAAA,CAAQ,IAAA;AAAA,MACN,CAAA,YAAA,EAAe,IAAA,CAAK,UAAU,CAAA,8CAAA,EAAiD,OAAO,CAAA,CAAA;AAAA,KACxF;AAAA,EACF;AAAA,EAGA,iBAAiB,QAAA,EAAwB;AACvC,IAAA,IAAI,KAAK,eAAA,EAAiB;AAC1B,IAAA,IAAA,CAAK,eAAA,GAAkB,IAAA;AACvB,IAAA,MAAM,MAAA,GAAS,QAAA,KAAa,CAAA,GAAI,qBAAA,GAAwB,uCAAA;AACxD,IAAA,OAAA,CAAQ,KAAK,CAAA,YAAA,EAAe,IAAA,CAAK,UAAU,CAAA,oCAAA,EAAuC,MAAM,CAAA,CAAA,CAAG,CAAA;AAAA,EAC7F;AAAA,EAGA,UAAA,GAAqB;AACnB,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAA,CAAI,IAAA,CAAK,KAAI,EAAG,IAAA,CAAK,aAAa,CAAC,CAAA;AACtD,IAAA,IAAA,CAAK,UAAA,GAAa,KAAA;AAClB,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEA,IAAI,MAAA,GAAkB;AACpB,IAAA,OAAO,KAAK,QAAA,GAAW,CAAA,IAAK,IAAA,CAAK,cAAA,CAAe,UAAU,IAAA,CAAK,QAAA;AAAA,EACjE;AAAA,EAOA,IAAI,cAAA,GAAgC;AAClC,IAAA,OAAQ,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,UAAA,CAAW,QAAQ,CAAA,CAAoB,MAAA;AAAA,MAC7D,CAAC,GAAA,KAAQ,CAAC,IAAA,CAAK,WAAW,GAAG;AAAA,KAC/B;AAAA,EACF;AAAA,EAGA,WAAW,GAAA,EAA2B;AACpC,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA;AACpC,IAAA,OAAO,IAAA,KAAS,IAAA,IAAQ,gBAAA,CAAiB,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EACzD;AAAA,EAGA,eAAe,GAAA,EAA2C;AACxD,IAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,gBAAA,CAAmC,IAAA,CAAK,oBAAoB,CAAA,EAAG;AACpF,MAAA,IAAI,KAAK,QAAA,CAAS,IAAI,CAAA,KAAM,IAAA,CAAK,SAAS,OAAO,IAAA;AAAA,IACnD;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAGA,SAAS,EAAA,EAA6B;AACpC,IAAA,OAAO,EAAA,CAAG,OAAA,CAAQ,IAAA,CAAK,aAAa,CAAA;AAAA,EACtC;AAAA,EAGA,eAAe,EAAA,EAAiC;AAC9C,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,EAAe,OAAO,IAAA;AAChC,IAAA,IAAI,IAAA,GAAuB,EAAA;AAC3B,IAAA,OAAO,IAAA,IAAQ,IAAA,CAAK,aAAA,KAAkB,IAAA,CAAK,UAAA,EAAY;AACrD,MAAA,IAAA,GAAO,IAAA,CAAK,aAAA;AAAA,IACd;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,IAAI,QAAA,GAAmB;AACrB,IAAA,OAAO,KAAK,QAAA,CAAS,IAAA;AAAA,MACnB,IAAA;AAAA,MACA,KAAA;AAAA,MACA,IAAA,CAAK,QAAA;AAAA,MACL,qBAAA,CAAqB,OAAO,GAAA,CAAI,OAAA;AAAA,MAChC,sBAAqB,gBAAA,CAAiB;AAAA,KACxC;AAAA,EACF;AAAA,EAGA,IAAI,QAAA,GAAmB;AACrB,IAAA,OAAO,KAAK,QAAA,CAAS,IAAA;AAAA,MACnB,IAAA;AAAA,MACA,KAAA;AAAA,MACA,IAAA,CAAK,QAAA;AAAA,MACL,qBAAA,CAAqB,OAAO,GAAA,CAAI,OAAA;AAAA,MAChC,sBAAqB,gBAAA,CAAiB;AAAA,KACxC;AAAA,EACF;AACF","file":"nested_form_controller.js","sourcesContent":["/**\n * Sends one message to the page's shared `stimeo--announcer`.\n *\n * A component that has to reach assistive tech does not carry a live region of its\n * own: a region only announces what changes *after* assistive tech already knows\n * about it, which a region that appears (or is un-hidden) with its message cannot\n * satisfy. The one region that can is the announcer sitting in the page from the\n * start, so state changes are handed to it as an event and it does the reading.\n *\n * The event goes to `window` because the announcer is usually a sibling high in the\n * document rather than an ancestor of the component dispatching it.\n *\n * Wording comes from the consumer — the library ships no English strings — so an\n * empty message is silently dropped and nothing is announced.\n *\n * @example\n * ```ts\n * announce(this.announceTextValue, { assertive: false });\n * ```\n */\nexport function announce(message: string, options: { assertive?: boolean } = {}): void {\n  const text = message.trim();\n  if (text.length === 0) return;\n  window.dispatchEvent(\n    new CustomEvent(\"stimeo--announcer:announce\", {\n      detail: { message: text, assertive: options.assertive === true },\n    }),\n  );\n}\n\n/**\n * Fills `{name}` placeholders in an announcement template from `values`.\n *\n * The same substitution the value-text templates use, so a consumer writes\n * `\"{percent}% complete\"` in one attribute and gets the same rules everywhere. A\n * placeholder with no matching entry is left as authored rather than blanked, which\n * keeps a typo visible instead of silently swallowing the word.\n */\nexport function fillTemplate(template: string, values: Record<string, string | number>): string {\n  return template.replace(/\\{([a-zA-Z][a-zA-Z0-9]*)\\}/g, (match, name: string) => {\n    const replacement = values[name];\n    return replacement === undefined ? match : String(replacement);\n  });\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 { sharedRegistry } from \"./shared_registry\";\n\n/** What a lease's record says: the author's value, its last write, the leases beneath. */\ninterface AttributeLeaseRecord {\n  readonly original: string | null;\n  readonly written: string | null;\n  /** Whether it hands back what the lease right beneath it wrote last. */\n  readonly linked: boolean;\n  /** The records of the other owners' leases beneath it, nearest first. */\n  readonly beneath: readonly string[];\n}\n\n/** One lease's hold on one element's attribute, in the stack every lease of it shares. */\ninterface AttributeHold {\n  /** The lease holding it; `null` for a hold read from a copy's record until its lease takes it. */\n  lease: object | null;\n  readonly record: string;\n  written: string | null;\n  /** What it hands back with nothing beneath it: the author's value. */\n  readonly original: string | null;\n  /** Whether it hands back what the hold beneath it wrote last instead. */\n  linked: boolean;\n}\n\n/** The holds on each element by attribute, and every lease's record name by attribute. */\ninterface AttributeLeaseRegistry {\n  readonly stacks: WeakMap<Element, Map<string, AttributeHold[]>>;\n  readonly names: Map<string, Set<string>>;\n}\n\n/** Whether a parsed record entry is an attribute value: a string, or `null` for absence. */\nfunction isAttributeValue(value: unknown): value is string | null {\n  return value === null || typeof value === \"string\";\n}\n\n/**\n * Reads the record a lease left on `element`: the author's value, the value the lease wrote\n * last, whether it hands back the value beneath it (`false` before the names when it does not)\n * and the records beneath it. `undefined` when the record is missing or holds anything else.\n */\nfunction readLeaseRecord(element: Element, record: string): AttributeLeaseRecord | undefined {\n  try {\n    const parsed: unknown = JSON.parse(element.getAttribute(record) ?? \"null\");\n    if (!Array.isArray(parsed)) return undefined;\n    const [original, written, ...rest] = parsed as unknown[];\n    const linked = rest[0] !== false;\n    const beneath = linked ? rest : rest.slice(1);\n    if (!beneath.every((under): under is string => typeof under === \"string\")) return undefined;\n    return isAttributeValue(original) && isAttributeValue(written)\n      ? { original, written, linked, beneath }\n      : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\n/**\n * The value `element`'s author wrote for `attribute`, as the record a lease of any owner leaves\n * on the element carries it; `undefined` while no lease leaves one, as when nothing has moved\n * the attribute off the author's value. A field a reveal turned from `password` into `text`\n * still reads `\"password\"` here.\n */\nexport function leasedAuthorValue(element: Element, attribute: string): string | null | undefined {\n  const suffix = `-${attribute}-lease`;\n  for (const name of element.getAttributeNames()) {\n    if (!name.startsWith(\"data-\") || !name.endsWith(suffix)) continue;\n    const record = readLeaseRecord(element, name);\n    if (record) return record.original;\n  }\n  return undefined;\n}\n\n/**\n * Temporarily controls one attribute across a changing set of elements.\n *\n * The first write remembers the authored value, including the distinction between\n * an absent attribute and an authored empty string. Returning a lease restores that\n * value only while the attribute still matches the controller's last write. If a\n * consumer changed it in the meantime, the consumer owns the new value and teardown\n * leaves it alone.\n *\n * A `null` write deliberately removes the attribute while retaining the lease. This\n * is useful for derived ARIA whose valid absence is itself controller state, such as\n * an unbounded `aria-valuemin` or a blank spinbutton's `aria-valuenow`.\n *\n * **Every lease of an attribute shares one stack of holds per element**, whatever its owner\n * and whichever file of the package constructed it (the stacks are one per page): the holds\n * sit in the order their leases first wrote the element, each with the value it wrote last.\n * The element's value is the highest hold's that carries it, and the page's when none does.\n * A write reaches the element unless a hold above the writer carries the element's value: the\n * top hold always shows its writes, a hold beneath it shows nothing while a hold above keeps\n * its value on the element, and once the page has put a value there that no hold carries, the\n * next write of any hold replaces it. A return gives a value back only from the hold the\n * element's value is: the value the hold beneath it wrote last, or the author's once nothing\n * is beneath it; any other return only leaves the stack, and the page's value stays. Holds\n * that wrote the same value are told apart by the stack, never by the value: the higher one\n * keeps it. A first write over a top hold whose value the page has replaced takes the\n * element's value as the author's. Two instances of one controller on one element — an\n * element outside their scope — stack the same way.\n *\n * A **base lease** (`{ base: true }`) holds the element's own state rather than a value over\n * it — a form field's ARIA on its control is one — so its first write goes to the bottom of\n * the stack, beneath the leases of other owners already there: a temporary value another\n * owner leased stays shown and returns to the base lease's latest value.\n *\n * **The stack travels with the element.** While a hold shows a value other than the author's,\n * lies on another hold or is covered by one, the element carries its owner's record\n * `data-<owner>-<attribute>-lease`: JSON of the author's value and the value the hold wrote\n * last (each a string, or `null` for an absent attribute), `false` where the hold hands back\n * the author's value rather than the latest value of the hold beneath it, and the records of\n * every hold beneath it, nearest first. Returning the last lease of an owner removes its\n * record. A copy of the element — a page Turbo restores from its cache is one — therefore\n * carries the stack, and the first lease to touch the copy reads it back under the record\n * names of the leases constructed so far, which include every lease that wrote a record the\n * cache holds, and orders the holds by the records each one lists beneath it. Each lease takes\n * the hold its owner's record describes over in place. Complete records for distinct owners\n * preserve their order across a copy. The records describe holds by owner, not by instance:\n * one owner holding the element more than once leaves only its topmost hold's record, which\n * the first of its leases to write or return on the copy takes. Lower holds of that owner and\n * their positions are absent; mutually listed owners cannot express their full live order.\n * A hold that showed the author's value alone carries no record and is taken by its first\n * write on the copy. Missing or unreadable records also leave their holds unknown, so copying\n * the DOM does not promise identical decisions for every live stack. Without a record it can\n * read, a new stack takes the current value as the author's. A Turbo morph removes records\n * absent from the server HTML; existing holds remain in memory until their leases return.\n *\n * The lease has no lifecycle of its own, so it never subscribes to document events,\n * and nothing rewinds a live page before Turbo caches it: `turbo:before-cache` also\n * fires on pages that stay.\n */\nexport class AttributeLease<T extends Element = Element> {\n  /** The holds on each element, bottom first, and the record names; one per page. */\n  static readonly #registry = sharedRegistry(\n    \"stimeo-ui.attribute-lease.registry.v1\",\n    (): AttributeLeaseRegistry => ({ stacks: new WeakMap(), names: new Map() }),\n  );\n  readonly #attribute: string;\n  readonly #record: string;\n  readonly #base: boolean;\n  readonly #held = new Set<T>();\n\n  /**\n   * @param attribute - The attribute whose temporary values this lease owns.\n   * @param owner - Names the record on the element; the controller's identifier.\n   * @param options - `base`: written beneath the other owners' leases.\n   */\n  constructor(attribute: string, owner: string, options: { readonly base?: boolean } = {}) {\n    this.#attribute = attribute;\n    this.#record = `data-${owner}-${attribute}-lease`;\n    this.#base = options.base === true;\n    const names = AttributeLease.#registry.names;\n    names.set(attribute, (names.get(attribute) ?? new Set<string>()).add(this.#record));\n  }\n\n  /** Writes or removes the leased attribute while preserving its authored value. */\n  write(element: T, value: string | null): void {\n    const stack = this.#stack(element);\n    const hold = this.#take(stack) ?? this.#acquire(element, stack);\n    this.#held.add(element);\n    const shows = !this.#covered(element, stack, hold);\n    hold.written = value;\n    this.#mark(element, stack);\n    if (shows) this.#reflect(element, value);\n  }\n\n  /**\n   * Returns one lease, also on a restored copy, to the value the hold beneath it wrote last or\n   * the author's, without overwriting a value a consumer wrote since. Says whether there was a\n   * lease to return: a hold this lease has, or the hold a copy's record describes while no live\n   * lease of the owner has taken it — a copy of a page an earlier connection wrote carries one.\n   */\n  return(element: T): boolean {\n    const held = this.#held.delete(element);\n    const known = AttributeLease.#registry.stacks.get(element)?.has(this.#attribute);\n    const stack = held || known || element.hasAttribute(this.#record) ? this.#stack(element) : [];\n    const hold = this.#take(stack);\n    if (!hold) return false;\n    const carries = element.getAttribute(this.#attribute) === hold.written;\n    const owns = carries && !this.#covered(element, stack, hold);\n    const index = stack.indexOf(hold);\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    this.#reflect(element, below ? below.written : hold.original);\n    return true;\n  }\n\n  /** Returns every lease it holds, with the same ownership check as {@link return}. */\n  returnAll(): void {\n    for (const element of Array.from(this.#held)) this.return(element);\n  }\n\n  /** The element's stack, read from its records the first time. */\n  #stack(element: T): AttributeHold[] {\n    const stacks = AttributeLease.#registry.stacks;\n    const byAttribute = stacks.get(element) ?? new Map<string, AttributeHold[]>();\n    stacks.set(element, byAttribute);\n    const stack = byAttribute.get(this.#attribute) ?? this.#seed(element);\n    byAttribute.set(this.#attribute, stack);\n    return stack;\n  }\n\n  /** The holds a copy's records describe, each above every hold its record lists beneath. */\n  #seed(element: T): AttributeHold[] {\n    const found: (AttributeLeaseRecord & { readonly record: string })[] = [];\n    for (const record of AttributeLease.#registry.names.get(this.#attribute) ?? []) {\n      const read = readLeaseRecord(element, record);\n      if (read) found.push({ ...read, record });\n    }\n    const depth = ({ beneath }: (typeof found)[number]) =>\n      beneath.filter((name) => found.some((other) => other.record === name)).length;\n    return found\n      .sort((one, other) => depth(one) - depth(other))\n      .map(({ record, written, original, linked }, index) => ({\n        lease: null,\n        record,\n        written,\n        original,\n        linked: linked && index > 0,\n      }));\n  }\n\n  /** Its hold in `stack`, taking over one read from its record. */\n  #take(stack: AttributeHold[]): AttributeHold | undefined {\n    const hold =\n      stack.find((held) => held.lease === this) ??\n      stack.find((held) => held.lease === null && held.record === this.#record);\n    if (hold) hold.lease = this;\n    return hold;\n  }\n\n  /** A new hold: on top, over the top hold while the element shows it; a base one at the bottom. */\n  #acquire(element: T, stack: AttributeHold[]): AttributeHold {\n    const current = element.getAttribute(this.#attribute);\n    const top = stack.at(-1);\n    const bottom = stack[0];\n    const over = top?.written === current ? top : undefined;\n    const from = this.#base ? bottom : over;\n    const hold: AttributeHold = {\n      lease: this,\n      record: this.#record,\n      written: current,\n      original: from ? from.original : current,\n      linked: !this.#base && over !== undefined,\n    };\n    if (this.#base && bottom) {\n      bottom.linked = true;\n      stack.unshift(hold);\n    } else stack.push(hold);\n    return hold;\n  }\n\n  /** Whether a hold above `hold` carries the element's value, which is then that hold's. */\n  #covered(element: T, stack: readonly AttributeHold[], hold: AttributeHold): boolean {\n    const current = element.getAttribute(this.#attribute);\n    return stack.slice(stack.indexOf(hold) + 1).some((above) => above.written === current);\n  }\n\n  /** Leaves each owner's record of its topmost hold, or none where nothing needs one. */\n  #mark(element: T, stack: readonly AttributeHold[]): void {\n    const records = new Map<string, string | null>([[this.#record, null]]);\n    stack.forEach((hold, index) => {\n      const names = stack.slice(0, index).map((under) => under.record);\n      const beneath = [...new Set(names.reverse())].filter((name) => name !== hold.record);\n      const marker = hold.linked || beneath.length === 0 ? [] : [false];\n      records.set(\n        hold.record,\n        hold.written === hold.original && beneath.length === 0 && index === stack.length - 1\n          ? null\n          : JSON.stringify([hold.original, hold.written, ...marker, ...beneath]),\n      );\n    });\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  /** Reflects only a real value transition, avoiding self-triggered mutation work. */\n  #reflect(element: T, value: string | null): void {\n    if (element.getAttribute(this.#attribute) === value) return;\n    if (value === null) element.removeAttribute(this.#attribute);\n    else element.setAttribute(this.#attribute, value);\n  }\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 * 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","import { MAX_TIMER_DELAY_MS } from \"./timer_bounds\";\n\n/** Semantic constraints on an already decoded number, independent of the DOM. */\nexport interface NumberBounds {\n  /** Finite numbers are required, including when this field is omitted. */\n  readonly finite?: true;\n  /** Inclusive lower endpoint. */\n  readonly min?: number;\n  /** Inclusive upper endpoint. */\n  readonly max?: number;\n  /** Exclusive lower endpoint. */\n  readonly exclusiveMin?: number;\n  /** Require a number without a fractional part. */\n  readonly integer?: boolean;\n  /** Exact decoded numbers accepted by a discrete contract. */\n  readonly allowedValues?: readonly number[];\n  /** JSON-safe exceptions to finite-number checking for unbounded endpoints. */\n  readonly allowInfinity?: \"negative\" | \"positive\" | \"both\";\n}\n\n/** One constraint for each Number Value, including shorthand declarations. */\nexport type NumberValueConstraints<Values> = {\n  readonly [Key in keyof Values as Values[Key] extends\n    | NumberConstructor\n    | { type: NumberConstructor }\n    ? Key\n    : never]: NumberBounds;\n};\n\n/** Reusable semantic domains; fractional inputs remain fractional unless excluded. */\nexport const NUMBER_BOUNDS = {\n  finite: { finite: true },\n  nonNegative: { finite: true, min: 0 },\n  positive: { finite: true, exclusiveMin: 0 },\n  nonNegativeInteger: { finite: true, min: 0, integer: true },\n  positiveInteger: { finite: true, exclusiveMin: 0, integer: true },\n  lowerBound: { finite: true, allowInfinity: \"negative\" },\n  upperBound: { finite: true, allowInfinity: \"positive\" },\n  timer: { finite: true, min: 0, max: MAX_TIMER_DELAY_MS },\n  positiveTimer: { finite: true, exclusiveMin: 0, max: MAX_TIMER_DELAY_MS },\n} as const satisfies Record<string, NumberBounds>;\n\n/**\n * Checks all declared bounds without rounding, clamping, or coercing the input.\n * Infinity exceptions relax only finite checking; every other bound still applies.\n */\nexport function matchesNumberBounds(value: number, bounds: NumberBounds): boolean {\n  if (!Number.isFinite(value)) {\n    const direction = value === Infinity ? \"positive\" : value === -Infinity ? \"negative\" : null;\n    if (direction === null) return false;\n    if (bounds.allowInfinity !== \"both\" && bounds.allowInfinity !== direction) return false;\n  }\n  if (bounds.min !== undefined && value < bounds.min) return false;\n  if (bounds.max !== undefined && value > bounds.max) return false;\n  if (bounds.exclusiveMin !== undefined && value <= bounds.exclusiveMin) return false;\n  if (bounds.integer && !Number.isInteger(value)) return false;\n  if (bounds.allowedValues !== undefined && !bounds.allowedValues.includes(value)) return false;\n  return true;\n}\n\n/** Decodes a Number Value literal; action params use their own JSON decoder. */\nexport function decodeNumberValue(raw: string): number {\n  return Number(raw.replace(/_/g, \"\"));\n}\n","/**\n * Numeric coercion for controllers that accept a number through a Value, an action\n * param, or an event detail.\n *\n * Stimulus decodes action params as JSON when possible and leaves other text\n * untouched. CustomEvent detail can also supply a number or numeric string.\n * The reader accepts those two types while rejecting blank and non-finite input.\n */\n\nimport { matchesNumberBounds, type NumberBounds } from \"./number_bounds\";\n\n/**\n * Reads a finite number or nonblank numeric string; other input returns `null`.\n * Blank strings cannot silently reset a value to zero.\n */\nexport function toFiniteNumber(raw: unknown): number | null {\n  if (typeof raw !== \"number\" && typeof raw !== \"string\") return null;\n  if (typeof raw === \"string\" && raw.trim().length === 0) return null;\n  const value = Number(raw);\n  return Number.isFinite(value) ? value : null;\n}\n\n/**\n * Returns an accepted decoded Number Value or the caller's fallback unchanged.\n * The caller owns the fallback contract; this reader does not parse or write a Value.\n */\nexport function readNumber(raw: number, fallback: number, bounds: NumberBounds): number {\n  return matchesNumberBounds(raw, bounds) ? raw : fallback;\n}\n","import { readNumber } from \"./coerce\";\nimport { matchesNumberBounds, type NumberBounds } from \"./number_bounds\";\n\n/** The instance identity carried by a Number Value read. */\nexport interface NumberValueOwner {\n  readonly identifier: string;\n  readonly element: Element;\n}\n\n/** Reads current declarations at the point of use without rewriting their attributes. */\nexport class NumberValueReader {\n  /** The last rejected literal per Value; no history grows for an unchanged instance. */\n  readonly #lastRejected = new Map<string, string>();\n\n  /** Resolves the declared number using its own fallback and shared class contract. */\n  read(\n    owner: NumberValueOwner,\n    name: string,\n    raw: number,\n    fallback: number,\n    bounds: NumberBounds,\n  ): number {\n    const resolved = readNumber(raw, fallback, bounds);\n    if (matchesNumberBounds(raw, bounds)) {\n      this.#lastRejected.delete(name);\n      return resolved;\n    }\n    const attribute = `data-${owner.identifier}-${name.replace(/[A-Z]/g, (letter) => `-${letter.toLowerCase()}`)}-value`;\n    const literal = owner.element.getAttribute(attribute);\n    if (literal === null) {\n      this.#lastRejected.delete(name);\n      return resolved;\n    }\n    if (this.#lastRejected.get(name) !== literal) {\n      this.#lastRejected.set(name, literal);\n      console.warn(\n        `Stimeo UI: \"${owner.identifier}\" has an invalid number Value \"${name}\" declaration ${JSON.stringify(literal)}; using ${fallback}.`,\n      );\n    }\n    return resolved;\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","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","/**\n * The attribute selector for one declared target, in a controller's own namespace.\n *\n * Stimulus reads `data-<identifier>-target` as a **space-separated token list**, so a\n * single element can carry several target names at once. Matching the attribute value\n * whole would reach only the elements that declare exactly one name, which is why the\n * name is paired with `~=`.\n *\n * `identifier` is the name the controller is registered under, so the selector reaches\n * the markup that registration renders rather than one fixed spelling.\n */\nexport function targetSelector(identifier: string, name: string): string {\n  return `[data-${identifier}-target~=\"${name}\"]`;\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { announce, fillTemplate } from \"../utils/announce\";\nimport { AttributeLease } from \"../utils/attribute_lease\";\nimport { firstTabStop, isTabStop } from \"../utils/focus_candidate\";\nimport { MorphRenderWatcher } from \"../utils/morph_render_watcher\";\nimport { NUMBER_BOUNDS, type NumberValueConstraints } from \"../utils/number_bounds\";\nimport { NumberValueReader } from \"../utils/number_value\";\nimport { TabindexLoan } from \"../utils/tabindex_loan\";\nimport { targetSelector } from \"../utils/target_selector\";\n\n/** Target name of the per-row remove buttons. */\nconst REMOVE_PART = \"remove\";\n/** Target name of the hidden `_destroy` input. */\nconst DESTROY_FLAG_PART = \"destroyFlag\";\n\n/** `_destroy` values Rails treats as truthy; the flag value is the destruction truth source. */\nconst DESTROYED_VALUES = new Set([\"1\", \"true\"]);\n\n/**\n * Headless **nested / dynamic fields** for Rails `fields_for` +\n * `accepts_nested_attributes_for` (no dedicated APG pattern — form editing).\n * Clone a `<template>` row, renumber its index, and remove rows by flagging\n * `_destroy` (persisted) or dropping them from the DOM (unsaved).\n *\n * Markup contract (identifier: `stimeo--nested-form`):\n *   <div data-controller=\"stimeo--nested-form\" data-stimeo--nested-form-min-value=\"1\">\n *     <div data-stimeo--nested-form-target=\"list\">\n *       <!-- existing rows; a persisted row carries a _destroy flag + remove button -->\n *     </div>\n *     <template data-stimeo--nested-form-target=\"template\">\n *       <fieldset>\n *         <input name=\"order[items_attributes][__INDEX__][name]\">\n *         <button type=\"button\" data-stimeo--nested-form-target=\"remove\">Remove</button>\n *       </fieldset>\n *     </template>\n *     <button type=\"button\" data-stimeo--nested-form-target=\"add\"\n *             data-action=\"click->stimeo--nested-form#add\">Add</button>\n *   </div>\n *\n * Values: `min` / `max` bound the effective row count (`max` `0` = unlimited;\n * both are followed at runtime), `indexPlaceholder` is the template token\n * replaced per row (default `__INDEX__`), and `announce` + `countMessage` (a\n * `{count}` template) opt into the announcer bridge.\n *\n * `add` dispatches `{ index, element }`; `remove` dispatches `{ element, persisted }`;\n * `reconcile` dispatches `{ count, atMin, atMax }` when a change the controller did\n * not perform itself — rows appended or removed by Turbo Streams / a morph, or a\n * runtime `min` / `max` change — moves the published state.\n *\n * @remarks\n * Behavior only — server-side `accepts_nested_attributes_for`, per-field\n * validation, and reordering are out of scope. Row state lives **only** in the DOM\n * (inserted nodes + each `_destroy` hidden input); there is no module-scope index\n * counter, so the controller stays idempotent across Turbo swaps. A row counts as\n * destroyed when its own `_destroy` flag holds a truthy value — `hidden` is the\n * visual half the controller writes alongside the flag, so a consumer hiding rows\n * for other reasons does not affect the count. Remove buttons and destroy flags\n * are resolved by **delegation scoped to their nearest nested-form root**, so\n * dynamically-added rows work without per-row `data-action` and one instance\n * nested inside another never acts on the inner instance's buttons or flags.\n * External row changes are observed on the list and reconciled once per mutation\n * batch. Adding a row moves focus to its first tab stop; removing returns focus to\n * the nearest surviving row's first tab stop, falling back to the add button and\n * finally to the root via a temporary `tabindex` (WCAG 2.2 2.4.3) — candidates\n * that cannot take focus (natively `disabled`, inside `fieldset[disabled]`, or not\n * rendered) are skipped. Count changes from the controller's own add / remove are\n * announced through the shared `stimeo--announcer` (WCAG 2.2 4.1.3) when\n * `announce` + `countMessage` are set; reconciliation stays silent to assistive\n * tech. The add button's `disabled` is managed only while `max` is set, and the\n * authored value is restored on teardown. A template must produce exactly one\n * root element; markup lacking the required `list` / `template` targets, or a\n * template producing anything else, is named on the console once per connection\n * and every operation stays a safe no-op with nothing left in the list. Clicking\n * remove on a row whose flag is already truthy only completes its hiding —\n * nothing effective changes, so no event and no announcement. The delegated\n * listener, the observer, and every lease are released on `disconnect()`.\n */\nexport class NestedFormController extends Controller<HTMLElement> {\n  /** Numeric read boundaries share one reader for this controller instance. */\n  readonly #numbers = new NumberValueReader();\n\n  /** Selects any root of this controller; the nearest one owns an element. */\n  get #rootSelector(): string {\n    return `[data-controller~=\"${this.identifier}\"]`;\n  }\n\n  /** Selects per-row remove buttons, in the namespace this controller is registered under. */\n  get #removeSelector(): string {\n    return targetSelector(this.identifier, REMOVE_PART);\n  }\n\n  /** Selects the hidden `_destroy` input a persisted row carries. */\n  get #destroyFlagSelector(): string {\n    return targetSelector(this.identifier, DESTROY_FLAG_PART);\n  }\n\n  static override targets = [\"list\", \"template\", \"add\", \"remove\", \"destroyFlag\"];\n  static override values = {\n    min: { type: Number, default: 0 },\n    max: { type: Number, default: 0 },\n    indexPlaceholder: { type: String, default: \"__INDEX__\" },\n    announce: { type: Boolean, default: true },\n    countMessage: { type: String, default: \"\" },\n  };\n\n  static valueConstraints = {\n    min: NUMBER_BOUNDS.nonNegative,\n    max: NUMBER_BOUNDS.nonNegative,\n  } satisfies NumberValueConstraints<typeof NestedFormController.values>;\n  static actions = [\"add\"] as const;\n  static events = [\"add\", \"remove\", \"reconcile\"] as const;\n\n  declare readonly listTarget: HTMLElement;\n  declare readonly templateTarget: HTMLTemplateElement;\n  declare readonly addTarget: HTMLButtonElement;\n  declare readonly hasListTarget: boolean;\n  declare readonly hasTemplateTarget: boolean;\n  declare readonly hasAddTarget: boolean;\n\n  declare minValue: number;\n  declare maxValue: number;\n  declare indexPlaceholderValue: string;\n  declare announceValue: boolean;\n  declare countMessageValue: string;\n\n  /** Monotonic source for unique row indices; never a row-state counter. */\n  #lastIndex = 0;\n\n  #warnedMissing = false;\n  #warnedTemplate = false;\n\n  /** The state last written to the hooks; reconciliation reports only real moves. */\n  #published: { count: number; atMin: boolean; atMax: boolean } | null = null;\n\n  /** Watches the list for row changes the controller did not perform itself. */\n  #observer: MutationObserver | null = null;\n\n  readonly #reconcile = new MorphRenderWatcher(() => this.#reconcileNow());\n  /** Restores the authored add-button `disabled` when a lease ends. */\n  readonly #addDisabled = new AttributeLease<HTMLButtonElement>(\"disabled\", this.identifier);\n  /** Makes the root a programmatic focus destination when no other candidate survives. */\n  readonly #tabindex = new TabindexLoan(\"-1\", this.identifier);\n\n  /**\n   * Delegated click handler for the per-row remove buttons (dynamic-safe). Only\n   * buttons whose nearest nested-form root is this instance are acted on, so a\n   * nested inner form's buttons never remove an outer row.\n   */\n  readonly #onClick = (event: Event): void => {\n    const target = event.target as HTMLElement | null;\n    const button = target?.closest<HTMLElement>(this.#removeSelector);\n    if (!button || this.#ownerOf(button) !== this.element) return;\n    const row = this.#rowContaining(button);\n    if (row) this.#removeRow(row);\n  };\n\n  override connect(): void {\n    this.#tabindex.reclaim(this.element);\n    this.#warnedMissing = false;\n    this.#warnedTemplate = false;\n    this.element.addEventListener(\"click\", this.#onClick);\n    this.#reconcile.observe(this.element);\n    if (!this.hasListTarget || !this.hasTemplateTarget) this.#warnMissing();\n    this.#refresh();\n  }\n\n  override disconnect(): void {\n    this.element.removeEventListener(\"click\", this.#onClick);\n    this.#observer?.disconnect();\n    this.#observer = null;\n    this.#reconcile.disconnect();\n    this.#addDisabled.returnAll();\n    this.#tabindex.returnAll();\n    this.#published = null;\n  }\n\n  /** Follows an arriving or swapped-in list: rebind to the primary, then reconcile. */\n  listTargetConnected(): void {\n    this.#rebindObserver();\n    this.#reconcile.schedule();\n  }\n\n  /** Follows a departing list the same way — the primary may have changed. */\n  listTargetDisconnected(): void {\n    this.#rebindObserver();\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Points the observer at the current primary list. Re-deriving on every list\n   * arrival and departure makes the binding independent of the order Stimulus\n   * reports an overlapping swap in — a staggered swap (successor appended before\n   * the old list leaves) ends observed and reconciled either way.\n   */\n  #rebindObserver(): void {\n    this.#observer?.disconnect();\n    this.#observer = null;\n    if (!this.hasListTarget) return;\n    this.#observer = new MutationObserver(() => this.#reconcile.schedule());\n    this.#observer.observe(this.listTarget, {\n      childList: true,\n      subtree: true,\n      attributes: true,\n      attributeFilter: [\"value\"],\n    });\n  }\n\n  /** Returns the lease with a departing add button; a new one re-arms on refresh. */\n  addTargetDisconnected(target: HTMLButtonElement): void {\n    this.#addDisabled.return(target);\n    this.#reconcile.schedule();\n  }\n\n  addTargetConnected(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-clamps when application code or a Turbo morph changes `min`. */\n  minValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /** Re-clamps when application code or a Turbo morph changes `max`. */\n  maxValueChanged(): void {\n    this.#reconcile.schedule();\n  }\n\n  /**\n   * Clones the template row, replaces the index placeholder with a unique value,\n   * appends it, focuses its first tab stop, and announces the new count. No-ops at\n   * `max`, when the required targets are missing (named on the console once per\n   * connection), or when the template does not produce exactly one root element\n   * (also named once; the insertion is rolled back so nothing accumulates).\n   */\n  add(): void {\n    if (!this.hasListTarget || !this.hasTemplateTarget) {\n      this.#warnMissing();\n      return;\n    }\n    if (this.#atMax) return;\n\n    const index = this.#nextIndex();\n    const markup = this.templateTarget.innerHTML.replaceAll(\n      this.indexPlaceholderValue,\n      String(index),\n    );\n    const list = this.listTarget;\n    const beforeNodes = list.childNodes.length;\n    const beforeElements = list.childElementCount;\n    list.insertAdjacentHTML(\"beforeend\", markup);\n    const added = (Array.from(list.children) as HTMLElement[]).slice(beforeElements);\n    if (added.length !== 1) {\n      // A row is exactly one element. Anything else — escaped text, nothing, or\n      // several roots (which the max gate above cannot account for) — rolls back\n      // so repeated clicks cannot accumulate garbage or overshoot the max.\n      while (list.childNodes.length > beforeNodes) list.lastChild?.remove();\n      this.#warnBadTemplate(added.length);\n      return;\n    }\n    const row = added[0] as HTMLElement;\n    // A template is authored across lines, so parsing its markup also yields the\n    // whitespace around the row. Dropping it leaves the row as the whole unit the\n    // removal takes back, and adds nothing to the list but the row.\n    for (const node of Array.from(list.childNodes).slice(beforeNodes)) {\n      if (node !== row) node.remove();\n    }\n\n    this.#refresh();\n    firstTabStop(row)?.focus();\n    this.dispatch(\"add\", { detail: { index, element: row } });\n    this.#announce();\n  }\n\n  /**\n   * Removes a row: a persisted row (one carrying its own `destroyFlag`) has the\n   * flag set to `1` and is hidden so Rails destroys it on submit; an unsaved row\n   * is dropped from the DOM. Returns focus to a surviving row. No-ops at `min`.\n   */\n  #removeRow(row: HTMLElement): void {\n    const rows = this.#effectiveRows;\n    if (this.#destroyed(row)) {\n      // An already-destroyed row left visible (a server re-render keeps the\n      // flag but not the hiding): complete the visual half. The effective\n      // state does not move, so no event, no announcement, and no min gate.\n      row.hidden = true;\n      this.#focusAfterRemove(this.#positionAmong(rows, row));\n      return;\n    }\n    if (rows.length <= this.#safeMin) return;\n\n    const position = rows.indexOf(row);\n    const flag = this.#destroyFlagOf(row);\n    const persisted = flag !== null;\n    if (flag) {\n      flag.value = \"1\";\n      row.hidden = true;\n    } else {\n      row.remove();\n    }\n\n    this.#refresh();\n    this.#focusAfterRemove(Math.max(0, position));\n    this.dispatch(\"remove\", { detail: { element: row, persisted } });\n    this.#announce();\n  }\n\n  /**\n   * The index of the first effective row following `row` in document order.\n   * -1 (no following row) feeds the focus slices as a negative index, which\n   * yields the same fully-reversed nearest-first order as `rows.length` would.\n   */\n  #positionAmong(rows: HTMLElement[], row: HTMLElement): number {\n    return rows.findIndex(\n      (candidate) =>\n        (row.compareDocumentPosition(candidate) & Node.DOCUMENT_POSITION_FOLLOWING) !== 0,\n    );\n  }\n\n  /**\n   * Moves focus to the first tab stop of the nearest surviving row — following\n   * rows first, then preceding ones — falling back to the add button and finally\n   * to the root via a temporary `tabindex`.\n   */\n  #focusAfterRemove(position: number): void {\n    const rows = this.#effectiveRows;\n    const ordered = [...rows.slice(position), ...rows.slice(0, position).reverse()];\n    for (const row of ordered) {\n      const stop = firstTabStop(row);\n      if (stop) {\n        stop.focus();\n        return;\n      }\n    }\n    if (this.hasAddTarget && isTabStop(this.addTarget)) {\n      this.addTarget.focus();\n      return;\n    }\n    this.#tabindex.lend(this.element);\n    this.element.focus();\n  }\n\n  /**\n   * Recomputes the count and min/max hooks from the DOM and records them as published.\n   *\n   * @stimeoRenderRoot\n   */\n  #refresh(): void {\n    if (!this.hasListTarget) return;\n    const count = this.#effectiveRows.length;\n    const atMin = count <= this.#safeMin;\n    const atMax = this.#safeMax > 0 && count >= this.#safeMax;\n    this.element.setAttribute(\"data-nested-count\", String(count));\n    this.#reflect(\"data-nested-at-max\", atMax);\n    this.#reflect(\"data-nested-at-min\", atMin);\n    if (this.hasAddTarget) {\n      // The button's disabled is controller state only while a max exists;\n      // without one there is nothing to derive and the authored value stands.\n      if (this.#safeMax > 0) this.#addDisabled.write(this.addTarget, atMax ? \"\" : null);\n      else this.#addDisabled.return(this.addTarget);\n    }\n    this.#published = { count, atMin, atMax };\n  }\n\n  /**\n   * Applies row changes the controller did not perform itself (Turbo Streams,\n   * morphs, runtime Value changes): refreshes the hooks and reports a moved\n   * public state as `reconcile`. The controller's own operations refresh\n   * synchronously first, so their observer echo arrives here as a no-move.\n   */\n  #reconcileNow(): void {\n    const previous = this.#published;\n    this.#refresh();\n    const current = this.#published;\n    if (!previous || !current) return;\n    const moved =\n      previous.count !== current.count ||\n      previous.atMin !== current.atMin ||\n      previous.atMax !== current.atMax;\n    if (moved) this.dispatch(\"reconcile\", { detail: { ...current } });\n  }\n\n  /**\n   * Bridges the count change to the shared announcer when configured.\n   *\n   * @stimeoRuntimeOnly `announce` and `countMessage` word the one announcement of this change.\n   */\n  #announce(): void {\n    if (!this.announceValue || this.countMessageValue === \"\") return;\n    announce(fillTemplate(this.countMessageValue, { count: this.#effectiveRows.length }));\n  }\n\n  /** Sets `attribute` to `\"true\"` when `on`, else removes it. */\n  #reflect(attribute: string, on: boolean): void {\n    if (on) this.element.setAttribute(attribute, \"true\");\n    else this.element.removeAttribute(attribute);\n  }\n\n  /** Names the missing required target(s) once per connection. */\n  #warnMissing(): void {\n    if (this.#warnedMissing) return;\n    this.#warnedMissing = true;\n    const missing = [\n      this.hasListTarget ? null : 'a \"list\" target',\n      this.hasTemplateTarget ? null : 'a \"template\" target',\n    ]\n      .filter((part): part is string => part !== null)\n      .join(\" and \");\n    console.warn(\n      `Stimeo UI: \"${this.identifier}\" cannot manage rows because its markup lacks ${missing}.`,\n    );\n  }\n\n  /** Names a template that does not produce exactly one element, once per connection. */\n  #warnBadTemplate(produced: number): void {\n    if (this.#warnedTemplate) return;\n    this.#warnedTemplate = true;\n    const reason = produced === 0 ? \"produces no element\" : \"must produce exactly one root element\";\n    console.warn(`Stimeo UI: \"${this.identifier}\" added no row because its template ${reason}.`);\n  }\n\n  /** A strictly-increasing unique index (collision-free even on rapid adds). */\n  #nextIndex(): number {\n    const index = Math.max(Date.now(), this.#lastIndex + 1);\n    this.#lastIndex = index;\n    return index;\n  }\n\n  get #atMax(): boolean {\n    return this.#safeMax > 0 && this.#effectiveRows.length >= this.#safeMax;\n  }\n\n  /**\n   * Direct child rows of the list whose own destroy flag is not set. Callers\n   * reach this only behind a list-presence gate (`add`, `#refresh`, and the\n   * click path through `#rowContaining`).\n   */\n  get #effectiveRows(): HTMLElement[] {\n    return (Array.from(this.listTarget.children) as HTMLElement[]).filter(\n      (row) => !this.#destroyed(row),\n    );\n  }\n\n  /** Whether `row` is flagged for destruction; the flag value is the truth source. */\n  #destroyed(row: HTMLElement): boolean {\n    const flag = this.#destroyFlagOf(row);\n    return flag !== null && DESTROYED_VALUES.has(flag.value);\n  }\n\n  /** The row's own destroy flag, skipping flags owned by a nested inner form. */\n  #destroyFlagOf(row: HTMLElement): HTMLInputElement | null {\n    for (const flag of row.querySelectorAll<HTMLInputElement>(this.#destroyFlagSelector)) {\n      if (this.#ownerOf(flag) === this.element) return flag;\n    }\n    return null;\n  }\n\n  /** The nearest nested-form root that owns `el`. */\n  #ownerOf(el: Element): Element | null {\n    return el.closest(this.#rootSelector);\n  }\n\n  /** The nearest ancestor of `el` that is a direct child of the list, else null. */\n  #rowContaining(el: Element): HTMLElement | null {\n    if (!this.hasListTarget) return null;\n    let node: Element | null = el;\n    while (node && node.parentElement !== this.listTarget) {\n      node = node.parentElement;\n    }\n    return node as HTMLElement | null;\n  }\n  /** Current `min` declaration resolved against its numeric contract. */\n  get #safeMin(): number {\n    return this.#numbers.read(\n      this,\n      \"min\",\n      this.minValue,\n      NestedFormController.values.min.default,\n      NestedFormController.valueConstraints.min,\n    );\n  }\n\n  /** Current `max` declaration resolved against its numeric contract. */\n  get #safeMax(): number {\n    return this.#numbers.read(\n      this,\n      \"max\",\n      this.maxValue,\n      NestedFormController.values.max.default,\n      NestedFormController.valueConstraints.max,\n    );\n  }\n}\n"]}

package/dist/controllers/network_status_controller.d.ts

@@ -50,9 +50,18 @@ declare class NetworkStatusController extends Controller<HTMLElement> {
             default: number;
         };
     };
+    static valueConstraints: {
+        onlineAutoHide: {
+            readonly finite: true;
+            readonly min: 0;
+            readonly max: 2147483647;
+        };
+    };
     static events: readonly ["change"];
     readonly offlineTarget: HTMLElement;
+    readonly offlineTargets: HTMLElement[];
     readonly onlineTarget: HTMLElement;
+    readonly onlineTargets: HTMLElement[];
     readonly hasOfflineTarget: boolean;
     readonly hasOnlineTarget: boolean;
     onlineAutoHideValue: number;
@@ -60,6 +69,20 @@ declare class NetworkStatusController extends Controller<HTMLElement> {
     announceOnlineTextValue: string;
     connect(): void;
     disconnect(): void;
+    /** Shows or hides an offline banner that arrives at runtime as connectivity calls for. */
+    offlineTargetConnected(): void;
+    /**
+     * Gives an offline banner that no longer resolves its own `hidden` back, even after
+     * `disconnect()`, and while connected repaints the banner that stays.
+     */
+    offlineTargetDisconnected(banner: HTMLElement): void;
+    /** Shows or hides a recovery banner that arrives at runtime as the recovery calls for. */
+    onlineTargetConnected(): void;
+    /**
+     * Gives a recovery banner that no longer resolves its own `hidden` back, even after
+     * `disconnect()`, and while connected repaints the banner that stays.
+     */
+    onlineTargetDisconnected(banner: HTMLElement): void;
 }
 
 export { NetworkStatusController };