stimeo-ui 0.16.0 → 0.18.0

package/dist/controllers/separator_controller.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils/arrow_step.ts","../../src/utils/attribute_lease.ts","../../src/utils/before_cache_reset.ts","../../src/utils/microtask_coalescer.ts","../../src/utils/stepped_value.ts","../../src/controllers/separator_controller.ts"],"names":["position"],"mappings":";;;;;AA+FO,SAAS,oBAAA,CACd,KAAA,EACA,KAAA,GAAkC,EAAC,EAC1B;AACT,EAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,OAAO,GAAG,OAAO,KAAA;AAC3C,EAAA,OACG,KAAA,CAAM,MAAA,IAAU,CAAC,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA,IACrC,KAAA,CAAM,OAAA,IAAW,CAAC,KAAA,CAAM,QAAA,CAAS,MAAM,KACvC,KAAA,CAAM,OAAA,IAAW,CAAC,KAAA,CAAM,QAAA,CAAS,MAAM,CAAA,IACvC,KAAA,CAAM,QAAA,IAAY,CAAC,KAAA,CAAM,QAAA,CAAS,OAAO,CAAA;AAE9C;;;AClFO,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;;;ACrBO,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;;;AC3EO,SAAS,cAAc,IAAA,EAAsB;AAClD,EAAA,OAAO,OAAO,QAAA,CAAS,IAAI,CAAA,IAAK,IAAA,GAAO,IAAI,IAAA,GAAO,CAAA;AACpD;AAUO,SAAS,gBAAA,CAAiB,KAAa,KAAA,EAA6B;AACzE,EAAA,IAAI,EAAE,KAAA,CAAM,GAAA,IAAO,KAAA,CAAM,GAAA,CAAA,SAAa,cAAA,CAAe,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA;AAEzE,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,eAAe,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,GAAI,GAAA;AACzE,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,CAAC,CAAA;AAC9D,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,SAAS,KAAK,CAAA;AAC3B,EAAA,MAAM,aAAuB,EAAC;AAE9B,EAAA,IAAI,MAAA,CAAO,SAAS,KAAA,CAAM,GAAG,GAAG,UAAA,CAAW,IAAA,CAAK,MAAM,GAAG,CAAA;AACzD,EAAA,IAAI,MAAA,CAAO,SAAS,KAAA,CAAM,GAAG,GAAG,UAAA,CAAW,IAAA,CAAK,MAAM,GAAG,CAAA;AAEzD,EAAA,MAAM,YAAA,GAAA,CAAgB,UAAU,IAAA,IAAQ,IAAA;AACxC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,YAAY,CAAA,EAAG;AACjC,IAAA,gBAAA,CAAiB,YAAY,IAAA,CAAK,KAAA,CAAM,YAAY,CAAA,EAAG,KAAA,EAAO,MAAM,IAAI,CAAA;AACxE,IAAA,gBAAA,CAAiB,YAAY,IAAA,CAAK,IAAA,CAAK,YAAY,CAAA,EAAG,KAAA,EAAO,MAAM,IAAI,CAAA;AAAA,EACzE;AAEA,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,OAAA;AACpC,EAAA,IAAI,OAAA,GAAU,WAAW,CAAC,CAAA;AAC1B,EAAA,IAAI,eAAA,GAAkB,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,OAAO,CAAA;AAChD,EAAA,KAAA,MAAW,SAAA,IAAa,UAAA,CAAW,KAAA,CAAM,CAAC,CAAA,EAAG;AAC3C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,SAAS,CAAA;AAC7C,IAAA,IACE,WAAW,eAAA,IACV,WAAA,CAAY,UAAU,eAAe,CAAA,IAAK,YAAY,OAAA,EACvD;AACA,MAAA,OAAA,GAAU,SAAA;AACV,MAAA,eAAA,GAAkB,QAAA;AAAA,IACpB;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AASO,SAAS,gBAAA,CAAiB,OAAA,EAAiB,KAAA,EAAe,KAAA,EAA6B;AAC5F,EAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,OAAA,EAAS,KAAK,CAAA;AAC7C,EAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAC3C,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,IAAK,QAAA,KAAa,GAAG,OAAO,KAAA;AACzD,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AACjC,EAAA,MAAM,QAAA,GAAW,oBAAA,CAAqB,KAAA,EAAO,SAAA,EAAW,KAAK,CAAA;AAK7D,EAAA,MAAM,MAAM,QAAA,GAAW,SAAA,IAAa,WAAW,CAAA,CAAA,GAAK,aAAA,CAAc,MAAM,IAAI,CAAA;AAC5E,EAAA,OAAO,gBAAA,CAAiB,KAAK,KAAK,CAAA;AACpC;AAGA,SAAS,oBAAA,CAAqB,OAAA,EAAiB,SAAA,EAAmB,KAAA,EAA6B;AAC7F,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,SAAS,KAAK,CAAA;AAC3B,EAAA,MAAM,aAAuB,EAAC;AAE9B,EAAA,IAAI,YAAY,CAAA,EAAG;AACjB,IAAA,MAAMA,SAAAA,GAAAA,CAAY,UAAU,IAAA,IAAQ,IAAA;AACpC,IAAA,IAAI,MAAA,CAAO,QAAA,CAASA,SAAQ,CAAA,EAAG;AAC7B,MAAA,IAAI,SAAA,GAAY,IAAA,CAAK,KAAA,CAAMA,SAAQ,CAAA,GAAI,CAAA;AACvC,MAAA,IAAI,YAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAClE,MAAA,IAAI,SAAA,GAAY,OAAA,IAAW,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,EAAG;AAC1D,QAAA,SAAA,IAAa,CAAA;AACb,QAAA,SAAA,GAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAAA,MAChE;AACA,MAAA,IACE,SAAA,GAAY,OAAA,IACZ,CAAC,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,IAC/B,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EACtC;AACA,QAAA,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AAAA,MACzC;AAAA,IACF;AACA,IAAA,OAAO,MAAM,IAAA,CAAK,GAAA,CAAI,GAAG,UAAU,GAAG,KAAK,CAAA;AAAA,EAC7C;AAEA,EAAA,MAAM,QAAA,GAAA,CAAY,UAAU,IAAA,IAAQ,IAAA;AACpC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC7B,IAAA,IAAI,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAA,GAAI,CAAA;AACtC,IAAA,IAAI,YAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAClE,IAAA,IAAI,SAAA,GAAY,OAAA,IAAW,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,EAAG;AAC1D,MAAA,SAAA,IAAa,CAAA;AACb,MAAA,SAAA,GAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAAA,IAChE;AACA,IAAA,IACE,SAAA,GAAY,OAAA,IACZ,CAAC,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,IAC/B,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EACtC;AACA,MAAA,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AAAA,IACzC;AAAA,EACF;AACA,EAAA,OAAO,MAAM,IAAA,CAAK,GAAA,CAAI,GAAG,UAAU,GAAG,KAAK,CAAA;AAC7C;AAGA,SAAS,gBAAA,CACP,UAAA,EACA,KAAA,EACA,KAAA,EACA,MACA,IAAA,EACM;AACN,EAAA,MAAM,YAAY,cAAA,CAAe,IAAA,GAAO,KAAA,GAAQ,IAAA,EAAM,MAAM,IAAI,CAAA;AAChE,EAAA,IAAI,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AACtF;AAGA,SAAS,SAAS,KAAA,EAA6B;AAC7C,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,IAAa,MAAA,CAAO,SAAS,KAAA,CAAM,IAAI,CAAA,EAAG,OAAO,KAAA,CAAM,IAAA;AAC1E,EAAA,OAAO,OAAO,QAAA,CAAS,KAAA,CAAM,GAAG,CAAA,GAAI,MAAM,GAAA,GAAM,CAAA;AAClD;AAGA,SAAS,cAAA,CAAe,KAAA,EAAe,IAAA,EAAc,IAAA,EAAsB;AACzE,EAAA,MAAM,SAAA,GAAY,KAAK,GAAA,CAAI,aAAA,CAAc,IAAI,CAAA,EAAG,aAAA,CAAc,IAAI,CAAC,CAAA;AAInE,EAAA,OAAO,aAAa,GAAA,GAAM,MAAA,CAAO,MAAM,OAAA,CAAQ,SAAS,CAAC,CAAA,GAAI,KAAA;AAC/D;AAGA,SAAS,cAAc,KAAA,EAAuB;AAC5C,EAAA,MAAM,CAAC,WAAA,GAAc,EAAA,EAAI,YAAY,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,CAAE,QAAA,EAAS,CAAE,WAAA,EAAY,CAAE,MAAM,GAAG,CAAA;AAC3F,EAAA,MAAM,iBAAiB,WAAA,CAAY,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,GAAG,MAAA,IAAU,CAAA;AAC5D,EAAA,MAAM,QAAA,GAAW,YAAA,KAAiB,MAAA,GAAY,CAAA,GAAI,OAAO,YAAY,CAAA;AACrE,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,cAAA,GAAiB,QAAQ,CAAA;AAC9C;AAGA,SAAS,MAAA,CAAO,KAAA,EAAe,GAAA,EAAa,GAAA,EAAsB;AAChE,EAAA,OAAA,CAAQ,KAAA,GAAQ,GAAA,IAAO,WAAA,CAAY,KAAA,EAAO,GAAG,OAAO,KAAA,GAAQ,GAAA,IAAO,WAAA,CAAY,KAAA,EAAO,GAAG,CAAA,CAAA;AAC3F;AAGA,SAAS,KAAA,CAAM,OAAe,KAAA,EAA6B;AACzD,EAAA,OAAO,IAAA,CAAK,IAAI,KAAA,CAAM,GAAA,EAAK,KAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,CAAC,CAAA;AACvD;AAGA,SAAS,WAAA,CAAY,MAAc,KAAA,EAAwB;AACzD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,OACE,MAAA,CAAO,QAAA,CAAS,IAAI,CAAA,IACpB,OAAO,QAAA,CAAS,KAAK,CAAA,IACrB,IAAA,CAAK,GAAA,CAAI,IAAA,GAAO,KAAK,CAAA,IAAK,OAAO,OAAA,GAAU,KAAA;AAE/C;AAGA,SAAS,cAAA,CAAe,KAAa,GAAA,EAAqB;AACxD,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA;AACjC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA;AACjC,EAAA,OAAO,CAAA;AACT;;;AClLA,IAAM,WAAA,GAAc,CAAA;AACpB,IAAM,WAAA,GAAc,GAAA;AA8Eb,IAAM,mBAAA,GAAN,cAAkC,UAAA,CAAwB;AAAA,EAC/D,OAAgB,MAAA,GAAS;AAAA,IACvB,WAAA,EAAa,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,YAAA,EAAa;AAAA,IACnD,SAAA,EAAW,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,KAAA,EAAM;AAAA,IAC3C,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IAC1C,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IAC1C,IAAA,EAAM,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IACjC,KAAA,EAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA;AAAY,GAC9C;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,WAAW,CAAA;AAAA,EAC7B,OAAO,MAAA,GAAS,CAAC,QAAA,EAAU,WAAW,CAAA;AAAA,EAS7B,KAAA,GAAQ,IAAI,cAAA,CAA4B,MAAM,CAAA;AAAA,EAC9C,SAAA,GAAY,IAAI,cAAA,CAA4B,UAAU,CAAA;AAAA,EACtD,YAAA,GAAe,IAAI,cAAA,CAA4B,kBAAkB,CAAA;AAAA,EACjE,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAe,CAAA;AAAA,EAC1D,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAe,CAAA;AAAA,EAC1D,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAe,CAAA;AAAA;AAAA,EAG1D,WAAW,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,SAAS,CAAA;AAAA;AAAA,EAGtD,eAAe,IAAI,gBAAA,CAAiB,MAAM,IAAA,CAAK,iBAAiB,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWzE,QAAA,GAA0B,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOjB,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,cAAA,EAAe;AACpB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AACvB,IAAA,IAAA,CAAK,aAAa,QAAA,EAAS;AAC3B,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAChB,IAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,EACf;AAAA;AAAA,EAGS,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,SAAS,MAAA,EAAO;AACrB,IAAA,IAAA,CAAK,aAAa,UAAA,EAAW;AAC7B,IAAA,IAAA,CAAK,iBAAA,EAAkB;AAAA,EACzB;AAAA;AAAA,EAGA,uBAAA,GAAgC;AAC9B,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,gBAAA,GAAyB;AACvB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA;AAAA,EAGA,UAAU,KAAA,EAA4B;AACpC,IAAA,IAAI,oBAAA,CAAqB,KAAK,CAAA,IAAK,CAAC,KAAK,cAAA,EAAgB;AAEzD,IAAA,MAAM,UAAA,GAAa,KAAK,qBAAA,KAA0B,YAAA;AAClD,IAAA,MAAM,QAAQ,IAAA,CAAK,eAAA;AAEnB,IAAA,MAAM,WAAW,IAAA,CAAK,UAAA;AACtB,IAAA,IAAI,IAAA,GAAsB,IAAA;AAC1B,IAAA,QAAQ,MAAM,GAAA;AAAK,MACjB,KAAK,SAAA;AACH,QAAA,IAAI,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,GAAG,KAAK,CAAA;AAC1D,QAAA;AAAA,MACF,KAAK,WAAA;AACH,QAAA,IAAI,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,IAAI,KAAK,CAAA;AAC3D,QAAA;AAAA,MACF,KAAK,YAAA;AACH,QAAA,IAAI,CAAC,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,GAAG,KAAK,CAAA;AAC3D,QAAA;AAAA,MACF,KAAK,WAAA;AACH,QAAA,IAAI,CAAC,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,IAAI,KAAK,CAAA;AAC5D,QAAA;AAAA,MACF,KAAK,MAAA;AACH,QAAA,IAAA,GAAO,KAAA,CAAM,GAAA;AACb,QAAA;AAAA,MACF,KAAK,KAAA;AACH,QAAA,IAAA,GAAO,KAAA,CAAM,GAAA;AACb,QAAA;AAAA,MACF;AACE,QAAA;AAAA;AAEJ,IAAA,IAAI,SAAS,IAAA,EAAM;AAEnB,IAAA,KAAA,CAAM,cAAA,EAAe;AACrB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,QAAQ,GAAA,EAAmB;AACzB,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,GAAA,EAAK,IAAA,CAAK,eAAe,CAAA;AACxD,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,IAAA,IAAA,CAAK,QAAA,GAAW,KAAA;AAChB,IAAA,IAAI,CAAC,OAAO,EAAA,CAAG,IAAA,CAAK,YAAY,KAAK,CAAA,OAAQ,UAAA,GAAa,KAAA;AAC1D,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAI,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAM,EAAG,CAAA;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,OAAA,GAAgB;AACd,IAAA,MAAM,QAAQ,IAAA,CAAK,eAAA;AACnB,IAAA,MAAM,YAAY,IAAA,CAAK,cAAA;AACvB,IAAA,MAAM,YAAY,SAAA,GAAY,gBAAA,CAAiB,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA,GAAI,IAAA;AACzE,IAAA,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,WAAW,CAAA;AAC1C,IAAA,IAAA,CAAK,YAAA,CAAa,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,KAAK,qBAAqB,CAAA;AAChE,IAAA,IAAA,CAAK,UAAU,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,SAAA,GAAY,MAAM,IAAI,CAAA;AACzD,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,YAAY,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAI,CAAA;AACtE,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,YAAY,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAI,CAAA;AACtE,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,cAAc,IAAA,GAAO,IAAA,GAAO,MAAA,CAAO,SAAS,CAAC,CAAA;AAE/E,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,IAAA,IAAI,SAAA,KAAc,IAAA,EAAM,IAAA,CAAK,QAAA,GAAW,SAAA;AACxC,IAAA,IAAI,QAAA,KAAa,IAAA,IAAQ,SAAA,KAAc,IAAA,IAAQ,cAAc,QAAA,EAAU;AACrE,MAAA,IAAA,CAAK,QAAA,CAAS,aAAa,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAO,SAAA,IAAa,CAAA;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA,EAGA,IAAI,qBAAA,GAAmD;AACrD,IAAA,OAAO,IAAA,CAAK,gBAAA,KAAqB,UAAA,GAAa,UAAA,GAAa,YAAA;AAAA,EAC7D;AAAA;AAAA,EAGA,IAAI,eAAA,GAAgC;AAClC,IAAA,MAAM,MAAM,MAAA,CAAO,QAAA,CAAS,KAAK,QAAQ,CAAA,GAAI,KAAK,QAAA,GAAW,WAAA;AAC7D,IAAA,MAAM,eAAe,MAAA,CAAO,QAAA,CAAS,KAAK,QAAQ,CAAA,GAAI,KAAK,QAAA,GAAW,WAAA;AACtE,IAAA,OAAO;AAAA,MACL,GAAA;AAAA,MACA,GAAA,EAAK,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,YAAY,CAAA;AAAA,MAC/B,MAAM,IAAA,CAAK,SAAA;AAAA,MACX,IAAA,EAAM;AAAA,KACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAA,GAAuB;AACrB,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,aAAa,CAAA,EAAG;AAClC,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,kBAAkB,CAAA;AAChE,MAAA,IAAI,WAAA,KAAgB,YAAA,IAAgB,WAAA,KAAgB,UAAA,EAAY;AAC9D,QAAA,IAAA,CAAK,gBAAA,GAAmB,WAAA;AAAA,MAC1B;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACjD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,KAAK,KAAK,GAAA,KAAQ,IAAA,OAAW,QAAA,GAAW,GAAA;AAC5D,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACjD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,KAAK,KAAK,GAAA,KAAQ,IAAA,OAAW,QAAA,GAAW,GAAA;AAC5D,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACnD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,OAAO,KAAK,KAAA,KAAU,IAAA,OAAW,UAAA,GAAa,KAAA;AAAA,EACpE;AAAA;AAAA,EAGA,UAAU,IAAA,EAAwD;AAChE,IAAA,OAAO,IAAA,CAAK,QAAQ,YAAA,CAAa,CAAA,KAAA,EAAQ,KAAK,UAAU,CAAA,CAAA,EAAI,IAAI,CAAA,MAAA,CAAQ,CAAA;AAAA,EAC1E;AAAA;AAAA,EAGA,iBAAiB,IAAA,EAA6B;AAC5C,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA;AAC1C,IAAA,IAAI,QAAQ,IAAA,IAAQ,GAAA,CAAI,IAAA,EAAK,KAAM,IAAI,OAAO,IAAA;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAG,CAAA;AACxB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GAAI,KAAA,GAAQ,IAAA;AAAA,EAC1C;AAAA;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAC9B,IAAA,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAClC,IAAA,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACrC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAAA,EACnC;AAAA;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,SAAS,MAAA,EAAO;AACrB,IAAA,IAAA,CAAK,iBAAA,EAAkB;AAAA,EACzB;AACF","file":"separator_controller.js","sourcesContent":["import { isRtl } from \"./logical_scroll\";\n\n/**\n * Turns an arrow key into a **logical** step: `+1` for \"next\", `-1` for\n * \"previous\", `0` when the key names neither.\n *\n * APG defines the horizontal pair as *next / previous* and says a vertical\n * arrangement swaps in Down/Up for the same meaning — so the pair is one axis's\n * spelling of an order, and the order reverses with the writing direction. Only\n * the horizontal pair reverses. Down/Up name an axis the writing direction does\n * not mirror, and returning them unchanged is the point: many controllers fold\n * both pairs into one branch, where swapping the branches under RTL would flip\n * the vertical axis too — a bug that reads as \"the arrows work\" until someone\n * presses Down.\n *\n * **Direction is read from the element the caller passes, which should be the\n * container that lays the items out** — not the focused child. A child may carry\n * its own `dir` (an LTR input inside an RTL form is ordinary authoring), and\n * probing per handler makes two handlers disagree at the boundary between them.\n *\n * This decides direction only. Whether the axis is even active (an\n * `orientation=\"horizontal\"` widget ignoring Down/Up), how far the step lands,\n * and what wrapping does all stay with the caller.\n *\n * **It encodes the list-order convention: `ArrowDown` is *next*.** Widgets that\n * pair the arrows by *value* instead — `ArrowUp` meaning \"more\", as a rating or a\n * slider does — must not use this, or their vertical axis inverts. Reverse the\n * horizontal pair on its own there.\n *\n * @example\n * ```ts\n * const step = logicalArrowStep(event.key, this.element);\n * if (step === 0) return;\n * this.#roving.setActive(rovingMove(current, length, step, \"wrap\"), { focus: true });\n * ```\n */\nexport function logicalArrowStep(key: string, element: Element): 1 | -1 | 0 {\n  if (key === \"ArrowDown\") return 1;\n  if (key === \"ArrowUp\") return -1;\n  if (key !== \"ArrowRight\" && key !== \"ArrowLeft\") return 0;\n  const forward = isRtl(element) ? \"ArrowLeft\" : \"ArrowRight\";\n  return key === forward ? 1 : -1;\n}\n\n/**\n * Rewrites `key` so an existing LTR-shaped branch keeps working under RTL:\n * `ArrowRight` and `ArrowLeft` trade places, everything else passes through.\n *\n * The alternative — negating a delta — silently breaks handlers whose two\n * horizontal branches are **not mirror images**. A grid that clamps one edge but\n * not the other, or a segmented field guarding `index > 0` on one side and\n * `index < length - 1` on the other, ends up applying the wrong guard to the\n * wrong direction. Swapping the key leaves each branch, guards and all, exactly\n * where its author put it.\n *\n * Same rule as {@link logicalArrowStep} about which element to read: pass the\n * container that lays the items out, not the focused child.\n *\n * @example\n * ```ts\n * switch (logicalArrowKey(event.key, this.element)) {\n *   case \"ArrowLeft\": // \"previous\" — whatever direction that is on screen\n * ```\n */\nexport function logicalArrowKey(key: string, element: Element): string {\n  if (key !== \"ArrowRight\" && key !== \"ArrowLeft\") return key;\n  if (!isRtl(element)) return key;\n  return key === \"ArrowRight\" ? \"ArrowLeft\" : \"ArrowRight\";\n}\n\n/** Modifiers a widget may claim on an arrow key, named for the `allow` list. */\nexport type ArrowModifier = \"alt\" | \"ctrl\" | \"meta\" | \"shift\";\n\n/**\n * True when an arrow key arrived carrying a modifier the widget must leave to\n * the browser: return without calling `preventDefault()` and without moving any\n * state.\n *\n * A bare arrow belongs to the widget; a chorded one usually does not.\n * `Alt`/`Meta` plus a horizontal arrow is history back/forward on every desktop\n * browser, and a widget that swallows it makes the shortcut work or not\n * depending on where focus happens to sit — a coin-flip the user cannot see.\n *\n * `allow` is for the combinations APG assigns to a pattern **and the widget\n * actually implements** — today only Combobox's optional `Alt+Down`/`Alt+Up`.\n * Listing one the widget does not implement defeats the point: the chord then\n * runs the plain-arrow branch, which is exactly what this guard exists to stop.\n * Non-arrow keys return `false`, so chorded letters and\n * `Control+Home`/`Control+End` are untouched.\n *\n * @example\n * ```ts\n * if (isReservedArrowChord(event)) return;\n * ```\n */\nexport function isReservedArrowChord(\n  event: KeyboardEvent,\n  allow: readonly ArrowModifier[] = [],\n): boolean {\n  if (!event.key.startsWith(\"Arrow\")) return false;\n  return (\n    (event.altKey && !allow.includes(\"alt\")) ||\n    (event.ctrlKey && !allow.includes(\"ctrl\")) ||\n    (event.metaKey && !allow.includes(\"meta\")) ||\n    (event.shiftKey && !allow.includes(\"shift\"))\n  );\n}\n\n/**\n * True when a press arrived carrying any modifier, for the keys the browser and\n * the OS own outright: return without calling `preventDefault()` and without\n * moving any state.\n *\n * `Control+Home` and `Control+End` jump the document to its ends, and a widget\n * that swallows them makes the shortcut work or not depending on where focus\n * happens to sit. {@link isReservedArrowChord} answers the same question for the\n * arrows, but returns `false` for every other key so that this one can decide.\n *\n * There is no `allow` list here on purpose. APG assigns no modifier chord to\n * `Home`/`End`, so a widget that wanted one would be claiming a combination the\n * pattern never gave it.\n *\n * @example\n * ```ts\n * case \"Home\":\n * case \"End\":\n *   if (hasModifierChord(event)) return;\n * ```\n */\nexport function hasModifierChord(event: KeyboardEvent): boolean {\n  return event.altKey || event.ctrlKey || event.metaKey || event.shiftKey;\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 * 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","/** Configuration for a value constrained to a stepped numeric range. */\nexport interface SteppedRange {\n  /** Inclusive lower endpoint. May be infinite for an unbounded control. */\n  readonly min: number;\n  /** Inclusive upper endpoint. May be infinite for an unbounded control. */\n  readonly max: number;\n  /** Requested step. Non-finite and non-positive values fall back to `1`. */\n  readonly step: number;\n  /** Step-grid origin. Defaults to a finite `min`, otherwise `0`. */\n  readonly base?: number;\n}\n\n/** The positive finite step used at runtime and by keyboard stepping. */\nexport function effectiveStep(step: number): number {\n  return Number.isFinite(step) && step > 0 ? step : 1;\n}\n\n/**\n * Clamps a raw value and selects its nearest allowed value.\n *\n * The allowed set is the step grid plus each finite range endpoint. Keeping the\n * endpoints in that set makes an authored `aria-valuemin`/`aria-valuemax`\n * truthful even when the upper endpoint is not aligned to the grid. A value\n * exactly between two allowed values resolves upward.\n */\nexport function snapSteppedValue(raw: number, range: SteppedRange): number {\n  if (!(range.min <= range.max)) return finiteFallback(range.min, range.max);\n\n  const input = Number.isNaN(raw) ? finiteFallback(range.min, range.max) : raw;\n  const clamped = Math.min(range.max, Math.max(range.min, input));\n  const step = effectiveStep(range.step);\n  const base = stepBase(range);\n  const candidates: number[] = [];\n\n  if (Number.isFinite(range.min)) candidates.push(range.min);\n  if (Number.isFinite(range.max)) candidates.push(range.max);\n\n  const gridPosition = (clamped - base) / step;\n  if (Number.isFinite(gridPosition)) {\n    addGridCandidate(candidates, Math.floor(gridPosition), range, base, step);\n    addGridCandidate(candidates, Math.ceil(gridPosition), range, base, step);\n  }\n\n  if (candidates.length === 0) return clamped;\n  let nearest = candidates[0] as number;\n  let nearestDistance = Math.abs(clamped - nearest);\n  for (const candidate of candidates.slice(1)) {\n    const distance = Math.abs(clamped - candidate);\n    if (\n      distance < nearestDistance ||\n      (nearlyEqual(distance, nearestDistance) && candidate > nearest)\n    ) {\n      nearest = candidate;\n      nearestDistance = distance;\n    }\n  }\n  return nearest;\n}\n\n/**\n * Moves through the ordered allowed-value set by an integer number of steps.\n *\n * This differs from adding `step * count` and snapping afterward at an\n * off-grid endpoint: with `max=94, step=10`, one decrement from `94` must land\n * on `90`, and one increment from `90` must reach the advertised maximum `94`.\n */\nexport function stepSteppedValue(current: number, count: number, range: SteppedRange): number {\n  const value = snapSteppedValue(current, range);\n  const distance = Math.abs(Math.trunc(count));\n  if (!Number.isFinite(distance) || distance === 0) return value;\n  const direction = Math.sign(count);\n  const adjacent = adjacentSteppedValue(value, direction, range);\n\n  // The first move accounts for a possibly off-grid endpoint. From there a\n  // direct grid jump is equivalent to repeated adjacency, and avoids work that\n  // grows with Page-step magnitudes or programmatic counts.\n  const raw = adjacent + direction * (distance - 1) * effectiveStep(range.step);\n  return snapSteppedValue(raw, range);\n}\n\n/** Returns the next member of the ordered endpoint-plus-grid set. */\nfunction adjacentSteppedValue(current: number, direction: number, range: SteppedRange): number {\n  const step = effectiveStep(range.step);\n  const base = stepBase(range);\n  const candidates: number[] = [];\n\n  if (direction > 0) {\n    const position = (current - base) / step;\n    if (Number.isFinite(position)) {\n      let gridIndex = Math.floor(position) + 1;\n      let candidate = cleanGridValue(base + gridIndex * step, base, step);\n      if (candidate < current || nearlyEqual(candidate, current)) {\n        gridIndex += 1;\n        candidate = cleanGridValue(base + gridIndex * step, base, step);\n      }\n      if (\n        candidate > current &&\n        !nearlyEqual(candidate, current) &&\n        within(candidate, range.min, range.max)\n      ) {\n        candidates.push(clamp(candidate, range));\n      }\n    }\n    return clamp(Math.min(...candidates), range);\n  }\n\n  const position = (current - base) / step;\n  if (Number.isFinite(position)) {\n    let gridIndex = Math.ceil(position) - 1;\n    let candidate = cleanGridValue(base + gridIndex * step, base, step);\n    if (candidate > current || nearlyEqual(candidate, current)) {\n      gridIndex -= 1;\n      candidate = cleanGridValue(base + gridIndex * step, base, step);\n    }\n    if (\n      candidate < current &&\n      !nearlyEqual(candidate, current) &&\n      within(candidate, range.min, range.max)\n    ) {\n      candidates.push(clamp(candidate, range));\n    }\n  }\n  return clamp(Math.max(...candidates), range);\n}\n\n/** Adds one grid value when it falls inside the inclusive range. */\nfunction addGridCandidate(\n  candidates: number[],\n  index: number,\n  range: SteppedRange,\n  base: number,\n  step: number,\n): void {\n  const candidate = cleanGridValue(base + index * step, base, step);\n  if (within(candidate, range.min, range.max)) candidates.push(clamp(candidate, range));\n}\n\n/** A finite authored base wins; otherwise the finite lower bound or zero does. */\nfunction stepBase(range: SteppedRange): number {\n  if (range.base !== undefined && Number.isFinite(range.base)) return range.base;\n  return Number.isFinite(range.min) ? range.min : 0;\n}\n\n/** Removes binary noise without discarding significant integer-place digits. */\nfunction cleanGridValue(value: number, base: number, step: number): number {\n  const precision = Math.max(decimalPlaces(base), decimalPlaces(step));\n  // `toFixed` accepts at most 100 fractional digits. Below that limit it rounds\n  // according to the authored grid precision rather than an arbitrary total\n  // significant-digit count, which keeps unit steps distinct at large bases.\n  return precision <= 100 ? Number(value.toFixed(precision)) : value;\n}\n\n/** Number of fractional decimal places represented by a finite JS number. */\nfunction decimalPlaces(value: number): number {\n  const [coefficient = \"\", exponentText] = Math.abs(value).toString().toLowerCase().split(\"e\");\n  const fractionLength = coefficient.split(\".\")[1]?.length ?? 0;\n  const exponent = exponentText === undefined ? 0 : Number(exponentText);\n  return Math.max(0, fractionLength - exponent);\n}\n\n/** Inclusive range check tolerant only of arithmetic noise at an endpoint. */\nfunction within(value: number, min: number, max: number): boolean {\n  return (value > min || nearlyEqual(value, min)) && (value < max || nearlyEqual(value, max));\n}\n\n/** Clamps a candidate whose only overshoot may be floating-point noise. */\nfunction clamp(value: number, range: SteppedRange): number {\n  return Math.min(range.max, Math.max(range.min, value));\n}\n\n/** Relative comparison used only to collapse arithmetic noise, not real steps. */\nfunction nearlyEqual(left: number, right: number): boolean {\n  const scale = Math.max(Math.abs(left), Math.abs(right));\n  return (\n    Number.isFinite(left) &&\n    Number.isFinite(right) &&\n    Math.abs(left - right) <= Number.EPSILON * scale\n  );\n}\n\n/** Stable fallback for malformed ranges or `NaN` input. */\nfunction finiteFallback(min: number, max: number): number {\n  if (Number.isFinite(min)) return min;\n  if (Number.isFinite(max)) return max;\n  return 0;\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { isReservedArrowChord } from \"../utils/arrow_step\";\nimport { AttributeLease } from \"../utils/attribute_lease\";\nimport { BeforeCacheReset } from \"../utils/before_cache_reset\";\nimport { MicrotaskCoalescer } from \"../utils/microtask_coalescer\";\nimport { type SteppedRange, snapSteppedValue, stepSteppedValue } from \"../utils/stepped_value\";\n\nconst DEFAULT_MIN = 0;\nconst DEFAULT_MAX = 100;\n\n/**\n * Headless **Separator** behavior. The normative source depends on the case:\n * a decorative divider follows the WAI-ARIA `separator` role\n * (https://www.w3.org/TR/wai-aria-1.2/#separator), while the focusable,\n * value-bearing divider follows the APG Window Splitter pattern\n * (https://www.w3.org/WAI/ARIA/apg/patterns/windowsplitter/).\n *\n * Markup contract (identifier: `stimeo--separator`):\n *   <!-- decorative -->\n *   <div data-controller=\"stimeo--separator\"\n *        data-stimeo--separator-orientation-value=\"horizontal\"></div>\n *\n *   <!-- focusable, value-bearing -->\n *   <div data-controller=\"stimeo--separator\"\n *        aria-labelledby=\"sidebar-heading\" aria-controls=\"sidebar\"\n *        data-stimeo--separator-orientation-value=\"vertical\"\n *        data-stimeo--separator-focusable-value=\"true\"\n *        data-stimeo--separator-min-value=\"0\"\n *        data-stimeo--separator-max-value=\"100\"\n *        data-stimeo--separator-step-value=\"1\"\n *        data-stimeo--separator-value-value=\"50\"\n *        data-action=\"keydown->stimeo--separator#onKeydown\"></div>\n *\n * The Stimulus Values are the live inputs. The controller reflects them as\n * `role`, `tabindex`, `aria-orientation`, and the range ARIA while connected,\n * then restores the attributes it displaced on disconnect and before Turbo\n * caches the page. Existing finite range ARIA is hydrated into otherwise\n * absent Values once, which preserves progressively enhanced server markup\n * without leaving two live sources of truth. That fill is the one write\n * `connect()` makes to a Value: a declared Value is never overwritten, and the\n * normalized value is published through `aria-valuenow` without being written\n * back.\n *\n * `change` and `reconcile` dispatch `{ value: number }`.\n *\n * @remarks\n * Behavior only — line drawing is the consumer's CSS. The axis follows Window\n * Splitter: a vertical divider takes ArrowLeft/ArrowRight, a horizontal one\n * takes ArrowUp/ArrowDown. Which end counts as an increase is not defined\n * there, so it follows the slider convention (ArrowRight/ArrowUp increase).\n * Home/End are optional in the pattern and are implemented here; F6 is not.\n *\n * A maximum below the effective minimum collapses to that minimum; non-finite\n * bounds use `0`/`100`, and an invalid or non-positive step uses `1`. Finite\n * endpoints remain reachable even when they do not align to the step grid.\n * `change` reports a key the user pressed that left the value somewhere other\n * than the value last published. Runtime Value changes — a Turbo morph or\n * application code — repaint once per batch, and when they move the value a\n * focusable separator publishes, `reconcile` reports it with the same detail,\n * so a consumer can tell its user's move from the page's. A key handled before\n * a page write is repainted reads the written value, so its `change` covers the\n * write as well, and a key that ends on the value last published reports\n * nothing. A key dispatched from script runs every listener with no microtask\n * between them, so a write made just before it, or by a listener that runs\n * ahead of the separator, is handled that way. A key the browser dispatches\n * runs microtasks between the listeners it calls separately, so a write made\n * by one called ahead of the separator's — a capture listener on an ancestor or\n * on `document`, a `:capture` action, or a listener added to the separator\n * before its action was bound — is repainted, and reported as `reconcile`,\n * before the key is measured from it. Stimulus calls the actions an element\n * declares for one event and one set of listener options from a single\n * listener, in declaration order, so a write made by an action declared before\n * the separator's own is handled like a write within a key dispatched from\n * script. A decorative\n * separator publishes no value and reports nothing; one that becomes focusable\n * again reports a value that moved meanwhile. Connecting reports neither.\n *\n * Because no position is ever applied here, two Window Splitter requirements\n * fall to the consumer: `aria-controls` naming the **primary** pane — the one\n * whose size the value reports — and `Enter` to toggle collapse/restore, since\n * collapsing applies a position — {@link ResizableController} implements that\n * key for the same divider. Because the increment direction is fixed, the\n * primary pane can only be the left one for a vertical splitter and the bottom\n * one for a horizontal splitter: those are the panes that grow as\n * ArrowRight/ArrowUp raise the value.\n */\nexport class SeparatorController extends Controller<HTMLElement> {\n  static override values = {\n    orientation: { type: String, default: \"horizontal\" },\n    focusable: { type: Boolean, default: false },\n    min: { type: Number, default: DEFAULT_MIN },\n    max: { type: Number, default: DEFAULT_MAX },\n    step: { type: Number, default: 1 },\n    value: { type: Number, default: DEFAULT_MIN },\n  };\n  static actions = [\"onKeydown\"] as const;\n  static events = [\"change\", \"reconcile\"] as const;\n\n  declare orientationValue: string;\n  declare focusableValue: boolean;\n  declare minValue: number;\n  declare maxValue: number;\n  declare stepValue: number;\n  declare valueValue: number;\n\n  readonly #role = new AttributeLease<HTMLElement>(\"role\");\n  readonly #tabindex = new AttributeLease<HTMLElement>(\"tabindex\");\n  readonly #orientation = new AttributeLease<HTMLElement>(\"aria-orientation\");\n  readonly #minimum = new AttributeLease<HTMLElement>(\"aria-valuemin\");\n  readonly #maximum = new AttributeLease<HTMLElement>(\"aria-valuemax\");\n  readonly #current = new AttributeLease<HTMLElement>(\"aria-valuenow\");\n\n  /** Collapses a morph that changes several render Values into one repaint. */\n  readonly #repaint = new MicrotaskCoalescer(() => this.#render());\n\n  /** Restores authored semantics before Turbo snapshots the element. */\n  readonly #beforeCache = new BeforeCacheReset(() => this.#rewindForCache());\n\n  /**\n   * The baseline a published value is compared with: the value last published\n   * through `aria-valuenow`, or `null` while this connection has published none.\n   * It moves to each value a key the user presses or a repaint publishes. While\n   * nothing is published — the separator is decorative — it keeps the last\n   * value published, so a value that moved meanwhile is reported once when the\n   * separator publishes again; one that connected decorative keeps `null`, so\n   * its first published value is only taken as the baseline.\n   */\n  #settled: number | null = null;\n\n  /**\n   * Hydrates authored range ARIA into absent Values once and renders them\n   * without writing the normalized value back. What the first render publishes\n   * is the baseline, so connecting reports nothing.\n   */\n  override connect(): void {\n    this.#hydrateValues();\n    this.#repaint.activate();\n    this.#beforeCache.activate();\n    this.#settled = null;\n    this.#render();\n  }\n\n  /** Cancels repaint work and returns every semantic attribute this instance controlled. */\n  override disconnect(): void {\n    this.#repaint.cancel();\n    this.#beforeCache.deactivate();\n    this.#returnAttributes();\n  }\n\n  /** Repaints an orientation changed by application code or a Turbo morph. */\n  orientationValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Adds or removes the focusable range semantics at runtime. */\n  focusableValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a minimum changed by application code or a Turbo morph. */\n  minValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a maximum changed by application code or a Turbo morph. */\n  maxValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a step changed by application code or a Turbo morph. */\n  stepValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a current value changed by application code or a Turbo morph. */\n  valueValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Adjusts the value on arrow / Home / End keys (focusable variant only). */\n  onKeydown(event: KeyboardEvent): void {\n    if (isReservedArrowChord(event) || !this.focusableValue) return;\n\n    const horizontal = this.#effectiveOrientation === \"horizontal\";\n    const range = this.#effectiveRange;\n    // Stepping snaps the declaration onto the value it publishes before moving.\n    const declared = this.valueValue;\n    let next: number | null = null;\n    switch (event.key) {\n      case \"ArrowUp\":\n        if (horizontal) next = stepSteppedValue(declared, 1, range);\n        break;\n      case \"ArrowDown\":\n        if (horizontal) next = stepSteppedValue(declared, -1, range);\n        break;\n      case \"ArrowRight\":\n        if (!horizontal) next = stepSteppedValue(declared, 1, range);\n        break;\n      case \"ArrowLeft\":\n        if (!horizontal) next = stepSteppedValue(declared, -1, range);\n        break;\n      case \"Home\":\n        next = range.min;\n        break;\n      case \"End\":\n        next = range.max;\n        break;\n      default:\n        return;\n    }\n    if (next === null) return;\n\n    event.preventDefault();\n    this.#commit(next);\n  }\n\n  /**\n   * Stores a normalized user value, renders immediately, and reports it as\n   * `change` when it differs from the value last published. The comparison is\n   * with the value last published, not with the value the key started from, so\n   * a page write no repaint has published yet is reported once, as this change,\n   * and a key that ends where the value was last published reports nothing. The\n   * baseline moves before the render and the report, so neither the repaint the\n   * Value write schedules nor a move a subscriber makes while `change` is\n   * dispatched is measured from the value this key replaced.\n   */\n  #commit(raw: number): void {\n    const value = snapSteppedValue(raw, this.#effectiveRange);\n    const reported = this.#settled;\n    this.#settled = value;\n    if (!Object.is(this.valueValue, value)) this.valueValue = value;\n    this.#render();\n    if (value !== reported) this.dispatch(\"change\", { detail: { value } });\n  }\n\n  /**\n   * Reflects live Values into the connected element without writing them back,\n   * then compares what it published with the baseline. A decorative separator\n   * publishes no value (`null` here): the baseline stays the last value\n   * published. A value is reported once as `reconcile` only when it moved from a\n   * published baseline, so the first value a connection publishes is only taken\n   * as the baseline.\n   *\n   * @stimeoRenderRoot\n   */\n  #render(): void {\n    const range = this.#effectiveRange;\n    const focusable = this.focusableValue;\n    const published = focusable ? snapSteppedValue(this.valueValue, range) : null;\n    this.#role.write(this.element, \"separator\");\n    this.#orientation.write(this.element, this.#effectiveOrientation);\n    this.#tabindex.write(this.element, focusable ? \"0\" : null);\n    this.#minimum.write(this.element, focusable ? String(range.min) : null);\n    this.#maximum.write(this.element, focusable ? String(range.max) : null);\n    this.#current.write(this.element, published === null ? null : String(published));\n\n    const previous = this.#settled;\n    if (published !== null) this.#settled = published;\n    if (previous !== null && published !== null && published !== previous) {\n      this.dispatch(\"reconcile\", { detail: { value: published } });\n    }\n  }\n\n  /** Effective orientation; unknown strings fall back to the horizontal contract. */\n  get #effectiveOrientation(): \"horizontal\" | \"vertical\" {\n    return this.orientationValue === \"vertical\" ? \"vertical\" : \"horizontal\";\n  }\n\n  /** Finite, ordered range shared by rendering and keyboard stepping. */\n  get #effectiveRange(): SteppedRange {\n    const min = Number.isFinite(this.minValue) ? this.minValue : DEFAULT_MIN;\n    const candidateMax = Number.isFinite(this.maxValue) ? this.maxValue : DEFAULT_MAX;\n    return {\n      min,\n      max: Math.max(min, candidateMax),\n      step: this.stepValue,\n      base: min,\n    };\n  }\n\n  /**\n   * Copies valid authored ARIA into Values only when no explicit Value exists.\n   * This fill is the one Value write `connect()` makes: it never overwrites a\n   * declaration, and no Value callback runs it, so a declaration the page\n   * changes later is only ever read.\n   */\n  #hydrateValues(): void {\n    if (!this.#hasInput(\"orientation\")) {\n      const orientation = this.element.getAttribute(\"aria-orientation\");\n      if (orientation === \"horizontal\" || orientation === \"vertical\") {\n        this.orientationValue = orientation;\n      }\n    }\n\n    const min = this.#finiteAttribute(\"aria-valuemin\");\n    if (!this.#hasInput(\"min\") && min !== null) this.minValue = min;\n    const max = this.#finiteAttribute(\"aria-valuemax\");\n    if (!this.#hasInput(\"max\") && max !== null) this.maxValue = max;\n    const value = this.#finiteAttribute(\"aria-valuenow\");\n    if (!this.#hasInput(\"value\") && value !== null) this.valueValue = value;\n  }\n\n  /** Whether the author supplied the namespaced Value instead of using its default. */\n  #hasInput(name: \"orientation\" | \"min\" | \"max\" | \"value\"): boolean {\n    return this.element.hasAttribute(`data-${this.identifier}-${name}-value`);\n  }\n\n  /** Strict finite-number parser for the one-time progressive-enhancement bridge. */\n  #finiteAttribute(name: string): number | null {\n    const raw = this.element.getAttribute(name);\n    if (raw === null || raw.trim() === \"\") return null;\n    const value = Number(raw);\n    return Number.isFinite(value) ? value : null;\n  }\n\n  /** Returns attributes without overwriting values a consumer changed after render. */\n  #returnAttributes(): void {\n    this.#role.return(this.element);\n    this.#tabindex.return(this.element);\n    this.#orientation.return(this.element);\n    this.#minimum.return(this.element);\n    this.#maximum.return(this.element);\n    this.#current.return(this.element);\n  }\n\n  /** Prevents a queued Value repaint from racing Turbo's restored snapshot. */\n  #rewindForCache(): void {\n    this.#repaint.cancel();\n    this.#returnAttributes();\n  }\n}\n"]}
+{"version":3,"sources":["../../src/utils/arrow_step.ts","../../src/utils/attribute_write.ts","../../src/utils/shared_registry.ts","../../src/utils/attribute_lease.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/stepped_value.ts","../../src/controllers/separator_controller.ts"],"names":["registry","position"],"mappings":";;AA2GO,SAAS,oBAAA,CACd,KAAA,EACA,KAAA,GAAkC,EAAC,EAC1B;AACT,EAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,UAAA,CAAW,OAAO,GAAG,OAAO,KAAA;AAC3C,EAAA,OACG,KAAA,CAAM,MAAA,IAAU,CAAC,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA,IACrC,KAAA,CAAM,OAAA,IAAW,CAAC,KAAA,CAAM,QAAA,CAAS,MAAM,KACvC,KAAA,CAAM,OAAA,IAAW,CAAC,KAAA,CAAM,QAAA,CAAS,MAAM,CAAA,IACvC,KAAA,CAAM,QAAA,IAAY,CAAC,KAAA,CAAM,QAAA,CAAS,OAAO,CAAA;AAE9C;AAsBO,SAAS,iBAAiB,KAAA,EAA+B;AAC9D,EAAA,OAAO,MAAM,MAAA,IAAU,KAAA,CAAM,OAAA,IAAW,KAAA,CAAM,WAAW,KAAA,CAAM,QAAA;AACjE;;ACjIO,SAAS,qBAAA,CACd,OAAA,EACA,IAAA,EACA,KAAA,EACA,WAAA,EACS;AACT,EAAA,IAAI,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA,KAAM,OAAO,OAAO,KAAA;AAEjD,EAAA,IAAI,KAAA,KAAU,IAAA,EAAM,OAAA,CAAQ,eAAA,CAAgB,IAAI,CAAA;AAAA,OAC3C,OAAA,CAAQ,YAAA,CAAa,IAAA,EAAM,KAAK,CAAA;AACrC,EAAA,OAAO,IAAA;AACT;;ACIO,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,MAAMA,YAAW,MAAA,EAAO;AACxB,EAAA,MAAA,CAAO,eAAe,UAAA,EAAY,MAAA,EAAQ,EAAE,KAAA,EAAOA,WAAU,CAAA;AAC7D,EAAA,OAAOA,SAAAA;AACT;;ACJA,IAAM,QAAA,GAAW,cAAA;AAAA,EACf,uCAAA;AAAA,EACA,OAA+B,EAAE,MAAA,kBAAQ,IAAI,SAAQ,EAAG,KAAA,kBAAO,IAAI,GAAA,EAAI,EAAE;AAC3E,CAAA;AAGA,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;AAGA,SAAS,cAAA,CAAe,SAAkB,SAAA,EAAoC;AAC5E,EAAA,MAAM,cAAc,QAAA,CAAS,MAAA,CAAO,IAAI,OAAO,CAAA,wBAAS,GAAA,EAA6B;AACrF,EAAA,QAAA,CAAS,MAAA,CAAO,GAAA,CAAI,OAAA,EAAS,WAAW,CAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AACvC,EAAA,IAAI,OAAO,OAAO,KAAA;AAClB,EAAA,MAAM,QAAgE,EAAC;AACvE,EAAA,KAAA,MAAW,UAAU,QAAA,CAAS,KAAA,CAAM,IAAI,SAAS,CAAA,IAAK,EAAC,EAAG;AACxD,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,OAAA,EAAS,MAAM,CAAA;AAC5C,IAAA,IAAI,MAAM,KAAA,CAAM,IAAA,CAAK,EAAE,GAAG,IAAA,EAAM,QAAQ,CAAA;AAAA,EAC1C;AACA,EAAA,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,EAAA,MAAM,KAAA,GAAQ,MACX,IAAA,CAAK,CAAC,KAAK,KAAA,KAAU,KAAA,CAAM,GAAG,CAAA,GAAI,KAAA,CAAM,KAAK,CAAC,CAAA,CAC9C,IAAI,CAAC,EAAE,QAAQ,OAAA,EAAS,QAAA,EAAU,MAAA,EAAO,EAAG,KAAA,MAAW;AAAA,IACtD,KAAA,EAAO,IAAA;AAAA,IACP,MAAA;AAAA,IACA,OAAA;AAAA,IACA,QAAA;AAAA,IACA,MAAA,EAAQ,UAAU,KAAA,GAAQ;AAAA,GAC5B,CAAE,CAAA;AACJ,EAAA,WAAA,CAAY,GAAA,CAAI,WAAW,KAAK,CAAA;AAChC,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,QAAA,CACP,KAAA,EACA,KAAA,EACA,MAAA,EAC2B;AAC3B,EAAA,OACE,MAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,UAAU,KAAK,CAAA,IACzC,KAAA,CAAM,IAAA,CAAK,CAAC,IAAA,KAAS,IAAA,CAAK,UAAU,IAAA,IAAQ,IAAA,CAAK,WAAW,MAAM,CAAA;AAEtE;AAwGO,IAAM,iBAAN,MAAkD;AAAA,EAC9C,UAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,eAAA;AAAA,EACA,KAAA,uBAAY,GAAA,EAAO;AAAA,EAQ5B,WAAA,CACE,SAAA,EACA,KAAA,EACA,OAAA,GAA0E,EAAC,EAC3E;AACA,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,IAAA,CAAK,eAAA,GAAkB,QAAQ,cAAA,KAAmB,IAAA;AAClD,IAAA,MAAM,QAAQ,QAAA,CAAS,KAAA;AACvB,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,cAAA,CAAe,OAAA,EAAS,IAAA,CAAK,UAAU,CAAA;AACrD,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,SAAS,MAAA,CAAO,GAAA,CAAI,OAAO,CAAA,EAAG,GAAA,CAAI,KAAK,UAAU,CAAA;AAC/D,IAAA,MAAM,KAAA,GACJ,IAAA,IAAQ,KAAA,IAAS,OAAA,CAAQ,YAAA,CAAa,IAAA,CAAK,OAAO,CAAA,GAC9C,cAAA,CAAe,OAAA,EAAS,IAAA,CAAK,UAAU,IACvC,EAAC;AACP,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,MAAM,KAAA,EAAmD;AACvD,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,EAAO,IAAA,EAAM,KAAK,OAAO,CAAA;AAC/C,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,GACd,IAAA,CAAK,mBAAmB,CAAC,KAAA,CAAM,IAAA,CAAK,CAAC,SAAS,IAAA,CAAK,OAAA,KAAY,OAAO,CAAA,GACpE,SACA,MAAA,GACF,IAAA;AACJ,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,qBAAA,CAAsB,OAAA,EAAS,MAAM,QAAQ,CAAA;AAAA,IAC/C;AAAA,EACF;AAAA,EAGA,QAAA,CAAS,SAAY,KAAA,EAA4B;AAC/C,IAAA,qBAAA,CAAsB,OAAA,EAAS,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA;AAAA,EACvD;AACF,CAAA;;AChQO,IAAM,cAAN,MAAkB;AAAA,EAEvB,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EAqB7B,GAAA,CAAI,MAAA,EAAqB,IAAA,EAAc,OAAA,EAAwB,OAAA,EAAiC;AAC9F,IAAA,MAAA,CAAO,gBAAA,CAAiB,IAAA,EAAM,OAAA,EAAS,EAAE,GAAG,SAAS,MAAA,EAAQ,IAAA,CAAK,MAAA,CAAO,MAAA,EAAQ,CAAA;AAAA,EACnF;AAAA,EAMA,OAAA,GAAgB;AACd,IAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,IAAA,IAAA,CAAK,MAAA,GAAS,IAAI,eAAA,EAAgB;AAAA,EACpC;AACF,CAAA;;AChEO,IAAM,qBAAN,MAAyB;AAAA,EACrB,IAAA;AAAA,EACT,OAAA,GAAU,KAAA;AAAA,EACV,OAAA,GAAU,KAAA;AAAA,EACV,WAAA,GAAc,CAAA;AAAA,EAGd,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,IAAA,GAAO,GAAA;AAAA,EACd;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACjB;AAAA,EAGA,MAAA,GAAe;AACb,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,IAAA,IAAA,CAAK,WAAA,IAAe,CAAA;AAAA,EACtB;AAAA,EAGA,IAAI,OAAA,GAAmB;AACrB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,IAAW,IAAA,CAAK,OAAA,EAAS;AACnC,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AACf,IAAA,MAAM,aAAa,IAAA,CAAK,WAAA;AACxB,IAAA,cAAA,CAAe,MAAM;AAEnB,MAAA,IAAI,UAAA,KAAe,KAAK,WAAA,IAAe,CAAC,KAAK,OAAA,IAAW,CAAC,KAAK,OAAA,EAAS;AACvE,MAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AACf,MAAA,IAAA,CAAK,IAAA,EAAK;AAAA,IACZ,CAAC,CAAA;AAAA,EACH;AACF,CAAA;;AC7EO,IAAM,qBAAN,MAAyB;AAAA,EACrB,UAAA,GAAa,IAAI,WAAA,EAAY;AAAA,EAC7B,KAAA;AAAA,EACT,QAAA,GAA2B,IAAA;AAAA,EAClB,QAAA,GAAW,MAAY,IAAA,CAAK,KAAA,CAAM,QAAA,EAAS;AAAA,EAGpD,YAAY,GAAA,EAAiB;AAC3B,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAI,kBAAA,CAAmB,GAAG,CAAA;AAAA,EACzC;AAAA,EAGA,QAAQ,OAAA,EAAwB;AAC9B,IAAA,IAAI,IAAA,CAAK,aAAa,OAAA,EAAS;AAC/B,IAAA,IAAA,CAAK,UAAA,EAAW;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,OAAA;AAChB,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AACpB,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,OAAA,EAAS,qBAAA,EAAuB,KAAK,QAAQ,CAAA;AAAA,EACnE;AAAA,EAGA,QAAA,GAAiB;AACf,IAAA,IAAA,CAAK,MAAM,QAAA,EAAS;AAAA,EACtB;AAAA,EAGA,IAAI,OAAA,GAAmB;AACrB,IAAA,OAAO,KAAK,KAAA,CAAM,OAAA;AAAA,EACpB;AAAA,EAGA,UAAA,GAAmB;AACjB,IAAA,IAAA,CAAK,WAAW,OAAA,EAAQ;AACxB,IAAA,IAAA,CAAK,MAAM,MAAA,EAAO;AAClB,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAAA,EAClB;AACF,CAAA;;AClBO,IAAM,aAAA,GAAgB;AAAA,EAC3B,MAAA,EAAQ,EAAE,MAAA,EAAQ,IAAA,EAAK;AAAA,EAEvB,QAAA,EAAU,EAAE,MAAA,EAAQ,IAAA,EAAM,cAAc,CAAA,EAO1C,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;;ACrBO,SAAS,UAAA,CAAW,GAAA,EAAa,QAAA,EAAkB,MAAA,EAA8B;AACtF,EAAA,OAAO,mBAAA,CAAoB,GAAA,EAAK,MAAM,CAAA,GAAI,GAAA,GAAM,QAAA;AAClD;;AC7BO,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;;AC5BO,SAAS,cAAc,IAAA,EAAsB;AAClD,EAAA,OAAO,OAAO,QAAA,CAAS,IAAI,CAAA,IAAK,IAAA,GAAO,IAAI,IAAA,GAAO,CAAA;AACpD;AAUO,SAAS,gBAAA,CAAiB,KAAa,KAAA,EAA6B;AACzE,EAAA,IAAI,EAAE,KAAA,CAAM,GAAA,IAAO,KAAA,CAAM,GAAA,CAAA,SAAa,cAAA,CAAe,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA;AAEzE,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,eAAe,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,GAAI,GAAA;AACzE,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,CAAC,CAAA;AAC9D,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,SAAS,KAAK,CAAA;AAC3B,EAAA,MAAM,aAAuB,EAAC;AAE9B,EAAA,IAAI,MAAA,CAAO,SAAS,KAAA,CAAM,GAAG,GAAG,UAAA,CAAW,IAAA,CAAK,MAAM,GAAG,CAAA;AACzD,EAAA,IAAI,MAAA,CAAO,SAAS,KAAA,CAAM,GAAG,GAAG,UAAA,CAAW,IAAA,CAAK,MAAM,GAAG,CAAA;AAEzD,EAAA,MAAM,YAAA,GAAA,CAAgB,UAAU,IAAA,IAAQ,IAAA;AACxC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,YAAY,CAAA,EAAG;AACjC,IAAA,gBAAA,CAAiB,YAAY,IAAA,CAAK,KAAA,CAAM,YAAY,CAAA,EAAG,KAAA,EAAO,MAAM,IAAI,CAAA;AACxE,IAAA,gBAAA,CAAiB,YAAY,IAAA,CAAK,IAAA,CAAK,YAAY,CAAA,EAAG,KAAA,EAAO,MAAM,IAAI,CAAA;AAAA,EACzE;AAEA,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,OAAA;AACpC,EAAA,IAAI,OAAA,GAAU,WAAW,CAAC,CAAA;AAC1B,EAAA,IAAI,eAAA,GAAkB,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,OAAO,CAAA;AAChD,EAAA,KAAA,MAAW,SAAA,IAAa,UAAA,CAAW,KAAA,CAAM,CAAC,CAAA,EAAG;AAC3C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,OAAA,GAAU,SAAS,CAAA;AAC7C,IAAA,IACE,WAAW,eAAA,IACV,WAAA,CAAY,UAAU,eAAe,CAAA,IAAK,YAAY,OAAA,EACvD;AACA,MAAA,OAAA,GAAU,SAAA;AACV,MAAA,eAAA,GAAkB,QAAA;AAAA,IACpB;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AASO,SAAS,gBAAA,CAAiB,OAAA,EAAiB,KAAA,EAAe,KAAA,EAA6B;AAC5F,EAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,OAAA,EAAS,KAAK,CAAA;AAC7C,EAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAC3C,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,IAAK,QAAA,KAAa,GAAG,OAAO,KAAA;AACzD,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AACjC,EAAA,MAAM,QAAA,GAAW,oBAAA,CAAqB,KAAA,EAAO,SAAA,EAAW,KAAK,CAAA;AAK7D,EAAA,MAAM,MAAM,QAAA,GAAW,SAAA,IAAa,WAAW,CAAA,CAAA,GAAK,aAAA,CAAc,MAAM,IAAI,CAAA;AAC5E,EAAA,OAAO,gBAAA,CAAiB,KAAK,KAAK,CAAA;AACpC;AAGA,SAAS,oBAAA,CAAqB,OAAA,EAAiB,SAAA,EAAmB,KAAA,EAA6B;AAC7F,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,KAAA,CAAM,IAAI,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,SAAS,KAAK,CAAA;AAC3B,EAAA,MAAM,aAAuB,EAAC;AAE9B,EAAA,IAAI,YAAY,CAAA,EAAG;AACjB,IAAA,MAAMC,SAAAA,GAAAA,CAAY,UAAU,IAAA,IAAQ,IAAA;AACpC,IAAA,IAAI,MAAA,CAAO,QAAA,CAASA,SAAQ,CAAA,EAAG;AAC7B,MAAA,IAAI,SAAA,GAAY,IAAA,CAAK,KAAA,CAAMA,SAAQ,CAAA,GAAI,CAAA;AACvC,MAAA,IAAI,YAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAClE,MAAA,IAAI,SAAA,GAAY,OAAA,IAAW,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,EAAG;AAC1D,QAAA,SAAA,IAAa,CAAA;AACb,QAAA,SAAA,GAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAAA,MAChE;AACA,MAAA,IACE,SAAA,GAAY,OAAA,IACZ,CAAC,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,IAC/B,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EACtC;AACA,QAAA,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AAAA,MACzC;AAAA,IACF;AACA,IAAA,OAAO,MAAM,IAAA,CAAK,GAAA,CAAI,GAAG,UAAU,GAAG,KAAK,CAAA;AAAA,EAC7C;AAEA,EAAA,MAAM,QAAA,GAAA,CAAY,UAAU,IAAA,IAAQ,IAAA;AACpC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,QAAQ,CAAA,EAAG;AAC7B,IAAA,IAAI,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAA,GAAI,CAAA;AACtC,IAAA,IAAI,YAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAClE,IAAA,IAAI,SAAA,GAAY,OAAA,IAAW,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,EAAG;AAC1D,MAAA,SAAA,IAAa,CAAA;AACb,MAAA,SAAA,GAAY,cAAA,CAAe,IAAA,GAAO,SAAA,GAAY,IAAA,EAAM,MAAM,IAAI,CAAA;AAAA,IAChE;AACA,IAAA,IACE,SAAA,GAAY,OAAA,IACZ,CAAC,WAAA,CAAY,SAAA,EAAW,OAAO,CAAA,IAC/B,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EACtC;AACA,MAAA,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AAAA,IACzC;AAAA,EACF;AACA,EAAA,OAAO,MAAM,IAAA,CAAK,GAAA,CAAI,GAAG,UAAU,GAAG,KAAK,CAAA;AAC7C;AAGA,SAAS,gBAAA,CACP,UAAA,EACA,KAAA,EACA,KAAA,EACA,MACA,IAAA,EACM;AACN,EAAA,MAAM,YAAY,cAAA,CAAe,IAAA,GAAO,KAAA,GAAQ,IAAA,EAAM,MAAM,IAAI,CAAA;AAChE,EAAA,IAAI,MAAA,CAAO,SAAA,EAAW,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,GAAG,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAC,CAAA;AACtF;AAGA,SAAS,SAAS,KAAA,EAA6B;AAC7C,EAAA,IAAI,KAAA,CAAM,SAAS,MAAA,IAAa,MAAA,CAAO,SAAS,KAAA,CAAM,IAAI,CAAA,EAAG,OAAO,KAAA,CAAM,IAAA;AAC1E,EAAA,OAAO,OAAO,QAAA,CAAS,KAAA,CAAM,GAAG,CAAA,GAAI,MAAM,GAAA,GAAM,CAAA;AAClD;AAGA,SAAS,cAAA,CAAe,KAAA,EAAe,IAAA,EAAc,IAAA,EAAsB;AACzE,EAAA,MAAM,SAAA,GAAY,KAAK,GAAA,CAAI,aAAA,CAAc,IAAI,CAAA,EAAG,aAAA,CAAc,IAAI,CAAC,CAAA;AAInE,EAAA,OAAO,aAAa,GAAA,GAAM,MAAA,CAAO,MAAM,OAAA,CAAQ,SAAS,CAAC,CAAA,GAAI,KAAA;AAC/D;AAGA,SAAS,cAAc,KAAA,EAAuB;AAC5C,EAAA,MAAM,CAAC,WAAA,GAAc,EAAA,EAAI,YAAY,IAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,CAAE,QAAA,EAAS,CAAE,WAAA,EAAY,CAAE,MAAM,GAAG,CAAA;AAC3F,EAAA,MAAM,iBAAiB,WAAA,CAAY,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,GAAG,MAAA,IAAU,CAAA;AAC5D,EAAA,MAAM,QAAA,GAAW,YAAA,KAAiB,MAAA,GAAY,CAAA,GAAI,OAAO,YAAY,CAAA;AACrE,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,cAAA,GAAiB,QAAQ,CAAA;AAC9C;AAGA,SAAS,MAAA,CAAO,KAAA,EAAe,GAAA,EAAa,GAAA,EAAsB;AAChE,EAAA,OAAA,CAAQ,KAAA,GAAQ,GAAA,IAAO,WAAA,CAAY,KAAA,EAAO,GAAG,OAAO,KAAA,GAAQ,GAAA,IAAO,WAAA,CAAY,KAAA,EAAO,GAAG,CAAA,CAAA;AAC3F;AAGA,SAAS,KAAA,CAAM,OAAe,KAAA,EAA6B;AACzD,EAAA,OAAO,IAAA,CAAK,IAAI,KAAA,CAAM,GAAA,EAAK,KAAK,GAAA,CAAI,KAAA,CAAM,GAAA,EAAK,KAAK,CAAC,CAAA;AACvD;AAGA,SAAS,WAAA,CAAY,MAAc,KAAA,EAAwB;AACzD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACtD,EAAA,OACE,MAAA,CAAO,QAAA,CAAS,IAAI,CAAA,IACpB,OAAO,QAAA,CAAS,KAAK,CAAA,IACrB,IAAA,CAAK,GAAA,CAAI,IAAA,GAAO,KAAK,CAAA,IAAK,OAAO,OAAA,GAAU,KAAA;AAE/C;AAGA,SAAS,cAAA,CAAe,KAAa,GAAA,EAAqB;AACxD,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA;AACjC,EAAA,IAAI,MAAA,CAAO,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA;AACjC,EAAA,OAAO,CAAA;AACT;;ACjLA,IAAM,WAAA,GAAc,CAAA;AACpB,IAAM,WAAA,GAAc,GAAA;AA8Eb,IAAM,mBAAA,GAAN,MAAM,oBAAA,SAA4B,UAAA,CAAwB;AAAA,EAEtD,QAAA,GAAW,IAAI,iBAAA,EAAkB;AAAA,EAE1C,OAAgB,MAAA,GAAS;AAAA,IACvB,WAAA,EAAa,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,YAAA,EAAa;AAAA,IACnD,SAAA,EAAW,EAAE,IAAA,EAAM,OAAA,EAAS,SAAS,KAAA,EAAM;AAAA,IAC3C,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IAC1C,GAAA,EAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA,EAAY;AAAA,IAC1C,IAAA,EAAM,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,CAAA,EAAE;AAAA,IACjC,KAAA,EAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,SAAS,WAAA;AAAY,GAC9C;AAAA,EAEA,OAAO,gBAAA,GAAmB;AAAA,IACxB,KAAK,aAAA,CAAc,MAAA;AAAA,IACnB,KAAK,aAAA,CAAc,MAAA;AAAA,IACnB,MAAM,aAAA,CAAc,QAAA;AAAA,IACpB,OAAO,aAAA,CAAc;AAAA,GACvB;AAAA,EACA,OAAO,OAAA,GAAU,CAAC,WAAW,CAAA;AAAA,EAC7B,OAAO,MAAA,GAAS,CAAC,QAAA,EAAU,WAAW,CAAA;AAAA,EAS7B,KAAA,GAAQ,IAAI,cAAA,CAA4B,MAAA,EAAQ,KAAK,UAAU,CAAA;AAAA,EAC/D,SAAA,GAAY,IAAI,cAAA,CAA4B,UAAA,EAAY,KAAK,UAAU,CAAA;AAAA,EACvE,YAAA,GAAe,IAAI,cAAA,CAA4B,kBAAA,EAAoB,KAAK,UAAU,CAAA;AAAA,EAClF,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAA,EAAiB,KAAK,UAAU,CAAA;AAAA,EAC3E,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAA,EAAiB,KAAK,UAAU,CAAA;AAAA,EAC3E,QAAA,GAAW,IAAI,cAAA,CAA4B,eAAA,EAAiB,KAAK,UAAU,CAAA;AAAA,EAG3E,WAAW,IAAI,kBAAA,CAAmB,MAAM,IAAA,CAAK,SAAS,CAAA;AAAA,EAW/D,QAAA,GAA0B,IAAA;AAAA,EAOjB,OAAA,GAAgB;AACvB,IAAA,IAAA,CAAK,cAAA,EAAe;AACpB,IAAA,IAAA,CAAK,QAAA,CAAS,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AAClC,IAAA,IAAA,CAAK,QAAA,GAAW,IAAA;AAChB,IAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,EACf;AAAA,EAGS,UAAA,GAAmB;AAC1B,IAAA,IAAA,CAAK,SAAS,UAAA,EAAW;AACzB,IAAA,IAAA,CAAK,iBAAA,EAAkB;AAAA,EACzB;AAAA,EAGA,uBAAA,GAAgC;AAC9B,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,qBAAA,GAA8B;AAC5B,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,eAAA,GAAwB;AACtB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,gBAAA,GAAyB;AACvB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,SAAS,QAAA,EAAS;AAAA,EACzB;AAAA,EAGA,UAAU,KAAA,EAA4B;AACpC,IAAA,IAAI,oBAAA,CAAqB,KAAK,CAAA,IAAK,CAAC,KAAK,cAAA,EAAgB;AACzD,IAAA,IAAA,CAAK,KAAA,CAAM,QAAQ,MAAA,IAAU,KAAA,CAAM,QAAQ,KAAA,KAAU,gBAAA,CAAiB,KAAK,CAAA,EAAG;AAE9E,IAAA,MAAM,UAAA,GAAa,KAAK,qBAAA,KAA0B,YAAA;AAClD,IAAA,MAAM,QAAQ,IAAA,CAAK,eAAA;AAEnB,IAAA,MAAM,WAAW,IAAA,CAAK,UAAA;AACtB,IAAA,IAAI,IAAA,GAAsB,IAAA;AAC1B,IAAA,QAAQ,MAAM,GAAA;AAAK,MACjB,KAAK,SAAA;AACH,QAAA,IAAI,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,GAAG,KAAK,CAAA;AAC1D,QAAA;AAAA,MACF,KAAK,WAAA;AACH,QAAA,IAAI,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,IAAI,KAAK,CAAA;AAC3D,QAAA;AAAA,MACF,KAAK,YAAA;AACH,QAAA,IAAI,CAAC,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,GAAG,KAAK,CAAA;AAC3D,QAAA;AAAA,MACF,KAAK,WAAA;AACH,QAAA,IAAI,CAAC,UAAA,EAAY,IAAA,GAAO,gBAAA,CAAiB,QAAA,EAAU,IAAI,KAAK,CAAA;AAC5D,QAAA;AAAA,MACF,KAAK,MAAA;AACH,QAAA,IAAA,GAAO,KAAA,CAAM,GAAA;AACb,QAAA;AAAA,MACF,KAAK,KAAA;AACH,QAAA,IAAA,GAAO,KAAA,CAAM,GAAA;AACb,QAAA;AAAA,MACF;AACE,QAAA;AAAA;AAEJ,IAAA,IAAI,SAAS,IAAA,EAAM;AAEnB,IAAA,KAAA,CAAM,cAAA,EAAe;AACrB,IAAA,IAAA,CAAK,QAAQ,IAAI,CAAA;AAAA,EACnB;AAAA,EAYA,QAAQ,GAAA,EAAmB;AACzB,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,GAAA,EAAK,IAAA,CAAK,eAAe,CAAA;AACxD,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,IAAA,IAAA,CAAK,QAAA,GAAW,KAAA;AAChB,IAAA,IAAI,CAAC,OAAO,EAAA,CAAG,IAAA,CAAK,YAAY,KAAK,CAAA,OAAQ,UAAA,GAAa,KAAA;AAC1D,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAI,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAM,EAAG,CAAA;AAAA,EACvE;AAAA,EAYA,OAAA,GAAgB;AACd,IAAA,MAAM,QAAQ,IAAA,CAAK,eAAA;AACnB,IAAA,MAAM,YAAY,IAAA,CAAK,cAAA;AACvB,IAAA,MAAM,YAAY,SAAA,GAAY,gBAAA,CAAiB,IAAA,CAAK,UAAA,EAAY,KAAK,CAAA,GAAI,IAAA;AACzE,IAAA,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,WAAW,CAAA;AAC1C,IAAA,IAAA,CAAK,YAAA,CAAa,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,KAAK,qBAAqB,CAAA;AAChE,IAAA,IAAA,CAAK,UAAU,KAAA,CAAM,IAAA,CAAK,OAAA,EAAS,SAAA,GAAY,MAAM,IAAI,CAAA;AACzD,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,YAAY,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAI,CAAA;AACtE,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,YAAY,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAI,CAAA;AACtE,IAAA,IAAA,CAAK,QAAA,CAAS,MAAM,IAAA,CAAK,OAAA,EAAS,cAAc,IAAA,GAAO,IAAA,GAAO,MAAA,CAAO,SAAS,CAAC,CAAA;AAE/E,IAAA,MAAM,WAAW,IAAA,CAAK,QAAA;AACtB,IAAA,IAAI,SAAA,KAAc,IAAA,EAAM,IAAA,CAAK,QAAA,GAAW,SAAA;AACxC,IAAA,IAAI,QAAA,KAAa,IAAA,IAAQ,SAAA,KAAc,IAAA,IAAQ,cAAc,QAAA,EAAU;AACrE,MAAA,IAAA,CAAK,QAAA,CAAS,aAAa,EAAE,MAAA,EAAQ,EAAE,KAAA,EAAO,SAAA,IAAa,CAAA;AAAA,IAC7D;AAAA,EACF;AAAA,EAGA,IAAI,qBAAA,GAAmD;AACrD,IAAA,OAAO,IAAA,CAAK,gBAAA,KAAqB,UAAA,GAAa,UAAA,GAAa,YAAA;AAAA,EAC7D;AAAA,EAGA,IAAI,eAAA,GAAgC;AAClC,IAAA,MAAM,MAAM,IAAA,CAAK,QAAA;AACjB,IAAA,MAAM,eAAe,IAAA,CAAK,QAAA;AAC1B,IAAA,OAAO;AAAA,MACL,GAAA;AAAA,MACA,GAAA,EAAK,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,YAAY,CAAA;AAAA,MAC/B,MAAM,IAAA,CAAK,SAAA;AAAA,MACX,IAAA,EAAM;AAAA,KACR;AAAA,EACF;AAAA,EAQA,cAAA,GAAuB;AACrB,IAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,aAAa,CAAA,EAAG;AAClC,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,kBAAkB,CAAA;AAChE,MAAA,IAAI,WAAA,KAAgB,YAAA,IAAgB,WAAA,KAAgB,UAAA,EAAY;AAC9D,QAAA,IAAA,CAAK,gBAAA,GAAmB,WAAA;AAAA,MAC1B;AAAA,IACF;AAEA,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACjD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,KAAK,KAAK,GAAA,KAAQ,IAAA,OAAW,QAAA,GAAW,GAAA;AAC5D,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACjD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,KAAK,KAAK,GAAA,KAAQ,IAAA,OAAW,QAAA,GAAW,GAAA;AAC5D,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,gBAAA,CAAiB,eAAe,CAAA;AACnD,IAAA,IAAI,CAAC,KAAK,SAAA,CAAU,OAAO,KAAK,KAAA,KAAU,IAAA,OAAW,UAAA,GAAa,KAAA;AAAA,EACpE;AAAA,EAGA,UAAU,IAAA,EAAwD;AAChE,IAAA,OAAO,IAAA,CAAK,QAAQ,YAAA,CAAa,CAAA,KAAA,EAAQ,KAAK,UAAU,CAAA,CAAA,EAAI,IAAI,CAAA,MAAA,CAAQ,CAAA;AAAA,EAC1E;AAAA,EAGA,iBAAiB,IAAA,EAA6B;AAC5C,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,YAAA,CAAa,IAAI,CAAA;AAC1C,IAAA,IAAI,QAAQ,IAAA,IAAQ,GAAA,CAAI,IAAA,EAAK,KAAM,IAAI,OAAO,IAAA;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAG,CAAA;AACxB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,GAAI,KAAA,GAAQ,IAAA;AAAA,EAC1C;AAAA,EAGA,iBAAA,GAA0B;AACxB,IAAA,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAC9B,IAAA,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAClC,IAAA,IAAA,CAAK,YAAA,CAAa,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACrC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AACjC,IAAA,IAAA,CAAK,QAAA,CAAS,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAAA,EACnC;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,oBAAA,CAAoB,OAAO,GAAA,CAAI,OAAA;AAAA,MAC/B,qBAAoB,gBAAA,CAAiB;AAAA,KACvC;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,oBAAA,CAAoB,OAAO,GAAA,CAAI,OAAA;AAAA,MAC/B,qBAAoB,gBAAA,CAAiB;AAAA,KACvC;AAAA,EACF;AAAA,EAGA,IAAI,SAAA,GAAoB;AACtB,IAAA,OAAO,KAAK,QAAA,CAAS,IAAA;AAAA,MACnB,IAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAA,CAAK,SAAA;AAAA,MACL,oBAAA,CAAoB,OAAO,IAAA,CAAK,OAAA;AAAA,MAChC,qBAAoB,gBAAA,CAAiB;AAAA,KACvC;AAAA,EACF;AAAA,EAGA,IAAI,UAAA,GAAqB;AACvB,IAAA,OAAO,KAAK,QAAA,CAAS,IAAA;AAAA,MACnB,IAAA;AAAA,MACA,OAAA;AAAA,MACA,IAAA,CAAK,UAAA;AAAA,MACL,KAAK,eAAA,CAAgB,GAAA;AAAA,MACrB,qBAAoB,gBAAA,CAAiB;AAAA,KACvC;AAAA,EACF;AACF","file":"separator_controller.js","sourcesContent":["import { isRtl } from \"./logical_scroll\";\n\n/**\n * Turns an arrow key into a **logical** step: `+1` for \"next\", `-1` for\n * \"previous\", `0` when the key names neither.\n *\n * APG defines the horizontal pair as *next / previous* and says a vertical\n * arrangement swaps in Down/Up for the same meaning — so the pair is one axis's\n * spelling of an order, and the order reverses with the writing direction. Only\n * the horizontal pair reverses. Down/Up name an axis the writing direction does\n * not mirror, and returning them unchanged is the point: many controllers fold\n * both pairs into one branch, where swapping the branches under RTL would flip\n * the vertical axis too — a bug that reads as \"the arrows work\" until someone\n * presses Down.\n *\n * **Direction is read from the element the caller passes, which should be the\n * container that lays the items out** — not the focused child. A child may carry\n * its own `dir` (an LTR input inside an RTL form is ordinary authoring), and\n * probing per handler makes two handlers disagree at the boundary between them.\n *\n * This decides direction only. Whether the axis is even active (an\n * `orientation=\"horizontal\"` widget ignoring Down/Up), how far the step lands,\n * and what wrapping does all stay with the caller.\n *\n * **It encodes the list-order convention: `ArrowDown` is *next*.** Widgets that\n * pair the arrows by *value* instead — `ArrowUp` meaning \"more\", as a rating or a\n * slider does — must not use this, or their vertical axis inverts. Reverse the\n * horizontal pair on its own there.\n *\n * @example\n * ```ts\n * const step = logicalArrowStep(event.key, this.element);\n * if (step === 0) return;\n * this.#roving.setActive(rovingMove(current, length, step, \"wrap\"), { focus: true });\n * ```\n */\nexport function logicalArrowStep(key: string, element: Element): 1 | -1 | 0 {\n  if (key === \"ArrowDown\") return 1;\n  if (key === \"ArrowUp\") return -1;\n  if (key !== \"ArrowRight\" && key !== \"ArrowLeft\") return 0;\n  const forward = isRtl(element) ? \"ArrowLeft\" : \"ArrowRight\";\n  return key === forward ? 1 : -1;\n}\n\n/**\n * Rewrites `key` so an existing LTR-shaped branch keeps working under RTL:\n * `ArrowRight` and `ArrowLeft` trade places, everything else passes through.\n *\n * The alternative — negating a delta — silently breaks handlers whose two\n * horizontal branches are **not mirror images**. A grid that clamps one edge but\n * not the other, or a segmented field guarding `index > 0` on one side and\n * `index < length - 1` on the other, ends up applying the wrong guard to the\n * wrong direction. Swapping the key leaves each branch, guards and all, exactly\n * where its author put it.\n *\n * Same rule as {@link logicalArrowStep} about which element to read: pass the\n * container that lays the items out, not the focused child.\n *\n * @example\n * ```ts\n * switch (logicalArrowKey(event.key, this.element)) {\n *   case \"ArrowLeft\": // \"previous\" — whatever direction that is on screen\n * ```\n */\nexport function logicalArrowKey(key: string, element: Element): string {\n  if (key !== \"ArrowRight\" && key !== \"ArrowLeft\") return key;\n  if (!isRtl(element)) return key;\n  return key === \"ArrowRight\" ? \"ArrowLeft\" : \"ArrowRight\";\n}\n\n/**\n * The element whose writing direction orders a grid's columns: the nearest\n * `<table>` holding `grid` inside `root`, else `grid` itself. Table columns follow\n * the table's direction, so a direction declared only on a row group such as\n * `<tbody>` does not reorder them and must not reverse the arrows either.\n */\nexport function gridDirectionElement(grid: Element, root: Element): Element {\n  const table = grid.closest(\"table\");\n  return table !== null && root.contains(table) ? table : grid;\n}\n\n/** Modifiers a widget may claim on an arrow key, named for the `allow` list. */\nexport type ArrowModifier = \"alt\" | \"ctrl\" | \"meta\" | \"shift\";\n\n/**\n * True when an arrow key arrived carrying a modifier the widget must leave to\n * the browser: return without calling `preventDefault()` and without moving any\n * state.\n *\n * A bare arrow belongs to the widget; a chorded one usually does not.\n * `Alt`/`Meta` plus a horizontal arrow is history back/forward on every desktop\n * browser, and a widget that swallows it makes the shortcut work or not\n * depending on where focus happens to sit — a coin-flip the user cannot see.\n *\n * `allow` is for the combinations APG assigns to a pattern **and the widget\n * actually implements** — for example `Alt+Down`/`Alt+Up`, which the APG Combobox\n * pattern makes optional and `stimeo--combobox` implements.\n * Listing one the widget does not implement defeats the point: the chord then\n * runs the plain-arrow branch, which is exactly what this guard exists to stop.\n * Non-arrow keys return `false`, so chorded letters and\n * `Control+Home`/`Control+End` are untouched.\n *\n * @example\n * ```ts\n * if (isReservedArrowChord(event)) return;\n * ```\n */\nexport function isReservedArrowChord(\n  event: KeyboardEvent,\n  allow: readonly ArrowModifier[] = [],\n): boolean {\n  if (!event.key.startsWith(\"Arrow\")) return false;\n  return (\n    (event.altKey && !allow.includes(\"alt\")) ||\n    (event.ctrlKey && !allow.includes(\"ctrl\")) ||\n    (event.metaKey && !allow.includes(\"meta\")) ||\n    (event.shiftKey && !allow.includes(\"shift\"))\n  );\n}\n\n/**\n * True when a press carries Alt, Control, Meta, or Shift, regardless of its key.\n *\n * This predicate reports modifier presence only; key ownership stays with the\n * caller. Check the widget's implemented key/modifier bindings and their state\n * conditions before using this result to yield a chord. An unimplemented chord\n * must not fall through to the bare-key behavior.\n *\n * Dedicated bindings, such as a grid's Control+Home/End navigation, belong in\n * the caller. Unlike {@link isReservedArrowChord}, this function examines every\n * key and has no arrow-specific reservation or `allow` list.\n *\n * @example\n * ```ts\n * // A Home/End handler with no modifier bindings yields every modified press.\n * case \"Home\":\n * case \"End\":\n *   if (hasModifierChord(event)) return;\n * ```\n */\nexport function hasModifierChord(event: KeyboardEvent): boolean {\n  return event.altKey || event.ctrlKey || event.metaKey || event.shiftKey;\n}\n","/**\n * Reflects a serialized attribute value only when the current value differs.\n *\n * A same-value `setAttribute` still queues a mutation record for every observer, so an\n * unchanged value writes nothing.\n *\n * @param element - The element whose attribute is reflected.\n * @param name - The attribute name, using the non-namespaced DOM API.\n * @param value - The serialized value, or null to remove the attribute.\n * @param beforeWrite - Called only for a change, before the DOM mutation, so the\n * caller can record ownership or identify its own observer records.\n * @returns Whether an attribute was written or removed.\n */\nexport function setAttributeIfChanged(\n  element: Element,\n  name: string,\n  value: string | null,\n  beforeWrite?: () => void,\n): boolean {\n  if (element.getAttribute(name) === value) return false;\n  beforeWrite?.();\n  if (value === null) element.removeAttribute(name);\n  else element.setAttribute(name, value);\n  return true;\n}\n","/**\n * One registry per page for every copy of the library.\n *\n * Each `stimeo-ui/controllers/*` file, and each opt-in entry, is built on its own and carries\n * its own copy of every utility it uses, so a page that imports controllers one by one, or one\n * of them next to the barrel, evaluates a utility several times. A registry that coordinates\n * instances of different controllers — the stacks of leased values, the loans of a\n * `tabindex`, the Escape layers, the focus traps — must not be split by that: a dialog inside\n * a drawer, or a character counter and a form field on one input, coordinate whichever files\n * they came from. So such a registry lives once on `globalThis`, under a `Symbol.for` key the\n * copies agree on, and the first copy to ask for it creates it.\n *\n * The key names the registry and the version of its shape\n * (`stimeo-ui.<utility>.registry.v<n>`). Copies whose registries have the same shape share\n * one; a release that changes the shape changes the version, so a copy of another release\n * keeps a registry of its own instead of reading entries it does not understand — the two\n * then coordinate within each release only. An entry another copy put in a registry is read\n * through its fields alone, never through `#private` members, which belong to the class of\n * the copy that created it.\n */\n\n/**\n * The registry stored under `key`, created by `create` on first use.\n *\n * @param key - `stimeo-ui.<utility>.registry.v<n>`: the version is that of the shape `create`\n *   returns.\n * @param create - Builds the empty registry.\n */\nexport function sharedRegistry<T extends object>(key: string, create: () => T): T {\n  const symbol = Symbol.for(key);\n  const scope = globalThis as unknown as Record<symbol, T | undefined>;\n  const existing = scope[symbol];\n  if (existing !== undefined) return existing;\n  const registry = create();\n  Object.defineProperty(globalThis, symbol, { value: registry });\n  return registry;\n}\n","import { setAttributeIfChanged } from \"./attribute_write\";\nimport { 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/** Holds and record names coordinate across separately built package entries. */\nconst registry = sharedRegistry(\n  \"stimeo-ui.attribute-lease.registry.v1\",\n  (): AttributeLeaseRegistry => ({ stacks: new WeakMap(), names: new Map() }),\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/** The element's stack, seeded from complete ownership records once. */\nfunction attributeStack(element: Element, attribute: string): AttributeHold[] {\n  const byAttribute = registry.stacks.get(element) ?? new Map<string, AttributeHold[]>();\n  registry.stacks.set(element, byAttribute);\n  const known = byAttribute.get(attribute);\n  if (known) return known;\n  const found: (AttributeLeaseRecord & { readonly record: string })[] = [];\n  for (const record of registry.names.get(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  const stack = 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  byAttribute.set(attribute, stack);\n  return stack;\n}\n\n/** The lease's live hold or the unclaimed hold described by its owner's record. */\nfunction findHold(\n  stack: readonly AttributeHold[],\n  lease: object,\n  record: string,\n): AttributeHold | undefined {\n  return (\n    stack.find((held) => held.lease === lease) ??\n    stack.find((held) => held.lease === null && held.record === record)\n  );\n}\n\n/**\n * Inspects a derived writer's continuation without acquiring or returning a hold.\n * A covered hold may update beneath its cover. Without a hold, the expected authored\n * value is compared with the original beneath any temporary cover. The original\n * distinguishes an absent attribute from an empty one.\n */\nexport function readAttributeLease(\n  element: Element,\n  attribute: string,\n  owner: string,\n  lease: object,\n  expected: string | null,\n): { readonly allowed: boolean; readonly original: string | null } {\n  const stack = attributeStack(element, attribute);\n  const hold = findHold(stack, lease, `data-${owner}-${attribute}-lease`);\n  const current = element.getAttribute(attribute);\n  const covering = [...stack].reverse().find((other) => other.written === current);\n  const original = (hold ?? covering)?.original;\n  const authored = original === undefined ? current : original;\n  return {\n    original: authored,\n    allowed: hold\n      ? current === hold.written ||\n        stack.slice(stack.indexOf(hold) + 1).some((above) => above.written === current)\n      : authored === expected,\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  readonly #attribute: string;\n  readonly #record: string;\n  readonly #base: boolean;\n  readonly #preserveAuthor: 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   *   `preserveAuthor`: a new base hold keeps a current value that no hold carries as authored.\n   */\n  constructor(\n    attribute: string,\n    owner: string,\n    options: { readonly base?: boolean; readonly preserveAuthor?: boolean } = {},\n  ) {\n    this.#attribute = attribute;\n    this.#record = `data-${owner}-${attribute}-lease`;\n    this.#base = options.base === true;\n    this.#preserveAuthor = options.preserveAuthor === true;\n    const names = 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 = attributeStack(element, this.#attribute);\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 = registry.stacks.get(element)?.has(this.#attribute);\n    const stack =\n      held || known || element.hasAttribute(this.#record)\n        ? attributeStack(element, this.#attribute)\n        : [];\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  /** Its hold in `stack`, taking over one read from its record. */\n  #take(stack: AttributeHold[]): AttributeHold | undefined {\n    const hold = findHold(stack, this, 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\n      ? this.#preserveAuthor && !stack.some((held) => held.written === current)\n        ? undefined\n        : bottom\n      : 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      setAttributeIfChanged(element, 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    setAttributeIfChanged(element, this.#attribute, value);\n  }\n}\n","/** What {@link ListenerSet.add} passes on besides the signal it supplies itself. */\nexport type ListenerOptions = Omit<AddEventListenerOptions, \"signal\">;\n\n/**\n * The event map a target's own `addEventListener` types its handlers with: the\n * window's, a document's, an HTML or SVG element's, any other element's, or a\n * media query list's. Other targets name none.\n */\ntype EventMapOf<T extends EventTarget> = T extends Window\n  ? WindowEventMap\n  : T extends Document\n    ? DocumentEventMap\n    : T extends HTMLElement\n      ? HTMLElementEventMap\n      : T extends SVGElement\n        ? SVGElementEventMap\n        : T extends Element\n          ? ElementEventMap\n          : T extends MediaQueryList\n            ? MediaQueryListEventMap\n            : Record<never, never>;\n\n/**\n * Owns every listener a controller attaches for one connected lifetime and\n * releases them together, so an event name is spelled once and the release\n * cannot drift from the registration.\n *\n * Detaching by hand repeats three things at the release site — the type, the\n * handler reference and the capture flag — and any one of them drifting leaves\n * a listener alive on an element the controller no longer drives. Aborting the\n * signal a registration was created with releases it whatever it was made of,\n * so the release site names nothing.\n *\n * One set per lifetime, held as a field and never rebuilt.\n * {@link ListenerSet.dispose} is the only thing that closes a generation, and it opens\n * the next one in the same step, so the lifecycle hooks can call `add` and\n * `dispose` in any order any number of times, and no `add` ever meets an\n * already aborted signal — a DOM that registers a listener on such a signal\n * would keep it forever. Rebuilding the set instead would leak:\n * `addEventListener` matches an existing registration on target, type, callback\n * and capture alone, so re-adding the same handler while the first registration\n * is live is discarded, and that live registration keeps the signal it was\n * attached with — a set built by a second `connect()` can never release what it\n * appears to own.\n *\n * Scope is the registration only. Timers, observers, leases and the order they\n * are unwound in stay with the controller, which places `dispose()` in its\n * cleanup sequence. A receiver that changes at runtime (a\n * swapped target) is rebound by calling `dispose()` and then `add()` again from\n * the rebind, not by a second set.\n *\n * A lifetime shorter than the connection — while a Value holds, until a first\n * load, while a subscription is open — gets a set of its own, which the end of\n * that lifetime disposes. A controller therefore holds one set per lifetime: the\n * connection's, and one for each swapped receiver or shorter span.\n *\n * The set must own every registration of a tuple it holds: a listener the same\n * target already carries for the same type, callback and capture flag keeps the\n * right to remove it, and this set's `add` for that tuple is discarded. A\n * subscription shared between instances behind a participant count, listeners of\n * several elements that come and go one at a time, and those one gesture holds\n * keep their own pair of calls or a signal of their own.\n *\n * @example\n * ```ts\n * readonly #listeners = new ListenerSet();\n *\n * connect(): void {\n *   this.#listeners.add(this.element, \"submit\", this.#onNativeSubmit, { capture: true });\n *   this.#listeners.add(this.element, \"turbo:submit-start\", this.#onSubmitStart);\n *   this.#listeners.add(this.element, \"turbo:submit-end\", this.#onSubmitEnd);\n * }\n *\n * disconnect(): void {\n *   this.#listeners.dispose();\n * }\n * ```\n */\nexport class ListenerSet {\n  /** The generation every `add` joins until the next `dispose()`. */\n  #abort = new AbortController();\n\n  /**\n   * Attaches `handler` to the open generation, exactly as the caller spelled it.\n   *\n   * The set supplies the signal, so `options` carries everything else the DOM\n   * accepts — `capture` included. A removal by hand would have to repeat that\n   * flag; aborting the signal releases the listener without it.\n   *\n   * A `type` the target's own event map names types `handler` with that event,\n   * as the target's `addEventListener` does, so a handler written for a\n   * `KeyboardEvent` is passed as it is; any other `type` takes an\n   * `EventListener`.\n   */\n  add<T extends EventTarget, K extends keyof EventMapOf<T> & string>(\n    target: T,\n    type: K,\n    handler: (event: EventMapOf<T>[K]) => void,\n    options?: ListenerOptions,\n  ): void;\n  add(target: EventTarget, type: string, handler: EventListener, options?: ListenerOptions): void;\n  add(target: EventTarget, type: string, handler: EventListener, options?: ListenerOptions): void {\n    target.addEventListener(type, handler, { ...options, signal: this.#abort.signal });\n  }\n\n  /**\n   * Releases every listener of the open generation, synchronously, and opens the\n   * next one. Idempotent, and safe before anything has been added.\n   */\n  dispose(): void {\n    this.#abort.abort();\n    this.#abort = new AbortController();\n  }\n}\n","/**\n * Collapses many Stimulus lifecycle callbacks from one DOM mutation into a\n * single pass.\n *\n * Stimulus fires `<name>TargetConnected` / `Disconnected` once per element and\n * `<name>ValueChanged` once per changed attribute. Replacing a list of N options\n * or morphing several render Values therefore delivers N callbacks — but the\n * useful unit of work is \"reconcile against the resulting declarative input\",\n * once, after the batch has settled. Every controller with reconcilable targets\n * or render Values needs the same shape: a `queued` flag plus `queueMicrotask`.\n *\n * **A microtask is the right horizon, and the reason is specific.** Stimulus\n * drives these callbacks from a `MutationObserver`, whose own callback already\n * runs as a microtask with the whole batch in hand; scheduling one more lands\n * after the last sibling callback of that batch and still before paint or any\n * event handler. A timer would be later than it needs to be, and reconciling\n * synchronously would run once per element against a half-applied DOM.\n *\n * **The two guards are not the same guard.** Scheduling is refused before the\n * controller connects, and running is refused after it disconnects:\n *\n * - **Before `connect()`** — Stimulus delivers initial target and Value callbacks\n *   ahead of `connect()`. Reconciling there would compute output against a\n *   controller whose own state has not been initialised, and `connect()` is\n *   about to do a full pass anyway.\n * - **After `disconnect()`** — Stimulus fires a callback for **every** target\n *   during teardown, and a microtask queued just before it would otherwise run\n *   against a detached tree. {@link MicrotaskCoalescer.cancel} exists for the\n *   teardown path to drop the pending pass outright.\n *\n * Both guards are part of one contract here rather than something each consumer\n * has to remember separately.\n *\n * Scope is the scheduling only. *What* to reconcile — keep the surviving active\n * option, fall back to the next / previous / first visible one, rebuild derived\n * chips or hidden fields — stays in the controller, because no two consumers\n * answer it the same way.\n *\n * @example\n * ```ts\n * readonly #reconcile = new MicrotaskCoalescer(() => this.#reconcileOptions());\n *\n * connect()    { this.#reconcile.activate(); }\n * disconnect() { this.#reconcile.cancel(); }\n *\n * optionTargetConnected()    { this.#reconcile.schedule(); }\n * optionTargetDisconnected() { this.#reconcile.schedule(); }\n * ```\n */\nexport class MicrotaskCoalescer {\n  readonly #run: () => void;\n  #queued = false;\n  #active = false;\n  #generation = 0;\n\n  /** @param run - the single reconciliation pass, invoked at most once per batch. */\n  constructor(run: () => void) {\n    this.#run = run;\n  }\n\n  /** Opens the window in which {@link schedule} is honoured; call from `connect()`. */\n  activate(): void {\n    this.#active = true;\n  }\n\n  /** Closes the window and drops any pending pass; call from `disconnect()`. */\n  cancel(): void {\n    this.#active = false;\n    this.#queued = false;\n    this.#generation += 1;\n  }\n\n  /** Whether a requested pass has yet to run. */\n  get pending(): boolean {\n    return this.#queued;\n  }\n\n  /** Requests one pass after the batch settles. Idempotent; inert outside the window. */\n  schedule(): void {\n    if (!this.#active || this.#queued) return;\n    this.#queued = true;\n    const generation = this.#generation;\n    queueMicrotask(() => {\n      // A cancelled callback must not consume a pass queued after reconnect.\n      if (generation !== this.#generation || !this.#queued || !this.#active) return;\n      this.#queued = false;\n      this.#run();\n    });\n  }\n}\n","import { ListenerSet } from \"./listener_set\";\nimport { MicrotaskCoalescer } from \"./microtask_coalescer\";\n\n/**\n * Coalesces retained-element morphs and explicit lifecycle requests into one pass.\n *\n * Observe the controller's element after its initial state is settled. Morphs on\n * that element and bubbling morphs on its descendants share the same microtask\n * as {@link schedule}. The callback repairs derived output; the controller owns\n * any logical transition reporting. {@link disconnect} releases the listener and\n * cancels pending work, including work from an earlier connected lifetime.\n */\nexport class MorphRenderWatcher {\n  readonly #listeners = new ListenerSet();\n  readonly #pass: MicrotaskCoalescer;\n  #element: Element | null = null;\n  readonly #onMorph = (): void => this.#pass.schedule();\n\n  /** @param run - the single pass that repairs the settled controller's output. */\n  constructor(run: () => void) {\n    this.#pass = new MicrotaskCoalescer(run);\n  }\n\n  /** Opens observation; observing the same element again preserves queued work. */\n  observe(element: Element): void {\n    if (this.#element === element) return;\n    this.disconnect();\n    this.#element = element;\n    this.#pass.activate();\n    this.#listeners.add(element, \"turbo:morph-element\", this.#onMorph);\n  }\n\n  /** Requests one pass; requests outside an observed lifetime are ignored. */\n  schedule(): void {\n    this.#pass.schedule();\n  }\n\n  /** Whether a pass requested by a morph or {@link schedule} has yet to run. */\n  get pending(): boolean {\n    return this.#pass.pending;\n  }\n\n  /** Releases observation and pending work synchronously; safe to repeat. */\n  disconnect(): void {\n    this.#listeners.dispose();\n    this.#pass.cancel();\n    this.#element = null;\n  }\n}\n","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/** Numeric update input, accepting decoded action params before CustomEvent detail. */\nexport type NumericValueEvent = Event & {\n  params?: { amount?: unknown };\n  detail?: { value?: unknown };\n};\n\n/** Reads the nullish action-param/detail precedence without falling back from invalid input. */\nexport function eventNumber(event: NumericValueEvent): number | null {\n  return toFiniteNumber(event.params?.amount ?? event.detail?.value);\n}\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","/** Configuration for a value constrained to a stepped numeric range. */\nexport interface SteppedRange {\n  /** Inclusive lower endpoint. May be infinite for an unbounded control. */\n  readonly min: number;\n  /** Inclusive upper endpoint. May be infinite for an unbounded control. */\n  readonly max: number;\n  /** Requested step. Non-finite and non-positive values fall back to `1`. */\n  readonly step: number;\n  /** Step-grid origin. Defaults to a finite `min`, otherwise `0`. */\n  readonly base?: number;\n}\n\n/** The positive finite step used at runtime and by keyboard stepping. */\nexport function effectiveStep(step: number): number {\n  return Number.isFinite(step) && step > 0 ? step : 1;\n}\n\n/**\n * Clamps a raw value and selects its nearest allowed value.\n *\n * The allowed set is the step grid plus each finite range endpoint. Keeping the\n * endpoints in that set makes an authored `aria-valuemin`/`aria-valuemax`\n * truthful even when the upper endpoint is not aligned to the grid. A value\n * exactly between two allowed values resolves upward.\n */\nexport function snapSteppedValue(raw: number, range: SteppedRange): number {\n  if (!(range.min <= range.max)) return finiteFallback(range.min, range.max);\n\n  const input = Number.isNaN(raw) ? finiteFallback(range.min, range.max) : raw;\n  const clamped = Math.min(range.max, Math.max(range.min, input));\n  const step = effectiveStep(range.step);\n  const base = stepBase(range);\n  const candidates: number[] = [];\n\n  if (Number.isFinite(range.min)) candidates.push(range.min);\n  if (Number.isFinite(range.max)) candidates.push(range.max);\n\n  const gridPosition = (clamped - base) / step;\n  if (Number.isFinite(gridPosition)) {\n    addGridCandidate(candidates, Math.floor(gridPosition), range, base, step);\n    addGridCandidate(candidates, Math.ceil(gridPosition), range, base, step);\n  }\n\n  if (candidates.length === 0) return clamped;\n  let nearest = candidates[0] as number;\n  let nearestDistance = Math.abs(clamped - nearest);\n  for (const candidate of candidates.slice(1)) {\n    const distance = Math.abs(clamped - candidate);\n    if (\n      distance < nearestDistance ||\n      (nearlyEqual(distance, nearestDistance) && candidate > nearest)\n    ) {\n      nearest = candidate;\n      nearestDistance = distance;\n    }\n  }\n  return nearest;\n}\n\n/**\n * Moves through the ordered allowed-value set by an integer number of steps.\n *\n * This differs from adding `step * count` and snapping afterward at an\n * off-grid endpoint: with `max=94, step=10`, one decrement from `94` must land\n * on `90`, and one increment from `90` must reach the advertised maximum `94`.\n */\nexport function stepSteppedValue(current: number, count: number, range: SteppedRange): number {\n  const value = snapSteppedValue(current, range);\n  const distance = Math.abs(Math.trunc(count));\n  if (!Number.isFinite(distance) || distance === 0) return value;\n  const direction = Math.sign(count);\n  const adjacent = adjacentSteppedValue(value, direction, range);\n\n  // The first move accounts for a possibly off-grid endpoint. From there a\n  // direct grid jump is equivalent to repeated adjacency, and avoids work that\n  // grows with Page-step magnitudes or programmatic counts.\n  const raw = adjacent + direction * (distance - 1) * effectiveStep(range.step);\n  return snapSteppedValue(raw, range);\n}\n\n/** Returns the next member of the ordered endpoint-plus-grid set. */\nfunction adjacentSteppedValue(current: number, direction: number, range: SteppedRange): number {\n  const step = effectiveStep(range.step);\n  const base = stepBase(range);\n  const candidates: number[] = [];\n\n  if (direction > 0) {\n    const position = (current - base) / step;\n    if (Number.isFinite(position)) {\n      let gridIndex = Math.floor(position) + 1;\n      let candidate = cleanGridValue(base + gridIndex * step, base, step);\n      if (candidate < current || nearlyEqual(candidate, current)) {\n        gridIndex += 1;\n        candidate = cleanGridValue(base + gridIndex * step, base, step);\n      }\n      if (\n        candidate > current &&\n        !nearlyEqual(candidate, current) &&\n        within(candidate, range.min, range.max)\n      ) {\n        candidates.push(clamp(candidate, range));\n      }\n    }\n    return clamp(Math.min(...candidates), range);\n  }\n\n  const position = (current - base) / step;\n  if (Number.isFinite(position)) {\n    let gridIndex = Math.ceil(position) - 1;\n    let candidate = cleanGridValue(base + gridIndex * step, base, step);\n    if (candidate > current || nearlyEqual(candidate, current)) {\n      gridIndex -= 1;\n      candidate = cleanGridValue(base + gridIndex * step, base, step);\n    }\n    if (\n      candidate < current &&\n      !nearlyEqual(candidate, current) &&\n      within(candidate, range.min, range.max)\n    ) {\n      candidates.push(clamp(candidate, range));\n    }\n  }\n  return clamp(Math.max(...candidates), range);\n}\n\n/** Adds one grid value when it falls inside the inclusive range. */\nfunction addGridCandidate(\n  candidates: number[],\n  index: number,\n  range: SteppedRange,\n  base: number,\n  step: number,\n): void {\n  const candidate = cleanGridValue(base + index * step, base, step);\n  if (within(candidate, range.min, range.max)) candidates.push(clamp(candidate, range));\n}\n\n/** A finite authored base wins; otherwise the finite lower bound or zero does. */\nfunction stepBase(range: SteppedRange): number {\n  if (range.base !== undefined && Number.isFinite(range.base)) return range.base;\n  return Number.isFinite(range.min) ? range.min : 0;\n}\n\n/** Removes binary noise without discarding significant integer-place digits. */\nfunction cleanGridValue(value: number, base: number, step: number): number {\n  const precision = Math.max(decimalPlaces(base), decimalPlaces(step));\n  // `toFixed` accepts at most 100 fractional digits. Below that limit it rounds\n  // according to the authored grid precision rather than an arbitrary total\n  // significant-digit count, which keeps unit steps distinct at large bases.\n  return precision <= 100 ? Number(value.toFixed(precision)) : value;\n}\n\n/** Number of fractional decimal places represented by a finite JS number. */\nfunction decimalPlaces(value: number): number {\n  const [coefficient = \"\", exponentText] = Math.abs(value).toString().toLowerCase().split(\"e\");\n  const fractionLength = coefficient.split(\".\")[1]?.length ?? 0;\n  const exponent = exponentText === undefined ? 0 : Number(exponentText);\n  return Math.max(0, fractionLength - exponent);\n}\n\n/** Inclusive range check tolerant only of arithmetic noise at an endpoint. */\nfunction within(value: number, min: number, max: number): boolean {\n  return (value > min || nearlyEqual(value, min)) && (value < max || nearlyEqual(value, max));\n}\n\n/** Clamps a candidate whose only overshoot may be floating-point noise. */\nfunction clamp(value: number, range: SteppedRange): number {\n  return Math.min(range.max, Math.max(range.min, value));\n}\n\n/** Relative comparison used only to collapse arithmetic noise, not real steps. */\nfunction nearlyEqual(left: number, right: number): boolean {\n  const scale = Math.max(Math.abs(left), Math.abs(right));\n  return (\n    Number.isFinite(left) &&\n    Number.isFinite(right) &&\n    Math.abs(left - right) <= Number.EPSILON * scale\n  );\n}\n\n/** Stable fallback for malformed ranges or `NaN` input. */\nfunction finiteFallback(min: number, max: number): number {\n  if (Number.isFinite(min)) return min;\n  if (Number.isFinite(max)) return max;\n  return 0;\n}\n","import { Controller } from \"@hotwired/stimulus\";\nimport { hasModifierChord, isReservedArrowChord } from \"../utils/arrow_step\";\nimport { AttributeLease } from \"../utils/attribute_lease\";\nimport { MorphRenderWatcher } from \"../utils/morph_render_watcher\";\nimport { NUMBER_BOUNDS, type NumberValueConstraints } from \"../utils/number_bounds\";\nimport { NumberValueReader } from \"../utils/number_value\";\nimport { type SteppedRange, snapSteppedValue, stepSteppedValue } from \"../utils/stepped_value\";\n\nconst DEFAULT_MIN = 0;\nconst DEFAULT_MAX = 100;\n\n/**\n * Headless **Separator** behavior. The normative source depends on the case:\n * a decorative divider follows the WAI-ARIA `separator` role\n * (https://www.w3.org/TR/wai-aria-1.2/#separator), while the focusable,\n * value-bearing divider follows the APG Window Splitter pattern\n * (https://www.w3.org/WAI/ARIA/apg/patterns/windowsplitter/).\n *\n * Markup contract (identifier: `stimeo--separator`):\n *   <!-- decorative -->\n *   <div data-controller=\"stimeo--separator\"\n *        data-stimeo--separator-orientation-value=\"horizontal\"></div>\n *\n *   <!-- focusable, value-bearing -->\n *   <div data-controller=\"stimeo--separator\"\n *        aria-labelledby=\"sidebar-heading\" aria-controls=\"sidebar\"\n *        data-stimeo--separator-orientation-value=\"vertical\"\n *        data-stimeo--separator-focusable-value=\"true\"\n *        data-stimeo--separator-min-value=\"0\"\n *        data-stimeo--separator-max-value=\"100\"\n *        data-stimeo--separator-step-value=\"1\"\n *        data-stimeo--separator-value-value=\"50\"\n *        data-action=\"keydown->stimeo--separator#onKeydown\"></div>\n *\n * The Stimulus Values are the live inputs. The controller reflects them as\n * `role`, `tabindex`, `aria-orientation`, and the range ARIA while connected,\n * then restores the attributes it displaced on disconnect. Existing finite\n * range ARIA is hydrated into otherwise absent Values once, which preserves\n * progressively enhanced server markup without leaving two live sources of\n * truth. That fill is the one write\n * `connect()` makes to a Value: a declared Value is never overwritten, and the\n * normalized value is published through `aria-valuenow` without being written\n * back.\n *\n * `change` and `reconcile` dispatch `{ value: number }`.\n *\n * @remarks\n * Behavior only — line drawing is the consumer's CSS. The axis follows Window\n * Splitter: a vertical divider takes ArrowLeft/ArrowRight, a horizontal one\n * takes ArrowUp/ArrowDown. Which end counts as an increase is not defined\n * there, so it follows the slider convention (ArrowRight/ArrowUp increase).\n * Home/End are optional in the pattern and are implemented here; F6 is not.\n *\n * A maximum below the effective minimum collapses to that minimum; non-finite\n * bounds use `0`/`100`, and an invalid or non-positive step uses `1`. Finite\n * endpoints remain reachable even when they do not align to the step grid.\n * `change` reports a key the user pressed that left the value somewhere other\n * than the value last published. Runtime Value changes — a Turbo morph or\n * application code — repaint once per batch, and when they move the value a\n * focusable separator publishes, `reconcile` reports it with the same detail,\n * so a consumer can tell its user's move from the page's. A key handled before\n * a page write is repainted reads the written value, so its `change` covers the\n * write as well, and a key that ends on the value last published reports\n * nothing. A key dispatched from script runs every listener with no microtask\n * between them, so a write made just before it, or by a listener that runs\n * ahead of the separator, is handled that way. A key the browser dispatches\n * runs microtasks between the listeners it calls separately, so a write made\n * by one called ahead of the separator's — a capture listener on an ancestor or\n * on `document`, a `:capture` action, or a listener added to the separator\n * before its action was bound — is repainted, and reported as `reconcile`,\n * before the key is measured from it. Stimulus calls the actions an element\n * declares for one event and one set of listener options from a single\n * listener, in declaration order, so a write made by an action declared before\n * the separator's own is handled like a write within a key dispatched from\n * script. A decorative\n * separator publishes no value and reports nothing; one that becomes focusable\n * again reports a value that moved meanwhile. Connecting reports neither.\n *\n * Because no position is ever applied here, two Window Splitter requirements\n * fall to the consumer: `aria-controls` naming the **primary** pane — the one\n * whose size the value reports — and `Enter` to toggle collapse/restore, since\n * collapsing applies a position — `stimeo--resizable` implements that\n * key for the same divider. Because the increment direction is fixed, the\n * primary pane can only be the left one for a vertical splitter and the bottom\n * one for a horizontal splitter: those are the panes that grow as\n * ArrowRight/ArrowUp raise the value.\n */\nexport class SeparatorController extends Controller<HTMLElement> {\n  /** Numeric read boundaries share one reader for this controller instance. */\n  readonly #numbers = new NumberValueReader();\n\n  static override values = {\n    orientation: { type: String, default: \"horizontal\" },\n    focusable: { type: Boolean, default: false },\n    min: { type: Number, default: DEFAULT_MIN },\n    max: { type: Number, default: DEFAULT_MAX },\n    step: { type: Number, default: 1 },\n    value: { type: Number, default: DEFAULT_MIN },\n  };\n\n  static valueConstraints = {\n    min: NUMBER_BOUNDS.finite,\n    max: NUMBER_BOUNDS.finite,\n    step: NUMBER_BOUNDS.positive,\n    value: NUMBER_BOUNDS.finite,\n  } satisfies NumberValueConstraints<typeof SeparatorController.values>;\n  static actions = [\"onKeydown\"] as const;\n  static events = [\"change\", \"reconcile\"] as const;\n\n  declare orientationValue: string;\n  declare focusableValue: boolean;\n  declare minValue: number;\n  declare maxValue: number;\n  declare stepValue: number;\n  declare valueValue: number;\n\n  readonly #role = new AttributeLease<HTMLElement>(\"role\", this.identifier);\n  readonly #tabindex = new AttributeLease<HTMLElement>(\"tabindex\", this.identifier);\n  readonly #orientation = new AttributeLease<HTMLElement>(\"aria-orientation\", this.identifier);\n  readonly #minimum = new AttributeLease<HTMLElement>(\"aria-valuemin\", this.identifier);\n  readonly #maximum = new AttributeLease<HTMLElement>(\"aria-valuemax\", this.identifier);\n  readonly #current = new AttributeLease<HTMLElement>(\"aria-valuenow\", this.identifier);\n\n  /** Collapses a morph that changes several render Values into one repaint. */\n  readonly #repaint = new MorphRenderWatcher(() => this.#render());\n\n  /**\n   * The baseline a published value is compared with: the value last published\n   * through `aria-valuenow`, or `null` while this connection has published none.\n   * It moves to each value a key the user presses or a repaint publishes. While\n   * nothing is published — the separator is decorative — it keeps the last\n   * value published, so a value that moved meanwhile is reported once when the\n   * separator publishes again; one that connected decorative keeps `null`, so\n   * its first published value is only taken as the baseline.\n   */\n  #settled: number | null = null;\n\n  /**\n   * Hydrates authored range ARIA into absent Values once and renders them\n   * without writing the normalized value back. What the first render publishes\n   * is the baseline, so connecting reports nothing.\n   */\n  override connect(): void {\n    this.#hydrateValues();\n    this.#repaint.observe(this.element);\n    this.#settled = null;\n    this.#render();\n  }\n\n  /** Cancels repaint work and returns every semantic attribute this instance controlled. */\n  override disconnect(): void {\n    this.#repaint.disconnect();\n    this.#returnAttributes();\n  }\n\n  /** Repaints an orientation changed by application code or a Turbo morph. */\n  orientationValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Adds or removes the focusable range semantics at runtime. */\n  focusableValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a minimum changed by application code or a Turbo morph. */\n  minValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a maximum changed by application code or a Turbo morph. */\n  maxValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a step changed by application code or a Turbo morph. */\n  stepValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Repaints a current value changed by application code or a Turbo morph. */\n  valueValueChanged(): void {\n    this.#repaint.schedule();\n  }\n\n  /** Adjusts the value on arrow / Home / End keys (focusable variant only). */\n  onKeydown(event: KeyboardEvent): void {\n    if (isReservedArrowChord(event) || !this.focusableValue) return;\n    if ((event.key === \"Home\" || event.key === \"End\") && hasModifierChord(event)) return;\n\n    const horizontal = this.#effectiveOrientation === \"horizontal\";\n    const range = this.#effectiveRange;\n    // Stepping snaps the declaration onto the value it publishes before moving.\n    const declared = this.#safeValue;\n    let next: number | null = null;\n    switch (event.key) {\n      case \"ArrowUp\":\n        if (horizontal) next = stepSteppedValue(declared, 1, range);\n        break;\n      case \"ArrowDown\":\n        if (horizontal) next = stepSteppedValue(declared, -1, range);\n        break;\n      case \"ArrowRight\":\n        if (!horizontal) next = stepSteppedValue(declared, 1, range);\n        break;\n      case \"ArrowLeft\":\n        if (!horizontal) next = stepSteppedValue(declared, -1, range);\n        break;\n      case \"Home\":\n        next = range.min;\n        break;\n      case \"End\":\n        next = range.max;\n        break;\n      default:\n        return;\n    }\n    if (next === null) return;\n\n    event.preventDefault();\n    this.#commit(next);\n  }\n\n  /**\n   * Stores a normalized user value, renders immediately, and reports it as\n   * `change` when it differs from the value last published. The comparison is\n   * with the value last published, not with the value the key started from, so\n   * a page write no repaint has published yet is reported once, as this change,\n   * and a key that ends where the value was last published reports nothing. The\n   * baseline moves before the render and the report, so neither the repaint the\n   * Value write schedules nor a move a subscriber makes while `change` is\n   * dispatched is measured from the value this key replaced.\n   */\n  #commit(raw: number): void {\n    const value = snapSteppedValue(raw, this.#effectiveRange);\n    const reported = this.#settled;\n    this.#settled = value;\n    if (!Object.is(this.valueValue, value)) this.valueValue = value;\n    this.#render();\n    if (value !== reported) this.dispatch(\"change\", { detail: { value } });\n  }\n\n  /**\n   * Reflects live Values into the connected element without writing them back,\n   * then compares what it published with the baseline. A decorative separator\n   * publishes no value (`null` here): the baseline stays the last value\n   * published. A value is reported once as `reconcile` only when it moved from a\n   * published baseline, so the first value a connection publishes is only taken\n   * as the baseline.\n   *\n   * @stimeoRenderRoot\n   */\n  #render(): void {\n    const range = this.#effectiveRange;\n    const focusable = this.focusableValue;\n    const published = focusable ? snapSteppedValue(this.#safeValue, range) : null;\n    this.#role.write(this.element, \"separator\");\n    this.#orientation.write(this.element, this.#effectiveOrientation);\n    this.#tabindex.write(this.element, focusable ? \"0\" : null);\n    this.#minimum.write(this.element, focusable ? String(range.min) : null);\n    this.#maximum.write(this.element, focusable ? String(range.max) : null);\n    this.#current.write(this.element, published === null ? null : String(published));\n\n    const previous = this.#settled;\n    if (published !== null) this.#settled = published;\n    if (previous !== null && published !== null && published !== previous) {\n      this.dispatch(\"reconcile\", { detail: { value: published } });\n    }\n  }\n\n  /** Effective orientation; unknown strings fall back to the horizontal contract. */\n  get #effectiveOrientation(): \"horizontal\" | \"vertical\" {\n    return this.orientationValue === \"vertical\" ? \"vertical\" : \"horizontal\";\n  }\n\n  /** Finite, ordered range shared by rendering and keyboard stepping. */\n  get #effectiveRange(): SteppedRange {\n    const min = this.#safeMin;\n    const candidateMax = this.#safeMax;\n    return {\n      min,\n      max: Math.max(min, candidateMax),\n      step: this.#safeStep,\n      base: min,\n    };\n  }\n\n  /**\n   * Copies valid authored ARIA into Values only when no explicit Value exists.\n   * This fill is the one Value write `connect()` makes: it never overwrites a\n   * declaration, and no Value callback runs it, so a declaration the page\n   * changes later is only ever read.\n   */\n  #hydrateValues(): void {\n    if (!this.#hasInput(\"orientation\")) {\n      const orientation = this.element.getAttribute(\"aria-orientation\");\n      if (orientation === \"horizontal\" || orientation === \"vertical\") {\n        this.orientationValue = orientation;\n      }\n    }\n\n    const min = this.#finiteAttribute(\"aria-valuemin\");\n    if (!this.#hasInput(\"min\") && min !== null) this.minValue = min;\n    const max = this.#finiteAttribute(\"aria-valuemax\");\n    if (!this.#hasInput(\"max\") && max !== null) this.maxValue = max;\n    const value = this.#finiteAttribute(\"aria-valuenow\");\n    if (!this.#hasInput(\"value\") && value !== null) this.valueValue = value;\n  }\n\n  /** Whether the author supplied the namespaced Value instead of using its default. */\n  #hasInput(name: \"orientation\" | \"min\" | \"max\" | \"value\"): boolean {\n    return this.element.hasAttribute(`data-${this.identifier}-${name}-value`);\n  }\n\n  /** Strict finite-number parser for the one-time progressive-enhancement bridge. */\n  #finiteAttribute(name: string): number | null {\n    const raw = this.element.getAttribute(name);\n    if (raw === null || raw.trim() === \"\") return null;\n    const value = Number(raw);\n    return Number.isFinite(value) ? value : null;\n  }\n\n  /** Returns attributes without overwriting values a consumer changed after render. */\n  #returnAttributes(): void {\n    this.#role.return(this.element);\n    this.#tabindex.return(this.element);\n    this.#orientation.return(this.element);\n    this.#minimum.return(this.element);\n    this.#maximum.return(this.element);\n    this.#current.return(this.element);\n  }\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      SeparatorController.values.min.default,\n      SeparatorController.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      SeparatorController.values.max.default,\n      SeparatorController.valueConstraints.max,\n    );\n  }\n\n  /** Current `step` declaration resolved against its numeric contract. */\n  get #safeStep(): number {\n    return this.#numbers.read(\n      this,\n      \"step\",\n      this.stepValue,\n      SeparatorController.values.step.default,\n      SeparatorController.valueConstraints.step,\n    );\n  }\n\n  /** Current `value` declaration resolved against its numeric contract. */\n  get #safeValue(): number {\n    return this.#numbers.read(\n      this,\n      \"value\",\n      this.valueValue,\n      this.#effectiveRange.min,\n      SeparatorController.valueConstraints.value,\n    );\n  }\n}\n"]}

