@pixerate/editor 0.22.0 → 0.24.0

package/dist/{chunk-QGHGJ56O.js → chunk-ITBSKI26.js}

@@ -1,10 +1,13 @@
+import {
+  compareDocuments
+} from "./chunk-FODNLX5N.js";
 import {
   INSTRUCTION_REGEX,
   TEMPLATE_REGEX,
   VARIABLE_REGEX,
   matchConditionalTags,
   parseVariableBody
-} from "./chunk-B2ZRLN4S.js";
+} from "./chunk-P6ODPZ4W.js";
 import {
   PIXERATE_DOCUMENT_MIME,
   getClipboardData,
@@ -13,16 +16,20 @@ import {
   rtfToPlainText,
   sanitizeImportedHtml,
   serializeRichClipboardPayload
-} from "./chunk-JJDLPEWL.js";
+} from "./chunk-3LV6RRPH.js";
 import {
-  CommentStore,
-  TrackChanges,
-  createReviewId,
   escapeHtml,
   htmlToPlainText,
   markdownToTipTapHtml,
   plainTextToSlice
-} from "./chunk-MJZBNWG7.js";
+} from "./chunk-PGNZKFQS.js";
+import {
+  CommentStore,
+  TRACK_CHANGES_SKIP_META,
+  TrackChanges,
+  createReviewId,
+  trackChangesPluginKey
+} from "./chunk-5S3Z4PPF.js";
 
 // src/extensions/gradient-text.ts
 import { Mark } from "@tiptap/core";
@@ -124,11 +131,12 @@ var createGradientDecorations = (doc, options) => {
         result.error ? {
           class: "underline decoration-wavy decoration-red-500 text-red-600 dark:text-red-400",
           "data-conditional-error": result.error,
-          title: result.error === "unclosed-section" ? `Section "${tag.name}" is never closed with {/${tag.name}}` : `{/${tag.name}} does not close any open section`
+          title: result.error === "invalid-condition" ? `Invalid condition: ${result.comparison?.error ?? tag.name}` : result.error === "unclosed-section" ? `Section "${tag.name}" is never closed with {/${tag.name}}` : `{/${tag.name}} does not close any open section`
         } : {
           class: "bg-amber-400/30 text-amber-700 dark:text-amber-300 font-medium px-0.5 rounded-xs",
           "data-conditional": tag.conditional,
-          "data-variable-condition": tag.name
+          // A comparison (`{?amount>100}`) names its subject variable.
+          "data-variable-condition": result.comparison?.subject ?? tag.name
         }
       )
     );
@@ -2028,8 +2036,56 @@ function getCommentAuthor(editor) {
   return ext ? resolveAuthor(ext.options.author) : null;
 }
 
-// src/extensions/file-import.ts
+// src/extensions/document-compare.ts
 import { Extension as Extension7 } from "@tiptap/core";
+function trackChangesAuthor(state) {
+  return trackChangesPluginKey.getState(state)?.author;
+}
+function compareInEditor(editor, original, revised, options = {}) {
+  return compareDocuments(original, revised, {
+    ...options,
+    author: options.author ?? trackChangesAuthor(editor.state),
+    schema: editor.schema
+  });
+}
+function applyDocumentComparison(editor, original, revised, options = {}) {
+  const result = compareInEditor(editor, original, revised, options);
+  const { state } = editor;
+  const tr = state.tr.replaceWith(0, state.doc.content.size, result.doc.content);
+  tr.setMeta(TRACK_CHANGES_SKIP_META, true);
+  editor.view.dispatch(tr);
+  return result;
+}
+var DocumentCompare = Extension7.create({
+  name: "documentCompare",
+  addOptions() {
+    return { compare: {} };
+  },
+  addStorage() {
+    return { lastResult: null };
+  },
+  addCommands() {
+    return {
+      setContentFromComparison: (original, revised, options = {}) => ({ state, tr, dispatch }) => {
+        const merged = { ...this.options.compare, ...options };
+        const result = compareDocuments(original, revised, {
+          ...merged,
+          author: merged.author ?? trackChangesAuthor(state),
+          schema: state.schema
+        });
+        if (dispatch) {
+          tr.replaceWith(0, tr.doc.content.size, result.doc.content);
+          tr.setMeta(TRACK_CHANGES_SKIP_META, true);
+          this.storage.lastResult = result;
+        }
+        return true;
+      }
+    };
+  }
+});
+
+// src/extensions/file-import.ts
+import { Extension as Extension8 } from "@tiptap/core";
 import { Plugin as Plugin7, PluginKey as PluginKey4 } from "@tiptap/pm/state";
 
 // src/import/registry.ts
@@ -3321,7 +3377,7 @@ function dropPosition(view, event) {
     return void 0;
   }
 }
