arethesis 0.2.0 → 0.2.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +34 -0
- package/README.md +3 -2
- package/dist/arethesis.js +2 -222
- package/dist/binding/data-binder.d.ts +8 -0
- package/dist/binding/data-binder.d.ts.map +1 -1
- package/dist/binding/data-binder.js +605 -0
- package/dist/binding/data-binder.js.map +1 -0
- package/dist/binding/types.d.ts +20 -0
- package/dist/binding/types.d.ts.map +1 -1
- package/dist/binding/validation-engine.js +160 -0
- package/dist/binding/validation-engine.js.map +1 -0
- package/dist/cdn/arethesis.min.js +2 -0
- package/dist/cdn/arethesis.min.js.map +1 -0
- package/dist/cdn/chunks/CdTL-MEv.min.js +3 -0
- package/dist/cdn/chunks/CdTL-MEv.min.js.map +1 -0
- package/dist/cdn/components.min.js +81 -0
- package/dist/cdn/components.min.js.map +1 -0
- package/dist/collab/index.d.ts +22 -0
- package/dist/collab/index.d.ts.map +1 -0
- package/dist/collab/index.js +23 -0
- package/dist/collab/index.js.map +1 -0
- package/dist/components/component.d.ts +17 -0
- package/dist/components/component.d.ts.map +1 -1
- package/dist/components/component.js +765 -0
- package/dist/components/component.js.map +1 -0
- package/dist/components/decorators.js +27 -0
- package/dist/components/decorators.js.map +1 -0
- package/dist/components/form-associated.d.ts +55 -0
- package/dist/components/form-associated.d.ts.map +1 -0
- package/dist/components/form-associated.js +180 -0
- package/dist/components/form-associated.js.map +1 -0
- package/dist/components/runtime.d.ts +2 -0
- package/dist/components/runtime.d.ts.map +1 -1
- package/dist/components/runtime.js +18 -0
- package/dist/components/runtime.js.map +1 -0
- package/dist/components/template-loader.js +90 -0
- package/dist/components/template-loader.js.map +1 -0
- package/dist/components.js +2 -2810
- package/dist/core/arethesis.d.ts +13 -9
- package/dist/core/arethesis.d.ts.map +1 -1
- package/dist/core/arethesis.js +249 -0
- package/dist/core/arethesis.js.map +1 -0
- package/dist/core/hooks.d.ts +19 -0
- package/dist/core/hooks.d.ts.map +1 -0
- package/dist/core/hooks.js +23 -0
- package/dist/core/hooks.js.map +1 -0
- package/dist/core/index.d.ts +57 -0
- package/dist/core/index.d.ts.map +1 -0
- package/dist/core/index.js +25 -0
- package/dist/data/list-view-registry.js +300 -0
- package/dist/data/list-view-registry.js.map +1 -0
- package/dist/data/object-store.js +280 -0
- package/dist/data/object-store.js.map +1 -0
- package/dist/data/optimistic-updates.js +168 -0
- package/dist/data/optimistic-updates.js.map +1 -0
- package/dist/data/persistence-manager.js +233 -0
- package/dist/data/persistence-manager.js.map +1 -0
- package/dist/defaults.d.ts +1 -0
- package/dist/defaults.d.ts.map +1 -0
- package/dist/defaults.js +17 -0
- package/dist/defaults.js.map +1 -0
- package/dist/http/auth-manager.js +260 -0
- package/dist/http/auth-manager.js.map +1 -0
- package/dist/http/http-client.d.ts +7 -0
- package/dist/http/http-client.d.ts.map +1 -1
- package/dist/http/http-client.js +501 -0
- package/dist/http/http-client.js.map +1 -0
- package/dist/http/http-error.js +53 -0
- package/dist/http/http-error.js.map +1 -0
- package/dist/http/mapping.js +64 -0
- package/dist/http/mapping.js.map +1 -0
- package/dist/index.d.ts +3 -58
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +55 -0
- package/dist/kit/calendar.d.ts +43 -0
- package/dist/kit/calendar.d.ts.map +1 -0
- package/dist/kit/calendar.js +423 -0
- package/dist/kit/calendar.js.map +1 -0
- package/dist/kit/cell-editor.js +191 -0
- package/dist/kit/cell-editor.js.map +1 -0
- package/dist/kit/chart.d.ts +2 -0
- package/dist/kit/chart.d.ts.map +1 -1
- package/dist/kit/chart.js +541 -0
- package/dist/kit/chart.js.map +1 -0
- package/dist/kit/combobox.d.ts +57 -0
- package/dist/kit/combobox.d.ts.map +1 -0
- package/dist/kit/combobox.js +379 -0
- package/dist/kit/combobox.js.map +1 -0
- package/dist/kit/command-palette.d.ts +2 -0
- package/dist/kit/command-palette.d.ts.map +1 -1
- package/dist/kit/command-palette.js +315 -0
- package/dist/kit/command-palette.js.map +1 -0
- package/dist/kit/data-table.d.ts +11 -0
- package/dist/kit/data-table.d.ts.map +1 -1
- package/dist/kit/data-table.js +373 -0
- package/dist/kit/data-table.js.map +1 -0
- package/dist/kit/dialog.d.ts +31 -0
- package/dist/kit/dialog.d.ts.map +1 -0
- package/dist/kit/dialog.js +157 -0
- package/dist/kit/dialog.js.map +1 -0
- package/dist/kit/elements/calendar.d.ts +3 -0
- package/dist/kit/elements/calendar.d.ts.map +1 -0
- package/dist/kit/elements/calendar.js +11 -0
- package/dist/kit/elements/calendar.js.map +1 -0
- package/dist/kit/elements/chart.d.ts +3 -0
- package/dist/kit/elements/chart.d.ts.map +1 -0
- package/dist/kit/elements/chart.js +11 -0
- package/dist/kit/elements/chart.js.map +1 -0
- package/dist/kit/elements/combobox.d.ts +3 -0
- package/dist/kit/elements/combobox.d.ts.map +1 -0
- package/dist/kit/elements/combobox.js +11 -0
- package/dist/kit/elements/combobox.js.map +1 -0
- package/dist/kit/elements/command-palette.d.ts +3 -0
- package/dist/kit/elements/command-palette.d.ts.map +1 -0
- package/dist/kit/elements/command-palette.js +11 -0
- package/dist/kit/elements/command-palette.js.map +1 -0
- package/dist/kit/elements/data-table.d.ts +3 -0
- package/dist/kit/elements/data-table.d.ts.map +1 -0
- package/dist/kit/elements/data-table.js +11 -0
- package/dist/kit/elements/data-table.js.map +1 -0
- package/dist/kit/elements/dialog.d.ts +4 -0
- package/dist/kit/elements/dialog.d.ts.map +1 -0
- package/dist/kit/elements/dialog.js +11 -0
- package/dist/kit/elements/dialog.js.map +1 -0
- package/dist/kit/elements/flex-view.d.ts +3 -0
- package/dist/kit/elements/flex-view.d.ts.map +1 -0
- package/dist/kit/elements/flex-view.js +11 -0
- package/dist/kit/elements/flex-view.js.map +1 -0
- package/dist/kit/elements/form.d.ts +3 -0
- package/dist/kit/elements/form.d.ts.map +1 -0
- package/dist/kit/elements/form.js +11 -0
- package/dist/kit/elements/form.js.map +1 -0
- package/dist/kit/elements/kanban.d.ts +3 -0
- package/dist/kit/elements/kanban.d.ts.map +1 -0
- package/dist/kit/elements/kanban.js +11 -0
- package/dist/kit/elements/kanban.js.map +1 -0
- package/dist/kit/elements/list.d.ts +3 -0
- package/dist/kit/elements/list.d.ts.map +1 -0
- package/dist/kit/elements/list.js +11 -0
- package/dist/kit/elements/list.js.map +1 -0
- package/dist/kit/elements/markdown-editor.d.ts +3 -0
- package/dist/kit/elements/markdown-editor.d.ts.map +1 -0
- package/dist/kit/elements/markdown-editor.js +11 -0
- package/dist/kit/elements/markdown-editor.js.map +1 -0
- package/dist/kit/elements/presence.d.ts +3 -0
- package/dist/kit/elements/presence.d.ts.map +1 -0
- package/dist/kit/elements/presence.js +11 -0
- package/dist/kit/elements/presence.js.map +1 -0
- package/dist/kit/elements/sheet.d.ts +3 -0
- package/dist/kit/elements/sheet.d.ts.map +1 -0
- package/dist/kit/elements/sheet.js +11 -0
- package/dist/kit/elements/sheet.js.map +1 -0
- package/dist/kit/elements/tabs.d.ts +3 -0
- package/dist/kit/elements/tabs.d.ts.map +1 -0
- package/dist/kit/elements/tabs.js +11 -0
- package/dist/kit/elements/tabs.js.map +1 -0
- package/dist/kit/elements/toast.d.ts +4 -0
- package/dist/kit/elements/toast.d.ts.map +1 -0
- package/dist/kit/elements/toast.js +11 -0
- package/dist/kit/elements/toast.js.map +1 -0
- package/dist/kit/elements/tree.d.ts +3 -0
- package/dist/kit/elements/tree.d.ts.map +1 -0
- package/dist/kit/elements/tree.js +11 -0
- package/dist/kit/elements/tree.js.map +1 -0
- package/dist/kit/flex-view.d.ts +2 -0
- package/dist/kit/flex-view.d.ts.map +1 -1
- package/dist/kit/flex-view.js +346 -0
- package/dist/kit/flex-view.js.map +1 -0
- package/dist/kit/form.d.ts +2 -0
- package/dist/kit/form.d.ts.map +1 -1
- package/dist/kit/form.js +211 -0
- package/dist/kit/form.js.map +1 -0
- package/dist/kit/index.d.ts +15 -15
- package/dist/kit/index.d.ts.map +1 -1
- package/dist/kit/index.js +40 -0
- package/dist/kit/internal/modal.d.ts +26 -0
- package/dist/kit/internal/modal.d.ts.map +1 -0
- package/dist/kit/internal/modal.js +59 -0
- package/dist/kit/internal/modal.js.map +1 -0
- package/dist/kit/kanban.d.ts +73 -0
- package/dist/kit/kanban.d.ts.map +1 -0
- package/dist/kit/kanban.js +404 -0
- package/dist/kit/kanban.js.map +1 -0
- package/dist/kit/list.d.ts +4 -0
- package/dist/kit/list.d.ts.map +1 -1
- package/dist/kit/list.js +106 -0
- package/dist/kit/list.js.map +1 -0
- package/dist/kit/markdown/highlight.js +106 -0
- package/dist/kit/markdown/highlight.js.map +1 -0
- package/dist/kit/markdown/render.js +260 -0
- package/dist/kit/markdown/render.js.map +1 -0
- package/dist/kit/markdown-editor.d.ts +2 -0
- package/dist/kit/markdown-editor.d.ts.map +1 -1
- package/dist/kit/markdown-editor.js +797 -0
- package/dist/kit/markdown-editor.js.map +1 -0
- package/dist/kit/presence.d.ts +36 -0
- package/dist/kit/presence.d.ts.map +1 -0
- package/dist/kit/presence.js +262 -0
- package/dist/kit/presence.js.map +1 -0
- package/dist/kit/sheet/formula.js +364 -0
- package/dist/kit/sheet/formula.js.map +1 -0
- package/dist/kit/sheet/model.js +136 -0
- package/dist/kit/sheet/model.js.map +1 -0
- package/dist/kit/sheet/sheet.d.ts +2 -0
- package/dist/kit/sheet/sheet.d.ts.map +1 -1
- package/dist/kit/sheet/sheet.js +676 -0
- package/dist/kit/sheet/sheet.js.map +1 -0
- package/dist/kit/tabs.d.ts +17 -0
- package/dist/kit/tabs.d.ts.map +1 -0
- package/dist/kit/tabs.js +192 -0
- package/dist/kit/tabs.js.map +1 -0
- package/dist/kit/theme-boot.generated.js +8 -0
- package/dist/kit/theme-boot.generated.js.map +1 -0
- package/dist/kit/theme.js +89 -0
- package/dist/kit/theme.js.map +1 -0
- package/dist/kit/toast.d.ts +46 -0
- package/dist/kit/toast.d.ts.map +1 -0
- package/dist/kit/toast.js +154 -0
- package/dist/kit/toast.js.map +1 -0
- package/dist/kit/tree.d.ts +41 -0
- package/dist/kit/tree.d.ts.map +1 -0
- package/dist/kit/tree.js +422 -0
- package/dist/kit/tree.js.map +1 -0
- package/dist/mixins/context-menu.d.ts.map +1 -1
- package/dist/mixins/context-menu.js +183 -0
- package/dist/mixins/context-menu.js.map +1 -0
- package/dist/mixins/draggable.d.ts.map +1 -1
- package/dist/mixins/draggable.js +140 -0
- package/dist/mixins/draggable.js.map +1 -0
- package/dist/mixins/dropdown.d.ts.map +1 -1
- package/dist/mixins/dropdown.js +216 -0
- package/dist/mixins/dropdown.js.map +1 -0
- package/dist/mixins/editable.d.ts.map +1 -1
- package/dist/mixins/editable.js +175 -0
- package/dist/mixins/editable.js.map +1 -0
- package/dist/mixins/grid-navigation.d.ts.map +1 -1
- package/dist/mixins/grid-navigation.js +194 -0
- package/dist/mixins/grid-navigation.js.map +1 -0
- package/dist/mixins/index.d.ts +6 -2
- package/dist/mixins/index.d.ts.map +1 -1
- package/dist/mixins/index.js +38 -0
- package/dist/mixins/index.js.map +1 -0
- package/dist/mixins/infinite-scroll.d.ts.map +1 -1
- package/dist/mixins/infinite-scroll.js +83 -0
- package/dist/mixins/infinite-scroll.js.map +1 -0
- package/dist/mixins/listbox.d.ts.map +1 -1
- package/dist/mixins/listbox.js +208 -0
- package/dist/mixins/listbox.js.map +1 -0
- package/dist/mixins/popup.d.ts +36 -0
- package/dist/mixins/popup.d.ts.map +1 -0
- package/dist/mixins/popup.js +113 -0
- package/dist/mixins/popup.js.map +1 -0
- package/dist/mixins/registry.d.ts +6 -0
- package/dist/mixins/registry.d.ts.map +1 -1
- package/dist/mixins/registry.js +167 -0
- package/dist/mixins/registry.js.map +1 -0
- package/dist/mixins/resizable.d.ts.map +1 -1
- package/dist/mixins/resizable.js +128 -0
- package/dist/mixins/resizable.js.map +1 -0
- package/dist/mixins/sortable.d.ts.map +1 -1
- package/dist/mixins/sortable.js +511 -0
- package/dist/mixins/sortable.js.map +1 -0
- package/dist/mixins/tooltip.d.ts.map +1 -1
- package/dist/mixins/tooltip.js +80 -0
- package/dist/mixins/tooltip.js.map +1 -0
- package/dist/mixins/utils.js +105 -0
- package/dist/mixins/utils.js.map +1 -0
- package/dist/plugins/async-validators.js +118 -0
- package/dist/plugins/async-validators.js.map +1 -0
- package/dist/plugins/builtins.d.ts +1 -1
- package/dist/plugins/builtins.d.ts.map +1 -1
- package/dist/plugins/builtins.js +20 -0
- package/dist/plugins/builtins.js.map +1 -0
- package/dist/plugins/date-utils.js +128 -0
- package/dist/plugins/date-utils.js.map +1 -0
- package/dist/plugins/plugin-manager.d.ts.map +1 -1
- package/dist/plugins/plugin-manager.js +99 -0
- package/dist/plugins/plugin-manager.js.map +1 -0
- package/dist/plugins/rich-text.js +365 -0
- package/dist/plugins/rich-text.js.map +1 -0
- package/dist/realtime/azure-pubsub-manager.js +273 -0
- package/dist/realtime/azure-pubsub-manager.js.map +1 -0
- package/dist/realtime/collab/anchors.js +19 -0
- package/dist/realtime/collab/anchors.js.map +1 -0
- package/dist/realtime/collab/collab-session.js +396 -0
- package/dist/realtime/collab/collab-session.js.map +1 -0
- package/dist/realtime/collab/cursor-overlay.js +187 -0
- package/dist/realtime/collab/cursor-overlay.js.map +1 -0
- package/dist/realtime/collab/textarea-adapter.js +125 -0
- package/dist/realtime/collab/textarea-adapter.js.map +1 -0
- package/dist/realtime/collab/undo-manager.js +148 -0
- package/dist/realtime/collab/undo-manager.js.map +1 -0
- package/dist/realtime/index.d.ts +11 -0
- package/dist/realtime/index.d.ts.map +1 -0
- package/dist/realtime/index.js +22 -0
- package/dist/realtime/index.js.map +1 -0
- package/dist/realtime/ot/client.js +74 -0
- package/dist/realtime/ot/client.js.map +1 -0
- package/dist/realtime/ot/server.js +292 -0
- package/dist/realtime/ot/server.js.map +1 -0
- package/dist/realtime/ot/text-operation.js +282 -0
- package/dist/realtime/ot/text-operation.js.map +1 -0
- package/dist/realtime/reconnect.js +58 -0
- package/dist/realtime/reconnect.js.map +1 -0
- package/dist/realtime/sse-manager.js +172 -0
- package/dist/realtime/sse-manager.js.map +1 -0
- package/dist/realtime/websocket-manager.js +180 -0
- package/dist/realtime/websocket-manager.js.map +1 -0
- package/dist/theme.css +178 -0
- package/dist/utils/backoff.js +30 -0
- package/dist/utils/backoff.js.map +1 -0
- package/dist/utils/dates.js +67 -0
- package/dist/utils/dates.js.map +1 -0
- package/dist/utils/dom.js +30 -0
- package/dist/utils/dom.js.map +1 -0
- package/dist/utils/emitter.js +40 -0
- package/dist/utils/emitter.js.map +1 -0
- package/dist/utils/fuzzy.d.ts +2 -0
- package/dist/utils/fuzzy.d.ts.map +1 -1
- package/dist/utils/fuzzy.js +95 -0
- package/dist/utils/fuzzy.js.map +1 -0
- package/dist/utils/path.js +99 -0
- package/dist/utils/path.js.map +1 -0
- package/dist/utils/sanitize.js +161 -0
- package/dist/utils/sanitize.js.map +1 -0
- package/dist/utils/url.js +44 -0
- package/dist/utils/url.js.map +1 -0
- package/dist/utils/virtual-window.d.ts +25 -0
- package/dist/utils/virtual-window.d.ts.map +1 -0
- package/dist/utils/virtual-window.js +19 -0
- package/dist/utils/virtual-window.js.map +1 -0
- package/dist/version.d.ts +1 -1
- package/dist/version.js +6 -0
- package/dist/version.js.map +1 -0
- package/package.json +61 -11
- package/dist/arethesis.js.map +0 -1
- package/dist/components.js.map +0 -1
- package/dist/fuzzy-Dnlbxdby.js +0 -5752
- package/dist/fuzzy-Dnlbxdby.js.map +0 -1
|
@@ -0,0 +1,292 @@
|
|
|
1
|
+
import { TextOperation } from "./text-operation.js";
|
|
2
|
+
import { transformRange } from "../collab/anchors.js";
|
|
3
|
+
// src/realtime/ot/server.ts
|
|
4
|
+
/**
|
|
5
|
+
* Reference OT server, usable in Node or in the browser (the examples run it
|
|
6
|
+
* inside a mock backend).
|
|
7
|
+
*
|
|
8
|
+
* `OTDocumentServer` holds one document and its history. `CollabServer`
|
|
9
|
+
* speaks the `collab:*` message protocol used by `CollabSession`, for any
|
|
10
|
+
* number of documents and clients, over whatever transport you give it.
|
|
11
|
+
*
|
|
12
|
+
* ```ts
|
|
13
|
+
* const server = new CollabServer((clientId, message) => sockets.get(clientId)?.send(JSON.stringify(message)));
|
|
14
|
+
* socket.on('message', raw => server.handle(clientId, JSON.parse(raw)));
|
|
15
|
+
* socket.on('close', () => server.disconnect(clientId));
|
|
16
|
+
* ```
|
|
17
|
+
*
|
|
18
|
+
* @module realtime/ot/server
|
|
19
|
+
*/
|
|
20
|
+
var MAX_ANNOTATIONS = 500;
|
|
21
|
+
var MAX_ANNOTATION_TEXT = 4e3;
|
|
22
|
+
var OTDocumentServer = class {
|
|
23
|
+
document;
|
|
24
|
+
operations = [];
|
|
25
|
+
/** Client op ids, parallel to `operations` (lets reconnecting clients spot their own ops). */
|
|
26
|
+
opIds = [];
|
|
27
|
+
/** Annotations (comments), kept anchored to their text as operations arrive. */
|
|
28
|
+
annotations = /* @__PURE__ */ new Map();
|
|
29
|
+
constructor(document = "") {
|
|
30
|
+
this.document = document;
|
|
31
|
+
}
|
|
32
|
+
get revision() {
|
|
33
|
+
return this.operations.length;
|
|
34
|
+
}
|
|
35
|
+
/**
|
|
36
|
+
* Accept an operation made against `revision`. Returns the transformed
|
|
37
|
+
* operation that was applied (broadcast it to the other clients).
|
|
38
|
+
*/
|
|
39
|
+
receive(revision, operation, opId) {
|
|
40
|
+
if (revision < 0 || revision > this.operations.length) throw new Error(`Invalid revision ${revision}`);
|
|
41
|
+
let op = operation;
|
|
42
|
+
for (const concurrent of this.operations.slice(revision)) op = TextOperation.transform(op, concurrent)[0];
|
|
43
|
+
this.document = op.apply(this.document);
|
|
44
|
+
this.operations.push(op);
|
|
45
|
+
this.opIds.push(opId);
|
|
46
|
+
for (const [id, a] of this.annotations) this.annotations.set(id, transformRange(a, op));
|
|
47
|
+
return op;
|
|
48
|
+
}
|
|
49
|
+
/** Map a range made against `revision` to the current document. */
|
|
50
|
+
rebaseRange(from, to, revision) {
|
|
51
|
+
let range = {
|
|
52
|
+
from,
|
|
53
|
+
to
|
|
54
|
+
};
|
|
55
|
+
for (const op of this.operations.slice(Math.max(0, Math.min(revision, this.operations.length)))) range = transformRange(range, op);
|
|
56
|
+
const clamp = (n) => Math.max(0, Math.min(n, this.document.length));
|
|
57
|
+
return {
|
|
58
|
+
from: clamp(range.from),
|
|
59
|
+
to: clamp(Math.max(range.from, range.to))
|
|
60
|
+
};
|
|
61
|
+
}
|
|
62
|
+
/**
|
|
63
|
+
* Apply an annotation change made against `revision`. Returns the stored
|
|
64
|
+
* annotation (positions at the current revision), or null if it was invalid.
|
|
65
|
+
*/
|
|
66
|
+
annotate(payload, user) {
|
|
67
|
+
const input = payload.annotation;
|
|
68
|
+
if (!input || typeof input.id !== "string" || !input.id || input.id.length > 100) return null;
|
|
69
|
+
const existing = this.annotations.get(input.id);
|
|
70
|
+
if (payload.action === "remove") {
|
|
71
|
+
if (!existing) return null;
|
|
72
|
+
this.annotations.delete(input.id);
|
|
73
|
+
return existing;
|
|
74
|
+
}
|
|
75
|
+
const text = (v) => typeof v === "string" ? v.slice(0, MAX_ANNOTATION_TEXT) : void 0;
|
|
76
|
+
const revision = typeof payload.revision === "number" ? payload.revision : this.revision;
|
|
77
|
+
let range = existing ? {
|
|
78
|
+
from: existing.from,
|
|
79
|
+
to: existing.to
|
|
80
|
+
} : null;
|
|
81
|
+
if (typeof input.from === "number" && typeof input.to === "number" && input.from <= input.to) range = this.rebaseRange(input.from, input.to, revision);
|
|
82
|
+
if (!range) return null;
|
|
83
|
+
if (payload.action === "add") {
|
|
84
|
+
if (existing || this.annotations.size >= MAX_ANNOTATIONS) return null;
|
|
85
|
+
const created = {
|
|
86
|
+
id: input.id,
|
|
87
|
+
...range,
|
|
88
|
+
body: text(input.body) ?? "",
|
|
89
|
+
user: user ?? input.user,
|
|
90
|
+
resolved: false,
|
|
91
|
+
createdAt: typeof input.createdAt === "number" ? input.createdAt : Date.now(),
|
|
92
|
+
replies: []
|
|
93
|
+
};
|
|
94
|
+
this.annotations.set(input.id, created);
|
|
95
|
+
return created;
|
|
96
|
+
}
|
|
97
|
+
if (!existing) return null;
|
|
98
|
+
const replies = Array.isArray(input.replies) ? input.replies.slice(0, 200).map((r) => ({
|
|
99
|
+
body: text(r?.body) ?? "",
|
|
100
|
+
user: r?.user,
|
|
101
|
+
createdAt: typeof r?.createdAt === "number" ? r.createdAt : void 0
|
|
102
|
+
})) : existing.replies;
|
|
103
|
+
const updated = {
|
|
104
|
+
...existing,
|
|
105
|
+
...range,
|
|
106
|
+
body: text(input.body) ?? existing.body,
|
|
107
|
+
resolved: typeof input.resolved === "boolean" ? input.resolved : existing.resolved,
|
|
108
|
+
replies
|
|
109
|
+
};
|
|
110
|
+
this.annotations.set(input.id, updated);
|
|
111
|
+
return updated;
|
|
112
|
+
}
|
|
113
|
+
};
|
|
114
|
+
var CollabServer = class {
|
|
115
|
+
send;
|
|
116
|
+
loadDocument;
|
|
117
|
+
docs = /* @__PURE__ */ new Map();
|
|
118
|
+
clients = /* @__PURE__ */ new Map();
|
|
119
|
+
/**
|
|
120
|
+
* @param send Deliver a message to one client.
|
|
121
|
+
* @param loadDocument Initial content for a document opened for the first time.
|
|
122
|
+
*/
|
|
123
|
+
constructor(send, loadDocument = () => "") {
|
|
124
|
+
this.send = send;
|
|
125
|
+
this.loadDocument = loadDocument;
|
|
126
|
+
}
|
|
127
|
+
/** Access (or create) a document. */
|
|
128
|
+
document(docId) {
|
|
129
|
+
let doc = this.docs.get(docId);
|
|
130
|
+
if (!doc) {
|
|
131
|
+
doc = new OTDocumentServer(this.loadDocument(docId));
|
|
132
|
+
this.docs.set(docId, doc);
|
|
133
|
+
}
|
|
134
|
+
return doc;
|
|
135
|
+
}
|
|
136
|
+
membersOf(docId) {
|
|
137
|
+
return Array.from(this.clients.entries()).filter(([, c]) => c.docs.has(docId)).map(([id]) => id);
|
|
138
|
+
}
|
|
139
|
+
broadcast(docId, message, except) {
|
|
140
|
+
for (const id of this.membersOf(docId)) if (id !== except) this.send(id, message);
|
|
141
|
+
}
|
|
142
|
+
/** Handle one incoming message from a client. */
|
|
143
|
+
handle(clientId, message) {
|
|
144
|
+
const docId = message.channel?.replace(/^doc:/, "") ?? "";
|
|
145
|
+
if (!docId) return;
|
|
146
|
+
let client = this.clients.get(clientId);
|
|
147
|
+
if (!client) {
|
|
148
|
+
client = { docs: /* @__PURE__ */ new Set() };
|
|
149
|
+
this.clients.set(clientId, client);
|
|
150
|
+
}
|
|
151
|
+
switch (message.type) {
|
|
152
|
+
case "collab:join": {
|
|
153
|
+
client.docs.add(docId);
|
|
154
|
+
const join = message.payload ?? {};
|
|
155
|
+
client.user = join.user;
|
|
156
|
+
const doc = this.document(docId);
|
|
157
|
+
const since = typeof join.revision === "number" && join.revision >= 0 && join.revision <= doc.revision ? join.revision : null;
|
|
158
|
+
const missed = since === null ? void 0 : doc.operations.slice(since).map((op, i) => ({
|
|
159
|
+
op: op.toJSON(),
|
|
160
|
+
opId: doc.opIds[since + i]
|
|
161
|
+
}));
|
|
162
|
+
const peers = this.membersOf(docId).filter((id) => id !== clientId).map((id) => ({
|
|
163
|
+
clientId: id,
|
|
164
|
+
user: this.clients.get(id)?.user,
|
|
165
|
+
selection: this.clients.get(id)?.selection
|
|
166
|
+
}));
|
|
167
|
+
const annotations = [...doc.annotations.values()];
|
|
168
|
+
this.send(clientId, {
|
|
169
|
+
type: "collab:init",
|
|
170
|
+
channel: message.channel,
|
|
171
|
+
payload: {
|
|
172
|
+
content: doc.document,
|
|
173
|
+
revision: doc.revision,
|
|
174
|
+
clientId,
|
|
175
|
+
peers,
|
|
176
|
+
since,
|
|
177
|
+
missed,
|
|
178
|
+
annotations
|
|
179
|
+
}
|
|
180
|
+
});
|
|
181
|
+
this.broadcast(docId, {
|
|
182
|
+
type: "collab:presence",
|
|
183
|
+
channel: message.channel,
|
|
184
|
+
payload: {
|
|
185
|
+
clientId,
|
|
186
|
+
user: client.user
|
|
187
|
+
}
|
|
188
|
+
}, clientId);
|
|
189
|
+
return;
|
|
190
|
+
}
|
|
191
|
+
case "collab:op": {
|
|
192
|
+
if (!client.docs.has(docId)) return;
|
|
193
|
+
const { revision, op, opId } = message.payload;
|
|
194
|
+
let applied;
|
|
195
|
+
try {
|
|
196
|
+
applied = this.document(docId).receive(revision, TextOperation.fromJSON(op), opId);
|
|
197
|
+
} catch (err) {
|
|
198
|
+
this.send(clientId, {
|
|
199
|
+
type: "collab:error",
|
|
200
|
+
channel: message.channel,
|
|
201
|
+
payload: {
|
|
202
|
+
opId,
|
|
203
|
+
message: err.message
|
|
204
|
+
}
|
|
205
|
+
});
|
|
206
|
+
return;
|
|
207
|
+
}
|
|
208
|
+
const newRevision = this.document(docId).revision;
|
|
209
|
+
this.send(clientId, {
|
|
210
|
+
type: "collab:ack",
|
|
211
|
+
channel: message.channel,
|
|
212
|
+
payload: {
|
|
213
|
+
revision: newRevision,
|
|
214
|
+
opId
|
|
215
|
+
}
|
|
216
|
+
});
|
|
217
|
+
this.broadcast(docId, {
|
|
218
|
+
type: "collab:op",
|
|
219
|
+
channel: message.channel,
|
|
220
|
+
payload: {
|
|
221
|
+
op: applied.toJSON(),
|
|
222
|
+
revision: newRevision,
|
|
223
|
+
clientId
|
|
224
|
+
}
|
|
225
|
+
}, clientId);
|
|
226
|
+
return;
|
|
227
|
+
}
|
|
228
|
+
case "collab:presence": {
|
|
229
|
+
if (!client.docs.has(docId)) return;
|
|
230
|
+
const payload = message.payload;
|
|
231
|
+
client.selection = payload.selection;
|
|
232
|
+
if (payload.user) client.user = payload.user;
|
|
233
|
+
this.broadcast(docId, {
|
|
234
|
+
type: "collab:presence",
|
|
235
|
+
channel: message.channel,
|
|
236
|
+
payload: {
|
|
237
|
+
clientId,
|
|
238
|
+
user: client.user,
|
|
239
|
+
selection: payload.selection,
|
|
240
|
+
revision: this.document(docId).revision
|
|
241
|
+
}
|
|
242
|
+
}, clientId);
|
|
243
|
+
return;
|
|
244
|
+
}
|
|
245
|
+
case "collab:annotate": {
|
|
246
|
+
if (!client.docs.has(docId)) return;
|
|
247
|
+
const payload = message.payload;
|
|
248
|
+
const doc = this.document(docId);
|
|
249
|
+
const annotation = doc.annotate(payload, client.user);
|
|
250
|
+
if (!annotation) {
|
|
251
|
+
this.send(clientId, {
|
|
252
|
+
type: "collab:error",
|
|
253
|
+
channel: message.channel,
|
|
254
|
+
payload: { message: "Invalid annotation" }
|
|
255
|
+
});
|
|
256
|
+
return;
|
|
257
|
+
}
|
|
258
|
+
this.broadcast(docId, {
|
|
259
|
+
type: "collab:annotate",
|
|
260
|
+
channel: message.channel,
|
|
261
|
+
payload: {
|
|
262
|
+
action: payload.action,
|
|
263
|
+
annotation,
|
|
264
|
+
revision: doc.revision
|
|
265
|
+
}
|
|
266
|
+
});
|
|
267
|
+
return;
|
|
268
|
+
}
|
|
269
|
+
case "collab:leave":
|
|
270
|
+
this.leave(clientId, docId);
|
|
271
|
+
return;
|
|
272
|
+
}
|
|
273
|
+
}
|
|
274
|
+
leave(clientId, docId) {
|
|
275
|
+
if (!this.clients.get(clientId)?.docs.delete(docId)) return;
|
|
276
|
+
this.broadcast(docId, {
|
|
277
|
+
type: "collab:leave",
|
|
278
|
+
channel: `doc:${docId}`,
|
|
279
|
+
payload: { clientId }
|
|
280
|
+
});
|
|
281
|
+
}
|
|
282
|
+
/** A client went away: leave every document. */
|
|
283
|
+
disconnect(clientId) {
|
|
284
|
+
const client = this.clients.get(clientId);
|
|
285
|
+
if (!client) return;
|
|
286
|
+
for (const docId of [...client.docs]) this.leave(clientId, docId);
|
|
287
|
+
this.clients.delete(clientId);
|
|
288
|
+
}
|
|
289
|
+
};
|
|
290
|
+
export { CollabServer, OTDocumentServer };
|
|
291
|
+
|
|
292
|
+
//# sourceMappingURL=server.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"server.js","names":[],"sources":["../../../src/realtime/ot/server.ts"],"sourcesContent":["/**\n * Reference OT server, usable in Node or in the browser (the examples run it\n * inside a mock backend).\n *\n * `OTDocumentServer` holds one document and its history. `CollabServer`\n * speaks the `collab:*` message protocol used by `CollabSession`, for any\n * number of documents and clients, over whatever transport you give it.\n *\n * ```ts\n * const server = new CollabServer((clientId, message) => sockets.get(clientId)?.send(JSON.stringify(message)));\n * socket.on('message', raw => server.handle(clientId, JSON.parse(raw)));\n * socket.on('close', () => server.disconnect(clientId));\n * ```\n *\n * @module realtime/ot/server\n */\n\nimport { TextOperation } from './text-operation';\nimport { transformRange } from '../collab/anchors';\nimport type { AnnotatePayload, CollabAnnotation, CollabMessage, CollabUser, PresencePayload } from '../types';\n\nconst MAX_ANNOTATIONS = 500;\nconst MAX_ANNOTATION_TEXT = 4000;\n\nexport class OTDocumentServer {\n readonly operations: TextOperation[] = [];\n /** Client op ids, parallel to `operations` (lets reconnecting clients spot their own ops). */\n readonly opIds: Array<string | undefined> = [];\n /** Annotations (comments), kept anchored to their text as operations arrive. */\n readonly annotations = new Map<string, CollabAnnotation>();\n\n constructor(public document = '') {}\n\n get revision(): number {\n return this.operations.length;\n }\n\n /**\n * Accept an operation made against `revision`. Returns the transformed\n * operation that was applied (broadcast it to the other clients).\n */\n receive(revision: number, operation: TextOperation, opId?: string): TextOperation {\n if (revision < 0 || revision > this.operations.length) throw new Error(`Invalid revision ${revision}`);\n let op = operation;\n for (const concurrent of this.operations.slice(revision)) {\n op = TextOperation.transform(op, concurrent)[0];\n }\n this.document = op.apply(this.document);\n this.operations.push(op);\n this.opIds.push(opId);\n for (const [id, a] of this.annotations) this.annotations.set(id, transformRange(a, op));\n return op;\n }\n\n /** Map a range made against `revision` to the current document. */\n rebaseRange(from: number, to: number, revision: number): { from: number; to: number } {\n let range = { from, to };\n for (const op of this.operations.slice(Math.max(0, Math.min(revision, this.operations.length)))) range = transformRange(range, op);\n const clamp = (n: number) => Math.max(0, Math.min(n, this.document.length));\n return { from: clamp(range.from), to: clamp(Math.max(range.from, range.to)) };\n }\n\n /**\n * Apply an annotation change made against `revision`. Returns the stored\n * annotation (positions at the current revision), or null if it was invalid.\n */\n annotate(payload: AnnotatePayload, user?: CollabUser): CollabAnnotation | null {\n const input = payload.annotation;\n if (!input || typeof input.id !== 'string' || !input.id || input.id.length > 100) return null;\n const existing = this.annotations.get(input.id);\n if (payload.action === 'remove') {\n if (!existing) return null;\n this.annotations.delete(input.id);\n return existing;\n }\n const text = (v: unknown) => (typeof v === 'string' ? v.slice(0, MAX_ANNOTATION_TEXT) : undefined);\n const revision = typeof payload.revision === 'number' ? payload.revision : this.revision;\n let range = existing ? { from: existing.from, to: existing.to } : null;\n if (typeof input.from === 'number' && typeof input.to === 'number' && input.from <= input.to) range = this.rebaseRange(input.from, input.to, revision);\n if (!range) return null;\n if (payload.action === 'add') {\n if (existing || this.annotations.size >= MAX_ANNOTATIONS) return null;\n const created: CollabAnnotation = { id: input.id, ...range, body: text(input.body) ?? '', user: user ?? input.user, resolved: false, createdAt: typeof input.createdAt === 'number' ? input.createdAt : Date.now(), replies: [] };\n this.annotations.set(input.id, created);\n return created;\n }\n if (!existing) return null;\n const replies = Array.isArray(input.replies)\n ? input.replies.slice(0, 200).map(r => ({ body: text(r?.body) ?? '', user: r?.user, createdAt: typeof r?.createdAt === 'number' ? r.createdAt : undefined }))\n : existing.replies;\n const updated: CollabAnnotation = { ...existing, ...range, body: text(input.body) ?? existing.body, resolved: typeof input.resolved === 'boolean' ? input.resolved : existing.resolved, replies };\n this.annotations.set(input.id, updated);\n return updated;\n }\n}\n\ninterface ClientInfo {\n docs: Set<string>;\n user?: CollabUser;\n selection?: PresencePayload['selection'];\n}\n\nexport class CollabServer {\n private docs = new Map<string, OTDocumentServer>();\n private clients = new Map<string, ClientInfo>();\n\n /**\n * @param send Deliver a message to one client.\n * @param loadDocument Initial content for a document opened for the first time.\n */\n constructor(\n private send: (clientId: string, message: CollabMessage) => void,\n private loadDocument: (docId: string) => string = () => ''\n ) {}\n\n /** Access (or create) a document. */\n document(docId: string): OTDocumentServer {\n let doc = this.docs.get(docId);\n if (!doc) {\n doc = new OTDocumentServer(this.loadDocument(docId));\n this.docs.set(docId, doc);\n }\n return doc;\n }\n\n private membersOf(docId: string): string[] {\n return Array.from(this.clients.entries()).filter(([, c]) => c.docs.has(docId)).map(([id]) => id);\n }\n\n private broadcast(docId: string, message: CollabMessage, except?: string): void {\n for (const id of this.membersOf(docId)) if (id !== except) this.send(id, message);\n }\n\n /** Handle one incoming message from a client. */\n handle(clientId: string, message: CollabMessage): void {\n const docId = message.channel?.replace(/^doc:/, '') ?? '';\n if (!docId) return;\n let client = this.clients.get(clientId);\n if (!client) {\n client = { docs: new Set() };\n this.clients.set(clientId, client);\n }\n\n switch (message.type) {\n case 'collab:join': {\n client.docs.add(docId);\n const join = (message.payload ?? {}) as { user?: CollabUser; revision?: number };\n client.user = join.user;\n const doc = this.document(docId);\n // A reconnecting client sends its revision and gets the ops it missed.\n const since = typeof join.revision === 'number' && join.revision >= 0 && join.revision <= doc.revision ? join.revision : null;\n const missed = since === null ? undefined : doc.operations.slice(since).map((op, i) => ({ op: op.toJSON(), opId: doc.opIds[since + i] }));\n const peers = this.membersOf(docId)\n .filter(id => id !== clientId)\n .map(id => ({ clientId: id, user: this.clients.get(id)?.user, selection: this.clients.get(id)?.selection }));\n const annotations = [...doc.annotations.values()];\n this.send(clientId, { type: 'collab:init', channel: message.channel, payload: { content: doc.document, revision: doc.revision, clientId, peers, since, missed, annotations } });\n this.broadcast(docId, { type: 'collab:presence', channel: message.channel, payload: { clientId, user: client.user } }, clientId);\n return;\n }\n case 'collab:op': {\n if (!client.docs.has(docId)) return;\n const { revision, op, opId } = message.payload as { revision: number; op: unknown; opId?: string };\n let applied: TextOperation;\n try {\n applied = this.document(docId).receive(revision, TextOperation.fromJSON(op), opId);\n } catch (err) {\n this.send(clientId, { type: 'collab:error', channel: message.channel, payload: { opId, message: (err as Error).message } });\n return;\n }\n const newRevision = this.document(docId).revision;\n this.send(clientId, { type: 'collab:ack', channel: message.channel, payload: { revision: newRevision, opId } });\n this.broadcast(docId, { type: 'collab:op', channel: message.channel, payload: { op: applied.toJSON(), revision: newRevision, clientId } }, clientId);\n return;\n }\n case 'collab:presence': {\n if (!client.docs.has(docId)) return;\n const payload = message.payload as PresencePayload;\n client.selection = payload.selection;\n if (payload.user) client.user = payload.user;\n this.broadcast(docId, { type: 'collab:presence', channel: message.channel, payload: { clientId, user: client.user, selection: payload.selection, revision: this.document(docId).revision } }, clientId);\n return;\n }\n case 'collab:annotate': {\n if (!client.docs.has(docId)) return;\n const payload = message.payload as AnnotatePayload;\n const doc = this.document(docId);\n const annotation = doc.annotate(payload, client.user);\n if (!annotation) {\n this.send(clientId, { type: 'collab:error', channel: message.channel, payload: { message: 'Invalid annotation' } });\n return;\n }\n // Everyone, including the sender, gets the stored version at the current revision.\n this.broadcast(docId, { type: 'collab:annotate', channel: message.channel, payload: { action: payload.action, annotation, revision: doc.revision } });\n return;\n }\n case 'collab:leave':\n this.leave(clientId, docId);\n return;\n }\n }\n\n private leave(clientId: string, docId: string): void {\n const client = this.clients.get(clientId);\n if (!client?.docs.delete(docId)) return;\n this.broadcast(docId, { type: 'collab:leave', channel: `doc:${docId}`, payload: { clientId } });\n }\n\n /** A client went away: leave every document. */\n disconnect(clientId: string): void {\n const client = this.clients.get(clientId);\n if (!client) return;\n for (const docId of [...client.docs]) this.leave(clientId, docId);\n this.clients.delete(clientId);\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAqBA,IAAM,kBAAkB;AACxB,IAAM,sBAAsB;AAE5B,IAAa,mBAAb,MAA8B;CAOT;CANnB,aAAuC,CAAC;;CAExC,QAA4C,CAAC;;CAE7C,8BAAuB,IAAI,IAA8B;CAEzD,YAAY,WAAkB,IAAI;EAAf,KAAA,WAAA;CAAgB;CAEnC,IAAI,WAAmB;EACrB,OAAO,KAAK,WAAW;CACzB;;;;;CAMA,QAAQ,UAAkB,WAA0B,MAA8B;EAChF,IAAI,WAAW,KAAK,WAAW,KAAK,WAAW,QAAQ,MAAM,IAAI,MAAM,oBAAoB,UAAU;EACrG,IAAI,KAAK;EACT,KAAK,MAAM,cAAc,KAAK,WAAW,MAAM,QAAQ,GACrD,KAAK,cAAc,UAAU,IAAI,UAAU,CAAC,CAAC;EAE/C,KAAK,WAAW,GAAG,MAAM,KAAK,QAAQ;EACtC,KAAK,WAAW,KAAK,EAAE;EACvB,KAAK,MAAM,KAAK,IAAI;EACpB,KAAK,MAAM,CAAC,IAAI,MAAM,KAAK,aAAa,KAAK,YAAY,IAAI,IAAI,eAAe,GAAG,EAAE,CAAC;EACtF,OAAO;CACT;;CAGA,YAAY,MAAc,IAAY,UAAgD;EACpF,IAAI,QAAQ;GAAE;GAAM;EAAG;EACvB,KAAK,MAAM,MAAM,KAAK,WAAW,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,UAAU,KAAK,WAAW,MAAM,CAAC,CAAC,GAAG,QAAQ,eAAe,OAAO,EAAE;EACjI,MAAM,SAAS,MAAc,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,SAAS,MAAM,CAAC;EAC1E,OAAO;GAAE,MAAM,MAAM,MAAM,IAAI;GAAG,IAAI,MAAM,KAAK,IAAI,MAAM,MAAM,MAAM,EAAE,CAAC;EAAE;CAC9E;;;;;CAMA,SAAS,SAA0B,MAA4C;EAC7E,MAAM,QAAQ,QAAQ;EACtB,IAAI,CAAC,SAAS,OAAO,MAAM,OAAO,YAAY,CAAC,MAAM,MAAM,MAAM,GAAG,SAAS,KAAK,OAAO;EACzF,MAAM,WAAW,KAAK,YAAY,IAAI,MAAM,EAAE;EAC9C,IAAI,QAAQ,WAAW,UAAU;GAC/B,IAAI,CAAC,UAAU,OAAO;GACtB,KAAK,YAAY,OAAO,MAAM,EAAE;GAChC,OAAO;EACT;EACA,MAAM,QAAQ,MAAgB,OAAO,MAAM,WAAW,EAAE,MAAM,GAAG,mBAAmB,IAAI,KAAA;EACxF,MAAM,WAAW,OAAO,QAAQ,aAAa,WAAW,QAAQ,WAAW,KAAK;EAChF,IAAI,QAAQ,WAAW;GAAE,MAAM,SAAS;GAAM,IAAI,SAAS;EAAG,IAAI;EAClE,IAAI,OAAO,MAAM,SAAS,YAAY,OAAO,MAAM,OAAO,YAAY,MAAM,QAAQ,MAAM,IAAI,QAAQ,KAAK,YAAY,MAAM,MAAM,MAAM,IAAI,QAAQ;EACrJ,IAAI,CAAC,OAAO,OAAO;EACnB,IAAI,QAAQ,WAAW,OAAO;GAC5B,IAAI,YAAY,KAAK,YAAY,QAAQ,iBAAiB,OAAO;GACjE,MAAM,UAA4B;IAAE,IAAI,MAAM;IAAI,GAAG;IAAO,MAAM,KAAK,MAAM,IAAI,KAAK;IAAI,MAAM,QAAQ,MAAM;IAAM,UAAU;IAAO,WAAW,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY,KAAK,IAAI;IAAG,SAAS,CAAC;GAAE;GAChO,KAAK,YAAY,IAAI,MAAM,IAAI,OAAO;GACtC,OAAO;EACT;EACA,IAAI,CAAC,UAAU,OAAO;EACtB,MAAM,UAAU,MAAM,QAAQ,MAAM,OAAO,IACvC,MAAM,QAAQ,MAAM,GAAG,GAAG,CAAC,CAAC,KAAI,OAAM;GAAE,MAAM,KAAK,GAAG,IAAI,KAAK;GAAI,MAAM,GAAG;GAAM,WAAW,OAAO,GAAG,cAAc,WAAW,EAAE,YAAY,KAAA;EAAU,EAAE,IAC1J,SAAS;EACb,MAAM,UAA4B;GAAE,GAAG;GAAU,GAAG;GAAO,MAAM,KAAK,MAAM,IAAI,KAAK,SAAS;GAAM,UAAU,OAAO,MAAM,aAAa,YAAY,MAAM,WAAW,SAAS;GAAU;EAAQ;EAChM,KAAK,YAAY,IAAI,MAAM,IAAI,OAAO;EACtC,OAAO;CACT;AACF;AAQA,IAAa,eAAb,MAA0B;CASd;CACA;CATV,uBAAe,IAAI,IAA8B;CACjD,0BAAkB,IAAI,IAAwB;;;;;CAM9C,YACE,MACA,qBAAwD,IACxD;EAFQ,KAAA,OAAA;EACA,KAAA,eAAA;CACP;;CAGH,SAAS,OAAiC;EACxC,IAAI,MAAM,KAAK,KAAK,IAAI,KAAK;EAC7B,IAAI,CAAC,KAAK;GACR,MAAM,IAAI,iBAAiB,KAAK,aAAa,KAAK,CAAC;GACnD,KAAK,KAAK,IAAI,OAAO,GAAG;EAC1B;EACA,OAAO;CACT;CAEA,UAAkB,OAAyB;EACzC,OAAO,MAAM,KAAK,KAAK,QAAQ,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,OAAO,EAAE,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE;CACjG;CAEA,UAAkB,OAAe,SAAwB,QAAuB;EAC9E,KAAK,MAAM,MAAM,KAAK,UAAU,KAAK,GAAG,IAAI,OAAO,QAAQ,KAAK,KAAK,IAAI,OAAO;CAClF;;CAGA,OAAO,UAAkB,SAA8B;EACrD,MAAM,QAAQ,QAAQ,SAAS,QAAQ,SAAS,EAAE,KAAK;EACvD,IAAI,CAAC,OAAO;EACZ,IAAI,SAAS,KAAK,QAAQ,IAAI,QAAQ;EACtC,IAAI,CAAC,QAAQ;GACX,SAAS,EAAE,sBAAM,IAAI,IAAI,EAAE;GAC3B,KAAK,QAAQ,IAAI,UAAU,MAAM;EACnC;EAEA,QAAQ,QAAQ,MAAhB;GACE,KAAK,eAAe;IAClB,OAAO,KAAK,IAAI,KAAK;IACrB,MAAM,OAAQ,QAAQ,WAAW,CAAC;IAClC,OAAO,OAAO,KAAK;IACnB,MAAM,MAAM,KAAK,SAAS,KAAK;IAE/B,MAAM,QAAQ,OAAO,KAAK,aAAa,YAAY,KAAK,YAAY,KAAK,KAAK,YAAY,IAAI,WAAW,KAAK,WAAW;IACzH,MAAM,SAAS,UAAU,OAAO,KAAA,IAAY,IAAI,WAAW,MAAM,KAAK,CAAC,CAAC,KAAK,IAAI,OAAO;KAAE,IAAI,GAAG,OAAO;KAAG,MAAM,IAAI,MAAM,QAAQ;IAAG,EAAE;IACxI,MAAM,QAAQ,KAAK,UAAU,KAAK,CAAC,CAChC,QAAO,OAAM,OAAO,QAAQ,CAAC,CAC7B,KAAI,QAAO;KAAE,UAAU;KAAI,MAAM,KAAK,QAAQ,IAAI,EAAE,CAAC,EAAE;KAAM,WAAW,KAAK,QAAQ,IAAI,EAAE,CAAC,EAAE;IAAU,EAAE;IAC7G,MAAM,cAAc,CAAC,GAAG,IAAI,YAAY,OAAO,CAAC;IAChD,KAAK,KAAK,UAAU;KAAE,MAAM;KAAe,SAAS,QAAQ;KAAS,SAAS;MAAE,SAAS,IAAI;MAAU,UAAU,IAAI;MAAU;MAAU;MAAO;MAAO;MAAQ;KAAY;IAAE,CAAC;IAC9K,KAAK,UAAU,OAAO;KAAE,MAAM;KAAmB,SAAS,QAAQ;KAAS,SAAS;MAAE;MAAU,MAAM,OAAO;KAAK;IAAE,GAAG,QAAQ;IAC/H;GACF;GACA,KAAK,aAAa;IAChB,IAAI,CAAC,OAAO,KAAK,IAAI,KAAK,GAAG;IAC7B,MAAM,EAAE,UAAU,IAAI,SAAS,QAAQ;IACvC,IAAI;IACJ,IAAI;KACF,UAAU,KAAK,SAAS,KAAK,CAAC,CAAC,QAAQ,UAAU,cAAc,SAAS,EAAE,GAAG,IAAI;IACnF,SAAS,KAAK;KACZ,KAAK,KAAK,UAAU;MAAE,MAAM;MAAgB,SAAS,QAAQ;MAAS,SAAS;OAAE;OAAM,SAAU,IAAc;MAAQ;KAAE,CAAC;KAC1H;IACF;IACA,MAAM,cAAc,KAAK,SAAS,KAAK,CAAC,CAAC;IACzC,KAAK,KAAK,UAAU;KAAE,MAAM;KAAc,SAAS,QAAQ;KAAS,SAAS;MAAE,UAAU;MAAa;KAAK;IAAE,CAAC;IAC9G,KAAK,UAAU,OAAO;KAAE,MAAM;KAAa,SAAS,QAAQ;KAAS,SAAS;MAAE,IAAI,QAAQ,OAAO;MAAG,UAAU;MAAa;KAAS;IAAE,GAAG,QAAQ;IACnJ;GACF;GACA,KAAK,mBAAmB;IACtB,IAAI,CAAC,OAAO,KAAK,IAAI,KAAK,GAAG;IAC7B,MAAM,UAAU,QAAQ;IACxB,OAAO,YAAY,QAAQ;IAC3B,IAAI,QAAQ,MAAM,OAAO,OAAO,QAAQ;IACxC,KAAK,UAAU,OAAO;KAAE,MAAM;KAAmB,SAAS,QAAQ;KAAS,SAAS;MAAE;MAAU,MAAM,OAAO;MAAM,WAAW,QAAQ;MAAW,UAAU,KAAK,SAAS,KAAK,CAAC,CAAC;KAAS;IAAE,GAAG,QAAQ;IACtM;GACF;GACA,KAAK,mBAAmB;IACtB,IAAI,CAAC,OAAO,KAAK,IAAI,KAAK,GAAG;IAC7B,MAAM,UAAU,QAAQ;IACxB,MAAM,MAAM,KAAK,SAAS,KAAK;IAC/B,MAAM,aAAa,IAAI,SAAS,SAAS,OAAO,IAAI;IACpD,IAAI,CAAC,YAAY;KACf,KAAK,KAAK,UAAU;MAAE,MAAM;MAAgB,SAAS,QAAQ;MAAS,SAAS,EAAE,SAAS,qBAAqB;KAAE,CAAC;KAClH;IACF;IAEA,KAAK,UAAU,OAAO;KAAE,MAAM;KAAmB,SAAS,QAAQ;KAAS,SAAS;MAAE,QAAQ,QAAQ;MAAQ;MAAY,UAAU,IAAI;KAAS;IAAE,CAAC;IACpJ;GACF;GACA,KAAK;IACH,KAAK,MAAM,UAAU,KAAK;IAC1B;EACJ;CACF;CAEA,MAAc,UAAkB,OAAqB;EAEnD,IAAI,CADW,KAAK,QAAQ,IAAI,QAC3B,CAAA,EAAQ,KAAK,OAAO,KAAK,GAAG;EACjC,KAAK,UAAU,OAAO;GAAE,MAAM;GAAgB,SAAS,OAAO;GAAS,SAAS,EAAE,SAAS;EAAE,CAAC;CAChG;;CAGA,WAAW,UAAwB;EACjC,MAAM,SAAS,KAAK,QAAQ,IAAI,QAAQ;EACxC,IAAI,CAAC,QAAQ;EACb,KAAK,MAAM,SAAS,CAAC,GAAG,OAAO,IAAI,GAAG,KAAK,MAAM,UAAU,KAAK;EAChE,KAAK,QAAQ,OAAO,QAAQ;CAC9B;AACF"}
|
|
@@ -0,0 +1,282 @@
|
|
|
1
|
+
// src/realtime/ot/text-operation.ts
|
|
2
|
+
var isRetain = (c) => typeof c === "number" && c > 0;
|
|
3
|
+
var isDelete = (c) => typeof c === "number" && c < 0;
|
|
4
|
+
var isInsert = (c) => typeof c === "string";
|
|
5
|
+
function kind(c) {
|
|
6
|
+
if (c === void 0) return "none";
|
|
7
|
+
if (typeof c === "string") return "insert";
|
|
8
|
+
return c > 0 ? "retain" : "delete";
|
|
9
|
+
}
|
|
10
|
+
var TextOperation = class TextOperation {
|
|
11
|
+
/** Components; adjacent components of the same kind are always merged. */
|
|
12
|
+
ops = [];
|
|
13
|
+
/** Length of the document this operation applies to. */
|
|
14
|
+
baseLength = 0;
|
|
15
|
+
/** Length of the document after applying it. */
|
|
16
|
+
targetLength = 0;
|
|
17
|
+
/** Skip over `n` characters. */
|
|
18
|
+
retain(n) {
|
|
19
|
+
if (n < 0) throw new Error("retain expects a non-negative integer");
|
|
20
|
+
if (n === 0) return this;
|
|
21
|
+
this.baseLength += n;
|
|
22
|
+
this.targetLength += n;
|
|
23
|
+
const last = this.ops[this.ops.length - 1];
|
|
24
|
+
if (last !== void 0 && isRetain(last)) this.ops[this.ops.length - 1] = last + n;
|
|
25
|
+
else this.ops.push(n);
|
|
26
|
+
return this;
|
|
27
|
+
}
|
|
28
|
+
/** Insert text at the current position. */
|
|
29
|
+
insert(text) {
|
|
30
|
+
if (text === "") return this;
|
|
31
|
+
this.targetLength += text.length;
|
|
32
|
+
const ops = this.ops;
|
|
33
|
+
const last = ops[ops.length - 1];
|
|
34
|
+
if (last !== void 0 && isInsert(last)) ops[ops.length - 1] = last + text;
|
|
35
|
+
else if (last !== void 0 && isDelete(last)) {
|
|
36
|
+
const prev = ops[ops.length - 2];
|
|
37
|
+
if (prev !== void 0 && isInsert(prev)) ops[ops.length - 2] = prev + text;
|
|
38
|
+
else {
|
|
39
|
+
ops[ops.length] = last;
|
|
40
|
+
ops[ops.length - 2] = text;
|
|
41
|
+
}
|
|
42
|
+
} else ops.push(text);
|
|
43
|
+
return this;
|
|
44
|
+
}
|
|
45
|
+
/** Delete `n` characters. */
|
|
46
|
+
delete(n) {
|
|
47
|
+
const count = Math.abs(n);
|
|
48
|
+
if (count === 0) return this;
|
|
49
|
+
this.baseLength += count;
|
|
50
|
+
const last = this.ops[this.ops.length - 1];
|
|
51
|
+
if (last !== void 0 && isDelete(last)) this.ops[this.ops.length - 1] = last - count;
|
|
52
|
+
else this.ops.push(-count);
|
|
53
|
+
return this;
|
|
54
|
+
}
|
|
55
|
+
/** Whether the operation changes nothing. */
|
|
56
|
+
isNoop() {
|
|
57
|
+
return this.ops.length === 0 || this.ops.length === 1 && isRetain(this.ops[0]);
|
|
58
|
+
}
|
|
59
|
+
/** Apply to a string. Throws if the lengths don't match. */
|
|
60
|
+
apply(doc) {
|
|
61
|
+
if (doc.length !== this.baseLength) throw new Error(`Operation base length ${this.baseLength} does not match document length ${doc.length}`);
|
|
62
|
+
const out = [];
|
|
63
|
+
let index = 0;
|
|
64
|
+
for (const op of this.ops) if (isRetain(op)) {
|
|
65
|
+
out.push(doc.slice(index, index + op));
|
|
66
|
+
index += op;
|
|
67
|
+
} else if (isInsert(op)) out.push(op);
|
|
68
|
+
else index -= op;
|
|
69
|
+
return out.join("");
|
|
70
|
+
}
|
|
71
|
+
/** The operation that undoes this one on `doc` (the pre-image). */
|
|
72
|
+
invert(doc) {
|
|
73
|
+
const inverse = new TextOperation();
|
|
74
|
+
let index = 0;
|
|
75
|
+
for (const op of this.ops) if (isRetain(op)) {
|
|
76
|
+
inverse.retain(op);
|
|
77
|
+
index += op;
|
|
78
|
+
} else if (isInsert(op)) inverse.delete(op.length);
|
|
79
|
+
else {
|
|
80
|
+
inverse.insert(doc.slice(index, index - op));
|
|
81
|
+
index -= op;
|
|
82
|
+
}
|
|
83
|
+
return inverse;
|
|
84
|
+
}
|
|
85
|
+
/** Combine with an operation that follows this one: `apply(apply(d, a), b) === apply(d, a.compose(b))`. */
|
|
86
|
+
compose(next) {
|
|
87
|
+
if (this.targetLength !== next.baseLength) throw new Error("compose: length mismatch");
|
|
88
|
+
const result = new TextOperation();
|
|
89
|
+
const a = this.ops;
|
|
90
|
+
const b = next.ops;
|
|
91
|
+
let i = 0;
|
|
92
|
+
let j = 0;
|
|
93
|
+
let opA = a[i++];
|
|
94
|
+
let opB = b[j++];
|
|
95
|
+
for (;;) {
|
|
96
|
+
const ka = kind(opA);
|
|
97
|
+
const kb = kind(opB);
|
|
98
|
+
if (ka === "none" && kb === "none") break;
|
|
99
|
+
if (ka === "delete") {
|
|
100
|
+
result.delete(opA);
|
|
101
|
+
opA = a[i++];
|
|
102
|
+
continue;
|
|
103
|
+
}
|
|
104
|
+
if (kb === "insert") {
|
|
105
|
+
result.insert(opB);
|
|
106
|
+
opB = b[j++];
|
|
107
|
+
continue;
|
|
108
|
+
}
|
|
109
|
+
if (ka === "none" || kb === "none") throw new Error("compose: operations do not line up");
|
|
110
|
+
if (ka === "retain" && kb === "retain") {
|
|
111
|
+
const x = opA;
|
|
112
|
+
const y = opB;
|
|
113
|
+
if (x > y) {
|
|
114
|
+
result.retain(y);
|
|
115
|
+
opA = x - y;
|
|
116
|
+
opB = b[j++];
|
|
117
|
+
} else if (x === y) {
|
|
118
|
+
result.retain(x);
|
|
119
|
+
opA = a[i++];
|
|
120
|
+
opB = b[j++];
|
|
121
|
+
} else {
|
|
122
|
+
result.retain(x);
|
|
123
|
+
opB = y - x;
|
|
124
|
+
opA = a[i++];
|
|
125
|
+
}
|
|
126
|
+
} else if (ka === "insert" && kb === "delete") {
|
|
127
|
+
const x = opA;
|
|
128
|
+
const y = -opB;
|
|
129
|
+
if (x.length > y) {
|
|
130
|
+
opA = x.slice(y);
|
|
131
|
+
opB = b[j++];
|
|
132
|
+
} else if (x.length === y) {
|
|
133
|
+
opA = a[i++];
|
|
134
|
+
opB = b[j++];
|
|
135
|
+
} else {
|
|
136
|
+
opB = -(y - x.length);
|
|
137
|
+
opA = a[i++];
|
|
138
|
+
}
|
|
139
|
+
} else if (ka === "insert" && kb === "retain") {
|
|
140
|
+
const x = opA;
|
|
141
|
+
const y = opB;
|
|
142
|
+
if (x.length > y) {
|
|
143
|
+
result.insert(x.slice(0, y));
|
|
144
|
+
opA = x.slice(y);
|
|
145
|
+
opB = b[j++];
|
|
146
|
+
} else if (x.length === y) {
|
|
147
|
+
result.insert(x);
|
|
148
|
+
opA = a[i++];
|
|
149
|
+
opB = b[j++];
|
|
150
|
+
} else {
|
|
151
|
+
result.insert(x);
|
|
152
|
+
opB = y - x.length;
|
|
153
|
+
opA = a[i++];
|
|
154
|
+
}
|
|
155
|
+
} else if (ka === "retain" && kb === "delete") {
|
|
156
|
+
const x = opA;
|
|
157
|
+
const y = -opB;
|
|
158
|
+
if (x > y) {
|
|
159
|
+
result.delete(y);
|
|
160
|
+
opA = x - y;
|
|
161
|
+
opB = b[j++];
|
|
162
|
+
} else if (x === y) {
|
|
163
|
+
result.delete(y);
|
|
164
|
+
opA = a[i++];
|
|
165
|
+
opB = b[j++];
|
|
166
|
+
} else {
|
|
167
|
+
result.delete(x);
|
|
168
|
+
opB = -(y - x);
|
|
169
|
+
opA = a[i++];
|
|
170
|
+
}
|
|
171
|
+
} else throw new Error("compose: unexpected components");
|
|
172
|
+
}
|
|
173
|
+
return result;
|
|
174
|
+
}
|
|
175
|
+
/**
|
|
176
|
+
* Transform two concurrent operations. When both insert at the same position,
|
|
177
|
+
* `a`'s text goes first. The client and server both pass the *client's*
|
|
178
|
+
* operation as `a`, so every replica breaks ties the same way.
|
|
179
|
+
*/
|
|
180
|
+
static transform(a, b) {
|
|
181
|
+
if (a.baseLength !== b.baseLength) throw new Error("transform: operations must share a base");
|
|
182
|
+
const aPrime = new TextOperation();
|
|
183
|
+
const bPrime = new TextOperation();
|
|
184
|
+
const opsA = a.ops;
|
|
185
|
+
const opsB = b.ops;
|
|
186
|
+
let i = 0;
|
|
187
|
+
let j = 0;
|
|
188
|
+
let opA = opsA[i++];
|
|
189
|
+
let opB = opsB[j++];
|
|
190
|
+
for (;;) {
|
|
191
|
+
const ka = kind(opA);
|
|
192
|
+
const kb = kind(opB);
|
|
193
|
+
if (ka === "none" && kb === "none") break;
|
|
194
|
+
if (ka === "insert") {
|
|
195
|
+
aPrime.insert(opA);
|
|
196
|
+
bPrime.retain(opA.length);
|
|
197
|
+
opA = opsA[i++];
|
|
198
|
+
continue;
|
|
199
|
+
}
|
|
200
|
+
if (kb === "insert") {
|
|
201
|
+
aPrime.retain(opB.length);
|
|
202
|
+
bPrime.insert(opB);
|
|
203
|
+
opB = opsB[j++];
|
|
204
|
+
continue;
|
|
205
|
+
}
|
|
206
|
+
if (ka === "none" || kb === "none") throw new Error("transform: operations do not line up");
|
|
207
|
+
const x = Math.abs(opA);
|
|
208
|
+
const y = Math.abs(opB);
|
|
209
|
+
const min = Math.min(x, y);
|
|
210
|
+
if (ka === "retain" && kb === "retain") {
|
|
211
|
+
aPrime.retain(min);
|
|
212
|
+
bPrime.retain(min);
|
|
213
|
+
} else if (ka === "delete" && kb === "retain") aPrime.delete(min);
|
|
214
|
+
else if (ka === "retain" && kb === "delete") bPrime.delete(min);
|
|
215
|
+
if (x > y) {
|
|
216
|
+
opA = ka === "retain" ? x - y : -(x - y);
|
|
217
|
+
opB = opsB[j++];
|
|
218
|
+
} else if (x === y) {
|
|
219
|
+
opA = opsA[i++];
|
|
220
|
+
opB = opsB[j++];
|
|
221
|
+
} else {
|
|
222
|
+
opB = kb === "retain" ? y - x : -(y - x);
|
|
223
|
+
opA = opsA[i++];
|
|
224
|
+
}
|
|
225
|
+
}
|
|
226
|
+
return [aPrime, bPrime];
|
|
227
|
+
}
|
|
228
|
+
/**
|
|
229
|
+
* Map a cursor position through this operation. Inserts exactly at the cursor
|
|
230
|
+
* push it forward unless `stickLeft` is true (use that for your own cursor).
|
|
231
|
+
*/
|
|
232
|
+
transformIndex(index, stickLeft = false) {
|
|
233
|
+
let newIndex = index;
|
|
234
|
+
let pos = 0;
|
|
235
|
+
for (const op of this.ops) {
|
|
236
|
+
if (pos > index) break;
|
|
237
|
+
if (isRetain(op)) pos += op;
|
|
238
|
+
else if (isInsert(op)) {
|
|
239
|
+
if (pos < index || pos === index && !stickLeft) newIndex += op.length;
|
|
240
|
+
} else {
|
|
241
|
+
newIndex -= Math.min(-op, Math.max(0, index - pos));
|
|
242
|
+
pos -= op;
|
|
243
|
+
}
|
|
244
|
+
}
|
|
245
|
+
return newIndex;
|
|
246
|
+
}
|
|
247
|
+
/** Operation that turns `before` into `after` (one changed region). */
|
|
248
|
+
static fromDiff(before, after) {
|
|
249
|
+
let start = 0;
|
|
250
|
+
const minLen = Math.min(before.length, after.length);
|
|
251
|
+
while (start < minLen && before[start] === after[start]) start++;
|
|
252
|
+
let endBefore = before.length;
|
|
253
|
+
let endAfter = after.length;
|
|
254
|
+
while (endBefore > start && endAfter > start && before[endBefore - 1] === after[endAfter - 1]) {
|
|
255
|
+
endBefore--;
|
|
256
|
+
endAfter--;
|
|
257
|
+
}
|
|
258
|
+
return new TextOperation().retain(start).delete(endBefore - start).insert(after.slice(start, endAfter)).retain(before.length - endBefore);
|
|
259
|
+
}
|
|
260
|
+
equals(other) {
|
|
261
|
+
return this.baseLength === other.baseLength && this.targetLength === other.targetLength && this.ops.length === other.ops.length && this.ops.every((op, i) => op === other.ops[i]);
|
|
262
|
+
}
|
|
263
|
+
toJSON() {
|
|
264
|
+
return [...this.ops];
|
|
265
|
+
}
|
|
266
|
+
static fromJSON(ops) {
|
|
267
|
+
if (!Array.isArray(ops)) throw new Error("Invalid operation");
|
|
268
|
+
const op = new TextOperation();
|
|
269
|
+
for (const c of ops) if (typeof c === "string") op.insert(c);
|
|
270
|
+
else if (typeof c === "number" && Number.isInteger(c)) {
|
|
271
|
+
if (c > 0) op.retain(c);
|
|
272
|
+
else op.delete(c);
|
|
273
|
+
} else throw new Error("Invalid operation component");
|
|
274
|
+
return op;
|
|
275
|
+
}
|
|
276
|
+
toString() {
|
|
277
|
+
return this.ops.map((op) => isRetain(op) ? `retain ${op}` : isInsert(op) ? `insert ${JSON.stringify(op)}` : `delete ${-op}`).join(", ");
|
|
278
|
+
}
|
|
279
|
+
};
|
|
280
|
+
export { TextOperation };
|
|
281
|
+
|
|
282
|
+
//# sourceMappingURL=text-operation.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"text-operation.js","names":[],"sources":["../../../src/realtime/ot/text-operation.ts"],"sourcesContent":["/**\n * TextOperation: a convergent operational-transform type for plain text.\n *\n * An operation is a list of components that walks the whole document:\n * - a positive integer **retains** that many characters\n * - a string **inserts** it\n * - a negative integer **deletes** that many characters\n *\n * `transform(a, b)` returns `[a', b']` such that `apply(apply(doc, a), b') ===\n * apply(apply(doc, b), a')`, which is what makes concurrent editing converge.\n * Positions count UTF-16 code units, like JavaScript strings.\n *\n * @module realtime/ot/text-operation\n */\n\nexport type OpComponent = number | string;\n\nconst isRetain = (c: OpComponent): c is number => typeof c === 'number' && c > 0;\nconst isDelete = (c: OpComponent): c is number => typeof c === 'number' && c < 0;\nconst isInsert = (c: OpComponent): c is string => typeof c === 'string';\n\nfunction kind(c: OpComponent | undefined): 'retain' | 'insert' | 'delete' | 'none' {\n if (c === undefined) return 'none';\n if (typeof c === 'string') return 'insert';\n return c > 0 ? 'retain' : 'delete';\n}\n\nexport class TextOperation {\n /** Components; adjacent components of the same kind are always merged. */\n readonly ops: OpComponent[] = [];\n /** Length of the document this operation applies to. */\n baseLength = 0;\n /** Length of the document after applying it. */\n targetLength = 0;\n\n /** Skip over `n` characters. */\n retain(n: number): this {\n if (n < 0) throw new Error('retain expects a non-negative integer');\n if (n === 0) return this;\n this.baseLength += n;\n this.targetLength += n;\n const last = this.ops[this.ops.length - 1];\n if (last !== undefined && isRetain(last)) this.ops[this.ops.length - 1] = last + n;\n else this.ops.push(n);\n return this;\n }\n\n /** Insert text at the current position. */\n insert(text: string): this {\n if (text === '') return this;\n this.targetLength += text.length;\n const ops = this.ops;\n const last = ops[ops.length - 1];\n if (last !== undefined && isInsert(last)) {\n ops[ops.length - 1] = last + text;\n } else if (last !== undefined && isDelete(last)) {\n // Keep inserts before deletes so equivalent operations look the same.\n const prev = ops[ops.length - 2];\n if (prev !== undefined && isInsert(prev)) ops[ops.length - 2] = prev + text;\n else {\n ops[ops.length] = last;\n ops[ops.length - 2] = text;\n }\n } else {\n ops.push(text);\n }\n return this;\n }\n\n /** Delete `n` characters. */\n delete(n: number): this {\n const count = Math.abs(n);\n if (count === 0) return this;\n this.baseLength += count;\n const last = this.ops[this.ops.length - 1];\n if (last !== undefined && isDelete(last)) this.ops[this.ops.length - 1] = last - count;\n else this.ops.push(-count);\n return this;\n }\n\n /** Whether the operation changes nothing. */\n isNoop(): boolean {\n return this.ops.length === 0 || (this.ops.length === 1 && isRetain(this.ops[0]));\n }\n\n /** Apply to a string. Throws if the lengths don't match. */\n apply(doc: string): string {\n if (doc.length !== this.baseLength) {\n throw new Error(`Operation base length ${this.baseLength} does not match document length ${doc.length}`);\n }\n const out: string[] = [];\n let index = 0;\n for (const op of this.ops) {\n if (isRetain(op)) {\n out.push(doc.slice(index, index + op));\n index += op;\n } else if (isInsert(op)) {\n out.push(op);\n } else {\n index -= op;\n }\n }\n return out.join('');\n }\n\n /** The operation that undoes this one on `doc` (the pre-image). */\n invert(doc: string): TextOperation {\n const inverse = new TextOperation();\n let index = 0;\n for (const op of this.ops) {\n if (isRetain(op)) {\n inverse.retain(op);\n index += op;\n } else if (isInsert(op)) {\n inverse.delete(op.length);\n } else {\n inverse.insert(doc.slice(index, index - op));\n index -= op;\n }\n }\n return inverse;\n }\n\n /** Combine with an operation that follows this one: `apply(apply(d, a), b) === apply(d, a.compose(b))`. */\n compose(next: TextOperation): TextOperation {\n if (this.targetLength !== next.baseLength) throw new Error('compose: length mismatch');\n const result = new TextOperation();\n const a = this.ops;\n const b = next.ops;\n let i = 0;\n let j = 0;\n let opA: OpComponent | undefined = a[i++];\n let opB: OpComponent | undefined = b[j++];\n for (;;) {\n const ka = kind(opA);\n const kb = kind(opB);\n if (ka === 'none' && kb === 'none') break;\n if (ka === 'delete') {\n result.delete(opA as number);\n opA = a[i++];\n continue;\n }\n if (kb === 'insert') {\n result.insert(opB as string);\n opB = b[j++];\n continue;\n }\n if (ka === 'none' || kb === 'none') throw new Error('compose: operations do not line up');\n\n if (ka === 'retain' && kb === 'retain') {\n const x = opA as number;\n const y = opB as number;\n if (x > y) {\n result.retain(y);\n opA = x - y;\n opB = b[j++];\n } else if (x === y) {\n result.retain(x);\n opA = a[i++];\n opB = b[j++];\n } else {\n result.retain(x);\n opB = y - x;\n opA = a[i++];\n }\n } else if (ka === 'insert' && kb === 'delete') {\n const x = opA as string;\n const y: number = -(opB as number);\n if (x.length > y) {\n opA = x.slice(y);\n opB = b[j++];\n } else if (x.length === y) {\n opA = a[i++];\n opB = b[j++];\n } else {\n opB = -(y - x.length);\n opA = a[i++];\n }\n } else if (ka === 'insert' && kb === 'retain') {\n const x = opA as string;\n const y = opB as number;\n if (x.length > y) {\n result.insert(x.slice(0, y));\n opA = x.slice(y);\n opB = b[j++];\n } else if (x.length === y) {\n result.insert(x);\n opA = a[i++];\n opB = b[j++];\n } else {\n result.insert(x);\n opB = y - x.length;\n opA = a[i++];\n }\n } else if (ka === 'retain' && kb === 'delete') {\n const x = opA as number;\n const y: number = -(opB as number);\n if (x > y) {\n result.delete(y);\n opA = x - y;\n opB = b[j++];\n } else if (x === y) {\n result.delete(y);\n opA = a[i++];\n opB = b[j++];\n } else {\n result.delete(x);\n opB = -(y - x);\n opA = a[i++];\n }\n } else {\n throw new Error('compose: unexpected components');\n }\n }\n return result;\n }\n\n /**\n * Transform two concurrent operations. When both insert at the same position,\n * `a`'s text goes first. The client and server both pass the *client's*\n * operation as `a`, so every replica breaks ties the same way.\n */\n static transform(a: TextOperation, b: TextOperation): [TextOperation, TextOperation] {\n if (a.baseLength !== b.baseLength) throw new Error('transform: operations must share a base');\n const aPrime = new TextOperation();\n const bPrime = new TextOperation();\n const opsA = a.ops;\n const opsB = b.ops;\n let i = 0;\n let j = 0;\n let opA: OpComponent | undefined = opsA[i++];\n let opB: OpComponent | undefined = opsB[j++];\n for (;;) {\n const ka = kind(opA);\n const kb = kind(opB);\n if (ka === 'none' && kb === 'none') break;\n if (ka === 'insert') {\n aPrime.insert(opA as string);\n bPrime.retain((opA as string).length);\n opA = opsA[i++];\n continue;\n }\n if (kb === 'insert') {\n aPrime.retain((opB as string).length);\n bPrime.insert(opB as string);\n opB = opsB[j++];\n continue;\n }\n if (ka === 'none' || kb === 'none') throw new Error('transform: operations do not line up');\n\n // Both components now consume base characters; work with lengths.\n const x = Math.abs(opA as number);\n const y = Math.abs(opB as number);\n const min = Math.min(x, y);\n if (ka === 'retain' && kb === 'retain') {\n aPrime.retain(min);\n bPrime.retain(min);\n } else if (ka === 'delete' && kb === 'retain') {\n aPrime.delete(min);\n } else if (ka === 'retain' && kb === 'delete') {\n bPrime.delete(min);\n }\n // delete/delete: both removed the same text; neither side needs to.\n if (x > y) {\n opA = ka === 'retain' ? x - y : -(x - y);\n opB = opsB[j++];\n } else if (x === y) {\n opA = opsA[i++];\n opB = opsB[j++];\n } else {\n opB = kb === 'retain' ? y - x : -(y - x);\n opA = opsA[i++];\n }\n }\n return [aPrime, bPrime];\n }\n\n /**\n * Map a cursor position through this operation. Inserts exactly at the cursor\n * push it forward unless `stickLeft` is true (use that for your own cursor).\n */\n transformIndex(index: number, stickLeft = false): number {\n let newIndex = index;\n let pos = 0;\n for (const op of this.ops) {\n if (pos > index) break;\n if (isRetain(op)) {\n pos += op;\n } else if (isInsert(op)) {\n if (pos < index || (pos === index && !stickLeft)) newIndex += op.length;\n } else {\n newIndex -= Math.min(-op, Math.max(0, index - pos));\n pos -= op;\n }\n }\n return newIndex;\n }\n\n /** Operation that turns `before` into `after` (one changed region). */\n static fromDiff(before: string, after: string): TextOperation {\n let start = 0;\n const minLen = Math.min(before.length, after.length);\n while (start < minLen && before[start] === after[start]) start++;\n let endBefore = before.length;\n let endAfter = after.length;\n while (endBefore > start && endAfter > start && before[endBefore - 1] === after[endAfter - 1]) {\n endBefore--;\n endAfter--;\n }\n return new TextOperation()\n .retain(start)\n .delete(endBefore - start)\n .insert(after.slice(start, endAfter))\n .retain(before.length - endBefore);\n }\n\n equals(other: TextOperation): boolean {\n return this.baseLength === other.baseLength && this.targetLength === other.targetLength &&\n this.ops.length === other.ops.length && this.ops.every((op, i) => op === other.ops[i]);\n }\n\n toJSON(): OpComponent[] {\n return [...this.ops];\n }\n\n static fromJSON(ops: unknown): TextOperation {\n if (!Array.isArray(ops)) throw new Error('Invalid operation');\n const op = new TextOperation();\n for (const c of ops) {\n if (typeof c === 'string') op.insert(c);\n else if (typeof c === 'number' && Number.isInteger(c)) {\n if (c > 0) op.retain(c);\n else op.delete(c);\n } else throw new Error('Invalid operation component');\n }\n return op;\n }\n\n toString(): string {\n return this.ops.map(op => (isRetain(op) ? `retain ${op}` : isInsert(op) ? `insert ${JSON.stringify(op)}` : `delete ${-op}`)).join(', ');\n }\n}\n"],"mappings":";AAiBA,IAAM,YAAY,MAAgC,OAAO,MAAM,YAAY,IAAI;AAC/E,IAAM,YAAY,MAAgC,OAAO,MAAM,YAAY,IAAI;AAC/E,IAAM,YAAY,MAAgC,OAAO,MAAM;AAE/D,SAAS,KAAK,GAAqE;CACjF,IAAI,MAAM,KAAA,GAAW,OAAO;CAC5B,IAAI,OAAO,MAAM,UAAU,OAAO;CAClC,OAAO,IAAI,IAAI,WAAW;AAC5B;AAEA,IAAa,gBAAb,MAAa,cAAc;;CAEzB,MAA8B,CAAC;;CAE/B,aAAa;;CAEb,eAAe;;CAGf,OAAO,GAAiB;EACtB,IAAI,IAAI,GAAG,MAAM,IAAI,MAAM,uCAAuC;EAClE,IAAI,MAAM,GAAG,OAAO;EACpB,KAAK,cAAc;EACnB,KAAK,gBAAgB;EACrB,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,SAAS;EACxC,IAAI,SAAS,KAAA,KAAa,SAAS,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,SAAS,KAAK,OAAO;OAC5E,KAAK,IAAI,KAAK,CAAC;EACpB,OAAO;CACT;;CAGA,OAAO,MAAoB;EACzB,IAAI,SAAS,IAAI,OAAO;EACxB,KAAK,gBAAgB,KAAK;EAC1B,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,IAAI,IAAI,SAAS;EAC9B,IAAI,SAAS,KAAA,KAAa,SAAS,IAAI,GACrC,IAAI,IAAI,SAAS,KAAK,OAAO;OACxB,IAAI,SAAS,KAAA,KAAa,SAAS,IAAI,GAAG;GAE/C,MAAM,OAAO,IAAI,IAAI,SAAS;GAC9B,IAAI,SAAS,KAAA,KAAa,SAAS,IAAI,GAAG,IAAI,IAAI,SAAS,KAAK,OAAO;QAClE;IACH,IAAI,IAAI,UAAU;IAClB,IAAI,IAAI,SAAS,KAAK;GACxB;EACF,OACE,IAAI,KAAK,IAAI;EAEf,OAAO;CACT;;CAGA,OAAO,GAAiB;EACtB,MAAM,QAAQ,KAAK,IAAI,CAAC;EACxB,IAAI,UAAU,GAAG,OAAO;EACxB,KAAK,cAAc;EACnB,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,SAAS;EACxC,IAAI,SAAS,KAAA,KAAa,SAAS,IAAI,GAAG,KAAK,IAAI,KAAK,IAAI,SAAS,KAAK,OAAO;OAC5E,KAAK,IAAI,KAAK,CAAC,KAAK;EACzB,OAAO;CACT;;CAGA,SAAkB;EAChB,OAAO,KAAK,IAAI,WAAW,KAAM,KAAK,IAAI,WAAW,KAAK,SAAS,KAAK,IAAI,EAAE;CAChF;;CAGA,MAAM,KAAqB;EACzB,IAAI,IAAI,WAAW,KAAK,YACtB,MAAM,IAAI,MAAM,yBAAyB,KAAK,WAAW,kCAAkC,IAAI,QAAQ;EAEzG,MAAM,MAAgB,CAAC;EACvB,IAAI,QAAQ;EACZ,KAAK,MAAM,MAAM,KAAK,KACpB,IAAI,SAAS,EAAE,GAAG;GAChB,IAAI,KAAK,IAAI,MAAM,OAAO,QAAQ,EAAE,CAAC;GACrC,SAAS;EACX,OAAO,IAAI,SAAS,EAAE,GACpB,IAAI,KAAK,EAAE;OAEX,SAAS;EAGb,OAAO,IAAI,KAAK,EAAE;CACpB;;CAGA,OAAO,KAA4B;EACjC,MAAM,UAAU,IAAI,cAAc;EAClC,IAAI,QAAQ;EACZ,KAAK,MAAM,MAAM,KAAK,KACpB,IAAI,SAAS,EAAE,GAAG;GAChB,QAAQ,OAAO,EAAE;GACjB,SAAS;EACX,OAAO,IAAI,SAAS,EAAE,GACpB,QAAQ,OAAO,GAAG,MAAM;OACnB;GACL,QAAQ,OAAO,IAAI,MAAM,OAAO,QAAQ,EAAE,CAAC;GAC3C,SAAS;EACX;EAEF,OAAO;CACT;;CAGA,QAAQ,MAAoC;EAC1C,IAAI,KAAK,iBAAiB,KAAK,YAAY,MAAM,IAAI,MAAM,0BAA0B;EACrF,MAAM,SAAS,IAAI,cAAc;EACjC,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,KAAK;EACf,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,MAA+B,EAAE;EACrC,IAAI,MAA+B,EAAE;EACrC,SAAS;GACP,MAAM,KAAK,KAAK,GAAG;GACnB,MAAM,KAAK,KAAK,GAAG;GACnB,IAAI,OAAO,UAAU,OAAO,QAAQ;GACpC,IAAI,OAAO,UAAU;IACnB,OAAO,OAAO,GAAa;IAC3B,MAAM,EAAE;IACR;GACF;GACA,IAAI,OAAO,UAAU;IACnB,OAAO,OAAO,GAAa;IAC3B,MAAM,EAAE;IACR;GACF;GACA,IAAI,OAAO,UAAU,OAAO,QAAQ,MAAM,IAAI,MAAM,oCAAoC;GAExF,IAAI,OAAO,YAAY,OAAO,UAAU;IACtC,MAAM,IAAI;IACV,MAAM,IAAI;IACV,IAAI,IAAI,GAAG;KACT,OAAO,OAAO,CAAC;KACf,MAAM,IAAI;KACV,MAAM,EAAE;IACV,OAAO,IAAI,MAAM,GAAG;KAClB,OAAO,OAAO,CAAC;KACf,MAAM,EAAE;KACR,MAAM,EAAE;IACV,OAAO;KACL,OAAO,OAAO,CAAC;KACf,MAAM,IAAI;KACV,MAAM,EAAE;IACV;GACF,OAAO,IAAI,OAAO,YAAY,OAAO,UAAU;IAC7C,MAAM,IAAI;IACV,MAAM,IAAY,CAAE;IACpB,IAAI,EAAE,SAAS,GAAG;KAChB,MAAM,EAAE,MAAM,CAAC;KACf,MAAM,EAAE;IACV,OAAO,IAAI,EAAE,WAAW,GAAG;KACzB,MAAM,EAAE;KACR,MAAM,EAAE;IACV,OAAO;KACL,MAAM,EAAE,IAAI,EAAE;KACd,MAAM,EAAE;IACV;GACF,OAAO,IAAI,OAAO,YAAY,OAAO,UAAU;IAC7C,MAAM,IAAI;IACV,MAAM,IAAI;IACV,IAAI,EAAE,SAAS,GAAG;KAChB,OAAO,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC;KAC3B,MAAM,EAAE,MAAM,CAAC;KACf,MAAM,EAAE;IACV,OAAO,IAAI,EAAE,WAAW,GAAG;KACzB,OAAO,OAAO,CAAC;KACf,MAAM,EAAE;KACR,MAAM,EAAE;IACV,OAAO;KACL,OAAO,OAAO,CAAC;KACf,MAAM,IAAI,EAAE;KACZ,MAAM,EAAE;IACV;GACF,OAAO,IAAI,OAAO,YAAY,OAAO,UAAU;IAC7C,MAAM,IAAI;IACV,MAAM,IAAY,CAAE;IACpB,IAAI,IAAI,GAAG;KACT,OAAO,OAAO,CAAC;KACf,MAAM,IAAI;KACV,MAAM,EAAE;IACV,OAAO,IAAI,MAAM,GAAG;KAClB,OAAO,OAAO,CAAC;KACf,MAAM,EAAE;KACR,MAAM,EAAE;IACV,OAAO;KACL,OAAO,OAAO,CAAC;KACf,MAAM,EAAE,IAAI;KACZ,MAAM,EAAE;IACV;GACF,OACE,MAAM,IAAI,MAAM,gCAAgC;EAEpD;EACA,OAAO;CACT;;;;;;CAOA,OAAO,UAAU,GAAkB,GAAkD;EACnF,IAAI,EAAE,eAAe,EAAE,YAAY,MAAM,IAAI,MAAM,yCAAyC;EAC5F,MAAM,SAAS,IAAI,cAAc;EACjC,MAAM,SAAS,IAAI,cAAc;EACjC,MAAM,OAAO,EAAE;EACf,MAAM,OAAO,EAAE;EACf,IAAI,IAAI;EACR,IAAI,IAAI;EACR,IAAI,MAA+B,KAAK;EACxC,IAAI,MAA+B,KAAK;EACxC,SAAS;GACP,MAAM,KAAK,KAAK,GAAG;GACnB,MAAM,KAAK,KAAK,GAAG;GACnB,IAAI,OAAO,UAAU,OAAO,QAAQ;GACpC,IAAI,OAAO,UAAU;IACnB,OAAO,OAAO,GAAa;IAC3B,OAAO,OAAQ,IAAe,MAAM;IACpC,MAAM,KAAK;IACX;GACF;GACA,IAAI,OAAO,UAAU;IACnB,OAAO,OAAQ,IAAe,MAAM;IACpC,OAAO,OAAO,GAAa;IAC3B,MAAM,KAAK;IACX;GACF;GACA,IAAI,OAAO,UAAU,OAAO,QAAQ,MAAM,IAAI,MAAM,sCAAsC;GAG1F,MAAM,IAAI,KAAK,IAAI,GAAa;GAChC,MAAM,IAAI,KAAK,IAAI,GAAa;GAChC,MAAM,MAAM,KAAK,IAAI,GAAG,CAAC;GACzB,IAAI,OAAO,YAAY,OAAO,UAAU;IACtC,OAAO,OAAO,GAAG;IACjB,OAAO,OAAO,GAAG;GACnB,OAAO,IAAI,OAAO,YAAY,OAAO,UACnC,OAAO,OAAO,GAAG;QACZ,IAAI,OAAO,YAAY,OAAO,UACnC,OAAO,OAAO,GAAG;GAGnB,IAAI,IAAI,GAAG;IACT,MAAM,OAAO,WAAW,IAAI,IAAI,EAAE,IAAI;IACtC,MAAM,KAAK;GACb,OAAO,IAAI,MAAM,GAAG;IAClB,MAAM,KAAK;IACX,MAAM,KAAK;GACb,OAAO;IACL,MAAM,OAAO,WAAW,IAAI,IAAI,EAAE,IAAI;IACtC,MAAM,KAAK;GACb;EACF;EACA,OAAO,CAAC,QAAQ,MAAM;CACxB;;;;;CAMA,eAAe,OAAe,YAAY,OAAe;EACvD,IAAI,WAAW;EACf,IAAI,MAAM;EACV,KAAK,MAAM,MAAM,KAAK,KAAK;GACzB,IAAI,MAAM,OAAO;GACjB,IAAI,SAAS,EAAE,GACb,OAAO;QACF,IAAI,SAAS,EAAE,GAChB;QAAA,MAAM,SAAU,QAAQ,SAAS,CAAC,WAAY,YAAY,GAAG;GAAA,OAC5D;IACL,YAAY,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,QAAQ,GAAG,CAAC;IAClD,OAAO;GACT;EACF;EACA,OAAO;CACT;;CAGA,OAAO,SAAS,QAAgB,OAA8B;EAC5D,IAAI,QAAQ;EACZ,MAAM,SAAS,KAAK,IAAI,OAAO,QAAQ,MAAM,MAAM;EACnD,OAAO,QAAQ,UAAU,OAAO,WAAW,MAAM,QAAQ;EACzD,IAAI,YAAY,OAAO;EACvB,IAAI,WAAW,MAAM;EACrB,OAAO,YAAY,SAAS,WAAW,SAAS,OAAO,YAAY,OAAO,MAAM,WAAW,IAAI;GAC7F;GACA;EACF;EACA,OAAO,IAAI,cAAc,CAAC,CACvB,OAAO,KAAK,CAAC,CACb,OAAO,YAAY,KAAK,CAAC,CACzB,OAAO,MAAM,MAAM,OAAO,QAAQ,CAAC,CAAC,CACpC,OAAO,OAAO,SAAS,SAAS;CACrC;CAEA,OAAO,OAA+B;EACpC,OAAO,KAAK,eAAe,MAAM,cAAc,KAAK,iBAAiB,MAAM,gBACzE,KAAK,IAAI,WAAW,MAAM,IAAI,UAAU,KAAK,IAAI,OAAO,IAAI,MAAM,OAAO,MAAM,IAAI,EAAE;CACzF;CAEA,SAAwB;EACtB,OAAO,CAAC,GAAG,KAAK,GAAG;CACrB;CAEA,OAAO,SAAS,KAA6B;EAC3C,IAAI,CAAC,MAAM,QAAQ,GAAG,GAAG,MAAM,IAAI,MAAM,mBAAmB;EAC5D,MAAM,KAAK,IAAI,cAAc;EAC7B,KAAK,MAAM,KAAK,KACd,IAAI,OAAO,MAAM,UAAU,GAAG,OAAO,CAAC;OACjC,IAAI,OAAO,MAAM,YAAY,OAAO,UAAU,CAAC,GAAG;GACrD,IAAI,IAAI,GAAG,GAAG,OAAO,CAAC;QACjB,GAAG,OAAO,CAAC;EAClB,OAAO,MAAM,IAAI,MAAM,6BAA6B;EAEtD,OAAO;CACT;CAEA,WAAmB;EACjB,OAAO,KAAK,IAAI,KAAI,OAAO,SAAS,EAAE,IAAI,UAAU,OAAO,SAAS,EAAE,IAAI,UAAU,KAAK,UAAU,EAAE,MAAM,UAAU,CAAC,IAAK,CAAC,CAAC,KAAK,IAAI;CACxI;AACF"}
|