package/dist/controllers/sidebar_controller.d.ts

@@ -24,7 +24,7 @@ import { Controller } from '@hotwired/stimulus';
  * No dedicated APG pattern: the base is **Disclosure** (the trigger's
  * `aria-expanded` controls the panel's expanded state) and, *below* the
  * `breakpoint`, it borrows the **Dialog (Modal)** focus behavior via the shared
- * `FocusTrap` (the same trap used by dialog / alert-dialog / drawer).
+ * `FocusTrap`.
  *
  * Above the breakpoint it is an **inline**, non-modal element that toggles
  * `expanded`↔`collapsed` (a rail), persisting that preference in `localStorage`.
@@ -42,8 +42,15 @@ import { Controller } from '@hotwired/stimulus';
  * applied — the sidebar stays an `<aside>`/`<nav>` landmark and only borrows the
  * modal *behavior*, because `role="dialog"` would replace that landmark.
  * The collapsed preference persists across Turbo navigations and full reloads;
- * the transient overlay-open state never persists, so "back/forward" never
- * restores a stuck-open menu.
+ * the transient overlay-open state never persists: a page Turbo restores from its
+ * cache connects with the overlay closed, so "back/forward" never restores a
+ * stuck-open menu, whenever the copy was taken. A page that stays keeps an open overlay
+ * open, through `turbo:before-cache` (which Turbo also dispatches on pages that stay) and
+ * through a reconnect of the same instance (an in-page move, a `data-turbo-permanent`
+ * element carried to the next page), which takes the trap again, and through a Turbo
+ * morph, after which the mode and the state this instance holds are written back over
+ * the server's markup. The `collapsed` Value only seeds a connect that neither a saved
+ * preference nor the panel's `data-state` decides; a later declaration moves nothing.
  *
  * Each move of the panel's expanded state is reported: `stimeo--sidebar:open`
  * and `stimeo--sidebar:close` dispatch
@@ -52,11 +59,13 @@ import { Controller } from '@hotwired/stimulus';
  * and `aria-expanded` are written, without waiting for the exit transition. A
  * responsive mode change re-derives the state instead of the user moving it, so
  * it reports `stimeo--sidebar:reconcile` with
- * `{ mode: "inline" | "overlay", open: boolean }` and no reason. All three are
+ * `{ mode: "inline" | "overlay", open: boolean }` and no reason; so does a `key`
+ * rewritten after connect whose saved preference moves the inline rail. All three are
  * informational, so none is cancelable. A call that leaves the state where it
  * already was, the normalization in {@link connect}, the reconciliation that
- * follows panel churn, the `turbo:before-cache` sanitization, and
- * {@link disconnect} are all silent. A close the backdrop asked for reports
+ * follows panel, trigger or backdrop churn, and {@link disconnect} are all silent,
+ * and after {@link disconnect} the actions do nothing until the controller connects
+ * again. A close the backdrop asked for reports
  * `"outside"`: the backdrop carries no action of its own, so
  * {@link SidebarController.close | close} is what the consumer wires onto it and it
  * recognises that target.
@@ -78,23 +87,65 @@ declare class SidebarController extends Controller<HTMLElement> {
             default: boolean;
         };
     };