-var FileImport = Extension7.create({
+var FileImport = Extension8.create({
   name: "fileImport",
   addOptions() {
     return {
@@ -3372,7 +3428,7 @@ var FileImport = Extension7.create({
 });
 
 // src/extensions/rich-clipboard.ts
-import { Extension as Extension8 } from "@tiptap/core";
+import { Extension as Extension9 } from "@tiptap/core";
 import { Plugin as Plugin8, PluginKey as PluginKey5 } from "@tiptap/pm/state";
 var richClipboardPluginKey = new PluginKey5("richClipboard");
 function writeRichClipboard(view, event, options = {}) {
@@ -3392,7 +3448,7 @@ function writeRichClipboard(view, event, options = {}) {
   }
   return true;
 }
-var RichClipboard = Extension8.create({
+var RichClipboard = Extension9.create({
   name: "richClipboard",
   addOptions() {
     return {
@@ -3431,7 +3487,7 @@ var RichClipboard = Extension8.create({
 });
 
 // src/extensions/autocorrect.ts
-import { Extension as Extension9 } from "@tiptap/core";
+import { Extension as Extension10 } from "@tiptap/core";
 import { closeHistory } from "@tiptap/pm/history";
 import { Plugin as Plugin9, PluginKey as PluginKey6 } from "@tiptap/pm/state";
 var quoteOpener = /[\s ([{<—–‘“-]/;
@@ -3590,7 +3646,7 @@ function isInsidePromptToken(textBefore) {
   const underscores = textBefore.match(/__/g);
   return !!underscores && underscores.length % 2 === 1;
 }
-var Autocorrect = Extension9.create({
+var Autocorrect = Extension10.create({
   name: "autocorrect",
   addOptions() {
     return {
@@ -3738,7 +3794,7 @@ var Autocorrect = Extension9.create({
 });
 
 // src/extensions/document-structure/outline.ts
-import { Extension as Extension10 } from "@tiptap/core";
+import { Extension as Extension11 } from "@tiptap/core";
 import {
   Plugin as Plugin10,
   PluginKey as PluginKey7,
@@ -3974,7 +4030,7 @@ function assignHeadingIds(state, types, generateId) {
   });
   return tr;
 }
-var Outline = Extension10.create({
+var Outline = Extension11.create({
   name: "outline",
   priority: STRUCTURE_PRIORITY,
   addOptions() {
@@ -5169,6 +5225,1250 @@ function getDocumentStructureCommandItems(editor, query = "") {
   );
 }
 
+// src/extensions/find-replace/extension.ts
+import { Extension as Extension12 } from "@tiptap/core";
+import { Plugin as Plugin14, PluginKey as PluginKey11, TextSelection as TextSelection7 } from "@tiptap/pm/state";
+import { Decoration as Decoration4, DecorationSet as DecorationSet4 } from "@tiptap/pm/view";
+import { closeHistory as closeHistory2 } from "@tiptap/pm/history";
+
+// src/extensions/find-replace/pattern.ts
+var FIND_PARAGRAPH_MARK = "\r";
+var MAX_FIND_PATTERN_LENGTH = 1024;
+var MAX_COUNT = 1e3;
+var MAX_PROGRAM_SIZE = 2e4;
+var now = () => typeof performance !== "undefined" && typeof performance.now === "function" ? performance.now() : Date.now();
+function createSearchBudget(options = {}) {
+  return {
+    deadline: now() + (options.timeLimitMs ?? 250),
+    steps: options.maxSteps ?? 5e7,
+    exhausted: false
+  };
+}
+var PARA = 13;
+var ANY = (cp) => cp !== PARA;
+var LETTER = /\p{L}/u;
+var PUNCT = /\p{P}/u;
+var WORD = /[\p{L}\p{M}\p{Nd}\p{Pc}]/u;
+var foldCache = /* @__PURE__ */ new Map();
+function foldCodePoint(cp) {
+  if (cp < 128) return cp >= 65 && cp <= 90 ? cp + 32 : cp;
+  const cached = foldCache.get(cp);
+  if (cached !== void 0) return cached;
+  const lower = String.fromCodePoint(cp).toLowerCase();
+  const folded = [...lower].length === 1 ? lower.codePointAt(0) : cp;
+  if (foldCache.size < 4096) foldCache.set(cp, folded);
+  return folded;
+}
+function isWordChar(cp) {
+  if (cp < 0) return false;
+  if (cp < 128) {
+    return cp >= 48 && cp <= 57 || cp >= 65 && cp <= 90 || cp >= 97 && cp <= 122 || cp === 95;
+  }
+  return WORD.test(String.fromCodePoint(cp));
+}
+var isLetter = (cp) => cp < 128 ? cp >= 65 && cp <= 90 || cp >= 97 && cp <= 122 : LETTER.test(String.fromCodePoint(cp));
+function isPunct(cp) {
+  if (cp < 128) {
+    return cp >= 33 && cp <= 47 || cp >= 58 && cp <= 64 || cp >= 91 && cp <= 96 || cp >= 123 && cp <= 126;
+  }
+  return cp >= 8208 && cp <= 8231 || cp === 161 || cp === 191 || cp === 171 || cp === 187 || PUNCT.test(String.fromCodePoint(cp));
+}
+var isSpace = (cp) => cp === 32 || cp === 9 || cp === 160;
+function cpBefore(hay, pos) {
+  if (pos <= 0) return -1;
+  const low = hay.charCodeAt(pos - 1);
+  if (low >= 56320 && low <= 57343 && pos >= 2) {
+    const high = hay.charCodeAt(pos - 2);
+    if (high >= 55296 && high <= 56319) return hay.codePointAt(pos - 2);
+  }
+  return low;
+}
+var cpAt = (hay, pos) => pos < hay.length ? hay.codePointAt(pos) : -1;
+var PatternError = class extends Error {
+  constructor(code, message) {
+    super(message);
+    this.code = code;
+  }
+  code;
+};
+var charNode = (test) => ({ k: "char", test });
+var exact = (cp) => charNode((c) => c === cp);
+var literalNode = (cp, caseInsensitive) => {
+  if (!caseInsensitive) return exact(cp);
+  const f = foldCodePoint(cp);
+  return charNode((_c, folded) => folded === f);
+};
+var star = (body, lazy) => ({ k: "rep", body, min: 0, max: -1, lazy });
+function findCode(c) {
+  switch (c) {
+    case "p":
+      return exact(PARA);
+    case "t":
+      return exact(9);
+    case "?":
+      return charNode(ANY);
+    case "#":
+      return charNode((cp) => cp >= 48 && cp <= 57);
+    case "$":
+      return charNode((cp) => isLetter(cp));
+    case "^":
+      return exact(94);
+    case "l":
+      return exact(10);
+    case "m":
+      return exact(12);
+    case "n":
+      return exact(14);
+    case "+":
+      return exact(8212);
+    case "=":
+      return exact(8211);
+    case "s":
+      return exact(160);
+    case "~":
+      return exact(8209);
+    case "-":
+      return exact(173);
+    case "w":
+      return { k: "rep", body: charNode((cp) => isSpace(cp)), min: 1, max: -1, lazy: false };
+    case "g":
+      return exact(65532);
+    case "%":
+      return exact(167);
+    case "v":
+      return exact(182);
+    default:
+      return null;
+  }
+}
+function replaceCode(c) {
+  switch (c) {
+    case "p":
+      return FIND_PARAGRAPH_MARK;
+    case "t":
+      return "	";
+    case "^":
+      return "^";
+    case "l":
+      return "\n";
+    case "m":
+      return "\f";
+    case "n":
+      return "";
+    case "+":
+      return "\u2014";
+    case "=":
+      return "\u2013";
+    case "s":
+      return "\xA0";
+    case "~":
+      return "\u2011";
+    case "-":
+      return "\xAD";
+    case "%":
+      return "\xA7";
+    case "v":
+      return "\xB6";
+    default:
+      return null;
+  }
+}
+function codeChar(n) {
+  switch (n) {
+    case 13:
+      return PARA;
+    case 11:
+      return 10;
+    case 12:
+      return 12;
+    case 14:
+      return 14;
+    case 30:
+      return 8209;
+    case 31:
+      return 173;
+  }
+  if (n > 1114111 || n >= 55296 && n <= 57343) return null;
+  if (n < 32 && n !== 9 || n >= 127 && n < 160) return null;
+  return n;
+}
+function numericCode(chars, i) {
+  const unicode = chars[i] === "u";
+  const start2 = unicode ? i + 1 : i;
+  const max = unicode ? 5 : 4;
+  let digits = "";
+  for (let j = start2; j < chars.length && digits.length < max && /[0-9]/.test(chars[j]); j++) digits += chars[j];
+  if (!digits) return null;
+  const cp = codeChar(parseInt(digits, 10));
+  return cp === null ? null : { cp, used: start2 - i + digits.length };
+}
+var toChars = (s) => Array.from(s);
+var cpOf = (ch) => ch.codePointAt(0);
+function parseSpecial(query, o, caseInsensitive) {
+  const chars = toChars(query);
+  const atoms = [];
+  let spans = false;
+  let i = 0;
+  while (i < chars.length) {
+    const c = chars[i++];
+    if (c === "^" && !o.literal && i < chars.length) {
+      const n = chars[i];
+      const code = findCode(n);
+      if (code) {
+        if (n === "p") spans = true;
+        atoms.push(code);
+        i++;
+        continue;
+      }
+      const num = numericCode(chars, i);
+      if (num) {
+        if (num.cp === PARA) spans = true;
+        atoms.push(literalNode(num.cp, caseInsensitive));
+        i += num.used;
+        continue;
+      }
+    }
+    const cp = cpOf(c);
+    if (o.ignorePunctuation && isPunct(cp) || o.ignoreWhitespace && isSpace(cp)) continue;
+    atoms.push(literalNode(cp, caseInsensitive));
+  }
+  const filler = o.ignorePunctuation && o.ignoreWhitespace ? (cp) => isPunct(cp) || isSpace(cp) : o.ignorePunctuation ? (cp) => isPunct(cp) : o.ignoreWhitespace ? (cp) => isSpace(cp) : null;
+  const items = [];
+  atoms.forEach((atom, index) => {
+    if (index > 0 && filler) items.push(star(charNode(filler), false));
+    items.push(atom);
+  });
+  return { node: { k: "cat", items }, spans };
+}
+function parseCount(body) {
+  const bad = () => new PatternError("invalid_pattern", `{${body}} is not a valid count`);
+  const num = (s) => {
+    const t = s.trim();
+    if (!t) return null;
+    if (!/^[0-9]+$/.test(t)) throw bad();
+    const n = parseInt(t, 10);
+    if (n > MAX_COUNT) throw new PatternError("invalid_pattern", `counts go up to ${MAX_COUNT}`);
+    return n;
+  };
+  const sep = body.search(/[,;]/);
+  if (sep < 0) {
+    const n = num(body);
+    if (n === null) throw bad();
+    return { min: n, max: n };
+  }
+  const a = num(body.slice(0, sep)) ?? 0;
+  const b = num(body.slice(sep + 1));
+  if (b !== null && b < a) throw bad();
+  return { min: a, max: b ?? -1 };
+}
+function parseClass(inner) {
+  let negated = false;
+  if (inner[0] === "!") {
+    negated = true;
+    inner = inner.slice(1);
+  }
+  if (inner.length === 0) throw new PatternError("invalid_pattern", "[ ] needs at least one character");
+  const singles = /* @__PURE__ */ new Set();
+  const ranges = [];
+  let i = 0;
+  while (i < inner.length) {
+    let c = inner[i];
+    if (c === "\\" && i + 1 < inner.length) c = inner[++i];
+    i++;
+    if (inner[i] === "-" && i + 1 < inner.length) {
+      const hi = inner[i + 1];
+      if (cpOf(hi) < cpOf(c)) throw new PatternError("invalid_pattern", `[${c}-${hi}] is not in ascending order`);
+      ranges.push([cpOf(c), cpOf(hi)]);
+      i += 2;
+    } else {
+      singles.add(cpOf(c));
+    }
+  }
+  const inSet = (cp) => singles.has(cp) || ranges.some(([lo, hi]) => cp >= lo && cp <= hi);
+  return negated ? (cp) => cp !== PARA && !inSet(cp) : (cp) => inSet(cp);
+}
+function parseWildcards(query) {
+  const chars = toChars(query);
+  const stack = [{ items: [], group: 0 }];
+  let groups = 0;
+  let spans = false;
+  const top = () => stack[stack.length - 1].items;
+  const quantify = (min, max, what) => {
+    const items = top();
+    const last = items[items.length - 1];
+    if (!last || last.k === "assert" || last.k === "rep") {
+      throw new PatternError("invalid_pattern", `${what} needs something to repeat before it`);
+    }
+    items[items.length - 1] = { k: "rep", body: last, min, max, lazy: false };
+  };
+  let i = 0;
+  while (i < chars.length) {
+    const c = chars[i++];
+    switch (c) {
+      case "?":
+        top().push(charNode(ANY));
+        break;
+      case "*":
+        top().push(star(charNode(ANY), true));
+        break;
+      case "@":
+        quantify(1, -1, "@");
+        break;
+      case "<":
+        top().push({ k: "assert", kind: "wordStart" });
+        break;
+      case ">":
+        top().push({ k: "assert", kind: "wordEnd" });
+        break;
+      case "(":
+        stack.push({ items: [], group: ++groups });
+        break;
+      case ")": {
+        if (stack.length === 1) throw new PatternError("invalid_pattern", "a ) has no opening (");
+        const frame = stack.pop();
+        top().push({ k: "group", index: frame.group, body: { k: "cat", items: frame.items } });
+        break;
+      }
+      case "{": {
+        const end = chars.indexOf("}", i);
+        if (end < 0) throw new PatternError("invalid_pattern", "a { needs a closing }");
+        const { min, max } = parseCount(chars.slice(i, end).join(""));
+        quantify(min, max, `{${chars.slice(i, end).join("")}}`);
+        i = end + 1;
+        break;
+      }
+      case "[": {
+        const end = chars.indexOf("]", i);
+        if (end < 0) throw new PatternError("invalid_pattern", "a [ needs a closing ]");
+        top().push(charNode(parseClass(chars.slice(i, end))));
+        i = end + 1;
+        break;
+      }
+      case "\\": {
+        if (i >= chars.length) {
+          top().push(exact(92));
+        } else if (/[0-9]/.test(chars[i])) {
+          throw new PatternError("invalid_pattern", "back-references (\\1) work in Replace with, not in Find what");
+        } else {
+          top().push(exact(cpOf(chars[i++])));
+        }
+        break;
+      }
+      case "^": {
+        if (i >= chars.length) {
+          top().push(exact(94));
+          break;
+        }
+        const n = chars[i];
+        const code = findCode(n);
+        if (code) {
+          if (n === "p") spans = true;
+          top().push(code);
+          i++;
+          break;
+        }
+        const num = numericCode(chars, i);
+        if (num) {
+          if (num.cp === PARA) spans = true;
+          top().push(exact(num.cp));
+          i += num.used;
+        } else {
+          top().push(exact(94));
+        }
+        break;
+      }
+      default:
+        top().push(exact(cpOf(c)));
+    }
+  }
+  if (stack.length > 1) throw new PatternError("invalid_pattern", "a ( needs a closing )");
+  return { node: { k: "cat", items: stack[0].items }, spans, groups };
+}
+function compileProgram(node) {
+  const prog = [];
+  const push = (inst) => {
+    if (prog.length >= MAX_PROGRAM_SIZE) {
+      throw new PatternError("too_complex", "the pattern is too complex (too many repeats)");
+    }
+    prog.push(inst);
+    return prog.length - 1;
+  };
+  const emit = (n) => {
+    switch (n.k) {
+      case "char":
+        push({ op: 0 /* Char */, test: n.test });
+        return;
+      case "cat":
+        n.items.forEach(emit);
+        return;
+      case "group":
+        push({ op: 3 /* Save */, n: 2 * n.index });
+        emit(n.body);
+        push({ op: 3 /* Save */, n: 2 * n.index + 1 });
+        return;
+      case "assert":
+        push({ op: 4 /* Assert */, kind: n.kind });
+        return;
+      case "rep": {
+        for (let k = 0; k < n.min; k++) emit(n.body);
+        if (n.max < 0) {
+          const split = push({ op: 1 /* Split */, x: 0, y: 0 });
+          emit(n.body);
+          push({ op: 2 /* Jmp */, x: split });
+          const exit2 = prog.length;
+          const inst = prog[split];
+          inst.x = n.lazy ? exit2 : split + 1;
+          inst.y = n.lazy ? split + 1 : exit2;
+          return;
+        }
+        const splits = [];
+        for (let k = n.min; k < n.max; k++) {
+          splits.push(push({ op: 1 /* Split */, x: 0, y: 0 }));
+          emit(n.body);
+        }
+        const exit = prog.length;
+        for (const s of splits) {
+          const inst = prog[s];
+          inst.x = n.lazy ? exit : s + 1;
+          inst.y = n.lazy ? s + 1 : exit;
+        }
+        return;
+      }
+    }
+  };
+  push({ op: 3 /* Save */, n: 0 });
+  emit(node);
+  push({ op: 3 /* Save */, n: 1 });
+  push({ op: 5 /* Match */ });
+  return prog;
+}
+function checkAssert(kind, hay, pos) {
+  const before = isWordChar(cpBefore(hay, pos));
+  const after = isWordChar(cpAt(hay, pos));
+  switch (kind) {
+    case "boundary":
+      return before !== after;
+    case "wordStart":
+      return !before && after;
+    case "wordEnd":
+      return before && !after;
+  }
+}
+function pikeExec(prog, groupCount, caseInsensitive, hay, start2, end, budget) {
+  const ncap = 2 * (groupCount + 1);
+  const mark = new Int32Array(prog.length);
+  let gen = 1;
+  let clistPc = [];
+  let clistCaps = [];
+  let nlistPc = [];
+  let nlistCaps = [];
+  const stackPc = [];
+  const stackCaps = [];
+  let matched = null;
+  const initial = new Int32Array(ncap).fill(-1);
+  const add = (listPc, listCaps, pc0, caps0, pos) => {
+    stackPc.push(pc0);
+    stackCaps.push(caps0);
+    while (stackPc.length) {
+      const pc = stackPc.pop();
+      const caps = stackCaps.pop();
+      if (mark[pc] === gen) continue;
+      mark[pc] = gen;
+      const inst = prog[pc];
+      switch (inst.op) {
+        case 2 /* Jmp */:
+          stackPc.push(inst.x);
+          stackCaps.push(caps);
+          break;
+        case 1 /* Split */:
+          stackPc.push(inst.y, inst.x);
+          stackCaps.push(caps, caps);
+          break;
+        case 3 /* Save */: {
+          const next = caps.slice();
+          next[inst.n] = pos;
+          stackPc.push(pc + 1);
+          stackCaps.push(next);
+          break;
+        }
+        case 4 /* Assert */:
+          if (checkAssert(inst.kind, hay, pos)) {
+            stackPc.push(pc + 1);
+            stackCaps.push(caps);
+          }
+          break;
+        default:
+          listPc.push(pc);
+          listCaps.push(caps);
+      }
+    }
+  };
+  let i = start2;
+  if (budget.steps <= 0 || now() > budget.deadline) {
+    budget.exhausted = true;
+    return "budget";
+  }
+  let steps = 0;
+  for (; ; ) {
+    if (!matched) add(clistPc, clistCaps, 0, initial, i);
+    const cp = i < end ? hay.codePointAt(i) : -1;
+    const width = cp > 65535 ? 2 : 1;
+    if (clistPc.length === 0) {
+      if (matched || i >= end) break;
+      gen++;
+      i += width;
+      continue;
+    }
+    const folded = cp >= 0 && caseInsensitive ? foldCodePoint(cp) : cp;
+    gen++;
+    nlistPc = [];
+    nlistCaps = [];
+    for (let t = 0; t < clistPc.length; t++) {
+      if (++steps >= 4096) {
+        budget.steps -= steps;
+        steps = 0;
+        if (budget.steps <= 0 || now() > budget.deadline) {
+          budget.exhausted = true;
+          return "budget";
+        }
+      }
+      const inst = prog[clistPc[t]];
+      if (inst.op === 0 /* Char */) {
+        if (cp >= 0 && inst.test(cp, folded)) add(nlistPc, nlistCaps, clistPc[t] + 1, clistCaps[t], i + width);
+      } else if (inst.op === 5 /* Match */) {
+        matched = clistCaps[t];
+        break;
+      }
+    }
+    clistPc = nlistPc;
+    clistCaps = nlistCaps;
+    if (i >= end) break;
+    i += width;
+  }
+  budget.steps -= steps;
+  if (!matched) return null;
+  const groups = [];
+  for (let g = 0; g <= groupCount; g++) {
+    const a = matched[2 * g];
+    const b = matched[2 * g + 1];
+    groups.push(a >= 0 && b >= 0 ? hay.slice(a, b) : void 0);
+  }
+  return { start: matched[0], end: matched[1], groups };
+}
+var WORD_CLASS = "[\\p{L}\\p{M}\\p{Nd}\\p{Pc}]";
+var REGEX_BOUNDARY = `(?:(?<=${WORD_CLASS})(?!${WORD_CLASS})|(?<!${WORD_CLASS})(?=${WORD_CLASS}))`;
+function hasNestedRepeat(source) {
+  const quantifierAt = (i) => {
+    const c = source[i];
+    if (c === "*" || c === "+") return { repeats: true, many: true };
+    if (c === "{") {
+      const m = /^\{(\d*)(,?)(\d*)\}/.exec(source.slice(i));
+      if (m) {
+        const max = m[2] ? m[3] ? Number(m[3]) : Infinity : Number(m[1]);
+        return { repeats: max > 1, many: max > 1 };
+      }
+    }
+    return { repeats: false, many: false };
+  };
+  const stack = [];
+  let inClass = false;
+  for (let i = 0; i < source.length; i++) {
+    const c = source[i];
+    if (c === "\\") {
+      i++;
+      continue;
+    }
+    if (inClass) {
+      if (c === "]") inClass = false;
+      continue;
+    }
+    if (c === "[") {
+      inClass = true;
+    } else if (c === "(") {
+      stack.push(false);
+    } else if (c === ")") {
+      const inner = stack.pop() ?? false;
+      const q = quantifierAt(i + 1);
+      if (inner && q.many) return true;
+      if (stack.length && (inner || q.repeats)) stack[stack.length - 1] = true;
+    } else if (stack.length && quantifierAt(i).repeats) {
+      stack[stack.length - 1] = true;
+    }
+  }
+  return false;
+}
+function compileRegex(query, o) {
+  if (hasNestedRepeat(query)) {
+    throw new PatternError(
+      "too_complex",
+      "a repeated group containing a repeat, like (a+)+, can take exponential time; rewrite it without nesting"
+    );
+  }
+  let source = query;
+  if (o.wholeWord || o.matchPrefix && o.matchSuffix) source = `${REGEX_BOUNDARY}(?:${query})${REGEX_BOUNDARY}`;
+  else if (o.matchPrefix) source = `${REGEX_BOUNDARY}(?:${query})`;
+  else if (o.matchSuffix) source = `(?:${query})${REGEX_BOUNDARY}`;
+  let re;
+  try {
+    re = new RegExp(source, o.matchCase ? "gu" : "giu");
+  } catch (error) {
+    throw new PatternError("invalid_pattern", `bad pattern: ${error instanceof Error ? error.message : String(error)}`);
+  }
+  let slicedFor = null;
+  return {
+    mode: "regex",
+    spansParagraphs: false,
+    caseInsensitive: !o.matchCase,
+    groupCount: 0,
+    exec(hay, start2, end, budget) {
+      if (now() > budget.deadline) {
+        budget.exhausted = true;
+        return "budget";
+      }
+      let text = hay;
+      if (end < hay.length) {
+        if (!slicedFor || slicedFor.hay !== hay || slicedFor.end !== end) {
+          slicedFor = { hay, end, text: hay.slice(0, end) };
+        }
+        text = slicedFor.text;
+      }
+      re.lastIndex = start2;
+      const m = re.exec(text);
+      if (!m) return null;
+      return { start: m.index, end: m.index + m[0].length, groups: Array.from(m) };
+    }
+  };
+}
+function compileFindPattern(query, options = {}) {
+  try {
+    if (Array.from(query).length > MAX_FIND_PATTERN_LENGTH) {
+      throw new PatternError("too_long", `the Find what text is longer than ${MAX_FIND_PATTERN_LENGTH} characters`);
+    }
+    if (options.regex) return { ok: true, pattern: compileRegex(query, options) };
+    const wildcards = !!options.wildcards && !options.literal;
+    const caseInsensitive = !options.matchCase && !wildcards;
+    let node;
+    let spans;
+    let groups = 0;
+    if (wildcards) {
+      ({ node, spans, groups } = parseWildcards(query));
+    } else {
+      ({ node, spans } = parseSpecial(query, options, caseInsensitive));
+      const before = options.wholeWord || options.matchPrefix;
+      const after = options.wholeWord || options.matchSuffix;
+      if (before || after) {
+        const items = [];
+        if (before) items.push({ k: "assert", kind: "boundary" });
+        items.push(node);
+        if (after) items.push({ k: "assert", kind: "boundary" });
+        node = { k: "cat", items };
+      }
+    }
+    const prog = compileProgram(node);
+    return {
+      ok: true,
+      pattern: {
+        mode: wildcards ? "wildcards" : "special",
+        spansParagraphs: spans,
+        caseInsensitive,
+        groupCount: groups,
+        exec: (hay, start2, end, budget) => pikeExec(prog, groups, caseInsensitive, hay, start2, end, budget)
+      }
+    };
+  } catch (error) {
+    if (error instanceof PatternError) return { ok: false, error: { code: error.code, message: error.message } };
+    return { ok: false, error: { code: "invalid_pattern", message: error instanceof Error ? error.message : String(error) } };
+  }
+}
+function findAllMatches(pattern, hay, options = {}) {
+  const budget = options.budget ?? createSearchBudget();
+  const maxMatches = options.maxMatches ?? 1e4;
+  const cuts = [...options.cuts ?? [], hay.length].sort((a, b) => a - b);
+  const matches = [];
+  let from = 0;
+  for (const cut of cuts) {
+    if (cut <= from) continue;
+    let pos = from;
+    from = cut;
+    for (; ; ) {
+      const m = pattern.exec(hay, pos, cut, budget);
+      if (m === "budget") return { matches, truncated: true };
+      if (!m) break;
+      const empty = m.end === m.start;
+      const next = empty ? m.end + (cpAt(hay, m.end) > 65535 ? 2 : 1) : m.end;
+      if (next > cut) break;
+      pos = next;
+      if (empty) continue;
+      matches.push(m);
+      if (matches.length >= maxMatches) return { matches, truncated: true };
+    }
+  }
+  return { matches, truncated: false };
+}
+function parseReplacement(replacement, options = {}) {
+  if (options.literal || options.regex) return replacement ? [{ type: "text", text: replacement }] : [];
+  const chars = toChars(replacement);
+  const out = [];
+  let cur = "";
+  const flush = () => {
+    if (cur) out.push({ type: "text", text: cur });
+    cur = "";
+  };
+  let i = 0;
+  while (i < chars.length) {
+    const c = chars[i++];
+    if (c === "\\" && options.wildcards && i < chars.length) {
+      const d = chars[i];
+      if (/[1-9]/.test(d)) {
+        flush();
+        out.push({ type: "group", index: Number(d) });
+      } else {
+        cur += d;
+      }
+      i++;
+      continue;
+    }
+    if (c === "^" && i < chars.length) {
+      const n = chars[i];
+      if (n === "&" || n === "c") {
+        flush();
+        out.push(n === "&" ? { type: "found" } : { type: "clipboard" });
+        i++;
+        continue;
+      }
+      const code = replaceCode(n);
+      if (code !== null) {
+        cur += code;
+        i++;
+        continue;
+      }
+      const num = numericCode(chars, i);
+      if (num) {
+        cur += String.fromCodePoint(num.cp);
+        i += num.used;
+        continue;
+      }
+    }
+    cur += c;
+  }
+  flush();
+  return out;
+}
+function expandReplacement(pieces, match, clipboardText = "") {
+  let out = "";
+  for (const piece of pieces) {
+    switch (piece.type) {
+      case "text":
+        out += piece.text;
+        break;
+      case "found":
+        out += match.groups[0] ?? "";
+        break;
+      case "group":
+        out += match.groups[piece.index] ?? "";
+        break;
+      case "clipboard":
+        out += clipboardText.replace(/\r\n/g, "\r").replace(/\n/g, "\r");
+        break;
+    }
+  }
+  return out;
+}
+
+// src/extensions/find-replace/search.ts
+var DELETION_MARK = "deletion";
+var DROPPED_REPLACEMENT_MARKS = /* @__PURE__ */ new Set([DELETION_MARK, "formatChange"]);
+var OBJECT_CHAR = "\uFFFC";
+function searchDocument(doc, query, options = {}, searchOptions = {}) {
+  if (!query) return { matches: [], truncated: false, error: null };
+  const compiled = compileFindPattern(query, options);
+  if (!compiled.ok) return { matches: [], truncated: false, error: compiled.error };
+  const pattern = compiled.pattern;
+  const pieces = parseReplacement(searchOptions.replacement ?? "", options);
+  const budget = createSearchBudget({ timeLimitMs: searchOptions.timeLimitMs });
+  const maxMatches = searchOptions.maxMatches ?? 1e4;
+  const blocks = [];
+  doc.descendants((node, pos, parent, index) => {
+    if (!node.isTextblock) return true;
+    blocks.push({ node, pos, parent, index });
+    return false;
+  });
+  const chunks = [];
+  blocks.forEach((block, i) => {
+    const prev = blocks[i - 1];
+    const joins = pattern.spansParagraphs && prev && prev.parent === block.parent && prev.index + 1 === block.index;
+    if (joins) chunks[chunks.length - 1].push(block);
+    else chunks.push([block]);
+  });
+  const matches = [];
+  let truncated = false;
+  for (const chunk of chunks) {
+    let hay = "";
+    const posOf = [];
+    const endOf = [];
+    const cuts = [];
+    chunk.forEach((block, k) => {
+      const contentStart = block.pos + 1;
+      block.node.forEach((child, offset) => {
+        const at = contentStart + offset;
+        if (child.marks.some((m) => m.type.name === DELETION_MARK)) {
+          if (cuts[cuts.length - 1] !== hay.length) cuts.push(hay.length);
+          return;
+        }
+        if (child.isText) {
+          const text = child.text ?? "";
+          for (let j = 0; j < text.length; j++) {
+            posOf.push(at + j);
+            endOf.push(at + j + 1);
+          }
+          hay += text;
+        } else {
+          posOf.push(at);
+          endOf.push(at + child.nodeSize);
+          hay += child.type.name === "hardBreak" ? "\n" : OBJECT_CHAR;
+        }
+      });
+      const next = chunk[k + 1];
+      if (next) {
+        posOf.push(contentStart + block.node.content.size);
+        endOf.push(next.pos + 1);
+        hay += FIND_PARAGRAPH_MARK;
+      }
+    });
+    if (!hay) continue;
+    const result = findAllMatches(pattern, hay, {
+      cuts,
+      budget,
+      maxMatches: maxMatches - matches.length
+    });
+    for (const m of result.matches) {
+      matches.push({
+        from: posOf[m.start],
+        to: endOf[m.end - 1],
+        text: m.groups[0] ?? hay.slice(m.start, m.end),
+        replacement: expandReplacement(pieces, m, searchOptions.clipboardText ?? "")
+      });
+    }
+    if (result.truncated) {
+      truncated = true;
+      break;
+    }
+  }
+  return { matches, truncated, error: null };
+}
+function replacementMarks(doc, from, to) {
+  const $from = doc.resolve(from);
+  const node = from < to ? $from.nodeAfter : null;
+  const marks = node ? node.marks : $from.marks();
+  return marks.filter((m) => !DROPPED_REPLACEMENT_MARKS.has(m.type.name));
+}
+function inlineContent(schema, text, marks) {
+  const nodes = [];
+  const hardBreak = schema.nodes.hardBreak;
+  const parts = hardBreak ? text.split("\n") : [text];
+  parts.forEach((part, i) => {
+    if (i > 0) nodes.push(hardBreak.create(null, null, marks));
+    if (part) nodes.push(schema.text(part, marks));
+  });
+  return nodes;
+}
+function applyReplacements(tr, matches) {
+  const ends = new Array(matches.length);
+  const schema = tr.doc.type.schema;
+  for (let i = matches.length - 1; i >= 0; i--) {
+    const { from, to, replacement } = matches[i];
+    const marks = replacementMarks(tr.doc, from, to);
+    const parts = replacement.split(/[\r\u2029]/);
+    const stepsBefore = tr.steps.length;
+    const first = inlineContent(schema, parts[0], marks);
+    if (first.length) tr.replaceWith(from, to, first);
+    else if (to > from) tr.delete(from, to);
+    let pos = tr.mapping.slice(stepsBefore).map(to, 1);
+    for (let k = 1; k < parts.length; k++) {
+      tr.split(pos);
+      pos += 2;
+      const content = inlineContent(schema, parts[k], marks);
+      if (content.length) {
+        tr.insert(pos, content);
+        pos += content.reduce((size, node) => size + node.nodeSize, 0);
+      }
+    }
+    const map = tr.mapping.slice(stepsBefore);
+    for (let j = i + 1; j < matches.length; j++) ends[j] = map.map(ends[j], 1);
+    ends[i] = pos;
+  }
+  return ends;
+}
+
+// src/extensions/find-replace/extension.ts
+var EMPTY_OPTIONS = Object.freeze({});
+var EMPTY_FIND_REPLACE_SNAPSHOT = Object.freeze({
+  open: false,
+  mode: "find",
+  query: "",
+  replacement: "",
+  options: EMPTY_OPTIONS,
+  matches: Object.freeze([]),
+  currentIndex: -1,
+  error: null,
+  truncated: false,
+  lastReplaceCount: null,
+  focusRequest: 0
+});
+var FindReplaceStore = class {
+  snapshot = EMPTY_FIND_REPLACE_SNAPSHOT;
+  listeners = /* @__PURE__ */ new Set();
+  subscribe = (listener) => {
+    this.listeners.add(listener);
+    listener(this.snapshot);
+    return () => {
+      this.listeners.delete(listener);
+    };
+  };
+  getSnapshot = () => this.snapshot;
+  /** @internal Called by the extension's plugin view. */
+  set(snapshot) {
+    if (snapshot === this.snapshot) return;
+    this.snapshot = snapshot;
+    this.listeners.forEach((listener) => {
+      try {
+        listener(snapshot);
+      } catch (err) {
+        console.error("[FindReplaceStore] Error in listener:", err);
+      }
+    });
+  }
+};
+var findReplacePluginKey = new PluginKey11("findReplace");
+function getFindReplaceState(source) {
+  const state = source?.state ?? source;
+  if (!state || typeof state.plugins === "undefined") return null;
+  const plugin = findReplacePluginKey.getState(state);
+  return plugin ? toSnapshot(plugin) : null;
+}
+function getFindReplaceStore(editor) {
+  return editor?.storage?.findReplace?.store ?? null;
+}
+var snapshotCache = /* @__PURE__ */ new WeakMap();
+function toSnapshot(s) {
+  let snapshot = snapshotCache.get(s);
+  if (!snapshot) {
+    snapshot = Object.freeze({
+      open: s.open,
+      mode: s.mode,
+      query: s.query,
+      replacement: s.replacement,
+      options: s.options,
+      matches: s.active ? s.matches : EMPTY_FIND_REPLACE_SNAPSHOT.matches,
+      currentIndex: s.active ? s.currentIndex : -1,
+      error: s.error,
+      truncated: s.truncated,
+      lastReplaceCount: s.lastReplaceCount,
+      focusRequest: s.focusRequest
+    });
+    snapshotCache.set(s, snapshot);
+  }
+  return snapshot;
+}
+var FIND_OPTION_TOGGLES = Object.freeze([
+  { key: "matchCase", label: "Match case", short: "Aa", advanced: false },
+  { key: "wholeWord", label: "Whole words only", short: "ab", advanced: false },
+  { key: "wildcards", label: "Use wildcards", short: "*?", advanced: false },
+  { key: "regex", label: "Regular expression", short: ".*", advanced: false },
+  { key: "matchPrefix", label: "Match prefix", short: "ab-", advanced: true },
+  { key: "matchSuffix", label: "Match suffix", short: "-ab", advanced: true },
+  { key: "ignorePunctuation", label: "Ignore punctuation", short: ".,", advanced: true },
+  { key: "ignoreWhitespace", label: "Ignore white space", short: "_", advanced: true },
+  { key: "literal", label: "No special characters (^)", short: "^", advanced: true }
+]);
+function formatFindStatus(s) {
+  if (!s.query) return "";
+  if (s.error) return s.error.message;
+  const n = s.matches.length;
+  if (n === 0) return "No results";
+  const total = s.truncated ? `${n}+` : `${n}`;
+  return s.currentIndex >= 0 ? `${s.currentIndex + 1} of ${total}` : `${total} results`;
+}
+function indexFrom(matches, pos) {
+  if (!matches.length) return -1;
+  const i = matches.findIndex((m) => m.from >= pos);
+  return i < 0 ? 0 : i;
+}
+function selectedQuery(state, maxLength) {
+  const { from, to, $from, $to } = state.selection;
+  if (from === to || !$from.sameParent($to)) return void 0;
+  const text = state.doc.textBetween(from, to, "", "");
+  return text && text.length <= maxLength && !/[\r\n]/.test(text) ? text : void 0;
+}
+var FindReplace = Extension12.create({
+  name: "findReplace",
+  addOptions() {
+    return {
+      shortcuts: true,
+      matchClass: "pixerate-find-match",
+      currentMatchClass: "pixerate-find-match-current",
+      timeLimitMs: 250,
+      maxMatches: 1e4,
+      getClipboardText: () => "",
+      maxPrefillLength: 256
+    };
+  },
+  addStorage() {
+    return { store: new FindReplaceStore() };
+  },
+  addCommands() {
+    const meta = (tr, value) => tr.setMeta(findReplacePluginKey, value);
+    const current = (state) => findReplacePluginKey.getState(state);
+    const maxPrefill = () => this.options.maxPrefillLength;
+    const select = (tr, match) => {
+      tr.setSelection(TextSelection7.create(tr.doc, match.from, match.to)).scrollIntoView();
+    };
+    return {
+      setSearch: (params) => ({ tr, state, dispatch }) => {
+        if (!current(state)) return false;
+        if (dispatch) meta(tr, { type: "set", params, anchor: state.selection.from });
+        return true;
+      },
+      openFindReplace: (params = {}) => ({ tr, state, dispatch }) => {
+        if (!current(state)) return false;
+        if (dispatch) {
+          meta(tr, {
+            type: "open",
+            mode: params.mode ?? "find",
+            query: params.query ?? selectedQuery(state, maxPrefill()),
+            anchor: state.selection.from
+          });
+        }
+        return true;
+      },
+      closeFindReplace: () => ({ tr, state, dispatch }) => {
+        if (!current(state)) return false;
+        if (dispatch) meta(tr, { type: "close" });
+        return true;
+      },
+      clearSearch: () => ({ tr, state, dispatch }) => {
+        if (!current(state)) return false;
+        if (dispatch) meta(tr, { type: "clear" });
+        return true;
+      },
+      findNext: () => ({ tr, state, dispatch }) => {
+        const s = current(state);
+        if (!s || !s.active || !s.matches.length) return false;
+        const { from, to } = state.selection;
+        const cur = s.matches[s.currentIndex];
+        const onCurrent = cur && cur.from === from && cur.to === to;
+        const index = onCurrent ? (s.currentIndex + 1) % s.matches.length : indexFrom(s.matches, to);
+        if (dispatch) {
+          meta(tr, { type: "current", index });
+          select(tr, s.matches[index]);
+        }
+        return true;
+      },
+      findPrevious: () => ({ tr, state, dispatch }) => {
+        const s = current(state);
+        if (!s || !s.active || !s.matches.length) return false;
+        const { from, to } = state.selection;
+        const n = s.matches.length;
+        const cur = s.matches[s.currentIndex];
+        const onCurrent = cur && cur.from === from && cur.to === to;
+        let index;
+        if (onCurrent) {
+          index = (s.currentIndex - 1 + n) % n;
+        } else {
+          index = -1;
+          for (let i = n - 1; i >= 0; i--) {
+            if (s.matches[i].to <= from) {
+              index = i;
+              break;
+            }
+          }
+          if (index < 0) index = n - 1;
+        }
+        if (dispatch) {
+          meta(tr, { type: "current", index });
+          select(tr, s.matches[index]);
+        }
+        return true;
+      },
+      replaceCurrent: () => ({ tr, state, dispatch }) => {
+        const s = current(state);
+        if (!s || !s.active || s.currentIndex < 0 || !s.matches[s.currentIndex]) return false;
+        if (dispatch) {
+          closeHistory2(tr);
+          const [end] = applyReplacements(tr, [s.matches[s.currentIndex]]);
+          tr.setSelection(TextSelection7.create(tr.doc, end)).scrollIntoView();
+          meta(tr, { type: "replaced", anchor: end, count: 1 });
+        }
+        return true;
+      },
+      replaceAll: () => ({ tr, state, dispatch }) => {
+        const s = current(state);
+        if (!s || !s.active || !s.matches.length) return false;
+        if (dispatch) {
+          closeHistory2(tr);
+          const ends = applyReplacements(tr, s.matches);
+          meta(tr, { type: "replaced", anchor: ends[ends.length - 1], count: s.matches.length });
+        }
+        return true;
+      }
+    };
+  },
+  addKeyboardShortcuts() {
+    if (!this.options.shortcuts) return {};
+    const open = (mode) => () => this.editor.commands.openFindReplace({ mode });
+    const step = (forward) => () => {
+      const s = findReplacePluginKey.getState(this.editor.state);
+      if (!s?.active || !s.matches.length) return false;
+      return forward ? this.editor.commands.findNext() : this.editor.commands.findPrevious();
+    };
+    return {
+      "Mod-f": open("find"),
+      "Mod-h": open("replace"),
+      "Mod-Shift-h": open("replace"),
+      F3: step(true),
+      "Shift-F3": step(false),
+      "Mod-g": step(true),
+      "Mod-Shift-g": step(false)
+    };
+  },
+  addProseMirrorPlugins() {
+    const options = this.options;
+    const store = this.storage.store;
+    const search = (s, doc) => {
+      if (!s.active || !s.query) {
+        return { ...s, matches: [], currentIndex: -1, error: null, truncated: false };
+      }
+      const result = searchDocument(doc, s.query, s.options, {
+        replacement: s.replacement,
+        clipboardText: safeClipboard(options.getClipboardText),
+        timeLimitMs: options.timeLimitMs,
+        maxMatches: options.maxMatches
+      });
+      return {
+        ...s,
+        matches: result.matches,
+        currentIndex: indexFrom(result.matches, s.anchor),
+        error: result.error,
+        truncated: result.truncated
+      };
+    };
+    const decorate = (s, doc) => {
+      if (!s.active || !s.matches.length) return { ...s, decorations: DecorationSet4.empty };
+      const decorations = s.matches.map(
+        (m, i) => Decoration4.inline(m.from, m.to, {
+          class: i === s.currentIndex ? `${options.matchClass} ${options.currentMatchClass}` : options.matchClass
+        })
+      );
+      return { ...s, decorations: DecorationSet4.create(doc, decorations) };
+    };
+    return [
+      new Plugin14({
+        key: findReplacePluginKey,
+        state: {
+          init: () => ({
+            active: false,
+            open: false,
+            mode: "find",
+            query: "",
+            replacement: "",
+            options: EMPTY_OPTIONS,
+            matches: [],
+            currentIndex: -1,
+            anchor: 0,
+            error: null,
+            truncated: false,
+            lastReplaceCount: null,
+            focusRequest: 0,
+            decorations: DecorationSet4.empty
+          }),
+          apply: (tr, prev, _oldState, newState) => {
+            const m = tr.getMeta(findReplacePluginKey);
+            if (!m && !tr.docChanged) return prev;
+            let s = prev;
+            let research = false;
+            let redecorate = false;
+            if (tr.docChanged) {
+              s = { ...s, anchor: tr.mapping.map(s.anchor) };
+              research = s.active;
+            }
+            if (m) {
+              switch (m.type) {
+                case "set": {
+                  const p = m.params;
+                  s = {
+                    ...s,
+                    active: true,
+                    query: p.query ?? s.query,
+                    replacement: p.replacement ?? s.replacement,
+                    options: p.options ? Object.freeze({ ...s.options, ...p.options }) : s.options,
+                    anchor: m.anchor,
+                    lastReplaceCount: null
+                  };
+                  research = true;
+                  break;
+                }
+                case "open":
+                  s = {
+                    ...s,
+                    active: true,
+                    open: true,
+                    mode: m.mode,
+                    query: m.query ?? s.query,
+                    anchor: m.anchor,
+                    focusRequest: s.focusRequest + 1
+                  };
+                  research = true;
+                  break;
+                case "close":
+                  s = { ...s, open: false, active: false };
+                  research = true;
+                  break;
+                case "clear":
+                  s = { ...s, active: false, query: "", lastReplaceCount: null };
+                  research = true;
+                  break;
+                case "current":
+                  s = {
+                    ...s,
+                    currentIndex: m.index,
+                    anchor: s.matches[m.index]?.from ?? s.anchor
+                  };
+                  redecorate = true;
+                  break;
+                case "replaced":
+                  s = { ...s, anchor: m.anchor, lastReplaceCount: m.count };
+                  research = true;
+                  break;
+              }
+            }
+            if (research) s = search(s, newState.doc);
+            if (research || redecorate) s = decorate(s, newState.doc);
+            return s;
+          }
+        },
+        props: {
+          decorations: (state) => findReplacePluginKey.getState(state)?.decorations ?? DecorationSet4.empty
+        },
+        view: (view) => {
+          const sync = () => {
+            const s = findReplacePluginKey.getState(view.state);
+            if (s) store.set(toSnapshot(s));
+          };
+          sync();
+          return { update: sync };
+        }
+      })
+    ];
+  }
+});
+function safeClipboard(get) {
+  try {
+    return String(get() ?? "");
+  } catch {
+    return "";
+  }
+}
+
 // src/extensions/rich-text-preset.ts
 var resolveExt3 = (mod, name) => mod?.[name] || mod?.default?.[name] || mod?.default?.default || mod?.default || mod;
 var StarterKit = resolveExt3(_StarterKit, "StarterKit");
@@ -5325,7 +6625,8 @@ function createRichTextPreset(options = {}) {
   }
   if (options.trackChanges) {
     extensions2.push(
-      typeof options.trackChanges === "object" ? TrackChanges.configure(options.trackChanges) : TrackChanges
+      typeof options.trackChanges === "object" ? TrackChanges.configure(options.trackChanges) : TrackChanges,
+      DocumentCompare
     );
   }
   if (options.fileImport) {
@@ -5364,9 +6665,149 @@ function createRichTextPreset(options = {}) {
   if (options.crossReferences) {
     extensions2.push(CrossReference.configure(optionObject(options.crossReferences)));
   }
+  if (options.findReplace) {
+    extensions2.push(FindReplace.configure(optionObject(options.findReplace)));
+  }
   return extensions2;
 }
 
+// src/extensions/find-replace/commands.ts
+var OPTION_KEYS = [
+  "matchCase",
+  "wholeWord",
+  "matchPrefix",
+  "matchSuffix",
+  "ignorePunctuation",
+  "ignoreWhitespace",
+  "wildcards",
+  "regex",
+  "literal"
+];
+var searchParams = (withReplacement) => ({
+  type: "object",
+  properties: {
+    query: { type: "string", description: "Find what. Word ^ codes (^p, ^t, ^#) unless literal." },
+    ...withReplacement ? {
+      replacement: {
+        type: "string",
+        description: "Replace with. ^& is the found text; with wildcards, \\1-\\9 are groups."
+      }
+    } : {},
+    ...Object.fromEntries(OPTION_KEYS.map((key) => [key, { type: "boolean" }]))
+  },
+  additionalProperties: false
+});
+function splitParams(params) {
+  if (!params) return null;
+  const options = {};
+  for (const key of OPTION_KEYS) if (params[key] !== void 0) options[key] = params[key];
+  return {
+    ...params.query !== void 0 ? { query: params.query } : {},
+    ...params.replacement !== void 0 ? { replacement: params.replacement } : {},
+    options
+  };
+}
+var usable = (editor) => !editor.isDestroyed && findReplacePluginKey.getState(editor.state) ? true : "Find and Replace is not available.";
+function createFindReplaceCommands(editor, options = {}) {
+  const prefix = options.prefix ?? "findReplace.";
+  const group = options.group ?? "Edit";
+  const scope = options.scope ? { scope: options.scope } : {};
+  const state = () => getFindReplaceState(editor);
+  const hasMatches = () => {
+    const ok = usable(editor);
+    if (ok !== true) return ok;
+    return state()?.matches.length ? true : "No matches.";
+  };
+  const apply = (params) => {
+    const split = splitParams(params);
+    if (split) editor.commands.setSearch(split);
+  };
+  const failIfInvalid = () => {
+    const s = state();
+    if (s?.error) throw new Error(s.error.message);
+  };
+  return [
+    {
+      id: `${prefix}open`,
+      label: "Find",
+      group,
+      keywords: ["search", "find"],
+      description: "Shows the find bar.",
+      ...options.shortcuts ? { shortcut: "Mod+F" } : {},
+      ...scope,
+      enabled: () => usable(editor),
+      run: () => editor.commands.openFindReplace({ mode: "find" })
+    },
+    {
+      id: `${prefix}openReplace`,
+      label: "Replace",
+      group,
+      keywords: ["search", "substitute"],
+      description: "Shows the find bar with the replace field.",
+      ...options.shortcuts ? { shortcut: "Mod+H" } : {},
+      ...scope,
+      enabled: () => usable(editor),
+      run: () => editor.commands.openFindReplace({ mode: "replace" })
+    },
+    {
+      id: `${prefix}find`,
+      label: "Find text",
+      group,
+      description: "Searches the document and returns the number of matches.",
+      params: searchParams(false),
+      readOnly: true,
+      ...scope,
+      enabled: () => usable(editor),
+      run: (_ctx, params) => {
+        apply(params);
+        failIfInvalid();
+        const s = state();
+        return {
+          count: s?.matches.length ?? 0,
+          truncated: s?.truncated ?? false,
+          matches: (s?.matches ?? []).slice(0, 200).map(({ from, to, text }) => ({ from, to, text }))
+        };
+      }
+    },
+    {
+      id: `${prefix}next`,
+      label: "Find next",
+      group,
+      ...scope,
+      enabled: hasMatches,
+      run: () => editor.commands.findNext()
+    },
+    {
+      id: `${prefix}previous`,
+      label: "Find previous",
+      group,
+      ...scope,
+      enabled: hasMatches,
+      run: () => editor.commands.findPrevious()
+    },
+    {
+      id: `${prefix}replaceAll`,
+      label: "Replace all",
+      group,
+      description: "Replaces every match (one undo step). Tracked when Track Changes is on.",
+      params: searchParams(true),
+      ...scope,
+      enabled: (_ctx, params) => params?.query !== void 0 ? usable(editor) : hasMatches(),
+      run: (_ctx, params) => {
+        apply(params);
+        failIfInvalid();
+        const count = state()?.matches.length ?? 0;
+        if (count) editor.commands.replaceAll();
+        return { replaced: count };
+      }
+    }
+  ];
+}
+function validateFindPattern(query, options = {}) {
+  const result = compileFindPattern(query, options);
+  return result.ok ? null : result.error;
+}
+
 export {
   GradientText,
   SlashCommands,
@@ -5395,6 +6836,9 @@ export {
   getCommentStore,
   Comments,
   getCommentAuthor,
+  compareInEditor,
+  applyDocumentComparison,
+  DocumentCompare,
   ImportError,
   createImportContext,
   ImportAdapterRegistry,
@@ -5467,6 +6911,26 @@ export {
   CrossReference,
   documentStructureCommandItems,
   getDocumentStructureCommandItems,
-  createRichTextPreset
+  FIND_PARAGRAPH_MARK,
+  MAX_FIND_PATTERN_LENGTH,
+  createSearchBudget,
+  foldCodePoint,
+  compileFindPattern,
+  findAllMatches,
+  parseReplacement,
+  expandReplacement,
+  searchDocument,
+  applyReplacements,
+  EMPTY_FIND_REPLACE_SNAPSHOT,
+  FindReplaceStore,
+  findReplacePluginKey,
+  getFindReplaceState,
+  getFindReplaceStore,
+  FIND_OPTION_TOGGLES,
+  formatFindStatus,
+  FindReplace,
+  createRichTextPreset,
+  createFindReplaceCommands,
+  validateFindPattern
 };
-//# sourceMappingURL=chunk-QGHGJ56O.js.map
+//# sourceMappingURL=chunk-ITBSKI26.js.map