polite-crawler 0.2.3 → 0.3.0

package/build/{diff-DxhmN3bo.mjs.map → diff-DHpF9lYY.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"diff-DxhmN3bo.mjs","names":[],"sources":["../src/diff.ts"],"sourcesContent":["import type { CrawlRuntime } from \"./runtime.ts\";\nimport type { VersionText } from \"./docs.ts\";\nimport { HELD_BACK, heldBackMeta, isHeldBack, isoTime, versionAtTime } from \"./runtime.ts\";\nimport { stableStringify } from \"./record.ts\";\n\n/**\n * A diff compares two versions of a stored document. It gives the changes of the text as a line\n * diff, with a word diff inside each changed line. It gives the changes of the title, the URL and\n * the metadata (the JSON-LD too) as changes at a path.\n *\n * The line diff is the algorithm of Myers (1986). Its time is linear in the length of the texts\n * when the change is small. A budget of steps (`DIFF_LIMITS`) bounds the time of a large change.\n * After the budget, the diff gives the rest of the change as one removal and one addition. Then\n * the result says that it is not minimal. A huge text gives its first part, and the result says so.\n *\n * A held-back version gives no text and no title to a diff, and only its structural metadata.\n */\n\n/** These are the limits of a diff. Each limit bounds the time or the size of a result. */\nexport const DIFF_LIMITS = {\n  /** The characters of each text that a diff compares. A longer text gives its first part. */\n  maxChars: 1_000_000,\n  /** The lines of each text that a diff compares. A longer text gives its first lines. */\n  maxLines: 50_000,\n  /** The steps of the line diff. After them, the rest of the change is one removal and one addition. */\n  maxSteps: 1_000_000,\n  /** The steps of the word diffs of all the changed lines together. */\n  maxWordSteps: 1_000_000,\n  /** The words of one line that a word diff compares. A longer line gets no word diff. */\n  maxLineWords: 5_000,\n  /** The lines of context before and after each change. */\n  context: 2,\n  /** The lines that the hunks of a result show. The summary counts each line. */\n  maxHunkLines: 2_000,\n  /** The changes of the metadata that a result shows. The summary counts each change. */\n  maxMetaChanges: 200,\n  /** The depth of the metadata that a diff compares. A deeper change is a change of the whole value. */\n  maxMetaDepth: 16,\n  /** The characters of the JSON of each value of a change of the metadata. */\n  maxValueChars: 300,\n} as const;\n\n/** These are the limits of a diff, one by one. `DIFF_LIMITS` gives the defaults. */\nexport type DiffLimits = { readonly [K in keyof typeof DIFF_LIMITS]: number };\n\n/** This is a part of a changed line: words that stay, words that the new text adds, or words that it removes. */\nexport interface WordPart {\n  readonly op: \"same\" | \"added\" | \"removed\";\n  readonly text: string;\n}\n\n/**\n * This is one line of a hunk. A `same` line is context. A `changed` line pairs a removed line with\n * an added line, and `words` gives the word diff, or null when the word budget ended.\n */\nexport type DiffLine =\n  | { readonly op: \"same\" | \"added\" | \"removed\"; readonly text: string }\n  | {\n      readonly op: \"changed\";\n      readonly before: string;\n      readonly after: string;\n      readonly words: readonly WordPart[] | null;\n    };\n\n/** This is a part of the diff of the text: the changed lines with some context, as in a unified diff. */\nexport interface DiffHunk {\n  /** This value is the number (from 1) of the first line of the hunk in the old text. */\n  readonly from_line: number;\n  /** This value is the number of lines of the old text in the hunk. */\n  readonly from_count: number;\n  /** This value is the number (from 1) of the first line of the hunk in the new text. */\n  readonly to_line: number;\n  /** This value is the number of lines of the new text in the hunk. */\n  readonly to_count: number;\n  readonly lines: readonly DiffLine[];\n}\n\n/**\n * This is one change of the title, the URL or the metadata. The path names the value, for\n * example `meta.jsonld[0].openingHours`. `before` and `after` are the JSON of the values, cut to\n * `DIFF_LIMITS.maxValueChars`.\n */\nexport interface MetaChange {\n  readonly path: string;\n  readonly change: \"added\" | \"removed\" | \"changed\";\n  /** This text is the JSON of the old value, or null when the new version adds the value. */\n  readonly before: string | null;\n  /** This text is the JSON of the new value, or null when the new version removes the value. */\n  readonly after: string | null;\n}\n\n/** These are the counts of a diff. */\nexport interface DiffSummary {\n  /** This value counts the lines that only the new text has. */\n  readonly lines_added: number;\n  /** This value counts the lines that only the old text has. */\n  readonly lines_removed: number;\n  /** This value counts the pairs of a removed line and an added line that the result shows as one changed line. */\n  readonly lines_changed: number;\n  /** This value counts the words that the new text adds, in the added lines and in the changed lines. */\n  readonly words_added: number;\n  /** This value counts the words that the new text removes, in the removed lines and in the changed lines. */\n  readonly words_removed: number;\n  /** This value counts the changes of the title, the URL and the metadata. */\n  readonly meta_changes: number;\n}\n\n/** This is the input of `diffTexts`: the parts of a version that a diff compares. */\nexport interface DiffInput {\n  readonly text: string;\n  readonly fields: Readonly<Record<string, unknown>>;\n}\n\n/** This is the result of `diffTexts`. */\nexport interface TextDiff {\n  readonly summary: DiffSummary;\n  readonly hunks: readonly DiffHunk[];\n  readonly meta: readonly MetaChange[];\n  /** This value is true when the text and the fields are the same. */\n  readonly same: boolean;\n  /** This value is true when the line diff is minimal and each changed line has its word diff. */\n  readonly exact: boolean;\n  /** This value is true when the result leaves out a part. It can leave out the end of a long text, lines of the hunks or changes of the metadata. */\n  readonly truncated: boolean;\n  /** This value counts the steps of the line diff and of the word diffs. A test reads it: a step count does not change with the computer. */\n  readonly steps: number;\n  readonly notes: readonly string[];\n}\n\n/** A run of the edit script. `0` keeps lines of the two texts. `1` removes lines of the old text, and `2` adds lines of the new text. */\ninterface Run {\n  readonly op: 0 | 1 | 2;\n  readonly count: number;\n}\n\n/** A budget of steps. The diffs add to `steps`, and stop when it passes `max`. */\ninterface Budget {\n  steps: number;\n  max: number;\n}\n\n/**\n * This function gives an edit script from `a` to `b`, with the algorithm of Myers. It first\n * removes the common start and the common end. When the budget ends, it keeps the furthest path\n * that it found, and the rest is one removal and one addition. `exact` is then false.\n */\nexport const editScript = (\n  a: ArrayLike<number>,\n  b: ArrayLike<number>,\n  budget: Budget,\n): { readonly runs: Run[]; readonly exact: boolean } => {\n  const n = a.length;\n  const m = b.length;\n  let head = 0;\n  while (head < n && head < m && a[head] === b[head]) head += 1;\n  let endA = n;\n  let endB = m;\n  while (endA > head && endB > head && a[endA - 1] === b[endB - 1]) {\n    endA -= 1;\n    endB -= 1;\n  }\n  budget.steps += head + (n - endA) + 1;\n  const reversed: Array<[0 | 1 | 2, number]> = [];\n  const width = endA - head;\n  const height = endB - head;\n  let exact = true;\n  reversed.push([0, n - endA]);\n  if (width === 0 || height === 0) {\n    reversed.push([2, height], [1, width]);\n  } else {\n    const at = (x: number): number => a[head + x]!;\n    const bt = (y: number): number => b[head + y]!;\n    const max = width + height;\n    const offset = max + 1;\n    const v = new Int32Array(2 * max + 3);\n    // trace[d] is the band of v after the round d: the index k + d holds the furthest x on the diagonal k\n    const trace: Int32Array[] = [];\n    let end: { readonly x: number; readonly y: number; readonly d: number } | undefined;\n    rounds: for (let d = 0; d <= max; d += 1) {\n      for (let k = -d; k <= d; k += 2) {\n        budget.steps += 1;\n        if (budget.steps > budget.max) break rounds;\n        let x =\n          k === -d || (k !== d && v[offset + k - 1]! < v[offset + k + 1]!)\n            ? v[offset + k + 1]!\n            : v[offset + k - 1]! + 1;\n        let y = x - k;\n        while (x < width && y < height && at(x) === bt(y)) {\n          x += 1;\n          y += 1;\n          budget.steps += 1;\n        }\n        v[offset + k] = x;\n        if (x >= width && y >= height) {\n          end = { x, y, d };\n          break rounds;\n        }\n      }\n      trace.push(v.slice(offset - d, offset + d + 1));\n    }\n    if (end === undefined) {\n      // the budget ended: the furthest point of the last full round, and the rest as one change\n      exact = false;\n      const d = trace.length - 1;\n      let x = 0;\n      let y = 0;\n      if (d >= 0) {\n        const band = trace[d]!;\n        for (let k = -d; k <= d; k += 2) {\n          const fx = band[k + d]!;\n          const fy = fx - k;\n          if (fx <= width && fy >= 0 && fy <= height && fx + fy > x + y) {\n            x = fx;\n            y = fy;\n          }\n        }\n      }\n      reversed.push([2, height - y], [1, width - x]);\n      end = { x, y, d: Math.max(0, d) };\n    }\n    let { x, y } = end;\n    for (let d = end.d; d > 0; d -= 1) {\n      const band = trace[d - 1]!;\n      const k = x - y;\n      const before = (kk: number): number => band[kk + d - 1]!;\n      const down = k === -d || (k !== d && before(k - 1) < before(k + 1));\n      const fromK = down ? k + 1 : k - 1;\n      const fromX = before(fromK);\n      const fromY = fromX - fromK;\n      const moved = down ? fromX : fromX + 1;\n      reversed.push([0, x - moved], down ? [2, 1] : [1, 1]);\n      x = fromX;\n      y = fromY;\n    }\n    reversed.push([0, x]);\n  }\n  reversed.push([0, head]);\n  const runs: Run[] = [];\n  for (let at = reversed.length - 1; at >= 0; at -= 1) {\n    const [op, count] = reversed[at]!;\n    if (count <= 0) continue;\n    const last = runs.at(-1);\n    if (last !== undefined && last.op === op)\n      runs[runs.length - 1] = { op, count: last.count + count };\n    else runs.push({ op, count });\n  }\n  return { runs, exact };\n};\n\n/** This function gives a number for each value, equal numbers for equal values. */\nconst numberer = (): ((value: string) => number) => {\n  const ids = new Map<string, number>();\n  return (value) => {\n    let id = ids.get(value);\n    if (id === undefined) {\n      id = ids.size;\n      ids.set(value, id);\n    }\n    return id;\n  };\n};\n\n/** A token is a word, a run of spaces, or one sign. */\nconst TOKEN = /\\s+|[\\p{L}\\p{N}\\p{M}_]+|[^\\s\\p{L}\\p{N}\\p{M}_]/gu;\n\nconst tokensOf = (line: string): string[] => line.match(TOKEN) ?? [];\n\n/** This function counts the words of a text: each token that is not a space. */\nconst wordsOf = (text: string): number => {\n  let count = 0;\n  for (const token of tokensOf(text)) if (!/^\\s+$/.test(token)) count += 1;\n  return count;\n};\n\n/** This function gives the word diff of a changed line, or null when the line is too long or the budget ended. */\nconst wordDiff = (\n  before: string,\n  after: string,\n  budget: Budget,\n  limits: DiffLimits,\n): { readonly parts: WordPart[]; readonly exact: boolean } | null => {\n  if (budget.steps >= budget.max) return null;\n  const a = tokensOf(before);\n  const b = tokensOf(after);\n  if (a.length > limits.maxLineWords || b.length > limits.maxLineWords) return null;\n  const id = numberer();\n  const script = editScript(\n    a.map((token) => id(token)),\n    b.map((token) => id(token)),\n    budget,\n  );\n  const parts: WordPart[] = [];\n  const push = (op: WordPart[\"op\"], text: string): void => {\n    const last = parts.at(-1);\n    if (last !== undefined && last.op === op)\n      parts[parts.length - 1] = { op, text: last.text + text };\n    else parts.push({ op, text });\n  };\n  let i = 0;\n  let j = 0;\n  for (const run of script.runs) {\n    if (run.op === 0) {\n      push(\"same\", a.slice(i, i + run.count).join(\"\"));\n      i += run.count;\n      j += run.count;\n    } else if (run.op === 1) {\n      push(\"removed\", a.slice(i, i + run.count).join(\"\"));\n      i += run.count;\n    } else {\n      push(\"added\", b.slice(j, j + run.count).join(\"\"));\n      j += run.count;\n    }\n  }\n  return { parts, exact: script.exact };\n};\n\n/** One line of the full diff, before the hunks: its kind and its positions in the old and the new text. */\ntype Entry =\n  | { readonly op: \"same\"; readonly a: number; readonly b: number }\n  | { readonly op: \"removed\"; readonly a: number }\n  | { readonly op: \"added\"; readonly b: number }\n  | {\n      readonly op: \"changed\";\n      readonly a: number;\n      readonly b: number;\n      readonly words: readonly WordPart[] | null;\n    };\n\nconst IDENTIFIER = /^[A-Za-z_$][\\w$]*$/;\n\nconst keyPath = (path: string, key: string): string =>\n  IDENTIFIER.test(key) ? (path === \"\" ? key : `${path}.${key}`) : `${path}[${JSON.stringify(key)}]`;\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n/** This function gives the changes at paths between two values, to the limits. */\nconst metaChanges = (\n  before: unknown,\n  after: unknown,\n  limits: DiffLimits,\n): { readonly changes: MetaChange[]; readonly count: number } => {\n  const changes: MetaChange[] = [];\n  let count = 0;\n  const show = (value: unknown): string => {\n    const text = stableStringify(value);\n    return text.length > limits.maxValueChars ? `${text.slice(0, limits.maxValueChars)}…` : text;\n  };\n  const note = (path: string, change: MetaChange[\"change\"], a: unknown, b: unknown): void => {\n    count += 1;\n    if (changes.length < limits.maxMetaChanges) {\n      changes.push({\n        path,\n        change,\n        before: change === \"added\" ? null : show(a),\n        after: change === \"removed\" ? null : show(b),\n      });\n    }\n  };\n  // each array diff has a small budget of its own, so the metadata stays bounded too\n  const walk = (a: unknown, b: unknown, path: string, depth: number): void => {\n    if (a === b) return;\n    if (depth >= limits.maxMetaDepth) {\n      if (stableStringify(a) !== stableStringify(b)) note(path, \"changed\", a, b);\n      return;\n    }\n    if (isRecord(a) && isRecord(b)) {\n      const keys = [...new Set([...Object.keys(a), ...Object.keys(b)])].sort();\n      for (const key of keys) {\n        const inA = Object.hasOwn(a, key) && a[key] !== undefined;\n        const inB = Object.hasOwn(b, key) && b[key] !== undefined;\n        const at = keyPath(path, key);\n        if (inA && !inB) note(at, \"removed\", a[key], undefined);\n        else if (!inA && inB) note(at, \"added\", undefined, b[key]);\n        else if (inA && inB) walk(a[key], b[key], at, depth + 1);\n      }\n      return;\n    }\n    if (Array.isArray(a) && Array.isArray(b)) {\n      const id = numberer();\n      const script = editScript(\n        a.map((item) => id(stableStringify(item))),\n        b.map((item) => id(stableStringify(item))),\n        { steps: 0, max: 100_000 },\n      );\n      let i = 0;\n      let j = 0;\n      const removed: number[] = [];\n      const added: number[] = [];\n      const flush = (): void => {\n        const pairs = Math.min(removed.length, added.length);\n        for (let at = 0; at < pairs; at += 1) {\n          walk(a[removed[at]!], b[added[at]!], `${path}[${String(added[at])}]`, depth + 1);\n        }\n        for (const at of removed.slice(pairs))\n          note(`${path}[${String(at)}]`, \"removed\", a[at], undefined);\n        for (const at of added.slice(pairs))\n          note(`${path}[${String(at)}]`, \"added\", undefined, b[at]);\n        removed.length = 0;\n        added.length = 0;\n      };\n      for (const run of script.runs) {\n        if (run.op === 0) {\n          flush();\n          i += run.count;\n          j += run.count;\n        } else if (run.op === 1) {\n          for (let at = 0; at < run.count; at += 1) removed.push(i + at);\n          i += run.count;\n        } else {\n          for (let at = 0; at < run.count; at += 1) added.push(j + at);\n          j += run.count;\n        }\n      }\n      flush();\n      return;\n    }\n    if (stableStringify(a) !== stableStringify(b)) note(path, \"changed\", a, b);\n  };\n  walk(before, after, \"\", 0);\n  return { changes, count };\n};\n\n/** This function gives the limits of a diff, with the defaults of `DIFF_LIMITS` for the limits that it does not get. */\nconst limitsOf = (given: Partial<DiffLimits>): DiffLimits => {\n  const limits: Record<string, number> = { ...DIFF_LIMITS };\n  for (const [name, value] of Object.entries(given)) {\n    if (value === undefined) continue;\n    if (!Number.isInteger(value) || value < 0)\n      throw new RangeError(`the diff limit ${name} must be an integer of 0 or more`);\n    limits[name] = value;\n  }\n  return limits as DiffLimits;\n};\n\n/**\n * This function compares two versions: the lines of the text, the words of each changed line, and\n * the fields (the title, the URL and the metadata) at their paths. It writes nothing, and its time\n * and its result stay inside the limits.\n */\nexport const diffTexts = (\n  before: DiffInput,\n  after: DiffInput,\n  given: Partial<DiffLimits> = {},\n): TextDiff => {\n  const limits = limitsOf(given);\n  const notes: string[] = [];\n  let truncated = false;\n  const cut = (text: string, side: string): string[] => {\n    let kept = text;\n    if (kept.length > limits.maxChars) {\n      kept = kept.slice(0, limits.maxChars);\n      truncated = true;\n      notes.push(\n        `the ${side} text is longer than ${String(limits.maxChars)} characters, so the diff compares its first part`,\n      );\n    }\n    const lines = kept.length === 0 ? [] : kept.split(\"\\n\");\n    if (lines.length > limits.maxLines) {\n      truncated = true;\n      notes.push(\n        `the ${side} text has more than ${String(limits.maxLines)} lines, so the diff compares its first lines`,\n      );\n      return lines.slice(0, limits.maxLines);\n    }\n    return lines;\n  };\n  const a = cut(before.text, \"old\");\n  const b = cut(after.text, \"new\");\n  const id = numberer();\n  const lineBudget: Budget = { steps: 0, max: limits.maxSteps };\n  const script = editScript(\n    a.map((line) => id(line)),\n    b.map((line) => id(line)),\n    lineBudget,\n  );\n  let exact = script.exact;\n  if (!script.exact) {\n    notes.push(\n      `the change is too large for a minimal diff in ${String(limits.maxSteps)} steps, so the diff shows its last part as one removal and one addition`,\n    );\n  }\n  const wordBudget: Budget = { steps: 0, max: limits.maxWordSteps };\n  const entries: Entry[] = [];\n  let linesAdded = 0;\n  let linesRemoved = 0;\n  let linesChanged = 0;\n  let wordsAdded = 0;\n  let wordsRemoved = 0;\n  let wordsCut = false;\n  let i = 0;\n  let j = 0;\n  const removed: number[] = [];\n  const added: number[] = [];\n  const flush = (): void => {\n    const pairs = Math.min(removed.length, added.length);\n    for (let at = 0; at < pairs; at += 1) {\n      const from = removed[at]!;\n      const to = added[at]!;\n      const words = wordDiff(a[from]!, b[to]!, wordBudget, limits);\n      if (words === null) {\n        wordsCut = true;\n        wordsRemoved += wordsOf(a[from]!);\n        wordsAdded += wordsOf(b[to]!);\n      } else {\n        if (!words.exact) exact = false;\n        for (const part of words.parts) {\n          if (part.op === \"added\") wordsAdded += wordsOf(part.text);\n          else if (part.op === \"removed\") wordsRemoved += wordsOf(part.text);\n        }\n      }\n      entries.push({ op: \"changed\", a: from, b: to, words: words?.parts ?? null });\n    }\n    for (const from of removed.slice(pairs)) {\n      wordsRemoved += wordsOf(a[from]!);\n      entries.push({ op: \"removed\", a: from });\n    }\n    for (const to of added.slice(pairs)) {\n      wordsAdded += wordsOf(b[to]!);\n      entries.push({ op: \"added\", b: to });\n    }\n    linesChanged += pairs;\n    removed.length = 0;\n    added.length = 0;\n  };\n  for (const run of script.runs) {\n    if (run.op === 0) {\n      flush();\n      for (let at = 0; at < run.count; at += 1) entries.push({ op: \"same\", a: i + at, b: j + at });\n      i += run.count;\n      j += run.count;\n    } else if (run.op === 1) {\n      for (let at = 0; at < run.count; at += 1) removed.push(i + at);\n      linesRemoved += run.count;\n      i += run.count;\n    } else {\n      for (let at = 0; at < run.count; at += 1) added.push(j + at);\n      linesAdded += run.count;\n      j += run.count;\n    }\n  }\n  flush();\n  if (wordsCut) {\n    exact = false;\n    notes.push(\"some changed lines have no word diff: they are too long, or the word budget ended\");\n  }\n\n  // the hunks: each change with its context, and the hunks that touch become one\n  const hunks: DiffHunk[] = [];\n  let shown = 0;\n  let current:\n    { lines: DiffLine[]; from: number; to: number; a: number; b: number; end: number } | undefined;\n  const lineOf = (entry: Entry): DiffLine => {\n    switch (entry.op) {\n      case \"same\":\n        return { op: \"same\", text: a[entry.a]! };\n      case \"removed\":\n        return { op: \"removed\", text: a[entry.a]! };\n      case \"added\":\n        return { op: \"added\", text: b[entry.b]! };\n      default:\n        return { op: \"changed\", before: a[entry.a]!, after: b[entry.b]!, words: entry.words };\n    }\n  };\n  const close = (): void => {\n    if (current === undefined) return;\n    hunks.push({\n      from_line: current.from + 1,\n      from_count: current.a,\n      to_line: current.to + 1,\n      to_count: current.b,\n      lines: current.lines,\n    });\n    current = undefined;\n  };\n  // the position in the old and the new text of each entry\n  let posA = 0;\n  let posB = 0;\n  const positions: Array<readonly [number, number]> = [];\n  for (const entry of entries) {\n    positions.push([posA, posB]);\n    if (entry.op !== \"added\") posA += 1;\n    if (entry.op !== \"removed\") posB += 1;\n  }\n  const changeAt: number[] = [];\n  for (const [at, entry] of entries.entries()) if (entry.op !== \"same\") changeAt.push(at);\n  let hunkCut = false;\n  for (const at of changeAt) {\n    if (shown >= limits.maxHunkLines) {\n      hunkCut = true;\n      break;\n    }\n    const start = Math.max(0, at - limits.context);\n    const stop = Math.min(entries.length - 1, at + limits.context);\n    if (current !== undefined && start > current.end + 1) close();\n    if (current === undefined) {\n      const [fromA, fromB] = positions[start]!;\n      current = { lines: [], from: fromA, to: fromB, a: 0, b: 0, end: start - 1 };\n    }\n    for (let line = current.end + 1; line <= stop; line += 1) {\n      if (shown >= limits.maxHunkLines) {\n        hunkCut = true;\n        break;\n      }\n      const entry = entries[line]!;\n      current.lines.push(lineOf(entry));\n      if (entry.op !== \"added\") current.a += 1;\n      if (entry.op !== \"removed\") current.b += 1;\n      current.end = line;\n      shown += 1;\n    }\n  }\n  close();\n  if (hunkCut) {\n    truncated = true;\n    notes.push(\n      `the hunks show ${String(limits.maxHunkLines)} lines, and the summary counts each line`,\n    );\n  }\n\n  const fields = metaChanges(before.fields, after.fields, limits);\n  if (fields.count > fields.changes.length) {\n    truncated = true;\n    notes.push(\n      `the result shows ${String(fields.changes.length)} of ${String(fields.count)} changes of the metadata`,\n    );\n  }\n  return {\n    summary: {\n      lines_added: linesAdded,\n      lines_removed: linesRemoved,\n      lines_changed: linesChanged,\n      words_added: wordsAdded,\n      words_removed: wordsRemoved,\n      meta_changes: fields.count,\n    },\n    hunks,\n    meta: fields.changes,\n    same:\n      linesAdded === 0 && linesRemoved === 0 && fields.count === 0 && before.text === after.text,\n    exact,\n    truncated,\n    steps: lineBudget.steps + wordBudget.steps,\n    notes,\n  };\n};\n\n// ── the diff of a stored document ───────────────────────────────────────────\n\n/** A version of a document for a diff: a capture id, or the version that was current at a time. */\nexport type VersionChoice = string | { readonly at: string | Date };\n\n/** These options choose the two versions of a diff. */\nexport interface DiffOptions {\n  /**\n   * This version is the old side: a capture id, or `{ at }`. The default is the version before\n   * `to` with the same recipe and the same kind of capture (plain or rendered).\n   */\n  readonly from?: VersionChoice | undefined;\n  /** This version is the new side: a capture id, or `{ at }`. The default is the newest version. */\n  readonly to?: VersionChoice | undefined;\n  /** These values change the limits of the diff (`DIFF_LIMITS`). */\n  readonly limits?: Partial<DiffLimits> | undefined;\n}\n\n/** This is one side of a diff: the version that it compares. */\nexport interface DiffSide {\n  /** This id is the capture of the version. A citation names it. */\n  readonly capture: string;\n  /** This time (ISO 8601) is the fetch time of the version. */\n  readonly fetched_at: string;\n  /** This value is the length of the text of the version. */\n  readonly chars: number;\n  readonly rendered: boolean;\n  /** This value is true when the version is held back, so the diff does not show its text. */\n  readonly held_back: boolean;\n  /** This time (ISO 8601) is the `at` that chose the version, or null for a capture id or a default. */\n  readonly at: string | null;\n}\n\n/** The result of a diff of two versions of a stored document. */\nexport interface DiffResult {\n  readonly doc: string;\n  readonly url: string | null;\n  readonly from: DiffSide;\n  readonly to: DiffSide;\n  /**\n   * This value is true when the two versions have the same text, title, URL and metadata. It is\n   * null when a side is held back, because then the diff does not compare the texts.\n   */\n  readonly same: boolean | null;\n  readonly summary: DiffSummary;\n  readonly hunks: readonly DiffHunk[];\n  readonly meta: readonly MetaChange[];\n  /** This value is true when a side is held back. Then the result has no text and no title, and only the structural metadata. */\n  readonly held_back: boolean;\n  /** This value is true when the line diff is minimal and each changed line has its word diff. */\n  readonly exact: boolean;\n  /** This value is true when the result leaves out a part. The note tells which part. */\n  readonly truncated: boolean;\n  /** This value counts the steps of the diff. */\n  readonly steps: number;\n  readonly note: string | null;\n}\n\n/** This function gives the version of a choice, or throws an error that names the problem. */\nconst chosen = (\n  runtime: CrawlRuntime,\n  id: string,\n  choice: VersionChoice,\n): { readonly version: VersionText; readonly at: string | null } => {\n  if (typeof choice === \"string\") {\n    const version = runtime.index.versionText(id, choice);\n    if (version === undefined)\n      throw new Error(`the document ${id} has no version from the capture ${choice}`);\n    return { version, at: null };\n  }\n  if (!isRecord(choice) || choice.at === undefined)\n    throw new RangeError(\"a version is a capture id, or an object with the time at\");\n  const at = isoTime(\"at\", choice.at);\n  const found = versionAtTime(runtime, id, at);\n  if (found.version === undefined) {\n    throw new Error(\n      `the document ${id} has no version at ${at} or before${found.first === undefined ? \"\" : `: its first capture is from ${found.first}`}`,\n    );\n  }\n  return { version: found.version, at };\n};\n\nconst sideOf = (version: VersionText, at: string | null, held: boolean): DiffSide => ({\n  capture: version.capture,\n  fetched_at: version.fetched_at,\n  chars: version.chars,\n  rendered: version.rendered,\n  held_back: held,\n  at,\n});\n\n/**\n * This function compares two versions of a stored document, and writes nothing. It applies the\n * rule for a held-back document. When the document or a version is held back, the diff compares\n * only the structural metadata, and it shows no text and no title.\n *\n * @beta\n */\nexport const diffDocument = async (\n  runtime: CrawlRuntime,\n  id: string,\n  options: DiffOptions = {},\n): Promise<DiffResult> => {\n  await Promise.resolve();\n  const doc = runtime.index.get(id);\n  if (doc === undefined)\n    throw new Error(`no stored document ${id}: find one with find(), or fetch its page`);\n  let to: { readonly version: VersionText; readonly at: string | null };\n  if (options.to === undefined) {\n    const newest = runtime.index.versions(id, { limit: 1 })[0];\n    const version =\n      newest === undefined ? undefined : runtime.index.versionText(id, newest.capture);\n    if (version === undefined) throw new Error(`the document ${id} has no version`);\n    to = { version, at: null };\n  } else to = chosen(runtime, id, options.to);\n  let from: { readonly version: VersionText; readonly at: string | null } | undefined;\n  if (options.from === undefined) {\n    // the version before, of the same recipe and kind: a render and a plain body are not a change\n    const earlier = runtime.index\n      .versions(id, { limit: 1000 })\n      .find(\n        (version) =>\n          version.capture !== to.version.capture &&\n          version.recipe === to.version.recipe &&\n          version.rendered === to.version.rendered &&\n          version.fetched_at <= to.version.fetched_at,\n      );\n    const version =\n      earlier === undefined ? undefined : runtime.index.versionText(id, earlier.capture);\n    if (version !== undefined) from = { version, at: null };\n  } else from = chosen(runtime, id, options.from);\n  const notes: string[] = [];\n  if (from === undefined) {\n    from = to;\n    notes.push(`the document ${id} has no earlier version of the same kind to compare`);\n  }\n  const docHeld = isHeldBack(doc);\n  const fromHeld = docHeld || isHeldBack(from.version);\n  const toHeld = docHeld || isHeldBack(to.version);\n  const held = fromHeld || toHeld;\n  const fields = (version: VersionText): Record<string, unknown> =>\n    held\n      ? { kind: version.kind, url: version.url, meta: heldBackMeta(version.meta) }\n      : { title: version.title, kind: version.kind, url: version.url, meta: version.meta };\n  const diff = diffTexts(\n    { text: held ? \"\" : from.version.text, fields: fields(from.version) },\n    { text: held ? \"\" : to.version.text, fields: fields(to.version) },\n    options.limits ?? {},\n  );\n  if (held) notes.unshift(HELD_BACK);\n  notes.push(...diff.notes);\n  return {\n    doc: doc.doc,\n    url: to.version.url ?? doc.url,\n    from: sideOf(from.version, from.at, fromHeld),\n    to: sideOf(to.version, to.at, toHeld),\n    same: held ? null : diff.same,\n    summary: diff.summary,\n    hunks: diff.hunks,\n    meta: diff.meta,\n    held_back: held,\n    exact: diff.exact,\n    truncated: diff.truncated,\n    steps: diff.steps,\n    note: notes.length > 0 ? notes.join(\"; \") : null,\n  };\n};\n\n/** This function gives the text of the word diff of a changed line: `[-removed-]` and `{+added+}` mark the words. */\nconst wordsText = (line: Extract<DiffLine, { op: \"changed\" }>): string =>\n  line.words === null\n    ? `[-${line.before}-]{+${line.after}+}`\n    : line.words\n        .map((part) =>\n          part.op === \"same\"\n            ? part.text\n            : part.op === \"added\"\n              ? `{+${part.text}+}`\n              : `[-${part.text}-]`,\n        )\n        .join(\"\");\n\n/**\n * This function gives the text of a diff for a person or an assistant. The text has the counts, the\n * hunks as a unified diff, and the changes of the metadata. A changed line marks its words with `[-removed-]`\n * and `{+added+}`. The text holds the text of the pages, so the MCP server puts it in an envelope.\n *\n * @beta\n */\nexport const formatDiff = (diff: Pick<DiffResult, \"summary\" | \"hunks\" | \"meta\">): string => {\n  const { summary } = diff;\n  const lines: string[] = [\n    `the text: ${String(summary.lines_added)} lines added, ${String(summary.lines_removed)} removed (${String(summary.lines_changed)} changed), ${String(summary.words_added)} words added, ${String(summary.words_removed)} removed`,\n  ];\n  for (const hunk of diff.hunks) {\n    lines.push(\n      `@@ -${String(hunk.from_line)},${String(hunk.from_count)} +${String(hunk.to_line)},${String(hunk.to_count)} @@`,\n    );\n    for (const line of hunk.lines) {\n      if (line.op === \"changed\") lines.push(`~ ${wordsText(line)}`);\n      else lines.push(`${line.op === \"same\" ? \" \" : line.op === \"added\" ? \"+\" : \"-\"} ${line.text}`);\n    }\n  }\n  lines.push(`the metadata: ${String(summary.meta_changes)} changes`);\n  for (const change of diff.meta) {\n    if (change.change === \"added\") lines.push(`+ ${change.path}: ${change.after ?? \"\"}`);\n    else if (change.change === \"removed\") lines.push(`- ${change.path}: ${change.before ?? \"\"}`);\n    else lines.push(`~ ${change.path}: ${change.before ?? \"\"} -> ${change.after ?? \"\"}`);\n  }\n  return lines.join(\"\\n\");\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAmBA,MAAa,cAAc;;CAEzB,UAAU;;CAEV,UAAU;;CAEV,UAAU;;CAEV,cAAc;;CAEd,cAAc;;CAEd,SAAS;;CAET,cAAc;;CAEd,gBAAgB;;CAEhB,cAAc;;CAEd,eAAe;AACjB;;;;;;AA0GA,MAAa,cACX,GACA,GACA,WACsD;CACtD,MAAM,IAAI,EAAE;CACZ,MAAM,IAAI,EAAE;CACZ,IAAI,OAAO;CACX,OAAO,OAAO,KAAK,OAAO,KAAK,EAAE,UAAU,EAAE,OAAO,QAAQ;CAC5D,IAAI,OAAO;CACX,IAAI,OAAO;CACX,OAAO,OAAO,QAAQ,OAAO,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,IAAI;EAChE,QAAQ;EACR,QAAQ;CACV;CACA,OAAO,SAAS,QAAQ,IAAI,QAAQ;CACpC,MAAM,WAAuC,CAAC;CAC9C,MAAM,QAAQ,OAAO;CACrB,MAAM,SAAS,OAAO;CACtB,IAAI,QAAQ;CACZ,SAAS,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC;CAC3B,IAAI,UAAU,KAAK,WAAW,GAC5B,SAAS,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;MAChC;EACL,MAAM,MAAM,MAAsB,EAAE,OAAO;EAC3C,MAAM,MAAM,MAAsB,EAAE,OAAO;EAC3C,MAAM,MAAM,QAAQ;EACpB,MAAM,SAAS,MAAM;EACrB,MAAM,IAAI,IAAI,WAAW,IAAI,MAAM,CAAC;EAEpC,MAAM,QAAsB,CAAC;EAC7B,IAAI;EACJ,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,KAAK,GAAG;GACxC,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG;IAC/B,OAAO,SAAS;IAChB,IAAI,OAAO,QAAQ,OAAO,KAAK,MAAM;IACrC,IAAI,IACF,MAAM,CAAC,KAAM,MAAM,KAAK,EAAE,SAAS,IAAI,KAAM,EAAE,SAAS,IAAI,KACxD,EAAE,SAAS,IAAI,KACf,EAAE,SAAS,IAAI,KAAM;IAC3B,IAAI,IAAI,IAAI;IACZ,OAAO,IAAI,SAAS,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG;KACjD,KAAK;KACL,KAAK;KACL,OAAO,SAAS;IAClB;IACA,EAAE,SAAS,KAAK;IAChB,IAAI,KAAK,SAAS,KAAK,QAAQ;KAC7B,MAAM;MAAE;MAAG;MAAG;KAAE;KAChB,MAAM;IACR;GACF;GACA,MAAM,KAAK,EAAE,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAC;EAChD;EACA,IAAI,QAAQ,KAAA,GAAW;GAErB,QAAQ;GACR,MAAM,IAAI,MAAM,SAAS;GACzB,IAAI,IAAI;GACR,IAAI,IAAI;GACR,IAAI,KAAK,GAAG;IACV,MAAM,OAAO,MAAM;IACnB,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG;KAC/B,MAAM,KAAK,KAAK,IAAI;KACpB,MAAM,KAAK,KAAK;KAChB,IAAI,MAAM,SAAS,MAAM,KAAK,MAAM,UAAU,KAAK,KAAK,IAAI,GAAG;MAC7D,IAAI;MACJ,IAAI;KACN;IACF;GACF;GACA,SAAS,KAAK,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;GAC7C,MAAM;IAAE;IAAG;IAAG,GAAG,KAAK,IAAI,GAAG,CAAC;GAAE;EAClC;EACA,IAAI,EAAE,GAAG,MAAM;EACf,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;GACjC,MAAM,OAAO,MAAM,IAAI;GACvB,MAAM,IAAI,IAAI;GACd,MAAM,UAAU,OAAuB,KAAK,KAAK,IAAI;GACrD,MAAM,OAAO,MAAM,CAAC,KAAM,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC;GACjE,MAAM,QAAQ,OAAO,IAAI,IAAI,IAAI;GACjC,MAAM,QAAQ,OAAO,KAAK;GAC1B,MAAM,QAAQ,QAAQ;GACtB,MAAM,QAAQ,OAAO,QAAQ,QAAQ;GACrC,SAAS,KAAK,CAAC,GAAG,IAAI,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;GACpD,IAAI;GACJ,IAAI;EACN;EACA,SAAS,KAAK,CAAC,GAAG,CAAC,CAAC;CACtB;CACA,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC;CACvB,MAAM,OAAc,CAAC;CACrB,KAAK,IAAI,KAAK,SAAS,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG;EACnD,MAAM,CAAC,IAAI,SAAS,SAAS;EAC7B,IAAI,SAAS,GAAG;EAChB,MAAM,OAAO,KAAK,GAAG,EAAE;EACvB,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,IACpC,KAAK,KAAK,SAAS,KAAK;GAAE;GAAI,OAAO,KAAK,QAAQ;EAAM;OACrD,KAAK,KAAK;GAAE;GAAI;EAAM,CAAC;CAC9B;CACA,OAAO;EAAE;EAAM;CAAM;AACvB;;AAGA,MAAM,iBAA8C;CAClD,MAAM,sBAAM,IAAI,IAAoB;CACpC,QAAQ,UAAU;EAChB,IAAI,KAAK,IAAI,IAAI,KAAK;EACtB,IAAI,OAAO,KAAA,GAAW;GACpB,KAAK,IAAI;GACT,IAAI,IAAI,OAAO,EAAE;EACnB;EACA,OAAO;CACT;AACF;;AAGA,MAAM,QAAQ;AAEd,MAAM,YAAY,SAA2B,KAAK,MAAM,KAAK,KAAK,CAAC;;AAGnE,MAAM,WAAW,SAAyB;CACxC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,SAAS,IAAI,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,GAAG,SAAS;CACvE,OAAO;AACT;;AAGA,MAAM,YACJ,QACA,OACA,QACA,WACmE;CACnE,IAAI,OAAO,SAAS,OAAO,KAAK,OAAO;CACvC,MAAM,IAAI,SAAS,MAAM;CACzB,MAAM,IAAI,SAAS,KAAK;CACxB,IAAI,EAAE,SAAS,OAAO,gBAAgB,EAAE,SAAS,OAAO,cAAc,OAAO;CAC7E,MAAM,KAAK,SAAS;CACpB,MAAM,SAAS,WACb,EAAE,KAAK,UAAU,GAAG,KAAK,CAAC,GAC1B,EAAE,KAAK,UAAU,GAAG,KAAK,CAAC,GAC1B,MACF;CACA,MAAM,QAAoB,CAAC;CAC3B,MAAM,QAAQ,IAAoB,SAAuB;EACvD,MAAM,OAAO,MAAM,GAAG,EAAE;EACxB,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,IACpC,MAAM,MAAM,SAAS,KAAK;GAAE;GAAI,MAAM,KAAK,OAAO;EAAK;OACpD,MAAM,KAAK;GAAE;GAAI;EAAK,CAAC;CAC9B;CACA,IAAI,IAAI;CACR,IAAI,IAAI;CACR,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;EAChB,KAAK,QAAQ,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAC/C,KAAK,IAAI;EACT,KAAK,IAAI;CACX,OAAO,IAAI,IAAI,OAAO,GAAG;EACvB,KAAK,WAAW,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAClD,KAAK,IAAI;CACX,OAAO;EACL,KAAK,SAAS,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAChD,KAAK,IAAI;CACX;CAEF,OAAO;EAAE;EAAO,OAAO,OAAO;CAAM;AACtC;AAcA,MAAM,aAAa;AAEnB,MAAM,WAAW,MAAc,QAC7B,WAAW,KAAK,GAAG,IAAK,SAAS,KAAK,MAAM,GAAG,KAAK,GAAG,QAAS,GAAG,KAAK,GAAG,KAAK,UAAU,GAAG,EAAE;AAEjG,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;;AAGrE,MAAM,eACJ,QACA,OACA,WAC+D;CAC/D,MAAM,UAAwB,CAAC;CAC/B,IAAI,QAAQ;CACZ,MAAM,QAAQ,UAA2B;EACvC,MAAM,OAAO,gBAAgB,KAAK;EAClC,OAAO,KAAK,SAAS,OAAO,gBAAgB,GAAG,KAAK,MAAM,GAAG,OAAO,aAAa,EAAE,KAAK;CAC1F;CACA,MAAM,QAAQ,MAAc,QAA8B,GAAY,MAAqB;EACzF,SAAS;EACT,IAAI,QAAQ,SAAS,OAAO,gBAC1B,QAAQ,KAAK;GACX;GACA;GACA,QAAQ,WAAW,UAAU,OAAO,KAAK,CAAC;GAC1C,OAAO,WAAW,YAAY,OAAO,KAAK,CAAC;EAC7C,CAAC;CAEL;CAEA,MAAM,QAAQ,GAAY,GAAY,MAAc,UAAwB;EAC1E,IAAI,MAAM,GAAG;EACb,IAAI,SAAS,OAAO,cAAc;GAChC,IAAI,gBAAgB,CAAC,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,WAAW,GAAG,CAAC;GACzE;EACF;EACA,IAAI,SAAS,CAAC,KAAK,SAAS,CAAC,GAAG;GAC9B,MAAM,OAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;GACvE,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA;IAChD,MAAM,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA;IAChD,MAAM,KAAK,QAAQ,MAAM,GAAG;IAC5B,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,WAAW,EAAE,MAAM,KAAA,CAAS;SACjD,IAAI,CAAC,OAAO,KAAK,KAAK,IAAI,SAAS,KAAA,GAAW,EAAE,IAAI;SACpD,IAAI,OAAO,KAAK,KAAK,EAAE,MAAM,EAAE,MAAM,IAAI,QAAQ,CAAC;GACzD;GACA;EACF;EACA,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;GACxC,MAAM,KAAK,SAAS;GACpB,MAAM,SAAS,WACb,EAAE,KAAK,SAAS,GAAG,gBAAgB,IAAI,CAAC,CAAC,GACzC,EAAE,KAAK,SAAS,GAAG,gBAAgB,IAAI,CAAC,CAAC,GACzC;IAAE,OAAO;IAAG,KAAK;GAAQ,CAC3B;GACA,IAAI,IAAI;GACR,IAAI,IAAI;GACR,MAAM,UAAoB,CAAC;GAC3B,MAAM,QAAkB,CAAC;GACzB,MAAM,cAAoB;IACxB,MAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM;IACnD,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GACjC,KAAK,EAAE,QAAQ,MAAO,EAAE,MAAM,MAAO,GAAG,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE,IAAI,QAAQ,CAAC;IAEjF,KAAK,MAAM,MAAM,QAAQ,MAAM,KAAK,GAClC,KAAK,GAAG,KAAK,GAAG,OAAO,EAAE,EAAE,IAAI,WAAW,EAAE,KAAK,KAAA,CAAS;IAC5D,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK,GAChC,KAAK,GAAG,KAAK,GAAG,OAAO,EAAE,EAAE,IAAI,SAAS,KAAA,GAAW,EAAE,GAAG;IAC1D,QAAQ,SAAS;IACjB,MAAM,SAAS;GACjB;GACA,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;IAChB,MAAM;IACN,KAAK,IAAI;IACT,KAAK,IAAI;GACX,OAAO,IAAI,IAAI,OAAO,GAAG;IACvB,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK,IAAI,EAAE;IAC7D,KAAK,IAAI;GACX,OAAO;IACL,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,MAAM,KAAK,IAAI,EAAE;IAC3D,KAAK,IAAI;GACX;GAEF,MAAM;GACN;EACF;EACA,IAAI,gBAAgB,CAAC,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,WAAW,GAAG,CAAC;CAC3E;CACA,KAAK,QAAQ,OAAO,IAAI,CAAC;CACzB,OAAO;EAAE;EAAS;CAAM;AAC1B;;AAGA,MAAM,YAAY,UAA2C;CAC3D,MAAM,SAAiC,EAAE,GAAG,YAAY;CACxD,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,KAAK,GAAG;EACjD,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GACtC,MAAM,IAAI,WAAW,kBAAkB,KAAK,iCAAiC;EAC/E,OAAO,QAAQ;CACjB;CACA,OAAO;AACT;;;;;;AAOA,MAAa,aACX,QACA,OACA,QAA6B,CAAC,MACjB;CACb,MAAM,SAAS,SAAS,KAAK;CAC7B,MAAM,QAAkB,CAAC;CACzB,IAAI,YAAY;CAChB,MAAM,OAAO,MAAc,SAA2B;EACpD,IAAI,OAAO;EACX,IAAI,KAAK,SAAS,OAAO,UAAU;GACjC,OAAO,KAAK,MAAM,GAAG,OAAO,QAAQ;GACpC,YAAY;GACZ,MAAM,KACJ,OAAO,KAAK,uBAAuB,OAAO,OAAO,QAAQ,EAAE,iDAC7D;EACF;EACA,MAAM,QAAQ,KAAK,WAAW,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI;EACtD,IAAI,MAAM,SAAS,OAAO,UAAU;GAClC,YAAY;GACZ,MAAM,KACJ,OAAO,KAAK,sBAAsB,OAAO,OAAO,QAAQ,EAAE,6CAC5D;GACA,OAAO,MAAM,MAAM,GAAG,OAAO,QAAQ;EACvC;EACA,OAAO;CACT;CACA,MAAM,IAAI,IAAI,OAAO,MAAM,KAAK;CAChC,MAAM,IAAI,IAAI,MAAM,MAAM,KAAK;CAC/B,MAAM,KAAK,SAAS;CACpB,MAAM,aAAqB;EAAE,OAAO;EAAG,KAAK,OAAO;CAAS;CAC5D,MAAM,SAAS,WACb,EAAE,KAAK,SAAS,GAAG,IAAI,CAAC,GACxB,EAAE,KAAK,SAAS,GAAG,IAAI,CAAC,GACxB,UACF;CACA,IAAI,QAAQ,OAAO;CACnB,IAAI,CAAC,OAAO,OACV,MAAM,KACJ,iDAAiD,OAAO,OAAO,QAAQ,EAAE,wEAC3E;CAEF,MAAM,aAAqB;EAAE,OAAO;EAAG,KAAK,OAAO;CAAa;CAChE,MAAM,UAAmB,CAAC;CAC1B,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,eAAe;CACnB,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,WAAW;CACf,IAAI,IAAI;CACR,IAAI,IAAI;CACR,MAAM,UAAoB,CAAC;CAC3B,MAAM,QAAkB,CAAC;CACzB,MAAM,cAAoB;EACxB,MAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM;EACnD,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GAAG;GACpC,MAAM,OAAO,QAAQ;GACrB,MAAM,KAAK,MAAM;GACjB,MAAM,QAAQ,SAAS,EAAE,OAAQ,EAAE,KAAM,YAAY,MAAM;GAC3D,IAAI,UAAU,MAAM;IAClB,WAAW;IACX,gBAAgB,QAAQ,EAAE,KAAM;IAChC,cAAc,QAAQ,EAAE,GAAI;GAC9B,OAAO;IACL,IAAI,CAAC,MAAM,OAAO,QAAQ;IAC1B,KAAK,MAAM,QAAQ,MAAM,OACvB,IAAI,KAAK,OAAO,SAAS,cAAc,QAAQ,KAAK,IAAI;SACnD,IAAI,KAAK,OAAO,WAAW,gBAAgB,QAAQ,KAAK,IAAI;GAErE;GACA,QAAQ,KAAK;IAAE,IAAI;IAAW,GAAG;IAAM,GAAG;IAAI,OAAO,OAAO,SAAS;GAAK,CAAC;EAC7E;EACA,KAAK,MAAM,QAAQ,QAAQ,MAAM,KAAK,GAAG;GACvC,gBAAgB,QAAQ,EAAE,KAAM;GAChC,QAAQ,KAAK;IAAE,IAAI;IAAW,GAAG;GAAK,CAAC;EACzC;EACA,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK,GAAG;GACnC,cAAc,QAAQ,EAAE,GAAI;GAC5B,QAAQ,KAAK;IAAE,IAAI;IAAS,GAAG;GAAG,CAAC;EACrC;EACA,gBAAgB;EAChB,QAAQ,SAAS;EACjB,MAAM,SAAS;CACjB;CACA,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;EAChB,MAAM;EACN,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK;GAAE,IAAI;GAAQ,GAAG,IAAI;GAAI,GAAG,IAAI;EAAG,CAAC;EAC3F,KAAK,IAAI;EACT,KAAK,IAAI;CACX,OAAO,IAAI,IAAI,OAAO,GAAG;EACvB,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK,IAAI,EAAE;EAC7D,gBAAgB,IAAI;EACpB,KAAK,IAAI;CACX,OAAO;EACL,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,MAAM,KAAK,IAAI,EAAE;EAC3D,cAAc,IAAI;EAClB,KAAK,IAAI;CACX;CAEF,MAAM;CACN,IAAI,UAAU;EACZ,QAAQ;EACR,MAAM,KAAK,mFAAmF;CAChG;CAGA,MAAM,QAAoB,CAAC;CAC3B,IAAI,QAAQ;CACZ,IAAI;CAEJ,MAAM,UAAU,UAA2B;EACzC,QAAQ,MAAM,IAAd;GACE,KAAK,QACH,OAAO;IAAE,IAAI;IAAQ,MAAM,EAAE,MAAM;GAAI;GACzC,KAAK,WACH,OAAO;IAAE,IAAI;IAAW,MAAM,EAAE,MAAM;GAAI;GAC5C,KAAK,SACH,OAAO;IAAE,IAAI;IAAS,MAAM,EAAE,MAAM;GAAI;GAC1C,SACE,OAAO;IAAE,IAAI;IAAW,QAAQ,EAAE,MAAM;IAAK,OAAO,EAAE,MAAM;IAAK,OAAO,MAAM;GAAM;EACxF;CACF;CACA,MAAM,cAAoB;EACxB,IAAI,YAAY,KAAA,GAAW;EAC3B,MAAM,KAAK;GACT,WAAW,QAAQ,OAAO;GAC1B,YAAY,QAAQ;GACpB,SAAS,QAAQ,KAAK;GACtB,UAAU,QAAQ;GAClB,OAAO,QAAQ;EACjB,CAAC;EACD,UAAU,KAAA;CACZ;CAEA,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,YAA8C,CAAC;CACrD,KAAK,MAAM,SAAS,SAAS;EAC3B,UAAU,KAAK,CAAC,MAAM,IAAI,CAAC;EAC3B,IAAI,MAAM,OAAO,SAAS,QAAQ;EAClC,IAAI,MAAM,OAAO,WAAW,QAAQ;CACtC;CACA,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,CAAC,IAAI,UAAU,QAAQ,QAAQ,GAAG,IAAI,MAAM,OAAO,QAAQ,SAAS,KAAK,EAAE;CACtF,IAAI,UAAU;CACd,KAAK,MAAM,MAAM,UAAU;EACzB,IAAI,SAAS,OAAO,cAAc;GAChC,UAAU;GACV;EACF;EACA,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,OAAO,OAAO;EAC7C,MAAM,OAAO,KAAK,IAAI,QAAQ,SAAS,GAAG,KAAK,OAAO,OAAO;EAC7D,IAAI,YAAY,KAAA,KAAa,QAAQ,QAAQ,MAAM,GAAG,MAAM;EAC5D,IAAI,YAAY,KAAA,GAAW;GACzB,MAAM,CAAC,OAAO,SAAS,UAAU;GACjC,UAAU;IAAE,OAAO,CAAC;IAAG,MAAM;IAAO,IAAI;IAAO,GAAG;IAAG,GAAG;IAAG,KAAK,QAAQ;GAAE;EAC5E;EACA,KAAK,IAAI,OAAO,QAAQ,MAAM,GAAG,QAAQ,MAAM,QAAQ,GAAG;GACxD,IAAI,SAAS,OAAO,cAAc;IAChC,UAAU;IACV;GACF;GACA,MAAM,QAAQ,QAAQ;GACtB,QAAQ,MAAM,KAAK,OAAO,KAAK,CAAC;GAChC,IAAI,MAAM,OAAO,SAAS,QAAQ,KAAK;GACvC,IAAI,MAAM,OAAO,WAAW,QAAQ,KAAK;GACzC,QAAQ,MAAM;GACd,SAAS;EACX;CACF;CACA,MAAM;CACN,IAAI,SAAS;EACX,YAAY;EACZ,MAAM,KACJ,kBAAkB,OAAO,OAAO,YAAY,EAAE,yCAChD;CACF;CAEA,MAAM,SAAS,YAAY,OAAO,QAAQ,MAAM,QAAQ,MAAM;CAC9D,IAAI,OAAO,QAAQ,OAAO,QAAQ,QAAQ;EACxC,YAAY;EACZ,MAAM,KACJ,oBAAoB,OAAO,OAAO,QAAQ,MAAM,EAAE,MAAM,OAAO,OAAO,KAAK,EAAE,yBAC/E;CACF;CACA,OAAO;EACL,SAAS;GACP,aAAa;GACb,eAAe;GACf,eAAe;GACf,aAAa;GACb,eAAe;GACf,cAAc,OAAO;EACvB;EACA;EACA,MAAM,OAAO;EACb,MACE,eAAe,KAAK,iBAAiB,KAAK,OAAO,UAAU,KAAK,OAAO,SAAS,MAAM;EACxF;EACA;EACA,OAAO,WAAW,QAAQ,WAAW;EACrC;CACF;AACF;;AA6DA,MAAM,UACJ,SACA,IACA,WACkE;CAClE,IAAI,OAAO,WAAW,UAAU;EAC9B,MAAM,UAAU,QAAQ,MAAM,YAAY,IAAI,MAAM;EACpD,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,MAAM,gBAAgB,GAAG,mCAAmC,QAAQ;EAChF,OAAO;GAAE;GAAS,IAAI;EAAK;CAC7B;CACA,IAAI,CAAC,SAAS,MAAM,KAAK,OAAO,OAAO,KAAA,GACrC,MAAM,IAAI,WAAW,0DAA0D;CACjF,MAAM,KAAK,QAAQ,MAAM,OAAO,EAAE;CAClC,MAAM,QAAQ,cAAc,SAAS,IAAI,EAAE;CAC3C,IAAI,MAAM,YAAY,KAAA,GACpB,MAAM,IAAI,MACR,gBAAgB,GAAG,qBAAqB,GAAG,YAAY,MAAM,UAAU,KAAA,IAAY,KAAK,+BAA+B,MAAM,SAC/H;CAEF,OAAO;EAAE,SAAS,MAAM;EAAS;CAAG;AACtC;AAEA,MAAM,UAAU,SAAsB,IAAmB,UAA6B;CACpF,SAAS,QAAQ;CACjB,YAAY,QAAQ;CACpB,OAAO,QAAQ;CACf,UAAU,QAAQ;CAClB,WAAW;CACX;AACF;;;;;;;;AASA,MAAa,eAAe,OAC1B,SACA,IACA,UAAuB,CAAC,MACA;CACxB,MAAM,QAAQ,QAAQ;CACtB,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MAAM,sBAAsB,GAAG,0CAA0C;CACrF,IAAI;CACJ,IAAI,QAAQ,OAAO,KAAA,GAAW;EAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;EACxD,MAAM,UACJ,WAAW,KAAA,IAAY,KAAA,IAAY,QAAQ,MAAM,YAAY,IAAI,OAAO,OAAO;EACjF,IAAI,YAAY,KAAA,GAAW,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAC9E,KAAK;GAAE;GAAS,IAAI;EAAK;CAC3B,OAAO,KAAK,OAAO,SAAS,IAAI,QAAQ,EAAE;CAC1C,IAAI;CACJ,IAAI,QAAQ,SAAS,KAAA,GAAW;EAE9B,MAAM,UAAU,QAAQ,MACrB,SAAS,IAAI,EAAE,OAAO,IAAK,CAAC,CAAC,CAC7B,MACE,YACC,QAAQ,YAAY,GAAG,QAAQ,WAC/B,QAAQ,WAAW,GAAG,QAAQ,UAC9B,QAAQ,aAAa,GAAG,QAAQ,YAChC,QAAQ,cAAc,GAAG,QAAQ,UACrC;EACF,MAAM,UACJ,YAAY,KAAA,IAAY,KAAA,IAAY,QAAQ,MAAM,YAAY,IAAI,QAAQ,OAAO;EACnF,IAAI,YAAY,KAAA,GAAW,OAAO;GAAE;GAAS,IAAI;EAAK;CACxD,OAAO,OAAO,OAAO,SAAS,IAAI,QAAQ,IAAI;CAC9C,MAAM,QAAkB,CAAC;CACzB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;EACP,MAAM,KAAK,gBAAgB,GAAG,oDAAoD;CACpF;CACA,MAAM,UAAU,WAAW,GAAG;CAC9B,MAAM,WAAW,WAAW,WAAW,KAAK,OAAO;CACnD,MAAM,SAAS,WAAW,WAAW,GAAG,OAAO;CAC/C,MAAM,OAAO,YAAY;CACzB,MAAM,UAAU,YACd,OACI;EAAE,MAAM,QAAQ;EAAM,KAAK,QAAQ;EAAK,MAAM,aAAa,QAAQ,IAAI;CAAE,IACzE;EAAE,OAAO,QAAQ;EAAO,MAAM,QAAQ;EAAM,KAAK,QAAQ;EAAK,MAAM,QAAQ;CAAK;CACvF,MAAM,OAAO,UACX;EAAE,MAAM,OAAO,KAAK,KAAK,QAAQ;EAAM,QAAQ,OAAO,KAAK,OAAO;CAAE,GACpE;EAAE,MAAM,OAAO,KAAK,GAAG,QAAQ;EAAM,QAAQ,OAAO,GAAG,OAAO;CAAE,GAChE,QAAQ,UAAU,CAAC,CACrB;CACA,IAAI,MAAM,MAAM,QAAQ,SAAS;CACjC,MAAM,KAAK,GAAG,KAAK,KAAK;CACxB,OAAO;EACL,KAAK,IAAI;EACT,KAAK,GAAG,QAAQ,OAAO,IAAI;EAC3B,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI,QAAQ;EAC5C,IAAI,OAAO,GAAG,SAAS,GAAG,IAAI,MAAM;EACpC,MAAM,OAAO,OAAO,KAAK;EACzB,SAAS,KAAK;EACd,OAAO,KAAK;EACZ,MAAM,KAAK;EACX,WAAW;EACX,OAAO,KAAK;EACZ,WAAW,KAAK;EAChB,OAAO,KAAK;EACZ,MAAM,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;CAC9C;AACF;;AAGA,MAAM,aAAa,SACjB,KAAK,UAAU,OACX,KAAK,KAAK,OAAO,MAAM,KAAK,MAAM,MAClC,KAAK,MACF,KAAK,SACJ,KAAK,OAAO,SACR,KAAK,OACL,KAAK,OAAO,UACV,KAAK,KAAK,KAAK,MACf,KAAK,KAAK,KAAK,GACvB,CAAC,CACA,KAAK,EAAE;;;;;;;;AAShB,MAAa,cAAc,SAAiE;CAC1F,MAAM,EAAE,YAAY;CACpB,MAAM,QAAkB,CACtB,aAAa,OAAO,QAAQ,WAAW,EAAE,gBAAgB,OAAO,QAAQ,aAAa,EAAE,YAAY,OAAO,QAAQ,aAAa,EAAE,aAAa,OAAO,QAAQ,WAAW,EAAE,gBAAgB,OAAO,QAAQ,aAAa,EAAE,SAC1N;CACA,KAAK,MAAM,QAAQ,KAAK,OAAO;EAC7B,MAAM,KACJ,OAAO,OAAO,KAAK,SAAS,EAAE,GAAG,OAAO,KAAK,UAAU,EAAE,IAAI,OAAO,KAAK,OAAO,EAAE,GAAG,OAAO,KAAK,QAAQ,EAAE,IAC7G;EACA,KAAK,MAAM,QAAQ,KAAK,OACtB,IAAI,KAAK,OAAO,WAAW,MAAM,KAAK,KAAK,UAAU,IAAI,GAAG;OACvD,MAAM,KAAK,GAAG,KAAK,OAAO,SAAS,MAAM,KAAK,OAAO,UAAU,MAAM,IAAI,GAAG,KAAK,MAAM;CAEhG;CACA,MAAM,KAAK,iBAAiB,OAAO,QAAQ,YAAY,EAAE,SAAS;CAClE,KAAK,MAAM,UAAU,KAAK,MACxB,IAAI,OAAO,WAAW,SAAS,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,SAAS,IAAI;MAC9E,IAAI,OAAO,WAAW,WAAW,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,UAAU,IAAI;MACtF,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,UAAU,GAAG,MAAM,OAAO,SAAS,IAAI;CAErF,OAAO,MAAM,KAAK,IAAI;AACxB"}
+{"version":3,"file":"diff-DHpF9lYY.mjs","names":[],"sources":["../src/diff.ts"],"sourcesContent":["import type { CrawlRuntime } from \"./runtime.ts\";\nimport type { VersionText } from \"./docs.ts\";\nimport { HELD_BACK, heldBackMeta, isHeldBack, isoTime, versionAtTime } from \"./runtime.ts\";\nimport { stableStringify } from \"./record.ts\";\n\n/**\n * A diff compares two versions of a stored document. It gives the changes of the text as a line\n * diff, with a word diff inside each changed line. It gives the changes of the title, the URL and\n * the metadata (the JSON-LD too) as changes at a path.\n *\n * The line diff is the algorithm of Myers (1986). Its time is linear in the length of the texts\n * when the change is small. A budget of steps (`DIFF_LIMITS`) bounds the time of a large change.\n * After the budget, the diff gives the rest of the change as one removal and one addition. Then\n * the result says that it is not minimal. A huge text gives its first part, and the result says so.\n *\n * A held-back version gives no text and no title to a diff, and only its structural metadata.\n */\n\n/** These are the limits of a diff. Each limit bounds the time or the size of a result. */\nexport const DIFF_LIMITS = {\n  /** The characters of each text that a diff compares. A longer text gives its first part. */\n  maxChars: 1_000_000,\n  /** The lines of each text that a diff compares. A longer text gives its first lines. */\n  maxLines: 50_000,\n  /** The steps of the line diff. After them, the rest of the change is one removal and one addition. */\n  maxSteps: 1_000_000,\n  /** The steps of the word diffs of all the changed lines together. */\n  maxWordSteps: 1_000_000,\n  /** The words of one line that a word diff compares. A longer line gets no word diff. */\n  maxLineWords: 5_000,\n  /** The lines of context before and after each change. */\n  context: 2,\n  /** The lines that the hunks of a result show. The summary counts each line. */\n  maxHunkLines: 2_000,\n  /** The changes of the metadata that a result shows. The summary counts each change. */\n  maxMetaChanges: 200,\n  /** The depth of the metadata that a diff compares. A deeper change is a change of the whole value. */\n  maxMetaDepth: 16,\n  /** The characters of the JSON of each value of a change of the metadata. */\n  maxValueChars: 300,\n} as const;\n\n/** These are the limits of a diff, one by one. `DIFF_LIMITS` gives the defaults. */\nexport type DiffLimits = { readonly [K in keyof typeof DIFF_LIMITS]: number };\n\n/** This is a part of a changed line: words that stay, words that the new text adds, or words that it removes. */\nexport interface WordPart {\n  readonly op: \"same\" | \"added\" | \"removed\";\n  readonly text: string;\n}\n\n/**\n * This is one line of a hunk. A `same` line is context. A `changed` line pairs a removed line with\n * an added line, and `words` gives the word diff, or null when the word budget ended.\n */\nexport type DiffLine =\n  | { readonly op: \"same\" | \"added\" | \"removed\"; readonly text: string }\n  | {\n      readonly op: \"changed\";\n      readonly before: string;\n      readonly after: string;\n      readonly words: readonly WordPart[] | null;\n    };\n\n/** This is a part of the diff of the text: the changed lines with some context, as in a unified diff. */\nexport interface DiffHunk {\n  /** This value is the number (from 1) of the first line of the hunk in the old text. */\n  readonly from_line: number;\n  /** This value is the number of lines of the old text in the hunk. */\n  readonly from_count: number;\n  /** This value is the number (from 1) of the first line of the hunk in the new text. */\n  readonly to_line: number;\n  /** This value is the number of lines of the new text in the hunk. */\n  readonly to_count: number;\n  readonly lines: readonly DiffLine[];\n}\n\n/**\n * This is one change of the title, the URL or the metadata. The path names the value, for\n * example `meta.jsonld[0].openingHours`. `before` and `after` are the JSON of the values, cut to\n * `DIFF_LIMITS.maxValueChars`.\n */\nexport interface MetaChange {\n  readonly path: string;\n  readonly change: \"added\" | \"removed\" | \"changed\";\n  /** This text is the JSON of the old value, or null when the new version adds the value. */\n  readonly before: string | null;\n  /** This text is the JSON of the new value, or null when the new version removes the value. */\n  readonly after: string | null;\n}\n\n/** These are the counts of a diff. */\nexport interface DiffSummary {\n  /** This value counts the lines that only the new text has. */\n  readonly lines_added: number;\n  /** This value counts the lines that only the old text has. */\n  readonly lines_removed: number;\n  /** This value counts the pairs of a removed line and an added line that the result shows as one changed line. */\n  readonly lines_changed: number;\n  /** This value counts the words that the new text adds, in the added lines and in the changed lines. */\n  readonly words_added: number;\n  /** This value counts the words that the new text removes, in the removed lines and in the changed lines. */\n  readonly words_removed: number;\n  /** This value counts the changes of the title, the URL and the metadata. */\n  readonly meta_changes: number;\n}\n\n/** This is the input of `diffTexts`: the parts of a version that a diff compares. */\nexport interface DiffInput {\n  readonly text: string;\n  readonly fields: Readonly<Record<string, unknown>>;\n}\n\n/** This is the result of `diffTexts`. */\nexport interface TextDiff {\n  readonly summary: DiffSummary;\n  readonly hunks: readonly DiffHunk[];\n  readonly meta: readonly MetaChange[];\n  /** This value is true when the text and the fields are the same. */\n  readonly same: boolean;\n  /** This value is true when the line diff is minimal and each changed line has its word diff. */\n  readonly exact: boolean;\n  /** This value is true when the result leaves out a part. It can leave out the end of a long text, lines of the hunks or changes of the metadata. */\n  readonly truncated: boolean;\n  /** This value counts the steps of the line diff and of the word diffs. A test reads it: a step count does not change with the computer. */\n  readonly steps: number;\n  readonly notes: readonly string[];\n}\n\n/** A run of the edit script. `0` keeps lines of the two texts. `1` removes lines of the old text, and `2` adds lines of the new text. */\ninterface Run {\n  readonly op: 0 | 1 | 2;\n  readonly count: number;\n}\n\n/** A budget of steps. The diffs add to `steps`, and stop when it passes `max`. */\ninterface Budget {\n  steps: number;\n  max: number;\n}\n\n/**\n * This function gives an edit script from `a` to `b`, with the algorithm of Myers. It first\n * removes the common start and the common end. When the budget ends, it keeps the furthest path\n * that it found, and the rest is one removal and one addition. `exact` is then false.\n */\nexport const editScript = (\n  a: ArrayLike<number>,\n  b: ArrayLike<number>,\n  budget: Budget,\n): { readonly runs: Run[]; readonly exact: boolean } => {\n  const n = a.length;\n  const m = b.length;\n  let head = 0;\n  while (head < n && head < m && a[head] === b[head]) head += 1;\n  let endA = n;\n  let endB = m;\n  while (endA > head && endB > head && a[endA - 1] === b[endB - 1]) {\n    endA -= 1;\n    endB -= 1;\n  }\n  budget.steps += head + (n - endA) + 1;\n  const reversed: Array<[0 | 1 | 2, number]> = [];\n  const width = endA - head;\n  const height = endB - head;\n  let exact = true;\n  reversed.push([0, n - endA]);\n  if (width === 0 || height === 0) {\n    reversed.push([2, height], [1, width]);\n  } else {\n    const at = (x: number): number => a[head + x]!;\n    const bt = (y: number): number => b[head + y]!;\n    const max = width + height;\n    const offset = max + 1;\n    const v = new Int32Array(2 * max + 3);\n    // trace[d] is the band of v after the round d: the index k + d holds the furthest x on the diagonal k\n    const trace: Int32Array[] = [];\n    let end: { readonly x: number; readonly y: number; readonly d: number } | undefined;\n    rounds: for (let d = 0; d <= max; d += 1) {\n      for (let k = -d; k <= d; k += 2) {\n        budget.steps += 1;\n        if (budget.steps > budget.max) break rounds;\n        let x =\n          k === -d || (k !== d && v[offset + k - 1]! < v[offset + k + 1]!)\n            ? v[offset + k + 1]!\n            : v[offset + k - 1]! + 1;\n        let y = x - k;\n        while (x < width && y < height && at(x) === bt(y)) {\n          x += 1;\n          y += 1;\n          budget.steps += 1;\n        }\n        v[offset + k] = x;\n        if (x >= width && y >= height) {\n          end = { x, y, d };\n          break rounds;\n        }\n      }\n      trace.push(v.slice(offset - d, offset + d + 1));\n    }\n    if (end === undefined) {\n      // the budget ended: the furthest point of the last full round, and the rest as one change\n      exact = false;\n      const d = trace.length - 1;\n      let x = 0;\n      let y = 0;\n      if (d >= 0) {\n        const band = trace[d]!;\n        for (let k = -d; k <= d; k += 2) {\n          const fx = band[k + d]!;\n          const fy = fx - k;\n          if (fx <= width && fy >= 0 && fy <= height && fx + fy > x + y) {\n            x = fx;\n            y = fy;\n          }\n        }\n      }\n      reversed.push([2, height - y], [1, width - x]);\n      end = { x, y, d: Math.max(0, d) };\n    }\n    let { x, y } = end;\n    for (let d = end.d; d > 0; d -= 1) {\n      const band = trace[d - 1]!;\n      const k = x - y;\n      const before = (kk: number): number => band[kk + d - 1]!;\n      const down = k === -d || (k !== d && before(k - 1) < before(k + 1));\n      const fromK = down ? k + 1 : k - 1;\n      const fromX = before(fromK);\n      const fromY = fromX - fromK;\n      const moved = down ? fromX : fromX + 1;\n      reversed.push([0, x - moved], down ? [2, 1] : [1, 1]);\n      x = fromX;\n      y = fromY;\n    }\n    reversed.push([0, x]);\n  }\n  reversed.push([0, head]);\n  const runs: Run[] = [];\n  for (let at = reversed.length - 1; at >= 0; at -= 1) {\n    const [op, count] = reversed[at]!;\n    if (count <= 0) continue;\n    const last = runs.at(-1);\n    if (last !== undefined && last.op === op)\n      runs[runs.length - 1] = { op, count: last.count + count };\n    else runs.push({ op, count });\n  }\n  return { runs, exact };\n};\n\n/** This function gives a number for each value, equal numbers for equal values. */\nconst numberer = (): ((value: string) => number) => {\n  const ids = new Map<string, number>();\n  return (value) => {\n    let id = ids.get(value);\n    if (id === undefined) {\n      id = ids.size;\n      ids.set(value, id);\n    }\n    return id;\n  };\n};\n\n/** A token is a word, a run of spaces, or one sign. */\nconst TOKEN = /\\s+|[\\p{L}\\p{N}\\p{M}_]+|[^\\s\\p{L}\\p{N}\\p{M}_]/gu;\n\nconst tokensOf = (line: string): string[] => line.match(TOKEN) ?? [];\n\n/** This function counts the words of a text: each token that is not a space. */\nconst wordsOf = (text: string): number => {\n  let count = 0;\n  for (const token of tokensOf(text)) if (!/^\\s+$/.test(token)) count += 1;\n  return count;\n};\n\n/** This function gives the word diff of a changed line, or null when the line is too long or the budget ended. */\nconst wordDiff = (\n  before: string,\n  after: string,\n  budget: Budget,\n  limits: DiffLimits,\n): { readonly parts: WordPart[]; readonly exact: boolean } | null => {\n  if (budget.steps >= budget.max) return null;\n  const a = tokensOf(before);\n  const b = tokensOf(after);\n  if (a.length > limits.maxLineWords || b.length > limits.maxLineWords) return null;\n  const id = numberer();\n  const script = editScript(\n    a.map((token) => id(token)),\n    b.map((token) => id(token)),\n    budget,\n  );\n  const parts: WordPart[] = [];\n  const push = (op: WordPart[\"op\"], text: string): void => {\n    const last = parts.at(-1);\n    if (last !== undefined && last.op === op)\n      parts[parts.length - 1] = { op, text: last.text + text };\n    else parts.push({ op, text });\n  };\n  let i = 0;\n  let j = 0;\n  for (const run of script.runs) {\n    if (run.op === 0) {\n      push(\"same\", a.slice(i, i + run.count).join(\"\"));\n      i += run.count;\n      j += run.count;\n    } else if (run.op === 1) {\n      push(\"removed\", a.slice(i, i + run.count).join(\"\"));\n      i += run.count;\n    } else {\n      push(\"added\", b.slice(j, j + run.count).join(\"\"));\n      j += run.count;\n    }\n  }\n  return { parts, exact: script.exact };\n};\n\n/** One line of the full diff, before the hunks: its kind and its positions in the old and the new text. */\ntype Entry =\n  | { readonly op: \"same\"; readonly a: number; readonly b: number }\n  | { readonly op: \"removed\"; readonly a: number }\n  | { readonly op: \"added\"; readonly b: number }\n  | {\n      readonly op: \"changed\";\n      readonly a: number;\n      readonly b: number;\n      readonly words: readonly WordPart[] | null;\n    };\n\nconst IDENTIFIER = /^[A-Za-z_$][\\w$]*$/;\n\nconst keyPath = (path: string, key: string): string =>\n  IDENTIFIER.test(key) ? (path === \"\" ? key : `${path}.${key}`) : `${path}[${JSON.stringify(key)}]`;\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n/** This function gives the changes at paths between two values, to the limits. */\nconst metaChanges = (\n  before: unknown,\n  after: unknown,\n  limits: DiffLimits,\n): { readonly changes: MetaChange[]; readonly count: number } => {\n  const changes: MetaChange[] = [];\n  let count = 0;\n  const show = (value: unknown): string => {\n    const text = stableStringify(value);\n    return text.length > limits.maxValueChars ? `${text.slice(0, limits.maxValueChars)}…` : text;\n  };\n  const note = (path: string, change: MetaChange[\"change\"], a: unknown, b: unknown): void => {\n    count += 1;\n    if (changes.length < limits.maxMetaChanges) {\n      changes.push({\n        path,\n        change,\n        before: change === \"added\" ? null : show(a),\n        after: change === \"removed\" ? null : show(b),\n      });\n    }\n  };\n  // each array diff has a small budget of its own, so the metadata stays bounded too\n  const walk = (a: unknown, b: unknown, path: string, depth: number): void => {\n    if (a === b) return;\n    if (depth >= limits.maxMetaDepth) {\n      if (stableStringify(a) !== stableStringify(b)) note(path, \"changed\", a, b);\n      return;\n    }\n    if (isRecord(a) && isRecord(b)) {\n      const keys = [...new Set([...Object.keys(a), ...Object.keys(b)])].sort();\n      for (const key of keys) {\n        const inA = Object.hasOwn(a, key) && a[key] !== undefined;\n        const inB = Object.hasOwn(b, key) && b[key] !== undefined;\n        const at = keyPath(path, key);\n        if (inA && !inB) note(at, \"removed\", a[key], undefined);\n        else if (!inA && inB) note(at, \"added\", undefined, b[key]);\n        else if (inA && inB) walk(a[key], b[key], at, depth + 1);\n      }\n      return;\n    }\n    if (Array.isArray(a) && Array.isArray(b)) {\n      const id = numberer();\n      const script = editScript(\n        a.map((item) => id(stableStringify(item))),\n        b.map((item) => id(stableStringify(item))),\n        { steps: 0, max: 100_000 },\n      );\n      let i = 0;\n      let j = 0;\n      const removed: number[] = [];\n      const added: number[] = [];\n      const flush = (): void => {\n        const pairs = Math.min(removed.length, added.length);\n        for (let at = 0; at < pairs; at += 1) {\n          walk(a[removed[at]!], b[added[at]!], `${path}[${String(added[at])}]`, depth + 1);\n        }\n        for (const at of removed.slice(pairs))\n          note(`${path}[${String(at)}]`, \"removed\", a[at], undefined);\n        for (const at of added.slice(pairs))\n          note(`${path}[${String(at)}]`, \"added\", undefined, b[at]);\n        removed.length = 0;\n        added.length = 0;\n      };\n      for (const run of script.runs) {\n        if (run.op === 0) {\n          flush();\n          i += run.count;\n          j += run.count;\n        } else if (run.op === 1) {\n          for (let at = 0; at < run.count; at += 1) removed.push(i + at);\n          i += run.count;\n        } else {\n          for (let at = 0; at < run.count; at += 1) added.push(j + at);\n          j += run.count;\n        }\n      }\n      flush();\n      return;\n    }\n    if (stableStringify(a) !== stableStringify(b)) note(path, \"changed\", a, b);\n  };\n  walk(before, after, \"\", 0);\n  return { changes, count };\n};\n\n/** This function gives the limits of a diff, with the defaults of `DIFF_LIMITS` for the limits that it does not get. */\nconst limitsOf = (given: Partial<DiffLimits>): DiffLimits => {\n  const limits: Record<string, number> = { ...DIFF_LIMITS };\n  for (const [name, value] of Object.entries(given)) {\n    if (value === undefined) continue;\n    if (!Number.isInteger(value) || value < 0)\n      throw new RangeError(`the diff limit ${name} must be an integer of 0 or more`);\n    limits[name] = value;\n  }\n  return limits as DiffLimits;\n};\n\n/**\n * This function compares two versions: the lines of the text, the words of each changed line, and\n * the fields (the title, the URL and the metadata) at their paths. It writes nothing, and its time\n * and its result stay inside the limits.\n */\nexport const diffTexts = (\n  before: DiffInput,\n  after: DiffInput,\n  given: Partial<DiffLimits> = {},\n): TextDiff => {\n  const limits = limitsOf(given);\n  const notes: string[] = [];\n  let truncated = false;\n  const cut = (text: string, side: string): string[] => {\n    let kept = text;\n    if (kept.length > limits.maxChars) {\n      kept = kept.slice(0, limits.maxChars);\n      truncated = true;\n      notes.push(\n        `the ${side} text is longer than ${String(limits.maxChars)} characters, so the diff compares its first part`,\n      );\n    }\n    const lines = kept.length === 0 ? [] : kept.split(\"\\n\");\n    if (lines.length > limits.maxLines) {\n      truncated = true;\n      notes.push(\n        `the ${side} text has more than ${String(limits.maxLines)} lines, so the diff compares its first lines`,\n      );\n      return lines.slice(0, limits.maxLines);\n    }\n    return lines;\n  };\n  const a = cut(before.text, \"old\");\n  const b = cut(after.text, \"new\");\n  const id = numberer();\n  const lineBudget: Budget = { steps: 0, max: limits.maxSteps };\n  const script = editScript(\n    a.map((line) => id(line)),\n    b.map((line) => id(line)),\n    lineBudget,\n  );\n  let exact = script.exact;\n  if (!script.exact) {\n    notes.push(\n      `the change is too large for a minimal diff in ${String(limits.maxSteps)} steps, so the diff shows its last part as one removal and one addition`,\n    );\n  }\n  const wordBudget: Budget = { steps: 0, max: limits.maxWordSteps };\n  const entries: Entry[] = [];\n  let linesAdded = 0;\n  let linesRemoved = 0;\n  let linesChanged = 0;\n  let wordsAdded = 0;\n  let wordsRemoved = 0;\n  let wordsCut = false;\n  let i = 0;\n  let j = 0;\n  const removed: number[] = [];\n  const added: number[] = [];\n  const flush = (): void => {\n    const pairs = Math.min(removed.length, added.length);\n    for (let at = 0; at < pairs; at += 1) {\n      const from = removed[at]!;\n      const to = added[at]!;\n      const words = wordDiff(a[from]!, b[to]!, wordBudget, limits);\n      if (words === null) {\n        wordsCut = true;\n        wordsRemoved += wordsOf(a[from]!);\n        wordsAdded += wordsOf(b[to]!);\n      } else {\n        if (!words.exact) exact = false;\n        for (const part of words.parts) {\n          if (part.op === \"added\") wordsAdded += wordsOf(part.text);\n          else if (part.op === \"removed\") wordsRemoved += wordsOf(part.text);\n        }\n      }\n      entries.push({ op: \"changed\", a: from, b: to, words: words?.parts ?? null });\n    }\n    for (const from of removed.slice(pairs)) {\n      wordsRemoved += wordsOf(a[from]!);\n      entries.push({ op: \"removed\", a: from });\n    }\n    for (const to of added.slice(pairs)) {\n      wordsAdded += wordsOf(b[to]!);\n      entries.push({ op: \"added\", b: to });\n    }\n    linesChanged += pairs;\n    removed.length = 0;\n    added.length = 0;\n  };\n  for (const run of script.runs) {\n    if (run.op === 0) {\n      flush();\n      for (let at = 0; at < run.count; at += 1) entries.push({ op: \"same\", a: i + at, b: j + at });\n      i += run.count;\n      j += run.count;\n    } else if (run.op === 1) {\n      for (let at = 0; at < run.count; at += 1) removed.push(i + at);\n      linesRemoved += run.count;\n      i += run.count;\n    } else {\n      for (let at = 0; at < run.count; at += 1) added.push(j + at);\n      linesAdded += run.count;\n      j += run.count;\n    }\n  }\n  flush();\n  if (wordsCut) {\n    exact = false;\n    notes.push(\"some changed lines have no word diff: they are too long, or the word budget ended\");\n  }\n\n  // the hunks: each change with its context, and the hunks that touch become one\n  const hunks: DiffHunk[] = [];\n  let shown = 0;\n  let current:\n    { lines: DiffLine[]; from: number; to: number; a: number; b: number; end: number } | undefined;\n  const lineOf = (entry: Entry): DiffLine => {\n    switch (entry.op) {\n      case \"same\":\n        return { op: \"same\", text: a[entry.a]! };\n      case \"removed\":\n        return { op: \"removed\", text: a[entry.a]! };\n      case \"added\":\n        return { op: \"added\", text: b[entry.b]! };\n      default:\n        return { op: \"changed\", before: a[entry.a]!, after: b[entry.b]!, words: entry.words };\n    }\n  };\n  const close = (): void => {\n    if (current === undefined) return;\n    hunks.push({\n      from_line: current.from + 1,\n      from_count: current.a,\n      to_line: current.to + 1,\n      to_count: current.b,\n      lines: current.lines,\n    });\n    current = undefined;\n  };\n  // the position in the old and the new text of each entry\n  let posA = 0;\n  let posB = 0;\n  const positions: Array<readonly [number, number]> = [];\n  for (const entry of entries) {\n    positions.push([posA, posB]);\n    if (entry.op !== \"added\") posA += 1;\n    if (entry.op !== \"removed\") posB += 1;\n  }\n  const changeAt: number[] = [];\n  for (const [at, entry] of entries.entries()) if (entry.op !== \"same\") changeAt.push(at);\n  let hunkCut = false;\n  for (const at of changeAt) {\n    if (shown >= limits.maxHunkLines) {\n      hunkCut = true;\n      break;\n    }\n    const start = Math.max(0, at - limits.context);\n    const stop = Math.min(entries.length - 1, at + limits.context);\n    if (current !== undefined && start > current.end + 1) close();\n    if (current === undefined) {\n      const [fromA, fromB] = positions[start]!;\n      current = { lines: [], from: fromA, to: fromB, a: 0, b: 0, end: start - 1 };\n    }\n    for (let line = current.end + 1; line <= stop; line += 1) {\n      if (shown >= limits.maxHunkLines) {\n        hunkCut = true;\n        break;\n      }\n      const entry = entries[line]!;\n      current.lines.push(lineOf(entry));\n      if (entry.op !== \"added\") current.a += 1;\n      if (entry.op !== \"removed\") current.b += 1;\n      current.end = line;\n      shown += 1;\n    }\n  }\n  close();\n  if (hunkCut) {\n    truncated = true;\n    notes.push(\n      `the hunks show ${String(limits.maxHunkLines)} lines, and the summary counts each line`,\n    );\n  }\n\n  const fields = metaChanges(before.fields, after.fields, limits);\n  if (fields.count > fields.changes.length) {\n    truncated = true;\n    notes.push(\n      `the result shows ${String(fields.changes.length)} of ${String(fields.count)} changes of the metadata`,\n    );\n  }\n  return {\n    summary: {\n      lines_added: linesAdded,\n      lines_removed: linesRemoved,\n      lines_changed: linesChanged,\n      words_added: wordsAdded,\n      words_removed: wordsRemoved,\n      meta_changes: fields.count,\n    },\n    hunks,\n    meta: fields.changes,\n    same:\n      linesAdded === 0 && linesRemoved === 0 && fields.count === 0 && before.text === after.text,\n    exact,\n    truncated,\n    steps: lineBudget.steps + wordBudget.steps,\n    notes,\n  };\n};\n\n// ── the diff of a stored document ───────────────────────────────────────────\n\n/** A version of a document for a diff: a capture id, or the version that was current at a time. */\nexport type VersionChoice = string | { readonly at: string | Date };\n\n/** These options choose the two versions of a diff. */\nexport interface DiffOptions {\n  /**\n   * This version is the old side: a capture id, or `{ at }`. The default is the version before\n   * `to` with the same recipe and the same kind of capture (plain or rendered).\n   */\n  readonly from?: VersionChoice | undefined;\n  /** This version is the new side: a capture id, or `{ at }`. The default is the newest version. */\n  readonly to?: VersionChoice | undefined;\n  /** These values change the limits of the diff (`DIFF_LIMITS`). */\n  readonly limits?: Partial<DiffLimits> | undefined;\n}\n\n/** This is one side of a diff: the version that it compares. */\nexport interface DiffSide {\n  /** This id is the capture of the version. A citation names it. */\n  readonly capture: string;\n  /** This time (ISO 8601) is the fetch time of the version. */\n  readonly fetched_at: string;\n  /** This value is the length of the text of the version. */\n  readonly chars: number;\n  readonly rendered: boolean;\n  /** This value is true when the version is held back, so the diff does not show its text. */\n  readonly held_back: boolean;\n  /** This time (ISO 8601) is the `at` that chose the version, or null for a capture id or a default. */\n  readonly at: string | null;\n}\n\n/** The result of a diff of two versions of a stored document. */\nexport interface DiffResult {\n  readonly doc: string;\n  readonly url: string | null;\n  readonly from: DiffSide;\n  readonly to: DiffSide;\n  /**\n   * This value is true when the two versions have the same text, title, URL and metadata. It is\n   * null when a side is held back, because then the diff does not compare the texts.\n   */\n  readonly same: boolean | null;\n  readonly summary: DiffSummary;\n  readonly hunks: readonly DiffHunk[];\n  readonly meta: readonly MetaChange[];\n  /** This value is true when a side is held back. Then the result has no text and no title, and only the structural metadata. */\n  readonly held_back: boolean;\n  /** This value is true when the line diff is minimal and each changed line has its word diff. */\n  readonly exact: boolean;\n  /** This value is true when the result leaves out a part. The note tells which part. */\n  readonly truncated: boolean;\n  /** This value counts the steps of the diff. */\n  readonly steps: number;\n  readonly note: string | null;\n}\n\n/** This function gives the version of a choice, or throws an error that names the problem. */\nconst chosen = (\n  runtime: CrawlRuntime,\n  id: string,\n  choice: VersionChoice,\n): { readonly version: VersionText; readonly at: string | null } => {\n  if (typeof choice === \"string\") {\n    const version = runtime.index.versionText(id, choice);\n    if (version === undefined)\n      throw new Error(`the document ${id} has no version from the capture ${choice}`);\n    return { version, at: null };\n  }\n  if (!isRecord(choice) || choice.at === undefined)\n    throw new RangeError(\"a version is a capture id, or an object with the time at\");\n  const at = isoTime(\"at\", choice.at);\n  const found = versionAtTime(runtime, id, at);\n  if (found.version === undefined) {\n    throw new Error(\n      `the document ${id} has no version at ${at} or before${found.first === undefined ? \"\" : `: its first capture is from ${found.first}`}`,\n    );\n  }\n  return { version: found.version, at };\n};\n\nconst sideOf = (version: VersionText, at: string | null, held: boolean): DiffSide => ({\n  capture: version.capture,\n  fetched_at: version.fetched_at,\n  chars: version.chars,\n  rendered: version.rendered,\n  held_back: held,\n  at,\n});\n\n/**\n * This function compares two versions of a stored document, and writes nothing. It applies the\n * rule for a held-back document. When the document or a version is held back, the diff compares\n * only the structural metadata, and it shows no text and no title.\n *\n * @beta\n */\nexport const diffDocument = async (\n  runtime: CrawlRuntime,\n  id: string,\n  options: DiffOptions = {},\n): Promise<DiffResult> => {\n  await Promise.resolve();\n  const doc = runtime.index.get(id);\n  if (doc === undefined)\n    throw new Error(`no stored document ${id}: find one with find(), or fetch its page`);\n  let to: { readonly version: VersionText; readonly at: string | null };\n  if (options.to === undefined) {\n    const newest = runtime.index.versions(id, { limit: 1 })[0];\n    const version =\n      newest === undefined ? undefined : runtime.index.versionText(id, newest.capture);\n    if (version === undefined) throw new Error(`the document ${id} has no version`);\n    to = { version, at: null };\n  } else to = chosen(runtime, id, options.to);\n  let from: { readonly version: VersionText; readonly at: string | null } | undefined;\n  if (options.from === undefined) {\n    // the version before, of the same recipe and kind: a render and a plain body are not a change\n    const earlier = runtime.index\n      .versions(id, { limit: 1000 })\n      .find(\n        (version) =>\n          version.capture !== to.version.capture &&\n          version.recipe === to.version.recipe &&\n          version.rendered === to.version.rendered &&\n          version.fetched_at <= to.version.fetched_at,\n      );\n    const version =\n      earlier === undefined ? undefined : runtime.index.versionText(id, earlier.capture);\n    if (version !== undefined) from = { version, at: null };\n  } else from = chosen(runtime, id, options.from);\n  const notes: string[] = [];\n  if (from === undefined) {\n    from = to;\n    notes.push(`the document ${id} has no earlier version of the same kind to compare`);\n  }\n  const docHeld = isHeldBack(doc);\n  const fromHeld = docHeld || isHeldBack(from.version);\n  const toHeld = docHeld || isHeldBack(to.version);\n  const held = fromHeld || toHeld;\n  const fields = (version: VersionText): Record<string, unknown> =>\n    held\n      ? { kind: version.kind, url: version.url, meta: heldBackMeta(version.meta) }\n      : { title: version.title, kind: version.kind, url: version.url, meta: version.meta };\n  const diff = diffTexts(\n    { text: held ? \"\" : from.version.text, fields: fields(from.version) },\n    { text: held ? \"\" : to.version.text, fields: fields(to.version) },\n    options.limits ?? {},\n  );\n  if (held) notes.unshift(HELD_BACK);\n  notes.push(...diff.notes);\n  return {\n    doc: doc.doc,\n    url: to.version.url ?? doc.url,\n    from: sideOf(from.version, from.at, fromHeld),\n    to: sideOf(to.version, to.at, toHeld),\n    same: held ? null : diff.same,\n    summary: diff.summary,\n    hunks: diff.hunks,\n    meta: diff.meta,\n    held_back: held,\n    exact: diff.exact,\n    truncated: diff.truncated,\n    steps: diff.steps,\n    note: notes.length > 0 ? notes.join(\"; \") : null,\n  };\n};\n\n/** This function gives the text of the word diff of a changed line: `[-removed-]` and `{+added+}` mark the words. */\nconst wordsText = (line: Extract<DiffLine, { op: \"changed\" }>): string =>\n  line.words === null\n    ? `[-${line.before}-]{+${line.after}+}`\n    : line.words\n        .map((part) =>\n          part.op === \"same\"\n            ? part.text\n            : part.op === \"added\"\n              ? `{+${part.text}+}`\n              : `[-${part.text}-]`,\n        )\n        .join(\"\");\n\n/**\n * This function gives the text of a diff for a person or an assistant. The text has the counts, the\n * hunks as a unified diff, and the changes of the metadata. A changed line marks its words with `[-removed-]`\n * and `{+added+}`. The text holds the text of the pages, so the MCP server puts it in an envelope.\n *\n * @beta\n */\nexport const formatDiff = (diff: Pick<DiffResult, \"summary\" | \"hunks\" | \"meta\">): string => {\n  const { summary } = diff;\n  const lines: string[] = [\n    `the text: ${String(summary.lines_added)} lines added, ${String(summary.lines_removed)} removed (${String(summary.lines_changed)} changed), ${String(summary.words_added)} words added, ${String(summary.words_removed)} removed`,\n  ];\n  for (const hunk of diff.hunks) {\n    lines.push(\n      `@@ -${String(hunk.from_line)},${String(hunk.from_count)} +${String(hunk.to_line)},${String(hunk.to_count)} @@`,\n    );\n    for (const line of hunk.lines) {\n      if (line.op === \"changed\") lines.push(`~ ${wordsText(line)}`);\n      else lines.push(`${line.op === \"same\" ? \" \" : line.op === \"added\" ? \"+\" : \"-\"} ${line.text}`);\n    }\n  }\n  lines.push(`the metadata: ${String(summary.meta_changes)} changes`);\n  for (const change of diff.meta) {\n    if (change.change === \"added\") lines.push(`+ ${change.path}: ${change.after ?? \"\"}`);\n    else if (change.change === \"removed\") lines.push(`- ${change.path}: ${change.before ?? \"\"}`);\n    else lines.push(`~ ${change.path}: ${change.before ?? \"\"} -> ${change.after ?? \"\"}`);\n  }\n  return lines.join(\"\\n\");\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAmBA,MAAa,cAAc;;CAEzB,UAAU;;CAEV,UAAU;;CAEV,UAAU;;CAEV,cAAc;;CAEd,cAAc;;CAEd,SAAS;;CAET,cAAc;;CAEd,gBAAgB;;CAEhB,cAAc;;CAEd,eAAe;AACjB;;;;;;AA0GA,MAAa,cACX,GACA,GACA,WACsD;CACtD,MAAM,IAAI,EAAE;CACZ,MAAM,IAAI,EAAE;CACZ,IAAI,OAAO;CACX,OAAO,OAAO,KAAK,OAAO,KAAK,EAAE,UAAU,EAAE,OAAO,QAAQ;CAC5D,IAAI,OAAO;CACX,IAAI,OAAO;CACX,OAAO,OAAO,QAAQ,OAAO,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,IAAI;EAChE,QAAQ;EACR,QAAQ;CACV;CACA,OAAO,SAAS,QAAQ,IAAI,QAAQ;CACpC,MAAM,WAAuC,CAAC;CAC9C,MAAM,QAAQ,OAAO;CACrB,MAAM,SAAS,OAAO;CACtB,IAAI,QAAQ;CACZ,SAAS,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC;CAC3B,IAAI,UAAU,KAAK,WAAW,GAC5B,SAAS,KAAK,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC;MAChC;EACL,MAAM,MAAM,MAAsB,EAAE,OAAO;EAC3C,MAAM,MAAM,MAAsB,EAAE,OAAO;EAC3C,MAAM,MAAM,QAAQ;EACpB,MAAM,SAAS,MAAM;EACrB,MAAM,IAAI,IAAI,WAAW,IAAI,MAAM,CAAC;EAEpC,MAAM,QAAsB,CAAC;EAC7B,IAAI;EACJ,QAAQ,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,KAAK,GAAG;GACxC,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG;IAC/B,OAAO,SAAS;IAChB,IAAI,OAAO,QAAQ,OAAO,KAAK,MAAM;IACrC,IAAI,IACF,MAAM,CAAC,KAAM,MAAM,KAAK,EAAE,SAAS,IAAI,KAAM,EAAE,SAAS,IAAI,KACxD,EAAE,SAAS,IAAI,KACf,EAAE,SAAS,IAAI,KAAM;IAC3B,IAAI,IAAI,IAAI;IACZ,OAAO,IAAI,SAAS,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG;KACjD,KAAK;KACL,KAAK;KACL,OAAO,SAAS;IAClB;IACA,EAAE,SAAS,KAAK;IAChB,IAAI,KAAK,SAAS,KAAK,QAAQ;KAC7B,MAAM;MAAE;MAAG;MAAG;KAAE;KAChB,MAAM;IACR;GACF;GACA,MAAM,KAAK,EAAE,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAC;EAChD;EACA,IAAI,QAAQ,KAAA,GAAW;GAErB,QAAQ;GACR,MAAM,IAAI,MAAM,SAAS;GACzB,IAAI,IAAI;GACR,IAAI,IAAI;GACR,IAAI,KAAK,GAAG;IACV,MAAM,OAAO,MAAM;IACnB,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG;KAC/B,MAAM,KAAK,KAAK,IAAI;KACpB,MAAM,KAAK,KAAK;KAChB,IAAI,MAAM,SAAS,MAAM,KAAK,MAAM,UAAU,KAAK,KAAK,IAAI,GAAG;MAC7D,IAAI;MACJ,IAAI;KACN;IACF;GACF;GACA,SAAS,KAAK,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;GAC7C,MAAM;IAAE;IAAG;IAAG,GAAG,KAAK,IAAI,GAAG,CAAC;GAAE;EAClC;EACA,IAAI,EAAE,GAAG,MAAM;EACf,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;GACjC,MAAM,OAAO,MAAM,IAAI;GACvB,MAAM,IAAI,IAAI;GACd,MAAM,UAAU,OAAuB,KAAK,KAAK,IAAI;GACrD,MAAM,OAAO,MAAM,CAAC,KAAM,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC;GACjE,MAAM,QAAQ,OAAO,IAAI,IAAI,IAAI;GACjC,MAAM,QAAQ,OAAO,KAAK;GAC1B,MAAM,QAAQ,QAAQ;GACtB,MAAM,QAAQ,OAAO,QAAQ,QAAQ;GACrC,SAAS,KAAK,CAAC,GAAG,IAAI,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;GACpD,IAAI;GACJ,IAAI;EACN;EACA,SAAS,KAAK,CAAC,GAAG,CAAC,CAAC;CACtB;CACA,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC;CACvB,MAAM,OAAc,CAAC;CACrB,KAAK,IAAI,KAAK,SAAS,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG;EACnD,MAAM,CAAC,IAAI,SAAS,SAAS;EAC7B,IAAI,SAAS,GAAG;EAChB,MAAM,OAAO,KAAK,GAAG,EAAE;EACvB,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,IACpC,KAAK,KAAK,SAAS,KAAK;GAAE;GAAI,OAAO,KAAK,QAAQ;EAAM;OACrD,KAAK,KAAK;GAAE;GAAI;EAAM,CAAC;CAC9B;CACA,OAAO;EAAE;EAAM;CAAM;AACvB;;AAGA,MAAM,iBAA8C;CAClD,MAAM,sBAAM,IAAI,IAAoB;CACpC,QAAQ,UAAU;EAChB,IAAI,KAAK,IAAI,IAAI,KAAK;EACtB,IAAI,OAAO,KAAA,GAAW;GACpB,KAAK,IAAI;GACT,IAAI,IAAI,OAAO,EAAE;EACnB;EACA,OAAO;CACT;AACF;;AAGA,MAAM,QAAQ;AAEd,MAAM,YAAY,SAA2B,KAAK,MAAM,KAAK,KAAK,CAAC;;AAGnE,MAAM,WAAW,SAAyB;CACxC,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,SAAS,IAAI,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,GAAG,SAAS;CACvE,OAAO;AACT;;AAGA,MAAM,YACJ,QACA,OACA,QACA,WACmE;CACnE,IAAI,OAAO,SAAS,OAAO,KAAK,OAAO;CACvC,MAAM,IAAI,SAAS,MAAM;CACzB,MAAM,IAAI,SAAS,KAAK;CACxB,IAAI,EAAE,SAAS,OAAO,gBAAgB,EAAE,SAAS,OAAO,cAAc,OAAO;CAC7E,MAAM,KAAK,SAAS;CACpB,MAAM,SAAS,WACb,EAAE,KAAK,UAAU,GAAG,KAAK,CAAC,GAC1B,EAAE,KAAK,UAAU,GAAG,KAAK,CAAC,GAC1B,MACF;CACA,MAAM,QAAoB,CAAC;CAC3B,MAAM,QAAQ,IAAoB,SAAuB;EACvD,MAAM,OAAO,MAAM,GAAG,EAAE;EACxB,IAAI,SAAS,KAAA,KAAa,KAAK,OAAO,IACpC,MAAM,MAAM,SAAS,KAAK;GAAE;GAAI,MAAM,KAAK,OAAO;EAAK;OACpD,MAAM,KAAK;GAAE;GAAI;EAAK,CAAC;CAC9B;CACA,IAAI,IAAI;CACR,IAAI,IAAI;CACR,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;EAChB,KAAK,QAAQ,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAC/C,KAAK,IAAI;EACT,KAAK,IAAI;CACX,OAAO,IAAI,IAAI,OAAO,GAAG;EACvB,KAAK,WAAW,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAClD,KAAK,IAAI;CACX,OAAO;EACL,KAAK,SAAS,EAAE,MAAM,GAAG,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;EAChD,KAAK,IAAI;CACX;CAEF,OAAO;EAAE;EAAO,OAAO,OAAO;CAAM;AACtC;AAcA,MAAM,aAAa;AAEnB,MAAM,WAAW,MAAc,QAC7B,WAAW,KAAK,GAAG,IAAK,SAAS,KAAK,MAAM,GAAG,KAAK,GAAG,QAAS,GAAG,KAAK,GAAG,KAAK,UAAU,GAAG,EAAE;AAEjG,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;;AAGrE,MAAM,eACJ,QACA,OACA,WAC+D;CAC/D,MAAM,UAAwB,CAAC;CAC/B,IAAI,QAAQ;CACZ,MAAM,QAAQ,UAA2B;EACvC,MAAM,OAAO,gBAAgB,KAAK;EAClC,OAAO,KAAK,SAAS,OAAO,gBAAgB,GAAG,KAAK,MAAM,GAAG,OAAO,aAAa,EAAE,KAAK;CAC1F;CACA,MAAM,QAAQ,MAAc,QAA8B,GAAY,MAAqB;EACzF,SAAS;EACT,IAAI,QAAQ,SAAS,OAAO,gBAC1B,QAAQ,KAAK;GACX;GACA;GACA,QAAQ,WAAW,UAAU,OAAO,KAAK,CAAC;GAC1C,OAAO,WAAW,YAAY,OAAO,KAAK,CAAC;EAC7C,CAAC;CAEL;CAEA,MAAM,QAAQ,GAAY,GAAY,MAAc,UAAwB;EAC1E,IAAI,MAAM,GAAG;EACb,IAAI,SAAS,OAAO,cAAc;GAChC,IAAI,gBAAgB,CAAC,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,WAAW,GAAG,CAAC;GACzE;EACF;EACA,IAAI,SAAS,CAAC,KAAK,SAAS,CAAC,GAAG;GAC9B,MAAM,OAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;GACvE,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA;IAChD,MAAM,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK,EAAE,SAAS,KAAA;IAChD,MAAM,KAAK,QAAQ,MAAM,GAAG;IAC5B,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,WAAW,EAAE,MAAM,KAAA,CAAS;SACjD,IAAI,CAAC,OAAO,KAAK,KAAK,IAAI,SAAS,KAAA,GAAW,EAAE,IAAI;SACpD,IAAI,OAAO,KAAK,KAAK,EAAE,MAAM,EAAE,MAAM,IAAI,QAAQ,CAAC;GACzD;GACA;EACF;EACA,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;GACxC,MAAM,KAAK,SAAS;GACpB,MAAM,SAAS,WACb,EAAE,KAAK,SAAS,GAAG,gBAAgB,IAAI,CAAC,CAAC,GACzC,EAAE,KAAK,SAAS,GAAG,gBAAgB,IAAI,CAAC,CAAC,GACzC;IAAE,OAAO;IAAG,KAAK;GAAQ,CAC3B;GACA,IAAI,IAAI;GACR,IAAI,IAAI;GACR,MAAM,UAAoB,CAAC;GAC3B,MAAM,QAAkB,CAAC;GACzB,MAAM,cAAoB;IACxB,MAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM;IACnD,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GACjC,KAAK,EAAE,QAAQ,MAAO,EAAE,MAAM,MAAO,GAAG,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE,IAAI,QAAQ,CAAC;IAEjF,KAAK,MAAM,MAAM,QAAQ,MAAM,KAAK,GAClC,KAAK,GAAG,KAAK,GAAG,OAAO,EAAE,EAAE,IAAI,WAAW,EAAE,KAAK,KAAA,CAAS;IAC5D,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK,GAChC,KAAK,GAAG,KAAK,GAAG,OAAO,EAAE,EAAE,IAAI,SAAS,KAAA,GAAW,EAAE,GAAG;IAC1D,QAAQ,SAAS;IACjB,MAAM,SAAS;GACjB;GACA,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;IAChB,MAAM;IACN,KAAK,IAAI;IACT,KAAK,IAAI;GACX,OAAO,IAAI,IAAI,OAAO,GAAG;IACvB,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK,IAAI,EAAE;IAC7D,KAAK,IAAI;GACX,OAAO;IACL,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,MAAM,KAAK,IAAI,EAAE;IAC3D,KAAK,IAAI;GACX;GAEF,MAAM;GACN;EACF;EACA,IAAI,gBAAgB,CAAC,MAAM,gBAAgB,CAAC,GAAG,KAAK,MAAM,WAAW,GAAG,CAAC;CAC3E;CACA,KAAK,QAAQ,OAAO,IAAI,CAAC;CACzB,OAAO;EAAE;EAAS;CAAM;AAC1B;;AAGA,MAAM,YAAY,UAA2C;CAC3D,MAAM,SAAiC,EAAE,GAAG,YAAY;CACxD,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,KAAK,GAAG;EACjD,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GACtC,MAAM,IAAI,WAAW,kBAAkB,KAAK,iCAAiC;EAC/E,OAAO,QAAQ;CACjB;CACA,OAAO;AACT;;;;;;AAOA,MAAa,aACX,QACA,OACA,QAA6B,CAAC,MACjB;CACb,MAAM,SAAS,SAAS,KAAK;CAC7B,MAAM,QAAkB,CAAC;CACzB,IAAI,YAAY;CAChB,MAAM,OAAO,MAAc,SAA2B;EACpD,IAAI,OAAO;EACX,IAAI,KAAK,SAAS,OAAO,UAAU;GACjC,OAAO,KAAK,MAAM,GAAG,OAAO,QAAQ;GACpC,YAAY;GACZ,MAAM,KACJ,OAAO,KAAK,uBAAuB,OAAO,OAAO,QAAQ,EAAE,iDAC7D;EACF;EACA,MAAM,QAAQ,KAAK,WAAW,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI;EACtD,IAAI,MAAM,SAAS,OAAO,UAAU;GAClC,YAAY;GACZ,MAAM,KACJ,OAAO,KAAK,sBAAsB,OAAO,OAAO,QAAQ,EAAE,6CAC5D;GACA,OAAO,MAAM,MAAM,GAAG,OAAO,QAAQ;EACvC;EACA,OAAO;CACT;CACA,MAAM,IAAI,IAAI,OAAO,MAAM,KAAK;CAChC,MAAM,IAAI,IAAI,MAAM,MAAM,KAAK;CAC/B,MAAM,KAAK,SAAS;CACpB,MAAM,aAAqB;EAAE,OAAO;EAAG,KAAK,OAAO;CAAS;CAC5D,MAAM,SAAS,WACb,EAAE,KAAK,SAAS,GAAG,IAAI,CAAC,GACxB,EAAE,KAAK,SAAS,GAAG,IAAI,CAAC,GACxB,UACF;CACA,IAAI,QAAQ,OAAO;CACnB,IAAI,CAAC,OAAO,OACV,MAAM,KACJ,iDAAiD,OAAO,OAAO,QAAQ,EAAE,wEAC3E;CAEF,MAAM,aAAqB;EAAE,OAAO;EAAG,KAAK,OAAO;CAAa;CAChE,MAAM,UAAmB,CAAC;CAC1B,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,eAAe;CACnB,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,WAAW;CACf,IAAI,IAAI;CACR,IAAI,IAAI;CACR,MAAM,UAAoB,CAAC;CAC3B,MAAM,QAAkB,CAAC;CACzB,MAAM,cAAoB;EACxB,MAAM,QAAQ,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM;EACnD,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM,GAAG;GACpC,MAAM,OAAO,QAAQ;GACrB,MAAM,KAAK,MAAM;GACjB,MAAM,QAAQ,SAAS,EAAE,OAAQ,EAAE,KAAM,YAAY,MAAM;GAC3D,IAAI,UAAU,MAAM;IAClB,WAAW;IACX,gBAAgB,QAAQ,EAAE,KAAM;IAChC,cAAc,QAAQ,EAAE,GAAI;GAC9B,OAAO;IACL,IAAI,CAAC,MAAM,OAAO,QAAQ;IAC1B,KAAK,MAAM,QAAQ,MAAM,OACvB,IAAI,KAAK,OAAO,SAAS,cAAc,QAAQ,KAAK,IAAI;SACnD,IAAI,KAAK,OAAO,WAAW,gBAAgB,QAAQ,KAAK,IAAI;GAErE;GACA,QAAQ,KAAK;IAAE,IAAI;IAAW,GAAG;IAAM,GAAG;IAAI,OAAO,OAAO,SAAS;GAAK,CAAC;EAC7E;EACA,KAAK,MAAM,QAAQ,QAAQ,MAAM,KAAK,GAAG;GACvC,gBAAgB,QAAQ,EAAE,KAAM;GAChC,QAAQ,KAAK;IAAE,IAAI;IAAW,GAAG;GAAK,CAAC;EACzC;EACA,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK,GAAG;GACnC,cAAc,QAAQ,EAAE,GAAI;GAC5B,QAAQ,KAAK;IAAE,IAAI;IAAS,GAAG;GAAG,CAAC;EACrC;EACA,gBAAgB;EAChB,QAAQ,SAAS;EACjB,MAAM,SAAS;CACjB;CACA,KAAK,MAAM,OAAO,OAAO,MACvB,IAAI,IAAI,OAAO,GAAG;EAChB,MAAM;EACN,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK;GAAE,IAAI;GAAQ,GAAG,IAAI;GAAI,GAAG,IAAI;EAAG,CAAC;EAC3F,KAAK,IAAI;EACT,KAAK,IAAI;CACX,OAAO,IAAI,IAAI,OAAO,GAAG;EACvB,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,QAAQ,KAAK,IAAI,EAAE;EAC7D,gBAAgB,IAAI;EACpB,KAAK,IAAI;CACX,OAAO;EACL,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,OAAO,MAAM,GAAG,MAAM,KAAK,IAAI,EAAE;EAC3D,cAAc,IAAI;EAClB,KAAK,IAAI;CACX;CAEF,MAAM;CACN,IAAI,UAAU;EACZ,QAAQ;EACR,MAAM,KAAK,mFAAmF;CAChG;CAGA,MAAM,QAAoB,CAAC;CAC3B,IAAI,QAAQ;CACZ,IAAI;CAEJ,MAAM,UAAU,UAA2B;EACzC,QAAQ,MAAM,IAAd;GACE,KAAK,QACH,OAAO;IAAE,IAAI;IAAQ,MAAM,EAAE,MAAM;GAAI;GACzC,KAAK,WACH,OAAO;IAAE,IAAI;IAAW,MAAM,EAAE,MAAM;GAAI;GAC5C,KAAK,SACH,OAAO;IAAE,IAAI;IAAS,MAAM,EAAE,MAAM;GAAI;GAC1C,SACE,OAAO;IAAE,IAAI;IAAW,QAAQ,EAAE,MAAM;IAAK,OAAO,EAAE,MAAM;IAAK,OAAO,MAAM;GAAM;EACxF;CACF;CACA,MAAM,cAAoB;EACxB,IAAI,YAAY,KAAA,GAAW;EAC3B,MAAM,KAAK;GACT,WAAW,QAAQ,OAAO;GAC1B,YAAY,QAAQ;GACpB,SAAS,QAAQ,KAAK;GACtB,UAAU,QAAQ;GAClB,OAAO,QAAQ;EACjB,CAAC;EACD,UAAU,KAAA;CACZ;CAEA,IAAI,OAAO;CACX,IAAI,OAAO;CACX,MAAM,YAA8C,CAAC;CACrD,KAAK,MAAM,SAAS,SAAS;EAC3B,UAAU,KAAK,CAAC,MAAM,IAAI,CAAC;EAC3B,IAAI,MAAM,OAAO,SAAS,QAAQ;EAClC,IAAI,MAAM,OAAO,WAAW,QAAQ;CACtC;CACA,MAAM,WAAqB,CAAC;CAC5B,KAAK,MAAM,CAAC,IAAI,UAAU,QAAQ,QAAQ,GAAG,IAAI,MAAM,OAAO,QAAQ,SAAS,KAAK,EAAE;CACtF,IAAI,UAAU;CACd,KAAK,MAAM,MAAM,UAAU;EACzB,IAAI,SAAS,OAAO,cAAc;GAChC,UAAU;GACV;EACF;EACA,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,OAAO,OAAO;EAC7C,MAAM,OAAO,KAAK,IAAI,QAAQ,SAAS,GAAG,KAAK,OAAO,OAAO;EAC7D,IAAI,YAAY,KAAA,KAAa,QAAQ,QAAQ,MAAM,GAAG,MAAM;EAC5D,IAAI,YAAY,KAAA,GAAW;GACzB,MAAM,CAAC,OAAO,SAAS,UAAU;GACjC,UAAU;IAAE,OAAO,CAAC;IAAG,MAAM;IAAO,IAAI;IAAO,GAAG;IAAG,GAAG;IAAG,KAAK,QAAQ;GAAE;EAC5E;EACA,KAAK,IAAI,OAAO,QAAQ,MAAM,GAAG,QAAQ,MAAM,QAAQ,GAAG;GACxD,IAAI,SAAS,OAAO,cAAc;IAChC,UAAU;IACV;GACF;GACA,MAAM,QAAQ,QAAQ;GACtB,QAAQ,MAAM,KAAK,OAAO,KAAK,CAAC;GAChC,IAAI,MAAM,OAAO,SAAS,QAAQ,KAAK;GACvC,IAAI,MAAM,OAAO,WAAW,QAAQ,KAAK;GACzC,QAAQ,MAAM;GACd,SAAS;EACX;CACF;CACA,MAAM;CACN,IAAI,SAAS;EACX,YAAY;EACZ,MAAM,KACJ,kBAAkB,OAAO,OAAO,YAAY,EAAE,yCAChD;CACF;CAEA,MAAM,SAAS,YAAY,OAAO,QAAQ,MAAM,QAAQ,MAAM;CAC9D,IAAI,OAAO,QAAQ,OAAO,QAAQ,QAAQ;EACxC,YAAY;EACZ,MAAM,KACJ,oBAAoB,OAAO,OAAO,QAAQ,MAAM,EAAE,MAAM,OAAO,OAAO,KAAK,EAAE,yBAC/E;CACF;CACA,OAAO;EACL,SAAS;GACP,aAAa;GACb,eAAe;GACf,eAAe;GACf,aAAa;GACb,eAAe;GACf,cAAc,OAAO;EACvB;EACA;EACA,MAAM,OAAO;EACb,MACE,eAAe,KAAK,iBAAiB,KAAK,OAAO,UAAU,KAAK,OAAO,SAAS,MAAM;EACxF;EACA;EACA,OAAO,WAAW,QAAQ,WAAW;EACrC;CACF;AACF;;AA6DA,MAAM,UACJ,SACA,IACA,WACkE;CAClE,IAAI,OAAO,WAAW,UAAU;EAC9B,MAAM,UAAU,QAAQ,MAAM,YAAY,IAAI,MAAM;EACpD,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,MAAM,gBAAgB,GAAG,mCAAmC,QAAQ;EAChF,OAAO;GAAE;GAAS,IAAI;EAAK;CAC7B;CACA,IAAI,CAAC,SAAS,MAAM,KAAK,OAAO,OAAO,KAAA,GACrC,MAAM,IAAI,WAAW,0DAA0D;CACjF,MAAM,KAAK,QAAQ,MAAM,OAAO,EAAE;CAClC,MAAM,QAAQ,cAAc,SAAS,IAAI,EAAE;CAC3C,IAAI,MAAM,YAAY,KAAA,GACpB,MAAM,IAAI,MACR,gBAAgB,GAAG,qBAAqB,GAAG,YAAY,MAAM,UAAU,KAAA,IAAY,KAAK,+BAA+B,MAAM,SAC/H;CAEF,OAAO;EAAE,SAAS,MAAM;EAAS;CAAG;AACtC;AAEA,MAAM,UAAU,SAAsB,IAAmB,UAA6B;CACpF,SAAS,QAAQ;CACjB,YAAY,QAAQ;CACpB,OAAO,QAAQ;CACf,UAAU,QAAQ;CAClB,WAAW;CACX;AACF;;;;;;;;AASA,MAAa,eAAe,OAC1B,SACA,IACA,UAAuB,CAAC,MACA;CACxB,MAAM,QAAQ,QAAQ;CACtB,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE;CAChC,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MAAM,sBAAsB,GAAG,0CAA0C;CACrF,IAAI;CACJ,IAAI,QAAQ,OAAO,KAAA,GAAW;EAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;EACxD,MAAM,UACJ,WAAW,KAAA,IAAY,KAAA,IAAY,QAAQ,MAAM,YAAY,IAAI,OAAO,OAAO;EACjF,IAAI,YAAY,KAAA,GAAW,MAAM,IAAI,MAAM,gBAAgB,GAAG,gBAAgB;EAC9E,KAAK;GAAE;GAAS,IAAI;EAAK;CAC3B,OAAO,KAAK,OAAO,SAAS,IAAI,QAAQ,EAAE;CAC1C,IAAI;CACJ,IAAI,QAAQ,SAAS,KAAA,GAAW;EAE9B,MAAM,UAAU,QAAQ,MACrB,SAAS,IAAI,EAAE,OAAO,IAAK,CAAC,CAAC,CAC7B,MACE,YACC,QAAQ,YAAY,GAAG,QAAQ,WAC/B,QAAQ,WAAW,GAAG,QAAQ,UAC9B,QAAQ,aAAa,GAAG,QAAQ,YAChC,QAAQ,cAAc,GAAG,QAAQ,UACrC;EACF,MAAM,UACJ,YAAY,KAAA,IAAY,KAAA,IAAY,QAAQ,MAAM,YAAY,IAAI,QAAQ,OAAO;EACnF,IAAI,YAAY,KAAA,GAAW,OAAO;GAAE;GAAS,IAAI;EAAK;CACxD,OAAO,OAAO,OAAO,SAAS,IAAI,QAAQ,IAAI;CAC9C,MAAM,QAAkB,CAAC;CACzB,IAAI,SAAS,KAAA,GAAW;EACtB,OAAO;EACP,MAAM,KAAK,gBAAgB,GAAG,oDAAoD;CACpF;CACA,MAAM,UAAU,WAAW,GAAG;CAC9B,MAAM,WAAW,WAAW,WAAW,KAAK,OAAO;CACnD,MAAM,SAAS,WAAW,WAAW,GAAG,OAAO;CAC/C,MAAM,OAAO,YAAY;CACzB,MAAM,UAAU,YACd,OACI;EAAE,MAAM,QAAQ;EAAM,KAAK,QAAQ;EAAK,MAAM,aAAa,QAAQ,IAAI;CAAE,IACzE;EAAE,OAAO,QAAQ;EAAO,MAAM,QAAQ;EAAM,KAAK,QAAQ;EAAK,MAAM,QAAQ;CAAK;CACvF,MAAM,OAAO,UACX;EAAE,MAAM,OAAO,KAAK,KAAK,QAAQ;EAAM,QAAQ,OAAO,KAAK,OAAO;CAAE,GACpE;EAAE,MAAM,OAAO,KAAK,GAAG,QAAQ;EAAM,QAAQ,OAAO,GAAG,OAAO;CAAE,GAChE,QAAQ,UAAU,CAAC,CACrB;CACA,IAAI,MAAM,MAAM,QAAQ,SAAS;CACjC,MAAM,KAAK,GAAG,KAAK,KAAK;CACxB,OAAO;EACL,KAAK,IAAI;EACT,KAAK,GAAG,QAAQ,OAAO,IAAI;EAC3B,MAAM,OAAO,KAAK,SAAS,KAAK,IAAI,QAAQ;EAC5C,IAAI,OAAO,GAAG,SAAS,GAAG,IAAI,MAAM;EACpC,MAAM,OAAO,OAAO,KAAK;EACzB,SAAS,KAAK;EACd,OAAO,KAAK;EACZ,MAAM,KAAK;EACX,WAAW;EACX,OAAO,KAAK;EACZ,WAAW,KAAK;EAChB,OAAO,KAAK;EACZ,MAAM,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;CAC9C;AACF;;AAGA,MAAM,aAAa,SACjB,KAAK,UAAU,OACX,KAAK,KAAK,OAAO,MAAM,KAAK,MAAM,MAClC,KAAK,MACF,KAAK,SACJ,KAAK,OAAO,SACR,KAAK,OACL,KAAK,OAAO,UACV,KAAK,KAAK,KAAK,MACf,KAAK,KAAK,KAAK,GACvB,CAAC,CACA,KAAK,EAAE;;;;;;;;AAShB,MAAa,cAAc,SAAiE;CAC1F,MAAM,EAAE,YAAY;CACpB,MAAM,QAAkB,CACtB,aAAa,OAAO,QAAQ,WAAW,EAAE,gBAAgB,OAAO,QAAQ,aAAa,EAAE,YAAY,OAAO,QAAQ,aAAa,EAAE,aAAa,OAAO,QAAQ,WAAW,EAAE,gBAAgB,OAAO,QAAQ,aAAa,EAAE,SAC1N;CACA,KAAK,MAAM,QAAQ,KAAK,OAAO;EAC7B,MAAM,KACJ,OAAO,OAAO,KAAK,SAAS,EAAE,GAAG,OAAO,KAAK,UAAU,EAAE,IAAI,OAAO,KAAK,OAAO,EAAE,GAAG,OAAO,KAAK,QAAQ,EAAE,IAC7G;EACA,KAAK,MAAM,QAAQ,KAAK,OACtB,IAAI,KAAK,OAAO,WAAW,MAAM,KAAK,KAAK,UAAU,IAAI,GAAG;OACvD,MAAM,KAAK,GAAG,KAAK,OAAO,SAAS,MAAM,KAAK,OAAO,UAAU,MAAM,IAAI,GAAG,KAAK,MAAM;CAEhG;CACA,MAAM,KAAK,iBAAiB,OAAO,QAAQ,YAAY,EAAE,SAAS;CAClE,KAAK,MAAM,UAAU,KAAK,MACxB,IAAI,OAAO,WAAW,SAAS,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,SAAS,IAAI;MAC9E,IAAI,OAAO,WAAW,WAAW,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,UAAU,IAAI;MACtF,MAAM,KAAK,KAAK,OAAO,KAAK,IAAI,OAAO,UAAU,GAAG,MAAM,OAAO,SAAS,IAAI;CAErF,OAAO,MAAM,KAAK,IAAI;AACxB"}

package/build/{extract-DmNeGMHX.mjs → extract-BgcEkiQr.mjs}

@@ -1,7 +1,7 @@
 import { t as __exportAll } from "./rolldown-runtime-8H4AJuhK.mjs";
-import { C as fold, c as isHeldBack, d as recordOverride, l as isoTime, m as versionAtTime, n as HELD_BACK, v as archivedNote, w as foldText, y as archivedOf } from "./runtime-CmAOsSPn.mjs";
+import { C as fold, c as isHeldBack, d as recordOverride, l as isoTime, m as versionAtTime, n as HELD_BACK, v as archivedNote, w as foldText, y as archivedOf } from "./runtime-j2NpXEiN.mjs";
 import { n as canonicalUrl } from "./urls-BHFeSyEK.mjs";
-import { r as typesOf } from "./html-DkQUAE_d.mjs";
+import { r as typesOf } from "./html-DzobO0fy.mjs";
 //#region src/extract.ts
 var extract_exports = /* @__PURE__ */ __exportAll({
 	FIELD_KINDS: () => FIELD_KINDS,
@@ -1798,4 +1798,4 @@ const extractDocument = async (runtime, id, fields, options = {}) => {
 //#endregion
 export { extract_exports as i, checkFields as n, extractDocument as r, FIELD_KINDS as t };
 
-//# sourceMappingURL=extract-DmNeGMHX.mjs.map
+//# sourceMappingURL=extract-BgcEkiQr.mjs.map