+    static valueConstraints: {
+        breakpoint: {
+            readonly finite: true;
+            readonly min: 0;
+        };
+    };
     static actions: readonly ["close", "open", "toggle"];
     static events: readonly ["close", "open", "reconcile"];
     readonly triggerTarget: HTMLElement;
+    readonly triggerTargets: HTMLElement[];
     readonly panelTarget: HTMLElement;
+    readonly panelTargets: HTMLElement[];
     readonly backdropTarget: HTMLElement;
+    readonly backdropTargets: HTMLElement[];
     readonly hasTriggerTarget: boolean;
     readonly hasPanelTarget: boolean;
     readonly hasBackdropTarget: boolean;
     breakpointValue: number;
     keyValue: string;
     collapsedValue: boolean;
+    /**
+     * Restores the inline preference and starts the overlay closed, silently. A reconnect of
+     * this instance that finds its overlay still open in overlay mode keeps it open and takes
+     * the trap again.
+     */
     connect(): void;
     disconnect(): void;
-    /** Adopts a panel target added by a Turbo morph after the controller connected. */
+    /**
+     * Adopts a panel target that arrives while no owned panel is on the page. The owned panel
+     * moving within the element arrives here too, and stays owned as it is.
+     */
     panelTargetConnected(panel: HTMLElement): void;
