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

package/dist/evaluate.d.ts

@@ -1,6 +1,8 @@
 import type { EditDoc, Patch } from '@web-ppt/edit-core';
+import { stageExternalPatches } from '@web-ppt/edit-core';
 import type { CollaborationSession } from './state';
 import type { CollabMessage } from './types';
+export { stageExternalPatches };
 export interface PatchAvailability {
     readonly elements: Set<string>;
     readonly slides: Set<string>;
@@ -13,4 +15,4 @@ export interface EvaluatedMessage {
 }
 export declare function patchAvailability(patches: readonly Patch[], seed?: PatchAvailability): PatchAvailability;
 /** 纯读求值；任一依赖缺失时调用方必须延迟整条消息，不能提交其中的结构子集。 */
-export declare function evaluateRemoteMessage(doc: EditDoc, session: CollaborationSession, raw: CollabMessage, seed?: PatchAvailability): EvaluatedMessage;
+export declare function evaluateRemoteMessage(doc: EditDoc, session: CollaborationSession, raw: CollabMessage, seed?: PatchAvailability, planned?: readonly Patch[]): EvaluatedMessage;

package/dist/extension-addresses.d.ts

@@ -0,0 +1,4 @@
+import type { EditDoc } from '@web-ppt/edit-core';
+import type { Register } from './state';
+/** 地址变化不产生字段写入；归并寄存器只能比较原 stamp，不能借用迁移声明的时钟。 */
+export declare function canonicalRegisters(doc: EditDoc, registers: Map<string, Register>): Map<string, Register>;

package/dist/message.d.ts

@@ -1,5 +1,7 @@
+import { isExtensionMigrationPatch } from '@web-ppt/edit-core';
 import type { Patch } from '@web-ppt/edit-core';
 import type { CollabMessage, CollabStamp } from './types';
+export { isExtensionMigrationPatch };
 export declare function compareStamp(left: CollabStamp, right: CollabStamp): number;
 export declare function assertCollabMessage(value: unknown): asserts value is CollabMessage;
 export declare const pathKey: (patch: Patch) => string;

package/dist/migration/copies.d.ts

@@ -0,0 +1,9 @@
+import type { EditDoc, ExtensionCopyInput, Patch, SlideTreeSnapshot } from '@web-ppt/edit-core';
+import type { Register } from '../state';
+export declare function copiedInputs(patches: readonly Patch[]): readonly ExtensionCopyInput[];
+/** 来源版本只在没有更新目标版本时继承；撤销复活不能重置目标已有的寄存器。 */
+export declare function recordCopiedInputs(registers: Map<string, Register>, patches: readonly Patch[]): void;
+/** 复活元素不构成字段写入；接收端已获胜的原操作不能被另一端的旧结构快照重置。 */
+export declare function rebaseCopiedPatches(doc: EditDoc, patches: readonly Patch[], registers: ReadonlyMap<string, Register>): Patch[];
+/** 按事务原顺序读取已执行命令；同批较早的真实写入可以提供版本，复制动作自身不能。 */
+export declare function captureCopiedInputs(doc: EditDoc, snapshot: SlideTreeSnapshot, previous: readonly Patch[], current: ReadonlyMap<string, Register>): readonly ExtensionCopyInput[];

package/dist/migration/evaluate.d.ts

@@ -0,0 +1,6 @@
+import type { EditDoc } from '@web-ppt/edit-core';
+import type { EvaluatedMessage, PatchAvailability } from '../evaluate';
+import type { CollaborationSession } from '../state';
+import type { CollabMessage } from '../types';
+/** 只在实际消费时裁决；延迟消息不能复用首次接收时已经过期的模型或寄存器。 */
+export declare function evaluateMigrationMessage(doc: EditDoc, session: CollaborationSession, raw: CollabMessage, seed?: PatchAvailability): EvaluatedMessage;

package/dist/migration/evidence.d.ts

@@ -0,0 +1,2 @@
+import type { CollabExtensionOperation } from '../types';
+export declare const evidence: WeakMap<import("..").CollabRegisterCheckpoint, CollabExtensionOperation>;

package/dist/migration/index.d.ts

@@ -0,0 +1,5 @@
+import type { Editor } from '@web-ppt/edit-core';
+import type { CollaborationBinding, CollaborationOptions } from '../types';
+export type { CollabExtensionOperation } from '../types';
+/** 可选迁移入口记录原操作；仍使用基础绑定的同一会话、时钟与原子接收批次。 */
+export declare function bindCollaboration(editor: Editor, options: CollaborationOptions): CollaborationBinding;

package/dist/migration/receipt-registers.d.ts

@@ -0,0 +1,4 @@
+import type { EditDoc, Patch } from '@web-ppt/edit-core';
+import type { Register } from '../state';
+/** 迁移元数据的运输时钟不能覆盖赢家原时钟；寄存器对象替换仍随基础事务快照一起回滚。 */
+export declare function recordReceiptWinners(doc: EditDoc, registers: Map<string, Register>, patches: readonly Patch[]): void;

package/dist/migration/resolve.d.ts

@@ -0,0 +1,4 @@
+import type { EditDoc, DocumentExtensionPatch, ExtensionMigrationInput } from '@web-ppt/edit-core';
+import type { Register } from '../state';
+/** 只有实际原操作可以裁决矛盾值；模型值和复制消息时钟都不能补造缺失的字段证据。 */
+export declare function resolveMigration(doc: EditDoc, declarations: readonly DocumentExtensionPatch[], registers: ReadonlyMap<string, Register>, arriving?: readonly ExtensionMigrationInput[], force?: boolean): DocumentExtensionPatch[] | undefined;

package/dist/migration.js

@@ -0,0 +1,412 @@
+import { readExtensionAddress as T, canonicalExtensionPatch as R, canonicalExtensionMigrationInputs as I, EXTENSION_MIGRATIONS as te, isExtensionMigrationPatch as z, readExtensionMigration as B, readExtensionCopies as H, rebaseExtensionCopySnapshot as se, stageExternalPatches as $, extensionMigrationPatches as ne, isExtensionAddressPatch as Q, setExtensionMigrationResolver as oe, refreshExtensionMigrations as re, canonicalExtensionPath as ie } from "@web-ppt/edit-core";
+import { c as O, e as _, r as ae, s as pe, m as ce, d as le, a as q, f as D, g as fe, p as ue } from "./binding-DoPW07so.js";
+const N = /* @__PURE__ */ new WeakMap(), K = (t, n) => t.op === n.op && (t.op === "del" || t.value === n.value), ge = (t, n) => t.length > n.length && n.every((o, i) => t[i] === o);
+function U(t, n, o, i = [], p = !1) {
+  var k, J;
+  if (!n.length) return;
+  const r = n.map((e) => ({
+    source: [e.path[3], e.path[4]],
+    address: e.op === "set" && typeof e.value == "string" ? e.value : ""
+  })), a = T(r[0].address).target, u = new Set(r.map((e) => JSON.stringify(e.source))), h = (e) => ge(e, a) || e[0] === "elements" && e[2] === "ovr" && e[3] === "extensions" && u.has(JSON.stringify([e[1], e[4]])), c = /* @__PURE__ */ new Map();
+  for (const e of i.filter((s) => h(s.path))) {
+    const s = JSON.stringify(e.path), l = c.get(s);
+    if (l && O(e.stamp, l.stamp) === 0 && !K(e, l)) return [];
+    (!l || O(e.stamp, l.stamp) > 0) && c.set(s, e);
+  }
+  const f = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Map(), v = [];
+  for (const [e, s] of o) {
+    const l = N.get(s);
+    if (s.kind !== "field") continue;
+    let y;
+    try {
+      y = JSON.parse(e);
+    } catch {
+      continue;
+    }
+    if (!Array.isArray(y) || !h(y)) continue;
+    if (!l) {
+      v.push({ path: y, op: "del", stamp: s.stamp });
+      continue;
+    }
+    const d = { path: y, ...l, stamp: s.stamp };
+    f.set(e, d);
+    const m = R(t, { ...d, origin: "migration" }), w = {
+      path: m.path,
+      ...l,
+      ...m.op === "set" ? { value: m.value } : {},
+      stamp: s.stamp
+    }, j = JSON.stringify(m.path), A = g.get(j);
+    (!A || O(s.stamp, A.stamp) > 0) && g.set(j, w);
+  }
+  if (v.length) {
+    const e = /* @__PURE__ */ new Map();
+    for (const s of I(t, { routes: r, inputs: [...c.values()] })) {
+      const l = JSON.stringify(s.path), y = e.get(l);
+      (!y || O(s.stamp, y.stamp) > 0) && e.set(l, s);
+    }
+    for (const s of I(t, { routes: r, inputs: v })) {
+      const l = e.get(JSON.stringify(s.path));
+      if (!l || O(l.stamp, s.stamp) <= 0) return [];
+    }
+  }
+  let S = !0;
+  const x = (e, s, l) => {
+    if (e !== void 0)
+      if (e && typeof e == "object")
+        for (const [y, d] of Object.entries(e)) x(d, [...s, y], l);
+      else {
+        const y = l.get(JSON.stringify(s));
+        if (!y || y.op !== "set" || y.value !== e) {
+          const d = JSON.stringify(s), m = c.get(d), w = o.get(d);
+          (!m || w && O(m.stamp, w.stamp) <= 0) && (S = !1);
+        }
+      }
+  };
+  for (const e of r) x(
+    (J = (k = t.elements[e.source[0]]) == null ? void 0 : k.ovr.extensions) == null ? void 0 : J[e.source[1]],
+    ["elements", e.source[0], "ovr", "extensions", e.source[1]],
+    f
+  );
+  let M = t.extensions;
+  for (const e of a.slice(2)) M = M == null ? void 0 : M[e];
+  if (x(M, [...a], g), !S) return [];
+  for (const [e, s] of c) {
+    const l = f.get(e);
+    if (l && O(s.stamp, l.stamp) === 0 && !K(s, l)) return [];
+    (!l || O(s.stamp, l.stamp) > 0) && f.set(e, s);
+  }
+  if (!f.size) return;
+  const C = [...f.values()].sort((e, s) => JSON.stringify(e.path) < JSON.stringify(s.path) ? -1 : 1), E = I(t, { routes: r, inputs: C }), b = /* @__PURE__ */ new Map();
+  let P = !1;
+  for (const [e, s] of E.entries()) {
+    const l = JSON.stringify(s.path), y = b.get(l);
+    if (y === void 0) {
+      b.set(l, e);
+      continue;
+    }
+    const d = O(s.stamp, E[y].stamp);
+    if (!K(s, E[y])) {
+      if (!d) return [];
+      P = !0;
+    }
+    d > 0 && b.set(l, e);
+  }
+  if (!P && !p && !c.size) return;
+  const W = { version: 1, routes: r, inputs: C, winners: [...b.values()] };
+  return [{
+    op: "set",
+    origin: "chart-shared",
+    path: ["document", "extensions", te, JSON.stringify(a)],
+    value: JSON.stringify(W)
+  }];
+}
+function V(t, n, o) {
+  for (const i of o.filter(z)) {
+    const p = B(i.op === "set" ? i.value : void 0), r = I(t, p);
+    for (const a of [...p.inputs, ...p.winners.map((u) => r[u])]) {
+      const u = JSON.stringify(a.path), h = n.get(u);
+      if (!a.stamp || h && O(a.stamp, h.stamp) < 0) continue;
+      const c = { stamp: a.stamp, kind: "field" }, f = a.op === "del" ? { op: "del" } : { op: "set", value: a.value };
+      n.set(u, c), N.set(c, f);
+    }
+  }
+}
+function G(t) {
+  return t.flatMap((n) => n.op === "insert" && n.path[0] === "slides" && n.path.length === 2 ? H(n.value) : []);
+}
+function Y(t, n) {
+  for (const o of G(n)) {
+    const i = JSON.stringify(o.path), p = t.get(i);
+    if (p && O(p.stamp, o.stamp) >= 0) continue;
+    const r = { kind: "field", stamp: { clock: o.stamp.clock, replicaId: o.stamp.replicaId } };
+    t.set(i, r), N.set(r, o.op === "del" ? { op: "del" } : { op: "set", value: o.value });
+  }
+}
+function de(t, n, o) {
+  return n.map((i) => {
+    if (i.op !== "insert" || i.path[0] !== "slides" || i.path.length !== 2) return i;
+    const p = i.value, r = new Map(H(p).map((h) => [JSON.stringify(h.path), h])), a = [];
+    for (const [h, c] of o) {
+      const f = N.get(c);
+      if (c.kind !== "field" || !f) continue;
+      let g;
+      try {
+        g = JSON.parse(h);
+      } catch {
+        continue;
+      }
+      if (!Array.isArray(g) || g[0] !== "elements" || g[2] !== "ovr" || g[3] !== "extensions" || !Object.prototype.hasOwnProperty.call(p.records, g[1])) continue;
+      const v = r.get(h);
+      if (v && O(c.stamp, v.stamp) <= 0) continue;
+      const S = { ...f, path: ["elements", g[1], "ovr", "extensions", g[4], ...g.slice(5)], origin: "migration" };
+      R(t, S).path[0] === "elements" && a.push(S);
+    }
+    const u = se(
+      t,
+      p,
+      a,
+      (h, c, f) => Z(h, c, f, o)
+    );
+    return u === p ? i : { ...i, value: u };
+  });
+}
+function Z(t, n, o, i) {
+  const p = new Map(i), r = t.identity.allocation, a = { clock: r.clock + 1, replicaId: r.replicaId };
+  for (const c of o) {
+    Y(p, [c]);
+    const f = R(t, c), g = f.path;
+    if (g[0] !== "elements" || g[2] !== "ovr" || g[3] !== "extensions" || g.length < 6 || f.op !== "set" && f.op !== "del") continue;
+    const v = { kind: "field", stamp: a };
+    p.set(JSON.stringify(g), v), N.set(v, f.op === "del" ? { op: "del" } : { op: "set", value: f.value });
+  }
+  const u = /* @__PURE__ */ new Map();
+  for (const [c, f] of p) {
+    if (f.kind !== "field" || !N.has(f)) continue;
+    let g;
+    try {
+      g = JSON.parse(c);
+    } catch {
+      continue;
+    }
+    if (!Array.isArray(g) || g[0] !== "elements" || g[2] !== "ovr" || g[3] !== "extensions" || g.length < 6) continue;
+    const v = u.get(g[1]) ?? [];
+    v.push({ path: g, register: f }), u.set(g[1], v);
+  }
+  const h = [];
+  for (const [c, f] of Object.entries(n.copySources ?? {}))
+    for (const { path: g, register: v } of u.get(f) ?? []) {
+      const S = N.get(v);
+      let x = n.records[c].ovr.extensions;
+      for (const M of g.slice(4)) x = x && typeof x == "object" && Object.prototype.hasOwnProperty.call(x, M) ? x[M] : void 0;
+      (S.op === "set" ? S.value !== x : x !== void 0) || h.push({ source: f, path: ["elements", c, ...g.slice(2)], ...S, stamp: v.stamp });
+    }
+  return h;
+}
+const L = (t) => Q(t) || z(t), F = (t) => !L(t) && (t.path[0] === "document" && t.path[1] === "extensions" || t.path[0] === "elements" && t.path[2] === "ovr" && t.path[3] === "extensions");
+function me(t, n, o, i) {
+  if (G(o.patches).some((e) => e.stamp.clock > o.stamp.clock))
+    throw new Error("扩展复制的原操作超过运输因果水位");
+  o = { ...o, patches: de(t, o.patches, n.registers) };
+  const p = o.patches.filter(z), r = /* @__PURE__ */ new Map(), a = (e, s = !1) => {
+    const l = e[0], y = T(l.op === "set" ? l.value : void 0).target, d = JSON.stringify(y), m = r.get(d) ?? { routes: [], paths: /* @__PURE__ */ new Map(), inputs: [], remote: s };
+    for (const w of e) {
+      const j = JSON.stringify(w.path), A = m.paths.get(j);
+      if (w.op !== "set" || A !== void 0 && A !== w.value) throw new Error("迁移凭据地址冲突");
+      A === void 0 && (m.routes.push(w), m.paths.set(j, w.value));
+    }
+    return m.remote || (m.remote = s), r.set(d, m), m;
+  };
+  let u = !1;
+  for (const e of o.patches)
+    if (!L(e)) u = !0;
+    else if (u) throw new Error("协同迁移声明必须先于字段和结构补丁");
+  for (const e of p)
+    try {
+      const s = B(e.op === "set" ? e.value : void 0), l = T(s.routes[0].address).target;
+      if (e.path.length !== 4 || e.path[3] !== JSON.stringify(l) || s.inputs.some((d) => !d.stamp || d.stamp.clock > o.stamp.clock)) throw new Error("缺少原版本");
+      if (I(t, s).some((d) => d.path.length <= l.length || l.some((m, w) => d.path[w] !== m)))
+        throw new Error("字段超出目标");
+      a(s.routes.map((d) => ({
+        op: "set",
+        origin: e.origin,
+        path: ["document", "extensions", "edit-addresses", ...d.source],
+        value: d.address
+      })), !0).inputs.push(...s.inputs);
+    } catch (s) {
+      throw new Error(`迁移凭据无法本地裁决：${String(s)}`);
+    }
+  let h = t;
+  const c = [], f = [];
+  if (o.patches.some((e) => e.op === "insert" && e.path[0] === "slides")) {
+    const e = _(
+      t,
+      n,
+      { ...o, patches: o.patches.filter((s) => !z(s)) },
+      i,
+      []
+    );
+    if (e.missingDependency && !p.length) return e;
+    if (!e.missingDependency) {
+      const s = e.accepted.filter((d) => !F(d) && !L(d)), l = {
+        ...n,
+        registers: new Map(n.registers),
+        elementLifecycles: new Map(n.elementLifecycles),
+        slideLifecycles: new Map(n.slideLifecycles),
+        slideMoves: new Map(n.slideMoves),
+        sectionMoves: new Map(n.sectionMoves),
+        onRecord: void 0
+      };
+      ae(l, e.recorded, o.stamp);
+      const y = new Set(t.slideOrder);
+      for (const d of s) {
+        const m = pe(d);
+        (m == null ? void 0 : m.state) === "present" ? y.add(m.id) : m && y.delete(m.id);
+      }
+      h = $(t, ce(
+        t.slideOrder,
+        le(n.baseSlideOrder, y, l.slideMoves),
+        s
+      ));
+      for (const d of s)
+        if (!(d.op !== "insert" || d.path[0] !== "slides" || d.path.length !== 2))
+          for (const m of Object.values(d.value.records))
+            for (const w of Object.keys(m.ovr.extensions ?? {})) c.push({
+              op: "del",
+              origin: "migration",
+              path: ["elements", m.id, "ovr", "extensions", w, "probe"]
+            });
+      f.push(...G(s).map(({ source: d, ...m }) => m));
+    }
+  }
+  const g = [...o.patches, ...c, ...[...r.values()].flatMap((e) => e.routes.map((s) => ({
+    op: "del",
+    origin: "migration",
+    path: ["elements", s.path[3], "ovr", "extensions", s.path[4], "probe"]
+  })))];
+  let v;
+  if (ne(h, g, (e, s) => {
+    try {
+      a(s);
+    } catch (l) {
+      v = l;
+    }
+    return [];
+  }), v) throw v;
+  const S = o.patches.filter((e) => F(e) && (e.op === "set" || e.op === "del")).map((e) => ({
+    path: e.path,
+    op: e.op,
+    stamp: o.stamp,
+    ...e.op === "set" ? { value: e.value } : {}
+  })), x = [...new Map(S.map((e) => [JSON.stringify(e.path), e])).values()], M = [];
+  for (const e of r.values()) {
+    const s = U(h, e.routes, n.registers, [...e.inputs, ...f, ...x], e.remote);
+    if (e.remote && !(s != null && s.length)) throw new Error("迁移凭据无法本地裁决：原操作证据不足或矛盾");
+    s && M.push(...s);
+  }
+  if (!M.length && !p.length) return r.size ? _(t, n, o, i, []) : _(t, n, o, i);
+  const C = o.patches.filter(Q), E = [...M, ...C], b = $(t, E), P = new Map(n.registers);
+  V(b, P, M);
+  const W = q(b, n.registers), k = q(b, P);
+  for (const e of o.patches.filter(F)) {
+    const s = R(b, e), l = JSON.stringify(s.path), y = k.get(l), d = W.get(l);
+    y && O(y.stamp, o.stamp) === 0 && (!d || O(o.stamp, d.stamp) > 0) && k.delete(l);
+  }
+  const J = _(
+    b,
+    { ...n, registers: k },
+    { ...o, patches: o.patches.filter((e) => !L(e)) },
+    i,
+    []
+  );
+  return { ...J, accepted: [...E, ...J.accepted], recorded: [...E, ...J.recorded] };
+}
+const ee = (t) => t[0] === "document" && t[1] === "extensions" && t[2] !== "edit-addresses" && t[2] !== "edit-migrations" && t.length >= 4 || (t[0] === "elements" || t[0] === "slides") && t[2] === "ovr" && t[3] === "extensions" && t.length >= 6;
+function X(t) {
+  var r, a;
+  if (!t || typeof t != "object" || ![Object.prototype, null].includes(Object.getPrototypeOf(t)))
+    throw new Error("协同扩展字段的原操作无效");
+  const n = Object.getOwnPropertyDescriptors(t), o = Reflect.ownKeys(n);
+  if (o.some((u) => u !== "op" && u !== "value") || Object.values(n).some((u) => !u.enumerable || !("value" in u)))
+    throw new Error("协同扩展字段的原操作无效");
+  const i = (r = n.op) == null ? void 0 : r.value, p = (a = n.value) == null ? void 0 : a.value;
+  if (i === "del" && o.length === 1) return { op: i };
+  if (i === "set" && o.length === 2 && (p === null || typeof p == "boolean" || typeof p == "number" && Number.isFinite(p) || typeof p == "string" && p.length <= 1e6)) return { op: i, value: p };
+  throw new Error("协同扩展字段的原操作无效");
+}
+function he(t) {
+  var p;
+  const n = t == null ? void 0 : t.extensionOperations;
+  if (n === void 0) return /* @__PURE__ */ new Map();
+  if (!Array.isArray(n) || n.length > 1e5 || !Array.isArray(t.registers))
+    throw new Error("协同扩展字段的原操作列表无效");
+  const o = new Map(t.registers), i = /* @__PURE__ */ new Map();
+  for (const r of n) {
+    if (!Array.isArray(r) || r.length !== 2 || typeof r[0] != "string" || i.has(r[0]) || ((p = o.get(r[0])) == null ? void 0 : p.kind) !== "field")
+      throw new Error("协同扩展字段的原操作缺少唯一原寄存器");
+    let a;
+    try {
+      a = JSON.parse(r[0]);
+    } catch {
+      throw new Error("协同扩展字段的原操作路径无效");
+    }
+    if (!Array.isArray(a) || !ee(a) || a.length > 21 || a.some((u) => typeof u != "string" || !u || u.length > 1024 || ["__proto__", "constructor", "prototype"].includes(u)))
+      throw new Error("协同扩展字段的原操作路径无效");
+    i.set(r[0], X(r[1]));
+  }
+  return i;
+}
+function ye(t, n, o) {
+  for (const i of n) {
+    if (!ee(i.path) || i.op !== "set" && i.op !== "del") continue;
+    const p = ue(i), r = t.registers.get(p);
+    if ((r == null ? void 0 : r.kind) !== "field" || O(r.stamp, o) !== 0) continue;
+    const a = i.op === "del" ? { op: "del" } : { op: "set", value: i.value };
+    N.set(r, X(a));
+  }
+}
+function ve(t, n) {
+  const o = /* @__PURE__ */ new Map();
+  for (const [i, p] of n) {
+    let r = i, a = N.get(p);
+    if (i.startsWith('["elements",'))
+      try {
+        const h = JSON.parse(i);
+        if (r = JSON.stringify(ie(t, h)), a) {
+          const c = R(t, { ...a, path: h, origin: "collab" }), f = c.op === "set" ? { op: "set", value: c.value } : { op: "del" };
+          a = X(f);
+        }
+      } catch (h) {
+        if (a) throw h;
+        r = i;
+      }
+    const u = o.get(r);
+    if (!u || O(p.stamp, u.register.stamp) > 0) o.set(r, { register: p, operation: a });
+    else if (O(p.stamp, u.register.stamp) === 0 && a && u.operation && JSON.stringify(a) !== JSON.stringify(u.operation))
+      throw new Error("协同扩展字段的同版本原操作冲突");
+  }
+  return [...o].flatMap(([i, p]) => p.operation ? [[i, p.operation]] : []).sort(([i], [p]) => i < p ? -1 : i > p ? 1 : 0);
+}
+function xe(t, n) {
+  let o;
+  try {
+    o = D(t);
+  } catch {
+  }
+  const i = o ? /* @__PURE__ */ new Map() : he(n.checkpoint), p = fe(t, { ...n, provider: {
+    send: (r) => n.provider.send(r),
+    subscribe(r) {
+      const a = D(t), u = a.onRecord;
+      for (const [c, f] of i)
+        N.set(a.registers.get(c), f);
+      a.onRecord = (c, f) => {
+        u == null || u(c, f), Y(a.registers, c), V(t.doc, a.registers, c), ye(a, c, f);
+      };
+      const h = oe(
+        t.doc,
+        (c, f) => U(c, f, a.registers),
+        (c, f, g) => Z(c, f, g, a.registers)
+      );
+      try {
+        const c = n.provider.subscribe(r);
+        if (typeof c != "function") throw new Error("provider.subscribe 必须返回取消订阅函数");
+        return () => {
+          h(), a.onRecord = u, c();
+        };
+      } catch (c) {
+        throw h(), a.onRecord = u, c;
+      }
+    }
+  } }, me);
+  try {
+    re(t.doc);
+  } catch (r) {
+    throw p.dispose(), r;
+  }
+  return { ...p, checkpoint() {
+    const r = p.checkpoint(), a = ve(t.doc, D(t).registers);
+    return { ...r, extensionOperations: structuredClone(a) };
+  } };
+}
+export {
+  xe as bindCollaboration
+};

package/dist/section-conflict.d.ts

@@ -0,0 +1,3 @@
+import type { EditDoc, SectionStatePatch } from '@web-ppt/edit-core';
+/** 把远端完整快照收窄成一个节操作，避免覆盖接收端的并发页面成员和其他节。 */
+export declare function rebaseSectionStatePatch(doc: EditDoc, patch: SectionStatePatch): SectionStatePatch | null;

package/dist/section-order.d.ts

@@ -0,0 +1,4 @@
+import type { Patch } from '@web-ppt/edit-core';
+import type { SectionMove } from './state';
+/** 用全量节顺序意图重写批次最后一个节快照，使不同目标的并发移动也与到达顺序无关。 */
+export declare function materializeSectionOrder(base: readonly string[], moves: ReadonlyMap<string, SectionMove>, patches: Patch[]): Patch[];

package/dist/slide-conflict.d.ts

@@ -1,3 +1,5 @@
 import type { EditDoc, SlideTreePatch } from '@web-ppt/edit-core';
+/** 节删除胜过并发复制的旧归属；页面本身仍可插入，降级为未分节。 */
+export declare function rebaseSlideInsertion(doc: EditDoc, patch: SlideTreePatch): SlideTreePatch;
 /** 远端删页必须以接收端当前整页闭包落模，否则并发新增元素会变成孤儿。 */
 export declare function rebaseSlideRemoval(doc: EditDoc, patch: SlideTreePatch): SlideTreePatch | null;

package/dist/state.d.ts

@@ -1,11 +1,8 @@
 import type { EditDoc, Patch } from '@web-ppt/edit-core';
 import type { SeenMap } from './seen';
-import type { CollabMessage, CollabStamp } from './types';
+import type { CollabMessage, CollabStamp, CollabRegisterCheckpoint } from './types';
 export declare const hierarchyKey: (id: string) => string;
-export type Register = {
-    readonly stamp: CollabStamp;
-    readonly kind: 'field' | 'hierarchy';
-};
+export type Register = CollabRegisterCheckpoint;
 export type Lifecycle = {
     readonly stamp: CollabStamp;
     readonly state: 'present' | 'removed';
@@ -15,6 +12,7 @@ export type SlideMove = {
     readonly after: string | null;
     readonly ordinal: number;
 };
+export type SectionMove = SlideMove;
 export interface DeferredPatch {
     readonly message: CollabMessage;
     readonly patch: Patch;
@@ -28,12 +26,15 @@ export interface CollaborationSession {
     readonly elementLifecycles: Map<string, Lifecycle>;
     readonly slideLifecycles: Map<string, Lifecycle>;
     readonly slideMoves: Map<string, SlideMove>;
+    readonly sectionMoves: Map<string, SectionMove>;
     readonly seen: SeenMap;
     readonly baseSlideOrder: readonly string[];
+    readonly baseSectionOrder: readonly string[];
     deferred: DeferredPatch[];
     clock: number;
     sequence: number;
     active: boolean;
+    onRecord?: (patches: readonly Patch[], stamp: CollabStamp) => void;
 }
 export declare const elementLifecycle: (patch: Patch) => {
     id: string;
@@ -47,6 +48,10 @@ export declare const slideMove: (patch: Patch) => {
     id: string;
     after: string | null;
 } | null;
+export declare const sectionMove: (patch: Patch) => {
+    id: string;
+    after: string | null;
+} | null;
 export declare const elementHierarchy: (patch: Patch) => Readonly<Record<string, unknown>> | null;
 export declare const newer: (stamp: CollabStamp, current?: {
     stamp: CollabStamp;

package/dist/table-conflict.d.ts

@@ -0,0 +1,9 @@
+import type { EditDoc, Patch } from '@web-ppt/edit-core';
+import type { CollaborationSession } from './state';
+import type { CollabStamp } from './types';
+export interface RebasedTablePatches {
+    readonly accepted: Patch[];
+    readonly recorded: Patch[];
+}
+/** tombstone 只控制可见性；字段继续独立收敛，撤销后才能恢复同一身份的完整状态。 */
+export declare function rebaseTablePatches(doc: EditDoc, session: CollaborationSession, stamp: CollabStamp, patches: readonly Patch[]): RebasedTablePatches;

package/dist/types.d.ts

@@ -11,6 +11,12 @@ export interface CollabRegisterCheckpoint {
     readonly stamp: CollabStamp;
     readonly kind: 'field' | 'hierarchy';
 }
+export type CollabExtensionOperation = {
+    readonly op: 'set';
+    readonly value: string | number | boolean | null;
+} | {
+    readonly op: 'del';
+};
 export interface CollabSlideMoveCheckpoint {
     readonly stamp: CollabStamp;
     readonly after: string | null;
@@ -38,12 +44,17 @@ export interface CollaborationCheckpoint {
     readonly clock: number;
     readonly sequence: number;
     readonly baseSlideOrder: readonly string[];
+    /** 旧 checkpoint 没有节排序元数据；恢复时以已恢复模型为基线。 */
+    readonly baseSectionOrder?: readonly string[];
     readonly registers: readonly (readonly [string, CollabRegisterCheckpoint])[];
     readonly elementLifecycles: readonly (readonly [string, CollabLifecycleCheckpoint])[];
     readonly slideLifecycles: readonly (readonly [string, CollabLifecycleCheckpoint])[];
     readonly slideMoves: readonly (readonly [string, CollabSlideMoveCheckpoint])[];
+    readonly sectionMoves?: readonly (readonly [string, CollabSlideMoveCheckpoint])[];
     readonly seen: readonly CollabSeenCheckpoint[];
     readonly deferred: readonly CollabDeferredCheckpoint[];
+    /** 可选 migration 入口保留原操作；缺省表示证据未知，不能把缺失值猜成 del。 */
+    readonly extensionOperations?: readonly (readonly [string, CollabExtensionOperation])[];
 }
 /** 一条消息对应一个已经原子落模的 Editor 补丁批次。 */
 export interface CollabMessage {

package/package.json

@@ -1,8 +1,16 @@
 {
   "name": "@web-ppt/collab",
-  "version": "0.5.0-beta.2",
+  "version": "0.5.0",
   "description": "Optional field-level LWW collaboration adapter for @web-ppt/edit-core with pluggable providers.",
-  "keywords": ["pptx", "powerpoint", "collaboration", "offline", "lww", "browser", "typescript"],
+  "keywords": [
+    "pptx",
+    "powerpoint",
+    "collaboration",
+    "offline",
+    "lww",
+    "browser",
+    "typescript"
+  ],
   "license": "MIT",
   "author": "unStone",
   "homepage": "https://github.com/unStone/web-ppt#readme",
@@ -21,16 +29,27 @@
       "types": "./dist/index.d.ts",
       "import": "./dist/collab.js"
     },
+    "./migration": {
+      "types": "./dist/migration/index.d.ts",
+      "import": "./dist/migration.js"
+    },
     "./package.json": "./package.json"
   },
-  "files": ["dist", "README.md", "CHANGELOG.md", "LICENSE"],
+  "files": [
+    "dist",
+    "README.md",
+    "CHANGELOG.md",
+    "LICENSE"
+  ],
   "scripts": {
     "build": "vite build && tsc -p tsconfig.build.json",
     "prepublishOnly": "npm run build",
     "prepack": "node ../../tooling/sync-package-docs.mjs"
   },
   "peerDependencies": {
-    "@web-ppt/edit-core": "^0.5.0-beta.2"
+    "@web-ppt/edit-core": "^0.5.0"
   },
-  "publishConfig": { "access": "public" }
+  "publishConfig": {
+    "access": "public"
+  }
 }