@weasel-js/geom 1.15.1 → 1.15.2

package/dist/chunk-OQP5M5VD.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/paths/cornerCarry.ts","../src/paths/cornerRestore.ts","../src/booleans/contourSegments.ts","../src/intersect/segmentIntersections.ts","../src/booleans/contours.ts","../src/booleans/cutRegions.ts"],"names":["u","folded","a","b","c","l","r"],"mappings":";;;;;AASA,IAAM,SAAA,uBAAgB,OAAA,EAAiC;AAQhD,SAAS,kBAAkB,IAAA,EAA+B;AAC/D,EAAA,MAAM,GAAA,GAAM,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA;AAC9B,EAAA,IAAI,KAAK,OAAO,GAAA;AAChB,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,IAAA;AAC7B,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,IAAI,IAAA,GAAO,CAAA,EAAG,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,CAAA;AACjC,EAAA,IAAI,EAAA,GAAK,GAAG,EAAA,GAAK,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,GAAK,GAAG,KAAA,GAAQ,KAAA;AAC5C,EAAA,cAAA,CAAe,QAAA,EAAU,MAAA,EAAQ,CAAC,GAAA,EAAK,EAAA,KAAO;AAC5C,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,IAAS,EAAA,KAAO,EAAA,IAAM,OAAO,EAAA,EAAI;AAAE,QAAA,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,GAAI,KAAA;AAAO,QAAA,IAAA,EAAA;AAAA,MAAQ;AACzF,MAAA,KAAA,GAAQ,CAAA;AACR,MAAA;AAAA,IACF;AACA,IAAA,MAAM,CAAA,GAAI,sBAAsB,GAAG,CAAA;AACnC,IAAA,EAAA,GAAK,MAAA,CAAO,EAAA,GAAK,CAAA,GAAI,CAAC,CAAA;AAAG,IAAA,EAAA,GAAK,MAAA,CAAO,EAAA,GAAK,CAAA,GAAI,CAAC,CAAA;AAC/C,IAAA,KAAA,GAAQ,GAAA,KAAQ,UAAU,GAAA,KAAQ,MAAA;AAClC,IAAA,IAAI,GAAA,KAAQ,MAAA,IAAU,KAAA,KAAU,CAAA,EAAG;AAAE,MAAA,KAAA,GAAQ,IAAA;AAAM,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,EAAA,GAAK,EAAA;AAAI,MAAA,KAAA,GAAQ,CAAA;AAAA,IAAG;AAChF,IAAA,KAAA,EAAA;AACA,IAAA,GAAA,CAAI,KAAK,IAAA,EAAM,CAAA;AAAA,EACjB,CAAC,CAAA;AACD,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA;AAClC,EAAA,SAAA,CAAU,GAAA,CAAI,MAAM,MAAM,CAAA;AAC1B,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,YAAA,CAAa,IAAA,EAAmB,EAAA,EAAiB,OAAA,EAAyC;AACxG,EAAA,MAAM,IAAA,GAAO,eAAe,EAAE,CAAA;AAC9B,EAAA,MAAM,QAAQ,IAAA,CAAK,OAAA;AACnB,EAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AACnB,EAAA,MAAM,QAAA,GAAW,kBAAkB,IAAI,CAAA;AACvC,EAAA,MAAM,MAAA,GAAS,kBAAkB,EAAE,CAAA;AACnC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,MAAM,OAA8B,EAAC;AACrC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACtC,IAAA,MAAM,CAAA,GAAI,QAAQ,CAAC,CAAA;AACnB,IAAA,IAAI,MAAM,MAAA,IAAa,CAAA,GAAI,CAAA,IAAK,CAAA,IAAK,SAAS,MAAA,EAAQ;AACtD,IAAA,MAAM,CAAA,GAAI,SAAS,CAAC,CAAA;AACpB,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,IAAI,CAAC,IAAA,IAAQ,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,EAAG;AAC5B,IAAA,MAAA,CAAO,IAAI,CAAC,CAAA;AACZ,IAAA,OAAO,KAAK,MAAA,GAAS,MAAA,CAAO,CAAC,CAAA,EAAG,IAAA,CAAK,KAAK,IAAI,CAAA;AAC9C,IAAA,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,CAAA,GAAI,IAAA;AAAA,EACpB;AACA,EAAA,MAAM,OAAA,GAAU,eAAe,IAAI,CAAA;AACnC,EAAA,OAAO,OAAA,GAAU,EAAE,GAAG,IAAA,EAAM,SAAQ,GAAI,IAAA;AAC1C;AAIO,SAAS,WAAA,CAAY,OAAe,KAAA,EAA2B;AACpE,EAAA,MAAM,GAAA,GAAM,IAAI,UAAA,CAAW,KAAK,CAAA;AAChC,EAAA,KAAA,IAAS,CAAA,GAAI,GAAG,CAAA,GAAI,KAAA,EAAO,KAAK,GAAA,CAAI,CAAC,IAAI,KAAA,GAAQ,CAAA;AACjD,EAAA,OAAO,GAAA;AACT;;;AC/CO,IAAM,wBAAA,GAA2B;AAGjC,SAAS,aAAa,IAAA,EAA2B;AACtD,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,SAAA,EAAW,OAAO,EAAC;AACrC,EAAA,OAAO,WAAW,IAAI,CAAA,CAAE,IAAI,CAAC,EAAE,QAAQ,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,MAAA,QAAc,EAAE,MAAA,EAAQ,MAAM,KAAA,EAAO,GAAA,EAAK,QAAO,CAAE,CAAA;AAC9G;AAQO,SAAS,WAAA,CAAY,OAAA,EAA0B,MAAA,EAAqB,SAAA,GAAY,wBAAA,EAAuC;AAC5H,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,OAAA,CAAQ,YAAY,CAAA;AAC3C,EAAA,OAAO,OAAO,MAAA,KAAW,CAAA,GAAI,SAAS,cAAA,CAAe,MAAA,EAAQ,QAAQ,SAAS,CAAA;AAChF;AAEA,SAAS,OAAA,CAAQ,CAAA,EAAU,CAAA,EAAgB,GAAA,EAAsB;AAC/D,EAAA,IAAI,OAAO,CAAA,CAAE,KAAA;AACb,EAAA,KAAA,MAAW,KAAA,IAAS,EAAE,MAAA,EAAQ;AAC5B,IAAA,MAAM,CAAA,GAAI,MAAM,IAAA,KAAS,MAAA,GACrB,cAAc,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,EAAG,IAAA,CAAK,CAAA,EAAG,KAAK,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,EAAG,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,IAAA,GAChE,cAAA,CAAe,CAAA,CAAE,CAAA,EAAG,EAAE,CAAA,EAAG,IAAA,CAAK,GAAG,IAAA,CAAK,CAAA,EAAG,MAAM,EAAA,CAAG,CAAA,EAAG,KAAA,CAAM,EAAA,CAAG,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,EAAG,KAAA,CAAM,GAAG,CAAA,EAAG,KAAA,CAAM,EAAA,CAAG,CAAC,CAAA,CAAE,IAAA;AACrH,IAAA,IAAI,CAAA,IAAK,KAAK,OAAO,IAAA;AACrB,IAAA,IAAA,GAAO,KAAA,CAAM,EAAA;AAAA,EACf;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,OAAA,CAAQ,CAAA,EAAQ,CAAA,EAAW,CAAA,EAAW,CAAA,EAAkB;AAC/D,EAAA,MAAM,CAAA,GAAI,UAAU,CAAA,CAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAC,CAAA,EAAG,CAAA,GAAI,SAAA,CAAU,CAAA,CAAE,IAAI,CAAA,CAAE,EAAA,EAAI,CAAC,CAAA,EAAG,CAAA,GAAI,UAAU,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAC,CAAA;AAC7F,EAAA,MAAM,CAAA,GAAI,SAAA,CAAU,CAAA,EAAG,CAAA,EAAG,CAAC,GAAG,CAAA,GAAI,SAAA,CAAU,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AACnD,EAAA,OAAO,SAAA,CAAU,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAC1B;AAIA,SAAS,QAAA,CAAS,CAAA,EAAQ,MAAA,EAAe,IAAA,EAAa,GAAA,EAA4B;AAChF,EAAA,MAAM,KAAK,CAACA,EAAAA,KAAc,QAAQ,CAAA,EAAGA,EAAAA,EAAGA,IAAGA,EAAC,CAAA;AAC5C,EAAA,MAAM,EAAA,GAAK,CAACA,EAAAA,KAAqB;AAC/B,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAGA,EAAAA,EAAGA,EAAAA,EAAG,CAAC,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAGA,EAAAA,EAAGA,EAAAA,EAAG,CAAC,CAAA;AACrD,IAAA,OAAO,EAAE,CAAA,EAAG,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAI,CAAA,EAAG,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,EAAG;AAAA,EAClD,CAAA;AACA,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,EAAA,CAAG,IAAI,EAAE,CAAA,EAAG,EAAA,CAAG,IAAI,CAAA,CAAE,CAAC,CAAA;AAC/C,EAAA,IAAI,KAAA,KAAU,GAAG,OAAO,IAAA;AACxB,EAAA,IAAI,CAAA,GAAI,IAAA,GAAA,CAAQ,IAAA,KAAS,CAAA,GAAI,CAAA,GAAI,EAAA,IAAM,QAAA,CAAS,EAAA,CAAG,IAAI,CAAA,EAAG,MAAM,CAAA,GAAI,KAAA;AACpE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA,EAAK;AAC3B,IAAA,MAAM,IAAI,EAAA,CAAG,CAAC,CAAA,EAAG,CAAA,GAAI,GAAG,CAAC,CAAA;AACzB,IAAA,MAAM,KAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AAC/B,IAAA,IAAI,OAAO,CAAA,EAAG;AACd,IAAA,CAAA,IAAA,CAAA,CAAO,CAAA,CAAE,CAAA,GAAI,MAAA,CAAO,CAAA,IAAK,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,MAAA,CAAO,CAAA,IAAK,CAAA,CAAE,CAAA,IAAK,EAAA;AAAA,EAC3D;AACA,EAAA,OAAO,SAAS,EAAA,CAAG,CAAC,GAAG,MAAM,CAAA,IAAK,MAAM,CAAA,GAAI,IAAA;AAC9C;AAIA,SAAS,QAAA,CAAS,CAAA,EAAQ,KAAA,EAA0B,GAAA,EAAwB,GAAA,EAAyB;AACnG,EAAA,MAAM,KAAK,KAAA,IAAS,CAAA,CAAE,EAAA,EAAI,EAAA,GAAK,OAAO,CAAA,CAAE,EAAA;AACxC,EAAA,IAAI,CAAA,CAAE,IAAA,EAAM,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAG;AACxD,EAAA,MAAM,KAAK,KAAA,GAAQ,QAAA,CAAS,GAAG,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA,GAAI,CAAA;AAChD,EAAA,MAAM,KAAK,GAAA,GAAM,QAAA,CAAS,GAAG,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA,GAAI,CAAA;AAC5C,EAAA,IAAI,EAAA,KAAO,IAAA,IAAQ,EAAA,KAAO,IAAA,EAAM,OAAO,IAAA;AACvC,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,IAAI,EAAA,EAAI,OAAA,CAAQ,GAAG,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA,EAAG,IAAI,OAAA,CAAQ,CAAA,EAAG,IAAI,EAAA,EAAI,EAAE,GAAG,EAAA,EAAG;AACvF;AAQA,SAAS,OAAA,CAAQ,CAAA,EAAU,IAAA,EAAW,CAAA,EAAU,GAAgB,GAAA,EAAsB;AACpF,EAAA,IAAI,QAAA,CAAS,CAAA,EAAG,CAAC,CAAA,IAAK,KAAK,OAAO,IAAA;AAClC,EAAA,OAAO,IAAA,CAAK,IAAA,IAAQ,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,IAChC,aAAA,CAAc,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,EAAG,KAAK,EAAA,CAAG,CAAA,EAAG,IAAA,CAAK,EAAA,CAAG,CAAA,EAAG,IAAA,CAAK,EAAA,CAAG,CAAA,EAAG,IAAA,CAAK,EAAA,CAAG,CAAC,CAAA,CAAE,IAAA,IAAQ,GAAA;AACnF;AAEA,SAAS,OAAA,CAAQ,CAAA,EAAY,CAAA,EAAgB,GAAA,EAAyB;AACpE,EAAA,MAAM,CAAA,GAAI,EAAE,OAAA,CAAQ,MAAA;AACpB,EAAA,KAAA,IAAS,IAAI,CAAA,CAAE,MAAA,GAAS,IAAI,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AACzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,CAAC,CAAC,CAAA,CAAE,KAAA,EAAO,CAAA,CAAE,GAAG,GAAG,CAAC,CAAA,CAAE,KAAK,CAAA,CAAE,KAAK,CAAC,CAAA,EAAY;AACzE,MAAA,IAAI,CAAC,OAAA,CAAQ,CAAA,CAAE,OAAA,CAAQ,CAAC,GAAG,CAAA,CAAE,IAAA,CAAA,CAAM,CAAA,GAAI,CAAA,GAAI,KAAK,CAAC,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA,EAAG;AACpE,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,KAAA,GAAQ,CAAA,EAAG,QAAQ,CAAA,CAAE,IAAA,CAAK,MAAA,EAAQ,CAAA,EAAA,EAAK,KAAA,EAAA,EAAS;AAClE,QAAA,IAAI,CAAC,CAAA,CAAE,MAAA,IAAU,CAAA,IAAK,IAAI,CAAA,EAAG;AAC7B,QAAA,MAAM,CAAA,GAAI,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAI,CAAC,CAAA;AACzB,QAAA,MAAM,GAAA,GAAM,CAAA,CAAE,IAAA,CAAA,CAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAC9B,QAAA,IAAI,CAAC,GAAA,CAAI,IAAA,IAAQ,CAAC,OAAA,CAAQ,OAAA,CAAQ,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAG,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG;AAChE,QAAA,IAAI,QAAQ,CAAA,EAAG,CAAA,CAAE,KAAK,CAAA,GAAI,CAAC,GAAG,IAAA,EAAM,CAAA,EAAG,GAAG,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,CAAA,EAAG,IAAI,CAAA,GAAI,CAAA,EAAG,OAAO,CAAA,EAAE;AACnF,QAAA,IAAI,CAAC,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAGA,SAAS,OAAA,CAAQ,KAAU,CAAA,EAAqB;AAC9C,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,IAAI,GAAA,CAAI,IAAA,IAAQ,CAAA,GAAA,CAAK,CAAA,GAAI,KAAK,CAAA,EAAG;AACxC,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,IAAA,IAAI,CAAA,KAAM,GAAA,CAAI,EAAA,EAAI,OAAO,GAAA;AAAA,EAC3B;AACF;AAMA,SAAS,WAAA,CAAY,CAAA,EAAY,IAAA,EAAsB,KAAA,EAAuC,GAAA,EAA6B;AACzH,EAAA,MAAM,CAAA,GAAI,EAAE,OAAA,CAAQ,MAAA;AACpB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAiB;AACnC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAC/B,EAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,IAAA,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,GAAG,CAAA;AACvB,IAAA,KAAA,MAAW,KAAK,OAAA,CAAQ,GAAA,EAAK,CAAC,CAAA,EAAG,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EAC/C;AACA,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,EAAE,MAAA,EAAQ;AACZ,IAAA,MAAM,IAAA,GAAO,CAAA,CAAE,OAAA,CAAQ,SAAA,CAAU,CAAC,EAAA,EAAI,CAAA,KAAM,CAAC,MAAA,CAAO,GAAA,CAAI,CAAC,CAAC,CAAA;AAC1D,IAAA,KAAA,GAAQ,IAAA,IAAQ,CAAA,GAAI,IAAA,GAAO,IAAA,CAAK,CAAC,CAAA,CAAG,IAAA;AAAA,EACtC;AACA,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,IAAS,IAAA,GAAO,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,OAAO,CAAA,IAAK;AACxC,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA;AACvB,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,GAAA,CAAI,KAAA,CAAM,QAAQ,IAAA,EAAM,GAAA,CAAI,KAAA,CAAM,IAAA,EAAM,CAAA;AACzD,MAAA,KAAA,CAAM,IAAA,CAAK,IAAI,EAAE,CAAA;AACjB,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAK,CAAC,CAAA,CAAE,MAAA;AAC7B,MAAA,IAAA,IAAQ,IAAA;AACR,MAAA,CAAA,GAAA,CAAK,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA;AAAA,IACrB,CAAA,MAAO;AACL,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAA,EAAG,IAAA,EAAM,KAAA,CAAM,CAAC,CAAA,IAAK,IAAA,EAAM,CAAA;AACvD,MAAA,KAAA,CAAM,KAAK,CAAC,CAAA;AACZ,MAAA,IAAA,EAAA;AACA,MAAA,CAAA,GAAA,CAAK,IAAI,CAAA,IAAK,CAAA;AAAA,IAChB;AAAA,EACF;AACA,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC7C,EAAA,MAAM,OAAc,EAAC;AACrB,EAAA,MAAM,QAAQ,CAAA,CAAE,MAAA,GAAS,KAAA,CAAM,MAAA,GAAS,MAAM,MAAA,GAAS,CAAA;AACvD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAA,EAAK;AAC9B,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,MAAM,SAAA,GAAY,QAAQ,GAAA,CAAI,IAAI,IAAI,KAAA,CAAM,CAAC,EAAG,EAAA,GAAK,MAAA;AACrD,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,GAAA,CAAA,CAAK,IAAA,GAAO,CAAA,IAAK,CAAC,CAAA,GAAI,KAAA,CAAA,CAAO,CAAA,GAAI,CAAA,IAAK,KAAA,CAAM,MAAM,EAAG,EAAA,GAAK,MAAA;AAChF,IAAA,MAAM,OAAA,GAAU,SAAS,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA,EAAI,SAAA,EAAW,SAAS,GAAG,CAAA;AAC/D,IAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AACrB,IAAA,IAAA,CAAK,KAAK,OAAO,CAAA;AAAA,EACnB;AACA,EAAA,OAAO,EAAE,KAAA,EAAO,IAAA,EAAM,MAAA,EAAQ,CAAA,CAAE,QAAQ,MAAA,EAAQ,CAAC,GAAG,IAAI,CAAA,EAAE;AAC5D;AAEA,SAAS,KAAA,CAAM,UAA8B,MAAA,EAAkC;AAC7E,EAAA,MAAM,CAAA,GAAI,IAAI,WAAA,EAAY;AAC1B,EAAA,IAAI,MAAA,CAAO,QAAQ,CAAA,CAAE,SAAA,CAAU,OAAO,MAAA,CAAO,CAAA,EAAG,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA;AAC/D,EAAA,MAAM,QAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,EAAE,KAAA,EAAO,IAAA,EAAM,MAAA,MAAY,QAAA,EAAU;AAC9C,IAAA,CAAA,CAAE,MAAA,CAAO,KAAA,CAAM,CAAC,CAAA,CAAG,EAAA,CAAG,GAAG,KAAA,CAAM,CAAC,CAAA,CAAG,EAAA,CAAG,CAAC,CAAA;AACvC,IAAA,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAG,IAAI,CAAA;AACzB,IAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACrB,MAAA,MAAM,EAAA,GAAK,KAAA,CAAA,CAAO,CAAA,GAAI,CAAA,IAAK,MAAM,MAAM,CAAA;AACvC,MAAA,MAAM,OAAA,GAAU,MAAA,IAAU,CAAA,KAAM,IAAA,CAAK,MAAA,GAAS,CAAA;AAC9C,MAAA,IAAI,OAAA,IAAW,EAAE,IAAA,EAAM;AACvB,MAAA,IAAI,CAAA,CAAE,MAAM,CAAA,CAAE,MAAA,CAAO,GAAG,EAAA,CAAG,CAAA,EAAG,EAAA,CAAG,EAAA,CAAG,CAAC,CAAA;AAAA,aAC9B,OAAA,CAAQ,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,EAAG,EAAA,CAAG,GAAG,CAAA,EAAG,EAAA,CAAG,GAAG,CAAC,CAAA;AAC/D,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,IAAI,CAAA;AAAA,IACpB,CAAC,CAAA;AACD,IAAA,IAAI,MAAA,IAAU,KAAA,EAAM;AAAA,EACtB;AACA,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,EAAE,KAAA,EAAM;AACrC,EAAA,MAAM,QAAqB,EAAE,GAAG,eAAe,MAAM,CAAA,EAAG,UAAU,MAAA,EAAO;AACzE,EAAA,MAAM,IAAA,GAAO,kBAAkB,KAAK,CAAA;AACpC,EAAA,MAAM,UAAiC,EAAC;AACxC,EAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM;AACzB,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,OAAO,QAAQ,MAAA,GAAS,IAAA,CAAK,CAAC,CAAA,EAAI,OAAA,CAAQ,KAAK,IAAI,CAAA;AACnD,IAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAE,CAAA,GAAI,IAAA;AAAA,EACtB,CAAC,CAAA;AACD,EAAA,MAAM,OAAA,GAAU,eAAe,OAAO,CAAA;AACtC,EAAA,OAAO,UAAU,EAAE,GAAG,KAAA,EAAO,OAAA,EAAS,SAAQ,GAAI,KAAA;AACpD;AAGA,SAAS,YAAA,CAAa,IAAA,EAAmB,GAAA,EAAa,MAAA,EAA0C;AAC9F,EAAA,MAAM,GAAA,GAAM,IAAI,GAAA,CAAI,MAAA,CAAO,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAC,CAAA;AAC9C,EAAA,KAAA,MAAW,GAAA,IAAO,UAAA,CAAW,IAAI,CAAA,EAAG;AAClC,IAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,MAAA,IAAI,SAAS,GAAA,CAAI,MAAA,EAAQ,CAAA,CAAE,MAAM,IAAI,GAAA,EAAK;AAC1C,MAAA,MAAM,IAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA,IAAK,GAAA,IAAO,QAAA,CAAS,GAAA,CAAI,GAAA,EAAK,CAAA,CAAE,GAAG,CAAA,IAAK,GAAA,IAC3E,QAAA,CAAS,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,GAAG,CAAA,IAAK,GAAA,IAAO,QAAA,CAAS,GAAA,CAAI,GAAA,EAAK,CAAA,CAAE,KAAK,CAAA,IAAK,GAAA;AACzE,MAAA,IAAI,IAAA,EAAM,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA;AAAA,IACxB;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AASO,SAAS,cAAA,CAAe,MAAA,EAAqB,MAAA,EAAgC,SAAA,GAAY,wBAAA,EAAuC;AACrI,EAAA,MAAM,QAAA,GAAW,eAAe,MAAM,CAAA;AACtC,EAAA,IAAI,CAAC,QAAA,IAAY,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,MAAA;AAC7C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAiB;AACtC,EAAA,KAAA,IAAS,OAAA,GAAU,CAAA,EAAG,OAAA,IAAW,MAAA,CAAO,QAAQ,OAAA,EAAA,EAAW;AACzD,IAAA,MAAM,UAAqB,EAAC;AAC5B,IAAA,KAAA,MAAW,KAAK,QAAA,EAAU;AACxB,MAAA,MAAM,OAAc,EAAC;AACrB,MAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,QAAA,IAAI,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAG;AACrB,QAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,SAAS,CAAA;AACnC,QAAA,IAAI,CAAC,GAAA,EAAK;AACV,QAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAK,CAAA,CAAE,QAAQ,MAAM,CAAA;AAC1C,QAAA,IAAI,IAAA,CAAK,KAAK,CAAC,CAAA,KAAM,KAAK,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG;AACnC,QAAA,IAAA,CAAK,QAAQ,CAAC,CAAA,KAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AAC/B,QAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AAAA,MACf;AACA,MAAA,MAAM,KAAA,GAAQ,CAAA,CAAE,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAI,CAAA,KAAM,MAAA,CAAO,OAAA,GAAU,CAAA,CAAE,KAAA,GAAQ,CAAC,KAAK,IAAI,CAAA;AAC5E,MAAA,MAAMC,OAAAA,GAAS,KAAK,MAAA,GAAS,CAAA,GAAI,YAAY,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,SAAS,CAAA,GAAI,IAAA;AAC1E,MAAA,IAAI,IAAA,CAAK,MAAA,GAAS,CAAA,IAAK,CAACA,OAAAA,EAAQ;AAC9B,QAAA,IAAA,CAAK,QAAQ,CAAC,CAAA,KAAM,SAAS,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA;AACzC,QAAA,OAAA,CAAQ,MAAA,GAAS,CAAA;AACjB,QAAA;AAAA,MACF;AACA,MAAA,OAAA,CAAQ,IAAA,CAAKA,OAAAA,IAAU,EAAE,KAAA,EAAO,CAAA,CAAE,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAI,CAAA,MAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,CAAM,CAAC,CAAA,EAAG,CAAE,CAAA,EAAG,IAAA,EAAM,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,MAAA,EAAQ,EAAC,EAAG,CAAA;AAAA,IACnI;AACA,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,QAAA,CAAS,MAAA,EAAQ;AACxC,IAAA,MAAM,SAAS,OAAA,CAAQ,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,MAAM,CAAA;AAC9C,IAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAChC,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,EAAS,MAAM,CAAA;AACjC,IAAA,MAAM,GAAA,GAAM,YAAA,CAAa,GAAA,EAAK,SAAA,EAAW,MAAM,CAAA;AAC/C,IAAA,IAAI,GAAA,CAAI,IAAA,KAAS,CAAA,EAAG,OAAO,GAAA;AAC3B,IAAA,GAAA,CAAI,QAAQ,CAAC,CAAA,KAAM,QAAA,CAAS,GAAA,CAAI,CAAC,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,MAAA;AACT;;;AC/PO,SAAS,OAAA,CAAQ,GAAQ,CAAA,EAAkB;AAChD,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAE;AACpF,EAAA,IAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAClB,IAAA,MAAMC,EAAAA,GAAI,IAAI,CAAA,EAAGC,EAAAA,GAAI,IAAI,CAAA,GAAI,CAAA,EAAGC,KAAI,CAAA,GAAI,CAAA;AACxC,IAAA,OAAO,EAAE,CAAA,EAAGF,EAAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAIC,EAAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAIC,EAAAA,GAAI,EAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,EAAGF,EAAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,IAAIC,EAAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAIC,EAAAA,GAAI,CAAA,CAAE,CAAC,EAAE,CAAA,EAAE;AAAA,EAC5F;AACA,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AACvE,EAAA,OAAO;AAAA,IACL,GAAG,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,CAAE,CAAC,EAAE,CAAA,GAAI,CAAA,GAAI,EAAE,CAAC,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;AAAA,IACnD,GAAG,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAI,IAAI,CAAA,CAAE,CAAC,EAAE,CAAA,GAAI,CAAA,GAAI,EAAE,CAAC,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE;AAAA,GACrD;AACF;AAEO,SAAS,QAAA,CAAS,GAAQ,CAAA,EAAkB;AACjD,EAAA,MAAM,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA;AACrB,EAAA,MAAM,IAAS,EAAC;AAChB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA,EAAG,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,CAAA,EAAI,CAAA,EAAG,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,IAAI,CAAA;AACjG,EAAA,OAAO,CAAA,CAAE,WAAW,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,OAAA,CAAQ,GAAG,CAAC,CAAA;AAC7C;AAEA,SAAS,QAAA,CAAS,GAAQ,CAAA,EAAuB;AAC/C,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,KAA8B;AACzC,IAAA,MAAM,MAAW,EAAC;AAClB,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,EAAE,MAAA,EAAQ,CAAA,IAAK,GAAG,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,GAAI,CAAC,GAAG,CAAA;AACvE,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AACA,EAAA,IAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAClB,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAA;AACtB,IAAA,OAAO,CAAC,CAAC,CAAA,CAAE,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAC,CAAC,CAAA;AAAA,EAC9B;AACA,EAAA,IAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAClB,IAAA,MAAM,CAACC,EAAAA,EAAGC,EAAC,CAAA,GAAI,gBAAA,CAAiB,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA;AACjF,IAAA,OAAO,CAAC,GAAA,CAAID,EAAC,CAAA,EAAG,GAAA,CAAIC,EAAC,CAAC,CAAA;AAAA,EACxB;AACA,EAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,YAAA,CAAa,EAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,GAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,EAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,EAAE,CAAC,CAAA,CAAE,GAAG,CAAC,CAAA;AAC7F,EAAA,OAAO,CAAC,GAAA,CAAI,CAAC,CAAA,EAAG,GAAA,CAAI,CAAC,CAAC,CAAA;AACxB;AAGO,SAAS,MAAA,CAAO,CAAA,EAAQ,EAAA,EAAY,EAAA,EAAY,IAAW,EAAA,EAAuB;AACvF,EAAA,IAAI,EAAA,GAAK,EAAA,IAAM,CAAA,EAAG,OAAO,IAAA;AACzB,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,KAAK,CAAA,EAAG,GAAA,GAAM,SAAS,GAAA,EAAK,EAAE,EAAE,CAAC,CAAA;AACrC,EAAA,MAAM,CAAA,GAAA,CAAK,EAAA,GAAK,EAAA,KAAO,CAAA,GAAI,EAAA,CAAA;AAC3B,EAAA,IAAI,IAAI,CAAA,EAAG,GAAA,GAAM,SAAS,GAAA,EAAK,CAAC,EAAE,CAAC,CAAA;AACnC,EAAA,GAAA,GAAM,IAAI,KAAA,EAAM;AAChB,EAAA,GAAA,CAAI,CAAC,CAAA,GAAI,EAAA;AACT,EAAA,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,GAAI,EAAA;AACtB,EAAA,OAAO,GAAA;AACT;AAEO,IAAM,cAAA,GAAiB,CAAC,CAAA,KAAwB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,EAAM,CAAE,OAAA,EAAS,EAAE,OAAA;AAGlF,SAAS,cAAc,CAAA,EAAsB;AAClD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,KAAK,CAAA,EAAG;AACjB,IAAA,MAAM,CAAA,GAAI,CAAA,CAAE,MAAA,KAAW,CAAA,GAAI,CAAA,GAAI,EAAA;AAC/B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,MAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAG,CAAA,GAAI,CAAC,CAAA;AAC1B,MAAA,GAAA,CAAI,IAAA,CAAK,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA;AAAA,IACnB;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,WAAW,CAAA,EAAoB;AAC7C,EAAA,OAAO,cAAA,CAAe,aAAA,CAAc,CAAC,CAAC,CAAA;AACxC;AAGO,SAAS,UAAA,CAAW,CAAA,EAAQ,CAAA,EAAU,CAAA,EAAoB;AAC/D,EAAA,OAAO,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,KAAK,CAAA,CAAE,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,CAAA;AAC3D;AAEA,SAAS,SAAA,CAAU,GAAa,CAAA,EAAmB;AACjD,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA,GAAI,EAAE,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AAC7C,EAAA,IAAI,EAAE,MAAA,KAAW,CAAA,SAAU,CAAA,GAAI,CAAA,GAAI,EAAE,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,EAAE,CAAC,CAAA;AACxE,EAAA,OAAO,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AACzF;AAYO,SAAS,WAAA,CAAY,GAAa,cAAA,EAAuC;AAC9E,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,KAAe,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,cAAA,GAAiB,CAAA,GAAI,CAAA;AAC1E,EAAA,MAAM,OAAO,CAAC,CAAA,EAAG,GAAG,cAAA,CAAe,CAAC,GAAG,CAAC,CAAA;AACxC,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,IAAI,KAAK,IAAA,CAAK,CAAC,GAAG,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACjC,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,EAAE,CAAC,CAAA,EAAG,GAAA,GAAM,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,EAAE,CAAC,CAAA;AAC7D,IAAA,IAAI,GAAA,KAAQ,CAAA,IAAK,CAAA,GAAI,CAAA,EAAG;AACtB,MAAA,MAAM,MAAA,GAAS,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,KAAK,IAAI,CAAC,CAAA,EAAG,KAAA,GAAQ,GAAA,CAAI,SAAA,CAAU,CAAA,EAAG,EAAA,GAAK,IAAI,CAAC,CAAA;AAChF,MAAA,IAAI,MAAA,GAAS,KAAA,GAAQ,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,EAAA,EAAI,MAAA,EAAQ,KAAA,EAAO,CAAA;AAAA,IAC3D;AACA,IAAA,IAAI,GAAA,GAAM,OAAO,CAAA,EAAG;AACpB,IAAA,KAAA,IAAS,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,EAAA,EAAI,EAAA,EAAA,EAAM;AAC9B,MAAA,MAAM,GAAA,GAAA,CAAO,KAAK,EAAA,IAAM,CAAA;AACxB,MAAA,IAAI,IAAI,SAAA,CAAU,CAAA,EAAG,GAAG,CAAC,CAAA,KAAM,KAAK,EAAA,GAAK,GAAA;AAAA,WAAU,EAAA,GAAK,GAAA;AAAA,IAC1D;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAA,CAAI,EAAA,GAAK,EAAA,IAAM,GAAG,MAAA,EAAQ,GAAA,EAAK,KAAA,EAAO,GAAA,EAAK,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,eAAe,CAAA,EAAuB;AAC7C,EAAA,IAAI,CAAA,CAAE,MAAA,GAAS,CAAA,EAAG,OAAO,EAAC;AAC1B,EAAA,MAAM,CAAA,GAAI,EAAE,MAAA,GAAS,CAAA;AACrB,EAAA,MAAM,CAAA,GAAI,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,IAAK,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA;AAEjD,EAAA,IAAI,CAAA,GAAI,GAAG,CAAA,EAAW,CAAA;AACtB,EAAA,IAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAAE,IAAA,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AAAG,IAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AAAA,EAAG,CAAA,MAC5C;AAAE,IAAA,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,GAAI,EAAE,CAAC,CAAA,GAAI,EAAE,CAAC,CAAA;AAAG,IAAA,CAAA,GAAI,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,GAAI,EAAE,CAAC,CAAA,CAAA;AAAI,IAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AAAA,EAAG;AACpE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA,IAAK,CAAA;AACjE,EAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,GAAI,QAAQ,KAAA,EAAO;AAC/B,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,GAAI,KAAA,GAAQ,OAAO,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA,GAAI,CAAC,CAAA;AAAA,EAClD,CAAA,MAAO;AACL,IAAA,MAAM,IAAA,GAAO,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AAC7B,IAAA,IAAI,QAAQ,CAAA,EAAG;AACb,MAAA,MAAM,CAAA,GAAI,IAAA,IAAQ,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,CAAA;AACxD,MAAA,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,CAAA;AACd,MAAA,IAAI,CAAA,KAAM,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IAC7B;AAAA,EACF;AACA,EAAA,OAAO,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,KAAM,IAAI,CAAA,IAAK,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,IAAI,CAAC,CAAA;AAC/D;AAGO,SAAS,OAAA,CAAQ,GAAa,SAAA,EAA4B;AAC/D,EAAA,MAAM,IAAI,CAAA,CAAE,MAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,CAAA,GAAI,YAAY,CAAA,CAAE,CAAC,IAAI,CAAA,CAAE,CAAA,GAAI,IAAI,CAAC,CAAA;AACxC,IAAA,IAAI,CAAA,KAAM,CAAA,EAAG,OAAO,IAAA,CAAK,KAAK,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,CAAA;AACT;;;ACtJA,IAAM,IAAA,GAAO,IAAA;AACb,IAAM,SAAA,GAAY,EAAA;AAElB,IAAM,MAAA,GAAS,IAAA;AAEf,IAAM,QAAA,GAAW,EAAA;AAQjB,SAAS,MAAM,GAAA,EAA4C;AACzD,EAAA,IAAI,KAAK,QAAA,EAAU,EAAA,GAAK,QAAA,EAAU,EAAA,GAAK,WAAW,EAAA,GAAK,CAAA,QAAA;AACvD,EAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,EAAA,GAAK,CAAA,CAAE,CAAA;AACrB,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,EAAA,GAAK,CAAA,CAAE,CAAA;AACrB,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,EAAA,GAAK,CAAA,CAAE,CAAA;AACrB,IAAA,IAAI,CAAA,CAAE,CAAA,GAAI,EAAA,EAAI,EAAA,GAAK,CAAA,CAAE,CAAA;AAAA,EACvB;AACA,EAAA,OAAO,CAAC,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA;AACxB;AAGA,SAAS,SAAS,GAAA,EAAkB;AAClC,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA,EAAG,IAAI,GAAA,CAAI,GAAA,CAAI,SAAS,CAAC,CAAA;AACxC,EAAA,MAAM,EAAA,GAAK,EAAE,CAAA,GAAI,CAAA,CAAE,GAAG,EAAA,GAAK,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AACnC,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC7B,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AACvC,IAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA;AACf,IAAA,MAAM,CAAA,GAAI,GAAA,KAAQ,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,IAAI,IAAA,CAAK,GAAA,CAAA,CAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,EAAA,GAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,EAAE,CAAA,GAAI,GAAA;AACzG,IAAA,IAAI,CAAA,GAAI,OAAO,KAAA,GAAQ,CAAA;AAAA,EACzB;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,MAAM,CAAA,EAA0B;AACvC,EAAA,IAAI,MAAM,CAAA,CAAE,GAAA;AACZ,EAAA,MAAM,IAAA,GAAgB,CAAC,GAAA,CAAI,CAAC,CAAC,CAAA;AAC7B,EAAA,MAAM,QAAiB,CAAC,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAC,CAAA;AAC3C,EAAA,OAAO,GAAA,CAAI,SAAS,CAAA,EAAG;AACrB,IAAA,MAAM,OAAgB,EAAC;AACvB,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACvC,MAAA,IAAA,CAAK,IAAA,CAAK,EAAE,CAAA,EAAA,CAAI,GAAA,CAAI,CAAC,EAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,IAAK,GAAG,CAAA,EAAA,CAAI,GAAA,CAAI,CAAC,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,IAAI,CAAC,CAAA,CAAE,CAAA,IAAK,CAAA,EAAG,CAAA;AAAA,IAClF;AACA,IAAA,GAAA,GAAM,IAAA;AACN,IAAA,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AAChB,IAAA,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAC,CAAA;AAAA,EACnC;AACA,EAAA,MAAM,EAAA,GAAA,CAAM,CAAA,CAAE,EAAA,GAAK,CAAA,CAAE,EAAA,IAAM,CAAA;AAC3B,EAAA,OAAO,CAAC,EAAE,GAAA,EAAK,MAAM,EAAA,EAAI,CAAA,CAAE,IAAI,EAAA,EAAI,EAAA,EAAG,EAAG,EAAE,KAAK,KAAA,EAAO,EAAA,EAAI,IAAI,EAAA,EAAI,CAAA,CAAE,IAAI,CAAA;AAC3E;AAIA,SAAS,UAAA,CAAW,EAAA,EAAW,EAAA,EAAW,EAAA,EAAW,IAAW,KAAA,EAAwC;AACtG,EAAA,MAAM,EAAA,GAAK,GAAG,CAAA,GAAI,EAAA,CAAG,GAAG,EAAA,GAAK,EAAA,CAAG,IAAI,EAAA,CAAG,CAAA;AACvC,EAAA,MAAM,EAAA,GAAK,GAAG,CAAA,GAAI,EAAA,CAAG,GAAG,EAAA,GAAK,EAAA,CAAG,IAAI,EAAA,CAAG,CAAA;AACvC,EAAA,MAAM,GAAA,GAAM,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA;AAC3B,EAAA,IAAI,GAAA,KAAQ,GAAG,OAAO,IAAA;AACtB,EAAA,MAAM,EAAA,GAAK,GAAG,CAAA,GAAI,EAAA,CAAG,GAAG,EAAA,GAAK,EAAA,CAAG,IAAI,EAAA,CAAG,CAAA;AACvC,EAAA,MAAM,CAAA,GAAA,CAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,IAAM,GAAA;AAChC,EAAA,MAAM,CAAA,GAAA,CAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,IAAM,GAAA;AAChC,EAAA,IAAI,CAAA,GAAI,CAAC,KAAA,IAAS,CAAA,GAAI,CAAA,GAAI,KAAA,IAAS,CAAA,GAAI,CAAC,KAAA,IAAS,CAAA,GAAI,CAAA,GAAI,KAAA,EAAO,OAAO,IAAA;AACvE,EAAA,OAAO,CAAC,GAAG,CAAC,CAAA;AACd;AAGA,SAAS,MAAA,CAAO,CAAA,EAAQ,CAAA,EAAQ,EAAA,EAAY,EAAA,EAA8B;AACxE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,EAAA,EAAI,CAAA,EAAA,EAAK;AAC3B,IAAA,MAAM,EAAA,GAAK,QAAQ,CAAA,EAAG,EAAE,GAAG,EAAA,GAAK,OAAA,CAAQ,GAAG,EAAE,CAAA;AAC7C,IAAA,MAAM,EAAA,GAAK,GAAG,CAAA,GAAI,EAAA,CAAG,GAAG,EAAA,GAAK,EAAA,CAAG,IAAI,EAAA,CAAG,CAAA;AACvC,IAAA,IAAI,IAAA,CAAK,IAAI,EAAE,CAAA,GAAI,KAAK,GAAA,CAAI,EAAE,IAAI,KAAA,EAAO;AACzC,IAAA,MAAM,EAAA,GAAK,SAAS,CAAA,EAAG,EAAE,GAAG,EAAA,GAAK,QAAA,CAAS,GAAG,EAAE,CAAA;AAE/C,IAAA,MAAM,GAAA,GAAM,CAAC,EAAA,CAAG,CAAA,GAAI,GAAG,CAAA,GAAI,EAAA,CAAG,IAAI,EAAA,CAAG,CAAA;AACrC,IAAA,IAAI,QAAQ,CAAA,EAAG;AACf,IAAA,MAAM,GAAA,GAAA,CAAO,CAAC,EAAA,GAAK,CAAC,EAAA,CAAG,IAAI,CAAC,EAAA,GAAK,CAAC,EAAA,CAAG,CAAA,IAAK,GAAA;AAC1C,IAAA,MAAM,GAAA,GAAA,CAAO,GAAG,CAAA,GAAI,CAAC,KAAK,EAAA,CAAG,CAAA,GAAI,CAAC,EAAA,IAAM,GAAA;AACxC,IAAA,EAAA,GAAK,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,EAAG,EAAA,GAAK,GAAG,CAAC,CAAA;AACtC,IAAA,EAAA,GAAK,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,EAAG,EAAA,GAAK,GAAG,CAAC,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,CAAC,IAAI,EAAE,CAAA;AAChB;AAUO,SAAS,iBAAA,CAAkB,GAAY,CAAA,EAA+B;AAC3E,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,CAAA,CAAE,WAAW,CAAA,EAAG;AACpC,IAAA,MAAM,EAAA,GAAK,UAAA,CAAW,CAAA,CAAE,CAAC,GAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,CAAE,CAAC,GAAG,KAAK,CAAA;AACnD,IAAA,IAAI,CAAC,EAAA,EAAI,OAAO,EAAC;AACjB,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,EAAG,EAAA,CAAG,CAAC,CAAC,CAAC,CAAA;AACzC,IAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,EAAG,EAAA,CAAG,CAAC,CAAC,CAAC,CAAA;AACzC,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,EAAG,EAAE,CAAA;AACvB,IAAA,OAAO,CAAC,EAAE,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,EAAG,CAAA;AAAA,EACpC;AACA,EAAA,MAAM,MAAyB,EAAC;AAChC,EAAA,MAAM,IAAA,GAAO,CAAC,EAAA,EAAY,EAAA,KAAe;AACvC,IAAA,CAAC,IAAI,EAAE,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,EAAG,IAAI,EAAE,CAAA;AAC9B,IAAA,MAAM,EAAA,GAAK,QAAQ,CAAA,EAAG,EAAE,GAAG,EAAA,GAAK,OAAA,CAAQ,GAAG,EAAE,CAAA;AAC7C,IAAA,IAAI,IAAA,CAAK,MAAM,EAAA,CAAG,CAAA,GAAI,GAAG,CAAA,EAAG,EAAA,CAAG,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,QAAQ,CAAA,GAAI,IAAA,CAAK,IAAI,EAAA,CAAG,CAAC,IAAI,IAAA,CAAK,GAAA,CAAI,EAAA,CAAG,CAAC,CAAA,CAAA,EAAI;AACzF,IAAA,IAAI,IAAI,IAAA,CAAK,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,EAAE,EAAA,GAAK,EAAE,CAAA,GAAI,MAAA,IAAU,KAAK,GAAA,CAAI,CAAA,CAAE,KAAK,EAAE,CAAA,GAAI,MAAM,CAAA,EAAG;AACnF,IAAA,GAAA,CAAI,IAAA,CAAK,EAAE,EAAA,EAAI,EAAA,EAAI,CAAA,EAAG,GAAG,CAAA,EAAG,CAAA,EAAG,EAAA,CAAG,CAAA,EAAG,CAAA;AAAA,EACvC,CAAA;AACA,EAAA,MAAM,KAAA,GAAuC,CAAC,CAAC,EAAE,KAAK,CAAA,EAAG,EAAA,EAAI,GAAG,EAAA,EAAI,CAAA,IAAK,EAAE,GAAA,EAAK,GAAG,EAAA,EAAI,CAAA,EAAG,IAAI,CAAA,EAAE,EAAG,CAAC,CAAC,CAAA;AACrG,EAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,GAAA,CAAI,SAAS,QAAA,EAAU;AAChD,IAAA,MAAM,CAAC,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,GAAI,MAAM,GAAA,EAAI;AAChC,IAAA,MAAM,EAAA,GAAK,MAAM,CAAA,CAAE,GAAG,GAAG,EAAA,GAAK,KAAA,CAAM,EAAE,GAAG,CAAA;AACzC,IAAA,IAAI,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA,IAAQ,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA,IAAQ,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA,IAAQ,EAAA,CAAG,CAAC,CAAA,GAAI,EAAA,CAAG,CAAC,CAAA,GAAI,IAAA,EAAM;AAClG,IAAA,MAAM,EAAA,GAAK,SAAS,CAAA,CAAE,GAAG,GAAG,EAAA,GAAK,QAAA,CAAS,EAAE,GAAG,CAAA;AAC/C,IAAA,IAAK,EAAA,IAAM,IAAA,IAAQ,EAAA,IAAM,IAAA,IAAS,SAAS,SAAA,EAAW;AACpD,MAAA,MAAM,EAAA,GAAK,UAAA,CAAW,CAAA,CAAE,GAAA,CAAI,CAAC,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAE,GAAA,CAAI,MAAA,GAAS,CAAC,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,CAAE,GAAA,CAAI,EAAE,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,EAAG,IAAI,CAAA;AAChG,MAAA,IAAI,IAAI,IAAA,CAAK,CAAA,CAAE,KAAK,EAAA,CAAG,CAAC,KAAK,CAAA,CAAE,EAAA,GAAK,EAAE,EAAA,CAAA,EAAK,CAAA,CAAE,KAAK,EAAA,CAAG,CAAC,KAAK,CAAA,CAAE,EAAA,GAAK,EAAE,EAAA,CAAG,CAAA;AACvE,MAAA;AAAA,IACF;AACA,IAAA,IAAI,MAAM,EAAA,EAAI;AACZ,MAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,MAAM,CAAC,CAAA;AACtB,MAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAG,KAAA,GAAQ,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,EAAG,KAAA,GAAQ,CAAC,CAAC,CAAA;AAAA,IACjD,CAAA,MAAO;AACL,MAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,MAAM,CAAC,CAAA;AACtB,MAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAG,KAAA,GAAQ,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAA,EAAG,KAAA,GAAQ,CAAC,CAAC,CAAA;AAAA,IACjD;AAAA,EACF;AACA,EAAA,OAAO,GAAA,CAAI,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,EAAA,GAAK,EAAE,EAAE,CAAA;AACvC;;;ACtIO,SAAS,cAAc,IAAA,EAAuB;AACnD,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,kBAAkB,IAAI,CAAA;AAChE,EAAA,OAAO,aAAA,CAAc,IAAI,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,IAAU,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AACnF;AAaO,SAAS,aAAA,CAAc,KAAA,EAAa,aAAA,GAAgB,IAAA,EAAiB;AAC1E,EAAA,MAAM,IAAA,GAAO,eAAe,KAAK,CAAA;AACjC,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,IAAA,MAAM,EAAE,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG,MAAA,EAAQ,GAAE,GAAI,IAAA;AACtC,IAAA,MAAM,CAAA,GAAI,CAAC,EAAE,CAAA,EAAG,CAAA,IAAK,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAE,EAAG,EAAE,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAE,EAAG,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA;AAC7E,IAAA,OAAO,CAAC,EAAE,IAAA,EAAM,EAAE,GAAA,CAAI,CAAC,GAAG,CAAA,KAAM,CAAC,GAAG,CAAA,CAAA,CAAG,CAAA,GAAI,KAAK,CAAC,CAAC,CAAC,CAAA,EAAG,MAAA,EAAQ,MAAM,CAAA;AAAA,EACtE;AACA,EAAA,MAAM,MAAiB,EAAC;AACxB,EAAA,IAAI,MAAe,EAAC;AACpB,EAAA,IAAI,KAAA,GAAe,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AAChC,EAAA,IAAI,GAAA,GAAa,KAAA;AACjB,EAAA,MAAM,MAAA,GAAS,CAAC,MAAA,KAAoB;AAClC,IAAA,IAAI,GAAA,CAAI,MAAA,GAAS,CAAA,KAAM,MAAA,IAAU,aAAA,CAAA,KAAmB,GAAA,CAAI,CAAA,KAAM,KAAA,CAAM,CAAA,IAAK,GAAA,CAAI,CAAA,KAAM,KAAA,CAAM,CAAA,CAAA,EAAI;AAC3F,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAA,EAAK,KAAK,CAAC,CAAA;AAAA,IACvB;AACA,IAAA,IAAI,GAAA,CAAI,SAAS,CAAA,EAAG,GAAA,CAAI,KAAK,EAAE,IAAA,EAAM,GAAA,EAAK,MAAA,EAAQ,CAAA;AAClD,IAAA,GAAA,GAAM,EAAC;AACP,IAAA,GAAA,GAAM,KAAA;AAAA,EACR,CAAA;AACA,EAAA,MAAM,CAAA,GAAI,YAAY,IAAI,CAAA;AAC1B,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,KAAA,MAAW,GAAA,IAAO,KAAK,QAAA,EAAU;AAC/B,IAAA,IAAI,QAAQ,MAAA,EAAQ;AAClB,MAAA,MAAA,CAAO,KAAK,CAAA;AACZ,MAAA,KAAA,GAAQ,GAAA,GAAM,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,GAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE;AACrC,MAAA,CAAA,IAAK,CAAA;AAAA,IACP,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAM,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,GAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE;AACjC,MAAA,IAAI,CAAA,CAAE,CAAA,KAAM,GAAA,CAAI,CAAA,IAAK,CAAA,CAAE,CAAA,KAAM,GAAA,CAAI,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,CAAC,GAAA,EAAK,CAAC,CAAC,CAAA;AACrD,MAAA,GAAA,GAAM,CAAA;AACN,MAAA,CAAA,IAAK,CAAA;AAAA,IACP,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAM,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE;AACrC,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAA,EAAK,EAAE,GAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,GAAI,CAAC,CAAA,EAAE,EAAG,CAAC,CAAC,CAAA;AAC3C,MAAA,GAAA,GAAM,CAAA;AACN,MAAA,CAAA,IAAK,CAAA;AAAA,IACP,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAM,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE;AACrC,MAAA,GAAA,CAAI,IAAA,CAAK,CAAC,GAAA,EAAK,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE,EAAG,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,EAAE,EAAG,CAAC,CAAC,CAAA;AACzE,MAAA,GAAA,GAAM,CAAA;AACN,MAAA,CAAA,IAAK,CAAA;AAAA,IACP,CAAA,MAAA,IAAW,QAAQ,MAAA,EAAQ;AACzB,MAAA,MAAA,CAAO,IAAI,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,MAAA,CAAO,KAAK,CAAA;AACZ,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,iBAAA,CAAkB,UAAqB,GAAA,EAAsB;AAE3E,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,QAAA,CAAS,OAAA,CAAQ,CAAC,OAAA,EAAS,EAAA,KAAO;AAChC,IAAA,MAAM,MAAe,EAAC;AACtB,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,CAAA,GAAI,CAAA;AACR,MAAA,IAAI,CAAA,CAAE,SAAS,CAAA,EAAG;AAChB,QAAA,IAAI,GAAA,GAAM,CAAA;AACV,QAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAA,EAAK,GAAA,IAAO,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA;AACjG,QAAA,CAAA,GAAI,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,GAAM,KAAK,GAAA,CAAI,GAAA,EAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAAA,MAC/E;AACA,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK,GAAA,CAAI,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAA,GAAI,CAAC,CAAC,CAAA;AAAA,IACxD;AACA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,MAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA,EAAG,IAAI,GAAA,CAAA,CAAK,CAAA,GAAI,CAAA,IAAK,GAAA,CAAI,MAAM,CAAA;AAC9C,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,CAAA,CAAE,GAAG,EAAA,EAAI,CAAA,CAAE,GAAG,EAAA,EAAI,CAAA,CAAE,GAAG,EAAA,EAAI,CAAA,CAAE,GAAG,CAAA,EAAG,EAAA,EAAI,GAAG,CAAA,EAAG,GAAA,CAAI,QAAQ,CAAA;AAAA,IAC5E;AAAA,EACF,CAAC,CAAA;AACD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,IAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACzC,MAAA,MAAM,CAAA,GAAI,MAAM,CAAC,CAAA;AACjB,MAAA,IAAI,CAAA,CAAE,CAAA,KAAM,CAAA,CAAE,CAAA,KAAM,CAAA,GAAI,CAAA,KAAM,CAAA,IAAM,CAAA,KAAM,CAAA,IAAK,CAAA,CAAE,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA,CAAA,EAAK;AAClE,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAChG,MAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,IAAK,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAE,CAAA,EAAG;AAChG,MAAA,IAAI,cAAc,CAAA,CAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,CAAA,CAAE,EAAE,GAAG,OAAO,IAAA;AAAA,IAC5E;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGO,SAAS,SAAA,CAAU,GAAU,QAAA,EAA6B;AAC/D,EAAA,MAAM,GAAA,GAAM,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE;AACzB,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,KAAA,MAAW,CAAA,IAAK,YAAY,UAAA,CAAW,CAAA,EAAG,GAAG,GAAG,CAAA,EAAG,IAAI,CAAA,EAAG;AACxD,QAAA,IAAI,OAAA,CAAQ,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,CAAA,IAAK,CAAA,CAAE,KAAA,GAAQ,CAAA,GAAI,CAAA,GAAI,EAAA;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAA;AACT;AAGO,SAAS,SAAS,QAAA,EAA6B;AACpD,EAAA,IAAI,OAAO,QAAA,EAAU,IAAA,GAAO,QAAA,EAAU,IAAA,GAAO,WAAW,IAAA,GAAO,CAAA,QAAA;AAC/D,EAAA,KAAA,MAAW,KAAK,QAAA,EAAU,KAAA,MAAW,KAAK,CAAA,EAAG,KAAA,MAAW,KAAK,CAAA,EAAG;AAC9D,IAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AAAG,IAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AACrD,IAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AAAG,IAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AAAA,EACvD;AACA,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,IAAA,EAAM,OAAO,IAAI,CAAA;AAC5C;AAGO,SAAS,eAAe,QAAA,EAA6B;AAC1D,EAAA,MAAM,MAAA,GAAS,SAAS,QAAQ,CAAA;AAChC,EAAA,OAAO,MAAA,GAAS,SAAS,GAAA,GAAM,GAAA;AACjC;AAOO,SAAS,gBAAA,CAAiB,UAAqB,QAAA,EAAmC;AACvF,EAAA,MAAM,MAAA,GAAS,CAAC,CAAA,KAAa;AAC3B,IAAA,MAAM,CAAA,GAAI,SAAA,CAAU,CAAA,EAAG,QAAQ,CAAA;AAC/B,IAAA,OAAO,QAAA,KAAa,SAAA,GAAA,CAAa,CAAA,GAAI,CAAA,MAAO,IAAI,CAAA,KAAM,CAAA;AAAA,EACxD,CAAA;AACA,EAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,SAAS,QAAQ,CAAA,GAAI,MAAM,IAAI,CAAA;AAEpD,EAAA,MAAM,MAAiB,EAAC;AACxB,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,IAAI,KAAA,GAAQ,QAAQ,CAAC,CAAA;AACrB,IAAA,IAAI,IAAA,GAAO,EAAA;AACX,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,MAAM,GAAA,GAAM,KAAK,KAAA,CAAM,CAAA,CAAE,EAAE,MAAA,GAAS,CAAC,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,EAAE,CAAA,EAAG,CAAA,CAAE,EAAE,MAAA,GAAS,CAAC,EAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA;AAC7E,MAAA,IAAI,MAAM,IAAA,EAAM;AAAE,QAAA,IAAA,GAAO,GAAA;AAAK,QAAA,KAAA,GAAQ,CAAA;AAAA,MAAG;AAAA,IAC3C;AACA,IAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,KAAA,EAAO,GAAG,CAAA;AAC5B,IAAA,IAAI,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,GAAG,CAAA;AAC7B,IAAA,MAAM,KAAK,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAA,EAAG,IAAI,CAAC,CAAA;AAClC,IAAA,IAAI,OAAO,CAAA,EAAG;AACd,IAAA,GAAA,GAAM,EAAE,GAAG,GAAA,CAAI,CAAA,GAAI,IAAI,CAAA,EAAG,GAAA,CAAI,IAAI,EAAA,EAAG;AACrC,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,EAAE,CAAA,EAAG,EAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,GAAA,EAAK,GAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,KAAK,CAAA;AAClE,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,EAAE,CAAA,EAAG,EAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,GAAA,EAAK,GAAG,CAAA,CAAE,CAAA,GAAI,GAAA,CAAI,CAAA,GAAI,KAAK,CAAA;AACnE,IAAA,IAAI,IAAA,IAAQ,CAAC,KAAA,EAAO,GAAA,CAAI,KAAK,OAAO,CAAA;AAAA,SAAA,IAC3B,SAAS,CAAC,IAAA,MAAU,IAAA,CAAK,cAAA,CAAe,OAAO,CAAC,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,GAAA;AACT;;;ACnKO,SAAS,eAAA,CAAgB,QAAmB,KAAA,EAA+B;AAChF,EAAA,MAAM,UAAU,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,OAAO,CAAC,CAAC,CAAA,EAAG,IAAA,EAAM,cAAc,CAAC,CAAA,EAAG,MAAM,UAAA,CAAW,CAAC,GAAE,CAAE,CAAA;AAC/F,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,CAAA,CAAE,CAAC,GAAG,GAAG,CAAA;AAC5B,IAAA,IAAI,IAAA,GAAwC,IAAA;AAC5C,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,IAAI,cAAA,CAAe,CAAA,CAAE,IAAA,EAAM,EAAA,CAAG,GAAG,EAAA,CAAG,CAAC,CAAA,KAAM,CAAC,IAAA,IAAQ,CAAA,CAAE,IAAA,GAAO,IAAA,CAAK,OAAO,IAAA,GAAO,CAAA;AAAA,IAClF;AACA,IAAA,IAAA,EAAM,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,EACpB;AACA,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,KAAK,CAAA;AACnC;AAEO,IAAM,UAAA,GAAa,CAAC,CAAA,KAAyB,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,UAAA,CAAW,CAAC,CAAA,EAAG,CAAC;AAEpF,IAAM,MAAA,GAAS,CAAC,KAAA,EAAkB,QAAA,KACvC,UAAU,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,MAAU,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAK,CAAE,GAAG,QAAQ;AAE5D,SAAS,SAAA,CAAU,UAAqB,QAAA,EAAqC;AAClF,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,MAAM,KAAe,EAAC;AACtB,EAAA,KAAA,MAAW,EAAE,IAAA,EAAM,MAAA,EAAO,IAAK,QAAA,EAAU;AACvC,IAAA,IAAA,CAAK,KAAK,MAAM,CAAA;AAChB,IAAA,EAAA,CAAG,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,IAAA,CAAK,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA;AAClC,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAA,CAAK,IAAA,CAAK,EAAE,MAAA,KAAW,CAAA,GAAI,SAAS,CAAA,CAAE,MAAA,KAAW,CAAA,GAAI,MAAA,GAAS,MAAM,CAAA;AACpE,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK,EAAA,CAAG,IAAA,CAAK,CAAA,CAAE,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,EAAE,CAAC,CAAA;AAAA,IAC3D;AACA,IAAA,IAAI,MAAA,EAAQ,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA;AAAA,EAC9B;AACA,EAAA,MAAM,MAAA,GAAS,UAAU,EAAE,CAAA;AAC3B,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,SAAA;AAAA,IAAW,QAAA,EAAU,IAAI,UAAA,CAAW,IAAI,CAAA;AAAA,IAAG,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,EAAE,CAAA;AAAA,IAAG,QAAA;AAAA,IAAU,GAAI,MAAA,GAAS,EAAE,MAAA,KAAW;AAAC,GACxH;AACF","file":"chunk-OQP5M5VD.js","sourcesContent":["/**\n * Carrying corner specs onto a path rebuilt from another: a split, a rejoin,\n * a reversal. Specs are keyed by flat anchor index, so a rewrite that moves\n * anchors must renumber them rather than keep the old array.\n */\nimport { forEachSegment, pathCommandCoordCount, PATH_C, PATH_M, PATH_Q, PATH_Z } from '../commands';\nimport type { PolygonPath } from '../path';\nimport { compactCorners, withoutCorners, type CornerSpec } from './cornerSpec';\n\nconst flatCache = new WeakMap<PolygonPath, Int32Array>();\n\n/**\n * For each anchor command of `path` (each M, L, C, or Q, as `countPathAnchors`\n * numbers them), its flat anchor index, the numbering `PolygonPath.corners`\n * uses: a closing curve that ends on its subpath's first point folds onto\n * that anchor, as `pathToAnchors` folds it.\n */\nexport function flatAnchorIndices(path: PolygonPath): Int32Array {\n  const hit = flatCache.get(path);\n  if (hit) return hit;\n  const { commands, coords } = path;\n  const out: number[] = [];\n  let flat = 0, first = 0, count = 0;\n  let sx = 0, sy = 0, ex = 0, ey = 0, curve = false;\n  forEachSegment(commands, coords, (cmd, ci) => {\n    if (cmd === PATH_Z) {\n      if (count > 1 && curve && ex === sx && ey === sy) { out[out.length - 1] = first; flat--; }\n      count = 0;\n      return;\n    }\n    const n = pathCommandCoordCount(cmd);\n    ex = coords[ci + n - 2]; ey = coords[ci + n - 1];\n    curve = cmd === PATH_C || cmd === PATH_Q;\n    if (cmd === PATH_M || count === 0) { first = flat; sx = ex; sy = ey; count = 0; }\n    count++;\n    out.push(flat++);\n  });\n  const result = Int32Array.from(out);\n  flatCache.set(path, result);\n  return result;\n}\n\n/**\n * `to` with `from`'s corner specs carried across, where `sources[k]` is the\n * anchor command of `from` that anchor command `k` of `to` was drawn from, or\n * -1 for one with no source. Each spec lands once, on the first anchor drawn\n * from its own; any specs `to` already had are dropped.\n */\nexport function carryCorners(from: PolygonPath, to: PolygonPath, sources: ArrayLike<number>): PolygonPath {\n  const bare = withoutCorners(to);\n  const specs = from.corners;\n  if (!specs) return bare;\n  const fromFlat = flatAnchorIndices(from);\n  const toFlat = flatAnchorIndices(to);\n  const placed = new Set<number>();\n  const next: (CornerSpec | null)[] = [];\n  for (let k = 0; k < toFlat.length; k++) {\n    const s = sources[k];\n    if (s === undefined || s < 0 || s >= fromFlat.length) continue;\n    const f = fromFlat[s];\n    const spec = specs[f];\n    if (!spec || placed.has(f)) continue;\n    placed.add(f);\n    while (next.length < toFlat[k]) next.push(null);\n    next[toFlat[k]] = spec;\n  }\n  const corners = compactCorners(next);\n  return corners ? { ...bare, corners } : bare;\n}\n\n/** `count` consecutive anchor command indices from `start`: the sources of a\n *  contiguous slice. */\nexport function anchorRange(start: number, count: number): Int32Array {\n  const out = new Int32Array(count);\n  for (let i = 0; i < count; i++) out[i] = start + i;\n  return out;\n}\n","/**\n * Putting corner specs back on a path an operation rebuilt from expanded\n * geometry. Booleans, trims and cuts work on what a path draws, its corners\n * cut and spanned (`resolveCorners`); wherever a corner's cut comes through\n * whole, it folds back into its anchor and spec, and only a corner the\n * operation cut into or moved stays expanded.\n */\nimport type { Path, PolygonPath } from '../path';\nimport { nearestOnCubic, nearestOnLine } from '../nearest';\nimport { PathBuilder } from './builder';\nimport { flatAnchorIndices } from './cornerCarry';\nimport { decodeContours, type Contour, type Seg } from './cornerSegments';\nimport type { Point } from './cubicMath';\nimport type { CornerPiece } from './cornerShape';\nimport { compactCorners, withoutCorners, type CornerSpec } from './cornerSpec';\nimport { cornerCuts } from './corners';\nimport { distance, lerpPoint } from '../points2';\n\n/** A corner a rebuilt path may hold expanded: the anchor and spec it folds\n *  back into, and the cut it is drawn as, from `start` to `end`. */\nexport interface CornerTrace {\n  anchor: Point;\n  spec: CornerSpec;\n  start: Point;\n  end: Point;\n  pieces: readonly CornerPiece[];\n}\n\n/** How far a point may sit from where a corner draws it and still count as on it. */\nexport const CORNER_RESTORE_TOLERANCE = 1e-3;\n\n/** The corners `path` cuts, as {@link restoreCorners} looks for them. */\nexport function cornerTraces(path: Path): CornerTrace[] {\n  if (path.kind !== 'polygon') return [];\n  return cornerCuts(path).map(({ anchor, spec, start, end, pieces }) => ({ anchor, spec, start, end, pieces }));\n}\n\n/**\n * `result` with the corners of `sources` folded back in wherever it still\n * draws them whole: an operation's output, rebuilt from what the sources\n * draw. A corner the operation cut into, or whose edges it moved, stays as\n * the plain geometry it already is.\n */\nexport function keepCorners(sources: readonly Path[], result: PolygonPath, tolerance = CORNER_RESTORE_TOLERANCE): PolygonPath {\n  const traces = sources.flatMap(cornerTraces);\n  return traces.length === 0 ? result : restoreCorners(result, traces, tolerance);\n}\n\nfunction onTrace(p: Point, t: CornerTrace, tol: number): boolean {\n  let from = t.start;\n  for (const piece of t.pieces) {\n    const d = piece.kind === 'line'\n      ? nearestOnLine(p.x, p.y, from.x, from.y, piece.to.x, piece.to.y).dist\n      : nearestOnCubic(p.x, p.y, from.x, from.y, piece.c1.x, piece.c1.y, piece.c2.x, piece.c2.y, piece.to.x, piece.to.y).dist;\n    if (d <= tol) return true;\n    from = piece.to;\n  }\n  return false;\n}\n\n/** The blossom of cubic `s` at `(u, v, w)`. */\nfunction blossom(s: Seg, u: number, v: number, w: number): Point {\n  const a = lerpPoint(s.p0, s.c1, u), b = lerpPoint(s.c1, s.c2, u), c = lerpPoint(s.c2, s.p3, u);\n  const d = lerpPoint(a, b, v), e = lerpPoint(b, c, v);\n  return lerpPoint(d, e, w);\n}\n\n/** The parameter, past `[0, 1]` on the side `from` gives, where cubic `s`\n *  carried on as the same polynomial passes through `target`; null if it does not. */\nfunction extendTo(s: Seg, target: Point, from: 0 | 1, tol: number): number | null {\n  const at = (u: number) => blossom(s, u, u, u);\n  const d1 = (u: number): Point => {\n    const a = blossom(s, u, u, 0), b = blossom(s, u, u, 1);\n    return { x: 3 * (b.x - a.x), y: 3 * (b.y - a.y) };\n  };\n  const speed = Math.hypot(d1(from).x, d1(from).y);\n  if (speed === 0) return null;\n  let u = from + (from === 1 ? 1 : -1) * distance(at(from), target) / speed;\n  for (let i = 0; i < 30; i++) {\n    const p = at(u), d = d1(u);\n    const dd = d.x * d.x + d.y * d.y;\n    if (dd === 0) break;\n    u -= ((p.x - target.x) * d.x + (p.y - target.y) * d.y) / dd;\n  }\n  return distance(at(u), target) <= tol ? u : null;\n}\n\n/** `s` with its start moved to `start` and its end to `end`, either left\n *  where it was when undefined; null when a curve cannot reach them. */\nfunction reachSeg(s: Seg, start: Point | undefined, end: Point | undefined, tol: number): Seg | null {\n  const p0 = start ?? s.p0, p3 = end ?? s.p3;\n  if (s.line) return { line: true, p0, c1: p0, c2: p3, p3 };\n  const u0 = start ? extendTo(s, start, 0, tol) : 0;\n  const u1 = end ? extendTo(s, end, 1, tol) : 1;\n  if (u0 === null || u1 === null) return null;\n  return { line: false, p0, c1: blossom(s, u0, u0, u1), c2: blossom(s, u0, u1, u1), p3 };\n}\n\n/** A stretch of a contour's anchors, `from` to `to` going forward, that draws one corner. */\ninterface Run { from: number; to: number; trace: CornerTrace }\n\n/** Whether anchor `a`, reached or left by straight edge `edge`, ends a corner's\n *  cut at `p`: it sits there, or it sits on the cut and the edge runs through\n *  `p` to it, as when flattening has merged the cut's end into the edge. */\nfunction endsCut(a: Point, edge: Seg, p: Point, t: CornerTrace, tol: number): boolean {\n  if (distance(a, p) <= tol) return true;\n  return edge.line && onTrace(a, t, tol)\n    && nearestOnLine(p.x, p.y, edge.p0.x, edge.p0.y, edge.p3.x, edge.p3.y).dist <= tol;\n}\n\nfunction findRun(c: Contour, t: CornerTrace, tol: number): Run | null {\n  const n = c.anchors.length;\n  for (let i = c.closed ? 0 : 1; i < n; i++) {\n    for (const [first, last] of [[t.start, t.end], [t.end, t.start]] as const) {\n      if (!endsCut(c.anchors[i], c.segs[(i - 1 + n) % n], first, t, tol)) continue;\n      for (let j = i + 1, steps = 1; steps < c.segs.length; j++, steps++) {\n        if (!c.closed && j >= n - 1) break;\n        const a = c.anchors[j % n];\n        const seg = c.segs[(j - 1) % n];\n        if (!seg.line && !onTrace(blossom(seg, 0.5, 0.5, 0.5), t, tol)) break;\n        if (endsCut(a, c.segs[j % n], last, t, tol)) return { from: i, to: j % n, trace: t };\n        if (!onTrace(a, t, tol)) break;\n      }\n    }\n  }\n  return null;\n}\n\n/** The anchors a run covers, its ends included. */\nfunction covered(run: Run, n: number): number[] {\n  const out: number[] = [];\n  for (let k = run.from; ; k = (k + 1) % n) {\n    out.push(k);\n    if (k === run.to) return out;\n  }\n}\n\ninterface Node { at: Point; spec: CornerSpec | null }\ninterface Rebuilt { nodes: Node[]; segs: Seg[]; closed: boolean; folded: Run[] }\n\n/** `c` with each of `runs` folded into its anchor; null when an edge next to one cannot reach it. */\nfunction foldContour(c: Contour, runs: readonly Run[], specs: readonly (CornerSpec | null)[], tol: number): Rebuilt | null {\n  const n = c.anchors.length;\n  const runAt = new Map<number, Run>();\n  const inside = new Set<number>();\n  for (const run of runs) {\n    runAt.set(run.from, run);\n    for (const k of covered(run, n)) inside.add(k);\n  }\n  let begin = 0;\n  if (c.closed) {\n    const free = c.anchors.findIndex((_a, k) => !inside.has(k));\n    begin = free >= 0 ? free : runs[0]!.from;\n  }\n  const nodes: Node[] = [];\n  const exits: number[] = []; // anchor each node's outgoing segment leaves from\n  for (let step = 0, k = begin; step < n; ) {\n    const run = runAt.get(k);\n    if (run) {\n      nodes.push({ at: run.trace.anchor, spec: run.trace.spec });\n      exits.push(run.to);\n      const span = covered(run, n).length;\n      step += span;\n      k = (run.to + 1) % n;\n    } else {\n      nodes.push({ at: c.anchors[k], spec: specs[k] ?? null });\n      exits.push(k);\n      step++;\n      k = (k + 1) % n;\n    }\n  }\n  const runEnds = new Set(runs.map((r) => r.to));\n  const segs: Seg[] = [];\n  const count = c.closed ? nodes.length : nodes.length - 1;\n  for (let m = 0; m < count; m++) {\n    const exit = exits[m]!;\n    const moveStart = runEnds.has(exit) ? nodes[m]!.at : undefined;\n    const moveEnd = runAt.has((exit + 1) % n) ? nodes[(m + 1) % nodes.length]!.at : undefined;\n    const reached = reachSeg(c.segs[exit]!, moveStart, moveEnd, tol);\n    if (!reached) return null;\n    segs.push(reached);\n  }\n  return { nodes, segs, closed: c.closed, folded: [...runs] };\n}\n\nfunction write(contours: readonly Rebuilt[], result: PolygonPath): PolygonPath {\n  const b = new PathBuilder();\n  if (result.origin) b.setOrigin(result.origin.x, result.origin.y);\n  const specs: (CornerSpec | null)[] = [];\n  for (const { nodes, segs, closed } of contours) {\n    b.moveTo(nodes[0]!.at.x, nodes[0]!.at.y);\n    specs.push(nodes[0]!.spec);\n    segs.forEach((s, m) => {\n      const to = nodes[(m + 1) % nodes.length]!;\n      const closing = closed && m === segs.length - 1;\n      if (closing && s.line) return;\n      if (s.line) b.lineTo(to.at.x, to.at.y);\n      else b.curveTo(s.c1.x, s.c1.y, s.c2.x, s.c2.y, to.at.x, to.at.y);\n      specs.push(to.spec);\n    });\n    if (closed) b.close();\n  }\n  const { commands, coords } = b.build();\n  const built: PolygonPath = { ...withoutCorners(result), commands, coords };\n  const flat = flatAnchorIndices(built);\n  const corners: (CornerSpec | null)[] = [];\n  specs.forEach((spec, k) => {\n    if (!spec) return;\n    while (corners.length < flat[k]!) corners.push(null);\n    corners[flat[k]!] = spec;\n  });\n  const compact = compactCorners(corners);\n  return compact ? { ...built, corners: compact } : built;\n}\n\n/** Whether every corner folded into `path` draws again where its trace says. */\nfunction failedTraces(path: PolygonPath, tol: number, folded: readonly Run[]): Set<CornerTrace> {\n  const bad = new Set(folded.map((r) => r.trace));\n  for (const cut of cornerCuts(path)) {\n    for (const t of bad) {\n      if (distance(cut.anchor, t.anchor) > tol) continue;\n      const same = (distance(cut.start, t.start) <= tol && distance(cut.end, t.end) <= tol)\n        || (distance(cut.start, t.end) <= tol && distance(cut.end, t.start) <= tol);\n      if (same) bad.delete(t);\n    }\n  }\n  return bad;\n}\n\n/**\n * `result` with each of `traces` it draws whole folded back into its anchor\n * and spec. A trace counts as drawn when a run of anchors goes from one end\n * of its cut to the other along it, the edges either side carry on to its\n * anchor, and the folded corner cuts the same again. Specs `result` already\n * holds are kept.\n */\nexport function restoreCorners(result: PolygonPath, traces: readonly CornerTrace[], tolerance = CORNER_RESTORE_TOLERANCE): PolygonPath {\n  const contours = decodeContours(result);\n  if (!contours || traces.length === 0) return result;\n  const rejected = new Set<CornerTrace>();\n  for (let attempt = 0; attempt <= traces.length; attempt++) {\n    const rebuilt: Rebuilt[] = [];\n    for (const c of contours) {\n      const runs: Run[] = [];\n      const used = new Set<number>();\n      for (const t of traces) {\n        if (rejected.has(t)) continue;\n        const run = findRun(c, t, tolerance);\n        if (!run) continue;\n        const span = covered(run, c.anchors.length);\n        if (span.some((k) => used.has(k))) continue;\n        span.forEach((k) => used.add(k));\n        runs.push(run);\n      }\n      const specs = c.anchors.map((_a, k) => result.corners?.[c.first + k] ?? null);\n      const folded = runs.length > 0 ? foldContour(c, runs, specs, tolerance) : null;\n      if (runs.length > 0 && !folded) {\n        runs.forEach((r) => rejected.add(r.trace));\n        rebuilt.length = 0;\n        break;\n      }\n      rebuilt.push(folded ?? { nodes: c.anchors.map((at, k) => ({ at, spec: specs[k]! })), segs: c.segs, closed: c.closed, folded: [] });\n    }\n    if (rebuilt.length !== contours.length) continue;\n    const folded = rebuilt.flatMap((r) => r.folded);\n    if (folded.length === 0) return result;\n    const out = write(rebuilt, result);\n    const bad = failedTraces(out, tolerance, folded);\n    if (bad.size === 0) return out;\n    bad.forEach((t) => rejected.add(t));\n  }\n  return result;\n}\n","/** A contour as Bézier segments: evaluating and splitting one, and where one crosses a line. */\n\nimport { splitCubicAt, splitQuadraticAt } from '../curve';\nimport { ringSignedArea } from '../polyline';\nimport type { Point } from '../paths/cubicMath';\n\n/** A Bézier segment by its control points: 2 = line, 3 = quadratic, 4 = cubic. */\nexport type Seg = Point[];\nexport type Contour = Seg[];\n\n/** A point on a contour: segment index and parameter. */\nexport interface Station {\n  seg: number;\n  t: number;\n  pt: Point;\n}\n\nexport function evalSeg(s: Seg, t: number): Point {\n  const u = 1 - t;\n  if (s.length === 2) return { x: u * s[0].x + t * s[1].x, y: u * s[0].y + t * s[1].y };\n  if (s.length === 3) {\n    const a = u * u, b = 2 * u * t, c = t * t;\n    return { x: a * s[0].x + b * s[1].x + c * s[2].x, y: a * s[0].y + b * s[1].y + c * s[2].y };\n  }\n  const a = u * u * u, b = 3 * u * u * t, c = 3 * u * t * t, d = t * t * t;\n  return {\n    x: a * s[0].x + b * s[1].x + c * s[2].x + d * s[3].x,\n    y: a * s[0].y + b * s[1].y + c * s[2].y + d * s[3].y,\n  };\n}\n\nexport function derivSeg(s: Seg, t: number): Point {\n  const n = s.length - 1;\n  const d: Seg = [];\n  for (let i = 0; i < n; i++) d.push({ x: n * (s[i + 1].x - s[i].x), y: n * (s[i + 1].y - s[i].y) });\n  return d.length === 1 ? d[0] : evalSeg(d, t);\n}\n\nfunction splitSeg(s: Seg, t: number): [Seg, Seg] {\n  const pts = (c: ArrayLike<number>): Seg => {\n    const out: Seg = [];\n    for (let i = 0; i < c.length; i += 2) out.push({ x: c[i], y: c[i + 1] });\n    return out;\n  };\n  if (s.length === 2) {\n    const m = evalSeg(s, t);\n    return [[s[0], m], [m, s[1]]];\n  }\n  if (s.length === 3) {\n    const [l, r] = splitQuadraticAt(s[0].x, s[0].y, s[1].x, s[1].y, s[2].x, s[2].y, t);\n    return [pts(l), pts(r)];\n  }\n  const [l, r] = splitCubicAt(s[0].x, s[0].y, s[1].x, s[1].y, s[2].x, s[2].y, s[3].x, s[3].y, t);\n  return [pts(l), pts(r)];\n}\n\n/** The part of `s` between t0 and t1, with its ends snapped to the given points. */\nexport function subSeg(s: Seg, t0: number, t1: number, p0: Point, p1: Point): Seg | null {\n  if (t1 - t0 <= 0) return null;\n  let out = s;\n  if (t0 > 0) out = splitSeg(out, t0)[1];\n  const u = (t1 - t0) / (1 - t0);\n  if (u < 1) out = splitSeg(out, u)[0];\n  out = out.slice();\n  out[0] = p0;\n  out[out.length - 1] = p1;\n  return out;\n}\n\nexport const reverseContour = (c: Contour): Contour => c.map((s) => s.slice().reverse()).reverse();\n\n/** Points along a contour for area and containment estimates. */\nexport function sampleContour(c: Contour): number[] {\n  const out: number[] = [];\n  for (const s of c) {\n    const n = s.length === 2 ? 1 : 16;\n    for (let i = 0; i < n; i++) {\n      const p = evalSeg(s, i / n);\n      out.push(p.x, p.y);\n    }\n  }\n  return out;\n}\n\n/** Signed area; positive when the fill lies to the left of the direction of travel. */\nexport function signedArea(c: Contour): number {\n  return ringSignedArea(sampleContour(c));\n}\n\n/** Bernstein coefficients of the signed distance cross(d, P − o) along `s`. */\nexport function sideCoeffs(s: Seg, o: Point, d: Point): number[] {\n  return s.map((p) => d.x * (p.y - o.y) - d.y * (p.x - o.x));\n}\n\nfunction bernstein(f: number[], t: number): number {\n  const u = 1 - t;\n  if (f.length === 2) return u * f[0] + t * f[1];\n  if (f.length === 3) return u * u * f[0] + 2 * u * t * f[1] + t * t * f[2];\n  return u * u * u * f[0] + 3 * u * u * t * f[1] + 3 * u * t * t * f[2] + t * t * t * f[3];\n}\n\ninterface SignChange { t: number; before: number; after: number }\n\n/**\n * Where the polynomial changes sign on [0, 1]. The interval is cut at the\n * derivative's roots so each piece is monotonic, then each sign change is\n * bisected. Tangencies have no sign change and are skipped. With\n * `zeroIsPositive` a zero counts as positive, so a change landing exactly on\n * an end is still seen once; otherwise zeros at the ends are left to the\n * caller.\n */\nexport function signChanges(f: number[], zeroIsPositive: boolean): SignChange[] {\n  const sgn = (v: number) => (v > 0 ? 1 : v < 0 ? -1 : zeroIsPositive ? 1 : 0);\n  const cuts = [0, ...criticalPoints(f), 1];\n  const out: SignChange[] = [];\n  for (let i = 0; i + 1 < cuts.length; i++) {\n    let lo = cuts[i], hi = cuts[i + 1];\n    const slo = sgn(bernstein(f, lo)), shi = sgn(bernstein(f, hi));\n    if (slo === 0 && i > 0) {\n      const before = sgn(bernstein(f, lo - 1e-7)), after = sgn(bernstein(f, lo + 1e-7));\n      if (before * after < 0) out.push({ t: lo, before, after });\n    }\n    if (slo * shi >= 0) continue;\n    for (let it = 0; it < 64; it++) {\n      const mid = (lo + hi) / 2;\n      if (sgn(bernstein(f, mid)) === slo) lo = mid; else hi = mid;\n    }\n    out.push({ t: (lo + hi) / 2, before: slo, after: shi });\n  }\n  return out;\n}\n\n/** Roots in (0, 1) of the derivative of a Bernstein polynomial of degree ≤ 3. */\nfunction criticalPoints(f: number[]): number[] {\n  if (f.length < 3) return [];\n  const n = f.length - 1;\n  const d = f.slice(1).map((v, i) => n * (v - f[i]));\n  // Power basis of the derivative: A t² + B t + C.\n  let A = 0, B: number, C: number;\n  if (d.length === 2) { B = d[1] - d[0]; C = d[0]; }\n  else { A = d[0] - 2 * d[1] + d[2]; B = 2 * (d[1] - d[0]); C = d[0]; }\n  const out: number[] = [];\n  const scale = Math.max(Math.abs(A), Math.abs(B), Math.abs(C)) || 1;\n  if (Math.abs(A) / scale < 1e-12) {\n    if (Math.abs(B) / scale > 1e-12) out.push(-C / B);\n  } else {\n    const disc = B * B - 4 * A * C;\n    if (disc >= 0) {\n      const q = -0.5 * (B + Math.sign(B || 1) * Math.sqrt(disc));\n      out.push(q / A);\n      if (q !== 0) out.push(C / q);\n    }\n  }\n  return out.filter((t) => t > 0 && t < 1).sort((x, y) => x - y);\n}\n\n/** Sign of f just after t = 0 (`fromStart`) or just before t = 1, read off the control values. */\nexport function endSide(f: number[], fromStart: boolean): number {\n  const n = f.length;\n  for (let i = 1; i < n; i++) {\n    const v = fromStart ? f[i] : f[n - 1 - i];\n    if (v !== 0) return Math.sign(v);\n  }\n  return 0;\n}\n","/** Where two Bézier segments cross, by subdivision then Newton refinement. */\n\nimport type { Point } from '../paths/cubicMath';\nimport { evalSeg, derivSeg, type Seg } from '../booleans/contourSegments';\n\n/** One crossing of segments `a` and `b`: the parameter on each, and the point. */\nexport interface SegmentCrossing {\n  ta: number;\n  tb: number;\n  x: number;\n  y: number;\n}\n\n/** Subdivision stops once both pieces are this flat (world units). */\nconst FLAT = 1e-4;\nconst MAX_DEPTH = 48;\n/** Crossings closer than this along both parameters are one crossing. */\nconst SAME_T = 1e-7;\n/** Two overlapping curves cross everywhere; stop collecting past this. */\nconst MAX_HITS = 16;\n\ninterface Piece {\n  pts: Seg;\n  t0: number;\n  t1: number;\n}\n\nfunction boxOf(pts: Seg): [number, number, number, number] {\n  let x0 = Infinity, y0 = Infinity, x1 = -Infinity, y1 = -Infinity;\n  for (const p of pts) {\n    if (p.x < x0) x0 = p.x;\n    if (p.x > x1) x1 = p.x;\n    if (p.y < y0) y0 = p.y;\n    if (p.y > y1) y1 = p.y;\n  }\n  return [x0, y0, x1, y1];\n}\n\n/** How far the control points stray from the chord. Zero for a line. */\nfunction flatness(pts: Seg): number {\n  if (pts.length === 2) return 0;\n  const a = pts[0], b = pts[pts.length - 1];\n  const dx = b.x - a.x, dy = b.y - a.y;\n  const len = Math.hypot(dx, dy);\n  let worst = 0;\n  for (let i = 1; i < pts.length - 1; i++) {\n    const p = pts[i];\n    const d = len === 0 ? Math.hypot(p.x - a.x, p.y - a.y) : Math.abs((p.x - a.x) * dy - (p.y - a.y) * dx) / len;\n    if (d > worst) worst = d;\n  }\n  return worst;\n}\n\n/** De Casteljau at one half, for a segment of any degree. */\nfunction halve(p: Piece): [Piece, Piece] {\n  let row = p.pts;\n  const left: Point[] = [row[0]];\n  const right: Point[] = [row[row.length - 1]];\n  while (row.length > 1) {\n    const next: Point[] = [];\n    for (let i = 0; i + 1 < row.length; i++) {\n      next.push({ x: (row[i].x + row[i + 1].x) / 2, y: (row[i].y + row[i + 1].y) / 2 });\n    }\n    row = next;\n    left.push(row[0]);\n    right.unshift(row[row.length - 1]);\n  }\n  const tm = (p.t0 + p.t1) / 2;\n  return [{ pts: left, t0: p.t0, t1: tm }, { pts: right, t0: tm, t1: p.t1 }];\n}\n\n/** Where chords p0→p1 and q0→q1 cross, as parameters on each, or null when\n *  they are parallel or miss. `slack` widens [0, 1] on both. */\nfunction chordCross(p0: Point, p1: Point, q0: Point, q1: Point, slack: number): [number, number] | null {\n  const rx = p1.x - p0.x, ry = p1.y - p0.y;\n  const sx = q1.x - q0.x, sy = q1.y - q0.y;\n  const den = rx * sy - ry * sx;\n  if (den === 0) return null;\n  const qx = q0.x - p0.x, qy = q0.y - p0.y;\n  const u = (qx * sy - qy * sx) / den;\n  const v = (qx * ry - qy * rx) / den;\n  if (u < -slack || u > 1 + slack || v < -slack || v > 1 + slack) return null;\n  return [u, v];\n}\n\n/** Newton on A(ta) − B(tb) = 0, kept inside [0, 1]. */\nfunction refine(a: Seg, b: Seg, ta: number, tb: number): [number, number] {\n  for (let i = 0; i < 12; i++) {\n    const pa = evalSeg(a, ta), pb = evalSeg(b, tb);\n    const fx = pa.x - pb.x, fy = pa.y - pb.y;\n    if (Math.abs(fx) + Math.abs(fy) < 1e-12) break;\n    const da = derivSeg(a, ta), db = derivSeg(b, tb);\n    // J = [da, -db]; solve J·[δa, δb] = −f.\n    const det = -da.x * db.y + da.y * db.x;\n    if (det === 0) break;\n    const dta = (-fx * -db.y - -fy * -db.x) / det;\n    const dtb = (da.x * -fy - da.y * -fx) / det;\n    ta = Math.min(1, Math.max(0, ta + dta));\n    tb = Math.min(1, Math.max(0, tb + dtb));\n  }\n  return [ta, tb];\n}\n\n/**\n * Every point where segment `a` crosses or touches segment `b` — each a line,\n * quadratic or cubic given by its control points — with the parameter on\n * each. Two lines are solved exactly; a curve is subdivided until its pieces\n * are flat, their chords crossed, and the answer refined against the curves.\n * Segments that overlap along a stretch report at most a few points of it.\n * Sorted by `ta`.\n */\nexport function intersectSegments(a: Point[], b: Point[]): SegmentCrossing[] {\n  if (a.length === 2 && b.length === 2) {\n    const uv = chordCross(a[0], a[1], b[0], b[1], 1e-12);\n    if (!uv) return [];\n    const ta = Math.min(1, Math.max(0, uv[0]));\n    const tb = Math.min(1, Math.max(0, uv[1]));\n    const p = evalSeg(a, ta);\n    return [{ ta, tb, x: p.x, y: p.y }];\n  }\n  const out: SegmentCrossing[] = [];\n  const push = (ta: number, tb: number) => {\n    [ta, tb] = refine(a, b, ta, tb);\n    const pa = evalSeg(a, ta), pb = evalSeg(b, tb);\n    if (Math.hypot(pa.x - pb.x, pa.y - pb.y) > 1e-6 * (1 + Math.abs(pa.x) + Math.abs(pa.y))) return;\n    if (out.some((h) => Math.abs(h.ta - ta) < SAME_T && Math.abs(h.tb - tb) < SAME_T)) return;\n    out.push({ ta, tb, x: pa.x, y: pa.y });\n  };\n  const stack: Array<[Piece, Piece, number]> = [[{ pts: a, t0: 0, t1: 1 }, { pts: b, t0: 0, t1: 1 }, 0]];\n  while (stack.length > 0 && out.length < MAX_HITS) {\n    const [p, q, depth] = stack.pop()!;\n    const bp = boxOf(p.pts), bq = boxOf(q.pts);\n    if (bp[0] > bq[2] + FLAT || bq[0] > bp[2] + FLAT || bp[1] > bq[3] + FLAT || bq[1] > bp[3] + FLAT) continue;\n    const fp = flatness(p.pts), fq = flatness(q.pts);\n    if ((fp <= FLAT && fq <= FLAT) || depth >= MAX_DEPTH) {\n      const uv = chordCross(p.pts[0], p.pts[p.pts.length - 1], q.pts[0], q.pts[q.pts.length - 1], 1e-6);\n      if (uv) push(p.t0 + uv[0] * (p.t1 - p.t0), q.t0 + uv[1] * (q.t1 - q.t0));\n      continue;\n    }\n    if (fp >= fq) {\n      const [l, r] = halve(p);\n      stack.push([l, q, depth + 1], [r, q, depth + 1]);\n    } else {\n      const [l, r] = halve(q);\n      stack.push([p, l, depth + 1], [p, r, depth + 1]);\n    }\n  }\n  return out.sort((h, k) => h.ta - k.ta);\n}\n","/** Reading a path into contours, and what a set of contours encloses. */\n\nimport { segmentsCross } from '../polyline';\nimport type { Path, PathFillRule } from '../path';\nimport { PATH_C, PATH_L, PATH_M, PATH_Q, PATH_Z } from '../commands';\nimport type { Point } from '../paths/cubicMath';\nimport { EPS } from '../scalar';\nimport { fillsOpenSubpaths } from '../openFill';\nimport { resolveCorners } from '../paths/corners';\nimport { worldCoords } from '../paths/pathOrigin';\nimport { type Contour, evalSeg, derivSeg, reverseContour, sideCoeffs, signChanges } from './contourSegments';\n\n/** The contours a fill of `path` covers: an open subpath closes implicitly\n *  where a fill closes it, and is left out where one does not. */\nexport function parseContours(path: Path): Contour[] {\n  const fillsOpen = path.kind === 'rect' || fillsOpenSubpaths(path);\n  return parseSubpaths(path).filter((s) => s.closed || fillsOpen).map((s) => s.segs);\n}\n\nexport interface Subpath {\n  segs: Contour;\n  /** Closed by a `Z` (or a rect); the closing edge, if any, is in `segs`. */\n  closed: boolean;\n}\n\n/**\n * Subpaths of `path` with their segments. With `implicitClose` (the default,\n * as a fill sees them) every subpath ends in its closing edge; without it,\n * only a subpath closed by `Z` does, as a stroke sees them.\n */\nexport function parseSubpaths(given: Path, implicitClose = true): Subpath[] {\n  const path = resolveCorners(given);\n  if (path.kind === 'rect') {\n    const { x, y, width: w, height: h } = path;\n    const p = [{ x, y }, { x: x + w, y }, { x: x + w, y: y + h }, { x, y: y + h }];\n    return [{ segs: p.map((q, i) => [q, p[(i + 1) % 4]]), closed: true }];\n  }\n  const out: Subpath[] = [];\n  let cur: Contour = [];\n  let start: Point = { x: 0, y: 0 };\n  let pen: Point = start;\n  const finish = (closed: boolean) => {\n    if (cur.length > 0 && (closed || implicitClose) && (pen.x !== start.x || pen.y !== start.y)) {\n      cur.push([pen, start]);\n    }\n    if (cur.length > 0) out.push({ segs: cur, closed });\n    cur = [];\n    pen = start;\n  };\n  const c = worldCoords(path);\n  let k = 0;\n  for (const cmd of path.commands) {\n    if (cmd === PATH_M) {\n      finish(false);\n      start = pen = { x: c[k], y: c[k + 1] };\n      k += 2;\n    } else if (cmd === PATH_L) {\n      const e = { x: c[k], y: c[k + 1] };\n      if (e.x !== pen.x || e.y !== pen.y) cur.push([pen, e]);\n      pen = e;\n      k += 2;\n    } else if (cmd === PATH_Q) {\n      const e = { x: c[k + 2], y: c[k + 3] };\n      cur.push([pen, { x: c[k], y: c[k + 1] }, e]);\n      pen = e;\n      k += 4;\n    } else if (cmd === PATH_C) {\n      const e = { x: c[k + 4], y: c[k + 5] };\n      cur.push([pen, { x: c[k], y: c[k + 1] }, { x: c[k + 2], y: c[k + 3] }, e]);\n      pen = e;\n      k += 6;\n    } else if (cmd === PATH_Z) {\n      finish(true);\n    }\n  }\n  finish(false);\n  return out;\n}\n\n/** Whether any contour crosses another or itself, judged on a flattening. */\nexport function contoursIntersect(contours: Contour[], tol: number): boolean {\n  type Edge = { x0: number; y0: number; x1: number; y1: number; c: number; i: number; n: number };\n  const edges: Edge[] = [];\n  contours.forEach((contour, ci) => {\n    const pts: Point[] = [];\n    for (const s of contour) {\n      let n = 1;\n      if (s.length > 2) {\n        let len = 0;\n        for (let i = 0; i + 1 < s.length; i++) len += Math.hypot(s[i + 1].x - s[i].x, s[i + 1].y - s[i].y);\n        n = Math.min(64, Math.max(2, Math.ceil(Math.sqrt(len / Math.max(tol, 1e-3)))));\n      }\n      for (let i = 0; i < n; i++) pts.push(evalSeg(s, i / n));\n    }\n    for (let i = 0; i < pts.length; i++) {\n      const p = pts[i], q = pts[(i + 1) % pts.length];\n      edges.push({ x0: p.x, y0: p.y, x1: q.x, y1: q.y, c: ci, i, n: pts.length });\n    }\n  });\n  for (let i = 0; i < edges.length; i++) {\n    const e = edges[i];\n    for (let j = i + 1; j < edges.length; j++) {\n      const f = edges[j];\n      if (e.c === f.c && (j - i === 1 || (i === 0 && f.i === f.n - 1))) continue;\n      if (Math.max(e.x0, e.x1) < Math.min(f.x0, f.x1) || Math.max(f.x0, f.x1) < Math.min(e.x0, e.x1)) continue;\n      if (Math.max(e.y0, e.y1) < Math.min(f.y0, f.y1) || Math.max(f.y0, f.y1) < Math.min(e.y0, e.y1)) continue;\n      if (segmentsCross(e.x0, e.y0, e.x1, e.y1, f.x0, f.y0, f.x1, f.y1)) return true;\n    }\n  }\n  return false;\n}\n\n/** Winding number of `q`, by a ray cast in +x against the exact curves. */\nexport function windingAt(q: Point, contours: Contour[]): number {\n  const dir = { x: 1, y: 0 };\n  let w = 0;\n  for (const contour of contours) {\n    for (const s of contour) {\n      for (const c of signChanges(sideCoeffs(s, q, dir), true)) {\n        if (evalSeg(s, c.t).x > q.x) w += c.after > 0 ? 1 : -1;\n      }\n    }\n  }\n  return w;\n}\n\n/** The diagonal of the box around every control point of `contours`. */\nexport function extentOf(contours: Contour[]): number {\n  let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;\n  for (const c of contours) for (const s of c) for (const p of s) {\n    minX = Math.min(minX, p.x); maxX = Math.max(maxX, p.x);\n    minY = Math.min(minY, p.y); maxY = Math.max(maxY, p.y);\n  }\n  return Math.hypot(maxX - minX, maxY - minY);\n}\n\n/** The area below which a region cut from `contours` is rounding, not a piece. */\nexport function negligibleArea(contours: Contour[]): number {\n  const extent = extentOf(contours);\n  return extent * extent * EPS * EPS;\n}\n\n/**\n * The contours that bound the fill, each turned so the fill lies on its left.\n * A contour with fill on both sides or neither (a same-direction inner ring\n * under nonzero) bounds nothing and is dropped.\n */\nexport function orientBoundaries(contours: Contour[], fillRule: PathFillRule): Contour[] {\n  const filled = (q: Point) => {\n    const w = windingAt(q, contours);\n    return fillRule === 'evenodd' ? (w & 1) !== 0 : w !== 0;\n  };\n  const eps = Math.max(extentOf(contours) * 1e-6, 1e-9);\n\n  const out: Contour[] = [];\n  for (const contour of contours) {\n    let probe = contour[0];\n    let best = -1;\n    for (const s of contour) {\n      const len = Math.hypot(s[s.length - 1].x - s[0].x, s[s.length - 1].y - s[0].y);\n      if (len > best) { best = len; probe = s; }\n    }\n    const p = evalSeg(probe, 0.5);\n    let tan = derivSeg(probe, 0.5);\n    const tl = Math.hypot(tan.x, tan.y);\n    if (tl === 0) continue;\n    tan = { x: tan.x / tl, y: tan.y / tl };\n    const left = filled({ x: p.x - tan.y * eps, y: p.y + tan.x * eps });\n    const right = filled({ x: p.x + tan.y * eps, y: p.y - tan.x * eps });\n    if (left && !right) out.push(contour);\n    else if (right && !left) out.push(reverseContour(contour));\n  }\n  return out;\n}\n","/** Grouping traced loops into regions, and writing contours back out as paths. */\n\nimport { pointInPolygon } from '../polyline';\nimport type { PolygonPath, PathFillRule } from '../path';\nimport { PATH_C, PATH_L, PATH_M, PATH_Q, PATH_Z } from '../commands';\nimport { type Contour, evalSeg, sampleContour, signedArea } from './contourSegments';\nimport type { Subpath } from './contours';\nimport { coordsFrom, originFor } from '../paths/pathOrigin';\n\n/** Group loops into regions: each positive loop with the holes it immediately contains. */\nexport function assembleRegions(outers: Contour[], holes: Contour[]): Contour[][] {\n  const regions = outers.map((o) => ({ loops: [o], ring: sampleContour(o), area: signedArea(o) }));\n  for (const h of holes) {\n    const hp = evalSeg(h[0], 0.5);\n    let best: (typeof regions)[number] | null = null;\n    for (const r of regions) {\n      if (pointInPolygon(r.ring, hp.x, hp.y) && (!best || r.area < best.area)) best = r;\n    }\n    best?.loops.push(h);\n  }\n  return regions.map((r) => r.loops);\n}\n\nexport const regionArea = (r: Contour[]): number => r.reduce((s, c) => s + signedArea(c), 0);\n\nexport const toPath = (loops: Contour[], fillRule: PathFillRule): PolygonPath =>\n  writePath(loops.map((segs) => ({ segs, closed: true })), fillRule);\n\nexport function writePath(subpaths: Subpath[], fillRule: PathFillRule): PolygonPath {\n  const cmds: number[] = [];\n  const xs: number[] = [];\n  for (const { segs, closed } of subpaths) {\n    cmds.push(PATH_M);\n    xs.push(segs[0][0].x, segs[0][0].y);\n    for (const s of segs) {\n      cmds.push(s.length === 2 ? PATH_L : s.length === 3 ? PATH_Q : PATH_C);\n      for (let i = 1; i < s.length; i++) xs.push(s[i].x, s[i].y);\n    }\n    if (closed) cmds.push(PATH_Z);\n  }\n  const origin = originFor(xs);\n  return {\n    kind: 'polygon', commands: new Uint8Array(cmds), coords: coordsFrom(origin, xs), fillRule, ...(origin ? { origin } : {}),\n  };\n}\n"]}

package/dist/{chunk-ZOMUTU7J.js → chunk-STYO7J4Y.js}

@@ -1,6 +1,5 @@
-import { nearestOnLine } from './chunk-2N6OWA7E.js';
-import { resolveCorners, fitCubicWithTangents } from './chunk-EURWZUNY.js';
-import { forEachSegment, PATH_Z, PATH_Q, elevateQuadraticToCubic, cubicBounds, PATH_C, PATH_L, PATH_M } from './chunk-B3D6KWW3.js';
+import { resolveCorners, fitCubicWithTangents } from './chunk-GA5R5KWD.js';
+import { forEachSegment, PATH_Z, PATH_Q, elevateQuadraticToCubic, cubicBounds, PATH_C, PATH_L, PATH_M, nearestOnLine, pointSegmentDist2 } from './chunk-346XYYMX.js';
 
 // src/paths/bounds.ts
 function boundsOfPath(path) {
@@ -157,12 +156,7 @@ function worstFromPolyline(from, to, bound) {
     const px = from[i], py = from[i + 1];
     let near = Infinity, at = hint;
     for (let j = hint, end = Math.min(edges, hint + reach); j < end; j++) {
-      const x0 = to[2 * j], y0 = to[2 * j + 1];
-      const dx = to[2 * j + 2] - x0, dy = to[2 * j + 3] - y0;
-      const len = dx * dx + dy * dy;
-      const s = len === 0 ? 0 : Math.min(1, Math.max(0, ((px - x0) * dx + (py - y0) * dy) / len));
-      const ex = x0 + s * dx - px, ey = y0 + s * dy - py;
-      const d = ex * ex + ey * ey;
+      const d = pointSegmentDist2(px, py, to[2 * j], to[2 * j + 1], to[2 * j + 2], to[2 * j + 3]);
       if (d < near) {
         near = d;
         at = j;
@@ -245,5 +239,5 @@ function unit(p) {
 }
 
 export { boundsOfPath, fitPointRun, keepCorner };
-//# sourceMappingURL=chunk-ZOMUTU7J.js.map
-//# sourceMappingURL=chunk-ZOMUTU7J.js.map
+//# sourceMappingURL=chunk-STYO7J4Y.js.map
+//# sourceMappingURL=chunk-STYO7J4Y.js.map

package/dist/chunk-STYO7J4Y.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/paths/bounds.ts","../src/paths/fitHandles.ts","../src/paths/fitRun.ts"],"names":["al","be"],"mappings":";;;;AAUO,SAAS,aAAa,IAAA,EAAsB;AACjD,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,EAAQ,OAAO,IAAA;AAEjC,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,eAAe,IAAI,CAAA;AAChD,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,CAAA,EAAE;AAAA,EACzD;AAEA,EAAA,IAAI,OAAO,QAAA,EAAU,IAAA,GAAO,QAAA,EAAU,IAAA,GAAO,WAAW,IAAA,GAAO,CAAA,QAAA;AAC/D,EAAA,IAAI,IAAA,GAAO,KAAA;AAEX,EAAA,MAAM,OAAA,GAAU,CAAC,CAAA,EAAW,CAAA,KAAc;AACxC,IAAA,IAAI,CAAA,GAAI,MAAM,IAAA,GAAO,CAAA;AACrB,IAAA,IAAI,CAAA,GAAI,MAAM,IAAA,GAAO,CAAA;AACrB,IAAA,IAAI,CAAA,GAAI,MAAM,IAAA,GAAO,CAAA;AACrB,IAAA,IAAI,CAAA,GAAI,MAAM,IAAA,GAAO,CAAA;AACrB,IAAA,IAAA,GAAO,IAAA;AAAA,EACT,CAAA;AAEA,EAAA,cAAA,CAAe,UAAU,MAAA,EAAQ,CAAC,GAAA,EAAK,EAAA,EAAI,IAAI,EAAA,KAAO;AACpD,IAAA,QAAQ,GAAA;AAAK,MACX,KAAK,MAAA;AAAA,MACL,KAAK,MAAA,EAAQ;AACX,QAAA,OAAA,CAAQ,OAAO,EAAE,CAAA,EAAG,MAAA,CAAO,EAAA,GAAK,CAAC,CAAC,CAAA;AAClC,QAAA;AAAA,MACF;AAAA,MACA,KAAK,MAAA,EAAQ;AACX,QAAA,MAAM,CAAC,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,GAAI,WAAA;AAAA,UACnC,EAAA;AAAA,UAAI,EAAA;AAAA,UACJ,OAAO,EAAE,CAAA;AAAA,UAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,UACzB,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,UAAG,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,UAC7B,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,UAAG,MAAA,CAAO,KAAK,CAAC;AAAA,SAC/B;AACA,QAAA,OAAA,CAAQ,OAAO,KAAK,CAAA;AACpB,QAAA,OAAA,CAAQ,OAAO,KAAK,CAAA;AACpB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,MAAA,EAAQ;AACX,QAAA,MAAM,GAAA,GAAM,OAAO,EAAA,GAAK,CAAC,GAAG,GAAA,GAAM,MAAA,CAAO,KAAK,CAAC,CAAA;AAC/C,QAAA,MAAM,CAAC,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAG,IAAI,uBAAA,CAAwB,EAAA,EAAI,EAAA,EAAI,MAAA,CAAO,EAAE,CAAA,EAAG,MAAA,CAAO,KAAK,CAAC,CAAA,EAAG,KAAK,GAAG,CAAA;AACjG,QAAA,MAAM,CAAC,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,GAAI,WAAA,CAAY,EAAA,EAAI,EAAA,EAAI,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,KAAK,GAAG,CAAA;AACrF,QAAA,OAAA,CAAQ,OAAO,KAAK,CAAA;AACpB,QAAA,OAAA,CAAQ,OAAO,KAAK,CAAA;AACpB,QAAA;AAAA,MACF;AAAA,MACA,KAAK,MAAA;AACH,QAAA;AAAA,MACF;AACE,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,GAAG,CAAA,CAAE,CAAA;AAAA;AAC1D,EACF,CAAC,CAAA;AAED,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,QAAQ,CAAA,EAAE;AAClE,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,MAAA;AAAA,IAAQ,CAAA,EAAG,IAAA,IAAQ,IAAA,CAAK,MAAA,EAAQ,CAAA,IAAK,CAAA,CAAA;AAAA,IAAI,CAAA,EAAG,IAAA,IAAQ,IAAA,CAAK,MAAA,EAAQ,CAAA,IAAK,CAAA,CAAA;AAAA,IAC5E,OAAO,IAAA,GAAO,IAAA;AAAA,IAAM,QAAQ,IAAA,GAAO;AAAA,GACrC;AACF;;;ACpDA,IAAM,IAAA,GAAO,CAAC,IAAA,EAAM,GAAA,EAAK,KAAK,GAAA,EAAK,IAAA,EAAM,GAAA,EAAK,GAAA,EAAK,IAAI,CAAA;AAEvD,IAAM,SAAA,GAAY,EAAA;AAElB,IAAM,WAAA,GAAc,EAAA;AAEpB,IAAM,MAAA,GAAS,GAAA;AAEf,IAAM,YAAA,GAAe,CAAA;AAErB,IAAM,OAAA,GAAU,CAAA;AAEhB,IAAM,YAAY,CAAA,GAAI,EAAA;AACtB,IAAM,cAAA,GAAiB,GAAA;AAGhB,SAAS,QAAQ,GAAA,EAAqC;AAC3D,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,CAAA,GAAI,IAAI,MAAM,CAAA;AAC3C,EAAA,GAAA,CAAI,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AAAE,IAAA,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA;AAAG,IAAA,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,CAAE,CAAA;AAAA,EAAG,CAAC,CAAA;AACjE,EAAA,OAAO,GAAA;AACT;AAUO,SAAS,YAAY,GAAA,EAAmB,CAAA,EAAU,GAAA,EAAY,GAAA,EAAY,GAAU,GAAA,EAAsB;AAE/G,EAAA,MAAM,OAAO,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,GAAA,CAAI,IAAI,GAAA,CAAI,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,IAAI,GAAA,CAAI,CAAA,GAAI,GAAA,CAAI,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,CAAA,GAAI,IAAI,GAAA,CAAI,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,IAAI,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA,CAAE,CAAC,CAAC,CAAA;AACpJ,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,cAAA,EAAgB,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,KAAK,IAAA,IAAQ,CAAA,GAAI,YAAY,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AAClG,EAAA,MAAM,GAAA,GAAM,IAAA,IAAQ,CAAA,GAAI,CAAA,GAAI,CAAA,CAAA;AAC5B,EAAA,MAAM,QAAQ,GAAA,GAAM,GAAA;AACpB,EAAA,IAAI,KAAA,IAAS,GAAG,OAAO,KAAA;AACvB,EAAA,MAAM,IAAA,GAAO,IAAI,YAAA,CAAa,CAAA,IAAK,IAAI,CAAA,CAAE,CAAA;AACzC,EAAA,OAAA,CAAQ,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,CAAA,EAAG,IAAI,CAAA;AAC5B,EAAA,OAAO,iBAAA,CAAkB,GAAA,EAAK,IAAA,EAAM,KAAK,CAAA,IAAK,SAAS,iBAAA,CAAkB,IAAA,EAAM,GAAA,EAAK,KAAK,CAAA,IAAK,KAAA;AAChG;AAUO,SAAS,cAAc,GAAA,EAAmB,CAAA,EAAU,GAAU,MAAA,EAAe,IAAA,EAAa,KAAa,IAAA,EAA+B;AAC3I,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AAC7C,EAAA,MAAM,EAAA,GAAK,CAACA,GAAAA,EAAYC,GAAAA,MAAyB;AAAA,IAC/C,GAAA,EAAK,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAID,GAAAA,GAAK,MAAA,CAAO,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAIA,GAAAA,GAAK,OAAO,CAAA,EAAE;AAAA,IACtD,GAAA,EAAK,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAIC,GAAAA,GAAK,IAAA,CAAK,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAIA,GAAAA,GAAK,KAAK,CAAA;AAAE,GACpD,CAAA;AACA,EAAA,MAAM,IAAA,GAAO,IAAI,YAAA,CAAa,CAAA,IAAK,cAAc,CAAA,CAAE,CAAA;AAEnD,EAAA,MAAM,MAAA,GAAS,CAACD,GAAAA,EAAYC,GAAAA,EAAY,KAAA,KAAkB;AACxD,IAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,EAAA,CAAGD,KAAIC,GAAE,CAAA;AAC9B,IAAA,OAAA,CAAQ,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,CAAA,EAAG,IAAI,CAAA;AAC5B,IAAA,MAAM,GAAA,GAAM,iBAAA,CAAkB,GAAA,EAAK,IAAA,EAAM,KAAK,CAAA;AAC9C,IAAA,OAAO,GAAA,GAAM,KAAA,GAAQ,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,KAAK,iBAAA,CAAkB,IAAA,EAAM,GAAA,EAAK,KAAK,CAAC,CAAA;AAAA,EAC9E,CAAA;AACA,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,CAAA,EAAA,CAAI,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,MAAA,CAAO,KAAK,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,CAAE,CAAA,IAAK,OAAO,CAAC,CAAA;AACxF,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,CAAA,EAAA,CAAI,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,IAAA,CAAK,KAAK,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,CAAE,CAAA,IAAK,KAAK,CAAC,CAAA;AACpF,EAAA,IAAI,EAAA,GAAK,QAAQ,EAAA,GAAK,MAAA,EAAQ,OAAO,MAAA,CAAO,EAAA,EAAI,IAAI,QAAQ,CAAA;AAC5D,EAAA,IAAI,IAAA,GAAO,YAAA,GAAe,GAAA,EAAK,OAAO,IAAA;AACtC,EAAA,KAAA,MAAW,EAAA,IAAM,IAAA,EAAM,KAAA,MAAW,EAAA,IAAM,IAAA,EAAM;AAC5C,IAAA,MAAM,IAAI,MAAA,CAAO,EAAA,GAAK,KAAA,EAAO,EAAA,GAAK,OAAO,IAAI,CAAA;AAC7C,IAAA,IAAI,IAAI,IAAA,EAAM;AAAE,MAAA,IAAA,GAAO,CAAA;AAAG,MAAA,EAAA,GAAK,EAAA,GAAK,KAAA;AAAO,MAAA,EAAA,GAAK,EAAA,GAAK,KAAA;AAAA,IAAO;AAAA,EAC9D;AACA,EAAA,IAAI,IAAA,GAAO,OAAA,GAAU,GAAA,EAAK,OAAO,IAAA;AACjC,EAAA,IAAI,OAAO,KAAA,GAAQ,IAAA;AACnB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,SAAA,IAAa,IAAA,GAAO,SAAS,GAAA,IAAO,IAAA,GAAO,GAAA,GAAM,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5E,IAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,EAAE,CAAA,IAAK,KAAA,EAAO;AAC5B,MAAA,MAAM,KAAK,EAAA,GAAK,EAAA,GAAK,IAAA,EAAM,EAAA,GAAK,KAAK,EAAA,GAAK,IAAA;AAC1C,MAAA,IAAI,EAAA,GAAK,CAAA,IAAK,EAAA,GAAK,CAAA,EAAG;AACtB,MAAA,MAAM,CAAA,GAAI,MAAA,CAAO,EAAA,EAAI,EAAA,EAAI,IAAI,CAAA;AAC7B,MAAA,IAAI,IAAI,IAAA,EAAM;AAAE,QAAA,IAAA,GAAO,CAAA;AAAG,QAAA,EAAA,GAAK,EAAA;AAAI,QAAA,EAAA,GAAK,EAAA;AAAI,QAAA,KAAA,GAAQ,IAAA;AAAM,QAAA;AAAA,MAAO;AAAA,IACnE;AACA,IAAA,IAAI,CAAC,OAAO,IAAA,IAAQ,CAAA;AAAA,EACtB;AACA,EAAA,OAAO,EAAA,CAAG,IAAI,EAAE,CAAA;AAClB;AAEA,IAAM,KAAA,GAAQ,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAC,EAAA,EAAI,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAC,GAAG,CAAC,CAAA,EAAG,EAAE,CAAA,EAAG,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,CAAC,EAAA,EAAI,EAAE,CAAA,EAAG,CAAC,GAAG,EAAE,CAAA,EAAG,CAAC,EAAA,EAAI,CAAC,CAAC,CAAA;AAGnF,SAAS,OAAA,CAAQ,CAAA,EAAU,GAAA,EAAY,GAAA,EAAY,GAAU,GAAA,EAAyB;AACpF,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,MAAA,GAAS,CAAA,GAAI,CAAA;AAC3B,EAAA,MAAM,KAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,GAAI,CAAA,IAAK,IAAI,CAAA,GAAI,GAAA,CAAI,CAAA,CAAA,EAAI,EAAA,GAAK,EAAE,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA,IAAK,GAAA,CAAI,IAAI,GAAA,CAAI,CAAA,CAAA;AAC9E,EAAA,MAAM,KAAK,CAAA,IAAK,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,IAAI,CAAA,GAAI,GAAA,CAAI,CAAA,CAAA,EAAI,EAAA,GAAK,KAAK,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,GAAA,CAAI,IAAI,GAAA,CAAI,CAAA,CAAA;AAC1E,EAAA,MAAM,EAAA,GAAK,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA,CAAE,IAAI,EAAA,GAAK,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA;AAClD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3B,IAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,IAAA,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,GAAA,CAAA,CAAM,EAAA,GAAK,IAAI,EAAA,IAAM,CAAA,GAAI,EAAA,IAAM,CAAA,GAAI,CAAA,CAAE,CAAA;AAC9C,IAAA,GAAA,CAAI,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,GAAA,CAAA,CAAM,EAAA,GAAK,IAAI,EAAA,IAAM,CAAA,GAAI,EAAA,IAAM,CAAA,GAAI,CAAA,CAAE,CAAA;AAAA,EACpD;AACF;AASA,SAAS,iBAAA,CAAkB,IAAA,EAAoB,EAAA,EAAkB,KAAA,EAAuB;AACtF,EAAA,MAAM,KAAA,GAAQ,EAAA,CAAG,MAAA,GAAS,CAAA,GAAI,CAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,SAAS,CAAC,CAAA;AACpC,EAAA,MAAM,QAAQ,KAAA,GAAQ,KAAA;AACtB,EAAA,IAAI,IAAA,GAAO,GAAG,KAAA,GAAQ,CAAA;AACtB,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,KAAK,MAAA,GAAS,CAAA,EAAG,KAAK,CAAA,EAAG;AAC3C,IAAA,MAAM,KAAK,IAAA,CAAK,CAAC,GAAG,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA;AACnC,IAAA,IAAI,IAAA,GAAO,UAAU,EAAA,GAAK,IAAA;AAC1B,IAAA,KAAA,IAAS,CAAA,GAAI,IAAA,EAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,IAAA,GAAO,KAAK,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,CAAA,EAAA,EAAK;AACpE,MAAA,MAAM,CAAA,GAAI,kBAAkB,EAAA,EAAI,EAAA,EAAI,GAAG,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA,CAAG,IAAI,CAAA,GAAI,CAAC,GAAG,EAAA,CAAG,CAAA,GAAI,CAAA,GAAI,CAAC,CAAC,CAAA;AAC1F,MAAA,IAAI,IAAI,IAAA,EAAM;AAAE,QAAA,IAAA,GAAO,CAAA;AAAG,QAAA,EAAA,GAAK,CAAA;AAAA,MAAG;AAAA,IACpC;AACA,IAAA,IAAA,GAAO,EAAA;AACP,IAAA,IAAI,OAAO,KAAA,EAAO;AAChB,MAAA,KAAA,GAAQ,IAAA;AACR,MAAA,IAAI,QAAQ,KAAA,EAAO;AAAA,IACrB;AAAA,EACF;AACA,EAAA,OAAO,IAAA,CAAK,KAAK,KAAK,CAAA;AACxB;;;ACnIO,SAAS,UAAA,CAAW,IAAe,IAAA,EAAuB;AAC/D,EAAA,IAAI,KAAK,MAAA,EAAQ,EAAA,CAAG,SAAS,EAAE,GAAG,KAAK,MAAA,EAAO;AAChD;AAQO,SAAS,YAAY,GAAA,EAAc,MAAA,EAAe,IAAA,EAAa,GAAA,EAAa,KAAkB,OAAA,EAAwB;AAC3H,EAAA,IAAI,IAAI,MAAA,KAAW,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,GAAA,CAAI,CAAC,CAAA,CAAE,GAAG,CAAA,EAAG,GAAA,CAAI,CAAC,CAAA,CAAE,GAAG,CAAA;AAC3D,EAAA,MAAM,OAAc,EAAC;AACrB,EAAA,SAAA,CAAU,GAAA,EAAK,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA;AACtC,EAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,GAAA,EAAK,CAAA,KAAM;AACvB,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;AAC/B,IAAA,IAAI,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,SAAA,GAAY,GAAA,CAAI,EAAA;AACjC,IAAA,MAAM,MAAA,GAAS,CAAA,KAAM,IAAA,CAAK,MAAA,GAAS,CAAA;AACnC,IAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,MAAA,IAAI,IAAI,EAAA,EAAI,GAAA,CAAI,CAAC,CAAA,CAAE,WAAW,GAAA,CAAI,EAAA;AAClC,MAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,EAAA,GAAK,EAAE,CAAA,EAAG,IAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,UAAU,GAAA,CAAI,EAAA,EAAG,GAAI,EAAE,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,GAAA,CAAI,GAAA,CAAI,CAAA,EAAG,CAAA;AAAA,EACrG,CAAC,CAAA;AACH;AAUA,SAAS,SAAA,CAAU,GAAA,EAAc,MAAA,EAAe,IAAA,EAAa,KAAa,GAAA,EAAkB;AAC1F,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,GAAA,GAAM,MAAA;AACV,EAAA,WAAS;AACP,IAAA,MAAM,KAAA,GAAQ,OAAO,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG,GAAA,EAAK,MAAM,GAAG,CAAA;AACpD,IAAA,IAAI,KAAA,EAAO;AAAE,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAG,MAAA;AAAA,IAAQ;AACtC,IAAA,IAAI,EAAA,GAAK,IAAA,GAAO,CAAA,EAAG,EAAA,GAAK,IAAI,MAAA,GAAS,CAAA;AACrC,IAAA,IAAI,KAAA,GAAa,EAAE,GAAA,EAAK,GAAA,CAAI,EAAE,CAAA,EAAE;AAChC,IAAA,OAAO,EAAA,GAAK,KAAK,CAAA,EAAG;AAClB,MAAA,MAAM,GAAA,GAAO,KAAK,EAAA,IAAO,CAAA;AACzB,MAAA,MAAM,GAAA,GAAM,MAAA,CAAO,GAAA,CAAI,KAAA,CAAM,MAAM,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,EAAK,IAAI,SAAA,CAAU,GAAA,EAAK,GAAG,CAAC,GAAG,GAAG,CAAA;AAC/E,MAAA,IAAI,GAAA,EAAK;AAAE,QAAA,EAAA,GAAK,GAAA;AAAK,QAAA,KAAA,GAAQ,GAAA;AAAA,MAAK,OAAO,EAAA,GAAK,GAAA;AAAA,IAChD;AACA,IAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,IAAA,GAAA,GAAM,SAAA,CAAU,KAAK,EAAE,CAAA;AACvB,IAAA,IAAA,GAAO,EAAA;AAAA,EACT;AACF;AAEA,IAAM,SAAA,GAAY,CAAC,GAAA,EAAc,CAAA,KAAqB,KAAK,IAAA,CAAK,GAAA,CAAI,CAAA,GAAI,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,GAAI,CAAC,CAAC,CAAC,CAAA;AAGvF,SAAS,MAAA,CAAO,GAAA,EAAc,MAAA,EAAe,IAAA,EAAa,GAAA,EAAyB;AACjF,EAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA;AACf,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA;AAC5B,EAAA,IAAI,GAAA,CAAI,MAAA,IAAU,CAAA,IAAK,UAAA,CAAW,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAG,OAAO,EAAE,GAAA,EAAK,CAAA,EAAE;AACnE,EAAA,MAAM,GAAA,GAAM,QAAQ,GAAG,CAAA;AACvB,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,KAAQ,oBAAA,CAAqB,GAAA,EAAK,QAAQ,IAAI,CAAA;AAC3D,EAAA,IAAI,WAAA,CAAY,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,KAAK,CAAA,EAAG,GAAG,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,GAAA,EAAK,KAAK,CAAA,EAAE;AAC7E,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,EAAE,GAAA,EAAK,GAAA,EAAK,CAAA;AACtE,EAAA,OAAO,KAAA,IAAS,YAAY,GAAA,EAAK,CAAA,EAAG,MAAM,GAAA,EAAK,KAAA,CAAM,KAAK,CAAA,EAAG,GAAG,IAAI,EAAE,EAAA,EAAI,MAAM,GAAA,EAAK,EAAA,EAAI,MAAM,GAAA,EAAK,GAAA,EAAK,GAAE,GAAI,IAAA;AACjH;AAEA,SAAS,UAAA,CAAW,GAAA,EAAc,CAAA,EAAU,CAAA,EAAU,GAAA,EAAsB;AAC1E,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AACvC,IAAA,IAAI,aAAA,CAAc,IAAI,CAAC,CAAA,CAAE,GAAG,GAAA,CAAI,CAAC,EAAE,CAAA,EAAG,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,CAAE,IAAA,GAAO,KAAK,OAAO,KAAA;AAAA,EAC/E;AACA,EAAA,OAAO,IAAA;AACT;AAEA,IAAM,IAAA,GAAO,CAAC,CAAA,EAAU,CAAA,MAAqB,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,EAAE,CAAA;AAC1E,IAAM,GAAA,GAAM,CAAC,CAAA,MAAqB,EAAE,CAAA,EAAG,CAAC,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,CAAE,CAAA,EAAE,CAAA;AACrD,SAAS,KAAK,CAAA,EAAiB;AAC7B,EAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,EAAG,EAAE,CAAC,CAAA;AAC/B,EAAA,OAAO,QAAQ,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,EAAG,GAAG,CAAA,EAAE,GAAI,EAAE,CAAA,EAAG,EAAE,CAAA,GAAI,GAAA,EAAK,CAAA,EAAG,CAAA,CAAE,IAAI,GAAA,EAAI;AACnE","file":"chunk-STYO7J4Y.js","sourcesContent":["import { cubicBounds, elevateQuadraticToCubic } from '../curve';\nimport { forEachSegment, PATH_C, PATH_L, PATH_M, PATH_Q, PATH_Z } from '../commands';\nimport type { Path, RectPath } from '../path';\nimport { resolveCorners } from './corners';\n\n/**\n * AABB of a `Path`, returned as a `RectPath` for direct reuse with rect-fast-path machinery.\n * Control points are NOT included directly; they're used only to compute extrema that actually\n * lie on the curve. Corner shapes are bounded as they are drawn, expanded. Empty paths (no commands) return a zero-size rect anchored at the origin.\n */\nexport function boundsOfPath(path: Path): RectPath {\n  if (path.kind === 'rect') return path;\n\n  const { commands, coords } = resolveCorners(path);\n  if (commands.length === 0) {\n    return { kind: 'rect', x: 0, y: 0, width: 0, height: 0 };\n  }\n\n  let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;\n  let seen = false;\n\n  const include = (x: number, y: number) => {\n    if (x < minX) minX = x;\n    if (x > maxX) maxX = x;\n    if (y < minY) minY = y;\n    if (y > maxY) maxY = y;\n    seen = true;\n  };\n\n  forEachSegment(commands, coords, (cmd, ci, px, py) => {\n    switch (cmd) {\n      case PATH_M:\n      case PATH_L: {\n        include(coords[ci], coords[ci + 1]);\n        break;\n      }\n      case PATH_C: {\n        const [bMinX, bMinY, bMaxX, bMaxY] = cubicBounds(\n          px, py,\n          coords[ci], coords[ci + 1],\n          coords[ci + 2], coords[ci + 3],\n          coords[ci + 4], coords[ci + 5],\n        );\n        include(bMinX, bMinY);\n        include(bMaxX, bMaxY);\n        break;\n      }\n      case PATH_Q: {\n        const qx2 = coords[ci + 2], qy2 = coords[ci + 3];\n        const [c1x, c1y, c2x, c2y] = elevateQuadraticToCubic(px, py, coords[ci], coords[ci + 1], qx2, qy2);\n        const [bMinX, bMinY, bMaxX, bMaxY] = cubicBounds(px, py, c1x, c1y, c2x, c2y, qx2, qy2);\n        include(bMinX, bMinY);\n        include(bMaxX, bMaxY);\n        break;\n      }\n      case PATH_Z:\n        break;\n      default:\n        throw new Error(`boundsOfPath: unknown command ${cmd}`);\n    }\n  });\n\n  if (!seen) return { kind: 'rect', x: 0, y: 0, width: 0, height: 0 };\n  return {\n    kind: 'rect', x: minX + (path.origin?.x ?? 0), y: minY + (path.origin?.y ?? 0),\n    width: maxX - minX, height: maxY - minY,\n  };\n}\n\n","/**\n * How far a cubic and a run of samples stray from each other, and the handle\n * lengths that bring them closest: the measure and the search behind\n * `fitPointRun`. Both work on flattened cubics and on the run as a polyline.\n */\nimport type { Point } from './cubicMath';\nimport { pointSegmentDist2 } from '../points2';\n\n/** A cubic's two handles. */\nexport interface Handles {\n  cp1: Point;\n  cp2: Point;\n}\n\n/** Handle lengths tried on each axis of the coarse search, as shares of the chord. */\nconst GRID = [0.02, 0.1, 0.2, 0.3, 0.45, 0.6, 0.8, 1.05];\n/** Most steps of the pattern search after the coarse one. */\nconst MAX_STEPS = 60;\n/** Segments the cubic is flattened to while the search compares handle lengths. */\nconst SEARCH_FLAT = 48;\n/** The search stops once the run and the cubic are within this share of the tolerance. */\nconst TARGET = 0.9;\n/** A least-squares fit farther than this many tolerances from the run is not searched around. */\nconst SEARCH_REACH = 4;\n/** A coarse best farther than this many tolerances is not worth refining. */\nconst GIVE_UP = 2;\n/** How far a flattened cubic may sit from the cubic, as a share of the tolerance, when checking a fit. */\nconst CHECK_SAG = 1 / 16;\nconst MAX_CHECK_FLAT = 512;\n\n/** `pts` as interleaved `x, y`. */\nexport function packRun(pts: readonly Point[]): Float64Array {\n  const run = new Float64Array(2 * pts.length);\n  pts.forEach((p, i) => { run[2 * i] = p.x; run[2 * i + 1] = p.y; });\n  return run;\n}\n\n/**\n * Whether the cubic from `a` to `e` lies within `tol` of the polyline through\n * `run`, and every sample of `run` within `tol` of it. The samples hold the\n * run to the cubic; the other way holds the cubic to the run, which a cubic\n * bulging across a sparsely sampled flat fails. The cubic is flattened finely\n * enough that its chords stay within a sixteenth of `tol` of it, and that\n * much is taken off the bound.\n */\nexport function cubicWithin(run: Float64Array, a: Point, cp1: Point, cp2: Point, e: Point, tol: number): boolean {\n  // A chord of a cubic split N ways sits within max|B''| / 8N² of it, and |B''| is at most 6 × the larger second difference.\n  const bend = 6 * Math.max(Math.hypot(a.x - 2 * cp1.x + cp2.x, a.y - 2 * cp1.y + cp2.y), Math.hypot(cp1.x - 2 * cp2.x + e.x, cp1.y - 2 * cp2.y + e.y));\n  const n = Math.min(MAX_CHECK_FLAT, Math.max(8, Math.ceil(Math.sqrt(bend / (8 * CHECK_SAG * tol)))));\n  const sag = bend / (8 * n * n);\n  const bound = tol - sag;\n  if (bound <= 0) return false;\n  const flat = new Float64Array(2 * (n + 1));\n  flatten(a, cp1, cp2, e, flat);\n  return worstFromPolyline(run, flat, bound) <= bound && worstFromPolyline(flat, run, bound) <= bound;\n}\n\n/**\n * The handle lengths, directions held, that bring the run nearest the cubic\n * both ways: a coarse grid, then a pattern search from its best; null when\n * even the best of the grid is far off. Least squares minimizes the sum, so\n * its worst sample can sit well outside a tolerance other lengths meet, often\n * in another basin entirely: a bend near one end wants that end's handle\n * short. The caller checks the result with {@link cubicWithin}.\n */\nexport function searchHandles(run: Float64Array, a: Point, e: Point, tStart: Point, tEnd: Point, tol: number, from: Handles): Handles | null {\n  const chord = Math.hypot(e.x - a.x, e.y - a.y);\n  const at = (al: number, be: number): Handles => ({\n    cp1: { x: a.x + al * tStart.x, y: a.y + al * tStart.y },\n    cp2: { x: e.x + be * tEnd.x, y: e.y + be * tEnd.y },\n  });\n  const flat = new Float64Array(2 * (SEARCH_FLAT + 1));\n  /** How far apart the run and the cubic get, or some figure above `bound` once they pass it. */\n  const spread = (al: number, be: number, bound: number) => {\n    const { cp1, cp2 } = at(al, be);\n    flatten(a, cp1, cp2, e, flat);\n    const out = worstFromPolyline(run, flat, bound);\n    return out > bound ? out : Math.max(out, worstFromPolyline(flat, run, bound));\n  };\n  const fromAl = Math.max(0, (from.cp1.x - a.x) * tStart.x + (from.cp1.y - a.y) * tStart.y);\n  const fromBe = Math.max(0, (from.cp2.x - e.x) * tEnd.x + (from.cp2.y - e.y) * tEnd.y);\n  let al = fromAl, be = fromBe, best = spread(al, be, Infinity);\n  if (best > SEARCH_REACH * tol) return null;\n  for (const fa of GRID) for (const fb of GRID) {\n    const d = spread(fa * chord, fb * chord, best);\n    if (d < best) { best = d; al = fa * chord; be = fb * chord; }\n  }\n  if (best > GIVE_UP * tol) return null;\n  let step = chord * 0.05;\n  for (let i = 0; i < MAX_STEPS && best > TARGET * tol && step > tol / 32; i++) {\n    let moved = false;\n    for (const [da, db] of STEPS) {\n      const na = al + da * step, nb = be + db * step;\n      if (na < 0 || nb < 0) continue;\n      const d = spread(na, nb, best);\n      if (d < best) { best = d; al = na; be = nb; moved = true; break; }\n    }\n    if (!moved) step /= 2;\n  }\n  return at(al, be);\n}\n\nconst STEPS = [[1, 0], [-1, 0], [0, 1], [0, -1], [1, 1], [-1, -1], [1, -1], [-1, 1]];\n\n/** The cubic at even parameters, as many as `out` holds points, into `out`. */\nfunction flatten(a: Point, cp1: Point, cp2: Point, e: Point, out: Float64Array): void {\n  const n = out.length / 2 - 1;\n  const ax = e.x - a.x + 3 * (cp1.x - cp2.x), ay = e.y - a.y + 3 * (cp1.y - cp2.y);\n  const bx = 3 * (a.x - 2 * cp1.x + cp2.x), by = 3 * (a.y - 2 * cp1.y + cp2.y);\n  const cx = 3 * (cp1.x - a.x), cy = 3 * (cp1.y - a.y);\n  for (let k = 0; k <= n; k++) {\n    const t = k / n;\n    out[2 * k] = ((ax * t + bx) * t + cx) * t + a.x;\n    out[2 * k + 1] = ((ay * t + by) * t + cy) * t + a.y;\n  }\n}\n\n/**\n * The farthest any interior point of `from` lies from the polyline through\n * `to`, both interleaved `x, y` and running the same way; it stops early,\n * with a figure above `bound`, once one is farther than that. Each point\n * looks only a stretch ahead of where the last one landed, so a polyline\n * doubling back reads as farther than it is, never nearer.\n */\nfunction worstFromPolyline(from: Float64Array, to: Float64Array, bound: number): number {\n  const edges = to.length / 2 - 1;\n  const reach = Math.max(4, edges >> 2);\n  const limit = bound * bound;\n  let hint = 0, worst = 0;\n  for (let i = 2; i < from.length - 2; i += 2) {\n    const px = from[i], py = from[i + 1];\n    let near = Infinity, at = hint;\n    for (let j = hint, end = Math.min(edges, hint + reach); j < end; j++) {\n      const d = pointSegmentDist2(px, py, to[2 * j], to[2 * j + 1], to[2 * j + 2], to[2 * j + 3]);\n      if (d < near) { near = d; at = j; }\n    }\n    hint = at;\n    if (near > worst) {\n      worst = near;\n      if (worst > limit) break;\n    }\n  }\n  return Math.sqrt(worst);\n}\n","/**\n * Fitting a run of sampled points with as few cubics as hold it within a\n * tolerance, each held to the run's end tangents: the refit `simplifyPath`\n * and `warpPath` share.\n */\nimport { nearestOnLine } from '../nearest';\nimport type { PenAnchor } from './anchors';\nimport type { Point } from './cubicMath';\nimport { cubicWithin, packRun, searchHandles } from './fitHandles';\nimport { fitCubicWithTangents } from './schneiderFit';\n\n/** Give `to`, an anchor a refit kept where `from` was, `from`'s corner spec. */\nexport function keepCorner(to: PenAnchor, from: PenAnchor): void {\n  if (from.corner) to.corner = { ...from.corner };\n}\n\n/**\n * Fit `pts` with cubics held to the end tangents, each the longest stretch one\n * cubic holds within `tol`, and append the anchors after the first to `out`\n * (the first too when `out` is empty). `closing` folds the final anchor,\n * which lands on the subpath's first, into that first one.\n */\nexport function fitPointRun(pts: Point[], tStart: Point, tEnd: Point, tol: number, out: PenAnchor[], closing: boolean): void {\n  if (out.length === 0) out.push({ x: pts[0].x, y: pts[0].y });\n  const segs: Seg[] = [];\n  fitGreedy(pts, tStart, tEnd, tol, segs);\n  segs.forEach((seg, i) => {\n    const prev = out[out.length - 1];\n    if (seg.c1) prev.outHandle = seg.c1;\n    const isLast = i === segs.length - 1;\n    if (closing && isLast) {\n      if (seg.c2) out[0].inHandle = seg.c2;\n      return;\n    }\n    out.push(seg.c2 ? { x: seg.end.x, y: seg.end.y, inHandle: seg.c2 } : { x: seg.end.x, y: seg.end.y });\n  });\n}\n\ntype Seg = { c1?: Point; c2?: Point; end: Point };\n\n/**\n * Each piece is the longest prefix of what is left that one cubic holds,\n * found by bisecting on its end sample. Splitting at the worst sample instead\n * cuts where a poor first fit strays most, which is rarely where a piece has\n * to end: it refit a puppet-warped bar with twice the anchors it needed.\n */\nfunction fitGreedy(pts: Point[], tStart: Point, tEnd: Point, tol: number, out: Seg[]): void {\n  let from = 0;\n  let tIn = tStart;\n  for (;;) {\n    const whole = fitOne(pts.slice(from), tIn, tEnd, tol);\n    if (whole) { out.push(whole); return; }\n    let lo = from + 1, hi = pts.length - 1;\n    let piece: Seg = { end: pts[lo] };\n    while (hi - lo > 1) {\n      const mid = (lo + hi) >> 1;\n      const fit = fitOne(pts.slice(from, mid + 1), tIn, neg(tangentAt(pts, mid)), tol);\n      if (fit) { lo = mid; piece = fit; } else hi = mid;\n    }\n    out.push(piece);\n    tIn = tangentAt(pts, lo);\n    from = lo;\n  }\n}\n\nconst tangentAt = (pts: Point[], k: number): Point => unit(sub2(pts[k + 1], pts[k - 1]));\n\n/** One cubic held to the run's end tangents within `tol` of the run both ways, or null. */\nfunction fitOne(pts: Point[], tStart: Point, tEnd: Point, tol: number): Seg | null {\n  const a = pts[0];\n  const e = pts[pts.length - 1];\n  if (pts.length <= 2 || withinLine(pts, a, e, tol)) return { end: e };\n  const run = packRun(pts);\n  const { cp1, cp2 } = fitCubicWithTangents(pts, tStart, tEnd);\n  if (cubicWithin(run, a, cp1, cp2, e, tol)) return { c1: cp1, c2: cp2, end: e };\n  const found = searchHandles(run, a, e, tStart, tEnd, tol, { cp1, cp2 });\n  return found && cubicWithin(run, a, found.cp1, found.cp2, e, tol) ? { c1: found.cp1, c2: found.cp2, end: e } : null;\n}\n\nfunction withinLine(pts: Point[], a: Point, e: Point, tol: number): boolean {\n  for (let i = 1; i < pts.length - 1; i++) {\n    if (nearestOnLine(pts[i].x, pts[i].y, a.x, a.y, e.x, e.y).dist > tol) return false;\n  }\n  return true;\n}\n\nconst sub2 = (p: Point, q: Point): Point => ({ x: p.x - q.x, y: p.y - q.y });\nconst neg = (p: Point): Point => ({ x: -p.x, y: -p.y });\nfunction unit(p: Point): Point {\n  const len = Math.hypot(p.x, p.y);\n  return len === 0 ? { x: 0, y: 0 } : { x: p.x / len, y: p.y / len };\n}\n"]}

package/dist/{curvature-CDOI32hv.d.ts → curvature-DKPO4Qeh.d.ts}

@@ -54,33 +54,6 @@ declare function eulerCurvatureAt(seg: EulerSegment, s: number): number;
  *  to world arc length, at fraction `s` of it. */
 declare function eulerCurvatureDerivativesAt(seg: EulerSegment, s: number): [number, number];
 
-/**
- * Spiro curves: a spline defined by on-curve points alone. Between each pair
- * of neighboring points runs an Euler-spiral segment (`eulerSpiral`), and the
- * segments are solved together so that, at every smooth point, both the
- * tangent and the curvature carry straight through. The curve has no handles
- * to tune; moving a point re-solves the whole curve.
- *
- * Each point's kind says what holds at it:
- *
- * | kind | at the point |
- * |---|---|
- * | `smooth` | tangent and curvature continue (G2); next to a straight segment, the curve leaves along the line |
- * | `g4` | tangent, curvature, and the curvature's first two derivatives continue (G4); otherwise as `smooth` |
- * | `corner` | the two sides are independent; each meets the point with zero curvature |
- * | `left` | the segment arriving is straight, and the curve leaving continues the line |
- * | `right` | the segment leaving is straight, and the curve arriving runs into the line |
- *
- * The ends of an open curve meet their points with zero curvature, as a
- * corner's sides do.
- *
- * A segment with a `g4` point at either end is a cubic-curvature segment,
- * with two more unknowns than an Euler spiral's two end tangents. A `g4`
- * point between two curved segments pays for its side's two with its two
- * extra equations; anywhere else, such a segment's curvature stops bending
- * at that end (its second derivative is zero there).
- */
-
 /** What holds at a spiro point; see the table at the top of `spiro.ts`. */
 type SpiroKind = 'smooth' | 'g4' | 'corner' | 'left' | 'right';
 /** Every {@link SpiroKind}, in the order a picker lists them. */

package/dist/curves/index.d.ts

@@ -1,5 +1,5 @@
 import { P as PolygonPath } from '../path-t80OoJnM.js';
-import { S as SpiroKind, C as CurvatureSource } from '../curvature-CDOI32hv.js';
+import { S as SpiroKind, C as CurvatureSource } from '../curvature-DKPO4Qeh.js';
 
 /** A point in the shared anchor set. Every representation reads only the
  *  fields it cares about: cubic Bezier reads inHandle/outHandle; NURBS

package/dist/curves/index.js

@@ -1,7 +1,7 @@
-import { cubicCurvatureAt, SPIRO_KINDS, eulerCurvatureAt, spiroToPath, eulerPointAt, solveSpiro } from '../chunk-HNLJO3E7.js';
-import '../chunk-3HQJGI63.js';
-import '../chunk-2N6OWA7E.js';
-import { PATH_M, cubicPointAt, PATH_L, PATH_Q, PATH_C } from '../chunk-B3D6KWW3.js';
+import { cubicCurvatureAt, SPIRO_KINDS, eulerCurvatureAt, spiroToPath, eulerPointAt, solveSpiro } from '../chunk-MOCSUHEI.js';
+import '../chunk-HTT5AQIU.js';
+import { PATH_M, cubicPointAt, PATH_L, PATH_Q, PATH_C } from '../chunk-346XYYMX.js';
+import '../chunk-DNX24KBT.js';
 
 // src/curves/anchorHandles.ts
 var DEFAULT_HANDLE_FRACTION = 1 / 3;

package/dist/index.d.ts

@@ -1,5 +1,5 @@
-import { A as Affine, a as AnchorSet, P as PenAnchor, b as SpiroPoint, S as SpiroKind, c as Scale2 } from './curvature-CDOI32hv.js';
-export { d as AnchorRect, e as CombTooth, f as CurvatureCombOptions, C as CurvatureSource, E as EulerFit, g as EulerSegment, h as SPIRO_KINDS, i as SegmentComb, j as SegmentHit, k as SpiroSegment, l as anchorAt, m as anchorCount, n as anchorsInRect, o as anchorsToPath, p as applyToPoint, q as boxToBox, r as combTeeth, s as countPathAnchors, t as cubicCurvatureAt, u as cubicCurvatureSource, v as cubicDerivativeAt, w as curvatureComb, x as deleteAnchorsAt, y as editAnchorSet, z as eulerAngleAt, B as eulerCurvatureAt, D as eulerCurvatureDerivativesAt, F as eulerPointAt, G as fitEulerSegment, H as flatAnchorIndex, I as identity, J as insertAnchorOnSegment, K as invert, L as isAnchorSmooth, M as isSpiroKind, N as isStraightSegment, O as locateAnchor, Q as moveHandleTo, R as multiply, T as nearestSegmentT, U as openSubpathAt, V as pathToAnchors, W as placeEulerSegment, X as pxExtent, Y as pxExtentInFrame, Z as rotate, _ as rotateAboutPoint, $ as scale, a0 as scaleDelta, a1 as screenAngleOf, a2 as segmentAt, a3 as segmentEnds, a4 as solveSpiro, a5 as standoff, a6 as transformCoords, a7 as translate, a8 as translateAnchorBy, a9 as withinPxBox, aa as withinPxRadius } from './curvature-CDOI32hv.js';
+import { A as Affine, a as AnchorSet, P as PenAnchor, b as SpiroPoint, S as SpiroKind, c as Scale2 } from './curvature-DKPO4Qeh.js';
+export { d as AnchorRect, e as CombTooth, f as CurvatureCombOptions, C as CurvatureSource, E as EulerFit, g as EulerSegment, h as SPIRO_KINDS, i as SegmentComb, j as SegmentHit, k as SpiroSegment, l as anchorAt, m as anchorCount, n as anchorsInRect, o as anchorsToPath, p as applyToPoint, q as boxToBox, r as combTeeth, s as countPathAnchors, t as cubicCurvatureAt, u as cubicCurvatureSource, v as cubicDerivativeAt, w as curvatureComb, x as deleteAnchorsAt, y as editAnchorSet, z as eulerAngleAt, B as eulerCurvatureAt, D as eulerCurvatureDerivativesAt, F as eulerPointAt, G as fitEulerSegment, H as flatAnchorIndex, I as identity, J as insertAnchorOnSegment, K as invert, L as isAnchorSmooth, M as isSpiroKind, N as isStraightSegment, O as locateAnchor, Q as moveHandleTo, R as multiply, T as nearestSegmentT, U as openSubpathAt, V as pathToAnchors, W as placeEulerSegment, X as pxExtent, Y as pxExtentInFrame, Z as rotate, _ as rotateAboutPoint, $ as scale, a0 as scaleDelta, a1 as screenAngleOf, a2 as segmentAt, a3 as segmentEnds, a4 as solveSpiro, a5 as standoff, a6 as transformCoords, a7 as translate, a8 as translateAnchorBy, a9 as withinPxBox, aa as withinPxRadius } from './curvature-DKPO4Qeh.js';
 import { b as Point, a as Path, c as PathOpenFill, P as PolygonPath, d as PathFillRule, R as RectPath, C as CornerSpec, e as CornerPiece } from './path-t80OoJnM.js';
 export { f as CORNER_FIT_TOLERANCE, g as CORNER_KEYWORDS, h as CornerKeyword, i as CornerShape, j as CornerShapeFrame, k as compactCorners, l as cornerAt, m as cornerCenter, n as cornerKeywordOf, o as cornerShapeK, p as cornerShapePieces, q as cornerShapePoint, r as cornerSpecAt, s as cubicPointAt, t as hasCorners, u as isCornerShape, v as lerpCorners, w as nextCornerShape, x as scaleCorners, y as splitCubicAtT, z as withCorner, A as withoutCorners } from './path-t80OoJnM.js';
 export { P as PORT_REACH } from './portCurve-C5HDWuuV.js';
@@ -15,6 +15,10 @@ export { P as PORT_REACH } from './portCurve-C5HDWuuV.js';
 declare const EPS = 0.000001;
 /** `v` held to `lo`..`hi`. `lo` wins when the bounds cross; `NaN` passes through. */
 declare function clamp(v: number, lo: number, hi: number): number;
+/** `v` held to `0`..`1`; `NaN` passes through. */
+declare function clamp01(v: number): number;
+/** The number `t` of the way from `a` to `b`; `t` outside [0, 1] extrapolates. */
+declare function lerp(a: number, b: number, t: number): number;
 /** 2D cross (wedge) product of vectors (ax,ay) and (bx,by). */
 declare function cross(ax: number, ay: number, bx: number, by: number): number;
 /** 2D dot product. */
@@ -38,6 +42,30 @@ declare function sign(n: number): -1 | 0 | 1;
  */
 declare function approxEq(a: number, b: number, eps?: number): boolean;
 
+/** Angle units and wrapping: one definition of each, so callers agree on where a half turn lands. */
+/** Multiply degrees by this to get radians. */
+declare const DEG_TO_RAD: number;
+/** Multiply radians by this to get degrees. */
+declare const RAD_TO_DEG: number;
+/**
+ * Where {@link wrapAngle} puts a half turn, the one angle with two names:
+ * `'max'` at `π`, `'min'` at `-π`, and `'sign'` at whichever of the two has
+ * the input's sign, so `-3π` stays a turn the negative way.
+ */
+type HalfTurn = 'max' | 'min' | 'sign';
+/**
+ * `a` radians as the turn of at most half a circle that reaches it, in
+ * `(-π, π]` by default. `half` picks the closed end (see {@link HalfTurn}).
+ * `NaN` and infinities give `NaN`.
+ */
+declare function wrapAngle(a: number, half?: HalfTurn): number;
+/**
+ * `a` in `[0, period)`: radians by default, `wrapPositive(deg, 360)` for
+ * degrees. Never returns `period` itself, however close to zero a negative
+ * `a` is. `NaN` and infinities give `NaN`.
+ */
+declare function wrapPositive(a: number, period?: number): number;
+
 /**
  * Viewport state. `(view.x, view.y)` is the world point currently rendered at
  * the canvas top-left; `view.scale.x` / `view.scale.y` is pixels per world
@@ -69,6 +97,38 @@ declare const ZOOM_FLOOR = 1e-9;
  * floor.
  */
 declare function normalizeZoom(zoom: number): number;
+/** The screen pixel `view` draws world point `p` at, from the canvas top-left. */
+declare function viewWorldToScreen(view: View, p: {
+    x: number;
+    y: number;
+}): {
+    x: number;
+    y: number;
+};
+/** The world point under screen pixel `p`; the inverse of {@link viewWorldToScreen}. */
+declare function viewScreenToWorld(view: View, p: {
+    x: number;
+    y: number;
+}): {
+    x: number;
+    y: number;
+};
+/**
+ * World rect `r` in screen pixels through `view`. A flipped axis (negative
+ * scale) still gives a positive width and height, with `x` / `y` at the
+ * rect's top-left on screen.
+ */
+declare function viewRectToScreen(view: View, r: {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}): {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+};
 
 /** Axis-aligned box as [minX, minY, maxX, maxY]. */
 type Box = readonly [number, number, number, number];
@@ -94,6 +154,23 @@ declare function boxContainsBox(outer: Box, inner: Box): boolean;
  *  `pointInPolygon` takes, and what a repeated first vertex would leave as a
  *  zero-length segment for anything that strokes it. */
 declare function rectToContour(x: number, y: number, w: number, h: number): Float64Array;
+/** Whether `a` and `b` meet, edges inclusive: boxes touching along an edge or
+ *  at a corner answer true. */
+declare function boxesIntersect(a: Box, b: Box): boolean;
+/** Whether `a` and `b` share interior: rects that only touch along an edge or
+ *  at a corner answer false. */
+declare function rectsOverlap(a: Readonly<Rect>, b: Readonly<Rect>): boolean;
+/** Whether `a` and `b` meet, edges inclusive: rects touching along an edge or
+ *  at a corner answer true. {@link rectsOverlap} is the interior-only test. */
+declare function rectsIntersect(a: Readonly<Rect>, b: Readonly<Rect>): boolean;
+/** Inclusive point-in-rect test: a point on any edge is inside. */
+declare function rectContainsPoint(r: Readonly<Rect>, x: number, y: number): boolean;
+/** Half-open point-in-rect test: the left and top edges are inside, the right
+ *  and bottom ones outside, so rects that tile a plane never both claim a point. */
+declare function rectContainsPointHalfOpen(r: Readonly<Rect>, x: number, y: number): boolean;
+/** Smallest rect containing every one of `rects`, or null for none. A `NaN`
+ *  coordinate makes the matching edge of the result `NaN`. */
+declare function unionRects(rects: Iterable<Readonly<Rect>>): Rect | null;
 
 /**
  * SVG-style command-stream encoding — the kit's single declaration of the path
@@ -527,6 +604,7 @@ declare function portCurvePoints(ax: number, ay: number, bx: number, by: number,
  * rendering at 1× zoom; consumers that zoom in heavily should pass a
  * tighter tolerance.
  */
+/** The tolerance, in world units, the flatteners use when none is given. */
 declare const DEFAULT_FLATTEN_TOLERANCE = 0.5;
 /**
  * Recursively subdivide a cubic bezier (P0..P3) and append `lineTo`-style
@@ -558,6 +636,13 @@ declare function flattenQuadraticWithArcLen(x0: number, y0: number, x1: number,
  * inside a buffer holding several.
  */
 declare function pointInPolygon(coords: ArrayLike<number>, px: number, py: number, start?: number, end?: number): boolean;
+/**
+ * Signed shoelace area of an interleaved, unclosed ring, its closing edge
+ * implicit as in {@link pointInPolygon}: positive when the ring runs
+ * counterclockwise with y up, so clockwise on a y-down screen. `start`/`end`
+ * are vertex indices bounding one ring in a buffer holding several.
+ */
+declare function ringSignedArea(coords: ArrayLike<number>, start?: number, end?: number): number;
 /**
  * True if segments (ax,ay)-(bx,by) and (cx,cy)-(dx,dy) intersect at a single
  * point. An endpoint landing on the other segment counts (a T-junction and a
@@ -566,8 +651,28 @@ declare function pointInPolygon(coords: ArrayLike<number>, px: number, py: numbe
  * point, so the sign test both segments rely on is zero on all four sides.
  */
 declare function segmentsCross(ax: number, ay: number, bx: number, by: number, cx: number, cy: number, dx: number, dy: number): boolean;
+
+/**
+ * The rules of `./points` in the 2D kernel's currency. The segment functions
+ * take loose scalars and allocate nothing, since hit tests call them per
+ * pointermove and per vertex; the point functions take `Point`. Each goes
+ * through the same scalar steps as its `./nd` counterpart, so the two agree
+ * to the bit.
+ */
+
+/** Squared distance between two points. */
+declare function distance2(a: Point, b: Point): number;
+/** Euclidean distance between two points. */
+declare function distance(a: Point, b: Point): number;
+/** The point `t` of the way from `a` to `b`; `t` outside [0, 1] extrapolates. */
+declare function lerpPoint(a: Point, b: Point, t: number): Point;
+/** The parameter, 0 to 1, of the point of segment (ax,ay)-(bx,by) nearest
+ *  (px,py). A zero-length segment answers 0. */
+declare function segmentT(px: number, py: number, ax: number, ay: number, bx: number, by: number): number;
 /** Squared distance from (px,py) to segment (ax,ay)-(bx,by), endpoint-clamped. */
 declare function pointSegmentDist2(px: number, py: number, ax: number, ay: number, bx: number, by: number): number;
+/** Distance from (px,py) to segment (ax,ay)-(bx,by), endpoint-clamped. */
+declare function pointSegmentDist(px: number, py: number, ax: number, ay: number, bx: number, by: number): number;
 
 /** Set whether a fill closes an open subpath, for every path that names no
  *  `openFill` of its own. Starts at `'close'`. */
@@ -3275,4 +3380,4 @@ declare function reviveTypedArrays(value: unknown): unknown;
 /** `tagTypedArrays` as a `JSON.stringify` replacer. */
 declare function typedArrayReplacer(_key: string, value: unknown): unknown;
 
-export { ANCHOR_FIELDS, Affine, type AnchorField, type AnchorFieldValues, type AnchorPair, type AnchorPathMeasure, AnchorSet, type AnchorSubpathMeasure, type AnchorSymmetry, type ArcTrackShape, type ArcTrackSpec, type AverageAxis, type BendAlongPathOptions, type BendGrip, type BezierEasing, type BlendPathsOptions, type Box, CONSTRAINT_TOLERANCE, CORNER_RESTORE_TOLERANCE, type ConflictingConstraintsOptions, type ConstrainPathEditOptions, type ConstrainedPathEdit, type ConstrainedPathsEdit, type ConstraintPoint, type CornerCut, type CornerFrame, CornerPiece, CornerSpec, type CornerTrace, type CubicContour, type CubicCoords, type CubicSegment, type CurveNearest, DEFAULT_FLATTEN_TOLERANCE, type DirectionMark, EASINGS, EPS, type EaseOptions, type EasingFn, type EasingName, type EasingSpec, type EllipseTrackShape, type EllipseTrackSpec, type ExtendToMeetOptions, type ExtensionPiece, type ExtremaAxes, type FramedBox, type GlMat3, type GrowRegionOptions, type HandleBalance, type HandleRef, type JoinOptions, type LengthenMode, type LineCoords, type MeasureAnchorPathOptions, type MeasurePathOptions, type MergeRegionOptions, type NumberEntry, type NumberTypedArray, ORIGIN_THRESHOLD, type OpenPathEnd, PATH_C, PATH_CMD_LENGTHS, PATH_COMMANDS, PATH_L, PATH_M, PATH_Q, PATH_SNAP_KINDS, PATH_Z, Path, type PathAnchorHit, type PathAwayFromAnchors, type PathBlend, PathBuilder, type PathCommandCode, type PathCommandName, type PathConstraint, type PathConstraintKind, type PathCrossing, type PathEndFrame, PathFillRule, type PathInWorldPose, type PathLink, type PathMeasure, type PathNearest, type PathNearestStation, PathOpenFill, type PathSegment, type PathSnapHit, type PathSnapIndex, type PathSnapKind, type PathSnapQuery, type PathSnapTarget, type PathStation, type PathStop, type PathTrackShape, type PathsEditItem, PenAnchor, type PlaceAlongRunOptions, type PlaceRectOptions, type PlacedRect, type Placement, type PlacementAlign, type PlacementSide, Point, type PointAlongPathOptions, type PointInPathOptions, type PointOrigin, type PolygonIntersectsPathOptions, PolygonPath, type PoseLinear, type PoseRotation, type PuckerBloatPathOptions, type QuadraticCoords, type Rect, RectPath, type RepeatAlongPathOptions, type RepeatStation, type ResamplePathOptions, type ResolvedCorners, type RoughenPathOptions, type RunAlign, type RunOrder, type RunPast, type RunPlace, type RunSpot, SPRING_PRESETS, Scale2, type SegmentCrossing, type SegmentMeasure, type SegmentRef, type SegmentType, type SimplifyPathOptions, type SmudgePathOptions, type SoftFalloff, type SolveConstraintsOptions, type SolveConstraintsResult, type SolvePathConstraintsResult, type SpiroContour, SpiroKind, type SpiroPath, SpiroPoint, type SpiroToPathOptions, type SpringPreset, type SpringPresetName, type StaticPathSnapKind, type StrokeHitTestOptions, type SubpathEnd, TYPED_ARRAY_CONSTRUCTORS, type TaggedTypedArray, type TrackAtOptions, type TrackNearest, type TrackNearestOptions, type TrackPlace, type TrackRun, type TrackRunOptions, type TrackShape, type TrackShapeKind, type TrackSide, type TrackStation, type TransformPathOptions, type TrimPathOptions, type TrimResult, type TypedArrayTag, type UnsatisfiedConstraintsOptions, type View, ZOOM_FLOOR, type ZigzagPathOptions, addExtremaAnchors, addOrigin, anchorOriginsOf, anchorSymmetries, anchorSymmetry, anchorsBefore, anchorsUnderBrush, anchorsWhere, approxEq, arcShape, asPolygonPath, averageAnchorsAt, balanceFactorToward, bendAlongPath, bendSegment, bendSide, blendPaths, boundsOfCoords, boundsOfPath, boxContainsBox, boxContainsPoint, boxFrameOf, circlePath, clamp, clampRectWithin, closestOpenEnds, composePath, conflictingConstraints, constrainPathEdit, constrainPathsEdit, constraintAnchors, constraintApplies, constraintFits, convertSegments, coordsFrom, cornerAnchors, cornerCuts, cornerFrameAt, cornerFrames, cornerTraces, createPathSnapIndex, cross, cubicAxisExtremaTs, cubicBezierEasing, cubicBounds, cubicContoursToPath, cubicEvalAt, decomposePath, defaultOpenFill, directionMarks, dot, easeIn, easeInBack, easeInBounce, easeInCirc, easeInCubic, easeInElastic, easeInExpo, easeInOut, easeInOutBack, easeInOutBounce, easeInOutCirc, easeInOutCubic, easeInOutElastic, easeInOutExpo, easeInOutQuad, easeInOutQuart, easeInOutQuint, easeInOutSine, easeInQuad, easeInQuart, easeInQuint, easeInSine, easeLength, easeOut, easeOutBack, easeOutBounce, easeOutCirc, easeOutCubic, easeOutElastic, easeOutExpo, easeOutQuad, easeOutQuart, easeOutQuint, easeOutSine, editAnchorSetTracked, elevateQuadraticToCubic, ellipsePath, ellipseShape, equalizeSegmentHandles, everyNthAnchor, extendToMeet, extensionPieces, fillsOpenSubpaths, findPathSnap, findPathSnaps, fitAffine, fitCubicThroughDeletion, fitCubicWithTangents, flatIndexesAfterReverse, flattenCubic, flattenCubicWithArcLen, flattenQuadratic, flattenQuadraticWithArcLen, forEachSegment, growAnchorSelection, growRegion, handleAlongItsAngle, handleAtItsLength, handleBalances, harmonizeAnchors, hasOpenSubpath, intersectSegments, invertAnchorSelection, isSegmentStraight, joinAnchorsAt, joinPaths, joinSubpathEnds, keepCorners, len2, lengthToward, lengthenOpenEnd, lengthenPathEnd, linePath, lineShape, linear, makeHandlesSymmetric, mapConstraintAnchors, mat3, meanScale, measureAnchorPath, measurePath, mergeRegion, moveHandleSymmetric, nearestOnCubic, nearestOnLine, nearestOnPath, nearestOnQuadratic, nearestPathAnchor, normalizeZoom, offsetCornerTraces, openEndAt, openEndRay, openPathEnds, originFor, originOf, pathAnchorPoints, pathAwayFromAnchors, pathCommandCoordCount, pathContainsPoint, pathContainsPolygon, pathContainsRect, pathCrossings, pathDistanceToPoint, pathEndAnchorIndex, pathEndFrame, pathFromD, pathInPoseFrame, pathInWorld, pathIntersectsPolygon, pathIntersectsRect, pathPoint, pathSegments, pathShape, pathSignedArea, pathThroughPoseFrame, pathToCubicContours, pathToD, placeAlongRun, placeRect, pointAlongPath, pointInPath, pointInPolygon, pointSegmentDist2, polygonContainsPath, polygonFromPoints, polygonIntersectsPath, polylineFromPoints, portControls, portCurvePoints, poseFrameInverseOf, poseFrameOf, poseLinearOf, poseRotationOf, prepareBlend, puckerBloatPath, quadraticEvalAt, readAnchorFields, rectMarkerPath, rectPath, rectToContour, regularPolygonPath, remapAnchorValues, remapConstraints, remapPerAnchor, remapPointValues, repeatAlongPath, resamplePath, resolveCorners, resolveCornersWithSources, resolveEasing, restoreCorners, retractHandles, reverseAnchors, reversePath, reverseSubpaths, reviveTypedArrays, rotatePathAround, roughenPath, roundRectPath, runLength, runPlaces, runStationAt, scalePathToBounds, scaleSegmentHandles, schneiderFit, segmentBetween, segmentExtremaTs, segmentsBetweenAnchors, segmentsCross, setDefaultOpenFill, setSubpathStart, shiftTrack, shrinkAnchorSelection, sign, simplifyAnchorsAt, simplifyPath, simplifySpan, simplifySubpath, smoothAnchors, smudgePath, softFalloff, softSelectionBand, softSelectionWeights, solveConstraints, solvePathConstraints, spiroContoursFromControl, spiroContoursOf, spiroControlPath, spiroToPath, splitByClosure, splitCubicAt, splitLineAt, splitQuadraticAt, splitSubpaths, squarePath, starPath, stationsAlongPath, strokeHitTest, sub, subpathEndAt, subpathsOfAnchors, tagTypedArray, tagTypedArrays, trackRun, trackShapeD, trackSlice, transformPath, translateAnchorsSymmetric, translatePath, trimPathAt, typedArrayReplacer, unionBoundsPath, unionBox, unsatisfiedConstraints, untagTypedArray, viewToMat3, withAnchorPoints, worldCoords, worldEditToStorage, writeAnchorField, zigzagPath };
+export { ANCHOR_FIELDS, Affine, type AnchorField, type AnchorFieldValues, type AnchorPair, type AnchorPathMeasure, AnchorSet, type AnchorSubpathMeasure, type AnchorSymmetry, type ArcTrackShape, type ArcTrackSpec, type AverageAxis, type BendAlongPathOptions, type BendGrip, type BezierEasing, type BlendPathsOptions, type Box, CONSTRAINT_TOLERANCE, CORNER_RESTORE_TOLERANCE, type ConflictingConstraintsOptions, type ConstrainPathEditOptions, type ConstrainedPathEdit, type ConstrainedPathsEdit, type ConstraintPoint, type CornerCut, type CornerFrame, CornerPiece, CornerSpec, type CornerTrace, type CubicContour, type CubicCoords, type CubicSegment, type CurveNearest, DEFAULT_FLATTEN_TOLERANCE, DEG_TO_RAD, type DirectionMark, EASINGS, EPS, type EaseOptions, type EasingFn, type EasingName, type EasingSpec, type EllipseTrackShape, type EllipseTrackSpec, type ExtendToMeetOptions, type ExtensionPiece, type ExtremaAxes, type FramedBox, type GlMat3, type GrowRegionOptions, type HalfTurn, type HandleBalance, type HandleRef, type JoinOptions, type LengthenMode, type LineCoords, type MeasureAnchorPathOptions, type MeasurePathOptions, type MergeRegionOptions, type NumberEntry, type NumberTypedArray, ORIGIN_THRESHOLD, type OpenPathEnd, PATH_C, PATH_CMD_LENGTHS, PATH_COMMANDS, PATH_L, PATH_M, PATH_Q, PATH_SNAP_KINDS, PATH_Z, Path, type PathAnchorHit, type PathAwayFromAnchors, type PathBlend, PathBuilder, type PathCommandCode, type PathCommandName, type PathConstraint, type PathConstraintKind, type PathCrossing, type PathEndFrame, PathFillRule, type PathInWorldPose, type PathLink, type PathMeasure, type PathNearest, type PathNearestStation, PathOpenFill, type PathSegment, type PathSnapHit, type PathSnapIndex, type PathSnapKind, type PathSnapQuery, type PathSnapTarget, type PathStation, type PathStop, type PathTrackShape, type PathsEditItem, PenAnchor, type PlaceAlongRunOptions, type PlaceRectOptions, type PlacedRect, type Placement, type PlacementAlign, type PlacementSide, Point, type PointAlongPathOptions, type PointInPathOptions, type PointOrigin, type PolygonIntersectsPathOptions, PolygonPath, type PoseLinear, type PoseRotation, type PuckerBloatPathOptions, type QuadraticCoords, RAD_TO_DEG, type Rect, RectPath, type RepeatAlongPathOptions, type RepeatStation, type ResamplePathOptions, type ResolvedCorners, type RoughenPathOptions, type RunAlign, type RunOrder, type RunPast, type RunPlace, type RunSpot, SPRING_PRESETS, Scale2, type SegmentCrossing, type SegmentMeasure, type SegmentRef, type SegmentType, type SimplifyPathOptions, type SmudgePathOptions, type SoftFalloff, type SolveConstraintsOptions, type SolveConstraintsResult, type SolvePathConstraintsResult, type SpiroContour, SpiroKind, type SpiroPath, SpiroPoint, type SpiroToPathOptions, type SpringPreset, type SpringPresetName, type StaticPathSnapKind, type StrokeHitTestOptions, type SubpathEnd, TYPED_ARRAY_CONSTRUCTORS, type TaggedTypedArray, type TrackAtOptions, type TrackNearest, type TrackNearestOptions, type TrackPlace, type TrackRun, type TrackRunOptions, type TrackShape, type TrackShapeKind, type TrackSide, type TrackStation, type TransformPathOptions, type TrimPathOptions, type TrimResult, type TypedArrayTag, type UnsatisfiedConstraintsOptions, type View, ZOOM_FLOOR, type ZigzagPathOptions, addExtremaAnchors, addOrigin, anchorOriginsOf, anchorSymmetries, anchorSymmetry, anchorsBefore, anchorsUnderBrush, anchorsWhere, approxEq, arcShape, asPolygonPath, averageAnchorsAt, balanceFactorToward, bendAlongPath, bendSegment, bendSide, blendPaths, boundsOfCoords, boundsOfPath, boxContainsBox, boxContainsPoint, boxFrameOf, boxesIntersect, circlePath, clamp, clamp01, clampRectWithin, closestOpenEnds, composePath, conflictingConstraints, constrainPathEdit, constrainPathsEdit, constraintAnchors, constraintApplies, constraintFits, convertSegments, coordsFrom, cornerAnchors, cornerCuts, cornerFrameAt, cornerFrames, cornerTraces, createPathSnapIndex, cross, cubicAxisExtremaTs, cubicBezierEasing, cubicBounds, cubicContoursToPath, cubicEvalAt, decomposePath, defaultOpenFill, directionMarks, distance, distance2, dot, easeIn, easeInBack, easeInBounce, easeInCirc, easeInCubic, easeInElastic, easeInExpo, easeInOut, easeInOutBack, easeInOutBounce, easeInOutCirc, easeInOutCubic, easeInOutElastic, easeInOutExpo, easeInOutQuad, easeInOutQuart, easeInOutQuint, easeInOutSine, easeInQuad, easeInQuart, easeInQuint, easeInSine, easeLength, easeOut, easeOutBack, easeOutBounce, easeOutCirc, easeOutCubic, easeOutElastic, easeOutExpo, easeOutQuad, easeOutQuart, easeOutQuint, easeOutSine, editAnchorSetTracked, elevateQuadraticToCubic, ellipsePath, ellipseShape, equalizeSegmentHandles, everyNthAnchor, extendToMeet, extensionPieces, fillsOpenSubpaths, findPathSnap, findPathSnaps, fitAffine, fitCubicThroughDeletion, fitCubicWithTangents, flatIndexesAfterReverse, flattenCubic, flattenCubicWithArcLen, flattenQuadratic, flattenQuadraticWithArcLen, forEachSegment, growAnchorSelection, growRegion, handleAlongItsAngle, handleAtItsLength, handleBalances, harmonizeAnchors, hasOpenSubpath, intersectSegments, invertAnchorSelection, isSegmentStraight, joinAnchorsAt, joinPaths, joinSubpathEnds, keepCorners, len2, lengthToward, lengthenOpenEnd, lengthenPathEnd, lerp, lerpPoint, linePath, lineShape, linear, makeHandlesSymmetric, mapConstraintAnchors, mat3, meanScale, measureAnchorPath, measurePath, mergeRegion, moveHandleSymmetric, nearestOnCubic, nearestOnLine, nearestOnPath, nearestOnQuadratic, nearestPathAnchor, normalizeZoom, offsetCornerTraces, openEndAt, openEndRay, openPathEnds, originFor, originOf, pathAnchorPoints, pathAwayFromAnchors, pathCommandCoordCount, pathContainsPoint, pathContainsPolygon, pathContainsRect, pathCrossings, pathDistanceToPoint, pathEndAnchorIndex, pathEndFrame, pathFromD, pathInPoseFrame, pathInWorld, pathIntersectsPolygon, pathIntersectsRect, pathPoint, pathSegments, pathShape, pathSignedArea, pathThroughPoseFrame, pathToCubicContours, pathToD, placeAlongRun, placeRect, pointAlongPath, pointInPath, pointInPolygon, pointSegmentDist, pointSegmentDist2, polygonContainsPath, polygonFromPoints, polygonIntersectsPath, polylineFromPoints, portControls, portCurvePoints, poseFrameInverseOf, poseFrameOf, poseLinearOf, poseRotationOf, prepareBlend, puckerBloatPath, quadraticEvalAt, readAnchorFields, rectContainsPoint, rectContainsPointHalfOpen, rectMarkerPath, rectPath, rectToContour, rectsIntersect, rectsOverlap, regularPolygonPath, remapAnchorValues, remapConstraints, remapPerAnchor, remapPointValues, repeatAlongPath, resamplePath, resolveCorners, resolveCornersWithSources, resolveEasing, restoreCorners, retractHandles, reverseAnchors, reversePath, reverseSubpaths, reviveTypedArrays, ringSignedArea, rotatePathAround, roughenPath, roundRectPath, runLength, runPlaces, runStationAt, scalePathToBounds, scaleSegmentHandles, schneiderFit, segmentBetween, segmentExtremaTs, segmentT, segmentsBetweenAnchors, segmentsCross, setDefaultOpenFill, setSubpathStart, shiftTrack, shrinkAnchorSelection, sign, simplifyAnchorsAt, simplifyPath, simplifySpan, simplifySubpath, smoothAnchors, smudgePath, softFalloff, softSelectionBand, softSelectionWeights, solveConstraints, solvePathConstraints, spiroContoursFromControl, spiroContoursOf, spiroControlPath, spiroToPath, splitByClosure, splitCubicAt, splitLineAt, splitQuadraticAt, splitSubpaths, squarePath, starPath, stationsAlongPath, strokeHitTest, sub, subpathEndAt, subpathsOfAnchors, tagTypedArray, tagTypedArrays, trackRun, trackShapeD, trackSlice, transformPath, translateAnchorsSymmetric, translatePath, trimPathAt, typedArrayReplacer, unionBoundsPath, unionBox, unionRects, unsatisfiedConstraints, untagTypedArray, viewRectToScreen, viewScreenToWorld, viewToMat3, viewWorldToScreen, withAnchorPoints, worldCoords, worldEditToStorage, wrapAngle, wrapPositive, writeAnchorField, zigzagPath };