@web-ppt/collab 0.5.0-beta.2

package/dist/collab.js

@@ -0,0 +1,897 @@
+import { MAX_COLLABORATION_VERSION as N, assertIdentityAllocation as we, configureCollaborationIdentity as Se, stageExternalPatches as J } from "@web-ppt/edit-core";
+function D(t, e) {
+  return t.clock !== e.clock ? t.clock < e.clock ? -1 : 1 : t.replicaId === e.replicaId ? 0 : t.replicaId < e.replicaId ? -1 : 1;
+}
+const R = (t) => typeof t == "number" && Number.isSafeInteger(t) && t > 0, H = (t) => typeof t == "string" && t.length >= 1 && t.length <= 128 && !/[\0-\x1f\x7f]/.test(t);
+function Ie(t) {
+  const e = t, r = (n, s = 1, c = Number.MAX_SAFE_INTEGER) => n === void 0 || R(n) && n >= s && n <= c;
+  if (!e || typeof e != "object" || typeof e.prefix != "string" || !e.prefix || !R(e.nextSlide) || !R(e.nextElement) || !e.nextSpid || typeof e.nextSpid != "object" || Array.isArray(e.nextSpid) || Object.entries(e.nextSpid).some(([n, s]) => !n || !R(s)) || !r(e.nextSlidePart) || !r(e.nextNotesPart) || !r(e.nextPresentationSlideId, 256, 2147483648) || !r(e.nextPresentationRelationship))
+    throw new Error("协同消息的身份水位无效");
+  const o = e.allocation;
+  if (o !== void 0) {
+    if (!H(o == null ? void 0 : o.replicaId)) throw new Error("协同消息的身份分配命名空间无效");
+    try {
+      we(o, "协同消息的身份分配命名空间", e.prefix);
+    } catch {
+      throw new Error("协同消息的身份分配命名空间无效");
+    }
+  }
+}
+function he(t) {
+  const e = t, r = e == null ? void 0 : e.stamp;
+  if (!e || typeof e != "object" || e.version !== 1 || !H(e.documentId) || !H(e.replicaId) || !R(e.sequence) || e.sequence > N || !r || !R(r.clock) || r.clock > N || r.replicaId !== e.replicaId || !Array.isArray(e.patches) || !e.patches.length || e.patches.length > 1e4 || e.patches.some((n) => !n || typeof n != "object" || !Array.isArray(n.path) || !n.path.length || typeof n.op != "string" || typeof n.origin != "string") || typeof e.label != "string" || !Number.isFinite(e.time))
+    throw new Error("协同消息结构无效");
+  Ie(e.identity);
+  const o = e.identity.allocation;
+  if (!o || o.replicaId !== e.replicaId || o.clock !== r.clock || o.sequence !== e.sequence)
+    throw new Error("协同消息的身份版本与消息头不一致");
+}
+const W = (t) => JSON.stringify(t.path), Ee = (t) => `${t.replicaId}\0${t.sequence}`, me = 4096, ye = 1e4;
+function be(t = []) {
+  return new Map(t.map((e) => [e.replicaId, {
+    contiguous: e.contiguous,
+    sparse: new Set(e.sparse)
+  }]));
+}
+function Oe(t) {
+  return new Map([...t].map(([e, r]) => [e, {
+    contiguous: r.contiguous,
+    sparse: new Set(r.sparse)
+  }]));
+}
+function Me(t) {
+  return [...t].map(([e, r]) => ({
+    replicaId: e,
+    contiguous: r.contiguous,
+    sparse: [...r.sparse].sort((o, n) => o - n)
+  }));
+}
+function Ce(t, e) {
+  const r = t.get(e.replicaId);
+  return !!r && (e.sequence <= r.contiguous || r.sparse.has(e.sequence));
+}
+function re(t, e) {
+  var r;
+  return e.sequence > (((r = t.get(e.replicaId)) == null ? void 0 : r.contiguous) ?? 0) + 1;
+}
+function ne(t, e) {
+  let r = t.get(e.replicaId);
+  if (!r) {
+    if (t.size >= me) throw new Error("协同消息副本数超过安全上限");
+    r = { contiguous: 0, sparse: /* @__PURE__ */ new Set() }, t.set(e.replicaId, r);
+  }
+  if (e.sequence <= r.contiguous || r.sparse.has(e.sequence)) return;
+  if (e.sequence === r.contiguous + 1) {
+    for (r.contiguous++; r.sparse.delete(r.contiguous + 1); ) r.contiguous++;
+    return;
+  }
+  if ([...t.values()].reduce((n, s) => n + s.sparse.size, 0) >= ye) throw new Error("协同消息乱序缺口超过安全上限");
+  r.sparse.add(e.sequence);
+}
+const K = (t) => typeof t == "number" && Number.isSafeInteger(t) && t >= 0 && t <= N;
+function Q(t, e) {
+  const r = t;
+  if (!r || typeof r != "object" || !Number.isSafeInteger(r.clock) || r.clock <= 0 || r.clock > N || typeof r.replicaId != "string" || !r.replicaId)
+    throw new Error(`${e} 的 LWW 时间戳无效`);
+}
+function _(t, e, r) {
+  if (!Array.isArray(t) || t.length > 1e5) throw new Error(`${e} 无效`);
+  const o = /* @__PURE__ */ new Set();
+  t.forEach((n, s) => {
+    if (!Array.isArray(n) || n.length !== 2 || typeof n[0] != "string" || !n[0] || o.has(n[0])) throw new Error(`${e} 的键无效`);
+    o.add(n[0]), r(n[1], `${e}[${s}]`);
+  });
+}
+function ke(t, e) {
+  const r = t;
+  if (!r || typeof r != "object" || r.kind !== "field" && r.kind !== "hierarchy")
+    throw new Error(`${e} 的 register 无效`);
+  Q(r.stamp, e);
+}
+function se(t, e) {
+  const r = t;
+  if (!r || typeof r != "object" || r.state !== "present" && r.state !== "removed")
+    throw new Error(`${e} 的生命周期无效`);
+  Q(r.stamp, e);
+}
+function Le(t, e) {
+  const r = t;
+  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(`${e} 的页序意图无效`);
+  Q(r.stamp, e);
+}
+function je(t) {
+  if (!Array.isArray(t) || t.length > me)
+    throw new Error("协同 checkpoint seen 无效");
+  const e = /* @__PURE__ */ new Set();
+  let r = 0;
+  for (const o of t) {
+    const n = o;
+    if (!n || typeof n != "object" || typeof n.replicaId != "string" || !n.replicaId || n.replicaId.length > 128 || /[\0-\x1f\x7f]/.test(n.replicaId) || e.has(n.replicaId) || !K(n.contiguous) || !Array.isArray(n.sparse)) throw new Error("协同 checkpoint seen 无效");
+    e.add(n.replicaId);
+    let s = n.contiguous;
+    for (const c of n.sparse) {
+      if (!Number.isSafeInteger(c) || c <= s || c > N) throw new Error("协同 checkpoint seen 无效");
+      s = c, r++;
+    }
+  }
+  if (r > ye) throw new Error("协同 checkpoint seen 无效");
+}
+function xe(t, e, r) {
+  const o = t;
+  if (!o || typeof o != "object" || o.version !== 1 || o.documentId !== e.documentId || o.replicaId !== e.replicaId || o.replicaSlot !== e.replicaSlot || !K(o.clock) || !K(o.sequence) || o.clock !== r.clock || o.sequence !== r.sequence || !Array.isArray(o.baseSlideOrder) || o.baseSlideOrder.some((n) => typeof n != "string" || !n) || new Set(o.baseSlideOrder).size !== o.baseSlideOrder.length || !Array.isArray(o.deferred) || o.deferred.length > 1e4)
+    throw new Error("协同 checkpoint 与恢复文档不匹配");
+  _(o.registers, "协同 checkpoint registers", ke), _(o.elementLifecycles, "协同 checkpoint elementLifecycles", se), _(o.slideLifecycles, "协同 checkpoint slideLifecycles", se), _(o.slideMoves, "协同 checkpoint slideMoves", Le), je(o.seen), o.deferred.forEach((n, s) => {
+    if (!n || typeof n != "object" || !Number.isSafeInteger(n.ordinal) || n.ordinal < 0) throw new Error(`协同 checkpoint deferred[${s}] 无效`);
+    if (he(n.message), n.message.documentId !== e.documentId || n.ordinal >= n.message.patches.length || JSON.stringify(n.patch) !== JSON.stringify(n.message.patches[n.ordinal]))
+      throw new Error(`协同 checkpoint deferred[${s}] 与消息不匹配`);
+  });
+}
+const oe = (t) => t === "__proto__" || t === "prototype" || t === "constructor";
+function Ae(t) {
+  const e = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), o = t.map((s) => structuredClone(s));
+  if (t.forEach((s, c) => {
+    let d = null;
+    (s.op === "insert" && s.path.length === 2 && s.path[0] === "elements" || s.op === "set" && s.path.length === 3 && s.path[0] === "elements" && s.path[2] === "hierarchy") && (d = o[c].value.records);
+    for (const [a, f] of Object.entries(d ?? {}))
+      f && e.set(a, { index: c, record: f });
+    if (s.op === "insert" && s.path.length === 2 && s.path[0] === "slides") {
+      const a = o[c];
+      r.set(a.path[1], { index: c, record: a.value.slide });
+      for (const [f, i] of Object.entries(a.value.records))
+        e.set(f, { index: c, record: i });
+    }
+  }), !e.size && !r.size) return [...t];
+  const n = /* @__PURE__ */ new Set();
+  for (let s = 0; s < t.length; s++) {
+    const c = t[s];
+    if (c.path.length >= 3 && c.path[0] === "slides" && (c.op === "set" || c.op === "del")) {
+      const f = r.get(c.path[1]);
+      if (!f || f.index >= s) continue;
+      const i = c.path.slice(2);
+      if (i.some((b) => typeof b != "string" || oe(b))) continue;
+      let h = f.record, m = !0;
+      for (const b of i.slice(0, -1)) {
+        const v = h[b];
+        if (!v || typeof v != "object" || Array.isArray(v)) {
+          m = !1;
+          break;
+        }
+        h = v;
+      }
+      if (!m) continue;
+      const S = i[i.length - 1];
+      c.op === "set" ? h[S] = structuredClone(c.value) : delete h[S], n.add(s);
+      continue;
+    }
+    if (c.path.length !== 4 || c.path[0] !== "elements" || c.path[2] !== "ovr" || c.op !== "set" && c.op !== "del" || oe(c.path[3])) continue;
+    const d = e.get(c.path[1]);
+    if (!d || d.index >= s) continue;
+    const a = d.record.ovr;
+    c.op === "set" ? a[c.path[3]] = structuredClone(c.value) : delete a[c.path[3]], n.add(s);
+  }
+  return o.filter((s, c) => !n.has(c));
+}
+const qe = ["x", "y", "w", "h", "rot", "flipH", "flipV"], Pe = (t) => t.op === "set" && t.path.length === 3 && t.path[0] === "elements" && t.path[2] === "hierarchy" ? t.value.records : null;
+function Re(t, e, r) {
+  const o = e.path[1];
+  if (r.has(e.value.parent) || r.has(o) && e.value.records[o] !== null) return null;
+  const n = Object.keys(e.value.records).filter((a) => a !== o && r.has(a) && e.value.records[a] !== null);
+  if (!n.length) return e;
+  const s = structuredClone(e), c = s.value, d = new Set(n);
+  for (const a of n) {
+    const f = c.records[a], i = t.removedElements[a];
+    c.removed[a] = i ? structuredClone(i) : {
+      id: a,
+      parent: f.parent,
+      meta: structuredClone(f.meta),
+      ...f.meta.origin ? { sourceSpids: [f.meta.origin.spid] } : {}
+    }, delete c.records[a], delete c.children[a];
+  }
+  c.affected = c.affected.filter((a) => !d.has(a));
+  for (const [a, f] of Object.entries(c.children))
+    c.children[a] = f.filter((i) => !d.has(i));
+  for (const a of Object.values(c.records))
+    a != null && a.children && (a.children = a.children.filter((f) => !d.has(f)));
+  return s;
+}
+function Ne(t, e) {
+  if (!e.size) return t;
+  const r = t.path[1];
+  if (t.value.records[r] === null) return t;
+  if (e.has(r)) return null;
+  const n = structuredClone(t), s = n.value, c = (s.children[r] ?? []).filter((a) => !e.has(a));
+  if (!c.length) return null;
+  for (const a of e)
+    a !== r && (delete s.records[a], delete s.children[a]);
+  s.children[r] = c;
+  const d = /* @__PURE__ */ new Set([r, ...c]);
+  return s.affected = s.affected.filter((a) => d.has(a)), n;
+}
+function V(t, e) {
+  var r, o;
+  return ((r = t.slides[e]) == null ? void 0 : r.children) ?? ((o = t.elements[e]) == null ? void 0 : o.children) ?? [];
+}
+function ce(t) {
+  return t.order ?? t.z;
+}
+function ie(t, e, r) {
+  return [...new Set(t)].filter((o) => e[o] !== null && !!(e[o] ?? r.elements[o])).sort((o, n) => {
+    const s = e[o] ?? r.elements[o], c = e[n] ?? r.elements[n], d = ce(s), a = ce(c);
+    return (d < a ? -1 : d === a ? 0 : 1) || (o < n ? -1 : o === n ? 0 : 1);
+  });
+}
+function $e(t, e, r, o) {
+  const n = structuredClone(t);
+  if (n.parent = e.parent, n.z = e.z, r(e.id, "order") && (e.order === void 0 ? delete n.order : n.order = e.order), e.meta.sourceParent === void 0 ? delete n.meta.sourceParent : n.meta.sourceParent = e.meta.sourceParent, o) for (const s of qe)
+    r(e.id, s) && (Object.prototype.hasOwnProperty.call(e.ovr, s) ? n.ovr[s] = e.ovr[s] : delete n.ovr[s]);
+  return n;
+}
+function _e(t, e, r) {
+  const o = t.elements[e];
+  if (!o) throw new Error(`协同层级闭包找不到元素：${e}`);
+  const n = /* @__PURE__ */ Object.create(null), s = (c) => {
+    if (!r.has(c)) return;
+    const d = t.elements[c];
+    if (!d) throw new Error(`协同层级闭包找不到后代：${c}`);
+    n[c] = {
+      ...structuredClone(d),
+      ...d.children ? { children: d.children.filter((a) => r.has(a)) } : {}
+    };
+    for (const a of d.children ?? []) s(a);
+  };
+  return s(e), { root: e, parent: o.parent, records: n };
+}
+function le(t, e) {
+  const r = /* @__PURE__ */ new Set(), o = (n) => {
+    if (r.has(n)) return;
+    const s = t.elements[n];
+    if (!s) throw new Error(`协同层级闭包找不到元素：${n}`);
+    r.add(n);
+    for (const c of s.children ?? []) o(c);
+  };
+  return e.forEach(o), r;
+}
+function ze(t, e, r) {
+  var v, I;
+  const o = structuredClone(e);
+  if (!t.slides[e.value.parent] && !t.elements[e.value.parent]) return o;
+  const n = o.value, s = e.path[1], d = n.records[s] === null, a = Object.entries(n.records).flatMap(([p, y]) => p !== s && y !== null ? [p] : []), f = new Set(a), i = /* @__PURE__ */ new Set();
+  if (d) {
+    const p = le(t, a.filter((w) => !!t.elements[w]));
+    if (t.elements[s]) for (const w of le(t, [s]))
+      w !== s && !p.has(w) && i.add(w);
+    const E = [...i].filter((w) => {
+      var l;
+      return !i.has(((l = t.elements[w]) == null ? void 0 : l.parent) ?? "");
+    });
+    for (const w of i)
+      n.records[w] = null, n.affected.push(w), delete n.children[w];
+    for (const w of E) {
+      const l = _e(t, w, i), u = l.records[w];
+      if (u.meta.created) {
+        n.removed[w] = null;
+        for (const g of Object.values(l.records))
+          !g.meta.created && g.meta.sourceParent !== void 0 && (n.removed[g.id] = B(l, g));
+      } else n.removed[w] = B(l, u);
+    }
+  }
+  for (const p of a) {
+    const y = t.elements[p], E = n.records[p];
+    y && E && (n.records[p] = $e(y, E, r, d));
+  }
+  const h = /* @__PURE__ */ new Set();
+  for (const p of a) {
+    const y = (v = t.elements[p]) == null ? void 0 : v.parent;
+    if (y && y !== n.parent && y !== s) {
+      const E = t.elements[y], w = d ? s : n.parent;
+      (E == null ? void 0 : E.src.kind) === "group" && E.meta.created && E.parent === w && h.add(y);
+    }
+  }
+  const m = /* @__PURE__ */ new Set();
+  for (const p of h) {
+    const y = t.elements[p], E = (y.children ?? []).filter((w) => !f.has(w) && !i.has(w));
+    n.affected.push(p), E.length ? (n.records[p] = { ...structuredClone(y), children: E }, n.children[p] = E) : (n.records[p] = null, n.removed[p] = null, delete n.children[p], m.add(p));
+  }
+  if (d) {
+    const p = (I = t.elements[s]) == null ? void 0 : I.parent, y = p ? t.elements[p] : void 0;
+    if ((y == null ? void 0 : y.src.kind) === "group" && p !== n.parent) {
+      const E = (y.children ?? []).filter((w) => w !== s);
+      n.affected.push(y.id), E.length || !y.meta.created ? (n.records[y.id] = { ...structuredClone(y), children: E }, n.children[y.id] = E) : (n.records[y.id] = null, n.removed[y.id] = null, delete n.children[y.id], m.add(y.id), y.parent !== n.parent && (n.children[y.parent] = V(t, y.parent).filter((w) => w !== y.id)));
+    }
+  }
+  const b = V(t, n.parent).filter((p) => !f.has(p) && p !== s && !m.has(p));
+  return d ? b.push(...a) : b.push(s), n.children[n.parent] = ie(b, n.records, t), d || (n.children[s] = ie(a, n.records, t)), n.affected = [...new Set(n.affected)], o;
+}
+function Be(t, e) {
+  var s;
+  const r = (s = e.meta.origin) == null ? void 0 : s.part, o = [], n = (c) => {
+    const d = t.records[c];
+    if (!d) return;
+    const a = d.meta.origin;
+    a && a.part === r && o.push(a.spid);
+    for (const f of d.children ?? []) n(f);
+  };
+  return n(e.id), [...new Set(o)].sort((c, d) => c - d);
+}
+function B(t, e) {
+  const r = Be(t, e);
+  return {
+    id: e.id,
+    parent: e.parent,
+    meta: structuredClone(e.meta),
+    ...r.length ? { sourceSpids: r } : {}
+  };
+}
+function De(t, e) {
+  let r = e;
+  const o = /* @__PURE__ */ new Set();
+  for (; !t.slides[r]; ) {
+    if (o.has(r)) throw new Error(`协同删除父链成环：${e}`);
+    o.add(r);
+    const n = t.elements[r];
+    if (!n) throw new Error(`协同删除找不到所属页：${e}`);
+    r = n.parent;
+  }
+  return r;
+}
+function Te(t, e) {
+  if (e.op !== "remove") return e;
+  const r = t.elements[e.path[1]];
+  if (!!r && r.parent === e.value.parent && Object.entries(e.value.records).every(([m, S]) => {
+    var b;
+    return ((b = t.elements[m]) == null ? void 0 : b.parent) === S.parent;
+  })) return e;
+  const n = new Set(Object.keys(e.value.records).filter((m) => !!t.elements[m]));
+  if (r) {
+    const m = (S) => {
+      var v;
+      if (n.has(S)) {
+        for (const I of ((v = t.elements[S]) == null ? void 0 : v.children) ?? []) m(I);
+        return;
+      }
+      const b = t.elements[S];
+      if (b) {
+        n.add(S);
+        for (const I of b.children ?? []) m(I);
+      }
+    };
+    m(r.id);
+  }
+  const s = [...n];
+  if (!s.length) return null;
+  const c = Object.fromEntries(s.map((m) => [m, null])), d = /* @__PURE__ */ Object.create(null), a = e.value.records[e.value.root];
+  if (a.meta.created) {
+    d[a.id] = null;
+    for (const m of Object.values(e.value.records))
+      !m.meta.created && m.meta.sourceParent !== void 0 && (d[m.id] = B(e.value, m));
+  } else d[a.id] = B(e.value, a);
+  for (const m of s)
+    Object.prototype.hasOwnProperty.call(e.value.records, m) || (d[m] = null);
+  const f = new Set(s), i = /* @__PURE__ */ Object.create(null);
+  for (const m of s) {
+    const S = t.elements[m].parent;
+    !f.has(S) && i[S] === void 0 && (i[S] = V(t, S).filter((b) => !f.has(b)));
+  }
+  const h = De(t, s[0]);
+  return {
+    op: "set",
+    path: ["elements", e.path[1], "hierarchy"],
+    origin: e.origin,
+    value: { parent: h, affected: s, records: c, children: i, removed: d }
+  };
+}
+function Fe(t, e) {
+  if (e.op !== "remove") return e;
+  const r = t.slides[e.path[1]];
+  if (!r) return null;
+  const o = /* @__PURE__ */ Object.create(null), n = (c) => {
+    const d = t.elements[c];
+    if (!d) throw new Error(`协同删页找不到当前元素：${c}`);
+    o[c] = structuredClone(d);
+    for (const a of d.children ?? []) n(a);
+  };
+  for (const c of r.children) n(c);
+  const s = t.slideOrder.indexOf(r.id);
+  if (s < 0) throw new Error(`协同删页找不到当前页序：${r.id}`);
+  return {
+    ...e,
+    value: {
+      slide: structuredClone(r),
+      after: t.slideOrder[s - 1] ?? null,
+      before: t.slideOrder[s + 1] ?? null,
+      records: o
+    }
+  };
+}
+const Je = ["x", "y", "w", "h", "rot", "flipH", "flipV"], z = (t) => `hierarchy:${JSON.stringify(t)}`, Y = (t) => t.path.length === 2 && t.path[0] === "elements" && (t.op === "insert" || t.op === "remove") ? { id: t.path[1], state: t.op === "insert" ? "present" : "removed" } : null, T = (t) => t.path.length === 2 && t.path[0] === "slides" && (t.op === "insert" || t.op === "remove") ? { id: t.path[1], state: t.op === "insert" ? "present" : "removed" } : null, Z = (t) => {
+  var r;
+  if (t.op !== "move" || t.path.length !== 2 || t.path[0] !== "slideOrder") return null;
+  const e = (r = t.value) == null ? void 0 : r.after;
+  return e === null || typeof e == "string" && e ? { id: t.path[1], after: e } : null;
+}, ee = (t) => Pe(t), j = (t, e) => !e || D(t, e.stamp) > 0;
+function X(t, e, r) {
+  var d, a;
+  const o = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map();
+  for (let f = 0; f < e.length; f++) {
+    const i = e[f], h = ee(i);
+    if (h) {
+      const v = i.path[1], I = i.value;
+      for (const p of I.affected) o.set(z(p), "hierarchy");
+      for (const [p, y] of Object.entries(h))
+        n.set(p, y === null ? "removed" : "present"), y !== null && o.set(JSON.stringify(["elements", p, "order"]), "hierarchy");
+      if (h[v] === null) {
+        for (const [p, y] of Object.entries(I.records))
+          if (y !== null)
+            for (const E of Je)
+              o.set(JSON.stringify(["elements", p, "ovr", E]), "hierarchy");
+      }
+      o.set(W(i), "hierarchy");
+      continue;
+    }
+    const m = Y(i);
+    if (m) {
+      const v = (d = i.value) == null ? void 0 : d.records;
+      for (const I of Object.keys(v ?? { [m.id]: !0 }))
+        n.set(I, m.state), o.set(z(I), "hierarchy");
+    }
+    const S = T(i);
+    if (S) {
+      s.set(S.id, S.state);
+      const v = (a = i.value) == null ? void 0 : a.records;
+      for (const I of Object.keys(v ?? {}))
+        n.set(I, S.state), o.set(z(I), "hierarchy");
+      S.state === "present" && c.set(S.id, {
+        after: i.op === "insert" ? i.value.after : null,
+        ordinal: f
+      });
+    }
+    const b = Z(i);
+    b && c.set(b.id, { after: b.after, ordinal: f }), !m && !S && !b && o.set(W(i), "field");
+  }
+  for (const [f, i] of o) {
+    const h = t.registers.get(f);
+    (!h || D(r, h.stamp) >= 0) && t.registers.set(f, { stamp: r, kind: i });
+  }
+  for (const [f, i] of n) {
+    const h = t.elementLifecycles.get(f);
+    (i === "removed" && (h == null ? void 0 : h.stamp.replicaId) !== r.replicaId || j(r, h)) && t.elementLifecycles.set(f, { stamp: r, state: i });
+  }
+  for (const [f, i] of s)
+    j(r, t.slideLifecycles.get(f)) && t.slideLifecycles.set(f, { stamp: r, state: i });
+  for (const [f, i] of c)
+    j(r, t.slideMoves.get(f)) && t.slideMoves.set(f, { stamp: r, ...i });
+}
+function Xe(t, e) {
+  const [r, o] = e.path;
+  return r === "elements" && typeof o == "string" ? !!t.elements[o] : (r === "slides" || r === "slideOrder") && typeof o == "string" ? !!t.slides[o] : !0;
+}
+function U(t, e) {
+  const r = {
+    elements: new Set(e == null ? void 0 : e.elements),
+    slides: new Set(e == null ? void 0 : e.slides)
+  };
+  for (const o of t) {
+    const n = Y(o);
+    (n == null ? void 0 : n.state) === "present" && Object.keys(o.value.records).forEach((c) => r.elements.add(c));
+    const s = T(o);
+    if ((s == null ? void 0 : s.state) === "present" && (r.slides.add(s.id), Object.keys(o.value.records).forEach((c) => r.elements.add(c))), ee(o))
+      for (const [c, d] of Object.entries(
+        o.value.records
+      )) d && r.elements.add(c);
+  }
+  return r;
+}
+function ae(t, e, r) {
+  var s, c;
+  const [o, n] = t.path;
+  return o === "elements" && typeof n == "string" ? ((s = e.get(n)) == null ? void 0 : s.state) === "removed" : (o === "slides" || o === "slideOrder") && typeof n == "string" ? ((c = r.get(n)) == null ? void 0 : c.state) === "removed" : !1;
+}
+function de(t, e, r) {
+  const [o, n] = e.path;
+  return o === "elements" && r.elements.has(n) || (o === "slides" || o === "slideOrder") && r.slides.has(n) ? !0 : Xe(t, e);
+}
+function fe(t, e, r) {
+  return !!t.elements[e] || !!t.slides[e] || r.elements.has(e) || r.slides.has(e);
+}
+function ue(t, e, r, o) {
+  var a, f;
+  const n = [], s = [], c = U([], o);
+  let d = !1;
+  for (const i of r.patches) {
+    const h = Y(i), m = T(i), S = Z(i), b = ee(i);
+    if (h) {
+      if (h.state === "removed") {
+        const I = e.elementLifecycles.get(h.id);
+        if ((I == null ? void 0 : I.stamp.replicaId) === r.replicaId && !j(r.stamp, I)) continue;
+        const p = Te(t, i);
+        p && n.push(p), s.push(i), p && p !== i && s.push(p);
+        continue;
+      }
+      if (!j(r.stamp, e.elementLifecycles.get(h.id))) continue;
+      const v = i.value.parent;
+      if (((a = e.slideLifecycles.get(v)) == null ? void 0 : a.state) === "removed" || ((f = e.elementLifecycles.get(v)) == null ? void 0 : f.state) === "removed") {
+        s.push({ ...i, op: "remove" });
+        continue;
+      }
+      fe(t, v, c) || (d = !0), t.elements[h.id] || (n.push(i), Object.keys(i.value.records).forEach((I) => c.elements.add(I))), s.push(i);
+      continue;
+    }
+    if (m) {
+      if (!j(r.stamp, e.slideLifecycles.get(m.id))) continue;
+      if (m.state === "removed") {
+        const v = Fe(t, i);
+        v && n.push(v), s.push(v ?? i);
+        continue;
+      }
+      t.slides[m.id] || (n.push(i), c.slides.add(m.id), Object.keys(i.value.records).forEach((v) => c.elements.add(v))), s.push(i);
+      continue;
+    }
+    if (b) {
+      const v = i;
+      fe(t, v.value.parent, c) || (d = !0);
+      const I = new Set([...e.elementLifecycles].flatMap(([w, l]) => l.state === "removed" ? [w] : [])), p = new Set(v.value.affected.filter((w) => !j(r.stamp, e.registers.get(z(w))))), y = Ne(v, p), E = y && Re(
+        t,
+        y,
+        I
+      );
+      if (E) {
+        const w = E.value.records[E.path[1]] === null, l = ze(t, E, (u, g) => {
+          const M = g === "order" ? ["elements", u, "order"] : ["elements", u, "ovr", g], O = e.registers.get(JSON.stringify(M));
+          return w && (O == null ? void 0 : O.kind) === "hierarchy" || j(r.stamp, O);
+        });
+        n.push(l), s.push(l), Object.entries(l.value.records).forEach(([u, g]) => {
+          g && c.elements.add(u);
+        });
+      }
+      continue;
+    }
+    if (S) {
+      if (!j(r.stamp, e.slideMoves.get(S.id))) continue;
+      ae(i, e.elementLifecycles, e.slideLifecycles) ? s.push(i) : de(t, i, c) ? (n.push(i), s.push(i)) : d = !0;
+      continue;
+    }
+    j(r.stamp, e.registers.get(W(i))) && (ae(i, e.elementLifecycles, e.slideLifecycles) ? s.push(i) : de(t, i, c) ? (n.push(i), s.push(i)) : d = !0);
+  }
+  return { accepted: n, recorded: s, missingDependency: d, availability: c };
+}
+function Ge(t, e, r) {
+  const o = t.filter((s) => e.has(s));
+  o.push(...[...e].filter((s) => !o.includes(s)).sort());
+  const n = [...r.entries()].sort((s, c) => D(s[1].stamp, c[1].stamp) || s[1].ordinal - c[1].ordinal || (s[0] < c[0] ? -1 : s[0] === c[0] ? 0 : 1));
+  for (const [s, c] of n) {
+    const d = o.indexOf(s);
+    if (d < 0) continue;
+    o.splice(d, 1);
+    const a = c.after === null ? -1 : o.indexOf(c.after);
+    o.splice(a < 0 && c.after !== null ? o.length : a + 1, 0, s);
+  }
+  return o;
+}
+function He(t, e) {
+  const r = [...t], o = [];
+  for (let n = 0; n < e.length; n++) {
+    const s = e[n], c = e[n - 1] ?? null, d = r.indexOf(s);
+    if ((d > 0 ? r[d - 1] : null) === c) continue;
+    r.splice(d, 1);
+    const f = c === null ? -1 : r.indexOf(c);
+    r.splice(f + 1, 0, s), o.push({ op: "move", path: ["slideOrder", s], value: { after: c }, origin: "collab-order" });
+  }
+  return o;
+}
+function We(t, e, r) {
+  const o = /* @__PURE__ */ new Map(), n = [], s = [];
+  for (const h of r)
+    if (!Z(h))
+      if (h.path.length === 2 && h.path[0] === "slides" && (h.op === "insert" || h.op === "remove")) {
+        const m = structuredClone(h);
+        m.op === "insert" ? o.set(m.path[1], m) : n.push(m);
+      } else s.push(h);
+  const c = new Set(n.map((h) => h.path[1])), d = t.filter((h) => !c.has(h)), a = e.filter((h) => !o.has(h)), f = He(d, a), i = [];
+  for (let h = 0; h < e.length; h++) {
+    const m = e[h], S = o.get(m);
+    S && i.push({
+      ...S,
+      value: { ...S.value, after: e[h - 1] ?? null }
+    });
+  }
+  return [...n, ...f, ...i, ...s];
+}
+const G = /* @__PURE__ */ new WeakMap(), Ke = 1e4;
+function pe(t, e) {
+  if (!t || t.length > 128 || /[\0-\x1f\x7f]/.test(t))
+    throw new Error(`${e} 必须是 1–128 个不含控制字符的字符`);
+}
+function Ve(t, e, r) {
+  const o = t.doc.identity.allocation;
+  return {
+    documentId: e.documentId,
+    replicaId: e.replicaId,
+    replicaSlot: e.replicaSlot,
+    registers: new Map(r == null ? void 0 : r.registers.map(([n, s]) => [n, structuredClone(s)])),
+    elementLifecycles: new Map(structuredClone((r == null ? void 0 : r.elementLifecycles) ?? [])),
+    slideLifecycles: new Map(structuredClone((r == null ? void 0 : r.slideLifecycles) ?? [])),
+    slideMoves: new Map(structuredClone((r == null ? void 0 : r.slideMoves) ?? [])),
+    seen: be(r == null ? void 0 : r.seen),
+    baseSlideOrder: r ? [...r.baseSlideOrder] : [...t.doc.slideOrder],
+    deferred: (r == null ? void 0 : r.deferred.map((n) => structuredClone(n))) ?? [],
+    clock: o.clock,
+    sequence: o.sequence,
+    active: !1
+  };
+}
+function Ue(t) {
+  return structuredClone({
+    version: 1,
+    documentId: t.documentId,
+    replicaId: t.replicaId,
+    replicaSlot: t.replicaSlot,
+    clock: t.clock,
+    sequence: t.sequence,
+    baseSlideOrder: t.baseSlideOrder,
+    registers: [...t.registers].map(([e, r]) => [e, r]),
+    elementLifecycles: [...t.elementLifecycles],
+    slideLifecycles: [...t.slideLifecycles],
+    slideMoves: [...t.slideMoves],
+    seen: Me(t.seen),
+    deferred: t.deferred
+  });
+}
+function Qe(t, e) {
+  if (t.active) throw new Error("同一个 Editor 已经绑定协同 provider");
+  if (t.documentId !== e.documentId || t.replicaId !== e.replicaId || t.replicaSlot !== e.replicaSlot)
+    throw new Error("同一个 Editor 不能切换协同文档或副本身份");
+}
+function Ze(t, e) {
+  if (!t || typeof t.subscribePatches != "function" || typeof t.applyExternalPatches != "function")
+    throw new Error("协同绑定需要支持外部补丁 seam 的 Editor");
+  if (pe(e.documentId, "documentId"), pe(e.replicaId, "replicaId"), !e.provider || typeof e.provider.send != "function" || typeof e.provider.subscribe != "function") throw new Error("provider 接口无效");
+  if (!Number.isSafeInteger(e.replicaSlot) || e.replicaSlot < 0 || e.replicaSlot >= 4096)
+    throw new Error("replicaSlot 必须是 0–4095 的整数");
+  let r = G.get(t);
+  const o = !r;
+  let n = null;
+  if (r) Qe(r, e);
+  else {
+    const l = t.doc.identity.allocation, u = (l == null ? void 0 : l.replicaId) === e.replicaId && l.slot === e.replicaSlot && l.count === 4096;
+    if (t.history.undoCount || t.history.redoCount || t.isDirty() && !u)
+      throw new Error("协同绑定必须在本地编辑开始前建立");
+    n = structuredClone(t.doc.identity);
+    try {
+      Se(t.doc, e.replicaId, e.replicaSlot);
+      const g = t.doc.identity.allocation;
+      if ((g.clock > 0 || g.sequence > 0) && !e.checkpoint)
+        throw new Error("恢复协同文档必须同时提供 CollaborationCheckpoint");
+      e.checkpoint && xe(e.checkpoint, e, g), r = Ve(t, e, e.checkpoint), G.set(t, r);
+    } catch (g) {
+      throw t.doc.identity = n, g;
+    }
+  }
+  const s = r, c = (l) => {
+    var u;
+    try {
+      (u = e.onError) == null || u.call(e, l);
+    } catch {
+    }
+  }, d = () => ({
+    registers: new Map(s.registers),
+    elementLifecycles: new Map(s.elementLifecycles),
+    slideLifecycles: new Map(s.slideLifecycles),
+    slideMoves: new Map(s.slideMoves),
+    seen: Oe(s.seen),
+    deferred: [...s.deferred],
+    clock: s.clock
+  }), a = (l) => {
+    s.registers.clear(), l.registers.forEach((u, g) => s.registers.set(g, u)), s.elementLifecycles.clear(), l.elementLifecycles.forEach((u, g) => s.elementLifecycles.set(g, u)), s.slideLifecycles.clear(), l.slideLifecycles.forEach((u, g) => s.slideLifecycles.set(g, u)), s.slideMoves.clear(), l.slideMoves.forEach((u, g) => s.slideMoves.set(g, u)), s.seen.clear(), l.seen.forEach((u, g) => s.seen.set(g, u)), s.deferred = [...l.deferred], s.clock = l.clock;
+  }, f = (l) => {
+    const u = Ae(l), g = new Set(t.doc.slideOrder);
+    for (const O of u) {
+      const x = T(O);
+      x && (x.state === "present" ? g.add(x.id) : g.delete(x.id));
+    }
+    const M = Ge(
+      s.baseSlideOrder,
+      g,
+      s.slideMoves
+    );
+    return We(t.doc.slideOrder, M, u);
+  }, i = (l, u) => {
+    const g = [], M = [];
+    let O = l, x = J(
+      t.doc,
+      f(u)
+    ), P = !0;
+    for (; P; ) {
+      P = !1;
+      const $ = [...s.deferred].sort((L, C) => D(L.message.stamp, C.message.stamp) || L.ordinal - C.ordinal), k = /* @__PURE__ */ new Map();
+      for (const L of $) {
+        const C = Ee(L.message), q = k.get(C) ?? [];
+        q.push(L), k.set(C, q);
+      }
+      const A = /* @__PURE__ */ new Set();
+      for (const L of k.values()) {
+        const C = L[0].message;
+        if (A.has(C.replicaId)) continue;
+        if (re(s.seen, C)) {
+          A.add(C.replicaId);
+          continue;
+        }
+        const q = ue(x, s, C, O);
+        if (q.missingDependency) {
+          A.add(C.replicaId);
+          continue;
+        }
+        const ge = d(), te = new Set(L);
+        X(s, q.recorded, C.stamp);
+        try {
+          x = J(t.doc, f([
+            ...u,
+            ...g,
+            ...q.accepted
+          ]));
+        } catch (F) {
+          a(ge), s.deferred = s.deferred.filter((ve) => !te.has(ve)), M.push(F), P = !0;
+          continue;
+        }
+        s.deferred = s.deferred.filter((F) => !te.has(F)), g.push(...q.accepted), O = U(q.accepted, O), P = !0;
+      }
+    }
+    return { patches: g, errors: M };
+  }, h = (l) => {
+    try {
+      if (he(l), l.documentId !== e.documentId || l.replicaId === e.replicaId) return;
+      if (l.identity.prefix !== t.doc.identity.prefix)
+        throw new Error("协同消息的文档身份前缀与本地基线不一致");
+      if (Ce(s.seen, l)) return;
+      const u = ue(t.doc, s, l), M = re(s.seen, l) || s.deferred.some((k) => k.message.replicaId === l.replicaId && k.message.sequence < l.sequence) || u.missingDependency ? l.patches.map((k, A) => ({ message: l, patch: k, ordinal: A })) : [];
+      if (s.deferred.length + M.length > Ke)
+        throw new Error("协同延迟补丁超过安全上限");
+      const O = t.doc.identity.allocation, x = d(), P = O.clock;
+      let $ = [];
+      try {
+        const k = Math.max(s.clock, l.stamp.clock);
+        s.clock = k, O.clock = k, ne(s.seen, l), M.length ? s.deferred.push(...M) : X(s, u.recorded, l.stamp), M.length || J(
+          t.doc,
+          f(u.accepted)
+        );
+        const A = M.length ? { patches: [], errors: [] } : i(U(u.accepted), u.accepted);
+        $ = A.errors;
+        const L = M.length ? [] : [...u.accepted, ...A.patches], C = f(L);
+        C.length ? t.applyExternalPatches(C, {
+          identity: l.identity,
+          origin: `collab:${l.replicaId}`,
+          label: l.label,
+          time: l.time
+        }) : t.applyExternalPatches([], {
+          identity: l.identity,
+          origin: `collab:${l.replicaId}`
+        });
+      } catch (k) {
+        throw a(x), O.clock = P, k;
+      }
+      $.forEach(c);
+    } catch (u) {
+      c(u);
+    }
+  }, m = /* @__PURE__ */ new Map(), S = (l) => {
+    if (!s.active || l.source === "external" || !l.patches.length) return;
+    const u = l.identity.allocation;
+    if (!u || u.replicaId !== e.replicaId || u.slot !== e.replicaSlot) {
+      c(new Error("本地补丁缺少匹配的协同身份版本"));
+      return;
+    }
+    if (u.clock <= s.clock || u.sequence <= s.sequence) {
+      c(new Error("协同逻辑时钟或消息序号已耗尽"));
+      return;
+    }
+    s.clock = u.clock, s.sequence = u.sequence;
+    const g = { clock: u.clock, replicaId: e.replicaId }, M = u.sequence;
+    X(s, l.patches, g);
+    const O = {
+      version: 1,
+      documentId: e.documentId,
+      replicaId: e.replicaId,
+      sequence: M,
+      stamp: g,
+      patches: l.patches,
+      identity: l.identity,
+      label: l.label,
+      time: l.time
+    };
+    ne(s.seen, O), m.set(M, O);
+  }, b = (l) => {
+    var M;
+    if (!s.active || l.source === "external" || !l.patches.length) return;
+    const u = (M = l.identity.allocation) == null ? void 0 : M.sequence, g = u === void 0 ? void 0 : m.get(u);
+    if (!g) {
+      c(new Error("本地补丁缺少 recovery 前协同 checkpoint"));
+      return;
+    }
+    m.delete(g.sequence);
+    try {
+      const O = e.provider.send(structuredClone(g));
+      O && typeof O.then == "function" && O.catch(c);
+    } catch (O) {
+      c(O);
+    }
+  };
+  let v = null, I = null, p = null;
+  const y = [];
+  let E = !1, w = !1;
+  try {
+    v = t.subscribePatches(S, { phase: "before-recovery" }), I = t.subscribePatches(b);
+    const l = e.provider.subscribe((u) => {
+      w || (E ? h(u) : y.push(structuredClone(u)));
+    });
+    if (typeof l != "function") throw new Error("provider.subscribe 必须返回取消订阅函数");
+    p = l, s.active = !0, E = !0;
+    for (const u of y) h(u);
+  } catch (l) {
+    try {
+      v == null || v();
+    } catch {
+    }
+    try {
+      I == null || I();
+    } catch {
+    }
+    try {
+      p == null || p();
+    } catch {
+    }
+    throw o && n && (t.doc.identity = n, G.delete(t)), l;
+  }
+  return {
+    documentId: e.documentId,
+    replicaId: e.replicaId,
+    editor: t,
+    checkpoint: () => Ue(s),
+    dispose() {
+      if (!w) {
+        w = !0, s.active = !1, E = !1, y.length = 0, m.clear();
+        try {
+          v == null || v();
+        } catch (l) {
+          c(l);
+        }
+        try {
+          I == null || I();
+        } catch (l) {
+          c(l);
+        }
+        try {
+          p == null || p();
+        } catch (l) {
+          c(l);
+        }
+      }
+    }
+  };
+}
+class et {
+  constructor(e, r = globalThis.BroadcastChannel) {
+    if (this.listeners = /* @__PURE__ */ new Set(), this.disposed = !1, this.receive = (o) => {
+      for (const n of [...this.listeners]) n(o.data);
+    }, typeof e != "string" || !e) throw new Error("BroadcastChannel 名称不能为空");
+    if (typeof r != "function") throw new Error("当前环境不支持 BroadcastChannel");
+    this.channel = new r(e), this.channel.addEventListener("message", this.receive);
+  }
+  send(e) {
+    if (this.disposed) throw new Error("BroadcastChannel provider 已释放");
+    this.channel.postMessage(e);
+  }
+  subscribe(e) {
+    if (this.disposed) throw new Error("BroadcastChannel provider 已释放");
+    if (typeof e != "function") throw new Error("协同消息订阅者必须是函数");
+    return this.listeners.add(e), () => {
+      this.listeners.delete(e);
+    };
+  }
+  dispose() {
+    this.disposed || (this.disposed = !0, this.channel.removeEventListener("message", this.receive), this.listeners.clear(), this.channel.close());
+  }
+}
+export {
+  et as BroadcastChannelCollabProvider,
+  Ze as bindCollaboration
+};