npm - @nexkit/json-repair - Versions diffs - 1.0.0 - Mend

@nexkit/json-repair 1.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (12) hide show

package/dist/index.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"sources":["../src/scanner/tokens.ts","../src/scanner/scanner.ts","../src/errors/JsonRepairError.ts","../src/limits.ts","../src/native.ts","../src/types.ts","../src/options.ts","../src/repair/brackets.ts","../src/repair/comments.ts","../src/repair/literals.ts","../src/repair/numbers.ts","../src/parser/probe.ts","../src/repair/quotes.ts","../src/repair/trailing-comma.ts","../src/parser/parser.ts","../src/repair/messages.ts","../src/parser/state.ts","../src/repair/markdown.ts","../src/extract.ts","../src/repair.ts","../src/parse.ts"],"names":["code","matchesWord","parsed"],"mappings":";AAaO,IAAM,aAAA,GAAgB,GAAA;AACtB,IAAM,cAAA,GAAiB,GAAA;AACvB,IAAM,eAAA,GAAkB,EAAA;AACxB,IAAM,gBAAA,GAAmB,EAAA;AACzB,IAAM,QAAA,GAAW,EAAA;AACjB,IAAM,QAAA,GAAW,EAAA;AAIjB,IAAM,eAAA,GAAkB,EAAA;AACxB,IAAM,eAAA,GAAkB,EAAA;AACxB,IAAM,WAAA,GAAc,EAAA;AACpB,IAAM,oBAAA,GAAuB,IAAA;AAC7B,IAAM,qBAAA,GAAwB,IAAA;AAC9B,IAAM,mBAAA,GAAsB,IAAA;AAC5B,IAAM,uBAAA,GAA0B,IAAA;AAChC,IAAM,oBAAA,GAAuB,IAAA;AAC7B,IAAM,qBAAA,GAAwB,IAAA;AAC9B,IAAM,mBAAA,GAAsB,IAAA;AAC5B,IAAM,uBAAA,GAA0B,IAAA;AAIhC,IAAM,YAAA,GAAe,EAAA;AACrB,IAAM,QAAA,GAAW,EAAA;AACjB,IAAM,WAAA,GAAc,EAAA;AACpB,IAAM,OAAA,GAAU,EAAA;AAChB,IAAM,QAAA,GAAW,EAAA;AACjB,IAAM,OAAA,GAAU,EAAA;AAChB,IAAM,MAAA,GAAS,EAAA;AACf,IAAM,aAAA,GAAgB,EAAA;AACtB,IAAM,SAAA,GAAY,EAAA;AAIlB,IAAM,MAAA,GAAS,CAAA;AACf,IAAM,YAAA,GAAe,EAAA;AACrB,IAAM,eAAA,GAAkB,EAAA;AACxB,IAAM,YAAA,GAAe,EAAA;AACrB,IAAM,kBAAA,GAAqB,EAAA;AAC3B,IAAM,QAAA,GAAW,EAAA;AACjB,IAAM,OAAA,GAAU,GAAA;AAChB,IAAM,MAAA,GAAS,KAAA;AAIf,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,GAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,UAAA,GAAa,EAAA;AACnB,IAAM,OAAA,GAAU,EAAA;AAChB,IAAM,OAAA,GAAU,EAAA;AAIhB,IAAM,uBAAA,GAA0B,KAAA;AAChC,IAAM,qBAAA,GAAwB,KAAA;AAC9B,IAAM,sBAAA,GAAyB,KAAA;AAC/B,IAAM,oBAAA,GAAuB,KAAA;AAG7B,IAAM,MAAA,GAAS,EAAA;AAYf,SAAS,aAAa,IAAA,EAAuB;AAClD,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,QAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,kBAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,OAAA;AAAA,IACL,KAAK,MAAA;AAAA,IACL,KAAK,IAAA;AAAA;AAAA,IACL,KAAK,IAAA;AAAA;AAAA,IACL,KAAK,IAAA;AAAA;AAAA,IACL,KAAK,IAAA;AAAA;AAAA,IACL,KAAK,IAAA;AAAA;AAAA,IACL,KAAK,KAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT;AAEE,MAAA,OAAO,IAAA,IAAQ,QAAU,IAAA,IAAQ,IAAA;AAAA;AAEvC;AAQO,SAAS,iBAAiB,IAAA,EAAuB;AACtD,EAAA,OACE,SAAS,QAAA,IAAY,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,gBAAgB,IAAA,KAAS,kBAAA;AAE9E;AAGO,SAAS,YAAY,IAAA,EAAuB;AACjD,EAAA,OAAO,IAAA,KAAS,gBAAgB,IAAA,KAAS,kBAAA;AAC3C;AAGO,SAAS,QAAQ,IAAA,EAAuB;AAC7C,EAAA,OAAO,IAAA,IAAQ,WAAW,IAAA,IAAQ,OAAA;AACpC;AAGO,SAAS,WAAW,IAAA,EAAuB;AAChD,EAAA,OACG,IAAA,IAAQ,OAAA,IAAW,IAAA,IAAQ,OAAA,IAC3B,IAAA,IAAQ,cAAc,IAAA,IAAQ,UAAA,IAC9B,IAAA,IAAQ,UAAA,IAAc,IAAA,IAAQ,UAAA;AAEnC;AAWO,SAAS,QAAQ,IAAA,EAAuB;AAC7C,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,eAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,WAAA;AAAA,IACL,KAAK,oBAAA;AAAA,IACL,KAAK,qBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,uBAAA;AAAA,IACL,KAAK,oBAAA;AAAA,IACL,KAAK,qBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,uBAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT;AACE,MAAA,OAAO,KAAA;AAAA;AAEb;AASO,SAAS,WAAW,IAAA,EAAyC;AAClE,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,oBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,uBAAA;AACH,MAAA,OAAO,CAAC,uBAAuB,IAAI,CAAA;AAAA,IACrC,KAAK,qBAAA;AACH,MAAA,OAAO,CAAC,uBAAuB,oBAAoB,CAAA;AAAA,IACrD,KAAK,oBAAA;AAAA,IACL,KAAK,mBAAA;AAAA,IACL,KAAK,uBAAA;AACH,MAAA,OAAO,CAAC,uBAAuB,IAAI,CAAA;AAAA,IACrC,KAAK,qBAAA;AACH,MAAA,OAAO,CAAC,uBAAuB,oBAAoB,CAAA;AAAA,IACrD;AACE,MAAA,OAAO,CAAC,MAAM,EAAE,CAAA;AAAA;AAEtB;AASO,SAAS,gBAAgB,IAAA,EAAuB;AACrD,EAAA,OAAO,IAAA,KAAS,eAAA;AAClB;AAUO,SAAS,kBAAkB,IAAA,EAAuB;AACvD,EAAA,OACG,IAAA,IAAQ,UAAA,IAAc,IAAA,IAAQ,UAAA,IAC9B,IAAA,IAAQ,UAAA,IAAc,IAAA,IAAQ,UAAA,IAC/B,IAAA,KAAS,aAAA,IACT,IAAA,KAAS,SAAA,IACT,IAAA,IAAQ,GAAA;AAEZ;AAGO,SAAS,iBAAiB,IAAA,EAAuB;AACtD,EAAA,OAAO,iBAAA,CAAkB,IAAI,CAAA,IAAK,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,KAAS,YAAY,IAAA,KAAS,MAAA;AACnF;AAQO,SAAS,aAAa,IAAA,EAAuB;AAClD,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,aAAA;AAAA,IACL,KAAK,cAAA;AAAA,IACL,KAAK,eAAA;AAAA,IACL,KAAK,gBAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,MAAA;AACH,MAAA,OAAO,IAAA;AAAA,IACT;AACE,MAAA,OAAO,KAAA;AAAA;AAEb;AAGO,SAAS,gBAAgB,IAAA,EAAuB;AACrD,EAAA,OAAO,IAAA,IAAQ,2BAA2B,IAAA,IAAQ,qBAAA;AACpD;AAGO,SAAS,eAAe,IAAA,EAAuB;AACpD,EAAA,OAAO,IAAA,IAAQ,0BAA0B,IAAA,IAAQ,oBAAA;AACnD;AASO,SAAS,aAAa,IAAA,EAAsB;AACjD,EAAA,OAAO,IAAA,IAAQ,UAAA,IAAc,IAAA,IAAQ,UAAA,GAAa,OAAO,EAAA,GAAO,IAAA;AAClE;;;ACnQO,IAAM,UAAN,MAAc;AAAA;AAAA,EAEV,MAAA;AAAA;AAAA,EAGA,KAAA;AAAA;AAAA,EAGA,GAAA;AAAA;AAAA,EAGT,KAAA;AAAA;AAAA,EAGQ,UAAA;AAAA,EAER,YAAY,MAAA,EAAgB,KAAA,GAAQ,CAAA,EAAG,GAAA,GAAM,OAAO,MAAA,EAAQ;AAC1D,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AACb,IAAA,IAAA,CAAK,GAAA,GAAM,GAAA;AACX,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AAAA;AAAA,EAGA,GAAA,GAAe;AACb,IAAA,OAAO,IAAA,CAAK,SAAS,IAAA,CAAK,GAAA;AAAA,EAC5B;AAAA;AAAA,EAGA,IAAA,GAAe;AACb,IAAA,OAAO,IAAA,CAAK,QAAQ,IAAA,CAAK,GAAA,GAAM,KAAK,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,GAAI,MAAA;AAAA,EACtE;AAAA;AAAA,EAGA,KAAA,CAAM,MAAc,EAAA,EAAoB;AACtC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,KAAA,CAAM,IAAA,EAAM,EAAE,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW,MAAA,EAAgC;AACzC,IAAA,MAAM,SAAS,IAAA,CAAK,UAAA,KAAe,KAAK,UAAA,GAAa,eAAA,CAAgB,KAAK,MAAM,CAAA,CAAA;AAGhF,IAAA,IAAI,GAAA,GAAM,CAAA;AACV,IAAA,IAAI,IAAA,GAAO,OAAO,MAAA,GAAS,CAAA;AAC3B,IAAA,OAAO,MAAM,IAAA,EAAM;AACjB,MAAA,MAAM,GAAA,GAAO,GAAA,GAAM,IAAA,GAAO,CAAA,KAAO,CAAA;AACjC,MAAA,IAAI,MAAA,CAAO,GAAG,CAAA,IAAM,MAAA,EAAQ;AAC1B,QAAA,GAAA,GAAM,GAAA;AAAA,MACR,CAAA,MAAO;AACL,QAAA,IAAA,GAAO,GAAA,GAAM,CAAA;AAAA,MACf;AAAA,IACF;AAEA,IAAA,OAAO,EAAE,MAAM,GAAA,GAAM,CAAA,EAAG,QAAQ,MAAA,GAAS,MAAA,CAAO,GAAG,CAAA,GAAK,CAAA,EAAE;AAAA,EAC5D;AACF,CAAA;AAGA,SAAS,gBAAgB,MAAA,EAA0B;AACjD,EAAA,MAAM,MAAA,GAAmB,CAAC,CAAC,CAAA;AAC3B,EAAA,MAAM,SAAS,MAAA,CAAO,MAAA;AAEtB,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,EAAG,KAAA,GAAQ,MAAA,EAAQ,SAAS,CAAA,EAAG;AAC9C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,SAAS,kBAAA,EAAoB;AAE/B,MAAA,IAAI,KAAA,GAAQ,IAAI,MAAA,IAAU,MAAA,CAAO,WAAW,KAAA,GAAQ,CAAC,MAAM,YAAA,EAAc;AACvE,QAAA,KAAA,IAAS,CAAA;AAAA,MACX;AACA,MAAA,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAC,CAAA;AAAA,IACvB,CAAA,MAAA,IAAW,SAAS,YAAA,EAAc;AAChC,MAAA,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAC,CAAA;AAAA,IACvB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;;;AC5FA,IAAM,WAAA,mBAA6B,MAAA,CAAO,GAAA,CAAI,mBAAmB,CAAA;AAGjE,IAAM,cAAA,GAAiB,EAAA;AAmChB,IAAM,eAAA,GAAN,cAA8B,KAAA,CAAM;AAAA;AAAA,EAEvB,IAAA,GAAO,iBAAA;AAAA;AAAA,EAGhB,IAAA;AAAA;AAAA,EAGA,QAAA;AAAA;AAAA,EAGA,IAAA;AAAA;AAAA,EAGA,MAAA;AAAA;AAAA,EAGA,OAAA;AAAA;AAAA,EAGT,CAAU,WAAW,IAAI,IAAA;AAAA,EAEzB,WAAA,CAAY,IAAA,EAA2B,OAAA,EAAiB,OAAA,GAAkC,EAAC,EAAG;AAC5F,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,WAAW,OAAA,CAAQ,QAAA;AACxB,IAAA,IAAA,CAAK,OAAO,OAAA,CAAQ,IAAA;AACpB,IAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,MAAA;AACtB,IAAA,IAAA,CAAK,UAAU,OAAA,CAAQ,OAAA;AAIvB,IAAA,MAAA,CAAO,cAAA,CAAe,IAAA,EAAM,GAAA,CAAA,MAAA,CAAW,SAAS,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,kBAAkB,KAAA,EAA0C;AACjE,IAAA,OACE,OAAO,KAAA,KAAU,QAAA,IACjB,UAAU,IAAA,IACT,KAAA,CAAuC,WAAW,CAAA,KAAM,IAAA;AAAA,EAE7D;AACF;AAMO,SAAS,kBAAkB,KAAA,EAA0C;AAC1E,EAAA,OAAO,eAAA,CAAgB,kBAAkB,KAAK,CAAA;AAChD;AAUO,SAAS,WAAA,CACd,IAAA,EACA,OAAA,EACA,MAAA,EACA,QAAA,EACiB;AACjB,EAAA,MAAM,OAAA,GAAU,WAAW,CAAA,GAAI,CAAA,GAAI,WAAW,MAAA,CAAO,MAAA,GAAS,OAAO,MAAA,GAAS,QAAA;AAC9E,EAAA,MAAM,EAAE,MAAM,MAAA,EAAO,GAAI,IAAI,OAAA,CAAQ,MAAM,CAAA,CAAE,UAAA,CAAW,OAAO,CAAA;AAE/D,EAAA,OAAO,IAAI,eAAA,CAAgB,IAAA,EAAM,OAAA,EAAS;AAAA,IACxC,QAAA,EAAU,OAAA;AAAA,IACV,IAAA;AAAA,IACA,MAAA;AAAA,IACA,OAAA,EAAS,YAAA,CAAa,MAAA,EAAQ,OAAO;AAAA,GACtC,CAAA;AACH;AAMO,SAAS,YAAA,CAAa,QAAgB,QAAA,EAA0B;AACrE,EAAA,MAAM,OAAA,GAAU,WAAW,CAAA,GAAI,CAAA,GAAI,WAAW,MAAA,CAAO,MAAA,GAAS,OAAO,MAAA,GAAS,QAAA;AAC9E,EAAA,MAAM,KAAA,GAAQ,OAAA,GAAU,cAAA,GAAiB,CAAA,GAAI,IAAI,OAAA,GAAU,cAAA;AAC3D,EAAA,MAAM,MAAM,OAAA,GAAU,cAAA,GAAiB,OAAO,MAAA,GAAS,MAAA,CAAO,SAAS,OAAA,GAAU,cAAA;AAEjF,EAAA,IAAI,OAAA,GAAU,EAAA;AACd,EAAA,KAAA,IAAS,KAAA,GAAQ,KAAA,EAAO,KAAA,GAAQ,GAAA,EAAK,SAAS,CAAA,EAAG;AAC/C,IAAA,OAAA,IAAW,gBAAA,CAAiB,MAAA,CAAO,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,EACtD;AAEA,EAAA,OAAO,CAAA,EAAG,KAAA,GAAQ,CAAA,GAAI,QAAA,GAAM,EAAE,CAAA,EAAG,OAAO,CAAA,EAAG,GAAA,GAAM,MAAA,CAAO,MAAA,GAAS,QAAA,GAAM,EAAE,CAAA,CAAA;AAC3E;AAGA,SAAS,iBAAiB,IAAA,EAAsB;AAC9C,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,CAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,CAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAEP;AAEJ,EAAA,IAAI,IAAA,GAAO,EAAA,IAAQ,IAAA,KAAS,GAAA,EAAM;AAChC,IAAA,OAAO,CAAA,GAAA,EAAM,KAAK,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,MAAA,CAAO,aAAa,IAAI,CAAA;AACjC;;;ACtJO,SAAS,YAAA,CAAa,OAAgB,SAAA,EAA4C;AACvF,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,cAAc,SAAS,CAAA,6BAAA,EAAgC,UAAU,IAAA,GAAO,MAAA,GAAS,OAAO,KAAK,CAAA,CAAA;AAAA,KAC/F;AAAA,EACF;AACF;AAUO,SAAS,iBAAA,CAAkB,OAAe,SAAA,EAAyB;AACxE,EAAA,IAAI,KAAA,CAAM,SAAS,SAAA,EAAW;AAC5B,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,qBAAA;AAAA,MACA,CAAA,SAAA,EAAY,KAAA,CAAM,MAAM,CAAA,0CAAA,EAA6C,SAAS,CAAA,CAAA,CAAA;AAAA,MAC9E,EAAE,UAAU,SAAA;AAAU,KACxB;AAAA,EACF;AACF;AAeO,SAAS,qBAAA,CACd,MAAA,EACA,KAAA,EACA,GAAA,EACA,QAAA,EACM;AACN,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,IAAI,KAAA,GAAQ,KAAA;AAEZ,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,SAAS,eAAA,EAAiB;AAC5B,MAAA,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAC9C,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,KAAS,aAAA,IAAiB,IAAA,KAAS,eAAA,EAAiB;AACtD,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,IAAI,QAAQ,QAAA,EAAU;AACpB,QAAA,MAAM,WAAA;AAAA,UACJ,oBAAA;AAAA,UACA,wCAAwC,QAAQ,CAAA,CAAA,CAAA;AAAA,UAChD,MAAA;AAAA,UACA;AAAA,SACF;AAAA,MACF;AAAA,IACF,CAAA,MAAA,IAAW,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,gBAAA,EAAkB;AAC/D,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAEA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACF;AAMA,SAAS,eAAA,CAAgB,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAqB;AAC1E,EAAA,IAAI,KAAA,GAAQ,IAAA;AAEZ,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,SAAS,YAAA,EAAc;AACzB,MAAA,KAAA,IAAS,CAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,eAAA,EAAiB;AAC5B,MAAA,OAAO,KAAA,GAAQ,CAAA;AAAA,IACjB;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,OAAO,GAAA;AACT;;;ACzGO,IAAM,kBAA6C,IAAA,CAAK,KAAA;;;ACoExD,IAAM,YAAA,GAAe;AAAA,EAC1B,yBAAA;AAAA,EACA,gBAAA;AAAA,EACA,iBAAA;AAAA,EACA,uBAAA;AAAA,EACA,wBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,0BAAA;AAAA,EACA,2BAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,qBAAA;AAAA,EACA,uBAAA;AAAA,EACA,mBAAA;AAAA,EACA,oBAAA;AAAA,EACA,mBAAA;AAAA,EACA,YAAA;AAAA,EACA,cAAA;AAAA,EACA,mBAAA;AAAA,EACA,cAAA;AAAA,EACA,0BAAA;AAAA,EACA;AACF;AAuIO,IAAM,mBAAA,GAAsB;;;ACnO5B,IAAM,kBAAA,GAAqB;AAG3B,IAAM,iBAAA,GAAoB;AAoC1B,SAAS,eAAe,OAAA,EAAqD;AAClF,EAAA,MAAM,MAAA,GAAS,YAAY,OAAO,CAAA;AAClC,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,MAAA,CAAO,IAAI,CAAA;AAEpC,EAAA,OAAO;AAAA,IACL,IAAA;AAAA,IACA,YAAY,IAAA,KAAS,YAAA;AAAA,IACrB,OAAA,EAAS,WAAA,CAAY,MAAA,CAAO,OAAA,EAAS,WAAW,IAAI,CAAA;AAAA,IACpD,aAAA,EAAe,WAAA,CAAY,MAAA,CAAO,aAAA,EAAe,iBAAiB,IAAI,CAAA;AAAA,IACtE,iBAAA,EAAmB,WAAA,CAAY,MAAA,CAAO,iBAAA,EAAmB,qBAAqB,IAAI,CAAA;AAAA,IAClF,iBAAA,EAAmB,WAAA,CAAY,MAAA,CAAO,iBAAA,EAAmB,qBAAqB,IAAI,CAAA;AAAA,IAClF,iBAAA,EAAmB,WAAA,CAAY,MAAA,CAAO,iBAAA,EAAmB,qBAAqB,IAAI,CAAA;AAAA,IAClF,kBAAA,EAAoB,WAAA,CAAY,MAAA,CAAO,kBAAA,EAAoB,sBAAsB,IAAI,CAAA;AAAA,IACrF,WAAW,YAAA,CAAa,MAAA,CAAO,WAAW,WAAA,EAAa,kBAAA,EAAoB,GAAG,QAAQ,CAAA;AAAA,IACtF,UAAU,YAAA,CAAa,MAAA,CAAO,UAAU,UAAA,EAAY,iBAAA,EAAmB,GAAG,mBAAmB,CAAA;AAAA,IAC7F,YAAY,YAAA,CAAa,MAAA,CAAO,YAAY,YAAA,EAAc,QAAA,EAAU,GAAG,QAAQ,CAAA;AAAA,IAC/E,cAAA,EAAgB,WAAA,CAAY,MAAA,CAAO,cAAA,EAAgB,kBAAkB,KAAK;AAAA,GAC5E;AACF;AAaA,SAAS,YAAY,OAAA,EAA2C;AAC9D,EAAA,IAAI,YAAY,MAAA,EAAW;AACzB,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,KAAY,IAAA,EAAM;AACnD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,oCAAA,EAAuC,QAAA,CAAS,OAAO,CAAC,CAAA,CAAA;AAAA,KAC1D;AAAA,EACF;AACA,EAAA,OAAO,OAAA;AACT;AAQO,SAAS,sBACd,OAAA,EAC8C;AAC9C,EAAA,MAAM,MAAA,GAAS,YAAY,OAAO,CAAA;AAClC,EAAA,MAAM,MAAA,GAAS,aAAA,CAAc,MAAA,CAAO,MAAM,CAAA;AAE1C,EAAA,OAAO,EAAE,GAAG,cAAA,CAAe,EAAE,GAAG,QAAQ,OAAA,EAAS,IAAA,EAAM,CAAA,EAAG,MAAA,EAAO;AACnE;AAEA,SAAS,cAAc,MAAA,EAAiC;AACtD,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,WAAW,MAAA,IAAU,MAAA,KAAW,WAAW,MAAA,KAAW,MAAA,IAAU,WAAW,SAAA,EAAW;AACxF,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,uEAAA,EAA0E,QAAA,CAAS,MAAM,CAAC,CAAA,CAAA;AAAA,KAC5F;AAAA,EACF;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,QAAA,CAAS,SAA0B,IAAA,EAAmC;AACpF,EAAA,OAAO,EAAE,GAAG,OAAA,EAAS,IAAA,EAAM,UAAA,EAAY,SAAS,YAAA,EAAa;AAC/D;AAEA,SAAS,YAAY,IAAA,EAA2B;AAC9C,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,YAAA,EAAc;AAC5C,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,uDAAA,EAA0D,QAAA,CAAS,IAAI,CAAC,CAAA,CAAA;AAAA,KAC1E;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,WAAA,CAAY,KAAA,EAAgB,IAAA,EAAc,QAAA,EAA4B;AAC7E,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC9B,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,QAAA,EAAW,IAAI,CAAA,8BAAA,EAAiC,QAAA,CAAS,KAAK,CAAC,CAAA,CAAA;AAAA,KACjE;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,YAAA,CACP,KAAA,EACA,IAAA,EACA,QAAA,EACA,KACA,GAAA,EACQ;AACR,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,OAAO,QAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,EAAG;AACpD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,QAAA,EAAW,IAAI,CAAA,6BAAA,EAAgC,QAAA,CAAS,KAAK,CAAC,CAAA,CAAA;AAAA,KAChE;AAAA,EACF;AACA,EAAA,IAAI,UAAU,QAAA,IAAY,CAAC,MAAA,CAAO,SAAA,CAAU,KAAK,CAAA,EAAG;AAClD,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,CAAA,QAAA,EAAW,IAAI,CAAA,2CAAA,EAA8C,KAAK,CAAA,CAAA;AAAA,KACpE;AAAA,EACF;AACA,EAAA,IAAI,KAAA,GAAQ,GAAA,IAAO,KAAA,GAAQ,GAAA,EAAK;AAC9B,IAAA,MAAM,OAAA,GAAU,GAAA,KAAQ,QAAA,GAAW,UAAA,GAAa,OAAO,GAAG,CAAA;AAC1D,IAAA,MAAM,IAAI,eAAA;AAAA,MACR,eAAA;AAAA,MACA,WAAW,IAAI,CAAA,kBAAA,EAAqB,GAAG,CAAA,KAAA,EAAQ,OAAO,cAAc,KAAK,CAAA,CAAA;AAAA,KAC3E;AAAA,EACF;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,SAAS,KAAA,EAAwB;AACxC,EAAA,IAAI,UAAU,IAAA,EAAM;AAClB,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,QAAQ,OAAO,KAAA;AAAO,IACpB,KAAK,QAAA;AACH,MAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAAA,IAC7B,KAAK,QAAA;AAAA,IACL,KAAK,SAAA;AAAA,IACL,KAAK,WAAA;AACH,MAAA,OAAO,OAAO,KAAK,CAAA;AAAA,IACrB,KAAK,QAAA;AACH,MAAA,OAAO,CAAA,EAAG,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACzB;AACE,MAAA,OAAO,OAAO,KAAA;AAAA;AAEpB;;;AC1LO,SAAS,iBAAA,CAAkB,GAAA,EAAoB,IAAA,EAAqB,QAAA,EAAwB;AACjG,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,kBAAA,EAAoB;AACnC,IAAA,GAAA,CAAI,IAAA,CAAK,IAAA,KAAS,QAAA,GAAW,wBAAA,GAA2B,yBAAyB,QAAQ,CAAA;AAAA,EAC3F;AACA,EAAA,GAAA,CAAI,MAAA,CAAO,IAAA,KAAS,QAAA,GAAW,qBAAA,GAAwB,yBAAyB,QAAQ,CAAA;AAC1F;AAWO,SAAS,gBAAgB,GAAA,EAA0B;AACxD,EAAA,MAAM,QAAA,GAAW,IAAI,OAAA,CAAQ,KAAA;AAC7B,EAAA,MAAM,KAAA,GAAQ,aAAa,GAAA,CAAI,gBAAA;AAE/B,EAAA,IAAI,CAAC,KAAA,IAAS,CAAC,GAAA,CAAI,QAAQ,UAAA,EAAY;AACrC,IAAA,MAAM,YAAY,GAAA,CAAI,OAAA,CAAQ,IAAA,EAAK,KAAM,iBAAiB,GAAA,GAAM,GAAA;AAChE,IAAA,GAAA,CAAI,MAAA,CAAO,CAAA,YAAA,EAAe,SAAS,CAAA,kCAAA,CAAA,EAAsC,QAAQ,CAAA;AAAA,EACnF;AAEA,EAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,QAAQ,CAAA;AAC1C,EAAA,GAAA,CAAI,OAAA,CAAQ,QAAQ,QAAA,GAAW,CAAA;AACjC;;;ACrBO,SAAS,WAAW,GAAA,EAA0B;AACnD,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,OAAA;AACxB,EAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,aAAA;AAElC,EAAA,IAAI,QAAQ,OAAA,CAAQ,KAAA;AAEpB,EAAA,WAAS;AAGP,IAAA,IAAI,MAAA,GAAS,EAAA;AACb,IAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,MAAA,MAAMA,KAAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,MAAA,IAAI,CAAC,YAAA,CAAaA,KAAI,CAAA,EAAG;AACvB,QAAA;AAAA,MACF;AACA,MAAA,IAAI,MAAA,GAAS,CAAA,IAAK,CAAC,gBAAA,CAAiBA,KAAI,CAAA,EAAG;AACzC,QAAA,MAAA,GAAS,KAAA;AAAA,MACX;AACA,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAEA,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAChB,MAAA,GAAA,CAAI,MAAA,CAAO,yBAAyB,MAAM,CAAA;AAAA,IAC5C;AAEA,IAAA,IAAI,KAAA,IAAS,GAAA,IAAO,CAAC,aAAA,EAAe;AAClC,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,YAAA,GAAe,KAAA;AACrB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,SAAS,OAAA,EAAS;AACpB,MAAA,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,IAC9C,CAAA,MAAA,IAAW,IAAA,KAAS,QAAA,IAAY,KAAA,GAAQ,IAAI,GAAA,EAAK;AAC/C,MAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AAC5C,MAAA,IAAI,aAAa,QAAA,EAAU;AACzB,QAAA,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,MAC9C,CAAA,MAAA,IAAW,aAAa,WAAA,EAAa;AACnC,QAAA,KAAA,GAAQ,gBAAA,CAAiB,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,MACjD,CAAA,MAAO;AACL,QAAA;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAChB,IAAA,GAAA,CAAI,MAAA,CAAO,mBAAmB,YAAY,CAAA;AAAA,EAC5C;AAEA,EAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAClB;AASO,SAAS,UAAA,CACd,MAAA,EACA,IAAA,EACA,GAAA,EACA,aAAA,EACQ;AACR,EAAA,IAAI,KAAA,GAAQ,IAAA;AAEZ,EAAA,WAAS;AACP,IAAA,OAAO,QAAQ,GAAA,IAAO,YAAA,CAAa,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC5D,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAEA,IAAA,IAAI,KAAA,IAAS,GAAA,IAAO,CAAC,aAAA,EAAe;AAClC,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,SAAS,OAAA,EAAS;AACpB,MAAA,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,IAC9C,CAAA,MAAA,IAAW,IAAA,KAAS,QAAA,IAAY,KAAA,GAAQ,IAAI,GAAA,EAAK;AAC/C,MAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AAC5C,MAAA,IAAI,aAAa,QAAA,EAAU;AACzB,QAAA,KAAA,GAAQ,aAAA,CAAc,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,MAC9C,CAAA,MAAA,IAAW,aAAa,WAAA,EAAa;AACnC,QAAA,KAAA,GAAQ,gBAAA,CAAiB,MAAA,EAAQ,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA;AAAA,MACjD,CAAA,MAAO;AACL,QAAA,OAAO,KAAA;AAAA,MACT;AAAA,IACF,CAAA,MAAO;AACL,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,aAAA,CAAc,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAqB;AACxE,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,GAAQ,OAAO,CAAC,WAAA,CAAY,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC5D,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,gBAAA,CAAiB,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAqB;AAC3E,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,IACE,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA,KAAM,WAAA,IAC7B,KAAA,GAAQ,CAAA,GAAI,GAAA,IACZ,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,MAAM,QAAA,EACjC;AACA,MAAA,OAAO,KAAA,GAAQ,CAAA;AAAA,IACjB;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,OAAO,GAAA;AACT;;;ACzGO,SAAS,WAAA,CAAY,GAAA,EAAoB,KAAA,EAAe,GAAA,EAA6B;AAC1F,EAAA,MAAM,EAAE,MAAA,EAAO,GAAI,GAAA,CAAI,OAAA;AACvB,EAAA,MAAM,SAAS,GAAA,GAAM,KAAA;AAErB,EAAA,IAAI,MAAA,GAAS,CAAA,IAAK,MAAA,GAAS,CAAA,EAAG;AAC5B,IAAA,OAAO,eAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,gBAAA,CAAiB,MAAA,EAAQ,KAAA,EAAO,KAAK,MAAM,CAAA;AAC7D,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,IAAI,cAAA,CAAe,MAAA,EAAQ,KAAA,EAAO,SAAS,CAAA,EAAG;AAC5C,MAAA,GAAA,CAAI,SAAA,CAAU,OAAO,GAAG,CAAA;AAAA,IAC1B,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,MAAM,SAAS,CAAA;AACnB,MAAA,GAAA,CAAI,MAAA,CAAO,oBAAA,EAAsB,KAAA,EAAO,CAAA,qBAAA,EAAwB,SAAS,CAAA,CAAE,CAAA;AAAA,IAC7E;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,KAAA,EAAO,KAAK,MAAM,CAAA;AACvD,EAAA,IAAI,YAAY,MAAA,EAAW;AACzB,IAAA,OAAO,eAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,KAAY,OAAA,IAAW,CAAC,GAAA,CAAI,QAAQ,UAAA,EAAY;AAClD,IAAA,OAAO,kBAAA;AAAA,EACT;AAEA,EAAA,GAAA,CAAI,MAAM,MAAM,CAAA;AAChB,EAAA,GAAA,CAAI,MAAA,CAAO,oBAAA,EAAsB,KAAA,EAAO,oCAAoC,CAAA;AAC5E,EAAA,OAAO,SAAA;AACT;AAGA,SAAS,gBAAA,CACP,MAAA,EACA,KAAA,EACA,GAAA,EACA,MAAA,EACoB;AACpB,EAAA,IAAI,WAAW,CAAA,EAAG;AAChB,IAAA,IAAI,WAAA,CAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAG;AAC3C,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,IAAI,WAAA,CAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,MAAM,CAAA,EAAG;AAC3C,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACA,EAAA,IAAI,WAAW,CAAA,IAAK,WAAA,CAAY,QAAQ,KAAA,EAAO,GAAA,EAAK,OAAO,CAAA,EAAG;AAC5D,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA;AACT;AAQA,SAAS,YAAA,CACP,MAAA,EACA,KAAA,EACA,GAAA,EACA,MAAA,EACyB;AACzB,EAAA,QAAQ,MAAA;AAAQ,IACd,KAAK,CAAA;AACH,MAAA,OAAO,YAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,KAAK,IAAI,OAAA,GAAU,MAAA;AAAA,IAC5D,KAAK,CAAA;AACH,MAAA,OAAO,YAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,MAAM,IAAI,YAAA,GAAe,MAAA;AAAA,IAClE,KAAK,CAAA;AACH,MAAA,OAAO,YAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,UAAU,IAAI,OAAA,GAAU,MAAA;AAAA,IACjE,KAAK,CAAA;AACH,MAAA,OAAO,WAAA,CAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,WAAW,CAAA,IAChD,WAAA,CAAY,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,WAAW,CAAA,GACzC,OAAA,GACA,MAAA;AAAA,IACN;AACE,MAAA,OAAO,MAAA;AAAA;AAEb;AAUA,SAAS,WAAA,CAAY,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAa,IAAA,EAAuB;AACtF,EAAA,IAAI,GAAA,GAAM,KAAA,KAAU,IAAA,CAAK,MAAA,EAAQ;AAC/B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,KAAA,IAAS,SAAS,CAAA,EAAG,MAAA,GAAS,IAAA,CAAK,MAAA,EAAQ,UAAU,CAAA,EAAG;AACtD,IAAA,IAAI,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,MAAM,CAAC,CAAA,KAAM,IAAA,CAAK,UAAA,CAAW,MAAM,CAAA,EAAG;AAC/E,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAGA,SAAS,cAAA,CAAe,MAAA,EAAgB,KAAA,EAAe,IAAA,EAAuB;AAC5E,EAAA,KAAA,IAAS,SAAS,CAAA,EAAG,MAAA,GAAS,IAAA,CAAK,MAAA,EAAQ,UAAU,CAAA,EAAG;AACtD,IAAA,IAAI,MAAA,CAAO,WAAW,KAAA,GAAQ,MAAM,MAAM,IAAA,CAAK,UAAA,CAAW,MAAM,CAAA,EAAG;AACjE,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;;;ACzHO,SAAS,UAAA,CAAW,GAAA,EAAoB,KAAA,EAAe,GAAA,EAAsB;AAClF,EAAA,MAAM,EAAE,MAAA,EAAO,GAAI,GAAA,CAAI,OAAA;AAEvB,EAAA,IAAI,iBAAA,CAAkB,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA,EAAG;AACzC,IAAA,GAAA,CAAI,SAAA,CAAU,OAAO,GAAG,CAAA;AACxB,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,UAAA,GAAa,IAAI,OAAA,CAAQ,UAAA;AAC/B,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,IAAI,UAAA,GAAa,KAAA;AAEjB,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACrC,EAAA,IAAI,UAAU,OAAA,EAAS;AAErB,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,UAAA,GAAa,IAAA;AAAA,EACf,CAAA,MAAA,IAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,IAAA,GAAO,GAAA;AACP,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,IAAI,UAAA,IAAc,WAAA,CAAY,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA,EAAG;AACjD,IAAA,OAAO,OAAA,CAAQ,GAAA,EAAK,KAAA,EAAO,KAAA,EAAO,KAAK,IAAI,CAAA;AAAA,EAC7C;AAEA,EAAA,IAAI,cAAA,GAAiB,KAAA;AACrB,EAAA,IAAI,aAAA,GAAgB,EAAA;AACpB,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,MAAA,aAAA,IAAiB,MAAA,CAAO,OAAO,KAAK,CAAA;AAAA,IACtC,CAAA,MAAA,IAAW,SAAS,aAAA,EAAe;AACjC,MAAA,cAAA,GAAiB,IAAA;AAAA,IACnB,CAAA,MAAO;AACL,MAAA;AAAA,IACF;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,IAAI,cAAA,GAAiB,EAAA;AACrB,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,IAAI,QAAQ,GAAA,IAAO,MAAA,CAAO,UAAA,CAAW,KAAK,MAAM,MAAA,EAAQ;AACtD,IAAA,MAAA,GAAS,IAAA;AACT,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,QAAA,cAAA,IAAkB,MAAA,CAAO,OAAO,KAAK,CAAA;AAAA,MACvC,CAAA,MAAA,IAAW,SAAS,aAAA,EAAe;AACjC,QAAA,cAAA,GAAiB,IAAA;AAAA,MACnB,CAAA,MAAO;AACL,QAAA;AAAA,MACF;AACA,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,IAAI,QAAA,GAAW,EAAA;AACf,EAAA,IAAI,QAAQ,GAAA,EAAK;AACf,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,IAAA,KAAS,UAAA,IAAc,IAAA,KAAS,UAAA,EAAY;AAC9C,MAAA,IAAI,SAAS,KAAA,GAAQ,CAAA;AACrB,MAAA,IAAI,YAAA,GAAe,EAAA;AACnB,MAAA,IAAI,SAAS,GAAA,EAAK;AAChB,QAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,CAAW,MAAM,CAAA;AACzC,QAAA,IAAI,QAAA,KAAa,OAAA,IAAW,QAAA,KAAa,QAAA,EAAU;AACjD,UAAA,YAAA,GAAe,QAAA,KAAa,WAAW,GAAA,GAAM,EAAA;AAC7C,UAAA,MAAA,IAAU,CAAA;AAAA,QACZ;AAAA,MACF;AACA,MAAA,MAAM,WAAA,GAAc,MAAA;AACpB,MAAA,OAAO,SAAS,GAAA,IAAO,OAAA,CAAQ,OAAO,UAAA,CAAW,MAAM,CAAC,CAAA,EAAG;AACzD,QAAA,MAAA,IAAU,CAAA;AAAA,MACZ;AACA,MAAA,IAAI,SAAS,WAAA,EAAa;AACxB,QAAA,QAAA,GAAW,IAAI,YAAY,CAAA,EAAG,OAAO,KAAA,CAAM,WAAA,EAAa,MAAM,CAAC,CAAA,CAAA;AAAA,MACjE,CAAA,MAAO;AAEL,QAAA,UAAA,GAAa,IAAA;AAAA,MACf;AACA,MAAA,KAAA,GAAQ,MAAA;AAAA,IACV;AAAA,EACF;AAGA,EAAA,IAAI,UAAU,GAAA,IAAQ,aAAA,CAAc,WAAW,CAAA,IAAK,cAAA,CAAe,WAAW,CAAA,EAAI;AAChF,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,cAAA,EAAgB;AAClB,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,UAAA,GAAa,IAAA;AAAA,EACf;AAEA,EAAA,IAAI,WAAA,GAAc,aAAA;AAClB,EAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAE5B,IAAA,WAAA,GAAc,GAAA;AACd,IAAA,UAAA,GAAa,IAAA;AAAA,EACf,CAAA,MAAA,IAAW,YAAY,MAAA,GAAS,CAAA,IAAK,YAAY,UAAA,CAAW,CAAC,MAAM,OAAA,EAAS;AAE1E,IAAA,IAAI,CAAC,UAAA,EAAY;AACf,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,IAAI,GAAA,GAAM,CAAA;AACV,IAAA,OAAO,GAAA,GAAM,YAAY,MAAA,GAAS,CAAA,IAAK,YAAY,UAAA,CAAW,GAAG,MAAM,OAAA,EAAS;AAC9E,MAAA,GAAA,IAAO,CAAA;AAAA,IACT;AACA,IAAA,WAAA,GAAc,WAAA,CAAY,MAAM,GAAG,CAAA;AACnC,IAAA,UAAA,GAAa,IAAA;AAAA,EACf;AAEA,EAAA,IAAI,MAAA,IAAU,cAAA,CAAe,MAAA,KAAW,CAAA,EAAG;AAEzC,IAAA,UAAA,GAAa,IAAA;AAAA,EACf;AAEA,EAAA,IAAI,CAAC,UAAA,EAAY;AACf,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,GAAA,CAAI,MAAM,IAAI,CAAA;AACd,EAAA,GAAA,CAAI,MAAM,WAAW,CAAA;AACrB,EAAA,IAAI,cAAA,CAAe,SAAS,CAAA,EAAG;AAC7B,IAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,IAAA,GAAA,CAAI,MAAM,cAAc,CAAA;AAAA,EAC1B;AACA,EAAA,GAAA,CAAI,MAAM,QAAQ,CAAA;AAClB,EAAA,GAAA,CAAI,MAAA,CAAO,qBAAqB,KAAK,CAAA;AACrC,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,iBAAA,CAAkB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAsB;AACrF,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,IAAI,QAAQ,GAAA,IAAO,MAAA,CAAO,UAAA,CAAW,KAAK,MAAM,QAAA,EAAU;AACxD,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,IAAI,SAAS,GAAA,EAAK;AAChB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA,KAAM,OAAA,EAAS;AACxC,IAAA,KAAA,IAAS,CAAA;AAAA,EACX,CAAA,MAAO;AACL,IAAA,IAAI,CAAC,OAAA,CAAQ,MAAA,CAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AACtC,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,OAAO,QAAQ,GAAA,IAAO,OAAA,CAAQ,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AACvD,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,GAAA,IAAO,MAAA,CAAO,UAAA,CAAW,KAAK,MAAM,MAAA,EAAQ;AACtD,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,MAAM,WAAA,GAAc,KAAA;AACpB,IAAA,OAAO,QAAQ,GAAA,IAAO,OAAA,CAAQ,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AACvD,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AACA,IAAA,IAAI,UAAU,WAAA,EAAa;AACzB,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,IAAI,QAAQ,GAAA,EAAK;AACf,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,IAAA,KAAS,UAAA,IAAc,IAAA,KAAS,UAAA,EAAY;AAC9C,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,IAAI,QAAQ,GAAA,EAAK;AACf,MAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACxC,MAAA,IAAI,QAAA,KAAa,OAAA,IAAW,QAAA,KAAa,QAAA,EAAU;AACjD,QAAA,KAAA,IAAS,CAAA;AAAA,MACX;AAAA,IACF;AACA,IAAA,MAAM,WAAA,GAAc,KAAA;AACpB,IAAA,OAAO,QAAQ,GAAA,IAAO,OAAA,CAAQ,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AACvD,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AACA,IAAA,IAAI,UAAU,WAAA,EAAa;AACzB,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,KAAU,GAAA;AACnB;AAEA,SAAS,WAAA,CAAY,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAsB;AACxE,EAAA,IAAI,QAAQ,CAAA,IAAK,GAAA,IAAO,OAAO,UAAA,CAAW,KAAK,MAAM,OAAA,EAAS;AAC5D,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AAC1C,EAAA,OAAO,MAAA,KAAW,cAAc,MAAA,KAAW,UAAA;AAC7C;AAQA,SAAS,OAAA,CACP,GAAA,EACA,KAAA,EACA,WAAA,EACA,KACA,IAAA,EACS;AACT,EAAA,MAAM,EAAE,MAAA,EAAO,GAAI,GAAA,CAAI,OAAA;AACvB,EAAA,MAAM,cAAc,WAAA,GAAc,CAAA;AAElC,EAAA,IAAI,KAAA,GAAQ,WAAA;AACZ,EAAA,OAAO,QAAQ,GAAA,IAAO,UAAA,CAAW,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC1D,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,IAAI,KAAA,KAAU,GAAA,IAAO,KAAA,KAAU,WAAA,EAAa;AAC1C,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAQ,MAAA,CAAO,MAAA,CAAO,KAAA,CAAM,WAAA,EAAa,GAAG,CAAC,CAAA;AACnD,EAAA,GAAA,CAAI,MAAM,IAAI,CAAA;AACd,EAAA,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,QAAA,EAAU,CAAA;AAC1B,EAAA,GAAA,CAAI,MAAA,CAAO,qBAAqB,KAAK,CAAA;AACrC,EAAA,OAAO,IAAA;AACT;;;AC5NA,IAAM,YAAA,GAAe,GAAA;AAGrB,IAAM,iBAAA,GAAoB,EAAA;AAG1B,IAAM,WAAA,GAAc,EAAA;AAoBb,SAAS,iBAAA,CAAkB,GAAA,EAAoB,IAAA,EAAc,IAAA,EAAqB;AACvF,EAAA,IAAI,GAAA,CAAI,eAAe,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,GAAA,GAAM,IAAA,GAAO,YAAA,GAAe,MAAM,IAAA,GAAO,YAAA;AACxD,EAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,aAAA;AAClC,EAAA,MAAM,UAAA,GAAa,IAAI,OAAA,CAAQ,UAAA;AAE/B,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,MAAA,EAAQ,IAAA,EAAM,QAAQ,aAAa,CAAA;AAC5D,EAAA,GAAA,CAAI,WAAA,IAAe,QAAQ,IAAA,GAAO,CAAA;AAGlC,EAAA,IAAI,SAAS,GAAA,EAAK;AAChB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,YAAA;AACH,MAAA,IAAI,SAAS,QAAA,EAAU;AACrB,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,OAAO,UAAA,KAAe,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,cAAA,CAAA;AAAA,IAEtD,KAAK,cAAA;AACH,MAAA,IAAI,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,gBAAA,EAAkB;AACxD,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,IAAI,SAAS,QAAA,EAAU;AACrB,QAAA,OAAO,eAAA,CAAgB,GAAA,EAAK,KAAA,GAAQ,CAAA,EAAG,QAAQ,aAAa,CAAA;AAAA,MAC9D;AAEA,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,IAAK,iBAAA,CAAkB,IAAI,CAAA,EAAG;AAC5C,QAAA,OAAO,eAAA,CAAgB,GAAA,EAAK,KAAA,EAAO,MAAA,EAAQ,aAAa,CAAA;AAAA,MAC1D;AACA,MAAA,OAAO,KAAA;AAAA,IAET,KAAK,eAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,IAAI,IAAA,KAAS,gBAAA,IAAoB,IAAA,KAAS,cAAA,EAAgB;AACxD,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,IAAI,SAAS,QAAA,EAAU;AACrB,QAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,KAAA,GAAQ,CAAA,EAAG,QAAQ,aAAa,CAAA;AAAA,MAC/D;AACA,MAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,QAAA,OAAO,gBAAA,CAAiB,GAAA,EAAK,KAAA,EAAO,MAAA,EAAQ,aAAa,CAAA;AAAA,MAC3D;AACA,MAAA,OAAO,KAAA;AAAA,IAET;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;AAGA,SAAS,eAAA,CACP,GAAA,EACA,IAAA,EACA,MAAA,EACA,aAAA,EACS;AACT,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAE5B,EAAA,MAAM,QAAA,GAAW,UAAA,CAAW,MAAA,EAAQ,IAAA,EAAM,QAAQ,aAAa,CAAA;AAC/D,EAAA,GAAA,CAAI,WAAA,IAAe,WAAW,IAAA,GAAO,CAAA;AAErC,EAAA,IAAI,QAAA,IAAY,GAAA,IAAO,QAAA,IAAY,MAAA,EAAQ;AACzC,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,QAAQ,CAAA;AAEvC,EAAA,IAAI,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,QAAA,EAAU;AAChD,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,MAAA,EAAQ,QAAA,EAAU,QAAQ,GAAG,CAAA;AACpD,EAAA,GAAA,CAAI,gBAAgB,MAAA,GAAS,CAAA,GAAI,MAAA,GAAS,QAAA,GAAW,SAAS,QAAA,IAAY,CAAA;AAE1E,EAAA,IAAI,WAAW,WAAA,EAAa;AAC1B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAA,GAAW,UAAA,CAAW,MAAA,EAAQ,MAAA,EAAQ,QAAQ,aAAa,CAAA;AACjE,EAAA,IAAI,QAAA,IAAY,GAAA,IAAO,QAAA,IAAY,MAAA,EAAQ;AACzC,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,MAAA,CAAO,UAAA,CAAW,QAAQ,CAAA,KAAM,QAAA;AACzC;AAGA,SAAS,gBAAA,CACP,GAAA,EACA,IAAA,EACA,MAAA,EACA,aAAA,EACS;AACT,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAE5B,EAAA,MAAM,UAAA,GAAa,UAAA,CAAW,MAAA,EAAQ,IAAA,EAAM,QAAQ,aAAa,CAAA;AACjE,EAAA,GAAA,CAAI,WAAA,IAAe,aAAa,IAAA,GAAO,CAAA;AAEvC,EAAA,IAAI,UAAA,IAAc,GAAA,IAAO,UAAA,IAAc,MAAA,EAAQ;AAC7C,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,UAAU,CAAA;AAEzC,EAAA,IAAI,IAAA,KAAS,gBAAA,IAAoB,IAAA,KAAS,QAAA,EAAU;AAClD,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAA,GAAW,cAAA,CAAe,MAAA,EAAQ,UAAA,EAAY,QAAQ,GAAG,CAAA;AAC/D,EAAA,GAAA,CAAI,gBAAgB,QAAA,GAAW,CAAA,GAAI,MAAA,GAAS,UAAA,GAAa,WAAW,UAAA,IAAc,CAAA;AAElF,EAAA,IAAI,aAAa,WAAA,EAAa;AAC5B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,WAAW,CAAA,EAAG;AAChB,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,UAAA,GAAa,UAAA,CAAW,MAAA,EAAQ,QAAA,EAAU,QAAQ,aAAa,CAAA;AACrE,EAAA,IAAI,UAAA,IAAc,GAAA,IAAO,UAAA,IAAc,MAAA,EAAQ;AAC7C,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,UAAU,CAAA;AACzC,EAAA,OAAO,IAAA,KAAS,YAAY,IAAA,KAAS,gBAAA;AACvC;AAGA,SAAS,OAAA,CAAQ,MAAA,EAAgB,IAAA,EAAc,MAAA,EAAgB,GAAA,EAAqB;AAClF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,IAAI,CAAA;AACnC,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,OAAO,UAAA,CAAW,MAAA,EAAQ,IAAA,EAAM,MAAA,EAAQ,GAAG,CAAA;AAAA,EAC7C;AACA,EAAA,IAAI,CAAC,iBAAA,CAAkB,IAAI,CAAA,EAAG;AAC5B,IAAA,OAAO,iBAAA;AAAA,EACT;AAEA,EAAA,IAAI,QAAQ,IAAA,GAAO,CAAA;AACnB,EAAA,OAAO,QAAQ,MAAA,IAAU,gBAAA,CAAiB,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AACnE,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA,IAAS,MAAA,IAAU,KAAA,GAAQ,GAAA,GAAM,WAAA,GAAc,KAAA;AACxD;AAGA,SAAS,cAAA,CAAe,MAAA,EAAgB,IAAA,EAAc,MAAA,EAAgB,GAAA,EAAqB;AACzF,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,IAAI,CAAA;AAEnC,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,OAAO,UAAA,CAAW,MAAA,EAAQ,IAAA,EAAM,MAAA,EAAQ,GAAG,CAAA;AAAA,EAC7C;AAEA,EAAA,IAAI,IAAA,KAAS,aAAA,IAAiB,IAAA,KAAS,eAAA,EAAiB;AACtD,IAAA,OAAO,WAAA;AAAA,EACT;AACA,EAAA,IAAI,CAAC,OAAA,CAAQ,IAAI,CAAA,IAAK,CAAC,iBAAA,CAAkB,IAAI,CAAA,IAAK,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,OAAA,EAAS;AACvF,IAAA,OAAO,iBAAA;AAAA,EACT;AAEA,EAAA,IAAI,QAAQ,IAAA,GAAO,CAAA;AACnB,EAAA,OAAO,QAAQ,MAAA,EAAQ;AACrB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,IAAK,CAAC,OAAA,CAAQ,IAAI,CAAA,IAAK,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,MAAA,EAAQ;AACpF,MAAA;AAAA,IACF;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA,IAAS,MAAA,IAAU,KAAA,GAAQ,GAAA,GAAM,WAAA,GAAc,KAAA;AACxD;AAGA,SAAS,UAAA,CAAW,MAAA,EAAgB,IAAA,EAAc,MAAA,EAAgB,GAAA,EAAqB;AACrF,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,UAAA,CAAW,IAAI,CAAA;AACrC,EAAA,MAAM,OAAA,GAAU,WAAW,MAAM,CAAA;AAEjC,EAAA,IAAI,QAAQ,IAAA,GAAO,CAAA;AACnB,EAAA,OAAO,QAAQ,MAAA,EAAQ;AACrB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,SAAS,YAAA,EAAc;AACzB,MAAA,KAAA,IAAS,CAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,OAAA,CAAQ,CAAC,KAAK,IAAA,KAAS,OAAA,CAAQ,CAAC,CAAA,EAAG;AAC9C,MAAA,OAAO,KAAA,GAAQ,CAAA;AAAA,IACjB;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA,IAAS,MAAM,iBAAA,GAAoB,WAAA;AAC5C;;;AC5OA,IAAM,SAAA,GAAY,CAAA;AAClB,IAAM,WAAA,GAAc,CAAA;AACpB,IAAM,YAAA,GAAe,EAAA;AACrB,IAAM,qBAAA,GAAwB,EAAA;AAC9B,IAAM,eAAA,GAAkB,EAAA;AACxB,IAAM,SAAA,GAAY,EAAA;AAClB,IAAM,WAAA,GAAc,EAAA;AACpB,IAAM,WAAA,GAAc,EAAA;AAgBb,SAAS,UAAA,CAAW,KAAoB,IAAA,EAAkB;AAC/D,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,OAAA;AAExB,EAAA,MAAM,QAAQ,OAAA,CAAQ,KAAA;AACtB,EAAA,MAAM,MAAA,GAAS,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACtC,EAAA,MAAM,QAAA,GAAW,gBAAgB,MAAM,CAAA;AACvC,EAAA,MAAM,OAAA,GAAU,WAAW,MAAM,CAAA;AACjC,EAAA,MAAM,OAAA,GAAU,QAAQ,CAAC,CAAA;AACzB,EAAA,MAAM,OAAA,GAAU,QAAQ,CAAC,CAAA;AAEzB,EAAA,IAAI,CAAC,QAAA,EAAU;AACb,IAAA,GAAA,CAAI,MAAA,CAAO,qBAAqB,KAAK,CAAA;AAAA,EACvC;AAEA,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAEb,EAAA,IAAI,QAAQ,KAAA,GAAQ,CAAA;AACpB,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,IAAI,UAAA;AAEJ,EAAA,IAAI,kBAAA,GAAqB,EAAA;AAEzB,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,SAAS,YAAA,EAAc;AACzB,MAAA,MAAM,IAAA,GAAO,cAAA,CAAe,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA;AAC9C,MAAA,IAAI,QAAQ,CAAA,EAAG;AACb,QAAA,KAAA,IAAS,IAAA;AACT,QAAA;AAAA,MACF;AAEA,MAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAE9B,MAAA,QAAQ,IAAA;AAAM,QACZ,KAAK,YAAA;AACH,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,qDAAqD,CAAA;AACvF,UAAA,KAAA,GAAQ,GAAA;AACR,UAAA;AAAA,QACF,KAAK,qBAAA;AACH,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,gDAAgD,CAAA;AAClF,UAAA,KAAA,GAAQ,GAAA;AACR,UAAA;AAAA,QACF,KAAK,eAAA;AACH,UAAA,GAAA,CAAI,MAAM,OAAO,CAAA;AACjB,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,oCAAoC,CAAA;AACtE,UAAA,KAAA,IAAS,CAAA;AACT,UAAA;AAAA,QACF,KAAK,SAAA,EAAW;AAEd,UAAA,MAAM,MAAA,GAAS,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AAC1C,UAAA,GAAA,CAAI,MAAM,MAAA,KAAW,eAAA,GAAkB,QAAQ,MAAA,CAAO,KAAA,GAAQ,CAAC,CAAE,CAAA;AACjE,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,6CAA6C,CAAA;AAC/E,UAAA,KAAA,IAAS,CAAA;AACT,UAAA;AAAA,QACF;AAAA,QACA,KAAK,WAAA;AACH,UAAA,GAAA,CAAI,MAAM,aAAA,CAAc,MAAA,CAAO,WAAW,KAAA,GAAQ,CAAC,CAAC,CAAC,CAAA;AACrD,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,iDAAiD,CAAA;AACnF,UAAA,KAAA,IAAS,CAAA;AACT,UAAA;AAAA,QACF;AAEE,UAAA,GAAA,CAAI,MAAM,MAAM,CAAA;AAChB,UAAA,GAAA,CAAI,KAAA,CAAM,MAAA,CAAO,KAAA,GAAQ,CAAC,CAAE,CAAA;AAC5B,UAAA,GAAA,CAAI,MAAA,CAAO,cAAA,EAAgB,KAAA,EAAO,oDAAoD,CAAA;AACtF,UAAA,KAAA,IAAS,CAAA;AACT,UAAA;AAAA;AAGJ,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,OAAA,EAAS;AACxC,MAAA,IAAI,iBAAA,CAAkB,GAAA,EAAK,KAAA,GAAQ,CAAA,EAAG,IAAI,CAAA,EAAG;AAC3C,QAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,QAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,QAAA,OAAA,CAAQ,QAAQ,KAAA,GAAQ,CAAA;AACxB,QAAA;AAAA,MACF;AAKA,MAAA,IAAI,QAAA,IAAY,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AACvC,QAAA,IAAI,UAAA,KAAe,MAAA,IAAa,GAAA,CAAI,WAAA,CAAY,UAAU,CAAA,EAAG;AAC3D,UAAA,iBAAA,CAAkB,KAAK,UAAU,CAAA;AACjC,UAAA;AAAA,QACF;AACA,QAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,QAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,QAAA,OAAA,CAAQ,QAAQ,KAAA,GAAQ,CAAA;AACxB,QAAA;AAAA,MACF;AAEA,MAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,MAAA,IAAI,QAAA,EAAU;AACZ,QAAA,GAAA,CAAI,MAAM,KAAK,CAAA;AACf,QAAA,GAAA,CAAI,MAAA,CAAO,mBAAA,EAAqB,KAAA,EAAO,iCAAiC,CAAA;AAAA,MAC1E,CAAA,MAAO;AACL,QAAA,GAAA,CAAI,KAAA,CAAM,MAAA,CAAO,KAAK,CAAE,CAAA;AAAA,MAC1B;AACA,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,OAAO,EAAA,EAAM;AACf,MAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,MAAA,IAAI,IAAA,KAAS,YAAA,IAAgB,IAAA,KAAS,kBAAA,EAAoB;AAGxD,QAAA,UAAA,GAAa,GAAA,CAAI,WAAW,KAAK,CAAA;AAAA,MACnC;AACA,MAAA,IAAI,UAAU,kBAAA,EAAoB;AAChC,QAAA,GAAA,CAAI,MAAA,CAAO,mBAAA,EAAqB,KAAA,EAAO,6CAA6C,CAAA;AAAA,MACtF;AACA,MAAA,kBAAA,GAAqB,KAAA,GAAQ,CAAA;AAC7B,MAAA,GAAA,CAAI,KAAA,CAAM,aAAA,CAAc,IAAI,CAAC,CAAA;AAC7B,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,SAAS,eAAA,EAAiB;AAE5B,MAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,MAAA,GAAA,CAAI,MAAM,KAAK,CAAA;AACf,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,eAAA,CAAgB,IAAI,CAAA,EAAG;AACzB,MAAA,IAAI,KAAA,GAAQ,IAAI,GAAA,IAAO,cAAA,CAAe,OAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,EAAG;AACnE,QAAA,KAAA,IAAS,CAAA;AACT,QAAA;AAAA,MACF;AACA,MAAA,KAAA,GAAQ,eAAA,CAAgB,GAAA,EAAK,SAAA,EAAW,KAAA,EAAO,IAAI,CAAA;AACnD,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,cAAA,CAAe,IAAI,CAAA,EAAG;AACxB,MAAA,KAAA,GAAQ,eAAA,CAAgB,GAAA,EAAK,SAAA,EAAW,KAAA,EAAO,IAAI,CAAA;AACnD,MAAA,SAAA,GAAY,KAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAGA,EAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAE9B,EAAA,IACE,UAAA,KAAe,MAAA,IACf,GAAA,CAAI,WAAA,CAAY,UAAU,CAAA,IAC1B,gBAAA,CAAiB,MAAA,EAAQ,UAAA,CAAW,KAAA,EAAO,GAAG,CAAA,EAC9C;AACA,IAAA,iBAAA,CAAkB,KAAK,UAAU,CAAA;AACjC,IAAA;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,EAAA,GAAA,CAAI,MAAA,CAAO,4BAA4B,GAAG,CAAA;AAC1C,EAAA,OAAA,CAAQ,KAAA,GAAQ,GAAA;AAClB;AASO,SAAS,eAAA,CAAgB,GAAA,EAAoB,IAAA,EAAc,EAAA,EAAkB;AAClF,EAAA,MAAM,EAAE,MAAA,EAAO,GAAI,GAAA,CAAI,OAAA;AAEvB,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAEb,EAAA,IAAI,SAAA,GAAY,IAAA;AAChB,EAAA,KAAA,IAAS,KAAA,GAAQ,IAAA,EAAM,KAAA,GAAQ,EAAA,EAAI,SAAS,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,WAAA;AACJ,IAAA,IAAI,SAAS,eAAA,EAAiB;AAC5B,MAAA,WAAA,GAAc,KAAA;AAAA,IAChB,CAAA,MAAA,IAAW,SAAS,YAAA,EAAc;AAChC,MAAA,WAAA,GAAc,MAAA;AAAA,IAChB,CAAA,MAAA,IAAW,OAAO,EAAA,EAAM;AACtB,MAAA,WAAA,GAAc,cAAc,IAAI,CAAA;AAAA,IAClC,CAAA,MAAA,IAAW,eAAA,CAAgB,IAAI,CAAA,EAAG;AAChC,MAAA,IAAI,KAAA,GAAQ,IAAI,EAAA,IAAM,cAAA,CAAe,OAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,EAAG;AAClE,QAAA,KAAA,IAAS,CAAA;AACT,QAAA;AAAA,MACF;AACA,MAAA,WAAA,GAAc,WAAW,IAAI,CAAA;AAAA,IAC/B,CAAA,MAAA,IAAW,cAAA,CAAe,IAAI,CAAA,EAAG;AAC/B,MAAA,WAAA,GAAc,WAAW,IAAI,CAAA;AAAA,IAC/B;AAEA,IAAA,IAAI,gBAAgB,MAAA,EAAW;AAC7B,MAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,MAAA,GAAA,CAAI,MAAM,WAAW,CAAA;AACrB,MAAA,SAAA,GAAY,KAAA,GAAQ,CAAA;AAAA,IACtB;AAAA,EACF;AAEA,EAAA,GAAA,CAAI,SAAA,CAAU,WAAW,EAAE,CAAA;AAC3B,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACf;AAUA,SAAS,eAAA,CACP,GAAA,EACA,SAAA,EACA,KAAA,EACA,IAAA,EACQ;AACR,EAAA,GAAA,CAAI,SAAA,CAAU,WAAW,KAAK,CAAA;AAC9B,EAAA,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,IAAI,CAAC,CAAA;AAC1B,EAAA,GAAA,CAAI,MAAA,CAAO,mBAAA,EAAqB,KAAA,EAAO,+BAA+B,CAAA;AACtE,EAAA,OAAO,KAAA,GAAQ,CAAA;AACjB;AAGA,SAAS,iBAAA,CAAkB,KAAoB,UAAA,EAA8B;AAC3E,EAAA,GAAA,CAAI,SAAS,UAAU,CAAA;AACvB,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,EAAA,GAAA,CAAI,MAAA,CAAO,8BAAA,EAAgC,UAAA,CAAW,KAAK,CAAA;AAC7D;AASA,SAAS,cAAA,CAAe,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAqB;AAC1E,EAAA,IAAI,KAAA,GAAQ,KAAK,GAAA,EAAK;AACpB,IAAA,OAAO,YAAA;AAAA,EACT;AAEA,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AAE3C,EAAA,QAAQ,OAAA;AAAS,IACf,KAAK,eAAA;AAAA,IACL,KAAK,YAAA;AAAA,IACL,KAAK,QAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,UAAA;AAAA,IACL,KAAK,UAAA;AACH,MAAA,OAAO,SAAA;AAAA,IACT,KAAK,UAAA;AACH,MAAA,IACE,KAAA,GAAQ,CAAA,GAAI,GAAA,IACZ,UAAA,CAAW,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,IACvC,UAAA,CAAW,MAAA,CAAO,WAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,IACvC,UAAA,CAAW,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,IACvC,UAAA,CAAW,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,EACvC;AACA,QAAA,OAAO,WAAA;AAAA,MACT;AACA,MAAA,OAAO,KAAA,GAAQ,CAAA,GAAI,GAAA,GAAM,qBAAA,GAAwB,eAAA;AAEjD;AAGJ,EAAA,IAAI,OAAA,CAAQ,OAAO,CAAA,EAAG;AACpB,IAAA,OAAO,SAAA;AAAA,EACT;AACA,EAAA,OAAO,OAAA,GAAU,KAAO,WAAA,GAAc,WAAA;AACxC;AAUA,SAAS,gBAAA,CAAiB,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAsB;AAC5E,EAAA,KAAA,IAAS,KAAA,GAAQ,IAAA,EAAM,KAAA,GAAQ,GAAA,EAAK,SAAS,CAAA,EAAG;AAC9C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IACE,IAAA,KAAS,kBACT,IAAA,KAAS,gBAAA,IACT,SAAS,QAAA,IACT,YAAA,CAAa,IAAI,CAAA,EACjB;AACA,MAAA;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AAGA,SAAS,cAAc,IAAA,EAAsB;AAC3C,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,CAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,CAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT,KAAK,EAAA;AACH,MAAA,OAAO,KAAA;AAAA,IACT;AACE,MAAA,OAAO,WAAW,IAAI,CAAA;AAAA;AAE5B;AAGA,SAAS,WAAW,IAAA,EAAsB;AACxC,EAAA,OAAO,CAAA,GAAA,EAAM,KAAK,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAA;AACjD;;;ACpWO,SAAS,cAAc,GAAA,EAA+B;AAC3D,EAAA,UAAA,CAAW,GAAG,CAAA;AAEd,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,OAAA,CAAQ,IAAA,EAAK;AAE9B,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,KAAA;AAClC,IAAA,GAAA,CAAI,QAAQ,KAAA,IAAS,CAAA;AACrB,IAAA,UAAA,CAAW,GAAG,CAAA;AAEd,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,OAAA,CAAQ,IAAA,EAAK;AAC9B,IAAA,IAAI,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,gBAAA,IAAoB,SAAS,MAAA,EAAQ;AAC3E,MAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,iBAAA,EAAmB;AAClC,QAAA,GAAA,CAAI,IAAA,CAAK,kDAAkD,aAAa,CAAA;AAAA,MAC1E;AACA,MAAA,GAAA,CAAI,MAAA,CAAO,0BAA0B,aAAa,CAAA;AAClD,MAAA,OAAO,gBAAA;AAAA,IACT;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AAEA,EAAA,IAAI,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,gBAAA,IAAoB,SAAS,MAAA,EAAQ;AAC3E,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,GAAA,CAAI,MAAA,CAAO,qBAAA,EAAuB,GAAA,CAAI,OAAA,CAAQ,KAAK,CAAA;AACnD,EAAA,OAAO,SAAA;AACT;;;ACPO,SAAS,cAAc,GAAA,EAA0B;AACtD,EAAA,UAAA,CAAW,GAAG,CAAA;AAEd,EAAA,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,EAAI,EAAG;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,eAAA,EAAiB,qBAAA,EAAuB,GAAA,CAAI,QAAQ,KAAK,CAAA;AAAA,EAC3E;AAEA,EAAA,IAAI,UAAA,CAAW,GAAA,EAAK,UAAA,EAAY,KAAK,MAAM,SAAA,EAAW;AACpD,IAAA,MAAM,IAAI,KAAA,CAAM,eAAA,EAAiB,qBAAA,EAAuB,GAAA,CAAI,QAAQ,KAAK,CAAA;AAAA,EAC3E;AACF;AASO,SAAS,UAAA,CAAW,GAAA,EAAoB,IAAA,EAAY,OAAA,EAA+B;AACxF,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,WAAS;AACP,IAAA,UAAA,CAAW,GAAG,CAAA;AAEd,IAAA,MAAM,QAAQ,OAAA,CAAQ,KAAA;AACtB,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAE1B,IAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,MAAA,OAAO,SAAA;AAAA,IACT;AACA,IAAA,IAAI,SAAS,aAAA,EAAe;AAC1B,MAAA,OAAO,WAAA,CAAY,KAAK,OAAO,CAAA;AAAA,IACjC;AACA,IAAA,IAAI,SAAS,eAAA,EAAiB;AAC5B,MAAA,OAAO,UAAA,CAAW,KAAK,OAAO,CAAA;AAAA,IAChC;AACA,IAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,MAAA,IAAI,IAAA,KAAS,eAAA,IAAmB,CAAC,GAAA,CAAI,QAAQ,iBAAA,EAAmB;AAC9D,QAAA,GAAA,CAAI,IAAA,CAAK,oEAAoE,KAAK,CAAA;AAAA,MACpF;AACA,MAAA,UAAA,CAAW,KAAK,IAAI,CAAA;AACpB,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,IACE,SAAS,cAAA,IACT,IAAA,KAAS,oBACT,IAAA,KAAS,QAAA,IACT,SAAS,QAAA,EACT;AAEA,MAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,QAAA,GAAA,CAAI,MAAA,CAAO,oBAAoB,KAAK,CAAA;AAAA,MACtC;AACA,MAAA,GAAA,CAAI,MAAM,MAAM,CAAA;AAChB,MAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,KAAK,CAAA;AACvC,MAAA,OAAO,IAAA;AAAA,IACT;AAEA,IAAA,MAAM,OAAA,GAAU,aAAA,CAAc,GAAA,EAAK,KAAK,CAAA;AACxC,IAAA,IAAI,UAAU,KAAA,EAAO;AACnB,MAAA,OAAO,cAAA,CAAe,GAAA,EAAK,KAAA,EAAO,OAAO,CAAA;AAAA,IAC3C;AAIA,IAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,MAAA,GAAA,CAAI,IAAA,CAAK,wBAAwB,YAAA,CAAa,OAAA,CAAQ,QAAQ,KAAK,CAAC,IAAI,KAAK,CAAA;AAAA,IAC/E;AACA,IAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,KAAK,CAAA;AACvC,IAAA,OAAA,CAAQ,QAAQ,KAAA,GAAQ,CAAA;AAAA,EAC1B;AACF;AAIA,SAAS,WAAA,CAAY,KAAoB,OAAA,EAA+B;AACtE,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,eAAe,OAAA,CAAQ,KAAA;AAC7B,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,UAAA,CAAW,YAAY,CAAA;AAEzC,EAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,EAAA,GAAA,CAAI,MAAM,YAAY,CAAA;AACtB,EAAA,GAAA,CAAI,UAAA,IAAc,CAAA;AAClB,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAEb,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,IAAI,aAAA,GAAgB,EAAA;AAEpB,EAAA,WAAS;AACP,IAAA,UAAA,CAAW,GAAG,CAAA;AAEd,IAAA,IAAI,OAAA,CAAQ,UAAU,aAAA,EAAe;AACnC,MAAA,GAAA,CAAI,IAAA,CAAK,yBAAA,EAA2B,OAAA,CAAQ,KAAK,CAAA;AAAA,IACnD;AACA,IAAA,aAAA,GAAgB,OAAA,CAAQ,KAAA;AAExB,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAE1B,IAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,MAAA,iBAAA,CAAkB,GAAA,EAAK,QAAA,EAAU,OAAA,CAAQ,KAAK,CAAA;AAC9C,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,cAAA,EAAgB;AAC3B,MAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,MAAA,MAAA,GAAS,IAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,gBAAA,EAAkB;AAC7B,MAAA,IAAI,GAAA,CAAI,eAAe,CAAA,EAAG;AAGxB,QAAA,iBAAA,CAAkB,GAAA,EAAK,QAAA,EAAU,OAAA,CAAQ,KAAK,CAAA;AAC9C,QAAA;AAAA,MACF;AACA,MAAA,eAAA,CAAgB,GAAG,CAAA;AACnB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,QAAA,EAAU;AAErB,MAAA,GAAA,CAAI,MAAA,CAAO,qBAAA,EAAuB,OAAA,CAAQ,KAAK,CAAA;AAC/C,MAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,EAAK,IAAI,CAAA,EAAG;AAC3B,MAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,QAAA,GAAA,CAAI,IAAA;AAAA,UACF,iCAAiC,YAAA,CAAa,OAAA,CAAQ,MAAA,EAAQ,OAAA,CAAQ,KAAK,CAAC,CAAA,CAAA;AAAA,UAC5E,OAAA,CAAQ;AAAA,SACV;AAAA,MACF;AACA,MAAA,GAAA,CAAI,MAAA,CAAO,qBAAA,EAAuB,OAAA,CAAQ,KAAK,CAAA;AAC/C,MAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAK,CAAA;AACzC,IAAA,IAAI,UAAU,CAAA,EAAG;AACf,MAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAAA,IACf;AAEA,IAAA,IAAI,WAAA,CAAY,GAAG,CAAA,KAAM,SAAA,EAAW;AAClC,MAAA,GAAA,CAAI,QAAQ,IAAI,CAAA;AAChB,MAAA,OAAA,CAAQ,QAAQ,OAAA,CAAQ,GAAA;AACxB,MAAA,GAAA,CAAI,MAAA,CAAO,2BAAA,EAA6B,IAAA,CAAK,KAAK,CAAA;AAClD,MAAA,iBAAA,CAAkB,GAAA,EAAK,QAAA,EAAU,IAAA,CAAK,KAAK,CAAA;AAC3C,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,OAAA,IAAW,CAAA;AACX,IAAA,aAAA,CAAc,GAAG,CAAA;AAAA,EACnB;AAEA,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,EAAA,GAAA,CAAI,UAAA,IAAc,CAAA;AAClB,EAAA,GAAA,CAAI,KAAA,EAAM;AAEV,EAAA,IAAI,OAAA,IAAW,SAAA,IAAa,CAAC,MAAA,IAAU,YAAY,CAAA,EAAG;AAEpD,IAAA,GAAA,CAAI,QAAQ,KAAK,CAAA;AACjB,IAAA,OAAA,CAAQ,QAAQ,OAAA,CAAQ,GAAA;AACxB,IAAA,OAAO,SAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AAGA,SAAS,YAAY,GAAA,EAAiC;AACpD,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,QAAA,CAAS,GAAG,CAAA;AACZ,EAAA,UAAA,CAAW,GAAG,CAAA;AAEd,EAAA,MAAM,WAAW,OAAA,CAAQ,KAAA;AACzB,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAE1B,EAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AAAA,EACnB,CAAA,MAAA,IAAW,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,QAAA,EAAU;AAEvD,IAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,MAAA,GAAA,CAAI,MAAA,CAAO,2BAA2B,QAAQ,CAAA;AAAA,IAChD;AACA,IAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,QAAQ,CAAA;AAC1C,IAAA,GAAA,CAAI,MAAM,OAAO,CAAA;AACjB,IAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,QAAQ,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACT,CAAA,MAAA,IAAW,OAAA,CAAQ,IAAI,CAAA,EAAG;AAExB,IAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,MAAA,GAAA,CAAI,MAAA,CAAO,sCAAsC,QAAQ,CAAA;AAAA,IAC3D;AACA,IAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,QAAQ,CAAA;AAAA,EAC5C,CAAA,MAAO;AAEL,IAAA,GAAA,CAAI,MAAA,CAAO,uBAAuB,QAAQ,CAAA;AAAA,EAC5C;AAEA,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,EAAA,OAAO,UAAA,CAAW,GAAA,EAAK,cAAA,EAAgB,IAAI,CAAA;AAC7C;AAGA,SAAS,SAAS,GAAA,EAA0B;AAC1C,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,OAAA;AACxB,EAAA,MAAM,QAAQ,OAAA,CAAQ,KAAA;AACtB,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAE1B,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,UAAA,CAAW,KAAK,YAAY,CAAA;AAC5B,IAAA;AAAA,EACF;AAEA,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,IAAI,iBAAA,CAAkB,IAAI,CAAA,EAAG;AAC3B,IAAA,KAAA,IAAS,CAAA;AACT,IAAA,OAAO,QAAQ,GAAA,IAAO,gBAAA,CAAiB,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAChE,MAAA,KAAA,IAAS,CAAA;AAAA,IACX;AAAA,EACF,CAAA,MAAO;AAEL,IAAA,KAAA,GAAQ,WAAA,CAAY,KAAK,KAAK,CAAA;AAAA,EAChC;AAEA,EAAA,eAAA,CAAgB,GAAA,EAAK,OAAO,KAAK,CAAA;AACjC,EAAA,GAAA,CAAI,MAAA,CAAO,cAAc,KAAK,CAAA;AAC9B,EAAA,OAAA,CAAQ,KAAA,GAAQ,KAAA;AAClB;AAGA,SAAS,WAAA,CAAY,KAAoB,IAAA,EAAuB;AAC9D,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,OAAO,IAAA,KAAS,eAAA,IAAmB,GAAA,CAAI,OAAA,CAAQ,iBAAA;AAAA,EACjD;AACA,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,iBAAA,EAAmB;AAClC,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,iBAAA,CAAkB,IAAI,CAAA,EAAG;AAC3B,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,UAAA,IAAc,CAAC,aAAa,IAAI,CAAA;AACrD;AAIA,SAAS,UAAA,CAAW,KAAoB,OAAA,EAA+B;AACrE,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AACpB,EAAA,MAAM,eAAe,OAAA,CAAQ,KAAA;AAC7B,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,UAAA,CAAW,YAAY,CAAA;AAEzC,EAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,EAAA,GAAA,CAAI,MAAM,YAAY,CAAA;AACtB,EAAA,GAAA,CAAI,YAAA,IAAgB,CAAA;AACpB,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAEb,EAAA,IAAI,QAAA,GAAW,CAAA;AACf,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,IAAI,aAAA,GAAgB,EAAA;AAEpB,EAAA,WAAS;AACP,IAAA,UAAA,CAAW,GAAG,CAAA;AAEd,IAAA,IAAI,OAAA,CAAQ,UAAU,aAAA,EAAe;AACnC,MAAA,GAAA,CAAI,IAAA,CAAK,yBAAA,EAA2B,OAAA,CAAQ,KAAK,CAAA;AAAA,IACnD;AACA,IAAA,aAAA,GAAgB,OAAA,CAAQ,KAAA;AAExB,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAE1B,IAAA,IAAI,SAAS,MAAA,EAAQ;AACnB,MAAA,iBAAA,CAAkB,GAAA,EAAK,OAAA,EAAS,OAAA,CAAQ,KAAK,CAAA;AAC7C,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,gBAAA,EAAkB;AAC7B,MAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,MAAA,MAAA,GAAS,IAAA;AACT,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,cAAA,EAAgB;AAC3B,MAAA,IAAI,GAAA,CAAI,aAAa,CAAA,EAAG;AACtB,QAAA,iBAAA,CAAkB,GAAA,EAAK,OAAA,EAAS,OAAA,CAAQ,KAAK,CAAA;AAC7C,QAAA;AAAA,MACF;AACA,MAAA,eAAA,CAAgB,GAAG,CAAA;AACnB,MAAA;AAAA,IACF;AACA,IAAA,IAAI,SAAS,QAAA,EAAU;AAGrB,MAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,QAAA,GAAA,CAAI,MAAA,CAAO,0BAAA,EAA4B,OAAA,CAAQ,KAAK,CAAA;AAAA,MACtD;AACA,MAAA,IAAI,WAAW,CAAA,EAAG;AAChB,QAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAAA,MACf;AACA,MAAA,GAAA,CAAI,MAAM,MAAM,CAAA;AAChB,MAAA,GAAA,CAAI,MAAA,CAAO,qBAAA,EAAuB,OAAA,CAAQ,KAAK,CAAA;AAC/C,MAAA,QAAA,IAAY,CAAA;AACZ,MAAA,OAAA,CAAQ,KAAA,IAAS,CAAA;AACjB,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,IAAA,GAAO,GAAA,CAAI,UAAA,CAAW,OAAA,CAAQ,KAAK,CAAA;AACzC,IAAA,IAAI,WAAW,CAAA,EAAG;AAChB,MAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AAAA,IACf;AAEA,IAAA,IAAI,UAAA,CAAW,GAAA,EAAK,eAAA,EAAiB,IAAI,MAAM,SAAA,EAAW;AACxD,MAAA,GAAA,CAAI,QAAQ,IAAI,CAAA;AAChB,MAAA,OAAA,CAAQ,QAAQ,OAAA,CAAQ,GAAA;AACxB,MAAA,GAAA,CAAI,MAAA,CAAO,2BAAA,EAA6B,IAAA,CAAK,KAAK,CAAA;AAClD,MAAA,iBAAA,CAAkB,GAAA,EAAK,OAAA,EAAS,IAAA,CAAK,KAAK,CAAA;AAC1C,MAAA,SAAA,GAAY,IAAA;AACZ,MAAA;AAAA,IACF;AAEA,IAAA,QAAA,IAAY,CAAA;AACZ,IAAA,aAAA,CAAc,GAAG,CAAA;AAAA,EACnB;AAEA,EAAA,GAAA,CAAI,MAAM,GAAG,CAAA;AACb,EAAA,GAAA,CAAI,YAAA,IAAgB,CAAA;AACpB,EAAA,GAAA,CAAI,KAAA,EAAM;AAEV,EAAA,IAAI,OAAA,IAAW,SAAA,IAAa,CAAC,MAAA,IAAU,aAAa,CAAA,EAAG;AACrD,IAAA,GAAA,CAAI,QAAQ,KAAK,CAAA;AACjB,IAAA,OAAA,CAAQ,QAAQ,OAAA,CAAQ,GAAA;AACxB,IAAA,OAAO,SAAA;AAAA,EACT;AACA,EAAA,OAAO,IAAA;AACT;AAKA,SAAS,cAAA,CAAe,GAAA,EAAoB,KAAA,EAAe,OAAA,EAA8B;AACvF,EAAA,MAAM,EAAE,SAAQ,GAAI,GAAA;AAEpB,EAAA,MAAM,OAAA,GAAU,WAAA,CAAY,GAAA,EAAK,KAAA,EAAO,OAAO,CAAA;AAC/C,EAAA,IAAI,YAAY,SAAA,EAAW;AACzB,IAAA,OAAA,CAAQ,KAAA,GAAQ,OAAA;AAChB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,YAAY,kBAAA,EAAoB;AAClC,IAAA,GAAA,CAAI,MAAA,CAAO,IAAI,OAAA,CAAQ,KAAA,CAAM,OAAO,OAAO,CAAC,2BAA2B,KAAK,CAAA;AAAA,EAC9E;AAEA,EAAA,IAAI,UAAA,CAAW,GAAA,EAAK,KAAA,EAAO,OAAO,CAAA,EAAG;AACnC,IAAA,OAAA,CAAQ,KAAA,GAAQ,OAAA;AAChB,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,CAAC,GAAA,CAAI,OAAA,CAAQ,UAAA,EAAY;AAC3B,IAAA,GAAA,CAAI,MAAA,CAAO,mBAAmB,OAAA,CAAQ,KAAA,CAAM,OAAO,OAAO,CAAC,KAAK,KAAK,CAAA;AAAA,EACvE;AAEA,EAAA,MAAM,QAAA,GAAW,eAAA,CAAgB,GAAA,EAAK,OAAO,CAAA;AAC7C,EAAA,eAAA,CAAgB,GAAA,EAAK,OAAO,QAAQ,CAAA;AACpC,EAAA,GAAA,CAAI,MAAA,CAAO,gBAAgB,KAAK,CAAA;AAChC,EAAA,OAAA,CAAQ,KAAA,GAAQ,QAAA;AAChB,EAAA,OAAO,IAAA;AACT;AAMA,SAAS,aAAA,CAAc,KAAoB,IAAA,EAAsB;AAC/D,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAC5B,EAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,aAAA;AAElC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IACE,YAAA,CAAa,IAAI,CAAA,IACjB,YAAA,CAAa,IAAI,CAAA,IACjB,OAAA,CAAQ,IAAI,CAAA,IACZ,aAAA,CAAc,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,aAAa,CAAA,EAC/C;AACA,MAAA;AAAA,IACF;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;AASA,SAAS,eAAA,CAAgB,KAAoB,IAAA,EAAsB;AACjE,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAC5B,EAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,aAAA;AAElC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,IAAI,WAAA,GAAc,IAAA;AAClB,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,YAAA,CAAa,IAAI,CAAA,IAAK,aAAA,CAAc,QAAQ,KAAA,EAAO,GAAA,EAAK,aAAa,CAAA,EAAG;AAC1E,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,MAAA,WAAA,GAAc,KAAA,GAAQ,CAAA;AAAA,IACxB;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,WAAA;AACT;AAGA,SAAS,WAAA,CAAY,KAAoB,IAAA,EAAsB;AAC7D,EAAA,MAAM,EAAE,MAAA,EAAQ,GAAA,EAAI,GAAI,GAAA,CAAI,OAAA;AAC5B,EAAA,MAAM,aAAA,GAAgB,IAAI,OAAA,CAAQ,aAAA;AAElC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,IAAI,cAAc,IAAA,GAAO,CAAA;AACzB,EAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IACE,IAAA,KAAS,QAAA,IACT,YAAA,CAAa,IAAI,CAAA,IACjB,cAAc,MAAA,EAAQ,KAAA,EAAO,GAAA,EAAK,aAAa,CAAA,EAC/C;AACA,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,MAAA,WAAA,GAAc,KAAA,GAAQ,CAAA;AAAA,IACxB;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,WAAA;AACT;AAEA,SAAS,aAAA,CACP,MAAA,EACA,KAAA,EACA,GAAA,EACA,aAAA,EACS;AACT,EAAA,IAAI,CAAC,aAAA,EAAe;AAClB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,EAAA,IAAI,SAAS,OAAA,EAAS;AACpB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,KAAS,QAAA,IAAY,KAAA,GAAQ,CAAA,IAAK,GAAA,EAAK;AACzC,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAA,GAAQ,CAAC,CAAA;AACxC,EAAA,OAAO,IAAA,KAAS,YAAY,IAAA,KAAS,WAAA;AACvC;AAGA,SAAS,YAAA,CAAa,QAAgB,KAAA,EAAuB;AAC3D,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,EAAA,IAAI,MAAA,CAAO,KAAA,CAAM,IAAI,CAAA,EAAG;AACtB,IAAA,OAAO,cAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,GAAO,EAAA,IAAQ,IAAA,KAAS,GAAA,EAAM;AAChC,IAAA,OAAO,CAAA,IAAA,EAAO,KAAK,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EAClD;AACA,EAAA,OAAO,CAAA,CAAA,EAAI,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA;AACjC;;;ACrgBA,IAAM,QAAA,GAAuC;AAAA,EAC3C,yBAAA,EAA2B,mCAAA;AAAA,EAC3B,gBAAA,EAAkB,sCAAA;AAAA,EAClB,iBAAA,EAAmB,mBAAA;AAAA,EACnB,uBAAA,EAAyB,6DAAA;AAAA,EACzB,wBAAA,EAA0B,0BAAA;AAAA,EAC1B,qBAAA,EAAuB,2BAAA;AAAA,EACvB,qBAAA,EAAuB,gDAAA;AAAA,EACvB,0BAAA,EAA4B,iDAAA;AAAA,EAC5B,2BAAA,EAA6B,kCAAA;AAAA,EAC7B,qBAAA,EAAuB,0BAAA;AAAA,EACvB,qBAAA,EAAuB,0BAAA;AAAA,EACvB,qBAAA,EAAuB,mCAAA;AAAA,EACvB,qBAAA,EAAuB,+BAAA;AAAA,EACvB,uBAAA,EAAyB,8BAAA;AAAA,EACzB,mBAAA,EAAqB,gDAAA;AAAA,EACrB,oBAAA,EAAsB,4BAAA;AAAA,EACtB,mBAAA,EAAqB,2BAAA;AAAA,EACrB,YAAA,EAAc,wBAAA;AAAA,EACd,cAAA,EAAgB,0BAAA;AAAA,EAChB,mBAAA,EAAqB,2CAAA;AAAA,EACrB,cAAA,EAAgB,sCAAA;AAAA,EAChB,0BAAA,EAA4B,2CAAA;AAAA,EAC5B,8BAAA,EACE;AACJ,CAAA;AAGO,SAAS,eAAe,IAAA,EAA0B;AACvD,EAAA,OAAO,SAAS,IAAI,CAAA;AACtB;;;ACtBA,IAAM,mBAAA,GAAsB,CAAA;AAoBrB,IAAM,gBAAN,MAAoB;AAAA,EAChB,OAAA;AAAA,EACA,OAAA;AAAA;AAAA,EAGA,UAA6B,EAAC;AAAA;AAAA,EAGtB,SAAmB,EAAC;AAAA;AAAA,EAG7B,KAAA,GAAQ,CAAA;AAAA;AAAA,EAGhB,UAAA,GAAa,CAAA;AAAA;AAAA,EAGb,YAAA,GAAe,CAAA;AAAA;AAAA,EAGf,WAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAA,GAAa,EAAA;AAAA,EAEb,WAAA,CAAY,SAAkB,OAAA,EAA0B;AACtD,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,WAAA,GAAA,CAAe,OAAA,CAAQ,GAAA,GAAM,OAAA,CAAQ,KAAA,IAAS,mBAAA;AAAA,EACrD;AAAA;AAAA;AAAA,EAKA,MAAM,IAAA,EAAoB;AACxB,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAA,CAAU,MAAc,EAAA,EAAkB;AACxC,IAAA,IAAI,KAAK,IAAA,EAAM;AACb,MAAA,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA,CAAK,QAAQ,KAAA,CAAM,IAAA,EAAM,EAAE,CAAC,CAAA;AAAA,IAC/C;AAAA,EACF;AAAA;AAAA,EAGA,MAAA,GAAiB;AACf,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,EAAE,CAAA;AAAA,EAC5B;AAAA;AAAA;AAAA,EAKA,WAAW,KAAA,EAA2B;AACpC,IAAA,OAAO,EAAE,OAAO,UAAA,EAAY,IAAA,CAAK,OAAO,MAAA,EAAQ,WAAA,EAAa,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO;AAAA,EACnF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,UAAA,EAAiC;AAC3C,IAAA,OAAO,UAAA,CAAW,QAAQ,IAAA,CAAK,UAAA;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,UAAA,EAA8B;AACrC,IAAA,IAAA,CAAK,QAAQ,UAAU,CAAA;AACvB,IAAA,IAAA,CAAK,aAAa,UAAA,CAAW,KAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,UAAA,EAA8B;AACpC,IAAA,IAAA,CAAK,MAAA,CAAO,SAAS,UAAA,CAAW,UAAA;AAChC,IAAA,IAAA,CAAK,OAAA,CAAQ,SAAS,UAAA,CAAW,WAAA;AACjC,IAAA,IAAA,CAAK,OAAA,CAAQ,QAAQ,UAAA,CAAW,KAAA;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,gBAAA,GAA2B;AAC7B,IAAA,IAAI,IAAA,CAAK,qBAAqB,EAAA,EAAI;AAChC,MAAA,IAAA,CAAK,gBAAA,GAAmB,eAAA;AAAA,QACtB,KAAK,OAAA,CAAQ,MAAA;AAAA,QACb,KAAK,OAAA,CAAQ,KAAA;AAAA,QACb,KAAK,OAAA,CAAQ;AAAA,OACf;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,gBAAA;AAAA,EACd;AAAA,EAEQ,gBAAA,GAAmB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS3B,MAAA,CAAO,IAAA,EAAkB,QAAA,EAAkB,OAAA,EAAwB;AACjE,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,MAAA,IAAU,IAAA,CAAK,QAAQ,UAAA,EAAY;AAClD,MAAA,MAAM,IAAA,CAAK,KAAA;AAAA,QACT,sBAAA;AAAA,QACA,CAAA,sBAAA,EAAyB,IAAA,CAAK,OAAA,CAAQ,UAAU,CAAA,SAAA,CAAA;AAAA,QAChD;AAAA,OACF;AAAA,IACF;AAEA,IAAA,MAAM,EAAE,IAAA,EAAM,MAAA,KAAW,IAAA,CAAK,OAAA,CAAQ,WAAW,QAAQ,CAAA;AACzD,IAAA,IAAA,CAAK,QAAQ,IAAA,CAAK;AAAA,MAChB,IAAA;AAAA,MACA,QAAA;AAAA,MACA,IAAA;AAAA,MACA,MAAA;AAAA,MACA,OAAA,EAAS,OAAA,IAAW,cAAA,CAAe,IAAI;AAAA,KACxC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,QAAA,EAAwB;AAC5B,IAAA,IAAA,CAAK,KAAA,IAAS,CAAA;AACd,IAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,IAAA,CAAK,OAAA,CAAQ,QAAA,EAAU;AACtC,MAAA,MAAM,IAAA,CAAK,KAAA;AAAA,QACT,oBAAA;AAAA,QACA,CAAA,kDAAA,EAAqD,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,CAAA,CAAA;AAAA,QAC1E;AAAA,OACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,KAAA,IAAS,CAAA;AAAA,EAChB;AAAA;AAAA;AAAA,EAKA,KAAA,CAAM,IAAA,EAA2B,OAAA,EAAiB,QAAA,EAAmC;AACnF,IAAA,MAAM,EAAE,IAAA,EAAM,MAAA,KAAW,IAAA,CAAK,OAAA,CAAQ,WAAW,QAAQ,CAAA;AACzD,IAAA,OAAO,IAAI,gBAAgB,IAAA,EAAM,CAAA,EAAG,OAAO,CAAA,OAAA,EAAU,IAAI,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA,CAAA,EAAK;AAAA,MAC9E,QAAA;AAAA,MACA,IAAA;AAAA,MACA,MAAA;AAAA,MACA,OAAA,EAAS,YAAA,CAAa,IAAA,CAAK,OAAA,CAAQ,QAAQ,QAAQ;AAAA,KACpD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAA,CAAK,SAAiB,QAAA,EAAyB;AAC7C,IAAA,MAAM,IAAA,CAAK,KAAA,CAAM,mBAAA,EAAqB,OAAA,EAAS,QAAQ,CAAA;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAA,CAAO,SAAiB,QAAA,EAAyB;AAC/C,IAAA,MAAM,IAAA,CAAK,KAAA;AAAA,MACT,kBAAA;AAAA,MACA,GAAG,OAAO,CAAA,8DAAA,CAAA;AAAA,MACV;AAAA,KACF;AAAA,EACF;AACF,CAAA;AAGA,SAAS,eAAA,CAAgB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAqB;AAC3E,EAAA,KAAA,IAAS,QAAQ,GAAA,GAAM,CAAA,EAAG,KAAA,IAAS,KAAA,EAAO,SAAS,CAAA,EAAG;AACpD,IAAA,IAAI,CAAC,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC3C,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,EAAA;AACT;;;ACrPA,IAAM,QAAA,GAAW,GAAA;AAGjB,IAAM,gBAAA,GAAmB,CAAA;AAGzB,IAAM,gBAAA,GAAmB,CAAA;AAwBlB,SAAS,UAAA,CAAW,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAsB;AAC9E,EAAA,MAAM,SAAkB,EAAC;AAEzB,EAAA,IAAI,SAAA,GAAY,KAAA;AAChB,EAAA,OAAO,YAAY,GAAA,EAAK;AACtB,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,MAAA,EAAQ,SAAA,EAAW,GAAG,CAAA;AAClD,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,MAAA,EAAQ,SAAA,EAAW,OAAO,CAAA;AAEzD,IAAA,IAAI,WAAW,MAAA,EAAW;AACxB,MAAA,SAAA,GAAY,aAAA,CAAc,MAAA,EAAQ,OAAA,EAAS,GAAG,CAAA;AAC9C,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,SAAA,GAAY,aAAA,CAAc,MAAA,EAAQ,OAAA,EAAS,GAAG,CAAA;AACpD,IAAA,MAAM,OAAA,GAAU,iBAAiB,MAAA,EAAQ,SAAA,EAAW,KAAK,MAAA,CAAO,IAAA,EAAM,OAAO,MAAM,CAAA;AAEnF,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,SAAA;AAAA,MACA,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,UAAA,EAAY,gBAAA,CAAiB,MAAA,EAAQ,MAAA,CAAO,WAAW,OAAO;AAAA,KAC/D,CAAA;AAED,IAAA,SAAA,GAAY,OAAA,CAAQ,IAAA;AAAA,EACtB;AAEA,EAAA,OAAO,MAAA;AACT;AAUO,SAAS,eAAA,CACd,MAAA,EACA,KAAA,EACA,GAAA,EACA,KAAA,EACU;AACV,EAAA,MAAM,SAAmB,EAAC;AAE1B,EAAA,KAAA,IAAS,KAAA,GAAQ,OAAO,KAAA,GAAQ,GAAA,IAAO,OAAO,MAAA,GAAS,KAAA,EAAO,SAAS,CAAA,EAAG;AACxE,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,IAAA,KAAS,aAAA,IAAiB,IAAA,KAAS,eAAA,EAAiB;AACtD,MAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACnB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,qBAAA,CAAsB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAqB;AACxF,EAAA,IAAI,KAAA,GAAQ,KAAA;AACZ,EAAA,OAAO,QAAQ,GAAA,IAAO,YAAA,CAAa,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC5D,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;AAGO,SAAS,sBAAA,CAAuB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAqB;AACzF,EAAA,IAAI,KAAA,GAAQ,GAAA;AACZ,EAAA,OAAO,KAAA,GAAQ,SAAS,YAAA,CAAa,MAAA,CAAO,WAAW,KAAA,GAAQ,CAAC,CAAC,CAAA,EAAG;AAClE,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;AASA,SAAS,eAAA,CACP,MAAA,EACA,SAAA,EACA,OAAA,EACyB;AACzB,EAAA,IAAI,KAAA,GAAQ,SAAA;AACZ,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,OAAO,KAAA,GAAQ,OAAA,IAAW,MAAA,IAAU,gBAAA,EAAkB;AACpD,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,MAAA,EAAQ;AACxC,MAAA;AAAA,IACF;AACA,IAAA,MAAA,IAAU,CAAA;AACV,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,IAAI,KAAA,IAAS,OAAA,IAAW,MAAA,GAAS,gBAAA,EAAkB;AACjD,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,EAAA,IAAI,IAAA,KAAS,WAAA,IAAe,IAAA,KAAS,QAAA,EAAU;AAC7C,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,QAAA,GAAW,KAAA;AACjB,EAAA,OAAO,QAAQ,OAAA,IAAW,MAAA,CAAO,UAAA,CAAW,KAAK,MAAM,IAAA,EAAM;AAC3D,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,MAAM,SAAS,KAAA,GAAQ,QAAA;AACvB,EAAA,OAAO,UAAU,gBAAA,GAAmB,EAAE,MAAM,MAAA,EAAQ,SAAA,EAAW,OAAM,GAAI,MAAA;AAC3E;AAGA,SAAS,gBAAA,CACP,MAAA,EACA,SAAA,EACA,GAAA,EACA,MACA,MAAA,EACmC;AACnC,EAAA,IAAI,SAAA,GAAY,SAAA;AAEhB,EAAA,OAAO,YAAY,GAAA,EAAK;AACtB,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,MAAA,EAAQ,SAAA,EAAW,GAAG,CAAA;AAClD,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,MAAA,EAAQ,SAAA,EAAW,OAAO,CAAA;AAEzD,IAAA,IAAI,MAAA,EAAQ,IAAA,KAAS,IAAA,IAAQ,MAAA,CAAO,UAAU,MAAA,EAAQ;AACpD,MAAA,OAAO,EAAE,SAAS,SAAA,EAAW,IAAA,EAAM,cAAc,MAAA,EAAQ,OAAA,EAAS,GAAG,CAAA,EAAE;AAAA,IACzE;AAEA,IAAA,SAAA,GAAY,aAAA,CAAc,MAAA,EAAQ,OAAA,EAAS,GAAG,CAAA;AAAA,EAChD;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,GAAA,EAAK,IAAA,EAAM,GAAA,EAAI;AACnC;AAGA,SAAS,gBAAA,CAAiB,MAAA,EAAgB,IAAA,EAAc,OAAA,EAA0B;AAChF,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,QAAQ,OAAA,IAAW,YAAA,CAAa,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAChE,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,MAAM,SAAA,GAAY,KAAA;AAClB,EAAA,OAAO,QAAQ,OAAA,EAAS;AACtB,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,KAAK,CAAC,CAAA;AAClD,IAAA,IAAI,OAAO,EAAA,IAAS,IAAA,GAAO,MAAQ,IAAA,GAAO,EAAA,IAAS,OAAO,GAAA,EAAM;AAC9D,MAAA;AAAA,IACF;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AAEA,EAAA,MAAM,SAAS,KAAA,GAAQ,SAAA;AACvB,EAAA,IAAI,MAAA,GAAS,CAAA,IAAK,MAAA,GAAS,CAAA,EAAG;AAC5B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IACE,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,SAAS,CAAC,CAAA,KAAM,GAAA,IAC/C,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,SAAA,GAAY,CAAC,CAAC,CAAA,KAAM,GAAA,IACnD,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,SAAA,GAAY,CAAC,CAAC,CAAA,KAAM,GAAA,IACnD,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,SAAA,GAAY,CAAC,CAAC,MAAM,GAAA,EACnD;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,WAAW,CAAA,EAAG;AAChB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,SAAS,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,SAAA,GAAY,CAAC,CAAC,CAAA;AAC5D,EAAA,OAAO,MAAA,KAAW,MAAoB,MAAA,KAAW,EAAA;AACnD;AAGA,SAAS,WAAA,CAAY,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAqB;AACtE,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,GAAQ,OAAO,CAAC,WAAA,CAAY,OAAO,UAAA,CAAW,KAAK,CAAC,CAAA,EAAG;AAC5D,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,aAAA,CAAc,MAAA,EAAgB,OAAA,EAAiB,GAAA,EAAqB;AAC3E,EAAA,IAAI,WAAW,GAAA,EAAK;AAClB,IAAA,OAAO,GAAA;AAAA,EACT;AACA,EAAA,IAAI,QAAQ,OAAA,GAAU,CAAA;AACtB,EAAA,IACE,MAAA,CAAO,UAAA,CAAW,OAAO,CAAA,KAAM,YAAA,IAC/B,KAAA,GAAQ,GAAA,IACR,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA,KAAM,YAAA,EAC7B;AACA,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO,KAAA;AACT;;;ACpMA,IAAM,cAAA,GAAiB,GAAA;AASvB,IAAM,mBAAA,GAAsB,EAAA;AAuCrB,SAAS,WAAA,CAAY,OAAe,OAAA,EAAkC;AAC3E,EAAA,MAAM,QAAA,GAAW,sBAAsB,OAAO,CAAA;AAC9C,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAO,QAAQ,CAAA;AACtC,EAAA,MAAM,WAAW,KAAA,CAAM,KAAA,EAAO,OAAO,KAAA,EAAO,MAAA,CAAO,KAAK,QAAQ,CAAA;AAChE,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,QAAA,EAAU,QAAA,CAAS,MAAM,CAAA;AAErD,EAAA,OAAO,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,KAAA,EAAO,OAAO,GAAG,CAAA;AAC7C;AAgBO,SAAS,cAAA,CAAe,OAAe,OAAA,EAAoC;AAChF,EAAA,MAAM,QAAA,GAAW,sBAAsB,OAAO,CAAA;AAC9C,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAO,QAAQ,CAAA;AAEtC,EAAA,IAAI,QAAA;AACJ,EAAA,IAAI;AACF,IAAA,QAAA,GAAW,MAAM,KAAA,EAAO,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,KAAK,QAAQ,CAAA;AAAA,EAC5D,SAAS,KAAA,EAAO;AACd,IAAA,IAAI,iBAAA,CAAkB,KAAK,CAAA,IAAK,KAAA,CAAM,SAAS,eAAA,EAAiB;AAC9D,MAAA,OAAO,EAAC;AAAA,IACV;AACA,IAAA,MAAM,KAAA;AAAA,EACR;AAEA,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAC,OAAA,KAAY,KAAA,CAAM,MAAM,OAAA,CAAQ,KAAA,EAAO,OAAA,CAAQ,GAAG,CAAC,CAAA;AAC1E;AAQO,SAAS,OAAA,CAAQ,OAAe,OAAA,EAA0D;AAC/F,EAAA,YAAA,CAAa,OAAO,OAAO,CAAA;AAC3B,EAAA,iBAAA,CAAkB,KAAA,EAAO,QAAQ,SAAS,CAAA;AAE1C,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,MAAA,GAAS,CAAA,IAAK,MAAM,UAAA,CAAW,CAAC,CAAA,KAAM,MAAA,GAAS,CAAA,GAAI,CAAA;AAAA,IAChE,KAAK,KAAA,CAAM;AAAA,GACb;AACF;AAeO,SAAS,KAAA,CACd,MAAA,EACA,KAAA,EACA,GAAA,EACA,OAAA,EACW;AACX,EAAA,MAAM,KAAA,GAAQ,mBAAA,CAAoB,MAAA,EAAQ,KAAA,EAAO,KAAK,OAAO,CAAA;AAE7D,EAAA,MAAM,OAAO,eAAA,CAAgB,MAAA,EAAQ,OAAO,QAAA,CAAS,OAAA,EAAS,MAAM,CAAC,CAAA;AACrE,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG;AAC5B,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EACd;AAEA,EAAA,IAAI,CAAC,QAAQ,UAAA,EAAY;AACvB,IAAA,MAAM,IAAA,CAAK,KAAA,IAAS,WAAA,CAAY,MAAA,EAAQ,KAAK,CAAA;AAAA,EAC/C;AAEA,EAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,MAAA,EAAQ,KAAA,EAAO,OAAO,CAAA;AACpD,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,MAAA,GAAS,CAAA,EAAG;AAC7B,IAAA,OAAO,KAAA,CAAM,QAAA;AAAA,EACf;AAEA,EAAA,MAAM,MAAM,KAAA,IAAS,IAAA,CAAK,KAAA,IAAS,WAAA,CAAY,QAAQ,KAAK,CAAA;AAC9D;AAeO,SAAS,mBAAA,CACd,MAAA,EACA,KAAA,EACA,GAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,KAAA,GAAQ,oBAAA,CAAqB,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA;AAErD,EAAA,IAAI,CAAC,QAAQ,OAAA,EAAS;AACpB,IAAA,OAAO,UAAU,MAAA,GAAY,KAAK,CAAC,CAAC,KAAK,CAAC,CAAA;AAAA,EAC5C;AAEA,EAAA,MAAM,SAAsB,EAAC;AAC7B,EAAA,MAAM,SAAsB,EAAC;AAE7B,EAAA,KAAA,MAAW,KAAA,IAAS,UAAA,CAAW,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA,EAAG;AAClD,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,UAAA,GAAa,MAAA,GAAS,MAAA;AAC3C,IAAA,MAAM,SAAS,eAAA,CAAgB,MAAA,EAAQ,MAAM,SAAA,EAAW,KAAA,CAAM,SAAS,cAAc,CAAA;AAErF,IAAA,KAAA,MAAW,UAAU,MAAA,EAAQ;AAC3B,MAAA,MAAA,CAAO,KAAK,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,KAAA,CAAM,SAAS,CAAA;AAAA,IACrD;AAEA,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAEvB,MAAA,MAAM,OAAO,oBAAA,CAAqB,MAAA,EAAQ,KAAA,CAAM,SAAA,EAAW,MAAM,OAAO,CAAA;AACxE,MAAA,IAAI,SAAS,MAAA,EAAW;AACtB,QAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,GAAoB,gBAAgB,MAAA,EAAQ,KAAA,EAAO,KAAK,cAAc,CAAA,CAAE,GAAA,CAAI,CAAC,MAAA,MAAY;AAAA,IAC7F,KAAA,EAAO,MAAA;AAAA,IACP,KAAA,EAAO;AAAA,GACT,CAAE,CAAA;AAEF,EAAA,MAAM,QAAuB,EAAC;AAC9B,EAAA,KAAA,MAAW,IAAA,IAAQ,CAAC,MAAA,EAAQ,MAAA,EAAQ,IAAI,CAAA,EAAG;AACzC,IAAA,IAAI,IAAA,CAAK,SAAS,CAAA,EAAG;AACnB,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB;AAAA,EACF;AAMA,EAAA,IAAI,UAAU,MAAA,IAAa,eAAA,CAAgB,QAAQ,KAAA,CAAM,KAAA,EAAO,GAAG,CAAA,EAAG;AACpE,IAAA,KAAA,CAAM,IAAA,CAAK,CAAC,KAAK,CAAC,CAAA;AAAA,EACpB;AAEA,EAAA,OAAO,KAAA;AACT;AAGA,IAAM,WAAA,GAAc,CAAC,MAAA,EAAQ,OAAA,EAAS,QAAQ,KAAA,EAAO,MAAA,EAAQ,YAAY,WAAW,CAAA;AAGpF,SAAS,eAAA,CAAgB,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAsB;AAC3E,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,IAAI,CAAA;AAEnC,EAAA,IACE,IAAA,KAAS,aAAA,IACT,IAAA,KAAS,eAAA,IACT,SAAS,QAAA,IACT,IAAA,KAAS,OAAA,IACT,IAAA,KAAS,UACT,OAAA,CAAQ,IAAI,CAAA,IACZ,OAAA,CAAQ,IAAI,CAAA,EACZ;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,OAAO,WAAA,CAAY,KAAK,CAAC,IAAA,KAASC,aAAY,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,IAAI,CAAC,CAAA;AACxE;AAGA,SAASA,YAAAA,CAAY,MAAA,EAAgB,IAAA,EAAc,GAAA,EAAa,IAAA,EAAuB;AACrF,EAAA,IAAI,IAAA,GAAO,IAAA,CAAK,MAAA,GAAS,GAAA,EAAK;AAC5B,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,IAAA,CAAK,MAAA,EAAQ,SAAS,CAAA,EAAG;AACnD,IAAA,IAAI,YAAA,CAAa,MAAA,CAAO,UAAA,CAAW,IAAA,GAAO,KAAK,CAAC,CAAA,KAAM,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,EAAG;AAC5E,MAAA,OAAO,KAAA;AAAA,IACT;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAUA,SAAS,eAAA,CACP,MAAA,EACA,KAAA,EACA,OAAA,EAC6D;AAC7D,EAAA,IAAI,UAAA;AACJ,EAAA,IAAI,QAAA,GAAW,CAAA;AAEf,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,WAAsB,EAAC;AAC7B,IAAA,IAAI,OAAA,GAAU,EAAA;AAEd,IAAA,KAAA,MAAW,aAAa,IAAA,EAAM;AAC5B,MAAA,IAAI,SAAA,CAAU,QAAQ,OAAA,EAAS;AAC7B,QAAA;AAAA,MACF;AACA,MAAA,IAAI,YAAY,mBAAA,EAAqB;AACnC,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,OAAA;AACJ,MAAA,IAAI;AACF,QAAA,OAAA,GAAU,YAAA,CAAa,MAAA,EAAQ,SAAA,EAAW,OAAO,CAAA;AAAA,MACnD,SAAS,KAAA,EAAO;AACd,QAAA,IAAI,CAAC,iBAAA,CAAkB,KAAK,CAAA,EAAG;AAI7B,UAAA,MAAM,KAAA;AAAA,QACR;AACA,QAAA,QAAA,IAAY,CAAA;AACZ,QAAA,UAAA,KAAe,KAAA;AAMf,QAAA,OAAA,GAAU,IAAA,CAAK,IAAI,OAAA,EAAS,iBAAA,CAAkB,QAAQ,SAAA,CAAU,KAAA,EAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AACvF,QAAA;AAAA,MACF;AAEA,MAAA,QAAA,CAAS,KAAK,OAAO,CAAA;AACrB,MAAA,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,OAAA,CAAQ,GAAG,CAAA;AAAA,IACzC;AAEA,IAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACvB,MAAA,OAAO,EAAE,QAAA,EAAU,KAAA,EAAO,MAAA,EAAU;AAAA,IACtC;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,QAAA,EAAU,EAAC,EAAG,OAAO,UAAA,EAAW;AAC3C;AAqBA,SAAS,iBAAA,CAAkB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAqB;AAG7E,EAAA,MAAM,OAAiB,EAAC;AAExB,EAAA,KAAA,IAAS,KAAA,GAAQ,KAAA,EAAO,KAAA,GAAQ,GAAA,EAAK,SAAS,CAAA,EAAG;AAC/C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AAEpC,IAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,MAAA,KAAA,IAAS,CAAA;AACT,MAAA,OAAO,QAAQ,GAAA,EAAK;AAClB,QAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACrC,QAAA,IAAI,UAAU,YAAA,EAAc;AAC1B,UAAA,KAAA,IAAS,CAAA;AAAA,QACX,CAAA,MAAA,IAAW,UAAU,IAAA,EAAM;AACzB,UAAA;AAAA,QACF;AACA,QAAA,KAAA,IAAS,CAAA;AAAA,MACX;AACA,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,KAAS,aAAA,IAAiB,IAAA,KAAS,eAAA,EAAiB;AACtD,MAAA,IAAA,CAAK,KAAK,IAAI,CAAA;AACd,MAAA;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,KAAS,cAAA,IAAkB,IAAA,KAAS,gBAAA,EAAkB;AACxD,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,MAAA,GAAS,IAAA,KAAS,cAAA,GAAiB,aAAA,GAAgB,eAAA;AACzD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA;AACrC,IAAA,IAAI,QAAQ,CAAA,EAAG;AAEb,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,MAAA,GAAS,KAAA;AACd,IAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,MAAA,OAAO,KAAA,GAAQ,CAAA;AAAA,IACjB;AAAA,EACF;AAEA,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,YAAA,CAAa,MAAA,EAAgB,SAAA,EAAsB,OAAA,EAAmC;AAC7F,EAAA,MAAM,UAAU,IAAI,OAAA,CAAQ,QAAQ,SAAA,CAAU,KAAA,EAAO,UAAU,KAAK,CAAA;AACpE,EAAA,MAAM,OAAA,GAAU,IAAI,aAAA,CAAc,OAAA,EAAS,OAAO,CAAA;AAElD,EAAA,aAAA,CAAc,OAAO,CAAA;AAErB,EAAA,MAAM,MAAM,OAAA,CAAQ,KAAA;AACpB,EAAA,MAAM,EAAE,SAAQ,GAAI,OAAA;AAEpB,EAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAIxB,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,SAAA,CAAU,OAAO,GAAG,CAAA;AAC/C,IAAA,MAAMC,OAAAA,GAAS,SAAS,KAAK,CAAA;AAC7B,IAAA,IAAIA,YAAW,MAAA,EAAW;AACxB,MAAA,OAAO,EAAE,KAAA,EAAO,SAAA,CAAU,KAAA,EAAO,GAAA,EAAK,MAAM,KAAA,EAAO,KAAA,EAAOA,OAAAA,CAAO,KAAA,EAAO,OAAA,EAAQ;AAAA,IAClF;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,GAAO,QAAQ,MAAA,EAAO;AAC5B,EAAA,MAAM,MAAA,GAAS,SAAS,IAAI,CAAA;AAC5B,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,MAAM,WAAA;AAAA,MACJ,mBAAA;AAAA,MACA,0IAAA;AAAA,MAEA,MAAA;AAAA,MACA,SAAA,CAAU;AAAA,KACZ;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,OAAO,SAAA,CAAU,KAAA,EAAO,KAAK,IAAA,EAAM,KAAA,EAAO,MAAA,CAAO,KAAA,EAAO,OAAA,EAAQ;AAC3E;AASO,SAAS,YAAA,CAAa,UAA8B,MAAA,EAAiC;AAC1F,EAAA,MAAM,KAAA,GAAQ,SAAS,CAAC,CAAA;AACxB,EAAA,IAAI,UAAU,MAAA,EAAW;AACvB,IAAA,MAAM,IAAI,MAAM,4CAA4C,CAAA;AAAA,EAC9D;AAEA,EAAA,IAAI,WAAW,OAAA,EAAS;AACtB,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,IAAA,OAAO,QAAA,CAAS,QAAA,CAAS,MAAA,GAAS,CAAC,CAAA;AAAA,EACrC;AAEA,EAAA,IAAI,IAAA,GAAO,KAAA;AACX,EAAA,KAAA,IAAS,QAAQ,CAAA,EAAG,KAAA,GAAQ,QAAA,CAAS,MAAA,EAAQ,SAAS,CAAA,EAAG;AACvD,IAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,IAAA,IAAI,MAAA,KAAW,YAAY,QAAA,CAAS,OAAA,EAAS,IAAI,CAAA,GAAI,QAAA,CAAS,OAAA,EAAS,IAAI,CAAA,EAAG;AAC5E,MAAA,IAAA,GAAO,OAAA;AAAA,IACT;AAAA,EACF;AAEA,EAAA,OAAO,IAAA;AACT;AAWA,SAAS,QAAA,CAAS,SAAkB,IAAA,EAAwB;AAC1D,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,GAAA,GAAM,OAAA,CAAQ,KAAA;AACnC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,GAAM,IAAA,CAAK,KAAA;AACjC,EAAA,IAAI,SAAS,QAAA,EAAU;AACrB,IAAA,OAAO,IAAA,GAAO,QAAA;AAAA,EAChB;AACA,EAAA,OAAO,OAAA,CAAQ,OAAA,CAAQ,MAAA,GAAS,IAAA,CAAK,OAAA,CAAQ,MAAA;AAC/C;AAGA,SAAS,QAAA,CAAS,SAAkB,IAAA,EAAwB;AAC1D,EAAA,OAAO,QAAQ,GAAA,GAAM,OAAA,CAAQ,KAAA,GAAQ,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA;AACvD;AAGA,SAAS,oBAAA,CAAqB,MAAA,EAAgB,KAAA,EAAe,GAAA,EAAoC;AAC/F,EAAA,MAAM,IAAA,GAAO,qBAAA,CAAsB,MAAA,EAAQ,KAAA,EAAO,GAAG,CAAA;AACrD,EAAA,MAAM,EAAA,GAAK,sBAAA,CAAuB,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA;AAEnD,EAAA,OAAO,OAAO,EAAA,GAAK,EAAE,OAAO,IAAA,EAAM,KAAA,EAAO,KAAI,GAAI,MAAA;AACnD;AAGA,SAAS,SAAS,IAAA,EAA8C;AAC9D,EAAA,IAAI;AACF,IAAA,OAAO,EAAE,KAAA,EAAO,eAAA,CAAgB,IAAI,CAAA,EAAE;AAAA,EACxC,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,MAAA;AAAA,EACT;AACF;AAGA,SAAS,WAAA,CAAY,QAAgB,QAAA,EAAmC;AACtE,EAAA,OAAO,WAAA,CAAY,eAAA,EAAiB,uCAAA,EAAyC,MAAA,EAAQ,QAAQ,CAAA;AAC/F;;;ACleO,SAAS,UAAA,CAAW,OAAe,OAAA,EAAgD;AACxF,EAAA,MAAM,QAAA,GAAW,eAAe,OAAO,CAAA;AACvC,EAAA,MAAM,OAAA,GAAU,cAAA,CAAe,KAAA,EAAO,QAAQ,CAAA;AAE9C,EAAA,IAAI,CAAC,SAAS,cAAA,EAAgB;AAC5B,IAAA,OAAO,OAAA,CAAQ,IAAA;AAAA,EACjB;AAEA,EAAA,OAAO,EAAE,MAAM,OAAA,CAAQ,IAAA,EAAM,SAAS,OAAA,CAAQ,OAAA,EAAS,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAQ;AAClF;AASO,SAAS,cAAA,CAAe,OAAe,OAAA,EAAyC;AACrF,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,KAAA,EAAO,OAAO,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,WAAA,CAAY,KAAA,EAAO,MAAA,CAAO,OAAO,OAAO,CAAA;AACrD,EAAA,IAAI,SAAS,MAAA,EAAW;AACtB,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,WAAW,KAAA,CAAM,KAAA,EAAO,OAAO,KAAA,EAAO,MAAA,CAAO,KAAK,OAAO,CAAA;AAC/D,EAAA,MAAM,MAAA,GAAS,YAAA,CAAa,QAAA,EAAU,MAAM,CAAA;AAE5C,EAAA,MAAM,OAAA,GAAU,cAAA,CAAe,KAAA,EAAO,MAAA,EAAQ,MAAM,CAAA;AACpD,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,OAAA,CAAQ,UAAA,EAAY;AACvC,IAAA,MAAM,WAAA;AAAA,MACJ,sBAAA;AAAA,MACA,CAAA,8BAAA,EAAiC,OAAA,CAAQ,MAAM,CAAA,uCAAA,EAA0C,QAAQ,UAAU,CAAA,CAAA,CAAA;AAAA,MAC3G,KAAA;AAAA,MACA,MAAA,CAAO;AAAA,KACT;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,MAAM,MAAA,CAAO,IAAA;AAAA,IACb,OAAA,EAAS,OAAO,IAAA,KAAS,KAAA;AAAA,IACzB,OAAA;AAAA,IACA,OAAO,MAAA,CAAO;AAAA,GAChB;AACF;AAeA,SAAS,WAAA,CACP,KAAA,EACA,WAAA,EACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,OAAO,WAAA,GAAc,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,WAAW,CAAA,GAAI,KAAA;AAE1D,EAAA,IAAI,KAAA;AACJ,EAAA,IAAI;AACF,IAAA,KAAA,GAAQ,gBAAgB,IAAI,CAAA;AAAA,EAC9B,CAAA,CAAA,MAAQ;AAIN,IAAA,OAAO,MAAA;AAAA,EACT;AAIA,EAAA,qBAAA,CAAsB,KAAA,EAAO,WAAA,EAAa,KAAA,CAAM,MAAA,EAAQ,QAAQ,QAAQ,CAAA;AAExE,EAAA,MAAM,OAAA,GACJ,WAAA,GAAc,CAAA,GAAI,CAAC,SAAA,CAAU,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG,yBAAA,EAA2B,CAAC,CAAC,IAAI,EAAC;AAErF,EAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,OAAA,CAAQ,UAAA,EAAY;AACvC,IAAA,MAAM,WAAA;AAAA,MACJ,sBAAA;AAAA,MACA,CAAA,oDAAA,EAAuD,QAAQ,UAAU,CAAA,SAAA,CAAA;AAAA,MACzE,KAAA;AAAA,MACA;AAAA,KACF;AAAA,EACF;AAEA,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,SAAS,WAAA,GAAc,CAAA,EAAG,SAAS,KAAA,EAAM;AAChE;AASA,SAAS,cAAA,CACP,KAAA,EACA,MAAA,EACA,MAAA,EACmB;AACnB,EAAA,MAAM,OAAA,GAAU,IAAI,OAAA,CAAQ,KAAK,CAAA;AACjC,EAAA,MAAM,UAA6B,EAAC;AAEpC,EAAA,IAAI,MAAA,CAAO,QAAQ,CAAA,EAAG;AACpB,IAAA,OAAA,CAAQ,IAAA,CAAK,SAAA,CAAU,OAAA,EAAS,yBAAA,EAA2B,CAAC,CAAC,CAAA;AAAA,EAC/D;AAEA,EAAA,MAAM,SAAS,WAAA,CAAY,KAAA,EAAO,MAAA,CAAO,KAAA,EAAO,OAAO,KAAK,CAAA;AAC5D,EAAA,IAAI,WAAW,SAAA,EAAW;AACxB,IAAA,OAAA,CAAQ,KAAK,SAAA,CAAU,OAAA,EAAS,gBAAA,EAAkB,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACjE,CAAA,MAAA,IAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,OAAA,CAAQ,KAAK,SAAA,CAAU,OAAA,EAAS,uBAAA,EAAyB,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACxE;AAEA,EAAA,KAAA,MAAW,MAAA,IAAU,OAAO,OAAA,EAAS;AACnC,IAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AAAA,EACrB;AAEA,EAAA,MAAM,QAAQ,WAAA,CAAY,KAAA,EAAO,MAAA,CAAO,GAAA,EAAK,OAAO,GAAG,CAAA;AACvD,EAAA,IAAI,UAAU,SAAA,EAAW;AACvB,IAAA,OAAA,CAAQ,KAAK,SAAA,CAAU,OAAA,EAAS,0BAAA,EAA4B,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,EACzE,CAAA,MAAA,IAAW,UAAU,QAAA,EAAU;AAC7B,IAAA,OAAA,CAAQ,KAAK,SAAA,CAAU,OAAA,EAAS,uBAAA,EAAyB,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,EACtE;AAEA,EAAA,OAAO,OAAA;AACT;AAUA,SAAS,WAAA,CACP,MAAA,EACA,IAAA,EACA,EAAA,EAC+C;AAC/C,EAAA,IAAI,QAAQ,EAAA,EAAI;AACd,IAAA,OAAO,OAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAA,GAAS,KAAA;AACb,EAAA,KAAA,IAAS,KAAA,GAAQ,IAAA,EAAM,KAAA,GAAQ,EAAA,EAAI,SAAS,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,UAAA,CAAW,KAAK,CAAA;AACpC,IAAA,IAAI,CAAC,YAAA,CAAa,IAAI,CAAA,EAAG;AACvB,MAAA,OAAO,SAAA;AAAA,IACT;AACA,IAAA,IAAI,CAAC,gBAAA,CAAiB,IAAI,CAAA,EAAG;AAC3B,MAAA,MAAA,GAAS,IAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,OAAO,SAAS,QAAA,GAAW,YAAA;AAC7B;AAGA,SAAS,SAAA,CAAU,OAAA,EAAkB,IAAA,EAAkB,QAAA,EAAmC;AACxF,EAAA,MAAM,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,OAAA,CAAQ,WAAW,QAAQ,CAAA;AACpD,EAAA,OAAO,EAAE,MAAM,QAAA,EAAU,IAAA,EAAM,QAAQ,OAAA,EAAS,cAAA,CAAe,IAAI,CAAA,EAAE;AACvE;;;ACjMO,SAAS,SAAA,CAAuB,OAAe,OAAA,EAA4B;AAChF,EAAA,OAAO,cAAA,CAAe,KAAA,EAAO,cAAA,CAAe,OAAO,CAAC,CAAA,CAAE,KAAA;AACxD","file":"index.js","sourcesContent":["/**\n * Character-code constants and predicates shared by the scanner, the parser and\n * the repair rules.\n *\n * Everything here works on UTF-16 code units via `charCodeAt`. The package uses\n * no regular expressions at all — a deliberate choice, since a repair engine\n * fed adversarial input is exactly where catastrophic backtracking bites. Every\n * predicate below is a constant-time comparison, which keeps the whole pipeline\n * linear in the length of the input.\n */\n\n/* ── Structural characters ──────────────────────────────────────────────── */\n\nexport const CH_OPEN_BRACE = 0x7b; /* { */\nexport const CH_CLOSE_BRACE = 0x7d; /* } */\nexport const CH_OPEN_BRACKET = 0x5b; /* [ */\nexport const CH_CLOSE_BRACKET = 0x5d; /* ] */\nexport const CH_COLON = 0x3a; /* : */\nexport const CH_COMMA = 0x2c; /* , */\n\n/* ── Quotes ─────────────────────────────────────────────────────────────── */\n\nexport const CH_DOUBLE_QUOTE = 0x22; /* \" */\nexport const CH_SINGLE_QUOTE = 0x27; /* ' */\nexport const CH_BACKTICK = 0x60; /* ` */\nexport const CH_LEFT_SINGLE_QUOTE = 0x2018; /* ‘ */\nexport const CH_RIGHT_SINGLE_QUOTE = 0x2019; /* ’ */\nexport const CH_SINGLE_LOW_QUOTE = 0x201a; /* ‚ */\nexport const CH_SINGLE_HIGH_REVERSED = 0x201b; /* ‛ */\nexport const CH_LEFT_DOUBLE_QUOTE = 0x201c; /* “ */\nexport const CH_RIGHT_DOUBLE_QUOTE = 0x201d; /* ” */\nexport const CH_DOUBLE_LOW_QUOTE = 0x201e; /* „ */\nexport const CH_DOUBLE_HIGH_REVERSED = 0x201f; /* ‟ */\n\n/* ── Escapes, comments, signs ───────────────────────────────────────────── */\n\nexport const CH_BACKSLASH = 0x5c; /* \\ */\nexport const CH_SLASH = 0x2f; /* / */\nexport const CH_ASTERISK = 0x2a; /* * */\nexport const CH_HASH = 0x23; /* # */\nexport const CH_MINUS = 0x2d; /* - */\nexport const CH_PLUS = 0x2b; /* + */\nexport const CH_DOT = 0x2e; /* . */\nexport const CH_UNDERSCORE = 0x5f; /* _ */\nexport const CH_DOLLAR = 0x24; /* $ */\n\n/* ── Whitespace and line breaks ─────────────────────────────────────────── */\n\nexport const CH_TAB = 0x09;\nexport const CH_LINE_FEED = 0x0a;\nexport const CH_VERTICAL_TAB = 0x0b;\nexport const CH_FORM_FEED = 0x0c;\nexport const CH_CARRIAGE_RETURN = 0x0d;\nexport const CH_SPACE = 0x20;\nexport const CH_NBSP = 0x00a0;\nexport const CH_BOM = 0xfeff;\n\n/* ── Letters used by literal and escape handling ────────────────────────── */\n\nexport const CH_LOWER_A = 0x61;\nexport const CH_LOWER_B = 0x62;\nexport const CH_LOWER_E = 0x65;\nexport const CH_LOWER_F = 0x66;\nexport const CH_LOWER_N = 0x6e;\nexport const CH_LOWER_R = 0x72;\nexport const CH_LOWER_T = 0x74;\nexport const CH_LOWER_U = 0x75;\nexport const CH_LOWER_X = 0x78;\nexport const CH_LOWER_Z = 0x7a;\nexport const CH_UPPER_A = 0x41;\nexport const CH_UPPER_E = 0x45;\nexport const CH_UPPER_F = 0x46;\nexport const CH_UPPER_X = 0x58;\nexport const CH_UPPER_Z = 0x5a;\nexport const CH_ZERO = 0x30;\nexport const CH_NINE = 0x39;\n\n/* ── Surrogates ─────────────────────────────────────────────────────────── */\n\nexport const CH_HIGH_SURROGATE_START = 0xd800;\nexport const CH_HIGH_SURROGATE_END = 0xdbff;\nexport const CH_LOW_SURROGATE_START = 0xdc00;\nexport const CH_LOW_SURROGATE_END = 0xdfff;\n\n/** Sentinel returned by the scanner past the end of its bounded region. */\nexport const CH_EOF = -1;\n\n/* ── Predicates ─────────────────────────────────────────────────────────── */\n\n/**\n * Whitespace recognised *between* tokens.\n *\n * Wider than the four characters JSON allows, because malformed input pasted\n * from a browser, a PDF or a word processor routinely carries non-breaking\n * spaces and Unicode separators. They are treated as trivia and dropped, never\n * as data — inside a string literal these characters remain untouched content.\n */\nexport function isWhitespace(code: number): boolean {\n switch (code) {\n case CH_SPACE:\n case CH_TAB:\n case CH_LINE_FEED:\n case CH_CARRIAGE_RETURN:\n case CH_VERTICAL_TAB:\n case CH_FORM_FEED:\n case CH_NBSP:\n case CH_BOM:\n case 0x1680: /* OGHAM SPACE MARK */\n case 0x2028: /* LINE SEPARATOR */\n case 0x2029: /* PARAGRAPH SEPARATOR */\n case 0x202f: /* NARROW NO-BREAK SPACE */\n case 0x205f: /* MEDIUM MATHEMATICAL SPACE */\n case 0x3000 /* IDEOGRAPHIC SPACE */:\n return true;\n default:\n // U+2000..U+200A: EN QUAD through HAIR SPACE.\n return code >= 0x2000 && code <= 0x200a;\n }\n}\n\n/**\n * The four characters JSON itself allows between tokens.\n *\n * Anything {@link isWhitespace} accepts beyond these is a repair, not trivia, so\n * skipping it has to be recorded in the repair log.\n */\nexport function isJsonWhitespace(code: number): boolean {\n return (\n code === CH_SPACE || code === CH_TAB || code === CH_LINE_FEED || code === CH_CARRIAGE_RETURN\n );\n}\n\n/** Reports whether `code` ends a line for the purpose of line/column reporting. */\nexport function isLineBreak(code: number): boolean {\n return code === CH_LINE_FEED || code === CH_CARRIAGE_RETURN;\n}\n\n/** Reports whether `code` is an ASCII decimal digit. */\nexport function isDigit(code: number): boolean {\n return code >= CH_ZERO && code <= CH_NINE;\n}\n\n/** Reports whether `code` is a hexadecimal digit in either case. */\nexport function isHexDigit(code: number): boolean {\n return (\n (code >= CH_ZERO && code <= CH_NINE) ||\n (code >= CH_UPPER_A && code <= CH_UPPER_F) ||\n (code >= CH_LOWER_A && code <= CH_LOWER_F)\n );\n}\n\n/**\n * Reports whether `code` opens a string literal in some dialect.\n *\n * Covers the JSON `\"`, the JavaScript `'` and `` ` ``, and the typographic\n * quotes U+2018..U+201F that word processors and LLM prose substitute. The\n * table is deliberately closed: guillemets (`«` `»`) and CJK brackets are *not*\n * included, because they appear far more often as ordinary prose punctuation\n * than as string delimiters.\n */\nexport function isQuote(code: number): boolean {\n switch (code) {\n case CH_DOUBLE_QUOTE:\n case CH_SINGLE_QUOTE:\n case CH_BACKTICK:\n case CH_LEFT_SINGLE_QUOTE:\n case CH_RIGHT_SINGLE_QUOTE:\n case CH_SINGLE_LOW_QUOTE:\n case CH_SINGLE_HIGH_REVERSED:\n case CH_LEFT_DOUBLE_QUOTE:\n case CH_RIGHT_DOUBLE_QUOTE:\n case CH_DOUBLE_LOW_QUOTE:\n case CH_DOUBLE_HIGH_REVERSED:\n return true;\n default:\n return false;\n }\n}\n\n/**\n * Returns the set of code units that can close a string opened by `code`.\n *\n * Typographic quotes are paired, so a string opened with `“` closes on `”` —\n * but LLM output mixes them freely, so the opening character is accepted as a\n * closer too. Returns `-1` for the second slot when there is only one closer.\n */\nexport function closersFor(code: number): readonly [number, number] {\n switch (code) {\n case CH_LEFT_DOUBLE_QUOTE:\n case CH_DOUBLE_LOW_QUOTE:\n case CH_DOUBLE_HIGH_REVERSED:\n return [CH_RIGHT_DOUBLE_QUOTE, code];\n case CH_RIGHT_DOUBLE_QUOTE:\n return [CH_RIGHT_DOUBLE_QUOTE, CH_LEFT_DOUBLE_QUOTE];\n case CH_LEFT_SINGLE_QUOTE:\n case CH_SINGLE_LOW_QUOTE:\n case CH_SINGLE_HIGH_REVERSED:\n return [CH_RIGHT_SINGLE_QUOTE, code];\n case CH_RIGHT_SINGLE_QUOTE:\n return [CH_RIGHT_SINGLE_QUOTE, CH_LEFT_SINGLE_QUOTE];\n default:\n return [code, -1];\n }\n}\n\n/**\n * Reports whether a string opened by `code` follows JSON escaping rules.\n *\n * Only `\"` does. Inside `'`, `` ` `` or typographic quotes an apostrophe is far\n * more likely to be prose than a delimiter, which is why the continuation probe\n * treats those delimiters more permissively.\n */\nexport function isStandardQuote(code: number): boolean {\n return code === CH_DOUBLE_QUOTE;\n}\n\n/**\n * Reports whether `code` may start a bare (unquoted) object key or literal.\n *\n * Matches the JavaScript identifier convention restricted to ASCII letters plus\n * `_` and `$`, and additionally admits any code unit at or above U+00C0 so that\n * non-English keys (`{café: 1}`, `{名前: 1}`) are recognised. Digits are handled\n * by {@link isIdentifierPart} only, so `{2fast: 1}` is not mistaken for a key.\n */\nexport function isIdentifierStart(code: number): boolean {\n return (\n (code >= CH_LOWER_A && code <= CH_LOWER_Z) ||\n (code >= CH_UPPER_A && code <= CH_UPPER_Z) ||\n code === CH_UNDERSCORE ||\n code === CH_DOLLAR ||\n code >= 0x00c0\n );\n}\n\n/** Reports whether `code` may continue a bare object key or literal. */\nexport function isIdentifierPart(code: number): boolean {\n return isIdentifierStart(code) || isDigit(code) || code === CH_MINUS || code === CH_DOT;\n}\n\n/**\n * Reports whether `code` terminates an unquoted value in aggressive mode.\n *\n * Bare values run until a structural character, so `{a: hello world}` yields the\n * single value `\"hello world\"` rather than two tokens.\n */\nexport function isStructural(code: number): boolean {\n switch (code) {\n case CH_OPEN_BRACE:\n case CH_CLOSE_BRACE:\n case CH_OPEN_BRACKET:\n case CH_CLOSE_BRACKET:\n case CH_COLON:\n case CH_COMMA:\n case CH_EOF:\n return true;\n default:\n return false;\n }\n}\n\n/** Reports whether `code` is the high half of a surrogate pair. */\nexport function isHighSurrogate(code: number): boolean {\n return code >= CH_HIGH_SURROGATE_START && code <= CH_HIGH_SURROGATE_END;\n}\n\n/** Reports whether `code` is the low half of a surrogate pair. */\nexport function isLowSurrogate(code: number): boolean {\n return code >= CH_LOW_SURROGATE_START && code <= CH_LOW_SURROGATE_END;\n}\n\n/**\n * Lower-cases an ASCII letter code unit; returns other codes unchanged.\n *\n * Used for case-insensitive literal matching (`TRUE`, `Null`) without building\n * substrings or touching locale-sensitive `toLowerCase`, which would break the\n * determinism requirement under a Turkish locale.\n */\nexport function toLowerAscii(code: number): number {\n return code >= CH_UPPER_A && code <= CH_UPPER_Z ? code + 0x20 : code;\n}\n","import { CH_CARRIAGE_RETURN, CH_EOF, CH_LINE_FEED } from './tokens.js';\n\n/** A one-based line/column pair, resolved against the original input. */\nexport interface SourcePosition {\n line: number;\n column: number;\n}\n\n/**\n * A cursor over a bounded region of the original input.\n *\n * Extraction never copies: it narrows {@link Scanner.start} and leaves\n * {@link Scanner.source} pointing at the caller's original string. Every offset\n * the engine reports is therefore already absolute, so repair positions stay\n * meaningful even when the JSON was buried in prose.\n *\n * Line and column numbers are derived from an index of line starts that is\n * built on first use. Malformed input that produces no diagnostics never pays\n * for it.\n */\nexport class Scanner {\n /** The original, uncut input. */\n readonly source: string;\n\n /** First offset of the region being parsed. */\n readonly start: number;\n\n /** Offset one past the last character of the region. */\n readonly end: number;\n\n /** Current offset. Always within `[start, end]`. */\n index: number;\n\n /** Offsets at which each line begins; built lazily by {@link positionAt}. */\n private lineStarts: number[] | undefined;\n\n constructor(source: string, start = 0, end = source.length) {\n this.source = source;\n this.start = start;\n this.end = end;\n this.index = start;\n }\n\n /** Reports whether the cursor has reached the end of the region. */\n eof(): boolean {\n return this.index >= this.end;\n }\n\n /** Returns the code unit at the cursor, or {@link CH_EOF} at the end. */\n peek(): number {\n return this.index < this.end ? this.source.charCodeAt(this.index) : CH_EOF;\n }\n\n /** Returns the text between two absolute offsets. */\n slice(from: number, to: number): string {\n return this.source.slice(from, to);\n }\n\n /**\n * Resolves an absolute offset to a one-based line and column.\n *\n * `\\n`, `\\r\\n` and a lone `\\r` all end a line. U+2028 and U+2029 do not:\n * JSON treats them as ordinary string content, and counting them would make\n * positions disagree with what an editor shows.\n */\n positionAt(offset: number): SourcePosition {\n const starts = this.lineStarts ?? (this.lineStarts = buildLineStarts(this.source));\n\n // Binary search for the last line start at or before `offset`.\n let low = 0;\n let high = starts.length - 1;\n while (low < high) {\n const mid = (low + high + 1) >>> 1;\n if (starts[mid]! <= offset) {\n low = mid;\n } else {\n high = mid - 1;\n }\n }\n\n return { line: low + 1, column: offset - starts[low]! + 1 };\n }\n}\n\n/** Computes the offset at which each line of `source` begins. */\nfunction buildLineStarts(source: string): number[] {\n const starts: number[] = [0];\n const length = source.length;\n\n for (let index = 0; index < length; index += 1) {\n const code = source.charCodeAt(index);\n if (code === CH_CARRIAGE_RETURN) {\n // Treat CRLF as a single break so a column is never counted twice.\n if (index + 1 < length && source.charCodeAt(index + 1) === CH_LINE_FEED) {\n index += 1;\n }\n starts.push(index + 1);\n } else if (code === CH_LINE_FEED) {\n starts.push(index + 1);\n }\n }\n\n return starts;\n}\n","import { Scanner } from '../scanner/scanner.js';\nimport type { JsonRepairErrorCode } from '../types.js';\n\n/**\n * Brand used to identify errors from this package across module realms.\n *\n * A dual ESM/CJS package can be loaded twice in the same process (once through\n * `import`, once through `require`), which gives two distinct class objects and\n * makes `instanceof` unreliable. `Symbol.for` uses the cross-realm global\n * registry, so the brand stays identical for every copy.\n */\nconst ERROR_BRAND: unique symbol = Symbol.for('json-repair.error') as never;\n\n/** Number of characters of context shown on either side of the failure point. */\nconst SNIPPET_RADIUS = 24;\n\n/** Extra fields accepted when constructing a {@link JsonRepairError}. */\nexport interface JsonRepairErrorDetails {\n /** Zero-based offset into the original input, in UTF-16 code units. */\n position?: number;\n /** One-based line number in the original input. */\n line?: number;\n /** One-based column number in the original input. */\n column?: number;\n /** A short excerpt of the input around {@link JsonRepairErrorDetails.position}. */\n snippet?: string;\n}\n\n/**\n * The only error type thrown by this package.\n *\n * Every failure carries a stable {@link JsonRepairError.code} so callers can\n * branch on the reason without matching on message text, which is not part of\n * the public contract and may be reworded in any release.\n *\n * @example\n * ```ts\n * import { repairJson, isJsonRepairError } from '@nexkit/json-repair';\n *\n * try {\n * repairJson(input);\n * } catch (error) {\n * if (isJsonRepairError(error) && error.code === 'AMBIGUOUS_REPAIR') {\n * return repairJson(input, { mode: 'aggressive' });\n * }\n * throw error;\n * }\n * ```\n */\nexport class JsonRepairError extends Error {\n /** Always `'JsonRepairError'`, so the name survives minification. */\n override readonly name = 'JsonRepairError';\n\n /** Stable, machine-readable failure reason. */\n readonly code: JsonRepairErrorCode;\n\n /** Zero-based offset into the original input, in UTF-16 code units. */\n readonly position: number | undefined;\n\n /** One-based line number in the original input. */\n readonly line: number | undefined;\n\n /** One-based column number in the original input. */\n readonly column: number | undefined;\n\n /** A short excerpt of the input around {@link JsonRepairError.position}. */\n readonly snippet: string | undefined;\n\n /** Cross-realm brand; see {@link isJsonRepairError}. */\n readonly [ERROR_BRAND] = true;\n\n constructor(code: JsonRepairErrorCode, message: string, details: JsonRepairErrorDetails = {}) {\n super(message);\n this.code = code;\n this.position = details.position;\n this.line = details.line;\n this.column = details.column;\n this.snippet = details.snippet;\n\n // Restores the prototype chain when the package is consumed as downlevelled\n // ES5, where `super()` would otherwise return a plain Error.\n Object.setPrototypeOf(this, new.target.prototype);\n }\n\n /**\n * Reports whether a value is a {@link JsonRepairError}, including instances\n * created by a different copy of this package.\n *\n * Prefer this over `instanceof` — see {@link ERROR_BRAND}.\n */\n static isJsonRepairError(value: unknown): value is JsonRepairError {\n return (\n typeof value === 'object' &&\n value !== null &&\n (value as Record<PropertyKey, unknown>)[ERROR_BRAND] === true\n );\n }\n}\n\n/**\n * Reports whether a value is a {@link JsonRepairError}, including instances\n * created by a different copy of this package (dual ESM/CJS loading).\n */\nexport function isJsonRepairError(value: unknown): value is JsonRepairError {\n return JsonRepairError.isJsonRepairError(value);\n}\n\n/**\n * Builds a fully located error from a raw source string.\n *\n * Callers that hold a {@link Scanner} already have a line index and should use\n * it. This helper exists for the stages that run outside the parser — limit\n * checks and the orchestration layer — so that every error the package throws\n * carries the same position, line, column and snippet fields.\n */\nexport function createError(\n code: JsonRepairErrorCode,\n message: string,\n source: string,\n position: number,\n): JsonRepairError {\n const clamped = position < 0 ? 0 : position > source.length ? source.length : position;\n const { line, column } = new Scanner(source).positionAt(clamped);\n\n return new JsonRepairError(code, message, {\n position: clamped,\n line,\n column,\n snippet: buildSnippet(source, clamped),\n });\n}\n\n/**\n * Builds a single-line excerpt of `source` around `position`, with control\n * characters escaped and ellipses marking truncation.\n */\nexport function buildSnippet(source: string, position: number): string {\n const clamped = position < 0 ? 0 : position > source.length ? source.length : position;\n const start = clamped - SNIPPET_RADIUS < 0 ? 0 : clamped - SNIPPET_RADIUS;\n const end = clamped + SNIPPET_RADIUS > source.length ? source.length : clamped + SNIPPET_RADIUS;\n\n let excerpt = '';\n for (let index = start; index < end; index += 1) {\n excerpt += escapeForDisplay(source.charCodeAt(index));\n }\n\n return `${start > 0 ? '…' : ''}${excerpt}${end < source.length ? '…' : ''}`;\n}\n\n/** Renders one code unit safely for a single-line diagnostic message. */\nfunction escapeForDisplay(code: number): string {\n switch (code) {\n case 0x08:\n return '\\\\b';\n case 0x09:\n return '\\\\t';\n case 0x0a:\n return '\\\\n';\n case 0x0c:\n return '\\\\f';\n case 0x0d:\n return '\\\\r';\n default:\n break;\n }\n if (code < 0x20 || code === 0x7f) {\n return `\\\\u${code.toString(16).padStart(4, '0')}`;\n }\n return String.fromCharCode(code);\n}\n","import { createError, JsonRepairError } from './errors/JsonRepairError.js';\nimport {\n CH_BACKSLASH,\n CH_CLOSE_BRACE,\n CH_CLOSE_BRACKET,\n CH_DOUBLE_QUOTE,\n CH_OPEN_BRACE,\n CH_OPEN_BRACKET,\n} from './scanner/tokens.js';\n\n/**\n * Rejects an input that is not a string.\n *\n * This runs before anything touches the value, so a caller who accidentally\n * passes an already-parsed object or a `Buffer` gets a named error rather than\n * a confusing failure deep inside the scanner.\n *\n * @throws {JsonRepairError} `INVALID_INPUT`\n */\nexport function assertString(input: unknown, parameter: string): asserts input is string {\n if (typeof input !== 'string') {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Parameter \"${parameter}\" must be a string, received ${input === null ? 'null' : typeof input}.`,\n );\n }\n}\n\n/**\n * Rejects an input longer than the configured budget.\n *\n * The check happens before any scanning, so an oversized payload costs one\n * property read rather than a full pass.\n *\n * @throws {JsonRepairError} `MAX_LENGTH_EXCEEDED`\n */\nexport function assertInputLength(input: string, maxLength: number): void {\n if (input.length > maxLength) {\n throw new JsonRepairError(\n 'MAX_LENGTH_EXCEEDED',\n `Input is ${input.length} characters, which exceeds the maximum of ${maxLength}.`,\n { position: maxLength },\n );\n }\n}\n\n/**\n * Enforces `maxDepth` on text that `JSON.parse` has already accepted.\n *\n * The repairing parser tracks depth as it descends, but the fast path never\n * enters the parser, so valid input needs its own check or `maxDepth` would be\n * silently unenforced for exactly the documents most likely to be deep.\n *\n * Because the text is known-valid JSON, string boundaries are unambiguous: a\n * quote is either the delimiter or escaped, with no repair cases to consider.\n * That makes a single linear pass exact.\n *\n * @throws {JsonRepairError} `MAX_DEPTH_EXCEEDED`\n */\nexport function assertStructuralDepth(\n source: string,\n start: number,\n end: number,\n maxDepth: number,\n): void {\n let depth = 0;\n let index = start;\n\n while (index < end) {\n const code = source.charCodeAt(index);\n\n if (code === CH_DOUBLE_QUOTE) {\n index = skipValidString(source, index + 1, end);\n continue;\n }\n\n if (code === CH_OPEN_BRACE || code === CH_OPEN_BRACKET) {\n depth += 1;\n if (depth > maxDepth) {\n throw createError(\n 'MAX_DEPTH_EXCEEDED',\n `Nesting depth exceeds the maximum of ${maxDepth}.`,\n source,\n index,\n );\n }\n } else if (code === CH_CLOSE_BRACE || code === CH_CLOSE_BRACKET) {\n depth -= 1;\n }\n\n index += 1;\n }\n}\n\n/**\n * Returns the offset one past the closing quote of a string whose opening quote\n * has already been consumed. Only valid on text `JSON.parse` has accepted.\n */\nfunction skipValidString(source: string, from: number, end: number): number {\n let index = from;\n\n while (index < end) {\n const code = source.charCodeAt(index);\n if (code === CH_BACKSLASH) {\n index += 2;\n continue;\n }\n if (code === CH_DOUBLE_QUOTE) {\n return index + 1;\n }\n index += 1;\n }\n\n return end;\n}\n","/**\n * References to the built-ins the engine depends on, captured when the module\n * is first evaluated.\n *\n * A repair library is often loaded into pages that also load third-party code,\n * and `JSON.parse` is a popular monkey-patching target. Holding the original\n * function means a later reassignment cannot change how this package validates\n * its own output, which is what the determinism guarantee rests on.\n */\nexport const parseJsonStrict: (text: string) => unknown = JSON.parse;\n","/**\n * Public type contracts for `@nexkit/json-repair`.\n *\n * These shapes are frozen for the 1.x line: fields may be added, never removed\n * or narrowed. New {@link RepairType} members may appear in minor releases, so\n * consumers should not write exhaustive `switch` statements over them.\n */\n\n/**\n * How much interpretation the repair engine is allowed to apply.\n *\n * - `safe` (default) applies only repairs with a single plausible reading and\n * never invents data. Anything ambiguous fails with `AMBIGUOUS_REPAIR`.\n * - `aggressive` additionally applies heuristics that guess intent, such as\n * quoting bare values or dropping trailing garbage. Aggressive mode always\n * tries `safe` first, so whenever `safe` succeeds both modes agree byte for\n * byte.\n */\nexport type RepairMode = 'safe' | 'aggressive';\n\n/**\n * The kind of change the repair engine made. Every operation reported in\n * {@link RepairResult.repairs} carries one of these.\n *\n * Repairs that discard input have deliberately distinct types\n * (`removed-*`, `terminated-string-at-newline`) so that callers can audit\n * whether any content was lost.\n */\nexport type RepairType =\n /** A leading U+FEFF byte order mark was removed. */\n | 'removed-byte-order-mark'\n /** JSON was isolated from Markdown fences or surrounding prose. */\n | 'extracted-json'\n /** A `//`, block or `#` comment was removed. */\n | 'removed-comment'\n /** Whitespace JSON does not allow between tokens, such as a non-breaking space, was dropped. */\n | 'normalized-whitespace'\n /** A comma directly before `}` or `]` was removed. */\n | 'removed-trailing-comma'\n /** A repeated or leading comma inside an object was removed. */\n | 'removed-extra-comma'\n /** A closing bracket that matched no open container was discarded. */\n | 'removed-stray-token'\n /** Content after the top-level value was discarded. */\n | 'removed-trailing-content'\n /** A truncated final key or member was discarded (streamed output). */\n | 'removed-incomplete-member'\n /** A missing separator between members or elements was inserted. */\n | 'added-missing-comma'\n /** A missing `:` between a key and its value was inserted. */\n | 'added-missing-colon'\n /** An absent or elided value was replaced by `null`. */\n | 'added-missing-value'\n /** An unclosed object was closed. */\n | 'added-closing-brace'\n /** An unclosed array was closed. */\n | 'added-closing-bracket'\n /** Single, backtick or typographic quotes were converted to `\"`. */\n | 'normalized-quotes'\n /** A non-JSON literal was mapped to JSON (`True`, `None`, `NaN`). */\n | 'normalized-literal'\n /** A number literal was rewritten to valid JSON grammar (`+1`, `.5`, `0x1F`). */\n | 'normalized-number'\n /** A bare object key was quoted. */\n | 'quoted-key'\n /** A bare value was quoted as a string. */\n | 'quoted-value'\n /** A raw control character, inner quote or lone surrogate was escaped. */\n | 'escaped-character'\n /** An invalid escape sequence was corrected. */\n | 'fixed-escape'\n /** A string left open at end of input was closed. Lossless. */\n | 'terminated-string-at-eof'\n /** A string left open was closed at a line break. **Discards** the text after that line break. */\n | 'terminated-string-at-newline';\n\n/** Every {@link RepairType}, in a stable order. Useful for exhaustive UIs and tests. */\nexport const REPAIR_TYPES = [\n 'removed-byte-order-mark',\n 'extracted-json',\n 'removed-comment',\n 'normalized-whitespace',\n 'removed-trailing-comma',\n 'removed-extra-comma',\n 'removed-stray-token',\n 'removed-trailing-content',\n 'removed-incomplete-member',\n 'added-missing-comma',\n 'added-missing-colon',\n 'added-missing-value',\n 'added-closing-brace',\n 'added-closing-bracket',\n 'normalized-quotes',\n 'normalized-literal',\n 'normalized-number',\n 'quoted-key',\n 'quoted-value',\n 'escaped-character',\n 'fixed-escape',\n 'terminated-string-at-eof',\n 'terminated-string-at-newline',\n] as const satisfies readonly RepairType[];\n\n/**\n * A single change applied to the input.\n *\n * Positions locate the change in the **original** input string — they stay\n * absolute even when the JSON was extracted from a larger document, and they\n * include a leading byte order mark if one was present.\n */\nexport interface RepairOperation {\n /** What kind of change was made. */\n type: RepairType;\n /** Zero-based offset into the original input, in UTF-16 code units. */\n position?: number;\n /** One-based line number in the original input. */\n line?: number;\n /** One-based column number in the original input, in UTF-16 code units. */\n column?: number;\n /** Human-readable description, used by the CLI's `--explain` output. */\n message?: string;\n}\n\n/** Result of {@link repairJson} when `returnMetadata: true` is set. */\nexport interface RepairResult {\n /** Repaired JSON text. Guaranteed to be accepted by `JSON.parse`. */\n json: string;\n /** `true` when {@link RepairResult.json} differs from the input. */\n changed: boolean;\n /** Ordered list of the changes that were applied, ascending by position. */\n repairs: RepairOperation[];\n}\n\n/**\n * Options accepted by {@link repairJson} and {@link parseJson}.\n *\n * The boolean flags are tri-state: leaving one `undefined` uses the default for\n * the selected {@link RepairMode}, while an explicit `true` or `false` always\n * wins. Passing `false` therefore *disables* a repair — it does not mean\n * \"use the default\".\n */\nexport interface RepairOptions {\n /**\n * Repair strategy. Defaults to `'safe'`.\n * @see RepairMode\n */\n mode?: RepairMode;\n /**\n * Isolate JSON from Markdown code fences and surrounding prose before\n * repairing. Defaults to `true`.\n */\n extract?: boolean;\n /**\n * Accept and strip line comments, block comments and `#` comments.\n * Defaults to `true`.\n * When `false`, a comment is a syntax error rather than trivia.\n */\n allowComments?: boolean;\n /** Accept single-quoted strings. Defaults to `true`. */\n allowSingleQuotes?: boolean;\n /** Accept and quote bare object keys. Defaults to `true`. */\n allowUnquotedKeys?: boolean;\n /** Remove commas that directly precede `}` or `]`. Defaults to `true`. */\n fixTrailingCommas?: boolean;\n /** Close containers that were never closed. Defaults to `true`. */\n fixMissingBrackets?: boolean;\n /**\n * Maximum accepted input length, in UTF-16 code units (not bytes).\n * Defaults to `10_000_000`. Exceeding it throws `MAX_LENGTH_EXCEEDED`.\n */\n maxLength?: number;\n /**\n * Maximum accepted nesting depth. Defaults to `512`, and may not exceed\n * {@link MAX_SUPPORTED_DEPTH}. Exceeding it throws `MAX_DEPTH_EXCEEDED`,\n * which also keeps the parser clear of host stack limits.\n */\n maxDepth?: number;\n /**\n * Maximum number of repair operations per attempt. Defaults to `Infinity`;\n * the engine is single pass, so it terminates regardless of this value.\n */\n maxRepairs?: number;\n /** Return a {@link RepairResult} instead of a plain string. Defaults to `false`. */\n returnMetadata?: boolean;\n}\n\n/** Options accepted by {@link extractJson} and {@link extractAllJson}. */\nexport interface ExtractOptions extends Pick<\n RepairOptions,\n | 'mode'\n | 'allowComments'\n | 'allowSingleQuotes'\n | 'allowUnquotedKeys'\n | 'fixTrailingCommas'\n | 'fixMissingBrackets'\n | 'maxLength'\n | 'maxDepth'\n | 'maxRepairs'\n> {\n /**\n * Which candidate {@link extractJson} returns when the document contains\n * several JSON blocks. Defaults to `'best'`, matching what\n * {@link repairJson} picks.\n *\n * - `best` — fewest repairs, then longest, then earliest. Prose decoys such\n * as the `[1]` in \"see [1] for details\" lose to a real payload beside them.\n * - `first` — the earliest repairable candidate, in document order.\n * - `last` — the last repairable candidate, in document order.\n * - `largest` — the longest repairable candidate; ties resolve to the earliest.\n */\n select?: 'best' | 'first' | 'last' | 'largest';\n}\n\n/** Machine-readable reason a repair failed. */\nexport type JsonRepairErrorCode =\n /** Input was not a string, was empty/whitespace-only, or an option was invalid. */\n | 'INVALID_INPUT'\n /** No repairable JSON value could be located in the input. */\n | 'NO_JSON_FOUND'\n /** No safe repair sequence exists for this input. */\n | 'UNREPAIRABLE_JSON'\n /** Input exceeded `maxLength`. */\n | 'MAX_LENGTH_EXCEEDED'\n /** Nesting exceeded `maxDepth`. */\n | 'MAX_DEPTH_EXCEEDED'\n /** More repairs were required than `maxRepairs` allows. */\n | 'MAX_REPAIRS_EXCEEDED'\n /** Several readings are possible and `safe` mode refuses to choose. */\n | 'AMBIGUOUS_REPAIR';\n\n/**\n * Hard ceiling for {@link RepairOptions.maxDepth}. Requesting more throws\n * `INVALID_INPUT`. The cap keeps the recursive parser well clear of host stack\n * limits on every supported runtime, so deep input always produces a\n * `MAX_DEPTH_EXCEEDED` error rather than a stack overflow.\n */\nexport const MAX_SUPPORTED_DEPTH = 1024;\n","import { JsonRepairError } from './errors/JsonRepairError.js';\nimport {\n MAX_SUPPORTED_DEPTH,\n type ExtractOptions,\n type RepairMode,\n type RepairOptions,\n} from './types.js';\n\n/** Default maximum input length, in UTF-16 code units. */\nexport const DEFAULT_MAX_LENGTH = 10_000_000;\n\n/** Default maximum nesting depth. */\nexport const DEFAULT_MAX_DEPTH = 512;\n\n/**\n * Fully resolved options. Every field is concrete, so the engine never has to\n * re-derive a default or consult the mode for a flag.\n */\nexport interface ResolvedOptions {\n mode: RepairMode;\n /** Convenience mirror of `mode === 'aggressive'`, read on hot paths. */\n aggressive: boolean;\n extract: boolean;\n allowComments: boolean;\n allowSingleQuotes: boolean;\n allowUnquotedKeys: boolean;\n fixTrailingCommas: boolean;\n fixMissingBrackets: boolean;\n maxLength: number;\n maxDepth: number;\n maxRepairs: number;\n returnMetadata: boolean;\n}\n\n/** Which candidate {@link extractJson} returns from a multi-block document. */\nexport type SelectStrategy = NonNullable<ExtractOptions['select']>;\n\n/**\n * Validates and resolves user options.\n *\n * The boolean flags are tri-state on purpose. `undefined` means \"use the\n * default for this mode\"; an explicit `true` or `false` always wins, so\n * `{ mode: 'aggressive', allowComments: false }` really does reject comments.\n * All six flags currently default to `true` in both modes — the difference\n * between modes lies in the repairs that have no flag of their own.\n *\n * @throws {JsonRepairError} `INVALID_INPUT` when any option is out of range.\n */\nexport function resolveOptions(options: RepairOptions | undefined): ResolvedOptions {\n const source = asOptionBag(options);\n const mode = resolveMode(source.mode);\n\n return {\n mode,\n aggressive: mode === 'aggressive',\n extract: resolveFlag(source.extract, 'extract', true),\n allowComments: resolveFlag(source.allowComments, 'allowComments', true),\n allowSingleQuotes: resolveFlag(source.allowSingleQuotes, 'allowSingleQuotes', true),\n allowUnquotedKeys: resolveFlag(source.allowUnquotedKeys, 'allowUnquotedKeys', true),\n fixTrailingCommas: resolveFlag(source.fixTrailingCommas, 'fixTrailingCommas', true),\n fixMissingBrackets: resolveFlag(source.fixMissingBrackets, 'fixMissingBrackets', true),\n maxLength: resolveLimit(source.maxLength, 'maxLength', DEFAULT_MAX_LENGTH, 1, Infinity),\n maxDepth: resolveLimit(source.maxDepth, 'maxDepth', DEFAULT_MAX_DEPTH, 1, MAX_SUPPORTED_DEPTH),\n maxRepairs: resolveLimit(source.maxRepairs, 'maxRepairs', Infinity, 0, Infinity),\n returnMetadata: resolveFlag(source.returnMetadata, 'returnMetadata', false),\n };\n}\n\n/**\n * Views the caller's options as a bag of unknown values.\n *\n * Every field is then validated as `unknown` rather than as its declared type,\n * because the declared type is only a promise: JavaScript callers, and\n * TypeScript callers who have cast, can pass anything at all. Validating what\n * actually arrived is what turns a mistake into a named `INVALID_INPUT` error\n * instead of undefined behaviour deep in the parser.\n *\n * @throws {JsonRepairError} `INVALID_INPUT`\n */\nfunction asOptionBag(options: unknown): Record<string, unknown> {\n if (options === undefined) {\n return {};\n }\n if (typeof options !== 'object' || options === null) {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Options must be an object, received ${describe(options)}.`,\n );\n }\n return options as Record<string, unknown>;\n}\n\n/**\n * Resolves options for {@link extractJson} and {@link extractAllJson}.\n *\n * Extraction is the whole point of these entry points, so `extract` is forced\n * on and is not exposed as an option.\n */\nexport function resolveExtractOptions(\n options: ExtractOptions | undefined,\n): ResolvedOptions & { select: SelectStrategy } {\n const source = asOptionBag(options);\n const select = resolveSelect(source.select);\n\n return { ...resolveOptions({ ...source, extract: true }), select };\n}\n\nfunction resolveSelect(select: unknown): SelectStrategy {\n if (select === undefined) {\n return 'best';\n }\n if (select !== 'best' && select !== 'first' && select !== 'last' && select !== 'largest') {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"select\" must be \"best\", \"first\", \"last\" or \"largest\", received ${describe(select)}.`,\n );\n }\n return select;\n}\n\n/** Returns a copy of `options` running in `mode`. */\nexport function withMode(options: ResolvedOptions, mode: RepairMode): ResolvedOptions {\n return { ...options, mode, aggressive: mode === 'aggressive' };\n}\n\nfunction resolveMode(mode: unknown): RepairMode {\n if (mode === undefined) {\n return 'safe';\n }\n if (mode !== 'safe' && mode !== 'aggressive') {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"mode\" must be \"safe\" or \"aggressive\", received ${describe(mode)}.`,\n );\n }\n return mode;\n}\n\nfunction resolveFlag(value: unknown, name: string, fallback: boolean): boolean {\n if (value === undefined) {\n return fallback;\n }\n if (typeof value !== 'boolean') {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"${name}\" must be a boolean, received ${describe(value)}.`,\n );\n }\n return value;\n}\n\nfunction resolveLimit(\n value: unknown,\n name: string,\n fallback: number,\n min: number,\n max: number,\n): number {\n if (value === undefined) {\n return fallback;\n }\n if (typeof value !== 'number' || Number.isNaN(value)) {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"${name}\" must be a number, received ${describe(value)}.`,\n );\n }\n if (value !== Infinity && !Number.isInteger(value)) {\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"${name}\" must be an integer or Infinity, received ${value}.`,\n );\n }\n if (value < min || value > max) {\n const ceiling = max === Infinity ? 'Infinity' : String(max);\n throw new JsonRepairError(\n 'INVALID_INPUT',\n `Option \"${name}\" must be between ${min} and ${ceiling}, received ${value}.`,\n );\n }\n return value;\n}\n\n/** Renders an untrusted value for an error message without ever calling into it. */\nfunction describe(value: unknown): string {\n if (value === null) {\n return 'null';\n }\n switch (typeof value) {\n case 'string':\n return JSON.stringify(value);\n case 'number':\n case 'boolean':\n case 'undefined':\n return String(value);\n case 'bigint':\n return `${String(value)}n`;\n default:\n return typeof value;\n }\n}\n","import type { RepairContext } from '../parser/state.js';\nimport { CH_CLOSE_BRACE } from '../scanner/tokens.js';\n\n/** Which container the parser is inside. */\nexport type ContainerKind = 'object' | 'array';\n\n/**\n * Records the implicit closing of a container that the input never closed.\n *\n * Truncated output — a cut-off stream, a response that hit a token limit — is\n * the usual cause, and there is only one way to close the containers that are\n * still open, so this is a safe repair. Callers that set\n * `fixMissingBrackets: false` get a hard failure instead.\n */\nexport function closeUnterminated(ctx: RepairContext, kind: ContainerKind, position: number): void {\n if (!ctx.options.fixMissingBrackets) {\n ctx.fail(kind === 'object' ? 'Object is never closed' : 'Array is never closed', position);\n }\n ctx.record(kind === 'object' ? 'added-closing-brace' : 'added-closing-bracket', position);\n}\n\n/**\n * Consumes a closing bracket that matches no open container.\n *\n * At the very end of the input a stray closer is almost always a typo for the\n * right one — `{\"a\":1]` can only have meant `{\"a\":1}` — so it is dropped\n * safely and the correct closer is added by {@link closeUnterminated}.\n * Anywhere else the bracket may be marking a real structural boundary, so only\n * aggressive mode discards it.\n */\nexport function dropStrayCloser(ctx: RepairContext): void {\n const position = ctx.scanner.index;\n const atEnd = position === ctx.lastContentIndex;\n\n if (!atEnd && !ctx.options.aggressive) {\n const character = ctx.scanner.peek() === CH_CLOSE_BRACE ? '}' : ']';\n ctx.refuse(`Unexpected \"${character}\" with no matching opening bracket`, position);\n }\n\n ctx.record('removed-stray-token', position);\n ctx.scanner.index = position + 1;\n}\n","import type { RepairContext } from '../parser/state.js';\nimport {\n CH_ASTERISK,\n CH_HASH,\n CH_SLASH,\n isJsonWhitespace,\n isLineBreak,\n isWhitespace,\n} from '../scanner/tokens.js';\n\n/**\n * Advances past whitespace and comments, recording each comment removed.\n *\n * Three comment syntaxes are accepted, all controlled by\n * `RepairOptions.allowComments`: `//` and `#` run to the end of the line, while\n * a C-style block comment runs to its terminator or, if it was never closed, to\n * the end of the input. Comments are trivia, so removing one never merges the tokens\n * around it — the parser reads the tokens separately and inserts any separator\n * that turns out to be missing.\n */\nexport function skipTrivia(ctx: RepairContext): void {\n const { scanner } = ctx;\n const { source, end } = scanner;\n const allowComments = ctx.options.allowComments;\n\n let index = scanner.index;\n\n for (;;) {\n // One record per run of whitespace, not per character, so a paste full of\n // non-breaking spaces cannot inflate the repair log out of proportion.\n let exotic = -1;\n while (index < end) {\n const code = source.charCodeAt(index);\n if (!isWhitespace(code)) {\n break;\n }\n if (exotic < 0 && !isJsonWhitespace(code)) {\n exotic = index;\n }\n index += 1;\n }\n\n if (exotic >= 0) {\n scanner.index = index;\n ctx.record('normalized-whitespace', exotic);\n }\n\n if (index >= end || !allowComments) {\n break;\n }\n\n const commentStart = index;\n const code = source.charCodeAt(index);\n\n if (code === CH_HASH) {\n index = skipToLineEnd(source, index + 1, end);\n } else if (code === CH_SLASH && index + 1 < end) {\n const nextCode = source.charCodeAt(index + 1);\n if (nextCode === CH_SLASH) {\n index = skipToLineEnd(source, index + 2, end);\n } else if (nextCode === CH_ASTERISK) {\n index = skipBlockComment(source, index + 2, end);\n } else {\n break;\n }\n } else {\n break;\n }\n\n scanner.index = index;\n ctx.record('removed-comment', commentStart);\n }\n\n scanner.index = index;\n}\n\n/**\n * Returns the offset after the whitespace and comments starting at `from`,\n * without recording anything.\n *\n * Used by the string-continuation probe, which must look past trivia while\n * remaining free of side effects — it may decide the lookahead was wrong.\n */\nexport function scanTrivia(\n source: string,\n from: number,\n end: number,\n allowComments: boolean,\n): number {\n let index = from;\n\n for (;;) {\n while (index < end && isWhitespace(source.charCodeAt(index))) {\n index += 1;\n }\n\n if (index >= end || !allowComments) {\n return index;\n }\n\n const code = source.charCodeAt(index);\n\n if (code === CH_HASH) {\n index = skipToLineEnd(source, index + 1, end);\n } else if (code === CH_SLASH && index + 1 < end) {\n const nextCode = source.charCodeAt(index + 1);\n if (nextCode === CH_SLASH) {\n index = skipToLineEnd(source, index + 2, end);\n } else if (nextCode === CH_ASTERISK) {\n index = skipBlockComment(source, index + 2, end);\n } else {\n return index;\n }\n } else {\n return index;\n }\n }\n}\n\nfunction skipToLineEnd(source: string, from: number, end: number): number {\n let index = from;\n while (index < end && !isLineBreak(source.charCodeAt(index))) {\n index += 1;\n }\n return index;\n}\n\nfunction skipBlockComment(source: string, from: number, end: number): number {\n let index = from;\n while (index < end) {\n if (\n source.charCodeAt(index) === CH_ASTERISK &&\n index + 1 < end &&\n source.charCodeAt(index + 1) === CH_SLASH\n ) {\n return index + 2;\n }\n index += 1;\n }\n // Unterminated block comment: everything to the end of the input is comment.\n return end;\n}\n","import type { RepairContext } from '../parser/state.js';\nimport { toLowerAscii } from '../scanner/tokens.js';\n\n/** What {@link readLiteral} was able to do with a bare token. */\nexport type LiteralOutcome =\n /** The token was written to the output as a JSON literal. */\n | 'emitted'\n /** A reading exists, but only `mode: 'aggressive'` is willing to commit to it. */\n | 'needs-aggressive'\n /** The token is not a literal in any mode. */\n | 'not-a-literal';\n\n/** How faithfully a non-JSON spelling of \"no value\" becomes `null`. */\ntype NullishKind =\n /** `None` — the same value under another language's spelling. */\n | 'equivalent'\n /** `NaN`, `Infinity`, `undefined` — `null` is the nearest JSON has, not the same value. */\n | 'lossy';\n\n/**\n * Tries to emit the bare token spanning `[start, end)` as `true`, `false` or\n * `null`.\n *\n * Case variants of the three JSON literals are safe: `True` and `NULL` have no\n * second reading in a value position. `None` is safe for the same reason. It is\n * Python's spelling of `null` and nothing is lost in rewriting it, and the only\n * competing reading — the string `\"None\"` — requires unquoted string values,\n * which safe mode does not perform in the first place. Refusing `None` while\n * accepting `True` would also split the one Python dict repr that LLM output\n * produces constantly down the middle.\n *\n * `NaN`, `Infinity` and `undefined` stay aggressive-only, because for them\n * `null` is a lossy answer rather than a translation: the first two discard a\n * number the author did write, and `JSON.stringify` drops an `undefined` object\n * member entirely instead of nulling it, so two defensible readings exist.\n */\nexport function readLiteral(ctx: RepairContext, start: number, end: number): LiteralOutcome {\n const { source } = ctx.scanner;\n const length = end - start;\n\n if (length < 3 || length > 9) {\n return 'not-a-literal';\n }\n\n const canonical = matchJsonLiteral(source, start, end, length);\n if (canonical !== undefined) {\n if (matchesExactly(source, start, canonical)) {\n ctx.writeSpan(start, end);\n } else {\n ctx.write(canonical);\n ctx.record('normalized-literal', start, `Rewrote a literal as ${canonical}`);\n }\n return 'emitted';\n }\n\n const nullish = matchNullish(source, start, end, length);\n if (nullish === undefined) {\n return 'not-a-literal';\n }\n if (nullish === 'lossy' && !ctx.options.aggressive) {\n return 'needs-aggressive';\n }\n\n ctx.write('null');\n ctx.record('normalized-literal', start, 'Rewrote a non-JSON literal as null');\n return 'emitted';\n}\n\n/** Returns the canonical JSON literal a token spells in any case, if any. */\nfunction matchJsonLiteral(\n source: string,\n start: number,\n end: number,\n length: number,\n): string | undefined {\n if (length === 4) {\n if (matchesWord(source, start, end, 'true')) {\n return 'true';\n }\n if (matchesWord(source, start, end, 'null')) {\n return 'null';\n }\n return undefined;\n }\n if (length === 5 && matchesWord(source, start, end, 'false')) {\n return 'false';\n }\n return undefined;\n}\n\n/**\n * Classifies a token as one of the non-JSON spellings of \"no value\".\n *\n * @returns how faithfully the token maps to `null`, or `undefined` when it is\n * not one of these spellings at all.\n */\nfunction matchNullish(\n source: string,\n start: number,\n end: number,\n length: number,\n): NullishKind | undefined {\n switch (length) {\n case 3:\n return matchesWord(source, start, end, 'nan') ? 'lossy' : undefined;\n case 4:\n return matchesWord(source, start, end, 'none') ? 'equivalent' : undefined;\n case 8:\n return matchesWord(source, start, end, 'infinity') ? 'lossy' : undefined;\n case 9:\n return matchesWord(source, start, end, 'undefined') ||\n matchesWord(source, start, end, '-infinity')\n ? 'lossy'\n : undefined;\n default:\n return undefined;\n }\n}\n\n/**\n * Compares a span against a lower-case ASCII word, ignoring case.\n *\n * Uses code-unit arithmetic rather than `toLowerCase`, whose result depends on\n * the host locale — under a Turkish locale `\"NULL\".toLowerCase()` yields `null`\n * but `\"I\".toLowerCase()` yields `ı`, and the package guarantees identical\n * output on every machine.\n */\nfunction matchesWord(source: string, start: number, end: number, word: string): boolean {\n if (end - start !== word.length) {\n return false;\n }\n for (let offset = 0; offset < word.length; offset += 1) {\n if (toLowerAscii(source.charCodeAt(start + offset)) !== word.charCodeAt(offset)) {\n return false;\n }\n }\n return true;\n}\n\n/** Reports whether a span is already exactly `word`. */\nfunction matchesExactly(source: string, start: number, word: string): boolean {\n for (let offset = 0; offset < word.length; offset += 1) {\n if (source.charCodeAt(start + offset) !== word.charCodeAt(offset)) {\n return false;\n }\n }\n return true;\n}\n","import type { RepairContext } from '../parser/state.js';\nimport {\n CH_DOT,\n CH_LOWER_E,\n CH_LOWER_X,\n CH_MINUS,\n CH_PLUS,\n CH_UNDERSCORE,\n CH_UPPER_E,\n CH_UPPER_X,\n CH_ZERO,\n isDigit,\n isHexDigit,\n} from '../scanner/tokens.js';\n\n/**\n * Tries to emit the token spanning `[start, end)` as a JSON number.\n *\n * Returns `false` when the token is not a number under the active mode, leaving\n * the output untouched so the caller can fall back to quoting it or refusing.\n *\n * Numbers are never round-tripped through `Number`: doing so would rewrite\n * `1.0` as `1`, turn `1e999` into `Infinity` and quietly lose precision beyond\n * 2^53. The token's own digits are reused verbatim, and repairs are limited to\n * the smallest edit that makes the JSON grammar accept them.\n */\nexport function readNumber(ctx: RepairContext, start: number, end: number): boolean {\n const { source } = ctx.scanner;\n\n if (isValidJsonNumber(source, start, end)) {\n ctx.writeSpan(start, end);\n return true;\n }\n\n const aggressive = ctx.options.aggressive;\n let index = start;\n let sign = '';\n let normalized = false;\n\n const first = source.charCodeAt(index);\n if (first === CH_PLUS) {\n // JSON has no unary plus, but `+1` has exactly one reading.\n index += 1;\n normalized = true;\n } else if (first === CH_MINUS) {\n sign = '-';\n index += 1;\n }\n\n if (aggressive && isHexPrefix(source, index, end)) {\n return readHex(ctx, start, index, end, sign);\n }\n\n let usedUnderscore = false;\n let integerDigits = '';\n while (index < end) {\n const code = source.charCodeAt(index);\n if (isDigit(code)) {\n integerDigits += source.charAt(index);\n } else if (code === CH_UNDERSCORE) {\n usedUnderscore = true;\n } else {\n break;\n }\n index += 1;\n }\n\n let fractionDigits = '';\n let sawDot = false;\n if (index < end && source.charCodeAt(index) === CH_DOT) {\n sawDot = true;\n index += 1;\n while (index < end) {\n const code = source.charCodeAt(index);\n if (isDigit(code)) {\n fractionDigits += source.charAt(index);\n } else if (code === CH_UNDERSCORE) {\n usedUnderscore = true;\n } else {\n break;\n }\n index += 1;\n }\n }\n\n let exponent = '';\n if (index < end) {\n const code = source.charCodeAt(index);\n if (code === CH_LOWER_E || code === CH_UPPER_E) {\n let cursor = index + 1;\n let exponentSign = '';\n if (cursor < end) {\n const signCode = source.charCodeAt(cursor);\n if (signCode === CH_PLUS || signCode === CH_MINUS) {\n exponentSign = signCode === CH_MINUS ? '-' : '';\n cursor += 1;\n }\n }\n const digitsStart = cursor;\n while (cursor < end && isDigit(source.charCodeAt(cursor))) {\n cursor += 1;\n }\n if (cursor > digitsStart) {\n exponent = `e${exponentSign}${source.slice(digitsStart, cursor)}`;\n } else {\n // `1e` and `1e+` carry no exponent; dropping it is the only reading.\n normalized = true;\n }\n index = cursor;\n }\n }\n\n // Anything left over means this was never a number: `1.2.3`, `12abc`, `--1`.\n if (index !== end || (integerDigits.length === 0 && fractionDigits.length === 0)) {\n return false;\n }\n\n if (usedUnderscore) {\n if (!aggressive) {\n return false;\n }\n normalized = true;\n }\n\n let integerPart = integerDigits;\n if (integerPart.length === 0) {\n // `.5` is unambiguous once the missing zero is supplied.\n integerPart = '0';\n normalized = true;\n } else if (integerPart.length > 1 && integerPart.charCodeAt(0) === CH_ZERO) {\n // `007` could be a padded identifier, so only aggressive mode picks a reading.\n if (!aggressive) {\n return false;\n }\n let cut = 0;\n while (cut < integerPart.length - 1 && integerPart.charCodeAt(cut) === CH_ZERO) {\n cut += 1;\n }\n integerPart = integerPart.slice(cut);\n normalized = true;\n }\n\n if (sawDot && fractionDigits.length === 0) {\n // `5.` means `5`; JSON requires a digit after the point.\n normalized = true;\n }\n\n if (!normalized) {\n return false;\n }\n\n ctx.write(sign);\n ctx.write(integerPart);\n if (fractionDigits.length > 0) {\n ctx.write('.');\n ctx.write(fractionDigits);\n }\n ctx.write(exponent);\n ctx.record('normalized-number', start);\n return true;\n}\n\n/** Reports whether `[start, end)` already matches the JSON number grammar. */\nexport function isValidJsonNumber(source: string, start: number, end: number): boolean {\n let index = start;\n if (index < end && source.charCodeAt(index) === CH_MINUS) {\n index += 1;\n }\n\n if (index >= end) {\n return false;\n }\n\n if (source.charCodeAt(index) === CH_ZERO) {\n index += 1;\n } else {\n if (!isDigit(source.charCodeAt(index))) {\n return false;\n }\n while (index < end && isDigit(source.charCodeAt(index))) {\n index += 1;\n }\n }\n\n if (index < end && source.charCodeAt(index) === CH_DOT) {\n index += 1;\n const digitsStart = index;\n while (index < end && isDigit(source.charCodeAt(index))) {\n index += 1;\n }\n if (index === digitsStart) {\n return false;\n }\n }\n\n if (index < end) {\n const code = source.charCodeAt(index);\n if (code !== CH_LOWER_E && code !== CH_UPPER_E) {\n return false;\n }\n index += 1;\n if (index < end) {\n const signCode = source.charCodeAt(index);\n if (signCode === CH_PLUS || signCode === CH_MINUS) {\n index += 1;\n }\n }\n const digitsStart = index;\n while (index < end && isDigit(source.charCodeAt(index))) {\n index += 1;\n }\n if (index === digitsStart) {\n return false;\n }\n }\n\n return index === end;\n}\n\nfunction isHexPrefix(source: string, index: number, end: number): boolean {\n if (index + 2 >= end || source.charCodeAt(index) !== CH_ZERO) {\n return false;\n }\n const marker = source.charCodeAt(index + 1);\n return marker === CH_LOWER_X || marker === CH_UPPER_X;\n}\n\n/**\n * Converts `0x…` to decimal.\n *\n * `BigInt` keeps values above 2^53 exact, which `parseInt` would not — a hex\n * hash rewritten as a lossy float would be a silent data corruption.\n */\nfunction readHex(\n ctx: RepairContext,\n start: number,\n prefixStart: number,\n end: number,\n sign: string,\n): boolean {\n const { source } = ctx.scanner;\n const digitsStart = prefixStart + 2;\n\n let index = digitsStart;\n while (index < end && isHexDigit(source.charCodeAt(index))) {\n index += 1;\n }\n if (index !== end || index === digitsStart) {\n return false;\n }\n\n const value = BigInt(source.slice(prefixStart, end));\n ctx.write(sign);\n ctx.write(value.toString());\n ctx.record('normalized-number', start);\n return true;\n}\n","import { scanTrivia } from '../repair/comments.js';\nimport {\n CH_BACKSLASH,\n CH_CLOSE_BRACE,\n CH_CLOSE_BRACKET,\n CH_COLON,\n CH_COMMA,\n CH_MINUS,\n CH_OPEN_BRACE,\n CH_OPEN_BRACKET,\n CH_PLUS,\n CH_DOT,\n closersFor,\n isDigit,\n isIdentifierPart,\n isIdentifierStart,\n isQuote,\n} from '../scanner/tokens.js';\nimport type { RepairContext } from './state.js';\n\n/**\n * Where in the grammar a string that just closed was sitting.\n *\n * `document` is the top-level value; it is probed like an array element, which\n * makes a bare word after the quote (`\"he said \"hi\" today\"`) reject the close\n * while a closing punctuation mark or end of input accepts it.\n */\nexport type Slot = 'object-key' | 'object-value' | 'array-element' | 'document';\n\n/**\n * Characters of lookahead a single probe may consume.\n *\n * Wide enough for a comma, a long key and a colon; narrow enough that a string\n * containing many quote characters cannot turn the parse quadratic. The global\n * `RepairContext.probeBudget` bounds the total across all probes as well.\n */\nconst PROBE_WINDOW = 256;\n\n/** {@link scanString}/{@link scanValueToken} hit the end of input with no terminator. */\nconst SCAN_UNTERMINATED = -1;\n\n/** {@link scanString}/{@link scanValueToken} ran past the lookahead window. */\nconst SCAN_BUDGET = -2;\n\n/**\n * Decides whether a quote character really closes the string, by checking that\n * what follows could continue the enclosing container.\n *\n * This is the heart of the inner-quote heuristic. Given `{\"a\": \"he said \"hi\",\n * ok\"}` a naive parser closes the value at `\"he said \"` and then chokes; a\n * parser that accepts any quote followed by a comma closes it at `\"hi\"` and\n * silently drops `ok`. Both are wrong. Probing asks the only question that\n * distinguishes them — *does a well-formed continuation start here?* — and the\n * answer is no in both cases, because ` ok\"` is not a key followed by a colon.\n * The string therefore runs to the final quote, and the inner ones become\n * escaped content.\n *\n * The probe is read-only and bounded: on running out of budget it accepts the\n * close, which is what a plain JSON parser would have done anyway.\n *\n * @param from Absolute offset immediately after the candidate closing quote.\n */\nexport function probeContinuation(ctx: RepairContext, from: number, slot: Slot): boolean {\n if (ctx.probeBudget <= 0) {\n return true;\n }\n\n const { source, end } = ctx.scanner;\n const window = end < from + PROBE_WINDOW ? end : from + PROBE_WINDOW;\n const allowComments = ctx.options.allowComments;\n const aggressive = ctx.options.aggressive;\n\n const index = scanTrivia(source, from, window, allowComments);\n ctx.probeBudget -= index - from + 1;\n\n // Reaching the true end of the region means the string ended the document.\n if (index >= end) {\n return true;\n }\n if (index >= window) {\n return true;\n }\n\n const code = source.charCodeAt(index);\n\n switch (slot) {\n case 'object-key':\n if (code === CH_COLON) {\n return true;\n }\n // `{\"a\", \"b\": 1}` only has a reading once missing colons may be invented.\n return aggressive && (code === CH_COMMA || code === CH_CLOSE_BRACE);\n\n case 'object-value':\n if (code === CH_CLOSE_BRACE || code === CH_CLOSE_BRACKET) {\n return true;\n }\n if (code === CH_COMMA) {\n return looksLikeMember(ctx, index + 1, window, allowComments);\n }\n // A key starting straight after the value means a comma went missing.\n if (isQuote(code) || isIdentifierStart(code)) {\n return looksLikeMember(ctx, index, window, allowComments);\n }\n return false;\n\n case 'array-element':\n case 'document':\n if (code === CH_CLOSE_BRACKET || code === CH_CLOSE_BRACE) {\n return true;\n }\n if (code === CH_COMMA) {\n return looksLikeElement(ctx, index + 1, window, allowComments);\n }\n if (isQuote(code)) {\n return looksLikeElement(ctx, index, window, allowComments);\n }\n return false;\n\n default:\n return true;\n }\n}\n\n/** Reports whether `from` plausibly starts `key :` inside an object. */\nfunction looksLikeMember(\n ctx: RepairContext,\n from: number,\n window: number,\n allowComments: boolean,\n): boolean {\n const { source, end } = ctx.scanner;\n\n const keyStart = scanTrivia(source, from, window, allowComments);\n ctx.probeBudget -= keyStart - from + 1;\n\n if (keyStart >= end || keyStart >= window) {\n return true;\n }\n\n const code = source.charCodeAt(keyStart);\n // A closing brace or another comma still leaves a well-formed member list.\n if (code === CH_CLOSE_BRACE || code === CH_COMMA) {\n return true;\n }\n\n const keyEnd = scanKey(source, keyStart, window, end);\n ctx.probeBudget -= (keyEnd < 0 ? window - keyStart : keyEnd - keyStart) + 1;\n\n if (keyEnd === SCAN_BUDGET) {\n return true;\n }\n if (keyEnd < 0) {\n return false;\n }\n\n const afterKey = scanTrivia(source, keyEnd, window, allowComments);\n if (afterKey >= end || afterKey >= window) {\n return true;\n }\n return source.charCodeAt(afterKey) === CH_COLON;\n}\n\n/** Reports whether `from` plausibly starts an array element followed by `,` or `]`. */\nfunction looksLikeElement(\n ctx: RepairContext,\n from: number,\n window: number,\n allowComments: boolean,\n): boolean {\n const { source, end } = ctx.scanner;\n\n const valueStart = scanTrivia(source, from, window, allowComments);\n ctx.probeBudget -= valueStart - from + 1;\n\n if (valueStart >= end || valueStart >= window) {\n return true;\n }\n\n const code = source.charCodeAt(valueStart);\n // A closing bracket or another comma still leaves a well-formed element list.\n if (code === CH_CLOSE_BRACKET || code === CH_COMMA) {\n return true;\n }\n\n const valueEnd = scanValueToken(source, valueStart, window, end);\n ctx.probeBudget -= (valueEnd < 0 ? window - valueStart : valueEnd - valueStart) + 1;\n\n if (valueEnd === SCAN_BUDGET) {\n return true;\n }\n if (valueEnd < 0) {\n return false;\n }\n\n const afterValue = scanTrivia(source, valueEnd, window, allowComments);\n if (afterValue >= end || afterValue >= window) {\n return true;\n }\n const next = source.charCodeAt(afterValue);\n return next === CH_COMMA || next === CH_CLOSE_BRACKET;\n}\n\n/** Returns the offset after a quoted or bare key, or a negative scan code. */\nfunction scanKey(source: string, from: number, window: number, end: number): number {\n const code = source.charCodeAt(from);\n if (isQuote(code)) {\n return scanString(source, from, window, end);\n }\n if (!isIdentifierStart(code)) {\n return SCAN_UNTERMINATED;\n }\n\n let index = from + 1;\n while (index < window && isIdentifierPart(source.charCodeAt(index))) {\n index += 1;\n }\n return index >= window && index < end ? SCAN_BUDGET : index;\n}\n\n/** Returns the offset after one value token, or a negative scan code. */\nfunction scanValueToken(source: string, from: number, window: number, end: number): number {\n const code = source.charCodeAt(from);\n\n if (isQuote(code)) {\n return scanString(source, from, window, end);\n }\n // A nested container is a value; its own contents are not this probe's problem.\n if (code === CH_OPEN_BRACE || code === CH_OPEN_BRACKET) {\n return SCAN_BUDGET;\n }\n if (!isDigit(code) && !isIdentifierStart(code) && code !== CH_MINUS && code !== CH_PLUS) {\n return SCAN_UNTERMINATED;\n }\n\n let index = from + 1;\n while (index < window) {\n const next = source.charCodeAt(index);\n if (!isIdentifierPart(next) && !isDigit(next) && next !== CH_PLUS && next !== CH_DOT) {\n break;\n }\n index += 1;\n }\n return index >= window && index < end ? SCAN_BUDGET : index;\n}\n\n/** Returns the offset after a string literal, or a negative scan code. */\nfunction scanString(source: string, from: number, window: number, end: number): number {\n const opener = source.charCodeAt(from);\n const closers = closersFor(opener);\n\n let index = from + 1;\n while (index < window) {\n const code = source.charCodeAt(index);\n if (code === CH_BACKSLASH) {\n index += 2;\n continue;\n }\n if (code === closers[0] || code === closers[1]) {\n return index + 1;\n }\n index += 1;\n }\n return index >= end ? SCAN_UNTERMINATED : SCAN_BUDGET;\n}\n","import { probeContinuation, type Slot } from '../parser/probe.js';\nimport type { Checkpoint, RepairContext } from '../parser/state.js';\nimport {\n CH_BACKSLASH,\n CH_CARRIAGE_RETURN,\n CH_CLOSE_BRACE,\n CH_CLOSE_BRACKET,\n CH_COMMA,\n CH_DOUBLE_QUOTE,\n CH_LINE_FEED,\n CH_LOWER_B,\n CH_LOWER_F,\n CH_LOWER_N,\n CH_LOWER_R,\n CH_LOWER_T,\n CH_LOWER_U,\n CH_SLASH,\n closersFor,\n isHexDigit,\n isHighSurrogate,\n isLowSurrogate,\n isQuote,\n isStandardQuote,\n isWhitespace,\n} from '../scanner/tokens.js';\n\n/* Classification of the escape sequence at a backslash. Non-negative values are\n * the length of a sequence JSON already accepts verbatim. */\nconst ESC_SHORT = 2;\nconst ESC_UNICODE = 6;\nconst ESC_DANGLING = -1; /* backslash is the last character of the input */\nconst ESC_TRUNCATED_UNICODE = -2; /* `\\u` with too few hex digits before the end */\nconst ESC_BAD_UNICODE = -3; /* `\\u` not followed by four hex digits */\nconst ESC_QUOTE = -4; /* backslash before a quote character */\nconst ESC_CONTROL = -5; /* backslash before a raw control character */\nconst ESC_UNKNOWN = -6; /* backslash before anything else */\n\n/**\n * Reads a quoted string and writes it back as a canonical JSON string.\n *\n * Handles every string-level repair in one pass:\n *\n * - non-standard delimiters (`'`, `` ` ``, `“ ”`) become `\"`,\n * - raw control characters and unpaired surrogates are escaped,\n * - invalid escape sequences are corrected without losing characters,\n * - a quote that does not actually end the string becomes escaped content,\n * - a string left open is closed, at a line break or at end of input.\n *\n * The cursor must sit on the opening quote, and is left just past the point the\n * string was found to end.\n */\nexport function readString(ctx: RepairContext, slot: Slot): void {\n const { scanner } = ctx;\n const { source, end } = scanner;\n\n const start = scanner.index;\n const opener = source.charCodeAt(start);\n const standard = isStandardQuote(opener);\n const closers = closersFor(opener);\n const closerA = closers[0];\n const closerB = closers[1];\n\n if (!standard) {\n ctx.record('normalized-quotes', start);\n }\n\n ctx.write('\"');\n\n let index = start + 1;\n let spanStart = index;\n let checkpoint: Checkpoint | undefined;\n /** End of the last reported run of control characters, so a multi-line string logs one repair per line, not per character. */\n let reportedControlEnd = -1;\n\n while (index < end) {\n const code = source.charCodeAt(index);\n\n if (code === CH_BACKSLASH) {\n const kind = classifyEscape(source, index, end);\n if (kind >= 0) {\n index += kind;\n continue;\n }\n\n ctx.writeSpan(spanStart, index);\n\n switch (kind) {\n case ESC_DANGLING:\n ctx.record('fixed-escape', index, 'Removed a trailing backslash with nothing to escape');\n index = end;\n break;\n case ESC_TRUNCATED_UNICODE:\n ctx.record('fixed-escape', index, 'Removed a truncated \\\\u escape at end of input');\n index = end;\n break;\n case ESC_BAD_UNICODE:\n ctx.write('\\\\\\\\u');\n ctx.record('fixed-escape', index, 'Escaped an incomplete \\\\u sequence');\n index += 2;\n break;\n case ESC_QUOTE: {\n // `'it\\'s'` and friends: the backslash belonged to the source dialect.\n const quoted = source.charCodeAt(index + 1);\n ctx.write(quoted === CH_DOUBLE_QUOTE ? '\\\\\"' : source[index + 1]!);\n ctx.record('fixed-escape', index, 'Unescaped a quote that JSON does not escape');\n index += 2;\n break;\n }\n case ESC_CONTROL:\n ctx.write(escapeControl(source.charCodeAt(index + 1)));\n ctx.record('fixed-escape', index, 'Replaced a backslash before a control character');\n index += 2;\n break;\n default:\n // Keep both characters: `\\x41` stays `\\x41` rather than becoming `x41`.\n ctx.write('\\\\\\\\');\n ctx.write(source[index + 1]!);\n ctx.record('fixed-escape', index, 'Escaped a backslash that began an unknown sequence');\n index += 2;\n break;\n }\n\n spanStart = index;\n continue;\n }\n\n if (code === closerA || code === closerB) {\n if (probeContinuation(ctx, index + 1, slot)) {\n ctx.writeSpan(spanStart, index);\n ctx.write('\"');\n scanner.index = index + 1;\n return;\n }\n\n // Nothing that could continue the container follows this quote. Either the\n // quote is content, or — in safe mode with a standard delimiter — the real\n // closing quote was dropped and the string ended at the previous newline.\n if (standard && !ctx.options.aggressive) {\n if (checkpoint !== undefined && ctx.canRewindTo(checkpoint)) {\n closeAtCheckpoint(ctx, checkpoint);\n return;\n }\n ctx.writeSpan(spanStart, index);\n ctx.write('\"');\n scanner.index = index + 1;\n return;\n }\n\n ctx.writeSpan(spanStart, index);\n if (standard) {\n ctx.write('\\\\\"');\n ctx.record('escaped-character', index, 'Escaped a quote inside a string');\n } else {\n ctx.write(source[index]!);\n }\n index += 1;\n spanStart = index;\n continue;\n }\n\n if (code < 0x20) {\n ctx.writeSpan(spanStart, index);\n if (code === CH_LINE_FEED || code === CH_CARRIAGE_RETURN) {\n // Remember where the line ended: if the closing quote turns out to be\n // missing, this is the most likely place for the string to have stopped.\n checkpoint = ctx.checkpoint(index);\n }\n if (index !== reportedControlEnd) {\n ctx.record('escaped-character', index, 'Escaped a raw control character in a string');\n }\n reportedControlEnd = index + 1;\n ctx.write(escapeControl(code));\n index += 1;\n spanStart = index;\n continue;\n }\n\n if (code === CH_DOUBLE_QUOTE) {\n // Reached only inside a non-standard delimiter, where `\"` is plain content.\n ctx.writeSpan(spanStart, index);\n ctx.write('\\\\\"');\n index += 1;\n spanStart = index;\n continue;\n }\n\n if (isHighSurrogate(code)) {\n if (index + 1 < end && isLowSurrogate(source.charCodeAt(index + 1))) {\n index += 2;\n continue;\n }\n index = escapeStrayUnit(ctx, spanStart, index, code);\n spanStart = index;\n continue;\n }\n\n if (isLowSurrogate(code)) {\n index = escapeStrayUnit(ctx, spanStart, index, code);\n spanStart = index;\n continue;\n }\n\n index += 1;\n }\n\n // End of input reached with the string still open.\n ctx.writeSpan(spanStart, index);\n\n if (\n checkpoint !== undefined &&\n ctx.canRewindTo(checkpoint) &&\n tailIsStructural(source, checkpoint.index, end)\n ) {\n closeAtCheckpoint(ctx, checkpoint);\n return;\n }\n\n ctx.write('\"');\n ctx.record('terminated-string-at-eof', end);\n scanner.index = end;\n}\n\n/**\n * Writes `[from, to)` of the input as a JSON string literal.\n *\n * Used for text that was never quoted in the source — a bare key or, in\n * aggressive mode, a bare value. Unescaped runs are copied as spans, so the\n * cost is proportional to the number of characters that actually need escaping.\n */\nexport function writeQuotedSpan(ctx: RepairContext, from: number, to: number): void {\n const { source } = ctx.scanner;\n\n ctx.write('\"');\n\n let spanStart = from;\n for (let index = from; index < to; index += 1) {\n const code = source.charCodeAt(index);\n\n let replacement: string | undefined;\n if (code === CH_DOUBLE_QUOTE) {\n replacement = '\\\\\"';\n } else if (code === CH_BACKSLASH) {\n replacement = '\\\\\\\\';\n } else if (code < 0x20) {\n replacement = escapeControl(code);\n } else if (isHighSurrogate(code)) {\n if (index + 1 < to && isLowSurrogate(source.charCodeAt(index + 1))) {\n index += 1;\n continue;\n }\n replacement = escapeUnit(code);\n } else if (isLowSurrogate(code)) {\n replacement = escapeUnit(code);\n }\n\n if (replacement !== undefined) {\n ctx.writeSpan(spanStart, index);\n ctx.write(replacement);\n spanStart = index + 1;\n }\n }\n\n ctx.writeSpan(spanStart, to);\n ctx.write('\"');\n}\n\n/**\n * Escapes an unpaired surrogate so the output survives UTF-8 encoding.\n *\n * `JSON.parse` accepts a lone surrogate, but writing one to a file or a socket\n * produces a replacement character, so the repaired text would no longer round\n * trip. Escaping keeps the exact code unit. Input that needs no repair skips\n * this path entirely and is returned byte-identical.\n */\nfunction escapeStrayUnit(\n ctx: RepairContext,\n spanStart: number,\n index: number,\n code: number,\n): number {\n ctx.writeSpan(spanStart, index);\n ctx.write(escapeUnit(code));\n ctx.record('escaped-character', index, 'Escaped an unpaired surrogate');\n return index + 1;\n}\n\n/** Closes the string at a remembered line break and resumes parsing there. */\nfunction closeAtCheckpoint(ctx: RepairContext, checkpoint: Checkpoint): void {\n ctx.rewindTo(checkpoint);\n ctx.write('\"');\n ctx.record('terminated-string-at-newline', checkpoint.index);\n}\n\n/**\n * Classifies the escape sequence at `index`.\n *\n * Returns the length of the sequence when JSON already accepts it verbatim, so\n * the caller can keep extending its current span, or one of the `ESC_*` codes\n * when the sequence has to be rewritten.\n */\nfunction classifyEscape(source: string, index: number, end: number): number {\n if (index + 1 >= end) {\n return ESC_DANGLING;\n }\n\n const escaped = source.charCodeAt(index + 1);\n\n switch (escaped) {\n case CH_DOUBLE_QUOTE:\n case CH_BACKSLASH:\n case CH_SLASH:\n case CH_LOWER_B:\n case CH_LOWER_F:\n case CH_LOWER_N:\n case CH_LOWER_R:\n case CH_LOWER_T:\n return ESC_SHORT;\n case CH_LOWER_U:\n if (\n index + 5 < end &&\n isHexDigit(source.charCodeAt(index + 2)) &&\n isHexDigit(source.charCodeAt(index + 3)) &&\n isHexDigit(source.charCodeAt(index + 4)) &&\n isHexDigit(source.charCodeAt(index + 5))\n ) {\n return ESC_UNICODE;\n }\n return index + 6 > end ? ESC_TRUNCATED_UNICODE : ESC_BAD_UNICODE;\n default:\n break;\n }\n\n if (isQuote(escaped)) {\n return ESC_QUOTE;\n }\n return escaped < 0x20 ? ESC_CONTROL : ESC_UNKNOWN;\n}\n\n/**\n * Reports whether everything between `from` and `end` is structural.\n *\n * Decides what an unterminated string at end of input swallowed. If the rest is\n * only whitespace and closing punctuation it was the document's structure —\n * `{\"a\": \"oops⏎}` means `{\"a\":\"oops\"}`, not a value containing a brace. If it\n * holds anything else it is real content, and closing at end of input keeps it.\n */\nfunction tailIsStructural(source: string, from: number, end: number): boolean {\n for (let index = from; index < end; index += 1) {\n const code = source.charCodeAt(index);\n if (\n code === CH_CLOSE_BRACE ||\n code === CH_CLOSE_BRACKET ||\n code === CH_COMMA ||\n isWhitespace(code)\n ) {\n continue;\n }\n return false;\n }\n return true;\n}\n\n/** Returns the JSON escape for a control character. */\nfunction escapeControl(code: number): string {\n switch (code) {\n case 0x08:\n return '\\\\b';\n case 0x09:\n return '\\\\t';\n case 0x0a:\n return '\\\\n';\n case 0x0c:\n return '\\\\f';\n case 0x0d:\n return '\\\\r';\n default:\n return escapeUnit(code);\n }\n}\n\n/** Returns the `\\uXXXX` escape for a code unit. */\nfunction escapeUnit(code: number): string {\n return `\\\\u${code.toString(16).padStart(4, '0')}`;\n}\n","import type { RepairContext } from '../parser/state.js';\nimport { CH_CLOSE_BRACE, CH_CLOSE_BRACKET, CH_COMMA, CH_EOF } from '../scanner/tokens.js';\nimport { skipTrivia } from './comments.js';\n\n/** What the parser found where a member or element separator was expected. */\nexport type Separator =\n /** A comma with more content after it. */\n | 'comma'\n /** A comma directly before the container's closer; it has been removed. */\n | 'trailing-comma'\n /** The container ends here — a closing bracket or end of input. */\n | 'end'\n /** Content continues but the comma is missing; one has been inserted. */\n | 'missing';\n\n/**\n * Reads the separator after a member or element, recording whatever repair the\n * input needed.\n *\n * Trailing commas are the single most common JSON defect, and unlike most\n * repairs they are unambiguous in both directions: `[1,2,3,]` can only ever have\n * meant `[1,2,3]`. A missing comma is equally unambiguous once the parser has\n * confirmed that another member starts, which is why both are safe repairs.\n *\n * The cursor is left on the next meaningful character; the closer, if any, is\n * not consumed.\n */\nexport function readSeparator(ctx: RepairContext): Separator {\n skipTrivia(ctx);\n\n const code = ctx.scanner.peek();\n\n if (code === CH_COMMA) {\n const commaPosition = ctx.scanner.index;\n ctx.scanner.index += 1;\n skipTrivia(ctx);\n\n const next = ctx.scanner.peek();\n if (next === CH_CLOSE_BRACE || next === CH_CLOSE_BRACKET || next === CH_EOF) {\n if (!ctx.options.fixTrailingCommas) {\n ctx.fail('Trailing comma before the end of the container', commaPosition);\n }\n ctx.record('removed-trailing-comma', commaPosition);\n return 'trailing-comma';\n }\n return 'comma';\n }\n\n if (code === CH_CLOSE_BRACE || code === CH_CLOSE_BRACKET || code === CH_EOF) {\n return 'end';\n }\n\n ctx.record('added-missing-comma', ctx.scanner.index);\n return 'missing';\n}\n","import { closeUnterminated, dropStrayCloser } from '../repair/brackets.js';\nimport { skipTrivia } from '../repair/comments.js';\nimport { readLiteral } from '../repair/literals.js';\nimport { readNumber } from '../repair/numbers.js';\nimport { readString, writeQuotedSpan } from '../repair/quotes.js';\nimport { readSeparator } from '../repair/trailing-comma.js';\nimport {\n CH_ASTERISK,\n CH_CLOSE_BRACE,\n CH_CLOSE_BRACKET,\n CH_COLON,\n CH_COMMA,\n CH_DOUBLE_QUOTE,\n CH_EOF,\n CH_HASH,\n CH_OPEN_BRACE,\n CH_OPEN_BRACKET,\n CH_SLASH,\n isIdentifierPart,\n isIdentifierStart,\n isQuote,\n isStructural,\n isWhitespace,\n} from '../scanner/tokens.js';\nimport type { Slot } from './probe.js';\nimport type { RepairContext } from './state.js';\n\n/**\n * Outcome of parsing one value.\n *\n * `dropped` means the construct was cut off by the end of the input, nothing\n * was written, and the cursor now sits at the end of the region. Streamed\n * output that stops mid-token is the reason this exists: emitting a husk such\n * as `{\"name\"` is impossible, and failing outright would throw away everything\n * that did arrive, so the truncated tail is discarded and reported.\n */\nexport type ParseStatus = 'ok' | 'dropped';\n\n/**\n * Parses one complete JSON value starting at the cursor, writing the repaired\n * text into the context.\n *\n * The cursor is left immediately after the value; anything beyond it is the\n * caller's concern.\n *\n * @throws {JsonRepairError} when the input cannot be read as JSON in the active mode.\n */\nexport function parseDocument(ctx: RepairContext): void {\n skipTrivia(ctx);\n\n if (ctx.scanner.eof()) {\n throw ctx.error('NO_JSON_FOUND', 'No JSON value found', ctx.scanner.index);\n }\n\n if (parseValue(ctx, 'document', false) === 'dropped') {\n throw ctx.error('NO_JSON_FOUND', 'No JSON value found', ctx.scanner.index);\n }\n}\n\n/**\n * Parses a single value.\n *\n * @param mayDrop Whether an entirely truncated container may be discarded. The\n * top-level value never can: `[{` still has to produce `[]` rather than\n * nothing at all.\n */\nexport function parseValue(ctx: RepairContext, slot: Slot, mayDrop: boolean): ParseStatus {\n const { scanner } = ctx;\n\n for (;;) {\n skipTrivia(ctx);\n\n const start = scanner.index;\n const code = scanner.peek();\n\n if (code === CH_EOF) {\n return 'dropped';\n }\n if (code === CH_OPEN_BRACE) {\n return parseObject(ctx, mayDrop);\n }\n if (code === CH_OPEN_BRACKET) {\n return parseArray(ctx, mayDrop);\n }\n if (isQuote(code)) {\n if (code !== CH_DOUBLE_QUOTE && !ctx.options.allowSingleQuotes) {\n ctx.fail('Non-standard string delimiter, and allowSingleQuotes is disabled', start);\n }\n readString(ctx, slot);\n return 'ok';\n }\n if (\n code === CH_CLOSE_BRACE ||\n code === CH_CLOSE_BRACKET ||\n code === CH_COMMA ||\n code === CH_COLON\n ) {\n // The value is simply absent: `{\"a\":}` or `[1,,2]`.\n if (!ctx.options.aggressive) {\n ctx.refuse('Expected a value', start);\n }\n ctx.write('null');\n ctx.record('added-missing-value', start);\n return 'ok';\n }\n\n const coreEnd = scanCoreToken(ctx, start);\n if (coreEnd > start) {\n return parseBareValue(ctx, start, coreEnd);\n }\n\n // A character that cannot begin anything. Dropping it is the only way to\n // make progress, and only aggressive mode is willing to.\n if (!ctx.options.aggressive) {\n ctx.fail(`Unexpected character ${describeChar(scanner.source, start)}`, start);\n }\n ctx.record('removed-stray-token', start);\n scanner.index = start + 1;\n }\n}\n\n/* ── Objects ────────────────────────────────────────────────────────────── */\n\nfunction parseObject(ctx: RepairContext, mayDrop: boolean): ParseStatus {\n const { scanner } = ctx;\n const openPosition = scanner.index;\n const entry = ctx.checkpoint(openPosition);\n\n scanner.index += 1;\n ctx.enter(openPosition);\n ctx.openBraces += 1;\n ctx.write('{');\n\n let members = 0;\n let closed = false;\n let truncated = false;\n let previousIndex = -1;\n\n for (;;) {\n skipTrivia(ctx);\n\n if (scanner.index === previousIndex) {\n ctx.fail('Parser made no progress', scanner.index);\n }\n previousIndex = scanner.index;\n\n const code = scanner.peek();\n\n if (code === CH_EOF) {\n closeUnterminated(ctx, 'object', scanner.index);\n truncated = true;\n break;\n }\n if (code === CH_CLOSE_BRACE) {\n scanner.index += 1;\n closed = true;\n break;\n }\n if (code === CH_CLOSE_BRACKET) {\n if (ctx.openBrackets > 0) {\n // An enclosing array is waiting for this bracket; close the object here\n // and leave the bracket for its owner.\n closeUnterminated(ctx, 'object', scanner.index);\n break;\n }\n dropStrayCloser(ctx);\n continue;\n }\n if (code === CH_COMMA) {\n // Leading or repeated commas carry no meaning between named members.\n ctx.record('removed-extra-comma', scanner.index);\n scanner.index += 1;\n continue;\n }\n\n if (!canStartKey(ctx, code)) {\n if (!ctx.options.aggressive) {\n ctx.fail(\n `Expected an object key, found ${describeChar(scanner.source, scanner.index)}`,\n scanner.index,\n );\n }\n ctx.record('removed-stray-token', scanner.index);\n scanner.index += 1;\n continue;\n }\n\n const slot = ctx.checkpoint(scanner.index);\n if (members > 0) {\n ctx.write(',');\n }\n\n if (parseMember(ctx) === 'dropped') {\n ctx.restore(slot);\n scanner.index = scanner.end;\n ctx.record('removed-incomplete-member', slot.index);\n closeUnterminated(ctx, 'object', slot.index);\n truncated = true;\n break;\n }\n\n members += 1;\n readSeparator(ctx);\n }\n\n ctx.write('}');\n ctx.openBraces -= 1;\n ctx.leave();\n\n if (mayDrop && truncated && !closed && members === 0) {\n // An opening brace and nothing else: the stream was cut before any content.\n ctx.restore(entry);\n scanner.index = scanner.end;\n return 'dropped';\n }\n return 'ok';\n}\n\n/** Parses `key : value`, writing both. */\nfunction parseMember(ctx: RepairContext): ParseStatus {\n const { scanner } = ctx;\n\n parseKey(ctx);\n skipTrivia(ctx);\n\n const afterKey = scanner.index;\n const next = scanner.peek();\n\n if (next === CH_EOF) {\n return 'dropped';\n }\n\n if (next === CH_COLON) {\n scanner.index += 1;\n } else if (next === CH_CLOSE_BRACE || next === CH_COMMA) {\n // A key with nothing after it: `{\"a\", \"b\": 1}`.\n if (!ctx.options.aggressive) {\n ctx.refuse('Object key has no value', afterKey);\n }\n ctx.record('added-missing-colon', afterKey);\n ctx.write(':null');\n ctx.record('added-missing-value', afterKey);\n return 'ok';\n } else if (isQuote(next)) {\n // `{\"a\" \"b\"}` could be a missing colon or a missing comma between two keys.\n if (!ctx.options.aggressive) {\n ctx.refuse('Expected \":\" between key and value', afterKey);\n }\n ctx.record('added-missing-colon', afterKey);\n } else {\n // `{\"a\" 1}` has only one reading: the colon was dropped.\n ctx.record('added-missing-colon', afterKey);\n }\n\n ctx.write(':');\n return parseValue(ctx, 'object-value', true);\n}\n\n/** Writes the object key at the cursor, quoting it if the input did not. */\nfunction parseKey(ctx: RepairContext): void {\n const { scanner } = ctx;\n const { source, end } = scanner;\n const start = scanner.index;\n const code = scanner.peek();\n\n if (isQuote(code)) {\n readString(ctx, 'object-key');\n return;\n }\n\n let index = start;\n if (isIdentifierStart(code)) {\n index += 1;\n while (index < end && isIdentifierPart(source.charCodeAt(index))) {\n index += 1;\n }\n } else {\n // Aggressive mode only: take everything up to the colon and trim it.\n index = scanBareKey(ctx, start);\n }\n\n writeQuotedSpan(ctx, start, index);\n ctx.record('quoted-key', start);\n scanner.index = index;\n}\n\n/** Reports whether `code` can begin an object key under the active options. */\nfunction canStartKey(ctx: RepairContext, code: number): boolean {\n if (isQuote(code)) {\n return code === CH_DOUBLE_QUOTE || ctx.options.allowSingleQuotes;\n }\n if (!ctx.options.allowUnquotedKeys) {\n return false;\n }\n if (isIdentifierStart(code)) {\n return true;\n }\n return ctx.options.aggressive && !isStructural(code);\n}\n\n/* ── Arrays ─────────────────────────────────────────────────────────────── */\n\nfunction parseArray(ctx: RepairContext, mayDrop: boolean): ParseStatus {\n const { scanner } = ctx;\n const openPosition = scanner.index;\n const entry = ctx.checkpoint(openPosition);\n\n scanner.index += 1;\n ctx.enter(openPosition);\n ctx.openBrackets += 1;\n ctx.write('[');\n\n let elements = 0;\n let closed = false;\n let truncated = false;\n let previousIndex = -1;\n\n for (;;) {\n skipTrivia(ctx);\n\n if (scanner.index === previousIndex) {\n ctx.fail('Parser made no progress', scanner.index);\n }\n previousIndex = scanner.index;\n\n const code = scanner.peek();\n\n if (code === CH_EOF) {\n closeUnterminated(ctx, 'array', scanner.index);\n truncated = true;\n break;\n }\n if (code === CH_CLOSE_BRACKET) {\n scanner.index += 1;\n closed = true;\n break;\n }\n if (code === CH_CLOSE_BRACE) {\n if (ctx.openBraces > 0) {\n closeUnterminated(ctx, 'array', scanner.index);\n break;\n }\n dropStrayCloser(ctx);\n continue;\n }\n if (code === CH_COMMA) {\n // An elided element. Unlike an extra comma between object members this\n // changes the array's length, so safe mode declines to guess.\n if (!ctx.options.aggressive) {\n ctx.refuse('Array element is missing', scanner.index);\n }\n if (elements > 0) {\n ctx.write(',');\n }\n ctx.write('null');\n ctx.record('added-missing-value', scanner.index);\n elements += 1;\n scanner.index += 1;\n continue;\n }\n\n const slot = ctx.checkpoint(scanner.index);\n if (elements > 0) {\n ctx.write(',');\n }\n\n if (parseValue(ctx, 'array-element', true) === 'dropped') {\n ctx.restore(slot);\n scanner.index = scanner.end;\n ctx.record('removed-incomplete-member', slot.index);\n closeUnterminated(ctx, 'array', slot.index);\n truncated = true;\n break;\n }\n\n elements += 1;\n readSeparator(ctx);\n }\n\n ctx.write(']');\n ctx.openBrackets -= 1;\n ctx.leave();\n\n if (mayDrop && truncated && !closed && elements === 0) {\n ctx.restore(entry);\n scanner.index = scanner.end;\n return 'dropped';\n }\n return 'ok';\n}\n\n/* ── Bare tokens ────────────────────────────────────────────────────────── */\n\n/** Emits an unquoted token as a literal, a number, or — aggressively — a string. */\nfunction parseBareValue(ctx: RepairContext, start: number, coreEnd: number): ParseStatus {\n const { scanner } = ctx;\n\n const literal = readLiteral(ctx, start, coreEnd);\n if (literal === 'emitted') {\n scanner.index = coreEnd;\n return 'ok';\n }\n if (literal === 'needs-aggressive') {\n ctx.refuse(`\"${scanner.slice(start, coreEnd)}\" is not a JSON literal`, start);\n }\n\n if (readNumber(ctx, start, coreEnd)) {\n scanner.index = coreEnd;\n return 'ok';\n }\n\n if (!ctx.options.aggressive) {\n ctx.refuse(`Unquoted value \"${scanner.slice(start, coreEnd)}\"`, start);\n }\n\n const valueEnd = extendBareValue(ctx, coreEnd);\n writeQuotedSpan(ctx, start, valueEnd);\n ctx.record('quoted-value', start);\n scanner.index = valueEnd;\n return 'ok';\n}\n\n/**\n * Scans an unquoted token: everything up to whitespace, a structural character,\n * a quote or the start of a comment.\n */\nfunction scanCoreToken(ctx: RepairContext, from: number): number {\n const { source, end } = ctx.scanner;\n const allowComments = ctx.options.allowComments;\n\n let index = from;\n while (index < end) {\n const code = source.charCodeAt(index);\n if (\n isWhitespace(code) ||\n isStructural(code) ||\n isQuote(code) ||\n startsComment(source, index, end, allowComments)\n ) {\n break;\n }\n index += 1;\n }\n return index;\n}\n\n/**\n * Extends an unquoted value across interior whitespace, so `{a: hello world}`\n * yields one value rather than two.\n *\n * Trailing whitespace is excluded, and the scan still stops at any structural\n * character, which keeps `[1 2]` two elements with a missing comma between them.\n */\nfunction extendBareValue(ctx: RepairContext, from: number): number {\n const { source, end } = ctx.scanner;\n const allowComments = ctx.options.allowComments;\n\n let index = from;\n let lastContent = from;\n while (index < end) {\n const code = source.charCodeAt(index);\n if (isStructural(code) || startsComment(source, index, end, allowComments)) {\n break;\n }\n if (!isWhitespace(code)) {\n lastContent = index + 1;\n }\n index += 1;\n }\n return lastContent;\n}\n\n/** Scans an unquoted key: everything up to the colon, trimmed. */\nfunction scanBareKey(ctx: RepairContext, from: number): number {\n const { source, end } = ctx.scanner;\n const allowComments = ctx.options.allowComments;\n\n let index = from;\n let lastContent = from + 1;\n while (index < end) {\n const code = source.charCodeAt(index);\n if (\n code === CH_COLON ||\n isStructural(code) ||\n startsComment(source, index, end, allowComments)\n ) {\n break;\n }\n if (!isWhitespace(code)) {\n lastContent = index + 1;\n }\n index += 1;\n }\n return lastContent;\n}\n\nfunction startsComment(\n source: string,\n index: number,\n end: number,\n allowComments: boolean,\n): boolean {\n if (!allowComments) {\n return false;\n }\n const code = source.charCodeAt(index);\n if (code === CH_HASH) {\n return true;\n }\n if (code !== CH_SLASH || index + 1 >= end) {\n return false;\n }\n const next = source.charCodeAt(index + 1);\n return next === CH_SLASH || next === CH_ASTERISK;\n}\n\n/** Renders one character for an error message. */\nfunction describeChar(source: string, index: number): string {\n const code = source.charCodeAt(index);\n if (Number.isNaN(code)) {\n return 'end of input';\n }\n if (code < 0x20 || code === 0x7f) {\n return `\"\\\\u${code.toString(16).padStart(4, '0')}\"`;\n }\n return `\"${source.charAt(index)}\"`;\n}\n","import type { RepairType } from '../types.js';\n\n/**\n * Human-readable description for each {@link RepairType}.\n *\n * Used as the default {@link RepairOperation.message} and rendered by the CLI's\n * `--explain` output. These strings are documentation, not contract: match on\n * {@link RepairType} instead.\n */\nconst MESSAGES: Record<RepairType, string> = {\n 'removed-byte-order-mark': 'Removed a leading byte order mark',\n 'extracted-json': 'Extracted JSON from surrounding text',\n 'removed-comment': 'Removed a comment',\n 'normalized-whitespace': 'Replaced whitespace that JSON does not allow between tokens',\n 'removed-trailing-comma': 'Removed a trailing comma',\n 'removed-extra-comma': 'Removed a redundant comma',\n 'removed-stray-token': 'Removed a closing bracket that matched nothing',\n 'removed-trailing-content': 'Removed content after the end of the JSON value',\n 'removed-incomplete-member': 'Removed a truncated final member',\n 'added-missing-comma': 'Inserted a missing comma',\n 'added-missing-colon': 'Inserted a missing colon',\n 'added-missing-value': 'Inserted null for a missing value',\n 'added-closing-brace': 'Closed an unterminated object',\n 'added-closing-bracket': 'Closed an unterminated array',\n 'normalized-quotes': 'Converted non-standard quotes to double quotes',\n 'normalized-literal': 'Rewrote a non-JSON literal',\n 'normalized-number': 'Rewrote a non-JSON number',\n 'quoted-key': 'Quoted an unquoted key',\n 'quoted-value': 'Quoted an unquoted value',\n 'escaped-character': 'Escaped a character that JSON forbids raw',\n 'fixed-escape': 'Corrected an invalid escape sequence',\n 'terminated-string-at-eof': 'Closed a string left open at end of input',\n 'terminated-string-at-newline':\n 'Closed a string at a line break, discarding the rest of the line',\n};\n\n/** Returns the default explanation for a repair type. */\nexport function describeRepair(type: RepairType): string {\n return MESSAGES[type];\n}\n","import { buildSnippet, JsonRepairError } from '../errors/JsonRepairError.js';\nimport type { ResolvedOptions } from '../options.js';\nimport { describeRepair } from '../repair/messages.js';\nimport type { Scanner } from '../scanner/scanner.js';\nimport { isWhitespace } from '../scanner/tokens.js';\nimport type { JsonRepairErrorCode, RepairOperation, RepairType } from '../types.js';\n\n/**\n * Multiplier bounding the total work spent on string-continuation lookahead.\n *\n * Each candidate closing quote may trigger a bounded probe. Without a global\n * cap, input engineered to contain hundreds of thousands of quote characters\n * would turn a linear parse into a quadratic one. The budget scales with the\n * input, so the parse stays O(n) by construction; once it is exhausted probes\n * degrade to plain JSON behaviour (accept the closing quote), which is\n * deterministic and never produces invalid output.\n */\nconst PROBE_BUDGET_FACTOR = 4;\n\n/** A point the parser can return to when a string turns out to be unterminated. */\nexport interface Checkpoint {\n /** Absolute offset to resume scanning from. */\n readonly index: number;\n /** Number of output chunks written at the time of the checkpoint. */\n readonly chunkCount: number;\n /** Number of repairs recorded at the time of the checkpoint. */\n readonly repairCount: number;\n}\n\n/**\n * Mutable state shared by the parser and every repair rule: the output being\n * built, the repair log, the depth counters and the resource budgets.\n *\n * One context serves exactly one parse attempt. The candidate loop in\n * `repair.ts` builds a fresh context per attempt, so a failed attempt can never\n * leak repairs or partial output into the next one.\n */\nexport class RepairContext {\n readonly scanner: Scanner;\n readonly options: ResolvedOptions;\n\n /** Repairs applied so far, in the order they were discovered. */\n readonly repairs: RepairOperation[] = [];\n\n /** Pieces of the output, joined once at the end. */\n private readonly chunks: string[] = [];\n\n /** Current nesting depth. */\n private depth = 0;\n\n /** Open `{` containers, used for O(1) stray-closer classification. */\n openBraces = 0;\n\n /** Open `[` containers, used for O(1) stray-closer classification. */\n openBrackets = 0;\n\n /** Remaining lookahead budget; see {@link PROBE_BUDGET_FACTOR}. */\n probeBudget: number;\n\n /**\n * Highest offset the parser has already rewound to.\n *\n * Rewinding is only ever allowed to move forward, which guarantees the parse\n * cannot loop between two readings of the same unterminated string.\n */\n lastRewind = -1;\n\n constructor(scanner: Scanner, options: ResolvedOptions) {\n this.scanner = scanner;\n this.options = options;\n this.probeBudget = (scanner.end - scanner.start) * PROBE_BUDGET_FACTOR;\n }\n\n /* ── Output ───────────────────────────────────────────────────────────── */\n\n /** Appends literal text to the output. */\n write(text: string): void {\n this.chunks.push(text);\n }\n\n /**\n * Appends a span of the original input verbatim.\n *\n * Copying spans rather than characters keeps the number of output chunks\n * proportional to the number of tokens, not to the length of the input.\n */\n writeSpan(from: number, to: number): void {\n if (to > from) {\n this.chunks.push(this.scanner.slice(from, to));\n }\n }\n\n /** Concatenates everything written so far. */\n output(): string {\n return this.chunks.join('');\n }\n\n /* ── Checkpoints ──────────────────────────────────────────────────────── */\n\n /** Captures the current output, repair log and cursor for a later rewind. */\n checkpoint(index: number): Checkpoint {\n return { index, chunkCount: this.chunks.length, repairCount: this.repairs.length };\n }\n\n /**\n * Reports whether the parser may rewind to `checkpoint`.\n *\n * Refusing a backwards rewind is what makes the unterminated-string heuristic\n * terminating: every rewind strictly advances the furthest point already\n * reconsidered.\n */\n canRewindTo(checkpoint: Checkpoint): boolean {\n return checkpoint.index > this.lastRewind;\n }\n\n /**\n * Returns the parser to `checkpoint`, discarding the output written and the\n * repairs recorded since it was taken, and marks the point as reconsidered.\n *\n * Truncating the repair log matters: without it, a rewound attempt would\n * report repairs that are not present in the text it finally emits.\n */\n rewindTo(checkpoint: Checkpoint): void {\n this.restore(checkpoint);\n this.lastRewind = checkpoint.index;\n }\n\n /**\n * Returns the parser to `checkpoint` without marking it as reconsidered.\n *\n * Used to un-write a construct the parser decided to drop rather than re-read\n * — a member truncated by a cut-off stream, for instance. Unlike\n * {@link rewindTo} these restores never re-scan the same text, so they cannot\n * loop and must not consume the rewind budget.\n */\n restore(checkpoint: Checkpoint): void {\n this.chunks.length = checkpoint.chunkCount;\n this.repairs.length = checkpoint.repairCount;\n this.scanner.index = checkpoint.index;\n }\n\n /**\n * Absolute offset of the last non-whitespace character in the region, or\n * `-1` if there is none.\n *\n * Computed once per parse. Recomputing it per token would make input such as\n * half a megabyte of `}` quadratic, which is precisely the shape an attacker\n * would send.\n */\n get lastContentIndex(): number {\n if (this.lastContentCache === -2) {\n this.lastContentCache = findLastContent(\n this.scanner.source,\n this.scanner.start,\n this.scanner.end,\n );\n }\n return this.lastContentCache;\n }\n\n private lastContentCache = -2;\n\n /* ── Repair log ───────────────────────────────────────────────────────── */\n\n /**\n * Records a repair at an absolute offset in the original input.\n *\n * @throws {JsonRepairError} `MAX_REPAIRS_EXCEEDED` once the budget is spent.\n */\n record(type: RepairType, position: number, message?: string): void {\n if (this.repairs.length >= this.options.maxRepairs) {\n throw this.error(\n 'MAX_REPAIRS_EXCEEDED',\n `Input needs more than ${this.options.maxRepairs} repairs.`,\n position,\n );\n }\n\n const { line, column } = this.scanner.positionAt(position);\n this.repairs.push({\n type,\n position,\n line,\n column,\n message: message ?? describeRepair(type),\n });\n }\n\n /* ── Depth ────────────────────────────────────────────────────────────── */\n\n /**\n * Enters a nested container.\n *\n * @throws {JsonRepairError} `MAX_DEPTH_EXCEEDED` beyond the configured depth.\n */\n enter(position: number): void {\n this.depth += 1;\n if (this.depth > this.options.maxDepth) {\n throw this.error(\n 'MAX_DEPTH_EXCEEDED',\n `Input nests deeper than the configured maximum of ${this.options.maxDepth}.`,\n position,\n );\n }\n }\n\n /** Leaves a nested container. */\n leave(): void {\n this.depth -= 1;\n }\n\n /* ── Failure ──────────────────────────────────────────────────────────── */\n\n /** Builds a positioned error without throwing it. */\n error(code: JsonRepairErrorCode, message: string, position: number): JsonRepairError {\n const { line, column } = this.scanner.positionAt(position);\n return new JsonRepairError(code, `${message} (line ${line}, column ${column})`, {\n position,\n line,\n column,\n snippet: buildSnippet(this.scanner.source, position),\n });\n }\n\n /**\n * Aborts the attempt because the input cannot be read as JSON at all.\n *\n * @throws {JsonRepairError} `UNREPAIRABLE_JSON`.\n */\n fail(message: string, position: number): never {\n throw this.error('UNREPAIRABLE_JSON', message, position);\n }\n\n /**\n * Aborts the attempt because safe mode declines to choose between readings.\n *\n * Callers reach this only when `mode: 'aggressive'` has a defined answer, so\n * the message always points at the escape hatch.\n *\n * @throws {JsonRepairError} `AMBIGUOUS_REPAIR`.\n */\n refuse(message: string, position: number): never {\n throw this.error(\n 'AMBIGUOUS_REPAIR',\n `${message}; retry with mode: \"aggressive\" to apply a best-effort repair.`,\n position,\n );\n }\n}\n\n/** Returns the offset of the last non-whitespace character in a region, or `-1`. */\nfunction findLastContent(source: string, start: number, end: number): number {\n for (let index = end - 1; index >= start; index -= 1) {\n if (!isWhitespace(source.charCodeAt(index))) {\n return index;\n }\n }\n return -1;\n}\n","import {\n CH_BACKTICK,\n CH_LINE_FEED,\n CH_OPEN_BRACE,\n CH_OPEN_BRACKET,\n CH_SPACE,\n CH_TAB,\n isLineBreak,\n isWhitespace,\n toLowerAscii,\n} from '../scanner/tokens.js';\n\n/** Tilde, the alternative Markdown fence character. */\nconst CH_TILDE = 0x7e;\n\n/** Shortest run of `` ` `` or `~` that opens a fenced block. */\nconst MIN_FENCE_LENGTH = 3;\n\n/** Deepest indentation a fence may carry and still open a block. */\nconst MAX_FENCE_INDENT = 3;\n\n/** A fenced code block found in the input. */\nexport interface Fence {\n /** First offset of the block's content. */\n bodyStart: number;\n /** Offset one past the block's content. */\n bodyEnd: number;\n /** Whether the info string names a JSON dialect. */\n jsonTagged: boolean;\n}\n\n/**\n * Finds Markdown fenced code blocks, in document order.\n *\n * Written as a linear character scan rather than a pattern match. A regular\n * expression over untrusted, unbounded text is exactly the shape that\n * backtracks catastrophically, and the whole package is built to stay linear on\n * hostile input.\n *\n * A block that is never closed — the usual result of a response hitting its\n * token limit — runs to the end of the input, which is what makes truncated\n * fenced output recoverable.\n */\nexport function scanFences(source: string, start: number, end: number): Fence[] {\n const fences: Fence[] = [];\n\n let lineStart = start;\n while (lineStart < end) {\n const lineEnd = findLineEnd(source, lineStart, end);\n const marker = readFenceMarker(source, lineStart, lineEnd);\n\n if (marker === undefined) {\n lineStart = nextLineStart(source, lineEnd, end);\n continue;\n }\n\n const bodyStart = nextLineStart(source, lineEnd, end);\n const closing = findClosingFence(source, bodyStart, end, marker.char, marker.length);\n\n fences.push({\n bodyStart,\n bodyEnd: closing.bodyEnd,\n jsonTagged: isJsonInfoString(source, marker.infoStart, lineEnd),\n });\n\n lineStart = closing.next;\n }\n\n return fences;\n}\n\n/**\n * Collects the offsets of every `{` and `[` in a region, in document order.\n *\n * These are only *candidate* starts. Nothing here tries to decide where a value\n * ends or whether a brace sits inside a string — that is the parser's job, and\n * duplicating it with a second, weaker notion of \"string\" is how extraction\n * silently truncates values such as `{'note': 'use } to close', 'n': 2}`.\n */\nexport function findValueStarts(\n source: string,\n start: number,\n end: number,\n limit: number,\n): number[] {\n const starts: number[] = [];\n\n for (let index = start; index < end && starts.length < limit; index += 1) {\n const code = source.charCodeAt(index);\n if (code === CH_OPEN_BRACE || code === CH_OPEN_BRACKET) {\n starts.push(index);\n }\n }\n\n return starts;\n}\n\n/** Returns the first non-whitespace offset at or after `start`, or `end`. */\nexport function skipLeadingWhitespace(source: string, start: number, end: number): number {\n let index = start;\n while (index < end && isWhitespace(source.charCodeAt(index))) {\n index += 1;\n }\n return index;\n}\n\n/** Returns the offset one past the last non-whitespace character before `end`. */\nexport function trimTrailingWhitespace(source: string, start: number, end: number): number {\n let index = end;\n while (index > start && isWhitespace(source.charCodeAt(index - 1))) {\n index -= 1;\n }\n return index;\n}\n\ninterface FenceMarker {\n char: number;\n length: number;\n infoStart: number;\n}\n\n/** Reads an opening fence marker from a line, if the line is one. */\nfunction readFenceMarker(\n source: string,\n lineStart: number,\n lineEnd: number,\n): FenceMarker | undefined {\n let index = lineStart;\n let indent = 0;\n while (index < lineEnd && indent <= MAX_FENCE_INDENT) {\n const code = source.charCodeAt(index);\n if (code !== CH_SPACE && code !== CH_TAB) {\n break;\n }\n indent += 1;\n index += 1;\n }\n\n if (index >= lineEnd || indent > MAX_FENCE_INDENT) {\n return undefined;\n }\n\n const char = source.charCodeAt(index);\n if (char !== CH_BACKTICK && char !== CH_TILDE) {\n return undefined;\n }\n\n const runStart = index;\n while (index < lineEnd && source.charCodeAt(index) === char) {\n index += 1;\n }\n\n const length = index - runStart;\n return length >= MIN_FENCE_LENGTH ? { char, length, infoStart: index } : undefined;\n}\n\n/** Locates the fence that closes a block, or the end of the input. */\nfunction findClosingFence(\n source: string,\n bodyStart: number,\n end: number,\n char: number,\n length: number,\n): { bodyEnd: number; next: number } {\n let lineStart = bodyStart;\n\n while (lineStart < end) {\n const lineEnd = findLineEnd(source, lineStart, end);\n const marker = readFenceMarker(source, lineStart, lineEnd);\n\n if (marker?.char === char && marker.length >= length) {\n return { bodyEnd: lineStart, next: nextLineStart(source, lineEnd, end) };\n }\n\n lineStart = nextLineStart(source, lineEnd, end);\n }\n\n return { bodyEnd: end, next: end };\n}\n\n/** Reports whether a fence's info string names a JSON dialect. */\nfunction isJsonInfoString(source: string, from: number, lineEnd: number): boolean {\n let index = from;\n while (index < lineEnd && isWhitespace(source.charCodeAt(index))) {\n index += 1;\n }\n\n const wordStart = index;\n while (index < lineEnd) {\n const code = toLowerAscii(source.charCodeAt(index));\n if (code < 0x30 || (code > 0x39 && code < 0x61) || code > 0x7a) {\n break;\n }\n index += 1;\n }\n\n const length = index - wordStart;\n if (length < 4 || length > 5) {\n return false;\n }\n if (\n toLowerAscii(source.charCodeAt(wordStart)) !== 0x6a /* j */ ||\n toLowerAscii(source.charCodeAt(wordStart + 1)) !== 0x73 /* s */ ||\n toLowerAscii(source.charCodeAt(wordStart + 2)) !== 0x6f /* o */ ||\n toLowerAscii(source.charCodeAt(wordStart + 3)) !== 0x6e /* n */\n ) {\n return false;\n }\n if (length === 4) {\n return true;\n }\n const suffix = toLowerAscii(source.charCodeAt(wordStart + 4));\n return suffix === 0x63 /* jsonc */ || suffix === 0x35; /* json5 */\n}\n\n/** Returns the offset of the line break that ends the line starting at `from`. */\nfunction findLineEnd(source: string, from: number, end: number): number {\n let index = from;\n while (index < end && !isLineBreak(source.charCodeAt(index))) {\n index += 1;\n }\n return index;\n}\n\n/** Returns the offset at which the line after `lineEnd` begins. */\nfunction nextLineStart(source: string, lineEnd: number, end: number): number {\n if (lineEnd >= end) {\n return end;\n }\n let index = lineEnd + 1;\n if (\n source.charCodeAt(lineEnd) !== CH_LINE_FEED &&\n index < end &&\n source.charCodeAt(index) === CH_LINE_FEED\n ) {\n index += 1;\n }\n return index;\n}\n","import { createError, isJsonRepairError, type JsonRepairError } from './errors/JsonRepairError.js';\nimport { assertInputLength, assertString } from './limits.js';\nimport { parseJsonStrict } from './native.js';\nimport {\n resolveExtractOptions,\n withMode,\n type ResolvedOptions,\n type SelectStrategy,\n} from './options.js';\nimport { parseDocument } from './parser/parser.js';\nimport { RepairContext } from './parser/state.js';\nimport {\n findValueStarts,\n scanFences,\n skipLeadingWhitespace,\n trimTrailingWhitespace,\n} from './repair/markdown.js';\nimport { Scanner } from './scanner/scanner.js';\nimport {\n CH_BACKSLASH,\n CH_BOM,\n CH_CLOSE_BRACE,\n CH_CLOSE_BRACKET,\n CH_DOT,\n CH_MINUS,\n CH_OPEN_BRACE,\n CH_OPEN_BRACKET,\n CH_PLUS,\n isDigit,\n isQuote,\n toLowerAscii,\n} from './scanner/tokens.js';\nimport type { ExtractOptions, RepairOperation } from './types.js';\n\n/**\n * Largest number of candidate starts collected from a single region.\n *\n * Prose that happens to contain hundreds of braces is far more likely to be a\n * code sample than a hundred JSON payloads, and every extra candidate is a\n * potential extra parse. The cap keeps a pathological document from turning\n * extraction into a quadratic scan.\n */\nconst MAX_CANDIDATES = 256;\n\n/**\n * Largest number of candidates that may fail before extraction gives up.\n *\n * Successful candidates are disjoint — each one advances a barrier past its own\n * end — so successes cost O(n) in total no matter how many there are. Only\n * failures can re-scan the same text, so only failures need a budget.\n */\nconst MAX_FAILED_ATTEMPTS = 32;\n\n/** A region of the input that might hold a JSON value. */\nexport interface Candidate {\n /** Offset of the first character to parse. */\n start: number;\n /** Offset the parser may not read past. */\n limit: number;\n}\n\n/** A candidate that parsed and validated successfully. */\nexport interface Attempt {\n /** Offset of the candidate's first character in the original input. */\n start: number;\n /** Offset one past the last character the parser consumed. */\n end: number;\n /** Valid JSON text for this candidate. */\n json: string;\n /** The value {@link Attempt.json} parses to, reused by `parseJson`. */\n value: unknown;\n /** Changes applied while parsing this candidate. */\n repairs: RepairOperation[];\n}\n\n/**\n * Extracts the first — by default the best — JSON value embedded in a larger\n * document, and returns it **exactly as it appears in the input**.\n *\n * The text is returned verbatim rather than repaired, which keeps extraction\n * lossless: whitespace, key order and number formatting all survive. A\n * candidate still has to be repairable to be selected, and the default `best`\n * strategy prefers the longest one, so a decoy such as the `[1]` in \"see [1]\n * for details\" loses to a real payload beside it even though the decoy is\n * already valid and the payload needs work. The returned string may itself need\n * repairing before `JSON.parse` will take it.\n *\n * @throws {JsonRepairError} `INVALID_INPUT`, `MAX_LENGTH_EXCEEDED` or\n * `NO_JSON_FOUND` when no candidate could be repaired.\n */\nexport function extractJson(input: string, options?: ExtractOptions): string {\n const resolved = resolveExtractOptions(options);\n const region = prepare(input, resolved);\n const attempts = solve(input, region.start, region.end, resolved);\n const chosen = rankAttempts(attempts, resolved.select);\n\n return input.slice(chosen.start, chosen.end);\n}\n\n/**\n * Extracts every JSON value embedded in a document, in document order, each\n * returned verbatim as it appears in the input.\n *\n * Values nested inside an already-extracted value are not reported separately,\n * so a document containing `[{\"a\":1}]` yields the array, not the array and then\n * its element.\n *\n * Returns an empty array when the document holds no repairable JSON. Unlike\n * {@link extractJson} this never throws `NO_JSON_FOUND`, because \"nothing here\"\n * is an ordinary answer when the caller asked for everything.\n *\n * @throws {JsonRepairError} `INVALID_INPUT` or `MAX_LENGTH_EXCEEDED`.\n */\nexport function extractAllJson(input: string, options?: ExtractOptions): string[] {\n const resolved = resolveExtractOptions(options);\n const region = prepare(input, resolved);\n\n let attempts: Attempt[];\n try {\n attempts = solve(input, region.start, region.end, resolved);\n } catch (error) {\n if (isJsonRepairError(error) && error.code === 'NO_JSON_FOUND') {\n return [];\n }\n throw error;\n }\n\n return attempts.map((attempt) => input.slice(attempt.start, attempt.end));\n}\n\n/**\n * Validates the input and locates the region to scan.\n *\n * A leading byte order mark is excluded from the region rather than stripped, so\n * that every offset the engine reports still refers to the caller's own string.\n */\nexport function prepare(input: string, options: ResolvedOptions): { start: number; end: number } {\n assertString(input, 'input');\n assertInputLength(input, options.maxLength);\n\n return {\n start: input.length > 0 && input.charCodeAt(0) === CH_BOM ? 1 : 0,\n end: input.length,\n };\n}\n\n/**\n * Finds every JSON value in a region, trying safe repairs before aggressive\n * ones.\n *\n * The two-phase order matters for documents that mix prose and JSON. Given\n * `[2024-01-01 12:00:00] {\"level\":\"info\"}`, an aggressive-only pass would happily\n * quote the bare timestamp and return the leading bracket group. Running safe\n * mode across every candidate first means the real object wins, and the\n * aggressive pass only runs when nothing at all parsed cleanly.\n *\n * @returns Successful attempts in document order; never empty.\n * @throws {JsonRepairError} The most relevant failure, or `NO_JSON_FOUND`.\n */\nexport function solve(\n source: string,\n start: number,\n end: number,\n options: ResolvedOptions,\n): Attempt[] {\n const tiers = buildCandidateTiers(source, start, end, options);\n\n const safe = collectAttempts(source, tiers, withMode(options, 'safe'));\n if (safe.attempts.length > 0) {\n return safe.attempts;\n }\n\n if (!options.aggressive) {\n throw safe.error ?? noJsonFound(source, start);\n }\n\n const loose = collectAttempts(source, tiers, options);\n if (loose.attempts.length > 0) {\n return loose.attempts;\n }\n\n throw loose.error ?? safe.error ?? noJsonFound(source, start);\n}\n\n/**\n * Groups candidate starts into tiers, most trustworthy first.\n *\n * Tiers are tried in order and the first one that yields any result wins, which\n * encodes an ordering of evidence: text a model deliberately tagged as JSON\n * beats text merely fenced as code, which beats a brace found loose in prose.\n * Without the tiering, a `{` inside an English sentence would compete on equal\n * terms with the payload the caller actually wants.\n *\n * Fence candidates are bounded by the fence body, so an unterminated string\n * inside a fenced block stops at the closing fence instead of swallowing the\n * rest of the document.\n */\nexport function buildCandidateTiers(\n source: string,\n start: number,\n end: number,\n options: ResolvedOptions,\n): Candidate[][] {\n const whole = wholeRegionCandidate(source, start, end);\n\n if (!options.extract) {\n return whole === undefined ? [] : [[whole]];\n }\n\n const tagged: Candidate[] = [];\n const fenced: Candidate[] = [];\n\n for (const fence of scanFences(source, start, end)) {\n const target = fence.jsonTagged ? tagged : fenced;\n const starts = findValueStarts(source, fence.bodyStart, fence.bodyEnd, MAX_CANDIDATES);\n\n for (const offset of starts) {\n target.push({ start: offset, limit: fence.bodyEnd });\n }\n\n if (starts.length === 0) {\n // A fence may hold a top-level scalar, such as a bare quoted string.\n const body = wholeRegionCandidate(source, fence.bodyStart, fence.bodyEnd);\n if (body !== undefined) {\n target.push(body);\n }\n }\n }\n\n const bare: Candidate[] = findValueStarts(source, start, end, MAX_CANDIDATES).map((offset) => ({\n start: offset,\n limit: end,\n }));\n\n const tiers: Candidate[][] = [];\n for (const tier of [tagged, fenced, bare]) {\n if (tier.length > 0) {\n tiers.push(tier);\n }\n }\n // The whole region is the last resort, for a document that is nothing but a\n // top-level scalar. It is gated on the region actually looking like a value:\n // without the gate, ordinary prose reaches the parser and fails with a\n // syntax-level complaint about its first word, when the honest answer to\n // \"find me the JSON in this text\" is that there is none.\n if (whole !== undefined && startsJsonValue(source, whole.start, end)) {\n tiers.push([whole]);\n }\n\n return tiers;\n}\n\n/** Literal words a JSON-ish document may open with, lower case. */\nconst VALUE_WORDS = ['true', 'false', 'null', 'nan', 'none', 'infinity', 'undefined'];\n\n/** Reports whether a region plausibly begins a JSON value. */\nfunction startsJsonValue(source: string, from: number, end: number): boolean {\n const code = source.charCodeAt(from);\n\n if (\n code === CH_OPEN_BRACE ||\n code === CH_OPEN_BRACKET ||\n code === CH_MINUS ||\n code === CH_PLUS ||\n code === CH_DOT ||\n isDigit(code) ||\n isQuote(code)\n ) {\n return true;\n }\n\n return VALUE_WORDS.some((word) => matchesWord(source, from, end, word));\n}\n\n/** Reports whether `word` appears at `from`, compared without case or locale. */\nfunction matchesWord(source: string, from: number, end: number, word: string): boolean {\n if (from + word.length > end) {\n return false;\n }\n for (let index = 0; index < word.length; index += 1) {\n if (toLowerAscii(source.charCodeAt(from + index)) !== word.charCodeAt(index)) {\n return false;\n }\n }\n return true;\n}\n\n/**\n * Runs a tier at a time until one produces results.\n *\n * Within a tier, candidates are tried in document order and a success advances a\n * barrier past its own end, so nested values are skipped rather than reported\n * twice. The failure budget is shared across tiers because it exists to bound\n * total work, not work per tier.\n */\nfunction collectAttempts(\n source: string,\n tiers: readonly Candidate[][],\n options: ResolvedOptions,\n): { attempts: Attempt[]; error: JsonRepairError | undefined } {\n let firstError: JsonRepairError | undefined;\n let failures = 0;\n\n for (const tier of tiers) {\n const attempts: Attempt[] = [];\n let barrier = -1;\n\n for (const candidate of tier) {\n if (candidate.start < barrier) {\n continue;\n }\n if (failures >= MAX_FAILED_ATTEMPTS) {\n break;\n }\n\n let attempt: Attempt;\n try {\n attempt = tryCandidate(source, candidate, options);\n } catch (error) {\n if (!isJsonRepairError(error)) {\n // Anything other than a JsonRepairError is a defect in this package,\n // not a property of the input. Surfacing it beats hiding it behind a\n // generic \"no JSON found\".\n throw error;\n }\n failures += 1;\n firstError ??= error;\n // Everything inside the container this candidate opened is a fragment\n // of it, not a document in its own right. Without this the array in\n // `{\"a\": None, \"b\": [1, 2]}` would be accepted the moment the object\n // around it failed, quietly returning a piece of the input as if it\n // were the whole answer.\n barrier = Math.max(barrier, findStructuralEnd(source, candidate.start, candidate.limit));\n continue;\n }\n\n attempts.push(attempt);\n barrier = Math.max(barrier, attempt.end);\n }\n\n if (attempts.length > 0) {\n return { attempts, error: undefined };\n }\n }\n\n return { attempts: [], error: firstError };\n}\n\n/**\n * Finds where the container opened at `start` ends, by matching brackets.\n *\n * This is a balance scan, not a parse: it only has to answer \"which later\n * candidate starts are inside this one\", and it has to answer it for input the\n * parser has already rejected. Quoted text is skipped so a brace inside a\n * string cannot move the answer, and all three quote characters the repairer\n * accepts count as quotes here for the same reason.\n *\n * Closers are matched against the open containers rather than merely counted,\n * mirroring what the parser itself does with a mismatched closer: one that\n * matches an outer frame closes the frames between, and one that matches\n * nothing on the stack is stray and ignored. Plain counting would let the `]`\n * in `{] \"b\": [1,2]}` cancel the opening brace, put the barrier two characters\n * in, and hand the caller the inner `[1,2]` as if it were the document.\n *\n * @returns the offset one past the matching closer, or `end` when the container\n * is never closed — in which case everything that follows really is inside it.\n */\nfunction findStructuralEnd(source: string, start: number, end: number): number {\n // Bounded by the structural-depth precheck, which runs over the whole input\n // before any candidate is tried, so this cannot grow with the input length.\n const open: number[] = [];\n\n for (let index = start; index < end; index += 1) {\n const code = source.charCodeAt(index);\n\n if (isQuote(code)) {\n index += 1;\n while (index < end) {\n const inner = source.charCodeAt(index);\n if (inner === CH_BACKSLASH) {\n index += 1;\n } else if (inner === code) {\n break;\n }\n index += 1;\n }\n continue;\n }\n\n if (code === CH_OPEN_BRACE || code === CH_OPEN_BRACKET) {\n open.push(code);\n continue;\n }\n\n if (code !== CH_CLOSE_BRACE && code !== CH_CLOSE_BRACKET) {\n continue;\n }\n\n const opener = code === CH_CLOSE_BRACE ? CH_OPEN_BRACE : CH_OPEN_BRACKET;\n const frame = open.lastIndexOf(opener);\n if (frame < 0) {\n // Stray closer: nothing it could be closing is open.\n continue;\n }\n\n open.length = frame;\n if (open.length === 0) {\n return index + 1;\n }\n }\n\n return end;\n}\n\n/** Parses one candidate and validates the result. */\nfunction tryCandidate(source: string, candidate: Candidate, options: ResolvedOptions): Attempt {\n const scanner = new Scanner(source, candidate.start, candidate.limit);\n const context = new RepairContext(scanner, options);\n\n parseDocument(context);\n\n const end = scanner.index;\n const { repairs } = context;\n\n if (repairs.length === 0) {\n // Nothing was repaired, so the source text is already valid JSON. Returning\n // it untouched preserves the author's formatting instead of silently\n // reflowing a pretty-printed payload into a single line.\n const slice = source.slice(candidate.start, end);\n const parsed = tryParse(slice);\n if (parsed !== undefined) {\n return { start: candidate.start, end, json: slice, value: parsed.value, repairs };\n }\n }\n\n const json = context.output();\n const parsed = tryParse(json);\n if (parsed === undefined) {\n throw createError(\n 'UNREPAIRABLE_JSON',\n 'The repaired output is not valid JSON. This is a defect in @nexkit/json-repair; ' +\n 'please report it along with the input that triggered it.',\n source,\n candidate.start,\n );\n }\n\n return { start: candidate.start, end, json, value: parsed.value, repairs };\n}\n\n/**\n * Chooses one attempt from a set of successful ones.\n *\n * Attempts arrive in document order, and every comparison below is strict, so\n * ties always resolve to the earliest candidate. That is what makes the choice\n * deterministic rather than dependent on iteration order.\n */\nexport function rankAttempts(attempts: readonly Attempt[], select: SelectStrategy): Attempt {\n const first = attempts[0];\n if (first === undefined) {\n throw new Error('rankAttempts requires at least one attempt');\n }\n\n if (select === 'first') {\n return first;\n }\n if (select === 'last') {\n return attempts[attempts.length - 1]!;\n }\n\n let best = first;\n for (let index = 1; index < attempts.length; index += 1) {\n const attempt = attempts[index]!;\n if (select === 'largest' ? isLarger(attempt, best) : isBetter(attempt, best)) {\n best = attempt;\n }\n }\n\n return best;\n}\n\n/**\n * Longest span wins; among equal spans, fewest repairs wins.\n *\n * Span has to dominate. A document's real payload is the big thing in it, while\n * a decoy — the `[1]` of \"see [1] for details\", or an array nested inside an\n * object that needed one fix — is small and frequently already valid on its\n * own. Ranking by repair count first would hand the caller the decoy and\n * silently drop the payload, which is the one failure mode worse than throwing.\n */\nfunction isBetter(attempt: Attempt, best: Attempt): boolean {\n const span = attempt.end - attempt.start;\n const bestSpan = best.end - best.start;\n if (span !== bestSpan) {\n return span > bestSpan;\n }\n return attempt.repairs.length < best.repairs.length;\n}\n\n/** Longest span wins. */\nfunction isLarger(attempt: Attempt, best: Attempt): boolean {\n return attempt.end - attempt.start > best.end - best.start;\n}\n\n/** Wraps a whole region as a single candidate, or `undefined` if it is blank. */\nfunction wholeRegionCandidate(source: string, start: number, end: number): Candidate | undefined {\n const from = skipLeadingWhitespace(source, start, end);\n const to = trimTrailingWhitespace(source, from, end);\n\n return from < to ? { start: from, limit: end } : undefined;\n}\n\n/** Parses text without letting a `SyntaxError` escape. */\nfunction tryParse(text: string): { value: unknown } | undefined {\n try {\n return { value: parseJsonStrict(text) };\n } catch {\n return undefined;\n }\n}\n\n/** Builds the error used when a document holds nothing repairable. */\nfunction noJsonFound(source: string, position: number): JsonRepairError {\n return createError('NO_JSON_FOUND', 'No JSON value was found in the input.', source, position);\n}\n","import { createError } from './errors/JsonRepairError.js';\nimport { prepare, rankAttempts, solve, type Attempt } from './extract.js';\nimport { assertStructuralDepth } from './limits.js';\nimport { parseJsonStrict } from './native.js';\nimport { resolveOptions, type ResolvedOptions } from './options.js';\nimport { describeRepair } from './repair/messages.js';\nimport { Scanner } from './scanner/scanner.js';\nimport { isJsonWhitespace, isWhitespace } from './scanner/tokens.js';\nimport type { RepairOperation, RepairOptions, RepairResult, RepairType } from './types.js';\n\n/**\n * A {@link RepairResult} plus the parsed value, which the validation stage has\n * already produced. Keeping it lets `parseJson` avoid a second full parse.\n */\nexport interface RepairOutcome extends RepairResult {\n value: unknown;\n}\n\n/**\n * Repairs malformed JSON and returns valid JSON text.\n *\n * Input that is already valid JSON is returned byte for byte, so this is safe to\n * call unconditionally on data that is usually fine.\n *\n * @throws {JsonRepairError} `INVALID_INPUT`, `NO_JSON_FOUND`, `UNREPAIRABLE_JSON`,\n * `AMBIGUOUS_REPAIR`, `MAX_LENGTH_EXCEEDED`, `MAX_DEPTH_EXCEEDED` or\n * `MAX_REPAIRS_EXCEEDED`.\n */\nexport function repairJson(\n input: string,\n options?: RepairOptions & { returnMetadata?: false },\n): string;\n/**\n * Repairs malformed JSON and reports what was changed.\n *\n * @throws {JsonRepairError} See the string-returning overload.\n */\nexport function repairJson(\n input: string,\n options: RepairOptions & { returnMetadata: true },\n): RepairResult;\nexport function repairJson(input: string, options?: RepairOptions): string | RepairResult;\nexport function repairJson(input: string, options?: RepairOptions): string | RepairResult {\n const resolved = resolveOptions(options);\n const outcome = repairInternal(input, resolved);\n\n if (!resolved.returnMetadata) {\n return outcome.json;\n }\n\n return { json: outcome.json, changed: outcome.changed, repairs: outcome.repairs };\n}\n\n/**\n * The full repair pipeline, shared by every public entry point.\n *\n * The stages are ordered so that the cheapest one that can settle the question\n * runs first: reject bad input, try `JSON.parse` unchanged, and only then start\n * scanning.\n */\nexport function repairInternal(input: string, options: ResolvedOptions): RepairOutcome {\n const region = prepare(input, options);\n const fast = tryFastPath(input, region.start, options);\n if (fast !== undefined) {\n return fast;\n }\n\n const attempts = solve(input, region.start, region.end, options);\n const chosen = rankAttempts(attempts, 'best');\n\n const repairs = buildRepairLog(input, region, chosen);\n if (repairs.length > options.maxRepairs) {\n throw createError(\n 'MAX_REPAIRS_EXCEEDED',\n `Repairing this input required ${repairs.length} changes, which exceeds the maximum of ${options.maxRepairs}.`,\n input,\n chosen.start,\n );\n }\n\n return {\n json: chosen.json,\n changed: chosen.json !== input,\n repairs,\n value: chosen.value,\n };\n}\n\n/**\n * Returns the input unchanged when it is already valid JSON.\n *\n * This is what keeps the package cheap to adopt: a caller can pipe every payload\n * through `repairJson` and pay one `JSON.parse` for the ones that were fine all\n * along, with a guarantee that valid input is never reformatted.\n *\n * A byte order mark is the one thing removed here. It is invisible, it makes\n * `JSON.parse` throw, and no caller has ever meant to keep it.\n *\n * @returns `undefined` when the input is not valid JSON, so the caller can fall\n * through to the repairing parser.\n */\nfunction tryFastPath(\n input: string,\n regionStart: number,\n options: ResolvedOptions,\n): RepairOutcome | undefined {\n const text = regionStart > 0 ? input.slice(regionStart) : input;\n\n let value: unknown;\n try {\n value = parseJsonStrict(text);\n } catch {\n // Not valid JSON, or valid but nested past what the host parser tolerates.\n // Either way the repairing parser is the right next step, and it enforces\n // `maxDepth` itself.\n return undefined;\n }\n\n // Deliberately outside the `try`, so a depth rejection propagates to the\n // caller instead of being mistaken for a parse failure.\n assertStructuralDepth(input, regionStart, input.length, options.maxDepth);\n\n const repairs: RepairOperation[] =\n regionStart > 0 ? [operation(new Scanner(input), 'removed-byte-order-mark', 0)] : [];\n\n if (repairs.length > options.maxRepairs) {\n throw createError(\n 'MAX_REPAIRS_EXCEEDED',\n `Removing the byte order mark exceeds the maximum of ${options.maxRepairs} repairs.`,\n input,\n 0,\n );\n }\n\n return { json: text, changed: regionStart > 0, repairs, value };\n}\n\n/**\n * Assembles the final repair log in ascending position order.\n *\n * The parser only knows about the value it was pointed at, so the three changes\n * that happen around it — the byte order mark, the prose before, the prose\n * after — are recorded here, where the surrounding document is still in view.\n */\nfunction buildRepairLog(\n input: string,\n region: { start: number; end: number },\n chosen: Attempt,\n): RepairOperation[] {\n const scanner = new Scanner(input);\n const repairs: RepairOperation[] = [];\n\n if (region.start > 0) {\n repairs.push(operation(scanner, 'removed-byte-order-mark', 0));\n }\n\n const before = classifyGap(input, region.start, chosen.start);\n if (before === 'content') {\n repairs.push(operation(scanner, 'extracted-json', chosen.start));\n } else if (before === 'exotic') {\n repairs.push(operation(scanner, 'normalized-whitespace', region.start));\n }\n\n for (const repair of chosen.repairs) {\n repairs.push(repair);\n }\n\n const after = classifyGap(input, chosen.end, region.end);\n if (after === 'content') {\n repairs.push(operation(scanner, 'removed-trailing-content', chosen.end));\n } else if (after === 'exotic') {\n repairs.push(operation(scanner, 'normalized-whitespace', chosen.end));\n }\n\n return repairs;\n}\n\n/**\n * Describes what sits in the input between the region and the chosen value.\n *\n * The distinction matters because dropping prose and dropping a stray\n * non-breaking space are different events for an auditor, and because either one\n * changes the output — leaving both unrecorded would let `changed` be `true`\n * with an empty repair log.\n */\nfunction classifyGap(\n source: string,\n from: number,\n to: number,\n): 'empty' | 'whitespace' | 'exotic' | 'content' {\n if (from >= to) {\n return 'empty';\n }\n\n let exotic = false;\n for (let index = from; index < to; index += 1) {\n const code = source.charCodeAt(index);\n if (!isWhitespace(code)) {\n return 'content';\n }\n if (!isJsonWhitespace(code)) {\n exotic = true;\n }\n }\n\n return exotic ? 'exotic' : 'whitespace';\n}\n\n/** Builds one fully located repair record. */\nfunction operation(scanner: Scanner, type: RepairType, position: number): RepairOperation {\n const { line, column } = scanner.positionAt(position);\n return { type, position, line, column, message: describeRepair(type) };\n}\n","import { resolveOptions } from './options.js';\nimport { repairInternal } from './repair.js';\nimport type { RepairOptions } from './types.js';\n\n/**\n * Repairs malformed JSON and returns the parsed value.\n *\n * Equivalent to `JSON.parse(repairJson(input, options))`, but the value comes\n * from the validation stage that {@link repairJson} already runs, so the text is\n * never parsed twice.\n *\n * `T` is an unchecked assertion, exactly as with `JSON.parse`. Nothing here\n * validates the shape of the result against it — pair this with a schema\n * validator when the input is untrusted.\n *\n * @throws {JsonRepairError} `INVALID_INPUT`, `NO_JSON_FOUND`, `UNREPAIRABLE_JSON`,\n * `AMBIGUOUS_REPAIR`, `MAX_LENGTH_EXCEEDED`, `MAX_DEPTH_EXCEEDED` or\n * `MAX_REPAIRS_EXCEEDED`.\n */\nexport function parseJson<T = unknown>(input: string, options?: RepairOptions): T {\n return repairInternal(input, resolveOptions(options)).value as T;\n}\n"]}