-    /** Closes and releases overlay side effects when the actively trapped panel disappears. */
+    /**
+     * Gives a panel that no longer resolves as a target its own `data-mode`, `data-state` and
+     * `hidden` back — after `disconnect()` too, since dropping the identifier leaves the element
+     * on the page. When the owned panel leaves, or a move puts another panel in front of it,
+     * the overlay closes and the panel now first is adopted: an open one takes the modal trap
+     * over in place, and otherwise, or with no panel left, the side effects are released. A
+     * move that keeps the owned panel first changes nothing. After {@link disconnect} nothing
+     * is adopted: a panel still owned once a handler disconnected the controller writes the
+     * overlay closed and releases the modal side effects as it leaves.
+     */
     panelTargetDisconnected(panel: HTMLElement): void;
+    /** Reflects the expanded state onto a trigger that arrives in front of the others. */
+    triggerTargetConnected(): void;
+    /**
+     * Gives a trigger that no longer resolves as the target its own `aria-expanded` back — after
+     * `disconnect()` too, since dropping the identifier leaves the element on the page — and,
+     * while connected, reflects the expanded state onto the trigger left.
+     */
+    triggerTargetDisconnected(trigger: HTMLElement): void;
+    /** Reflects the overlay state onto a backdrop that arrives in front of the others. */
+    backdropTargetConnected(): void;
+    /**
+     * Gives a backdrop that no longer resolves as the target its own `data-state` and `hidden`
+     * back — after `disconnect()` too — and, while connected, reflects the overlay state onto
+     * the backdrop left.
+     */
+    backdropTargetDisconnected(backdrop: HTMLElement): void;
     /**
      * Rebinds responsive observation when `breakpoint` changes at runtime.
      *
@@ -103,6 +154,12 @@ declare class SidebarController extends Controller<HTMLElement> {
      * existing listener instead of allocating duplicate `MediaQueryList` objects.
      */
     breakpointValueChanged(): void;
+    /**
+     * Follows a `key` rewritten after connect. A preference saved under the new key is
+     * applied — rendered and reported as `reconcile` inline, kept for the next inline
+     * render in overlay — and without one the state stays. Nothing is copied or written.
+     */
+    keyValueChanged(): void;
     /** Toggles the panel: inline flips collapsed/expanded, overlay flips open/closed. */
     toggle(event?: Event): void;
     /** Shows the panel (inline: expand; overlay: open). */