@web-ppt/collab 0.5.0-beta.2 → 0.5.0

package/dist/binding-DoPW07so.js

@@ -0,0 +1,1060 @@
+import { MAX_COLLABORATION_VERSION as z, MAX_PATCHES_PER_TRANSACTION as xe, assertEditIdentityWatermark as Re, sectionOfSlide as je, isExtensionMigrationPatch as ge, tableGridIdentities as Le, EXTENSION_ADDRESSES as ke, canonicalExtensionPath as Pe, isExtensionAddressPatch as B, stageExternalPatches as N, extensionMigrationPatches as Ae, canonicalExtensionPatch as qe, configureCollaborationIdentity as Ne } from "@web-ppt/edit-core";
+function D(e, t) {
+  return e.clock !== t.clock ? e.clock < t.clock ? -1 : 1 : e.replicaId === t.replicaId ? 0 : e.replicaId < t.replicaId ? -1 : 1;
+}
+const te = (e) => typeof e == "number" && Number.isSafeInteger(e) && e > 0, re = (e) => typeof e == "string" && e.length >= 1 && e.length <= 128 && !/[\0-\x1f\x7f]/.test(e);
+function ve(e) {
+  const t = e, r = t == null ? void 0 : t.stamp;
+  if (!t || typeof t != "object" || t.version !== 1 || !re(t.documentId) || !re(t.replicaId) || !te(t.sequence) || t.sequence > z || !r || !te(r.clock) || r.clock > z || r.replicaId !== t.replicaId || !Array.isArray(t.patches) || !t.patches.length || t.patches.length > xe || t.patches.some((n) => !n || typeof n != "object" || !Array.isArray(n.path) || !n.path.length || typeof n.op != "string" || typeof n.origin != "string") || typeof t.label != "string" || !Number.isFinite(t.time))
+    throw new Error("协同消息结构无效");
+  try {
+    Re(t.identity);
+  } catch {
+    throw new Error("协同消息的身份水位或身份分配命名空间无效");
+  }
+  const s = t.identity.allocation;
+  if (!s || s.replicaId !== t.replicaId || s.clock !== r.clock || s.sequence !== t.sequence)
+    throw new Error("协同消息的身份版本与消息头不一致");
+}
+const X = (e) => JSON.stringify(e.path), $e = (e) => `${e.replicaId}\0${e.sequence}`, ye = 4096, we = 1e4;
+function _e(e = []) {
+  return new Map(e.map((t) => [t.replicaId, {
+    contiguous: t.contiguous,
+    sparse: new Set(t.sparse)
+  }]));
+}
+function ze(e) {
+  return new Map([...e].map(([t, r]) => [t, {
+    contiguous: r.contiguous,
+    sparse: new Set(r.sparse)
+  }]));
+}
+function De(e) {
+  return [...e].map(([t, r]) => ({
+    replicaId: t,
+    contiguous: r.contiguous,
+    sparse: [...r.sparse].sort((s, n) => s - n)
+  }));
+}
+function Te(e, t) {
+  const r = e.get(t.replicaId);
+  return !!r && (t.sequence <= r.contiguous || r.sparse.has(t.sequence));
+}
+function ne(e, t) {
+  var r;
+  return t.sequence > (((r = e.get(t.replicaId)) == null ? void 0 : r.contiguous) ?? 0) + 1;
+}
+function se(e, t) {
+  let r = e.get(t.replicaId);
+  if (!r) {
+    if (e.size >= ye) throw new Error("协同消息副本数超过安全上限");
+    r = { contiguous: 0, sparse: /* @__PURE__ */ new Set() }, e.set(t.replicaId, r);
+  }
+  if (t.sequence <= r.contiguous || r.sparse.has(t.sequence)) return;
+  if (t.sequence === r.contiguous + 1) {
+    for (r.contiguous++; r.sparse.delete(r.contiguous + 1); ) r.contiguous++;
+    return;
+  }
+  if ([...e.values()].reduce((n, c) => n + c.sparse.size, 0) >= we) throw new Error("协同消息乱序缺口超过安全上限");
+  r.sparse.add(t.sequence);
+}
+const K = (e) => typeof e == "number" && Number.isSafeInteger(e) && e >= 0 && e <= z, oe = (e) => Array.isArray(e) && e.every((t) => typeof t == "string" && !!t) && new Set(e).size === e.length;
+function Q(e, t) {
+  const r = e;
+  if (!r || typeof r != "object" || !Number.isSafeInteger(r.clock) || r.clock <= 0 || r.clock > z || typeof r.replicaId != "string" || !r.replicaId)
+    throw new Error(`${t} 的 LWW 时间戳无效`);
+}
+function _(e, t, r) {
+  if (!Array.isArray(e) || e.length > 1e5) throw new Error(`${t} 无效`);
+  const s = /* @__PURE__ */ new Set();
+  e.forEach((n, c) => {
+    if (!Array.isArray(n) || n.length !== 2 || typeof n[0] != "string" || !n[0] || s.has(n[0])) throw new Error(`${t} 的键无效`);
+    s.add(n[0]), r(n[1], `${t}[${c}]`);
+  });
+}
+function Je(e, t) {
+  const r = e;
+  if (!r || typeof r != "object" || r.kind !== "field" && r.kind !== "hierarchy")
+    throw new Error(`${t} 的 register 无效`);
+  Q(r.stamp, t);
+}
+function ce(e, t) {
+  const r = e;
+  if (!r || typeof r != "object" || r.state !== "present" && r.state !== "removed")
+    throw new Error(`${t} 的生命周期无效`);
+  Q(r.stamp, t);
+}
+function ie(e, t) {
+  const r = e;
+  if (!r || typeof r != "object" || r.after !== null && (typeof r.after != "string" || !r.after) || typeof r.ordinal != "number" || !Number.isSafeInteger(r.ordinal) || r.ordinal < 0)
+    throw new Error(`${t} 的页序意图无效`);
+  Q(r.stamp, t);
+}
+function We(e) {
+  if (!Array.isArray(e) || e.length > ye)
+    throw new Error("协同 checkpoint seen 无效");
+  const t = /* @__PURE__ */ new Set();
+  let r = 0;
+  for (const s of e) {
+    const n = s;
+    if (!n || typeof n != "object" || typeof n.replicaId != "string" || !n.replicaId || n.replicaId.length > 128 || /[\0-\x1f\x7f]/.test(n.replicaId) || t.has(n.replicaId) || !K(n.contiguous) || !Array.isArray(n.sparse)) throw new Error("协同 checkpoint seen 无效");
+    t.add(n.replicaId);
+    let c = n.contiguous;
+    for (const o of n.sparse) {
+      if (!Number.isSafeInteger(o) || o <= c || o > z) throw new Error("协同 checkpoint seen 无效");
+      c = o, r++;
+    }
+  }
+  if (r > we) throw new Error("协同 checkpoint seen 无效");
+}
+function Xe(e, t, r) {
+  const s = e;
+  if (!s || typeof s != "object" || s.version !== 1 || s.documentId !== t.documentId || s.replicaId !== t.replicaId || s.replicaSlot !== t.replicaSlot || !K(s.clock) || !K(s.sequence) || s.clock !== r.clock || s.sequence !== r.sequence || !oe(s.baseSlideOrder) || s.baseSectionOrder !== void 0 && !oe(s.baseSectionOrder) || !Array.isArray(s.deferred) || s.deferred.length > 1e4)
+    throw new Error("协同 checkpoint 与恢复文档不匹配");
+  _(s.registers, "协同 checkpoint registers", Je), _(s.elementLifecycles, "协同 checkpoint elementLifecycles", ce), _(s.slideLifecycles, "协同 checkpoint slideLifecycles", ce), _(s.slideMoves, "协同 checkpoint slideMoves", ie), s.sectionMoves !== void 0 && _(s.sectionMoves, "sectionMoves", ie), We(s.seen), s.deferred.forEach((n, c) => {
+    if (!n || typeof n != "object" || !Number.isSafeInteger(n.ordinal) || n.ordinal < 0) throw new Error(`协同 checkpoint deferred[${c}] 无效`);
+    if (ve(n.message), n.message.documentId !== t.documentId || n.ordinal >= n.message.patches.length || JSON.stringify(n.patch) !== JSON.stringify(n.message.patches[n.ordinal]))
+      throw new Error(`协同 checkpoint deferred[${c}] 与消息不匹配`);
+  });
+}
+const le = (e) => e === "__proto__" || e === "prototype" || e === "constructor";
+function Fe(e) {
+  const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), s = e.map((c) => structuredClone(c));
+  if (e.forEach((c, o) => {
+    let i = null;
+    (c.op === "insert" && c.path.length === 2 && c.path[0] === "elements" || c.op === "set" && c.path.length === 3 && c.path[0] === "elements" && c.path[2] === "hierarchy") && (i = s[o].value.records);
+    for (const [l, u] of Object.entries(i ?? {}))
+      u && t.set(l, { index: o, record: u });
+    if (c.op === "insert" && c.path.length === 2 && c.path[0] === "slides") {
+      const l = s[o];
+      r.set(l.path[1], { index: o, record: l.value.slide });
+      for (const [u, y] of Object.entries(l.value.records))
+        t.set(u, { index: o, record: y });
+    }
+  }), !t.size && !r.size) return [...e];
+  const n = /* @__PURE__ */ new Set();
+  for (let c = 0; c < e.length; c++) {
+    const o = e[c];
+    if (o.path.length >= 3 && o.path[0] === "slides" && (o.op === "set" || o.op === "del")) {
+      const u = r.get(o.path[1]);
+      if (!u || u.index >= c) continue;
+      const y = o.path.slice(2);
+      if (y.some((b) => typeof b != "string" || le(b))) continue;
+      let f = u.record, d = !0;
+      for (const b of y.slice(0, -1)) {
+        const p = f[b];
+        if (!p || typeof p != "object" || Array.isArray(p)) {
+          d = !1;
+          break;
+        }
+        f = p;
+      }
+      if (!d) continue;
+      const w = y[y.length - 1];
+      o.op === "set" ? f[w] = structuredClone(o.value) : delete f[w], n.add(c);
+      continue;
+    }
+    if (o.path.length !== 4 || o.path[0] !== "elements" || o.path[2] !== "ovr" || o.op !== "set" && o.op !== "del" || le(o.path[3])) continue;
+    const i = t.get(o.path[1]);
+    if (!i || i.index >= c) continue;
+    const l = i.record.ovr;
+    o.op === "set" ? l[o.path[3]] = structuredClone(o.value) : delete l[o.path[3]], n.add(c);
+  }
+  return s.filter((c, o) => !n.has(o));
+}
+const He = ["x", "y", "w", "h", "rot", "flipH", "flipV"], Be = (e) => e.op === "set" && e.path.length === 3 && e.path[0] === "elements" && e.path[2] === "hierarchy" ? e.value.records : null;
+function Ge(e, t, r) {
+  const s = t.path[1];
+  if (r.has(t.value.parent) || r.has(s) && t.value.records[s] !== null) return null;
+  const n = Object.keys(t.value.records).filter((l) => l !== s && r.has(l) && t.value.records[l] !== null);
+  if (!n.length) return t;
+  const c = structuredClone(t), o = c.value, i = new Set(n);
+  for (const l of n) {
+    const u = o.records[l], y = e.removedElements[l];
+    o.removed[l] = y ? structuredClone(y) : {
+      id: l,
+      parent: u.parent,
+      meta: structuredClone(u.meta),
+      ...u.meta.origin ? { sourceSpids: [u.meta.origin.spid] } : {}
+    }, delete o.records[l], delete o.children[l];
+  }
+  o.affected = o.affected.filter((l) => !i.has(l));
+  for (const [l, u] of Object.entries(o.children))
+    o.children[l] = u.filter((y) => !i.has(y));
+  for (const l of Object.values(o.records))
+    l != null && l.children && (l.children = l.children.filter((u) => !i.has(u)));
+  return c;
+}
+function Ke(e, t) {
+  if (!t.size) return e;
+  const r = e.path[1];
+  if (e.value.records[r] === null) return e;
+  if (t.has(r)) return null;
+  const n = structuredClone(e), c = n.value, o = (c.children[r] ?? []).filter((l) => !t.has(l));
+  if (!o.length) return null;
+  for (const l of t)
+    l !== r && (delete c.records[l], delete c.children[l]);
+  c.children[r] = o;
+  const i = /* @__PURE__ */ new Set([r, ...o]);
+  return c.affected = c.affected.filter((l) => i.has(l)), n;
+}
+function V(e, t) {
+  var r, s;
+  return ((r = e.slides[t]) == null ? void 0 : r.children) ?? ((s = e.elements[t]) == null ? void 0 : s.children) ?? [];
+}
+function de(e) {
+  return e.order ?? e.z;
+}
+function ae(e, t, r) {
+  return [...new Set(e)].filter((s) => t[s] !== null && !!(t[s] ?? r.elements[s])).sort((s, n) => {
+    const c = t[s] ?? r.elements[s], o = t[n] ?? r.elements[n], i = de(c), l = de(o);
+    return (i < l ? -1 : i === l ? 0 : 1) || (s < n ? -1 : s === n ? 0 : 1);
+  });
+}
+function Ve(e, t, r, s) {
+  const n = structuredClone(e);
+  if (n.parent = t.parent, n.z = t.z, r(t.id, "order") && (t.order === void 0 ? delete n.order : n.order = t.order), t.meta.sourceParent === void 0 ? delete n.meta.sourceParent : n.meta.sourceParent = t.meta.sourceParent, s) for (const c of He)
+    r(t.id, c) && (Object.prototype.hasOwnProperty.call(t.ovr, c) ? n.ovr[c] = t.ovr[c] : delete n.ovr[c]);
+  return n;
+}
+function Ue(e, t, r) {
+  const s = e.elements[t];
+  if (!s) throw new Error(`协同层级闭包找不到元素：${t}`);
+  const n = /* @__PURE__ */ Object.create(null), c = (o) => {
+    if (!r.has(o)) return;
+    const i = e.elements[o];
+    if (!i) throw new Error(`协同层级闭包找不到后代：${o}`);
+    n[o] = {
+      ...structuredClone(i),
+      ...i.children ? { children: i.children.filter((l) => r.has(l)) } : {}
+    };
+    for (const l of i.children ?? []) c(l);
+  };
+  return c(t), { root: t, parent: s.parent, records: n };
+}
+function fe(e, t) {
+  const r = /* @__PURE__ */ new Set(), s = (n) => {
+    if (r.has(n)) return;
+    const c = e.elements[n];
+    if (!c) throw new Error(`协同层级闭包找不到元素：${n}`);
+    r.add(n);
+    for (const o of c.children ?? []) s(o);
+  };
+  return t.forEach(s), r;
+}
+function Qe(e, t, r) {
+  var p, E;
+  const s = structuredClone(t);
+  if (!e.slides[t.value.parent] && !e.elements[t.value.parent]) return s;
+  const n = s.value, c = t.path[1], i = n.records[c] === null, l = Object.entries(n.records).flatMap(([g, m]) => g !== c && m !== null ? [g] : []), u = new Set(l), y = /* @__PURE__ */ new Set();
+  if (i) {
+    const g = fe(e, l.filter((h) => !!e.elements[h]));
+    if (e.elements[c]) for (const h of fe(e, [c]))
+      h !== c && !g.has(h) && y.add(h);
+    const S = [...y].filter((h) => {
+      var I;
+      return !y.has(((I = e.elements[h]) == null ? void 0 : I.parent) ?? "");
+    });
+    for (const h of y)
+      n.records[h] = null, n.affected.push(h), delete n.children[h];
+    for (const h of S) {
+      const I = Ue(e, h, y), a = I.records[h];
+      if (a.meta.created) {
+        n.removed[h] = null;
+        for (const v of Object.values(I.records))
+          !v.meta.created && v.meta.sourceParent !== void 0 && (n.removed[v.id] = F(I, v));
+      } else n.removed[h] = F(I, a);
+    }
+  }
+  for (const g of l) {
+    const m = e.elements[g], S = n.records[g];
+    m && S && (n.records[g] = Ve(m, S, r, i));
+  }
+  const f = /* @__PURE__ */ new Set();
+  for (const g of l) {
+    const m = (p = e.elements[g]) == null ? void 0 : p.parent;
+    if (m && m !== n.parent && m !== c) {
+      const S = e.elements[m], h = i ? c : n.parent;
+      (S == null ? void 0 : S.src.kind) === "group" && S.meta.created && S.parent === h && f.add(m);
+    }
+  }
+  const d = /* @__PURE__ */ new Set();
+  for (const g of f) {
+    const m = e.elements[g], S = (m.children ?? []).filter((h) => !u.has(h) && !y.has(h));
+    n.affected.push(g), S.length ? (n.records[g] = { ...structuredClone(m), children: S }, n.children[g] = S) : (n.records[g] = null, n.removed[g] = null, delete n.children[g], d.add(g));
+  }
+  if (i) {
+    const g = (E = e.elements[c]) == null ? void 0 : E.parent, m = g ? e.elements[g] : void 0;
+    if ((m == null ? void 0 : m.src.kind) === "group" && g !== n.parent) {
+      const S = (m.children ?? []).filter((h) => h !== c);
+      n.affected.push(m.id), S.length || !m.meta.created ? (n.records[m.id] = { ...structuredClone(m), children: S }, n.children[m.id] = S) : (n.records[m.id] = null, n.removed[m.id] = null, delete n.children[m.id], d.add(m.id), m.parent !== n.parent && (n.children[m.parent] = V(e, m.parent).filter((h) => h !== m.id)));
+    }
+  }
+  const b = V(e, n.parent).filter((g) => !u.has(g) && g !== c && !d.has(g));
+  return i ? b.push(...l) : b.push(c), n.children[n.parent] = ae(b, n.records, e), i || (n.children[c] = ae(l, n.records, e)), n.affected = [...new Set(n.affected)], s;
+}
+function Ye(e, t) {
+  var c;
+  const r = (c = t.meta.origin) == null ? void 0 : c.part, s = [], n = (o) => {
+    const i = e.records[o];
+    if (!i) return;
+    const l = i.meta.origin;
+    l && l.part === r && s.push(l.spid);
+    for (const u of i.children ?? []) n(u);
+  };
+  return n(t.id), [...new Set(s)].sort((o, i) => o - i);
+}
+function F(e, t) {
+  const r = Ye(e, t);
+  return {
+    id: t.id,
+    parent: t.parent,
+    meta: structuredClone(t.meta),
+    ...r.length ? { sourceSpids: r } : {}
+  };
+}
+function Ze(e, t) {
+  let r = t;
+  const s = /* @__PURE__ */ new Set();
+  for (; !e.slides[r]; ) {
+    if (s.has(r)) throw new Error(`协同删除父链成环：${t}`);
+    s.add(r);
+    const n = e.elements[r];
+    if (!n) throw new Error(`协同删除找不到所属页：${t}`);
+    r = n.parent;
+  }
+  return r;
+}
+function et(e, t) {
+  if (t.op !== "remove") return t;
+  const r = e.elements[t.path[1]];
+  if (!!r && r.parent === t.value.parent && Object.entries(t.value.records).every(([d, w]) => {
+    var b;
+    return ((b = e.elements[d]) == null ? void 0 : b.parent) === w.parent;
+  })) return t;
+  const n = new Set(Object.keys(t.value.records).filter((d) => !!e.elements[d]));
+  if (r) {
+    const d = (w) => {
+      var p;
+      if (n.has(w)) {
+        for (const E of ((p = e.elements[w]) == null ? void 0 : p.children) ?? []) d(E);
+        return;
+      }
+      const b = e.elements[w];
+      if (b) {
+        n.add(w);
+        for (const E of b.children ?? []) d(E);
+      }
+    };
+    d(r.id);
+  }
+  const c = [...n];
+  if (!c.length) return null;
+  const o = Object.fromEntries(c.map((d) => [d, null])), i = /* @__PURE__ */ Object.create(null), l = t.value.records[t.value.root];
+  if (l.meta.created) {
+    i[l.id] = null;
+    for (const d of Object.values(t.value.records))
+      !d.meta.created && d.meta.sourceParent !== void 0 && (i[d.id] = F(t.value, d));
+  } else i[l.id] = F(t.value, l);
+  for (const d of c)
+    Object.prototype.hasOwnProperty.call(t.value.records, d) || (i[d] = null);
+  const u = new Set(c), y = /* @__PURE__ */ Object.create(null);
+  for (const d of c) {
+    const w = e.elements[d].parent;
+    !u.has(w) && y[w] === void 0 && (y[w] = V(e, w).filter((b) => !u.has(b)));
+  }
+  const f = Ze(e, c[0]);
+  return {
+    op: "set",
+    path: ["elements", t.path[1], "hierarchy"],
+    origin: t.origin,
+    value: { parent: f, affected: c, records: o, children: y, removed: i }
+  };
+}
+function tt(e, t) {
+  if (t.op !== "insert" || !t.value.sectionId || e.sections.records[t.value.sectionId]) return t;
+  const { sectionId: r, ...s } = t.value;
+  return { ...t, value: s };
+}
+function rt(e, t) {
+  if (t.op !== "remove") return t;
+  const r = e.slides[t.path[1]];
+  if (!r) return null;
+  const s = /* @__PURE__ */ Object.create(null), n = (i) => {
+    const l = e.elements[i];
+    if (!l) throw new Error(`协同删页找不到当前元素：${i}`);
+    s[i] = structuredClone(l);
+    for (const u of l.children ?? []) n(u);
+  };
+  for (const i of r.children) n(i);
+  const c = e.slideOrder.indexOf(r.id);
+  if (c < 0) throw new Error(`协同删页找不到当前页序：${r.id}`);
+  const o = je(e, r.id);
+  return {
+    ...t,
+    value: {
+      slide: structuredClone(r),
+      after: e.slideOrder[c - 1] ?? null,
+      before: e.slideOrder[c + 1] ?? null,
+      records: s,
+      ...o ? { sectionId: o } : {}
+    }
+  };
+}
+const Se = (e, t) => e < t ? -1 : e > t ? 1 : 0;
+function be(e, t, r) {
+  const s = t.indexOf(r), n = t.slice(0, s).reverse().find((u) => e.includes(u)) ?? null, c = t.slice(s + 1).find((u) => e.includes(u)) ?? null, o = n === null ? 0 : e.indexOf(n) + 1, i = c === null ? e.length : e.indexOf(c), l = [.../* @__PURE__ */ new Set([...e.slice(o, i), r])].sort(Se);
+  e.splice(o, i - o, ...l);
+}
+function nt(e, t, r) {
+  const s = t.records[r];
+  if (!s || e.records[r]) return !1;
+  const n = structuredClone(s);
+  for (const c of [...n.slideIds]) {
+    const o = e.order.find((i) => e.records[i].slideIds.includes(c));
+    o && (Se(o, r) < 0 ? n.slideIds.splice(n.slideIds.indexOf(c), 1) : e.records[o].slideIds.splice(e.records[o].slideIds.indexOf(c), 1));
+  }
+  return e.records[r] = n, be(e.order, t.order, r), !0;
+}
+function st(e, t) {
+  const r = t.path[2], s = t.path[3], n = t.value, c = structuredClone(e.sections);
+  let o = !1;
+  if (s === "name") {
+    if (!c.records[r] || !n.records[r]) return null;
+    o = c.records[r].name !== n.records[r].name, c.records[r].name = n.records[r].name;
+  } else if (s === "order") {
+    if (!c.records[r] || !n.records[r]) return null;
+    const i = c.order.join("\0");
+    c.order.splice(c.order.indexOf(r), 1), be(c.order, n.order, r), o = i !== c.order.join("\0");
+  } else n.records[r] ? o = nt(c, n, r) : c.records[r] && (delete c.records[r], c.order.splice(c.order.indexOf(r), 1), o = !0);
+  return c.edited || (c.edited = n.edited), !o && c.edited === e.sections.edited && s !== "order" ? null : { ...t, value: c };
+}
+const ot = ["x", "y", "w", "h", "rot", "flipH", "flipV"], J = (e) => `hierarchy:${JSON.stringify(e)}`, Y = (e) => e.path.length === 2 && e.path[0] === "elements" && (e.op === "insert" || e.op === "remove") ? { id: e.path[1], state: e.op === "insert" ? "present" : "removed" } : null, H = (e) => e.path.length === 2 && e.path[0] === "slides" && (e.op === "insert" || e.op === "remove") ? { id: e.path[1], state: e.op === "insert" ? "present" : "removed" } : null, Z = (e) => {
+  var r;
+  if (e.op !== "move" || e.path.length !== 2 || e.path[0] !== "slideOrder") return null;
+  const t = (r = e.value) == null ? void 0 : r.after;
+  return t === null || typeof t == "string" && t ? { id: e.path[1], after: t } : null;
+}, ct = (e) => {
+  if (e.op !== "set" || e.path.length !== 4 || e.path[0] !== "document" || e.path[1] !== "sections" || !["state", "order"].includes(e.path[3])) return null;
+  const t = e.path[2], r = e.value;
+  if (!(r != null && r.records) || typeof r.records != "object" || !Array.isArray(r.order) || !(t in r.records)) return null;
+  const s = r.order.indexOf(t);
+  if (s < 0) return null;
+  const n = r.order[s - 1] ?? null;
+  return n === null || typeof n == "string" && n ? { id: t, after: n } : null;
+}, ee = (e) => Be(e), L = (e, t) => !t || D(e, t.stamp) > 0;
+function G(e, t, r) {
+  var l, u, y;
+  const s = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
+  for (let f = 0; f < t.length; f++) {
+    const d = t[f], w = ee(d);
+    if (w) {
+      const m = d.path[1], S = d.value;
+      for (const h of S.affected) s.set(J(h), "hierarchy");
+      for (const [h, I] of Object.entries(w))
+        n.set(h, I === null ? "removed" : "present"), I !== null && s.set(JSON.stringify(["elements", h, "order"]), "hierarchy");
+      if (w[m] === null) {
+        for (const [h, I] of Object.entries(S.records))
+          if (I !== null)
+            for (const a of ot)
+              s.set(JSON.stringify(["elements", h, "ovr", a]), "hierarchy");
+      }
+      s.set(X(d), "hierarchy");
+      continue;
+    }
+    const b = Y(d);
+    if (b) {
+      const m = (l = d.value) == null ? void 0 : l.records;
+      for (const S of Object.keys(m ?? { [b.id]: !0 }))
+        n.set(S, b.state), s.set(J(S), "hierarchy");
+    }
+    const p = H(d);
+    if (p) {
+      c.set(p.id, p.state);
+      const m = (u = d.value) == null ? void 0 : u.records;
+      for (const S of Object.keys(m ?? {}))
+        n.set(S, p.state), s.set(J(S), "hierarchy");
+      p.state === "present" && o.set(p.id, {
+        after: d.op === "insert" ? d.value.after : null,
+        ordinal: f
+      });
+    }
+    const E = Z(d);
+    E && o.set(E.id, { after: E.after, ordinal: f });
+    const g = ct(d);
+    g && i.set(g.id, { after: g.after, ordinal: f }), !b && !p && !E && !ge(d) && s.set(X(d), "field");
+  }
+  for (const [f, d] of s) {
+    const w = e.registers.get(f);
+    (!w || D(r, w.stamp) >= 0) && e.registers.set(f, { stamp: r, kind: d });
+  }
+  for (const [f, d] of n) {
+    const w = e.elementLifecycles.get(f);
+    (d === "removed" && (w == null ? void 0 : w.stamp.replicaId) !== r.replicaId || L(r, w)) && e.elementLifecycles.set(f, { stamp: r, state: d });
+  }
+  for (const [f, d] of c)
+    L(r, e.slideLifecycles.get(f)) && e.slideLifecycles.set(f, { stamp: r, state: d });
+  for (const [f, d] of o)
+    L(r, e.slideMoves.get(f)) && e.slideMoves.set(f, { stamp: r, ...d });
+  for (const [f, d] of i)
+    L(r, e.sectionMoves.get(f)) && e.sectionMoves.set(f, { stamp: r, ...d });
+  (y = e.onRecord) == null || y.call(e, t, r);
+}
+function it(e, t) {
+  const [r, s] = t.path;
+  return r === "elements" && typeof s == "string" ? !!e.elements[s] : (r === "slides" || r === "slideOrder") && typeof s == "string" ? !!e.slides[s] : r === "layouts" && typeof s == "string" ? !!e.layouts[s] : r === "masters" && typeof s == "string" ? !!e.masters[s] : !0;
+}
+function lt(e) {
+  if (e.path.length !== 5 || e.path[0] !== "elements" || e.path[2] !== "ovr" || !["tableRemovedRows", "tableRemovedColumns"].includes(String(e.path[3]))) return null;
+  const t = e.path[3];
+  return {
+    elementId: e.path[1],
+    dimension: t === "tableRemovedRows" ? "row" : "column",
+    field: t,
+    id: e.path[4],
+    patch: e
+  };
+}
+function dt(e, t, r, s) {
+  var c;
+  const n = JSON.stringify(["elements", t, "ovr", r, s]);
+  return ((c = e.registers.get(n)) == null ? void 0 : c.stamp) ?? { clock: 0, replicaId: "" };
+}
+function at(e, t, r, s) {
+  const n = r.get(s);
+  if (n) return n;
+  const c = e.elements[s];
+  if (!c || c.src.kind !== "table") throw new Error(`协同表格不存在：${s}`);
+  const o = Le(e, s), i = (u, y, f) => {
+    const d = u === "row" ? c.ovr.tableRemovedRows : c.ovr.tableRemovedColumns, w = new Set(Object.keys(d ?? {}));
+    return {
+      all: y,
+      removed: w,
+      stamps: new Map([...w].map((b) => [b, dt(t, s, f, b)]))
+    };
+  }, l = {
+    rows: i("row", o.rows, "tableRemovedRows"),
+    columns: i("column", o.columns, "tableRemovedColumns")
+  };
+  return r.set(s, l), l;
+}
+function ft(e, t) {
+  return {
+    op: "del",
+    path: ["elements", e.elementId, "ovr", e.field, t],
+    origin: e.patch.origin
+  };
+}
+function ut(e) {
+  return [...e.removed].sort((t, r) => D(e.stamps.get(t), e.stamps.get(r)) || (t < r ? -1 : t > r ? 1 : 0))[0];
+}
+function pt(e, t, r, s) {
+  const n = [], c = [], o = /* @__PURE__ */ new Map(), i = (l, u = !1) => {
+    n.push(l), u && c.push(l);
+  };
+  for (const l of s) {
+    const u = lt(l);
+    if (u) {
+      const y = at(e, t, o, u.elementId), f = u.dimension === "row" ? y.rows : y.columns;
+      if (l.op === "del") {
+        f.removed.delete(u.id), f.stamps.delete(u.id), i(l);
+        continue;
+      }
+      if (f.removed.add(u.id), f.stamps.set(u.id, r), f.removed.size >= f.all.length) {
+        const d = ut(f);
+        f.removed.delete(d), f.stamps.delete(d);
+        const w = ft(u, d);
+        if (i(w, !0), d === u.id) continue;
+      }
+      i(l);
+      continue;
+    }
+    i(l);
+  }
+  return { accepted: n, recorded: c };
+}
+function Ie(e, t) {
+  var s;
+  if (!((s = e.extensions) != null && s[ke])) return t;
+  const r = /* @__PURE__ */ new Map();
+  for (const [n, c] of t) {
+    let o = n;
+    try {
+      n.startsWith('["elements",') && (o = JSON.stringify(Pe(e, JSON.parse(n))));
+    } catch {
+    }
+    L(c.stamp, r.get(o)) && r.set(o, c);
+  }
+  return r;
+}
+function U(e, t) {
+  const r = {
+    elements: new Set(t == null ? void 0 : t.elements),
+    slides: new Set(t == null ? void 0 : t.slides)
+  };
+  for (const s of e) {
+    const n = Y(s);
+    (n == null ? void 0 : n.state) === "present" && Object.keys(s.value.records).forEach((o) => r.elements.add(o));
+    const c = H(s);
+    if ((c == null ? void 0 : c.state) === "present" && (r.slides.add(c.id), Object.keys(s.value.records).forEach((o) => r.elements.add(o))), ee(s))
+      for (const [o, i] of Object.entries(
+        s.value.records
+      )) i && r.elements.add(o);
+  }
+  return r;
+}
+function ue(e, t, r) {
+  var c, o;
+  const [s, n] = e.path;
+  return s === "elements" && typeof n == "string" ? ((c = t.get(n)) == null ? void 0 : c.state) === "removed" : (s === "slides" || s === "slideOrder") && typeof n == "string" ? ((o = r.get(n)) == null ? void 0 : o.state) === "removed" : !1;
+}
+function pe(e, t, r) {
+  const [s, n] = t.path;
+  return s === "elements" && r.elements.has(n) || (s === "slides" || s === "slideOrder") && r.slides.has(n) ? !0 : it(e, t);
+}
+function he(e, t, r) {
+  return !!e.elements[t] || !!e.slides[t] || !!e.layouts[t] || !!e.masters[t] || r.elements.has(t) || r.slides.has(t);
+}
+const ht = (e) => e.op === "set" && e.path.length === 4 && e.path[0] === "document" && e.path[1] === "sections" && typeof e.path[2] == "string" && ["state", "name", "order"].includes(e.path[3]);
+function mt(e, t, r, s, n) {
+  var d, w;
+  const c = r.patches.filter(B);
+  if (c.length) {
+    if (r.patches.slice(0, c.length).some((b) => !B(b)))
+      throw new Error("协同地址声明必须先于字段和结构补丁");
+    e = N(e, c);
+  }
+  const o = n ?? Ae(e, r.patches);
+  o.length && (e = N(e, o)), t = { ...t, registers: Ie(e, t.registers) };
+  const i = [...o], l = [], u = U([], s);
+  let y = !1;
+  for (const b of r.patches) {
+    const p = qe(e, b);
+    if (ge(p)) throw new Error("迁移凭据须本地裁决");
+    if (B(p)) {
+      i.push(p), l.push(p);
+      continue;
+    }
+    const E = Y(p), g = H(p), m = Z(p), S = ee(p);
+    if (ht(p)) {
+      if (!L(r.stamp, t.registers.get(X(p)))) continue;
+      const h = i.length ? N(e, i) : e, I = st(h, p);
+      I && i.push(I), l.push(p);
+      continue;
+    }
+    if (E) {
+      if (E.state === "removed") {
+        const I = t.elementLifecycles.get(E.id);
+        if ((I == null ? void 0 : I.stamp.replicaId) === r.replicaId && !L(r.stamp, I)) continue;
+        const a = et(e, p);
+        a && i.push(a), l.push(p), a && a !== p && l.push(a);
+        continue;
+      }
+      if (!L(r.stamp, t.elementLifecycles.get(E.id))) continue;
+      const h = p.value.parent;
+      if (((d = t.slideLifecycles.get(h)) == null ? void 0 : d.state) === "removed" || ((w = t.elementLifecycles.get(h)) == null ? void 0 : w.state) === "removed") {
+        l.push({ ...p, op: "remove" });
+        continue;
+      }
+      he(e, h, u) || (y = !0), e.elements[E.id] || (i.push(p), Object.keys(p.value.records).forEach((I) => u.elements.add(I))), l.push(p);
+      continue;
+    }
+    if (g) {
+      if (!L(r.stamp, t.slideLifecycles.get(g.id))) continue;
+      if (g.state === "removed") {
+        const h = rt(e, p);
+        h && i.push(h), l.push(h ?? p);
+        continue;
+      }
+      if (!e.slides[g.id]) {
+        const h = i.length ? N(e, i) : e;
+        i.push(tt(h, p)), u.slides.add(g.id), Object.keys(p.value.records).forEach((I) => u.elements.add(I));
+      }
+      l.push(p);
+      continue;
+    }
+    if (S) {
+      const h = p;
+      he(e, h.value.parent, u) || (y = !0);
+      const I = new Set([...t.elementLifecycles].flatMap(([M, C]) => C.state === "removed" ? [M] : [])), a = new Set(h.value.affected.filter((M) => !L(r.stamp, t.registers.get(J(M))))), v = Ke(h, a), O = v && Ge(
+        e,
+        v,
+        I
+      );
+      if (O) {
+        const M = O.value.records[O.path[1]] === null, C = Qe(e, O, (j, k) => {
+          const $ = k === "order" ? ["elements", j, "order"] : ["elements", j, "ovr", k], x = t.registers.get(JSON.stringify($));
+          return M && (x == null ? void 0 : x.kind) === "hierarchy" || L(r.stamp, x);
+        });
+        i.push(C), l.push(C), Object.entries(C.value.records).forEach(([j, k]) => {
+          k && u.elements.add(j);
+        });
+      }
+      continue;
+    }
+    if (m) {
+      if (!L(r.stamp, t.slideMoves.get(m.id))) continue;
+      ue(p, t.elementLifecycles, t.slideLifecycles) ? l.push(p) : pe(e, p, u) ? (i.push(p), l.push(p)) : y = !0;
+      continue;
+    }
+    L(r.stamp, t.registers.get(X(p))) && (ue(p, t.elementLifecycles, t.slideLifecycles) ? l.push(p) : pe(e, p, u) ? (i.push(p), l.push(p)) : y = !0);
+  }
+  const f = pt(e, t, r.stamp, i);
+  return {
+    accepted: f.accepted,
+    recorded: [...l, ...f.recorded],
+    missingDependency: y,
+    availability: u
+  };
+}
+function Oe(e, t, r) {
+  const s = e.filter((c) => t.has(c));
+  s.push(...[...t].filter((c) => !s.includes(c)).sort());
+  const n = [...r.entries()].sort((c, o) => D(c[1].stamp, o[1].stamp) || c[1].ordinal - o[1].ordinal || (c[0] < o[0] ? -1 : c[0] === o[0] ? 0 : 1));
+  for (const [c, o] of n) {
+    const i = s.indexOf(c);
+    if (i < 0) continue;
+    s.splice(i, 1);
+    const l = o.after === null ? -1 : s.indexOf(o.after);
+    s.splice(l < 0 && o.after !== null ? s.length : l + 1, 0, c);
+  }
+  return s;
+}
+function gt(e, t) {
+  const r = [...e], s = [];
+  for (let n = 0; n < t.length; n++) {
+    const c = t[n], o = t[n - 1] ?? null, i = r.indexOf(c);
+    if ((i > 0 ? r[i - 1] : null) === o) continue;
+    r.splice(i, 1);
+    const u = o === null ? -1 : r.indexOf(o);
+    r.splice(u + 1, 0, c), s.push({ op: "move", path: ["slideOrder", c], value: { after: o }, origin: "collab-order" });
+  }
+  return s;
+}
+function vt(e, t, r) {
+  const s = /* @__PURE__ */ new Map(), n = [], c = [];
+  for (const f of r)
+    if (!Z(f))
+      if (f.path.length === 2 && f.path[0] === "slides" && (f.op === "insert" || f.op === "remove")) {
+        const d = structuredClone(f);
+        d.op === "insert" ? s.set(d.path[1], d) : n.push(d);
+      } else c.push(f);
+  const o = new Set(n.map((f) => f.path[1])), i = e.filter((f) => !o.has(f)), l = t.filter((f) => !s.has(f)), u = gt(i, l), y = [];
+  for (let f = 0; f < t.length; f++) {
+    const d = t[f], w = s.get(d);
+    w && y.push({
+      ...w,
+      value: { ...w.value, after: t[f - 1] ?? null }
+    });
+  }
+  return [...n, ...u, ...y, ...c];
+}
+function yt(e, t, r) {
+  let s = -1;
+  for (let o = 0; o < r.length; o++) {
+    const i = r[o];
+    i.op === "set" && i.path.length === 4 && i.path[0] === "document" && i.path[1] === "sections" && (s = o);
+  }
+  if (s < 0) return r;
+  const n = r[s], c = Oe(e, new Set(Object.keys(n.value.records)), t);
+  return r[s] = { ...n, value: { ...n.value, order: c } }, r;
+}
+const W = /* @__PURE__ */ new WeakMap(), wt = 1e4;
+function Mt(e) {
+  const t = W.get(e);
+  if (!t) throw new Error("编辑器尚未绑定协同会话");
+  return t;
+}
+function me(e, t) {
+  if (!e || e.length > 128 || /[\0-\x1f\x7f]/.test(e))
+    throw new Error(`${t} 必须是 1–128 个不含控制字符的字符`);
+}
+function St(e, t, r) {
+  const s = e.doc.identity.allocation;
+  return r = structuredClone(r), {
+    documentId: t.documentId,
+    replicaId: t.replicaId,
+    replicaSlot: t.replicaSlot,
+    registers: new Map(r == null ? void 0 : r.registers),
+    elementLifecycles: new Map(r == null ? void 0 : r.elementLifecycles),
+    slideLifecycles: new Map(r == null ? void 0 : r.slideLifecycles),
+    slideMoves: new Map(r == null ? void 0 : r.slideMoves),
+    sectionMoves: new Map(r == null ? void 0 : r.sectionMoves),
+    seen: _e(r == null ? void 0 : r.seen),
+    baseSlideOrder: [...(r == null ? void 0 : r.baseSlideOrder) ?? e.doc.slideOrder],
+    baseSectionOrder: [...(r == null ? void 0 : r.baseSectionOrder) ?? e.doc.sections.order],
+    deferred: [...(r == null ? void 0 : r.deferred) ?? []],
+    clock: s.clock,
+    sequence: s.sequence,
+    active: !1
+  };
+}
+function bt(e, t) {
+  return structuredClone({
+    version: 1,
+    documentId: e.documentId,
+    replicaId: e.replicaId,
+    replicaSlot: e.replicaSlot,
+    clock: e.clock,
+    sequence: e.sequence,
+    baseSlideOrder: e.baseSlideOrder,
+    baseSectionOrder: e.baseSectionOrder,
+    registers: [...Ie(t, e.registers)],
+    elementLifecycles: [...e.elementLifecycles],
+    slideLifecycles: [...e.slideLifecycles],
+    slideMoves: [...e.slideMoves],
+    sectionMoves: [...e.sectionMoves],
+    seen: De(e.seen),
+    deferred: e.deferred
+  });
+}
+function It(e, t) {
+  if (e.active) throw new Error("同一个 Editor 已经绑定协同 provider");
+  if (e.documentId !== t.documentId || e.replicaId !== t.replicaId || e.replicaSlot !== t.replicaSlot)
+    throw new Error("同一个 Editor 不能切换协同文档或副本身份");
+}
+const Ct = Ot;
+function Ot(e, t, r = mt) {
+  if (!e || typeof e.subscribePatches != "function" || typeof e.applyExternalPatches != "function")
+    throw new Error("协同绑定需要支持外部补丁的 Editor");
+  if (me(t.documentId, "documentId"), me(t.replicaId, "replicaId"), !t.provider || typeof t.provider.send != "function" || typeof t.provider.subscribe != "function") throw new Error("provider 接口无效");
+  if (!Number.isSafeInteger(t.replicaSlot) || t.replicaSlot < 0 || t.replicaSlot >= 4096)
+    throw new Error("replicaSlot 必须是 0–4095 的整数");
+  let s = W.get(e);
+  const n = !s;
+  let c = null;
+  if (s) It(s, t);
+  else {
+    const a = e.doc.identity.allocation, v = (a == null ? void 0 : a.replicaId) === t.replicaId && a.slot === t.replicaSlot && a.count === 4096;
+    if (e.history.undoCount || e.history.redoCount || e.isDirty() && !v)
+      throw new Error("协同绑定必须在本地编辑开始前建立");
+    c = structuredClone(e.doc.identity);
+    try {
+      Ne(e.doc, t.replicaId, t.replicaSlot);
+      const O = e.doc.identity.allocation;
+      if ((O.clock > 0 || O.sequence > 0) && !t.checkpoint)
+        throw new Error("恢复协同文档必须同时提供 CollaborationCheckpoint");
+      t.checkpoint && Xe(t.checkpoint, t, O), s = St(e, t, t.checkpoint), W.set(e, s);
+    } catch (O) {
+      throw e.doc.identity = c, O;
+    }
+  }
+  const o = s, i = (a) => {
+    var v;
+    try {
+      (v = t.onError) == null || v.call(t, a);
+    } catch {
+    }
+  }, l = () => ({
+    registers: new Map(o.registers),
+    elementLifecycles: new Map(o.elementLifecycles),
+    slideLifecycles: new Map(o.slideLifecycles),
+    slideMoves: new Map(o.slideMoves),
+    sectionMoves: new Map(o.sectionMoves),
+    seen: ze(o.seen),
+    deferred: [...o.deferred],
+    clock: o.clock
+  }), u = (a) => {
+    Object.assign(o, a);
+  }, y = (a) => {
+    const v = Fe(a), O = new Set(e.doc.slideOrder);
+    for (const C of v) {
+      const j = H(C);
+      j && (j.state === "present" ? O.add(j.id) : O.delete(j.id));
+    }
+    const M = Oe(
+      o.baseSlideOrder,
+      O,
+      o.slideMoves
+    );
+    return yt(
+      o.baseSectionOrder,
+      o.sectionMoves,
+      vt(e.doc.slideOrder, M, v)
+    );
+  }, f = (a, v) => {
+    const O = [], M = [];
+    let C = a, j = N(
+      e.doc,
+      y(v)
+    ), k = !0;
+    for (; k; ) {
+      k = !1;
+      const $ = [...o.deferred].sort((P, R) => D(P.message.stamp, R.message.stamp) || P.ordinal - R.ordinal), x = /* @__PURE__ */ new Map();
+      for (const P of $) {
+        const R = $e(P.message), T = x.get(R) ?? [];
+        T.push(P), x.set(R, T);
+      }
+      const q = /* @__PURE__ */ new Set();
+      for (const P of x.values()) {
+        const R = P[0].message;
+        if (q.has(R.replicaId)) continue;
+        if (ne(o.seen, R)) {
+          q.add(R.replicaId);
+          continue;
+        }
+        const T = l(), Ee = new Set(P);
+        try {
+          const A = r(j, o, R, C);
+          if (A.missingDependency) {
+            q.add(R.replicaId);
+            continue;
+          }
+          G(o, A.recorded, R.stamp);
+          const Me = N(e.doc, y([
+            ...v,
+            ...O,
+            ...A.accepted
+          ])), Ce = U(A.accepted, C);
+          O.push(...A.accepted), j = Me, C = Ce;
+        } catch (A) {
+          u(T), M.push(A);
+        }
+        o.deferred = o.deferred.filter((A) => !Ee.has(A)), k = !0;
+      }
+    }
+    return { patches: O, errors: M };
+  }, d = (a) => {
+    try {
+      if (ve(a), a.documentId !== t.documentId || a.replicaId === t.replicaId) return;
+      if (a.identity.prefix !== e.doc.identity.prefix)
+        throw new Error("协同消息的文档身份前缀与本地基线不一致");
+      if (Te(o.seen, a)) return;
+      const v = r(e.doc, o, a), M = ne(o.seen, a) || o.deferred.some((x) => x.message.replicaId === a.replicaId && x.message.sequence < a.sequence) || v.missingDependency ? a.patches.map((x, q) => ({ message: a, patch: x, ordinal: q })) : [];
+      if (o.deferred.length + M.length > wt)
+        throw new Error("协同延迟补丁超过安全上限");
+      const C = e.doc.identity.allocation, j = l(), k = C.clock;
+      let $ = [];
+      try {
+        const x = Math.max(o.clock, a.stamp.clock);
+        o.clock = x, C.clock = x, se(o.seen, a), M.length ? o.deferred.push(...M) : G(o, v.recorded, a.stamp), M.length || N(
+          e.doc,
+          y(v.accepted)
+        );
+        const q = M.length ? { patches: [], errors: [] } : f(U(v.accepted), v.accepted);
+        $ = q.errors;
+        const P = M.length ? [] : [...v.accepted, ...q.patches], R = y(P);
+        R.length ? e.applyExternalPatches(R, {
+          identity: a.identity,
+          origin: `collab:${a.replicaId}`,
+          label: a.label,
+          time: a.time
+        }) : e.applyExternalPatches([], {
+          identity: a.identity,
+          origin: `collab:${a.replicaId}`
+        });
+      } catch (x) {
+        throw u(j), C.clock = k, x;
+      }
+      $.forEach(i);
+    } catch (v) {
+      i(v);
+    }
+  }, w = /* @__PURE__ */ new Map(), b = (a) => {
+    if (!o.active || a.source === "external" || !a.patches.length) return;
+    const v = a.identity.allocation;
+    if (!v || v.replicaId !== t.replicaId || v.slot !== t.replicaSlot) {
+      i(new Error("本地补丁缺少匹配的协同身份版本"));
+      return;
+    }
+    if (v.clock <= o.clock || v.sequence <= o.sequence) {
+      i(new Error("协同逻辑时钟或消息序号已耗尽"));
+      return;
+    }
+    o.clock = v.clock, o.sequence = v.sequence;
+    const O = { clock: v.clock, replicaId: t.replicaId }, M = v.sequence;
+    G(o, a.patches, O);
+    const C = {
+      version: 1,
+      documentId: t.documentId,
+      replicaId: t.replicaId,
+      sequence: M,
+      stamp: O,
+      patches: a.patches,
+      identity: a.identity,
+      label: a.label,
+      time: a.time
+    };
+    se(o.seen, C), w.set(M, C);
+  }, p = (a) => {
+    var M;
+    if (!o.active || a.source === "external" || !a.patches.length) return;
+    const v = (M = a.identity.allocation) == null ? void 0 : M.sequence, O = v === void 0 ? void 0 : w.get(v);
+    if (!O) {
+      i(new Error("本地补丁缺少 recovery 前协同 checkpoint"));
+      return;
+    }
+    w.delete(O.sequence);
+    try {
+      const C = t.provider.send(structuredClone(O));
+      C && typeof C.then == "function" && C.catch(i);
+    } catch (C) {
+      i(C);
+    }
+  };
+  let E = null, g = null, m = null;
+  const S = [];
+  let h = !1, I = !1;
+  try {
+    E = e.subscribePatches(b, { phase: "before-recovery" }), g = e.subscribePatches(p);
+    const a = t.provider.subscribe((v) => {
+      I || (h ? d(v) : S.push(structuredClone(v)));
+    });
+    if (typeof a != "function") throw new Error("provider.subscribe 必须返回取消订阅函数");
+    m = a, o.active = !0, h = !0;
+    for (const v of S) d(v);
+  } catch (a) {
+    try {
+      E == null || E();
+    } catch {
+    }
+    try {
+      g == null || g();
+    } catch {
+    }
+    try {
+      m == null || m();
+    } catch {
+    }
+    throw n && c && (e.doc.identity = c, W.delete(e)), a;
+  }
+  return {
+    documentId: t.documentId,
+    replicaId: t.replicaId,
+    editor: e,
+    checkpoint: () => bt(o, e.doc),
+    dispose() {
+      if (!I) {
+        I = !0, o.active = !1, h = !1, S.length = 0, w.clear();
+        try {
+          E == null || E();
+        } catch (a) {
+          i(a);
+        }
+        try {
+          g == null || g();
+        } catch (a) {
+          i(a);
+        }
+        try {
+          m == null || m();
+        } catch (a) {
+          i(a);
+        }
+      }
+    }
+  };
+}
+export {
+  Ie as a,
+  Ot as b,
+  D as c,
+  Oe as d,
+  mt as e,
+  Mt as f,
+  Ct as g,
+  vt as m,
+  X as p,
+  G as r,
+  H as s
+};