@pixerate/editor 0.23.0 → 0.24.0

package/dist/chunk-OLZJXL4R.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["/home/runner/work/editor/editor/packages/core/dist/chunk-OLZJXL4R.cjs","../src/compare/diff.ts","../src/compare/documents.ts"],"names":["x","y","k","i","j"],"mappings":"AAAA;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACA;ACwCA,IAAM,MAAA,EAAQ,CAAA;AACd,IAAM,OAAA,EAAS,CAAA;AACf,IAAM,OAAA,EAAS,CAAA;AAIf,SAAS,UAAA,CAAW,GAAA,EAAe,EAAA,EAAY,KAAA,EAAqB;AAClE,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,KAAA,EAAO,CAAA,EAAA,EAAK,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA;AAC7C;AAMA,SAAS,KAAA,CACP,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,EAAA,EACA,GAAA,EACA,IAAA,EACS;AACT,EAAA,MAAM,EAAA,EAAI,IAAA,EAAM,GAAA;AAChB,EAAA,MAAM,EAAA,EAAI,IAAA,EAAM,GAAA;AAChB,EAAA,GAAA,CAAI,EAAA,IAAM,EAAA,GAAK,EAAA,IAAM,CAAA,EAAG;AACtB,IAAA,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,CAAC,CAAA;AACzB,IAAA,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,CAAC,CAAA;AACzB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,MAAM,IAAA,EAAM,EAAA,EAAI,CAAA;AAChB,EAAA,MAAM,IAAA,EAAM,IAAA,EAAM,CAAA;AAClB,EAAA,MAAM,EAAA,EAAI,IAAI,UAAA,CAAW,EAAA,EAAI,IAAA,EAAM,CAAC,CAAA;AAEpC,EAAA,MAAM,MAAA,EAAsB,CAAC,CAAA;AAC7B,EAAA,MAAM,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,IAAI,CAAA;AAChC,EAAA,IAAI,MAAA,EAAQ,KAAA;AACZ,EAAA,KAAA,EAAO,IAAA,CAAA,IAAS,EAAA,EAAI,CAAA,EAAG,EAAA,GAAK,KAAA,EAAO,CAAA,EAAA,EAAK;AACtC,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,CAAE,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA,EAAG,IAAA,EAAM,EAAA,EAAI,CAAC,CAAC,CAAA;AACzD,IAAA,IAAA,CAAA,IAAS,EAAA,EAAI,CAAC,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG;AAC/B,MAAA,MAAM,EAAA,EAAI,EAAA,EAAI,GAAA;AACd,MAAA,IAAIA,GAAAA,EAAI,EAAA,IAAM,CAAC,EAAA,GAAM,EAAA,IAAM,EAAA,GAAK,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,EAAK,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,CAAC,EAAA,EAAI,CAAA;AAC7E,MAAA,IAAIC,GAAAA,EAAID,GAAAA,EAAI,CAAA;AACZ,MAAA,MAAA,CAAOA,GAAAA,EAAI,EAAA,GAAKC,GAAAA,EAAI,EAAA,GAAK,EAAA,CAAG,IAAA,EAAMD,EAAAA,EAAG,IAAA,EAAMC,EAAC,CAAA,EAAG;AAC7C,QAAAD,EAAAA,EAAAA;AACA,QAAAC,EAAAA,EAAAA;AAAA,MACF;AACA,MAAA,CAAA,CAAE,CAAC,EAAA,EAAID,EAAAA;AACP,MAAA,GAAA,CAAIA,GAAAA,GAAK,EAAA,GAAKC,GAAAA,GAAK,CAAA,EAAG;AACpB,QAAA,MAAA,EAAQ,IAAA;AACR,QAAA,MAAM,KAAA;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,EAAA,GAAA,CAAI,CAAC,KAAA,EAAO,OAAO,KAAA;AAGnB,EAAA,MAAM,IAAA,EAAgB,CAAC,CAAA;AACvB,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,KAAA,CAAM,OAAA,EAAS,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,SAAA,EAAW,KAAA,CAAM,CAAC,CAAA;AACxB,IAAA,MAAM,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,EAAA,EAAI,CAAA,EAAG,CAAC,CAAA;AACpC,IAAA,MAAM,GAAA,EAAK,CAACC,EAAAA,EAAAA,GAAc,QAAA,CAASA,GAAAA,EAAI,IAAA,EAAM,IAAI,CAAA;AACjD,IAAA,MAAM,EAAA,EAAI,EAAA,EAAI,CAAA;AACd,IAAA,MAAM,MAAA,EAAQ,EAAA,IAAM,CAAC,EAAA,GAAM,EAAA,IAAM,EAAA,GAAK,EAAA,CAAG,EAAA,EAAI,CAAC,EAAA,EAAI,EAAA,CAAG,EAAA,EAAI,CAAC,EAAA,EAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,CAAA;AAC3E,IAAA,MAAM,MAAA,EAAQ,EAAA,CAAG,KAAK,CAAA;AACtB,IAAA,MAAM,MAAA,EAAQ,MAAA,EAAQ,KAAA;AACtB,IAAA,MAAA,CAAO,EAAA,EAAI,MAAA,GAAS,EAAA,EAAI,KAAA,EAAO;AAC7B,MAAA,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA;AACd,MAAA,CAAA,EAAA;AACA,MAAA,CAAA,EAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,EAAA,EAAI,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAA,IAAM,MAAA,EAAQ,OAAA,EAAS,MAAM,CAAA;AACjD,IAAA,EAAA,EAAI,KAAA;AACJ,IAAA,EAAA,EAAI,KAAA;AAAA,EACN;AACA,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,GAAA,CAAI,OAAA,EAAS,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,CAAA,EAAA,EAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA;AACzD,EAAA,OAAO,IAAA;AACT;AAMA,SAAS,OAAA,CACP,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACoB;AACpB,EAAA,MAAM,MAAA,kBAAQ,IAAI,GAAA,CAA8C,CAAA;AAChE,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,GAAA,EAAK,CAAA,EAAA,EAAK;AAC9B,IAAA,MAAM,GAAA,EAAK,GAAA,CAAI,CAAA,CAAE,CAAC,CAAA;AAClB,IAAA,MAAM,MAAA,EAAQ,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAC1B,IAAA,GAAA,CAAI,KAAA,EAAO;AACT,MAAA,KAAA,CAAM,CAAC,CAAA,EAAA;AAAA,IACT,EAAA,KAAO;AACL,MAAA,KAAA,CAAM,GAAA,CAAI,EAAA,EAAI,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA;AAAA,IAC7B;AAAA,EACF;AACA,EAAA,IAAA,CAAA,IAAS,EAAA,EAAI,GAAA,EAAK,EAAA,EAAI,GAAA,EAAK,CAAA,EAAA,EAAK;AAC9B,IAAA,MAAM,MAAA,EAAQ,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,CAAA,CAAE,CAAC,CAAC,CAAA;AAChC,IAAA,GAAA,CAAI,KAAA,EAAO;AACT,MAAA,KAAA,CAAM,CAAC,CAAA,EAAA;AACP,MAAA,KAAA,CAAM,CAAC,EAAA,EAAI,CAAA;AAAA,IACb;AAAA,EACF;AACA,EAAA,MAAM,MAAA,EAA4B,CAAC,CAAA;AACnC,EAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAA,GAAU;AACvB,IAAA,GAAA,CAAI,KAAA,CAAM,CAAC,EAAA,IAAM,EAAA,GAAK,KAAA,CAAM,CAAC,EAAA,IAAM,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,CAAC,KAAA,CAAM,CAAC,CAAA,EAAG,KAAA,CAAM,CAAC,CAAC,CAAC,CAAA;AAAA,EACvE,CAAC,CAAA;AACD,EAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,EAAA,GAAM,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA,CAAE,CAAC,CAAC,CAAA;AAEhC,EAAA,MAAM,MAAA,EAAkB,CAAC,CAAA;AACzB,EAAA,MAAM,KAAA,EAAO,IAAI,UAAA,CAAW,KAAA,CAAM,MAAM,CAAA,CAAE,IAAA,CAAK,CAAA,CAAE,CAAA;AACjD,EAAA,IAAA,CAAA,IAASA,GAAAA,EAAI,CAAA,EAAGA,GAAAA,EAAI,KAAA,CAAM,MAAA,EAAQA,EAAAA,EAAAA,EAAK;AACrC,IAAA,MAAM,EAAA,EAAI,KAAA,CAAMA,EAAC,CAAA,CAAE,CAAC,CAAA;AACpB,IAAA,IAAI,GAAA,EAAK,CAAA;AACT,IAAA,IAAI,GAAA,EAAK,KAAA,CAAM,MAAA;AACf,IAAA,MAAA,CAAO,GAAA,EAAK,EAAA,EAAI;AACd,MAAA,MAAM,IAAA,EAAO,GAAA,EAAK,GAAA,GAAO,CAAA;AACzB,MAAA,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,GAAG,CAAC,CAAA,CAAE,CAAC,EAAA,EAAI,CAAA,EAAG,GAAA,EAAK,IAAA,EAAM,CAAA;AAAA,MAAA,KACpC,GAAA,EAAK,GAAA;AAAA,IACZ;AACA,IAAA,GAAA,CAAI,GAAA,EAAK,CAAA,EAAG,IAAA,CAAKA,EAAC,EAAA,EAAI,KAAA,CAAM,GAAA,EAAK,CAAC,CAAA;AAClC,IAAA,GAAA,CAAI,GAAA,IAAO,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAKA,EAAC,CAAA;AAAA,IAAA,KAChC,KAAA,CAAM,EAAE,EAAA,EAAIA,EAAAA;AAAA,EACnB;AACA,EAAA,MAAM,OAAA,EAA6B,CAAC,CAAA;AACpC,EAAA,IAAI,EAAA,EAAI,KAAA,CAAM,OAAA,EAAS,KAAA,CAAM,KAAA,CAAM,OAAA,EAAS,CAAC,EAAA,EAAI,CAAA,CAAA;AACjD,EAAA,MAAA,CAAO,EAAA,IAAM,CAAA,CAAA,EAAI;AACf,IAAA,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AACpB,IAAA,EAAA,EAAI,IAAA,CAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,MAAA,CAAO,OAAA,CAAQ,CAAA;AACxB;AASA,SAAS,SAAA,CACP,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,GAAA,EACA,KAAA,EACM;AACN,EAAA,MAAM,EAAE,GAAG,EAAA,EAAI,GAAA;AACf,EAAA,IAAI,OAAA,EAAS,CAAA;AACb,EAAA,MAAA,CAAO,IAAA,EAAM,OAAA,EAAS,IAAA,GAAO,IAAA,EAAM,OAAA,EAAS,IAAA,GAAO,EAAA,CAAG,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,MAAM,CAAA,EAAG,MAAA,EAAA;AACnF,EAAA,IAAI,OAAA,EAAS,CAAA;AACb,EAAA,MAAA,CACE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,OAAA,GACrB,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,OAAA,GACrB,EAAA,CAAG,IAAA,EAAM,OAAA,EAAS,CAAA,EAAG,IAAA,EAAM,OAAA,EAAS,CAAC,CAAA,EACrC;AACA,IAAA,MAAA,EAAA;AAAA,EACF;AACA,EAAA,UAAA,CAAW,GAAA,EAAK,KAAA,EAAO,MAAM,CAAA;AAC7B,EAAA,MAAM,GAAA,EAAK,IAAA,EAAM,MAAA;AACjB,EAAA,MAAM,GAAA,EAAK,IAAA,EAAM,MAAA;AACjB,EAAA,MAAM,GAAA,EAAK,IAAA,EAAM,MAAA;AACjB,EAAA,MAAM,GAAA,EAAK,IAAA,EAAM,MAAA;AACjB,EAAA,MAAM,QAAA,EAAU,CAAA,EAAA,GAAM;AACpB,IAAA,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,GAAA,EAAK,EAAE,CAAA;AAC/B,IAAA,UAAA,CAAW,GAAA,EAAK,MAAA,EAAQ,GAAA,EAAK,EAAE,CAAA;AAAA,EACjC,CAAA;AAEA,EAAA,GAAA,CAAI,GAAA,EAAK,GAAA,EAAA,CAAM,GAAA,EAAK,EAAA,EAAA,GAAO,GAAA,CAAI,MAAA,EAAQ;AACrC,IAAA,KAAA,CAAM,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAA,EAAK,QAAQ,CAAA;AAAA,EACzC,EAAA,KAAA,GAAA,CAAW,CAAC,GAAA,CAAI,GAAA,EAAK;AAEnB,IAAA,GAAA,CAAI,CAAC,KAAA,CAAM,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAA,EAAK,GAAA,CAAI,MAAM,CAAA,EAAG,OAAA,CAAQ,CAAA;AAAA,EAC3D,EAAA,KAAO;AACL,IAAA,MAAM,MAAA,EAAQ,MAAA,GAAS,GAAA,CAAI,SAAA,EAAW,CAAC,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,GAAA,EAAK,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,EAAE,CAAA;AAC1E,IAAA,GAAA,CAAI,KAAA,CAAM,OAAA,IAAW,CAAA,EAAG;AAEtB,MAAA,OAAA,CAAQ,CAAA;AAAA,IACV,EAAA,KAAO;AACL,MAAA,IAAI,EAAA,EAAI,EAAA;AACR,MAAA,IAAI,EAAA,EAAI,EAAA;AACR,MAAA,IAAA,CAAA,MAAW,CAAC,CAAA,EAAG,CAAC,EAAA,GAAK,KAAA,EAAO;AAC1B,QAAA,SAAA,CAAU,GAAA,EAAK,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAA,EAAK,MAAA,EAAQ,CAAC,CAAA;AACzC,QAAA,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA;AACd,QAAA,EAAA,EAAI,EAAA,EAAI,CAAA;AACR,QAAA,EAAA,EAAI,EAAA,EAAI,CAAA;AAAA,MACV;AACA,MAAA,SAAA,CAAU,GAAA,EAAK,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,EAAA,EAAI,GAAA,EAAK,MAAA,EAAQ,CAAC,CAAA;AAAA,IAC7C;AAAA,EACF;AACA,EAAA,UAAA,CAAW,GAAA,EAAK,KAAA,EAAO,MAAM,CAAA;AAC/B;AAEA,IAAM,YAAA,EAAc,CAAC,IAAA,EAAA,GACnB,OAAO,KAAA,IAAS,SAAA,GAAY,OAAO,KAAA,IAAS,SAAA,GAAY,OAAO,KAAA,IAAS,UAAA,EACpE,KAAA,EACA,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA;AAQlB,SAAS,aAAA,CACd,CAAA,EACA,CAAA,EACA,QAAA,EAAmC,CAAC,CAAA,EACzB;AACX,EAAA,MAAM,OAAA,EAAS,IAAA,CAAK,GAAA,CAAI,CAAA,mBAAG,OAAA,CAAQ,MAAA,UAAU,KAAI,CAAA;AACjD,EAAA,MAAM,SAAA,mBAAW,OAAA,CAAQ,QAAA,UAAY,GAAA;AACrC,EAAA,IAAI,IAAA,EAA+C,IAAA;AACnD,EAAA,IAAI,EAAA;AACJ,EAAA,GAAA,CAAI,OAAA,CAAQ,OAAA,GAAU,CAAC,OAAA,CAAQ,IAAA,EAAM;AACnC,IAAA,MAAM,OAAA,EAAS,OAAA,CAAQ,MAAA;AACvB,IAAA,GAAA,EAAK,CAACC,EAAAA,EAAGC,EAAAA,EAAAA,GAAM,MAAA,CAAO,CAAA,CAAED,EAAC,CAAA,EAAG,CAAA,CAAEC,EAAC,CAAC,CAAA;AAAA,EAClC,EAAA,KAAO;AACL,IAAA,MAAM,KAAA,mBAAO,OAAA,CAAQ,IAAA,UAAS,aAAA;AAC9B,IAAA,MAAM,MAAA,kBAAQ,IAAI,GAAA,CAAuC,CAAA;AACzD,IAAA,MAAM,KAAA,EAAO,CAAC,IAAA,EAAA,GAAY;AACxB,MAAA,MAAM,IAAA,EAAM,IAAA,CAAK,IAAI,CAAA;AACrB,MAAA,IAAI,GAAA,EAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AACtB,MAAA,GAAA,CAAI,GAAA,IAAO,KAAA,CAAA,EAAW;AACpB,QAAA,GAAA,EAAK,KAAA,CAAM,IAAA;AACX,QAAA,KAAA,CAAM,GAAA,CAAI,GAAA,EAAK,EAAE,CAAA;AAAA,MACnB;AACA,MAAA,OAAO,EAAA;AAAA,IACT,CAAA;AACA,IAAA,IAAA,EAAM,EAAE,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,CAAA,EAAG,IAAI,CAAA,EAAG,CAAA,EAAG,UAAA,CAAW,IAAA,CAAK,CAAA,EAAG,IAAI,EAAE,CAAA;AACjE,IAAA,MAAM,EAAE,CAAA,EAAG,EAAA,EAAI,CAAA,EAAG,GAAG,EAAA,EAAI,GAAA;AACzB,IAAA,GAAA,EAAK,CAACD,EAAAA,EAAGC,EAAAA,EAAAA,GAAM,EAAA,CAAGD,EAAC,EAAA,IAAM,EAAA,CAAGC,EAAC,CAAA;AAAA,EAC/B;AAEA,EAAA,MAAM,IAAA,EAAgB,CAAC,CAAA;AACvB,EAAA,SAAA,CAAU,EAAE,EAAA,EAAI,GAAA,EAAK,MAAA,EAAQ,SAAS,CAAA,EAAG,CAAA,EAAG,CAAA,CAAE,MAAA,EAAQ,CAAA,EAAG,CAAA,CAAE,MAAA,EAAQ,GAAA,EAAK,CAAC,CAAA;AAGzE,EAAA,MAAM,KAAA,EAAkB,CAAC,CAAA;AACzB,EAAA,MAAM,KAAA,EAAO,CAAC,IAAA,EAAkB,MAAA,EAAgB,MAAA,EAAgB,MAAA,EAAA,GAAmB;AACjF,IAAA,GAAA,CAAI,OAAA,IAAW,CAAA,EAAG,MAAA;AAClB,IAAA,MAAM,KAAA,EAAO,IAAA,CAAK,IAAA,CAAK,OAAA,EAAS,CAAC,CAAA;AACjC,IAAA,GAAA,CAAI,KAAA,GAAQ,IAAA,CAAK,KAAA,IAAS,IAAA,EAAM;AAC9B,MAAA,IAAA,CAAK,OAAA,GAAU,MAAA;AAAA,IACjB,EAAA,KAAO;AACL,MAAA,IAAA,CAAK,IAAA,CAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAQ,OAAO,CAAC,CAAA;AAAA,IAC5C;AAAA,EACF,CAAA;AACA,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,IAAI,EAAA,EAAI,CAAA;AACR,EAAA,MAAA,CAAO,EAAA,EAAI,GAAA,CAAI,MAAA,EAAQ;AACrB,IAAA,GAAA,CAAI,GAAA,CAAI,CAAC,EAAA,IAAM,KAAA,EAAO;AACpB,MAAA,IAAI,EAAA,EAAI,CAAA;AACR,MAAA,MAAA,CAAO,EAAA,EAAI,GAAA,CAAI,OAAA,GAAU,GAAA,CAAI,CAAC,EAAA,IAAM,KAAA,EAAO;AACzC,QAAA,CAAA,EAAA;AACA,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,IAAA,CAAK,OAAA,EAAS,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AACrB,MAAA,EAAA,GAAK,CAAA;AACL,MAAA,EAAA,GAAK,CAAA;AACL,MAAA,QAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAA,EAAO,CAAA;AACX,IAAA,IAAI,KAAA,EAAO,CAAA;AACX,IAAA,MAAA,CAAO,EAAA,EAAI,GAAA,CAAI,OAAA,GAAU,GAAA,CAAI,CAAC,EAAA,IAAM,KAAA,EAAO;AACzC,MAAA,GAAA,CAAI,GAAA,CAAI,CAAC,EAAA,IAAM,MAAA,EAAQ,IAAA,EAAA;AAAA,MAAA,KAClB,IAAA,EAAA;AACL,MAAA,CAAA,EAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,EAAU,CAAA,EAAG,CAAA,EAAG,IAAI,CAAA;AACzB,IAAA,IAAA,CAAK,QAAA,EAAU,EAAA,EAAI,IAAA,EAAM,CAAA,EAAG,IAAI,CAAA;AAChC,IAAA,EAAA,GAAK,IAAA;AACL,IAAA,EAAA,GAAK,IAAA;AAAA,EACP;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,WAAA,CACd,CAAA,EACA,CAAA,EACA,QAAA,EAAmC,CAAC,CAAA,EACtB;AACd,EAAA,MAAM,QAAA,EAAwB,CAAC,CAAA;AAC/B,EAAA,IAAI,QAAA,EAA6B,IAAA;AACjC,EAAA,IAAA,CAAA,MAAW,IAAA,GAAO,aAAA,CAAc,CAAA,EAAG,CAAA,EAAG,OAAO,CAAA,EAAG;AAC9C,IAAA,GAAA,CAAI,GAAA,CAAI,KAAA,IAAS,OAAA,EAAS;AACxB,MAAA,QAAA,EAAU,IAAA;AACV,MAAA,QAAA;AAAA,IACF;AACA,IAAA,GAAA,CAAI,CAAC,OAAA,EAAS;AACZ,MAAA,QAAA,EAAU;AAAA,QACR,IAAA,EAAM,GAAA,CAAI,KAAA,IAAS,SAAA,EAAW,UAAA,EAAY,UAAA;AAAA,QAC1C,MAAA,EAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,IAAA,EAAM,GAAA,CAAI,MAAA;AAAA,QACV,MAAA,EAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,IAAA,EAAM,GAAA,CAAI;AAAA,MACZ,CAAA;AACA,MAAA,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA;AAAA,IACtB;AACA,IAAA,GAAA,CAAI,GAAA,CAAI,KAAA,IAAS,QAAA,EAAU;AACzB,MAAA,OAAA,CAAQ,KAAA,EAAO,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,MAAA;AAAA,IAClC,EAAA,KAAO;AACL,MAAA,OAAA,CAAQ,KAAA,EAAO,GAAA,CAAI,OAAA,EAAS,GAAA,CAAI,MAAA;AAAA,IAClC;AACA,IAAA,GAAA,CAAI,OAAA,CAAQ,KAAA,EAAO,OAAA,CAAQ,OAAA,GAAU,OAAA,CAAQ,KAAA,EAAO,OAAA,CAAQ,MAAA,EAAQ,OAAA,CAAQ,KAAA,EAAO,UAAA;AAAA,EACrF;AACA,EAAA,OAAO,OAAA;AACT;ADpHA;AACA;AEzPA,oCAA+B;AAC/B;AACE;AACA;AAAQ,yCAIH;AAuEP,IAAM,kBAAA,kBAAoB,IAAI,GAAA,CAAI;AAAA,EAChC,qCAAA;AAAA,EACA,oCAAA;AAAA,EACA,yCAAA;AAAA,EACA,SAAA;AAAA,EACA;AACF,CAAC,CAAA;AAGD,IAAM,WAAA,kBAAa,IAAI,GAAA,CAAI,CAAC,YAAA,EAAc,aAAa,CAAC,CAAA;AAExD,IAAM,mBAAA,EAAqB,QAAA;AAgC3B,SAAS,eAAA,CAAgB,KAAA,EAAwB;AAC/C,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,CAAA,EAAW,OAAO,MAAA;AAChC,EAAA,GAAA,CAAI,MAAA,IAAU,KAAA,GAAQ,OAAO,MAAA,IAAU,QAAA,EAAU,OAAO,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AAC5E,EAAA,GAAA,CAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,eAAe,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACzE,EAAA,MAAM,KAAA,EAAO,MAAA,CAAO,IAAA,CAAK,KAAe,CAAA,CAAE,IAAA,CAAK,CAAA;AAC/C,EAAA,OAAO,CAAA,CAAA,EAAI,IAAA,CACR,GAAA,CAAI,CAAC,GAAA,EAAA,GAAQ,CAAA,EAAA;AAElB;AAE+D;AACnC,EAAA;AACI,EAAA;AACA,IAAA;AACA,IAAA;AAC9B,EAAA;AACuB,EAAA;AACzB;AAEwE;AAChD,EAAA;AACiB,EAAA;AACxB,IAAA;AACe,IAAA;AAC9B,EAAA;AAC2B,EAAA;AAC7B;AAE8D;AACrD,EAAA;AACoB,IAAA;AACJ,IAAA;AACE,IAAA;AACC,IAAA;AACT,IAAA;AACjB,EAAA;AACF;AAGqE;AACvB,EAAA;AACb,EAAA;AACjC;AAE0B;AACA,EAAA;AACZ,EAAA;AACL,EAAA;AACT;AAEmD;AACxB,EAAA;AAC3B;AAEyC;AACd,EAAA;AAC3B;AAE4B;AACnB,EAAA;AACE,IAAA;AACqB,MAAA;AACL,QAAA;AACrB,MAAA;AACF,IAAA;AACF,EAAA;AACF;AAG4F;AAC5D,EAAA;AACL,EAAA;AACG,EAAA;AACA,EAAA;AAC9B;AAGG;AAEgD;AAMI;AACpC,EAAA;AACY,EAAA;AACtB,EAAA;AACT;AAEgD;AACnB,EAAA;AAC7B;AAE8C;AACjB,EAAA;AAC7B;AAG+D;AACjC,EAAA;AACK,EAAA;AAC7B,EAAA;AACkB,EAAA;AACT,IAAA;AACa,IAAA;AACC,MAAA;AACxB,IAAA;AACyB,IAAA;AACN,IAAA;AACE,EAAA;AACO,IAAA;AACxB,EAAA;AACoB,IAAA;AACD,IAAA;AACY,IAAA;AACtC,EAAA;AACsB,EAAA;AACf,EAAA;AACT;AAEqE;AAC5C,EAAA;AACG,EAAA;AACC,EAAA;AAC7B;AAQE;AAEkC,EAAA;AACP,EAAA;AACD,EAAA;AAC5B;AAQE;AAK2B,EAAA;AACL,EAAA;AACM,IAAA;AACqB,MAAA;AAClC,QAAA;AACU,QAAA;AACnB,QAAA;AACF,MAAA;AACyB,MAAA;AAC3B,IAAA;AAEiB,IAAA;AACS,IAAA;AACd,MAAA;AACc,QAAA;AACxB,MAAA;AACyB,MAAA;AAC3B,IAAA;AACyB,IAAA;AACJ,IAAA;AACvB,EAAA;AACiB,EAAA;AACU,IAAA;AACJ,IAAA;AACvB,EAAA;AAC4B,EAAA;AACS,EAAA;AACb,EAAA;AACpB,EAAA;AACgB,IAAA;AACZ,EAAA;AACmB,IAAA;AACJ,IAAA;AACvB,EAAA;AACF;AAM8C;AACpB,EAAA;AACA,EAAA;AACJ,IAAA;AACO,MAAA;AAClB,IAAA;AACmB,MAAA;AAC1B,IAAA;AACD,EAAA;AACM,EAAA;AACT;AAEc;AACD;AAE2B;AACD;AAG6B;AAC9B,EAAA;AACzB,EAAA;AACgB,IAAA;AAClB,IAAA;AACT,EAAA;AACQ,EAAA;AACgB,EAAA;AACR,IAAA;AACK,IAAA;AACA,IAAA;AACS,MAAA;AACH,IAAA;AACG,MAAA;AACrB,IAAA;AACL,MAAA;AACF,IAAA;AACsB,IAAA;AACxB,EAAA;AACO,EAAA;AACT;AAWyE;AACpC,EAAA;AACR,IAAA;AACG,MAAA;AACH,MAAA;AACzB,IAAA;AACO,IAAA;AACT,EAAA;AAC2B,EAAA;AACE,EAAA;AACA,IAAA;AACA,IAAA;AAErB,IAAA;AAMsB,IAAA;AACN,MAAA;AACpB,MAAA;AACF,IAAA;AACyB,IAAA;AACE,IAAA;AACA,MAAA;AACT,MAAA;AAClB,IAAA;AAC2B,IAAA;AACA,IAAA;AAC5B,EAAA;AACM,EAAA;AACT;AAEuC;AAC1B,EAAA;AACgB,EAAA;AACN,IAAA;AACI,IAAA;AACzB,EAAA;AAC0B,EAAA;AAC5B;AAEyD;AAC1C,EAAA;AACA,IAAA;AACb,EAAA;AACF;AAE4B;AACb,EAAA;AAEC,IAAA;AAGd,EAAA;AACF;AASE;AAIwB,EAAA;AACD,EAAA;AACP,EAAA;AACQ,EAAA;AACd,IAAA;AACE,IAAA;AACkB,MAAA;AAC5B,IAAA;AACF,EAAA;AAC4B,EAAA;AACA,EAAA;AACf,EAAA;AACe,IAAA;AACA,IAAA;AAC5B,EAAA;AAEmB,EAAA;AACE,EAAA;AACmD,EAAA;AAKtE,EAAA;AAIgB,IAAA;AACM,IAAA;AACK,IAAA;AACJ,MAAA;AACD,MAAA;AACtB,IAAA;AACF,EAAA;AAE4B,EAAA;AACA,IAAA;AACA,MAAA;AACE,QAAA;AACA,QAAA;AACA,QAAA;AACN,UAAA;AACM,UAAA;AACR,UAAA;AACD,UAAA;AACC,YAAA;AACQ,YAAA;AACpB,YAAA;AACF,UAAA;AACkB,UAAA;AACA,UAAA;AACE,UAAA;AACN,YAAA;AACQ,YAAA;AACpB,YAAA;AACF,UAAA;AACmB,UAAA;AACD,UAAA;AACN,UAAA;AACM,UAAA;AACE,UAAA;AACA,UAAA;AACtB,QAAA;AACF,MAAA;AACA,MAAA;AACF,IAAA;AACY,IAAA;AACe,IAAA;AACA,IAAA;AAC7B,EAAA;AAEkC,EAAA;AAC1B,EAAA;AACe,EAAA;AACH,IAAA;AACH,IAAA;AACa,MAAA;AAC1B,MAAA;AACA,MAAA;AACF,IAAA;AACgB,IAAA;AACJ,IAAA;AACc,IAAA;AACT,MAAA;AACf,MAAA;AACF,IAAA;AAC2B,IAAA;AACvB,IAAA;AACN,EAAA;AAC0B,EAAA;AAC5B;AAOE;AAM2B,EAAA;AACD,IAAA;AACD,IAAA;AACzB,EAAA;AAE8C,EAAA;AACpB,EAAA;AACD,EAAA;AACG,IAAA;AAGlB,MAAA;AAEO,MAAA;AACQ,MAAA;AAChB,IAAA;AACS,MAAA;AAChB,IAAA;AACS,EAAA;AACmB,IAAA;AAC9B,EAAA;AAEqB,EAAA;AAEb,EAAA;AAIa,EAAA;AAGM,IAAA;AACE,IAAA;AAC7B,EAAA;AAC4B,EAAA;AACE,EAAA;AACd,IAAA;AACM,IAAA;AACtB,EAAA;AAC2B,EAAA;AAC7B;AAIE;AAK0B,EAAA;AACC,EAAA;AACD,IAAA;AACD,IAAA;AACzB,EAAA;AACqB,EAAA;AACO,IAAA;AAC5B,EAAA;AAE4B,EAAA;AAGZ,IAAA;AAChB,EAAA;AACkB,EAAA;AACY,EAAA;AAC1B,EAAA;AACA,EAAA;AACS,IAAA;AACT,MAAA;AACA,MAAA;AACqB,MAAA;AACA,MAAA;AACrB,MAAA;AACF,IAAA;AACA,EAAA;AACoB,IAAA;AACtB,EAAA;AACI,EAAA;AACmB,IAAA;AACf,EAAA;AACQ,IAAA;AACM,IAAA;AACtB,EAAA;AACF;AAGE;AAM8B,EAAA;AACA,EAAA;AACA,EAAA;AACD,EAAA;AACC,EAAA;AACE,EAAA;AAEP,EAAA;AACL,IAAA;AACQ,IAAA;AACA,MAAA;AACE,QAAA;AAC1B,MAAA;AACA,MAAA;AACF,IAAA;AAG+B,IAAA;AACA,IAAA;AACJ,IAAA;AACN,MAAA;AACI,MAAA;AACJ,MAAA;AACG,QAAA;AACpB,QAAA;AACF,MAAA;AACK,IAAA;AACc,MAAA;AACrB,IAAA;AACgB,IAAA;AACC,IAAA;AACQ,IAAA;AACL,MAAA;AACA,MAAA;AACA,MAAA;AACM,QAAA;AACtB,QAAA;AACF,MAAA;AACqB,MAAA;AACA,MAAA;AACvB,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAM6E;AAC3C,EAAA;AAClB,IAAA;AACD,IAAA;AACI,IAAA;AACD,IAAA;AACQ,IAAA;AACxB,EAAA;AACuB,EAAA;AACD,IAAA;AACK,IAAA;AACA,IAAA;AACZ,IAAA;AACd,EAAA;AACM,EAAA;AACT;AAoBE;AAKU,EAAA;AAMmB,EAAA;AAER,EAAA;AACnB,IAAA;AAC4B,IAAA;AACF,IAAA;AACN,IAAA;AACC,IAAA;AACC,IAAA;AACM,IAAA;AACR,IAAA;AACC,IAAA;AACC,IAAA;AACK,IAAA;AACH,IAAA;AACD,IAAA;AACF,IAAA;AACV,IAAA;AACD,IAAA;AACK,IAAA;AACjB,EAAA;AAC2B,EAAA;AACT,IAAA;AAClB,EAAA;AAC2B,EAAA;AACX,IAAA;AAChB,EAAA;AAE2C,EAAA;AACd,IAAA;AACA,IAAA;AACb,IAAA;AACP,IAAA;AACT,EAAA;AAC0B,EAAA;AACD,EAAA;AAER,EAAA;AACb,EAAA;AACA,EAAA;AACyB,IAAA;AACrB,EAAA;AACqB,IAAA;AACb,IAAA;AAChB,EAAA;AACuB,EAAA;AACzB;AAIE;AAIwB,EAAA;AAC1B;AFtCgC;AACA;AACA;AACA;AACA;AACA;AACA","file":"/home/runner/work/editor/editor/packages/core/dist/chunk-OLZJXL4R.cjs","sourcesContent":[null,"// Portions ported from pdfcraft/crates/compare/src/lib.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\n\n/**\n * Generic sequence diff: common prefix/suffix stripping, Myers' O((N+M)·D)\n * algorithm for small segments and patience anchors (items unique on both\n * sides, longest increasing subsequence) to split long ones. Dependency-free.\n */\n\nexport type DiffOpType = \"equal\" | \"delete\" | \"insert\";\n\n/** A run of consecutive operations of one type. */\nexport interface DiffRun {\n  type: DiffOpType;\n  /** Start index in `a` (for `insert`, where the items go in `a`). */\n  aIndex: number;\n  /** Start index in `b` (for `delete`, where the items were in `b`). */\n  bIndex: number;\n  length: number;\n}\n\n/** A change: a deleted range of `a`, an inserted range of `b`, or both (replaced). */\nexport interface DiffChange {\n  kind: \"inserted\" | \"deleted\" | \"replaced\";\n  aStart: number;\n  aEnd: number;\n  bStart: number;\n  bEnd: number;\n}\n\nexport interface DiffSequencesOptions<T> {\n  /**\n   * Key of an item: items with the same key are equal. Defaults to the item\n   * itself for strings, numbers and booleans, and `JSON.stringify` otherwise.\n   * Keys enable patience anchors for long inputs.\n   */\n  hash?: (item: T) => string | number | boolean;\n  /**\n   * Custom equality. Without `hash`, segments longer than `direct` are only\n   * diffed while the edit distance stays below `direct`, otherwise replaced.\n   */\n  equals?: (a: T, b: T) => boolean;\n  /**\n   * Segments with more items (both sides together) are split at anchors\n   * first so Myers' saved frontiers (O(D²) memory) stay small. Default 3000.\n   */\n  direct?: number;\n  /** Maximum anchor recursion depth before a long segment is replaced whole. Default 8. */\n  maxDepth?: number;\n}\n\nconst EQUAL = 0;\nconst DELETE = 1;\nconst INSERT = 2;\n\ntype Eq = (i: number, j: number) => boolean;\n\nfunction pushRepeat(out: number[], op: number, count: number): void {\n  for (let i = 0; i < count; i++) out.push(op);\n}\n\n/**\n * Myers' diff of a[aLo..aHi) and b[bLo..bHi). Returns false (and emits\n * nothing) when the edit distance exceeds `maxD`.\n */\nfunction myers(\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n  eq: Eq,\n  out: number[],\n  maxD: number,\n): boolean {\n  const n = aHi - aLo;\n  const m = bHi - bLo;\n  if (n === 0 || m === 0) {\n    pushRepeat(out, DELETE, n);\n    pushRepeat(out, INSERT, m);\n    return true;\n  }\n  const max = n + m;\n  const off = max + 1;\n  const v = new Int32Array(2 * max + 3);\n  // Frontier d only spans diagonals -d..d: save just that slice.\n  const trace: Int32Array[] = [];\n  const limit = Math.min(max, maxD);\n  let found = false;\n  outer: for (let d = 0; d <= limit; d++) {\n    trace.push(v.slice(Math.max(off - d - 1, 0), off + d + 2));\n    for (let k = -d; k <= d; k += 2) {\n      const i = k + off;\n      let x = k === -d || (k !== d && v[i - 1] < v[i + 1]) ? v[i + 1] : v[i - 1] + 1;\n      let y = x - k;\n      while (x < n && y < m && eq(aLo + x, bLo + y)) {\n        x++;\n        y++;\n      }\n      v[i] = x;\n      if (x >= n && y >= m) {\n        found = true;\n        break outer;\n      }\n    }\n  }\n  if (!found) return false;\n\n  // Walk back through the saved frontiers.\n  const ops: number[] = [];\n  let x = n;\n  let y = m;\n  for (let d = trace.length - 1; d >= 0; d--) {\n    const frontier = trace[d];\n    const base = Math.max(off - d - 1, 0);\n    const at = (k: number) => frontier[k + off - base];\n    const k = x - y;\n    const prevK = k === -d || (k !== d && at(k - 1) < at(k + 1)) ? k + 1 : k - 1;\n    const prevX = at(prevK);\n    const prevY = prevX - prevK;\n    while (x > prevX && y > prevY) {\n      ops.push(EQUAL);\n      x--;\n      y--;\n    }\n    if (d > 0) ops.push(x === prevX ? INSERT : DELETE);\n    x = prevX;\n    y = prevY;\n  }\n  for (let i = ops.length - 1; i >= 0; i--) out.push(ops[i]);\n  return true;\n}\n\n/**\n * Patience anchors: items that occur once on each side, in an order both\n * sides agree on (the longest increasing subsequence of their positions).\n */\nfunction anchors(\n  ids: { a: Int32Array; b: Int32Array },\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n): [number, number][] {\n  const count = new Map<number, [number, number, number, number]>();\n  for (let i = aLo; i < aHi; i++) {\n    const id = ids.a[i];\n    const entry = count.get(id);\n    if (entry) {\n      entry[0]++;\n    } else {\n      count.set(id, [1, 0, i, -1]);\n    }\n  }\n  for (let j = bLo; j < bHi; j++) {\n    const entry = count.get(ids.b[j]);\n    if (entry) {\n      entry[1]++;\n      entry[3] = j;\n    }\n  }\n  const pairs: [number, number][] = [];\n  count.forEach((entry) => {\n    if (entry[0] === 1 && entry[1] === 1) pairs.push([entry[2], entry[3]]);\n  });\n  pairs.sort((p, q) => p[0] - q[0]);\n  // LIS on the b positions (patience sorting with back links).\n  const tails: number[] = [];\n  const prev = new Int32Array(pairs.length).fill(-1);\n  for (let k = 0; k < pairs.length; k++) {\n    const y = pairs[k][1];\n    let lo = 0;\n    let hi = tails.length;\n    while (lo < hi) {\n      const mid = (lo + hi) >> 1;\n      if (pairs[tails[mid]][1] < y) lo = mid + 1;\n      else hi = mid;\n    }\n    if (lo > 0) prev[k] = tails[lo - 1];\n    if (lo === tails.length) tails.push(k);\n    else tails[lo] = k;\n  }\n  const result: [number, number][] = [];\n  let k = tails.length ? tails[tails.length - 1] : -1;\n  while (k !== -1) {\n    result.push(pairs[k]);\n    k = prev[k];\n  }\n  return result.reverse();\n}\n\ninterface DiffContext {\n  eq: Eq;\n  ids: { a: Int32Array; b: Int32Array } | null;\n  direct: number;\n  maxDepth: number;\n}\n\nfunction diffRange(\n  ctx: DiffContext,\n  aLo: number,\n  aHi: number,\n  bLo: number,\n  bHi: number,\n  out: number[],\n  depth: number,\n): void {\n  const { eq } = ctx;\n  let prefix = 0;\n  while (aLo + prefix < aHi && bLo + prefix < bHi && eq(aLo + prefix, bLo + prefix)) prefix++;\n  let suffix = 0;\n  while (\n    aHi - suffix > aLo + prefix &&\n    bHi - suffix > bLo + prefix &&\n    eq(aHi - suffix - 1, bHi - suffix - 1)\n  ) {\n    suffix++;\n  }\n  pushRepeat(out, EQUAL, prefix);\n  const ma = aLo + prefix;\n  const mb = bLo + prefix;\n  const ea = aHi - suffix;\n  const eb = bHi - suffix;\n  const replace = () => {\n    pushRepeat(out, DELETE, ea - ma);\n    pushRepeat(out, INSERT, eb - mb);\n  };\n\n  if (ea - ma + (eb - mb) <= ctx.direct) {\n    myers(ma, ea, mb, eb, eq, out, Infinity);\n  } else if (!ctx.ids) {\n    // No keys, so no anchors: bounded Myers, else one replacement.\n    if (!myers(ma, ea, mb, eb, eq, out, ctx.direct)) replace();\n  } else {\n    const found = depth >= ctx.maxDepth ? [] : anchors(ctx.ids, ma, ea, mb, eb);\n    if (found.length === 0) {\n      // A long stretch with nothing unique in common: one replacement.\n      replace();\n    } else {\n      let i = ma;\n      let j = mb;\n      for (const [x, y] of found) {\n        diffRange(ctx, i, x, j, y, out, depth + 1);\n        out.push(EQUAL);\n        i = x + 1;\n        j = y + 1;\n      }\n      diffRange(ctx, i, ea, j, eb, out, depth + 1);\n    }\n  }\n  pushRepeat(out, EQUAL, suffix);\n}\n\nconst defaultHash = (item: unknown): string | number | boolean =>\n  typeof item === \"string\" || typeof item === \"number\" || typeof item === \"boolean\"\n    ? item\n    : JSON.stringify(item);\n\n/**\n * Diffs two sequences and returns the edit script as runs of equal, deleted\n * and inserted items, in order. Within a changed stretch deletions come\n * before insertions. The script is minimal for segments up to `direct`\n * items; longer inputs are split at patience anchors (bounded work).\n */\nexport function diffSequences<T>(\n  a: readonly T[],\n  b: readonly T[],\n  options: DiffSequencesOptions<T> = {},\n): DiffRun[] {\n  const direct = Math.max(2, options.direct ?? 3000);\n  const maxDepth = options.maxDepth ?? 8;\n  let ids: { a: Int32Array; b: Int32Array } | null = null;\n  let eq: Eq;\n  if (options.equals && !options.hash) {\n    const equals = options.equals;\n    eq = (i, j) => equals(a[i], b[j]);\n  } else {\n    const hash = options.hash ?? (defaultHash as (item: T) => string | number | boolean);\n    const table = new Map<string | number | boolean, number>();\n    const idOf = (item: T) => {\n      const key = hash(item);\n      let id = table.get(key);\n      if (id === undefined) {\n        id = table.size;\n        table.set(key, id);\n      }\n      return id;\n    };\n    ids = { a: Int32Array.from(a, idOf), b: Int32Array.from(b, idOf) };\n    const { a: ia, b: ib } = ids;\n    eq = (i, j) => ia[i] === ib[j];\n  }\n\n  const ops: number[] = [];\n  diffRange({ eq, ids, direct, maxDepth }, 0, a.length, 0, b.length, ops, 0);\n\n  // Group into runs, deletions first within each changed stretch.\n  const runs: DiffRun[] = [];\n  const push = (type: DiffOpType, aIndex: number, bIndex: number, length: number) => {\n    if (length === 0) return;\n    const last = runs[runs.length - 1];\n    if (last && last.type === type) {\n      last.length += length;\n    } else {\n      runs.push({ type, aIndex, bIndex, length });\n    }\n  };\n  let i = 0;\n  let j = 0;\n  let k = 0;\n  while (k < ops.length) {\n    if (ops[k] === EQUAL) {\n      let n = 0;\n      while (k < ops.length && ops[k] === EQUAL) {\n        n++;\n        k++;\n      }\n      push(\"equal\", i, j, n);\n      i += n;\n      j += n;\n      continue;\n    }\n    let dels = 0;\n    let inss = 0;\n    while (k < ops.length && ops[k] !== EQUAL) {\n      if (ops[k] === DELETE) dels++;\n      else inss++;\n      k++;\n    }\n    push(\"delete\", i, j, dels);\n    push(\"insert\", i + dels, j, inss);\n    i += dels;\n    j += inss;\n  }\n  return runs;\n}\n\n/** Groups an edit script into inserted, deleted and replaced ranges. */\nexport function diffChanges<T>(\n  a: readonly T[],\n  b: readonly T[],\n  options: DiffSequencesOptions<T> = {},\n): DiffChange[] {\n  const changes: DiffChange[] = [];\n  let current: DiffChange | null = null;\n  for (const run of diffSequences(a, b, options)) {\n    if (run.type === \"equal\") {\n      current = null;\n      continue;\n    }\n    if (!current) {\n      current = {\n        kind: run.type === \"delete\" ? \"deleted\" : \"inserted\",\n        aStart: run.aIndex,\n        aEnd: run.aIndex,\n        bStart: run.bIndex,\n        bEnd: run.bIndex,\n      };\n      changes.push(current);\n    }\n    if (run.type === \"delete\") {\n      current.aEnd = run.aIndex + run.length;\n    } else {\n      current.bEnd = run.bIndex + run.length;\n    }\n    if (current.aEnd > current.aStart && current.bEnd > current.bStart) current.kind = \"replaced\";\n  }\n  return changes;\n}\n","// Portions ported from wordcraft/crates/engine/src/cmd/tools.rs (MIT OR Apache-2.0, © ArtCraft Team and contributors). See THIRD_PARTY_NOTICES.md.\n\nimport { createDocument } from \"@tiptap/core\";\nimport {\n  Fragment,\n  Mark as ProsemirrorMark,\n  type MarkType,\n  type Node as ProsemirrorNode,\n  type Schema,\n} from \"@tiptap/pm/model\";\nimport {\n  BLOCK_CHANGE_ATTRIBUTE,\n  DELETION_MARK_NAME,\n  FORMAT_CHANGE_MARK_NAME,\n  INSERTION_MARK_NAME,\n  getTrackedChanges,\n  resolveTrackedChanges,\n  type TrackedBlockChangeAttributes,\n  type TrackedBlockOperation,\n  type TrackedBlockSnapshot,\n  type TrackedChangeAttributes,\n  type TrackedMark,\n} from \"../extensions/track-changes\";\nimport { createReviewId, type ReviewAuthor } from \"../extensions/comment-store\";\nimport { diffSequences } from \"./diff\";\n\n/** A document to compare: a ProseMirror node, its JSON, or HTML (needs a DOM). */\nexport type CompareSource = ProsemirrorNode | Record<string, any> | string;\n\nexport interface CompareDocumentsOptions {\n  /** Schema of the documents. Required unless both sources are ProseMirror nodes. */\n  schema?: Schema;\n  /** Author recorded on every change. Default `{ id: \"compare\", name: \"Compare\" }`. */\n  author?: ReviewAuthor;\n  /** Time recorded on every change (`createdAt`). Default now. */\n  date?: number | Date | string;\n  /** Compare changed paragraphs word by word (default) or character by character. */\n  granularity?: \"word\" | \"char\";\n  /** Treat text differing only in case as equal (the revised text is kept). */\n  ignoreCase?: boolean;\n  /** Treat runs of white space as equal (the revised text is kept). */\n  ignoreWhitespace?: boolean;\n  /** Record formatting differences of equal text as `formatChange` marks. Default `true`. */\n  formatting?: boolean;\n  /** Change id generator. */\n  generateId?: () => string;\n  /** Marks not compared as formatting (in addition to review marks, comments and bookmarks). */\n  ignoredMarks?: string[];\n  /** Node attributes ignored when comparing blocks. Default `[\"id\"]`. */\n  ignoredBlockAttributes?: string[];\n  /**\n   * Paragraphs longer than this (in characters) are compared by words even\n   * at `granularity: \"char\"`. Default 2000.\n   */\n  maxCharDiff?: number;\n}\n\nexport interface CompareSummary {\n  /** Inserted text runs and inserted block runs. */\n  insertions: number;\n  /** Deleted text runs and deleted block runs. */\n  deletions: number;\n  /** Formatting changes of equal text. */\n  formatChanges: number;\n  /** Block type, attribute and wrapping changes. */\n  blockChanges: number;\n  /** Differences the result could not represent as tracked changes. */\n  notHonoured: string[];\n}\n\nexport interface CompareDocumentsResult {\n  /**\n   * The revised document with the differences as tracked changes: accepting\n   * all changes yields the revised document, rejecting all the original.\n   */\n  doc: ProsemirrorNode;\n  summary: CompareSummary;\n}\n\n/** Marks that are never compared as formatting. */\nconst REVIEW_MARK_NAMES = new Set([\n  INSERTION_MARK_NAME,\n  DELETION_MARK_NAME,\n  FORMAT_CHANGE_MARK_NAME,\n  \"comment\",\n  \"bookmark\",\n]);\n\n/** Container types that pair with each other (a list whose type changed). */\nconst LIST_TYPES = new Set([\"bulletList\", \"orderedList\"]);\n\nconst OBJECT_REPLACEMENT = \"\";\n\ntype Wrapper = TrackedBlockSnapshot[\"wrappers\"][number];\n\ninterface Unit {\n  /** One code point, or \"\" for an inline leaf node. */\n  text: string;\n  node: ProsemirrorNode | null;\n  marks: readonly ProsemirrorMark[];\n}\n\ninterface Context {\n  schema: Schema;\n  author: ReviewAuthor;\n  createdAt: number;\n  generateId: () => string;\n  granularity: \"word\" | \"char\";\n  ignoreCase: boolean;\n  ignoreWhitespace: boolean;\n  formatting: boolean;\n  maxCharDiff: number;\n  ignoredMarks: Set<string>;\n  ignoredAttributes: Set<string>;\n  insertion?: MarkType;\n  deletion?: MarkType;\n  format?: MarkType;\n  notes: Set<string>;\n  keys: Map<ProsemirrorNode, string>;\n  /** Shared change of the textblocks inside a container whose type changed. */\n  wrapperChange: (() => TrackedChangeAttributes) | null;\n}\n\nfunction stableStringify(value: unknown): string {\n  if (value === undefined) return \"null\";\n  if (value === null || typeof value !== \"object\") return JSON.stringify(value);\n  if (Array.isArray(value)) return `[${value.map(stableStringify).join(\",\")}]`;\n  const keys = Object.keys(value as object).sort();\n  return `{${keys\n    .map((key) => `${JSON.stringify(key)}:${stableStringify((value as any)[key])}`)\n    .join(\",\")}}`;\n}\n\nfunction toTime(date: CompareDocumentsOptions[\"date\"]): number {\n  if (date instanceof Date) return date.getTime();\n  if (typeof date === \"string\") {\n    const time = Date.parse(date);\n    return Number.isNaN(time) ? Date.now() : time;\n  }\n  return typeof date === \"number\" ? date : Date.now();\n}\n\nfunction toNode(source: CompareSource, schema: Schema): ProsemirrorNode {\n  if (typeof source === \"string\") return createDocument(source, schema);\n  if (typeof (source as ProsemirrorNode).descendants === \"function\") {\n    const node = source as ProsemirrorNode;\n    return node.type.schema === schema ? node : schema.nodeFromJSON(node.toJSON());\n  }\n  return schema.nodeFromJSON(source);\n}\n\nfunction newAttributes(ctx: Context): TrackedChangeAttributes {\n  return {\n    changeId: ctx.generateId(),\n    authorId: ctx.author.id,\n    authorName: ctx.author.name,\n    authorColor: ctx.author.color ?? null,\n    createdAt: ctx.createdAt,\n  };\n}\n\n/** Lazily created attributes shared by one run of changes. */\nfunction lazyAttributes(ctx: Context): () => TrackedChangeAttributes {\n  let attrs: TrackedChangeAttributes | null = null;\n  return () => (attrs = attrs ?? newAttributes(ctx));\n}\n\nfunction stripBlockChange(attrs: Record<string, any>): Record<string, any> {\n  const copy = { ...attrs };\n  delete copy[BLOCK_CHANGE_ATTRIBUTE];\n  return copy;\n}\n\nfunction wrapperOf(node: ProsemirrorNode): Wrapper {\n  return { type: node.type.name, attrs: stripBlockChange(node.attrs) };\n}\n\nfunction snapshot(node: ProsemirrorNode, wrappers: Wrapper[]): TrackedBlockSnapshot {\n  return { type: node.type.name, attrs: stripBlockChange(node.attrs), wrappers };\n}\n\nfunction filteredAttributes(attrs: Record<string, any>, ctx: Context): string {\n  return stableStringify(\n    Object.fromEntries(\n      Object.entries(attrs ?? {}).filter(\n        ([key]) => key !== BLOCK_CHANGE_ATTRIBUTE && !ctx.ignoredAttributes.has(key),\n      ),\n    ),\n  );\n}\n\n/** Mirrors the tracker's block comparison: type, attributes and wrapper types. */\nfunction sameBlock(a: TrackedBlockSnapshot, b: TrackedBlockSnapshot, ctx: Context): boolean {\n  if (a.type !== b.type) return false;\n  if (filteredAttributes(a.attrs, ctx) !== filteredAttributes(b.attrs, ctx)) return false;\n  if (a.wrappers.length !== b.wrappers.length) return false;\n  return a.wrappers.every((w, i) => w.type === b.wrappers[i].type);\n}\n\nconst hasBlockChange = (node: ProsemirrorNode) =>\n  !!node.type.spec.attrs && BLOCK_CHANGE_ATTRIBUTE in node.type.spec.attrs;\n\nconst label = (node: ProsemirrorNode) => node.type.name;\n\n// ---------------------------------------------------------------------------\n// Keys\n// ---------------------------------------------------------------------------\n\nfunction normalize(text: string, ctx: Context): string {\n  let result = ctx.ignoreWhitespace ? text.replace(/\\s+/g, \" \") : text;\n  if (ctx.ignoreCase) result = result.toLowerCase();\n  return result;\n}\n\nfunction leafKey(node: ProsemirrorNode): string {\n  return `${node.type.name}${stableStringify(stripBlockChange(node.attrs))}`;\n}\n\nfunction group(node: ProsemirrorNode): string {\n  return LIST_TYPES.has(node.type.name) ? \"list\" : node.type.name;\n}\n\n/** Block key: textblocks by their (normalized) text only, so type changes pair up. */\nfunction blockKey(node: ProsemirrorNode, ctx: Context): string {\n  const cached = ctx.keys.get(node);\n  if (cached !== undefined) return cached;\n  let key: string;\n  if (node.isTextblock) {\n    let text = \"\";\n    node.forEach((child) => {\n      text += child.isText ? child.text : `${OBJECT_REPLACEMENT}${leafKey(child)}${OBJECT_REPLACEMENT}`;\n    });\n    text = normalize(text, ctx);\n    key = `T\\u0000${ctx.ignoreWhitespace ? text.trim() : text}`;\n  } else if (node.isLeaf) {\n    key = `A\\u0000${leafKey(node)}`;\n  } else {\n    const parts: string[] = [];\n    node.forEach((child) => parts.push(blockKey(child, ctx)));\n    key = `C\\u0000${group(node)}\\u0000${parts.join(\"\\u0001\")}\\u0002`;\n  }\n  ctx.keys.set(node, key);\n  return key;\n}\n\nfunction compatible(a: ProsemirrorNode, b: ProsemirrorNode): boolean {\n  if (a.isTextblock || b.isTextblock) return a.isTextblock && b.isTextblock;\n  if (a.isLeaf || b.isLeaf) return a.isLeaf && b.isLeaf && a.type === b.type;\n  return group(a) === group(b);\n}\n\n// ---------------------------------------------------------------------------\n// Whole blocks\n// ---------------------------------------------------------------------------\n\nfunction markInline(\n  content: Fragment,\n  mark: ProsemirrorMark,\n): Fragment {\n  const nodes: ProsemirrorNode[] = [];\n  content.forEach((child) => nodes.push(child.mark(mark.addToSet(child.marks))));\n  return Fragment.from(nodes);\n}\n\n/**\n * A block deleted or inserted as a whole: every textblock inside gets a\n * `blockChange` record with the operation (one change id per run).\n */\nfunction wholeBlock(\n  node: ProsemirrorNode,\n  operation: TrackedBlockOperation,\n  wrappers: Wrapper[],\n  attrs: () => TrackedChangeAttributes,\n  ctx: Context,\n): ProsemirrorNode[] {\n  const verb = operation === \"insert\" ? \"Inserted\" : \"Deleted\";\n  if (node.isTextblock) {\n    if (hasBlockChange(node)) {\n      const record: TrackedBlockChangeAttributes = {\n        ...attrs(),\n        previous: snapshot(node, wrappers),\n        operation,\n      };\n      return [node.type.create({ ...node.attrs, [BLOCK_CHANGE_ATTRIBUTE]: record }, node.content, node.marks)];\n    }\n    // No block record: fall back to marking the text.\n    const markType = operation === \"insert\" ? ctx.insertion : ctx.deletion;\n    if (markType && node.type.allowsMarkType(markType) && node.content.size > 0) {\n      ctx.notes.add(\n        `${verb} ${label(node)} blocks have no \"${BLOCK_CHANGE_ATTRIBUTE}\" attribute: only their text is tracked, so an empty block remains when the change is ${operation === \"insert\" ? \"rejected\" : \"accepted\"}.`,\n      );\n      return [node.type.create(node.attrs, markInline(node.content, markType.create(attrs())), node.marks)];\n    }\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n  if (node.isLeaf) {\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n  const inner = [...wrappers, wrapperOf(node)];\n  const children: ProsemirrorNode[] = [];\n  node.forEach((child) => children.push(...wholeBlock(child, operation, inner, attrs, ctx)));\n  try {\n    return [node.type.createChecked(node.attrs, children, node.marks)];\n  } catch {\n    ctx.notes.add(`${verb} ${label(node)} blocks cannot be tracked.`);\n    return operation === \"insert\" ? [node] : [];\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Inline comparison\n// ---------------------------------------------------------------------------\n\nfunction units(node: ProsemirrorNode): Unit[] {\n  const result: Unit[] = [];\n  node.forEach((child) => {\n    if (child.isText) {\n      for (const ch of child.text ?? \"\") result.push({ text: ch, node: null, marks: child.marks });\n    } else {\n      result.push({ text: \"\", node: child, marks: child.marks });\n    }\n  });\n  return result;\n}\n\nconst SPACE = /\\s/u;\nconst WORD = /[\\p{L}\\p{N}\\p{M}_]/u;\n\nconst isSpace = (u: Unit) => !u.node && SPACE.test(u.text);\nconst isWord = (u: Unit) => !u.node && WORD.test(u.text);\n\n/** Token ranges: words, white space runs and single symbols, or characters. */\nfunction tokenize(list: Unit[], chars: boolean): [number, number][] {\n  const tokens: [number, number][] = [];\n  if (chars) {\n    for (let i = 0; i < list.length; i++) tokens.push([i, i + 1]);\n    return tokens;\n  }\n  let i = 0;\n  while (i < list.length) {\n    const start = i;\n    const unit = list[i];\n    if (isSpace(unit)) {\n      while (i < list.length && isSpace(list[i])) i++;\n    } else if (isWord(unit)) {\n      while (i < list.length && isWord(list[i])) i++;\n    } else {\n      i++;\n    }\n    tokens.push([start, i]);\n  }\n  return tokens;\n}\n\ntype Stretch =\n  | { type: \"equal\"; aIndex: number; bIndex: number; length: number }\n  | { type: \"change\"; aFrom: number; aTo: number; bFrom: number; bTo: number };\n\n/**\n * Groups token runs into equal stretches and changes. White space alone\n * between two changes joins them, so \"a b\" → \"x y\" reads as one\n * replacement instead of alternating deletions and insertions.\n */\nfunction stretches(runs: ReturnType<typeof diffSequences>, list: Unit[], tokens: [number, number][]): Stretch[] {\n  const spaceOnly = (bIndex: number, length: number) => {\n    for (let t = bIndex; t < bIndex + length; t++) {\n      const [from, to] = tokens[t];\n      for (let k = from; k < to; k++) if (!isSpace(list[k])) return false;\n    }\n    return true;\n  };\n  const result: Stretch[] = [];\n  runs.forEach((run, index) => {\n    const prev = runs[index - 1];\n    const next = runs[index + 1];\n    const absorbed =\n      run.type === \"equal\" &&\n      prev &&\n      next &&\n      prev.type !== \"equal\" &&\n      next.type !== \"equal\" &&\n      spaceOnly(run.bIndex, run.length);\n    if (run.type === \"equal\" && !absorbed) {\n      result.push({ type: \"equal\", aIndex: run.aIndex, bIndex: run.bIndex, length: run.length });\n      return;\n    }\n    let last = result[result.length - 1];\n    if (!last || last.type !== \"change\") {\n      last = { type: \"change\", aFrom: run.aIndex, aTo: run.aIndex, bFrom: run.bIndex, bTo: run.bIndex };\n      result.push(last);\n    }\n    if (run.type !== \"insert\") last.aTo = run.aIndex + run.length;\n    if (run.type !== \"delete\") last.bTo = run.bIndex + run.length;\n  });\n  return result;\n}\n\nfunction tokenKey(list: Unit[], [from, to]: [number, number], ctx: Context): string {\n  let text = \"\";\n  for (let i = from; i < to; i++) {\n    const unit = list[i];\n    text += unit.node ? `${OBJECT_REPLACEMENT}${leafKey(unit.node)}${OBJECT_REPLACEMENT}` : unit.text;\n  }\n  return normalize(text, ctx);\n}\n\nfunction formattingOf(marks: readonly ProsemirrorMark[], ctx: Context): ProsemirrorMark[] {\n  return marks.filter(\n    (mark) => !REVIEW_MARK_NAMES.has(mark.type.name) && !ctx.ignoredMarks.has(mark.type.name),\n  );\n}\n\nfunction withoutReviewMarks(marks: readonly ProsemirrorMark[]): readonly ProsemirrorMark[] {\n  return marks.filter(\n    (mark) =>\n      mark.type.name !== INSERTION_MARK_NAME &&\n      mark.type.name !== DELETION_MARK_NAME &&\n      mark.type.name !== FORMAT_CHANGE_MARK_NAME,\n  );\n}\n\n/**\n * Merges the inline content of two paired textblocks: equal tokens keep the\n * revised text (with `formatChange` where formatting differs), deleted\n * tokens are re-inserted with the `deletion` mark before inserted tokens.\n */\nfunction mergeInline(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  parentType: ProsemirrorNode[\"type\"],\n  ctx: Context,\n): Fragment {\n  const a = units(original);\n  const b = units(revised);\n  let chars = ctx.granularity === \"char\";\n  if (chars && Math.max(a.length, b.length) > ctx.maxCharDiff) {\n    chars = false;\n    ctx.notes.add(\n      `Paragraphs longer than ${ctx.maxCharDiff} characters were compared by words instead of characters.`,\n    );\n  }\n  const ta = tokenize(a, chars);\n  const tb = tokenize(b, chars);\n  const runs = diffSequences(\n    ta.map((t) => tokenKey(a, t, ctx)),\n    tb.map((t) => tokenKey(b, t, ctx)),\n  );\n\n  const format = ctx.formatting && ctx.format && parentType.allowsMarkType(ctx.format) ? ctx.format : null;\n  const out: Unit[] = [];\n  let formatRun: { attrs: TrackedChangeAttributes; key: string } | null = null;\n\n  const emit = (\n    source: Unit[],\n    tokens: [number, number][],\n    from: number,\n    to: number,\n    markType: MarkType,\n  ) => {\n    if (to <= from) return;\n    const mark = markType.create(newAttributes(ctx));\n    for (let k = tokens[from][0]; k < tokens[to - 1][1]; k++) {\n      const unit = source[k];\n      out.push({ ...unit, marks: mark.addToSet(withoutReviewMarks(unit.marks)) });\n    }\n  };\n\n  for (const run of stretches(runs, b, tb)) {\n    if (run.type === \"equal\") {\n      for (let t = 0; t < run.length; t++) {\n        const [aFrom, aTo] = ta[run.aIndex + t];\n        const [bFrom, bTo] = tb[run.bIndex + t];\n        for (let k = bFrom; k < bTo; k++) {\n          const unit = b[k];\n          const before = a[Math.min(aFrom + (k - bFrom), aTo - 1)];\n          const marks = withoutReviewMarks(unit.marks);\n          if (!format) {\n            formatRun = null;\n            out.push({ ...unit, marks });\n            continue;\n          }\n          const oldFormat = formattingOf(before.marks, ctx);\n          const newFormat = formattingOf(unit.marks, ctx);\n          if (ProsemirrorMark.sameSet(oldFormat, newFormat)) {\n            formatRun = null;\n            out.push({ ...unit, marks });\n            continue;\n          }\n          const beforeJSON = oldFormat.map((m) => m.toJSON() as TrackedMark);\n          const afterJSON = newFormat.map((m) => m.toJSON() as TrackedMark);\n          const key = stableStringify([beforeJSON, afterJSON]);\n          if (!formatRun || formatRun.key !== key) formatRun = { attrs: newAttributes(ctx), key };\n          const mark = format.create({ ...formatRun.attrs, before: beforeJSON, after: afterJSON });\n          out.push({ ...unit, marks: mark.addToSet(marks) });\n        }\n      }\n      continue;\n    }\n    formatRun = null;\n    emit(a, ta, run.aFrom, run.aTo, ctx.deletion!);\n    emit(b, tb, run.bFrom, run.bTo, ctx.insertion!);\n  }\n\n  const nodes: ProsemirrorNode[] = [];\n  let i = 0;\n  while (i < out.length) {\n    const unit = out[i];\n    if (unit.node) {\n      nodes.push(unit.node.mark(unit.marks));\n      i++;\n      continue;\n    }\n    let text = unit.text;\n    let j = i + 1;\n    while (j < out.length && !out[j].node && ProsemirrorMark.sameSet(out[j].marks, unit.marks)) {\n      text += out[j].text;\n      j++;\n    }\n    nodes.push(ctx.schema.text(text, unit.marks));\n    i = j;\n  }\n  return Fragment.from(nodes);\n}\n\n// ---------------------------------------------------------------------------\n// Blocks\n// ---------------------------------------------------------------------------\n\nfunction mergeTextblocks(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  const replaceWhole = () => [\n    ...wholeBlock(original, \"delete\", rPath, lazyAttributes(ctx), ctx),\n    ...wholeBlock(revised, \"insert\", rPath, lazyAttributes(ctx), ctx),\n  ];\n\n  let attrs: Record<string, any> = { ...revised.attrs };\n  const previous = snapshot(original, oPath);\n  if (!sameBlock(previous, snapshot(revised, rPath), ctx)) {\n    if (hasBlockChange(revised)) {\n      // Only the wrappers changed (e.g. bulleted → numbered list): one change per container.\n      const onlyWrappers =\n        ctx.wrapperChange &&\n        sameBlock(previous, { ...snapshot(revised, rPath), wrappers: previous.wrappers }, ctx);\n      const base = onlyWrappers ? ctx.wrapperChange!() : newAttributes(ctx);\n      attrs = { ...attrs, [BLOCK_CHANGE_ATTRIBUTE]: { ...base, previous } };\n    } else {\n      ctx.notes.add(`Block changes to ${label(revised)} blocks cannot be tracked.`);\n    }\n  } else if (BLOCK_CHANGE_ATTRIBUTE in attrs) {\n    attrs[BLOCK_CHANGE_ATTRIBUTE] = null;\n  }\n\n  const type = revised.type;\n  const inlineTracking =\n    !!ctx.insertion &&\n    !!ctx.deletion &&\n    type.allowsMarkType(ctx.insertion) &&\n    type.allowsMarkType(ctx.deletion);\n  if (!inlineTracking) {\n    // e.g. code blocks in a headless schema: equal text keeps the block,\n    // anything else is replaced whole.\n    if (!original.content.eq(revised.content)) return replaceWhole();\n    return [type.create(attrs, revised.content, revised.marks)];\n  }\n  const content = mergeInline(original, revised, type, ctx);\n  if (!type.validContent(content)) {\n    ctx.notes.add(`Changes between ${label(original)} and ${label(revised)} blocks were tracked as whole-block replacements.`);\n    return replaceWhole();\n  }\n  return [type.create(attrs, content, revised.marks)];\n}\n\nfunction mergePair(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  if (original.isTextblock) return mergeTextblocks(original, revised, oPath, rPath, ctx);\n  const replaceWhole = () => [\n    ...wholeBlock(original, \"delete\", rPath, lazyAttributes(ctx), ctx),\n    ...wholeBlock(revised, \"insert\", rPath, lazyAttributes(ctx), ctx),\n  ];\n  if (original.isLeaf) {\n    return original.eq(revised) ? [revised] : replaceWhole();\n  }\n  if (\n    original.type === revised.type &&\n    filteredAttributes(original.attrs, ctx) !== filteredAttributes(revised.attrs, ctx)\n  ) {\n    ctx.notes.add(`Attribute changes of ${label(revised)} nodes are not tracked.`);\n  }\n  const outer = ctx.wrapperChange;\n  if (original.type !== revised.type) ctx.wrapperChange = lazyAttributes(ctx);\n  let children: ProsemirrorNode[];\n  try {\n    children = compareChildren(\n      original,\n      revised,\n      [...oPath, wrapperOf(original)],\n      [...rPath, wrapperOf(revised)],\n      ctx,\n    );\n  } finally {\n    ctx.wrapperChange = outer;\n  }\n  try {\n    return [revised.type.createChecked(revised.attrs, children, revised.marks)];\n  } catch {\n    ctx.notes.add(`Changes inside ${label(revised)} nodes were tracked as whole-block replacements.`);\n    return replaceWhole();\n  }\n}\n\nfunction compareChildren(\n  original: ProsemirrorNode,\n  revised: ProsemirrorNode,\n  oPath: Wrapper[],\n  rPath: Wrapper[],\n  ctx: Context,\n): ProsemirrorNode[] {\n  const a: ProsemirrorNode[] = [];\n  const b: ProsemirrorNode[] = [];\n  original.forEach((child) => a.push(child));\n  revised.forEach((child) => b.push(child));\n  const runs = diffSequences(a, b, { hash: (node) => blockKey(node, ctx) });\n  const out: ProsemirrorNode[] = [];\n\n  for (let r = 0; r < runs.length; r++) {\n    const run = runs[r];\n    if (run.type === \"equal\") {\n      for (let t = 0; t < run.length; t++) {\n        out.push(...mergePair(a[run.aIndex + t], b[run.bIndex + t], oPath, rPath, ctx));\n      }\n      continue;\n    }\n    // A run of deletions and insertions: the i-th deleted block pairs with\n    // the i-th inserted one when they are alike; the rest are whole.\n    let dels: ProsemirrorNode[] = [];\n    let inss: ProsemirrorNode[] = [];\n    if (run.type === \"delete\") {\n      dels = a.slice(run.aIndex, run.aIndex + run.length);\n      const next = runs[r + 1];\n      if (next?.type === \"insert\") {\n        inss = b.slice(next.bIndex, next.bIndex + next.length);\n        r++;\n      }\n    } else {\n      inss = b.slice(run.bIndex, run.bIndex + run.length);\n    }\n    const deleted = lazyAttributes(ctx);\n    const inserted = lazyAttributes(ctx);\n    for (let x = 0; x < Math.max(dels.length, inss.length); x++) {\n      const del = dels[x];\n      const ins = inss[x];\n      if (del && ins && compatible(del, ins)) {\n        out.push(...mergePair(del, ins, oPath, rPath, ctx));\n        continue;\n      }\n      if (del) out.push(...wholeBlock(del, \"delete\", rPath, deleted, ctx));\n      if (ins) out.push(...wholeBlock(ins, \"insert\", rPath, inserted, ctx));\n    }\n  }\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\nfunction summarize(doc: ProsemirrorNode, notes: Set<string>): CompareSummary {\n  const summary: CompareSummary = {\n    insertions: 0,\n    deletions: 0,\n    formatChanges: 0,\n    blockChanges: 0,\n    notHonoured: [...notes],\n  };\n  getTrackedChanges(doc).forEach((change) => {\n    if (change.type === \"insertion\" || change.block?.operation === \"insert\") summary.insertions++;\n    else if (change.type === \"deletion\" || change.block?.operation === \"delete\") summary.deletions++;\n    else if (change.type === \"format\") summary.formatChanges++;\n    else summary.blockChanges++;\n  });\n  return summary;\n}\n\n/**\n * Compares two documents and returns the revised document with the\n * differences as tracked changes (`insertion`/`deletion`/`formatChange`\n * marks and `blockChange` records), plus a summary.\n *\n * Blocks are matched by their text (Myers diff with patience anchors); in a\n * run of changed blocks the i-th deleted block is paired with the i-th\n * inserted one and compared word by word (or by character), while unpaired\n * blocks are recorded as whole-block insertions/deletions. Equal text is\n * compared for formatting, and type/attribute/wrapping changes become\n * `blockChange` records. Without ignore options, accepting all changes\n * yields the revised document and rejecting all yields the original.\n *\n * The schema needs the `TrackChanges` extension (marks and the\n * `blockChange` attribute). Existing tracked changes in either document are\n * accepted first.\n */\nexport function compareDocuments(\n  original: CompareSource,\n  revised: CompareSource,\n  options: CompareDocumentsOptions = {},\n): CompareDocumentsResult {\n  const schema =\n    options.schema ??\n    (typeof (original as ProsemirrorNode)?.descendants === \"function\"\n      ? (original as ProsemirrorNode).type.schema\n      : typeof (revised as ProsemirrorNode)?.descendants === \"function\"\n        ? (revised as ProsemirrorNode).type.schema\n        : null);\n  if (!schema) throw new Error(\"compareDocuments: `schema` is required for JSON or HTML sources.\");\n\n  const ctx: Context = {\n    schema,\n    author: options.author ?? { id: \"compare\", name: \"Compare\" },\n    createdAt: toTime(options.date),\n    generateId: options.generateId ?? (() => createReviewId(\"change\")),\n    granularity: options.granularity ?? \"word\",\n    ignoreCase: !!options.ignoreCase,\n    ignoreWhitespace: !!options.ignoreWhitespace,\n    formatting: options.formatting !== false,\n    maxCharDiff: options.maxCharDiff ?? 2000,\n    ignoredMarks: new Set(options.ignoredMarks ?? []),\n    ignoredAttributes: new Set(options.ignoredBlockAttributes ?? [\"id\"]),\n    insertion: schema.marks[INSERTION_MARK_NAME],\n    deletion: schema.marks[DELETION_MARK_NAME],\n    format: schema.marks[FORMAT_CHANGE_MARK_NAME],\n    notes: new Set(),\n    keys: new Map(),\n    wrapperChange: null,\n  };\n  if (!ctx.insertion || !ctx.deletion) {\n    throw new Error(\"compareDocuments: the schema needs the TrackChanges extension (insertion/deletion marks).\");\n  }\n  if (ctx.formatting && !ctx.format) {\n    ctx.notes.add(\"Formatting differences cannot be tracked: the schema has no formatChange mark.\");\n  }\n\n  const prepare = (source: CompareSource) => {\n    const doc = toNode(source, schema);\n    if (getTrackedChanges(doc).length === 0) return doc;\n    ctx.notes.add(\"Tracked changes already in the documents were accepted before comparing.\");\n    return resolveTrackedChanges(doc, \"accepted\");\n  };\n  const a = prepare(original);\n  const b = prepare(revised);\n\n  const children = compareChildren(a, b, [], [], ctx);\n  let doc: ProsemirrorNode;\n  try {\n    doc = b.type.createChecked(b.attrs, children, b.marks);\n  } catch {\n    doc = b.type.createAndFill(b.attrs, children, b.marks) ?? b;\n    ctx.notes.add(\"The compared document had to be repaired to fit the schema.\");\n  }\n  return { doc, summary: summarize(doc, ctx.notes) };\n}\n\n/** `compareDocuments` for two HTML strings (needs a DOM, like `setContent`). */\nexport function compareHtml(\n  originalHtml: string,\n  revisedHtml: string,\n  options: CompareDocumentsOptions & { schema: Schema },\n): CompareDocumentsResult {\n  return compareDocuments(originalHtml, revisedHtml, options);\n}\n"]}