@llui/lexical-loro 0.1.0

package/dist/to-lexical.js

@@ -0,0 +1,636 @@
+/**
+ * Inbound sync: the Loro mirror → a Lexical `EditorState`.
+ *
+ * ── The one thing this must not do ─────────────────────────────────────────
+ *
+ * loro-prosemirror's inbound path replaces the whole document on every remote
+ * event (`sync-plugin.ts`). ProseMirror tolerates that. LEXICAL CANNOT: its
+ * `NodeKey` is a bare counter (`LexicalUtils.ts`: `'' + keyCounter++`), so a
+ * rebuild mints a fresh key for every node, which tears down all DOM, destroys
+ * the selection and IME composition, and — decisively for this stack — destroys
+ * and remounts EVERY `LLuiDecoratorNode`, because `packages/lexical/decorator.ts`
+ * disposes the mounted LLui sub-app on the 'destroyed' mutation.
+ *
+ * So this module is a PERSISTENT MIRROR: it resolves each remote change to an
+ * existing `NodeKey` through the registry in `mapping.ts` and MUTATES THAT NODE
+ * IN PLACE. Nodes nothing touched are never written, so their keys — and
+ * therefore their DOM, their mounts, and any selection inside them — survive by
+ * construction. That is the model `@lexical/yjs`'s `SyncEditorStates.ts` uses,
+ * and it is the only one that works here.
+ *
+ * ── Why it reconciles from STATE, not from the deltas ──────────────────────
+ *
+ * The events say WHERE the document changed; this module then reconciles those
+ * containers against Loro's CURRENT state rather than replaying each delta. Four
+ * reasons, all learned from the event shapes loro-crdt actually emits:
+ *
+ *  1. A batch that creates a subtree emits the parent's list insert AND a
+ *     separate event for every descendant container. Replaying all of them
+ *     double-applies; reconciling from state is idempotent, so the duplicate
+ *     descriptions of one change collapse to one reconciliation.
+ *  2. A `LoroMovableList#move` arrives as an insert plus a delete carrying the
+ *     SAME `ContainerID`. Reconciling by identity recognises that as a move —
+ *     the whole point of the movable-list schema — where a delta replay would
+ *     see a delete and rebuild the subtree.
+ *  3. A map deletion is reported as an `undefined` value in `MapDiff.updated`,
+ *     which is indistinguishable from an absent key in most JS handling. Reading
+ *     the map is unambiguous.
+ *  4. It is the mirror image of `to-loro.ts`, so both directions share one
+ *     notion of "these two trees agree" (`text.ts`'s normalized runs) and cannot
+ *     drift apart in their idea of what a difference is.
+ *
+ * The events are therefore used as a DIRTY SET, exactly as `to-loro.ts` uses
+ * Lexical's `dirtyElements`/`dirtyLeaves`: every element on the path from the
+ * root to a changed container is marked, and the walk descends only into marked
+ * children. A remote keystroke costs O(tree depth), not O(document).
+ *
+ * ── Selection ──────────────────────────────────────────────────────────────
+ *
+ * Untouched nodes keep their keys, so a caret outside the changed run needs no
+ * help at all. Only the case where a remote change lands INSIDE the exact text
+ * run holding the caret needs work: there the caret's offset is transformed
+ * through the same single-region diff used to update the run (a caret at or
+ * before the edit point does not move; one after it shifts by
+ * `insert.length - remove`; one inside a deleted span clamps to the edit point).
+ * That is deliberately narrow — reaching for cursors more broadly would mean
+ * writing selection on every remote event, which is its own source of jitter.
+ */
+import { $createTextNode, $getRoot, $getSelection, $isElementNode, $isRangeSelection, $isTextNode, $parseSerializedNode, $setSelection, COLLABORATION_TAG, SKIP_SCROLL_INTO_VIEW_TAG, } from 'lexical';
+import { LoroMap, } from 'loro-crdt';
+import { ContainerNodeMap } from './mapping.js';
+import { KEY_TYPE, containerId, containerIsLive, elementProps, elementType, isTextContainer, orderedChildren, } from './schema.js';
+import { diffTextWithCursor, normalizeRuns, runsFromText, runsText } from './text.js';
+// ---------------------------------------------------------------------------
+// Public surface
+// ---------------------------------------------------------------------------
+/**
+ * Tags stamped on every inbound writeback.
+ *
+ * `COLLABORATION_TAG` is echo layer (b): `to-loro.ts` skips updates carrying it,
+ * so our own writeback cannot bounce back into the shared document.
+ * `SKIP_SCROLL_INTO_VIEW_TAG` stops a peer's edit from yanking the local
+ * viewport.
+ *
+ * `PROGRAMMATIC_TAG` is deliberately ABSENT and must stay that way — echo layer
+ * (c). `packages/lexical/src/foreign.ts` treats that tag as "the host pushed new
+ * content: cancel pending outbound work and rebase", so a remote writeback
+ * carrying it would silently cancel the local user's in-flight debounced
+ * `onChange` and the host's persistence would go dark whenever a peer types.
+ */
+export const INBOUND_TAGS = [COLLABORATION_TAG, SKIP_SCROLL_INTO_VIEW_TAG];
+/**
+ * Apply one Loro event batch to the editor.
+ *
+ * @returns whether anything was applied. `false` means the batch was an echo of
+ * our own write, or described no change the editor could see.
+ */
+export function applyLoroToLexical(target, batch) {
+    // ── Echo layer (a) ──────────────────────────────────────────────────────
+    // A local batch is this peer's own outbound write completing its commit. Our
+    // outbound listener already produced it FROM the editor; feeding it back would
+    // re-enter `editor.update` from inside a Lexical update listener.
+    if (batch.by === 'local') {
+        const origins = target.localOrigins ?? [];
+        if (batch.origin === undefined || !origins.includes(batch.origin))
+            return false;
+    }
+    if (batch.events.length === 0)
+        return false;
+    const dirty = collectDirtyElements(target.doc, containerId(target.root), batch.events);
+    return $applyReconciliation(target, dirty);
+}
+/**
+ * Reconcile the ENTIRE shared document into the editor, with no dirty gate.
+ *
+ * Used at boot by a peer adopting a document it has no event history for (see
+ * `seed.ts`), and as the fallback whenever an event's container ancestry cannot
+ * be resolved. Full-fidelity and identity-preserving: adopting a document the
+ * editor already matches writes nothing and churns no NodeKeys.
+ */
+export function adoptLoroDocument(target) {
+    return $applyReconciliation(target, null);
+}
+// ---------------------------------------------------------------------------
+// The dirty set
+// ---------------------------------------------------------------------------
+/**
+ * Every element container on the path from the root to a container this batch
+ * touched — the inbound analogue of Lexical's `dirtyElements`.
+ *
+ * The walk goes UP from each event target via `parent()`, so it needs no path
+ * arithmetic and cannot be confused by indices that shifted within the batch.
+ *
+ * ── The fail-safe, and why it must be exactly this one ─────────────────────
+ *
+ * The gate is only sound if the editor already agreed with the document before
+ * the batch: a child that is not marked is left ALONE, so a single event whose
+ * location we resolve too narrowly leaves that subtree permanently stale, and
+ * nothing later repairs it (no future batch will mention it either). A narrowed
+ * dirty set is therefore not a small error — it is silent, unrecoverable
+ * divergence.
+ *
+ * So anything less than a walk that terminates at the ROOT WE MIRROR returns
+ * `null`, which drops the gate and falls back to a full structural pass —
+ * correct regardless of provenance, at the cost of one O(document) walk. An
+ * earlier version skipped events whose target reported `isDeleted()` instead,
+ * and a randomized three-peer test caught it: a container one peer deletes and
+ * another concurrently MOVES is resurrected by the merge, but reports itself
+ * deleted to the peer that removed it, so its events were dropped and that
+ * peer's editor silently stopped tracking the run for the rest of the session.
+ */
+function collectDirtyElements(doc, rootId, events) {
+    const dirty = new Set();
+    for (const event of events) {
+        let cursor = doc.getContainerById(event.target);
+        let reached = false;
+        while (cursor !== undefined) {
+            // An element map is the only container carrying `type`; `props` maps and
+            // `children` lists are addressed through the element that owns them.
+            if (cursor instanceof LoroMap && cursor.get(KEY_TYPE) !== undefined)
+                dirty.add(cursor.id);
+            if (cursor.id === rootId)
+                reached = true;
+            cursor = cursor.parent();
+        }
+        if (!reached)
+            return null;
+    }
+    return dirty;
+}
+function $applyReconciliation(target, dirty) {
+    const context = {
+        doc: target.doc,
+        mapping: target.mapping,
+        dirty,
+        points: [],
+        changed: false,
+        removed: false,
+    };
+    target.editor.update(() => {
+        capturePoints(context);
+        const root = $getRoot();
+        context.mapping.link(containerId(target.root), root.getKey());
+        $applyProps(target.root, root, context);
+        $reconcileChildren(target.root, root, context);
+        $restorePoints(context);
+    }, {
+        tag: [...INBOUND_TAGS],
+        skipTransforms: true,
+        // REQUIRED. Lexical merges and splits adjacent TextNodes behind our back
+        // and reports it via `normalizedNodes`; without a synchronous flush the
+        // ContainerID ↔ NodeKey mapping drifts and the document corrupts.
+        discrete: true,
+    });
+    if (context.removed) {
+        const nodeMap = target.editor.getEditorState()._nodeMap;
+        target.mapping.sweep({
+            hasContainer: (id) => containerIsLive(target.doc, id),
+            hasNode: (key) => nodeMap.has(key),
+        });
+    }
+    return context.changed;
+}
+// ---------------------------------------------------------------------------
+// Props
+// ---------------------------------------------------------------------------
+/**
+ * Apply an element container's props to an existing node, in place.
+ *
+ * `updateFromJSON` is Lexical's own in-place applier and the exact inverse of
+ * the `exportJSON` the outbound direction writes, so this stays generic over
+ * custom node types instead of poking private `__`-prefixed fields the way
+ * `@lexical/yjs` does.
+ *
+ * @returns `false` when the node's type does NOT implement `updateFromJSON`
+ * faithfully — the props did not take, so the caller must replace the node. That
+ * is detected by re-reading `exportJSON`, never assumed, because a node whose
+ * props silently fail to apply is a permanently-diverged document.
+ */
+function $applyProps(container, node, context) {
+    const props = elementProps(container).toJSON();
+    if (!propsDiffer(props, node))
+        return true;
+    node.updateFromJSON(props);
+    context.changed = true;
+    if (!propsDiffer(props, node))
+        return true;
+    // Fall through to replacement, but say why: a node type reaching this point
+    // has an `exportJSON` its `updateFromJSON` cannot round-trip, which costs its
+    // subtree's NodeKeys (and any decorator mount in it) on every remote change.
+    console.error(`lexical-loro: '${node.getType()}'.updateFromJSON() does not apply every property its ` +
+        'exportJSON() emits, so the node must be REPLACED on each remote change — which destroys ' +
+        'its NodeKey, its DOM, and any mounted decorator sub-app. Implement updateFromJSON.');
+    return false;
+}
+/**
+ * Whether any prop the shared document holds differs from the node's own.
+ *
+ * Reads through `getLatest()`, which is load-bearing rather than defensive:
+ * `updateFromJSON` writes through `getWritable()`, which CLONES the node, so the
+ * reference the caller is holding is stale the moment the write lands. Comparing
+ * against it would report the update as having failed and trigger a needless —
+ * and mount-destroying — node replacement.
+ */
+function propsDiffer(props, node) {
+    const current = node.getLatest().exportJSON();
+    for (const [key, value] of Object.entries(props)) {
+        if (!jsonEqual(current[key], value))
+            return true;
+    }
+    return false;
+}
+function jsonEqual(a, b) {
+    if (a === b)
+        return true;
+    if (a === null || b === null || typeof a !== 'object' || typeof b !== 'object')
+        return false;
+    if (Array.isArray(a) !== Array.isArray(b))
+        return false;
+    if (Array.isArray(a) && Array.isArray(b)) {
+        return a.length === b.length && a.every((item, i) => jsonEqual(item, b[i]));
+    }
+    const left = a;
+    const right = b;
+    const keys = Object.keys(left);
+    if (keys.length !== Object.keys(right).length)
+        return false;
+    return keys.every((key) => key in right && jsonEqual(left[key], right[key]));
+}
+function groupChildren(node) {
+    const out = [];
+    let run = [];
+    const flush = () => {
+        if (run.length === 0)
+            return;
+        out.push({ kind: 'text', nodes: run, anchor: run[0].getKey() });
+        run = [];
+    };
+    for (const child of node.getChildren()) {
+        if ($isTextNode(child))
+            run.push(child);
+        else {
+            flush();
+            out.push({ kind: 'element', node: child, key: child.getKey() });
+        }
+    }
+    flush();
+    return out;
+}
+/**
+ * Reconcile a Lexical element's children against its container's child list.
+ *
+ * Matching is by IDENTITY through the registry: a container that already
+ * addresses a node reuses that node wherever it has moved to, which is what
+ * turns a remote reorder — one `pos` register write — into a Lexical reorder
+ * rather than a rebuild. Text runs additionally fall back to ordinal matching
+ * among the text
+ * children (mirroring the outbound direction), so a run whose anchor Lexical
+ * normalized away still finds its nodes instead of recreating them.
+ */
+function $reconcileChildren(container, node, context) {
+    const desired = liveChildren(container);
+    const groups = groupChildren(node);
+    const claimed = new Set();
+    const byKey = new Map();
+    for (const group of groups) {
+        byKey.set(group.kind === 'text' ? group.anchor : group.key, group);
+    }
+    const textGroups = groups.filter((group) => group.kind === 'text');
+    let nextText = 0;
+    const matched = desired.map((child) => {
+        const key = context.mapping.nodeKey(containerId(child));
+        const found = key === undefined ? undefined : byKey.get(key);
+        if (found !== undefined && !claimed.has(found)) {
+            // A container whose node changed KIND (text ⇄ element) cannot be reused.
+            if (isTextContainer(child) === (found.kind === 'text')) {
+                claimed.add(found);
+                return found;
+            }
+        }
+        if (!isTextContainer(child))
+            return undefined;
+        while (nextText < textGroups.length && claimed.has(textGroups[nextText]))
+            nextText++;
+        const ordinal = textGroups[nextText];
+        if (ordinal === undefined)
+            return undefined;
+        nextText++;
+        claimed.add(ordinal);
+        return ordinal;
+    });
+    // 1. Build (or update in place) the node list this element should hold.
+    const ordered = [];
+    for (let i = 0; i < desired.length; i++) {
+        const child = desired[i];
+        const group = matched[i];
+        if (isTextContainer(child)) {
+            const existing = group !== undefined && group.kind === 'text' ? group.nodes : [];
+            const nodes = $reconcileTextRun(child, existing, context);
+            const id = containerId(child);
+            if (nodes.length === 0)
+                context.mapping.unlinkContainer(id);
+            else
+                context.mapping.link(id, nodes[0].getKey());
+            ordered.push(...nodes);
+            continue;
+        }
+        const existing = group !== undefined && group.kind === 'element' ? group.node : undefined;
+        ordered.push($reconcileElementChild(child, existing, context));
+    }
+    // 2. Remove whatever is no longer wanted. `preserveEmptyParent` is TRUE:
+    //    Lexical's default removes a parent that this leaves empty, which would
+    //    delete a block the shared document still holds.
+    const keep = new Set(ordered.map((child) => child.getKey()));
+    for (const group of groups) {
+        const nodes = group.kind === 'text' ? group.nodes : [group.node];
+        for (const child of nodes) {
+            if (keep.has(child.getKey()))
+                continue;
+            const id = context.mapping.containerId(child.getKey());
+            if (id !== undefined)
+                context.mapping.unlinkNode(child.getKey());
+            child.remove(true);
+            context.changed = true;
+            context.removed = true;
+        }
+    }
+    // 3. Place everything in order. Lexical's insert helpers MOVE an
+    //    already-attached node without minting a new key, so a reorder here costs
+    //    no identity — which is the whole point of the movable-list schema.
+    let previous = null;
+    for (const child of ordered) {
+        const parent = child.getParent();
+        const attached = parent !== null && parent.is(node);
+        const actual = attached ? child.getPreviousSibling() : undefined;
+        const inPlace = attached && ((actual === null && previous === null) || (actual?.is(previous) ?? false));
+        if (!inPlace) {
+            if (previous === null) {
+                const first = node.getFirstChild();
+                if (first === null)
+                    node.append(child);
+                else
+                    first.insertBefore(child, false);
+            }
+            else {
+                previous.insertAfter(child, false);
+            }
+            context.changed = true;
+        }
+        previous = child;
+    }
+}
+/**
+ * Reconcile one element child: update it in place when it is the same node, or
+ * build a fresh subtree when there is nothing reusable.
+ */
+function $reconcileElementChild(container, existing, context) {
+    const id = containerId(container);
+    if (existing !== undefined && existing.getType() === elementType(container)) {
+        // Not dirty ⇒ nothing under this container changed, so do not descend.
+        if (context.dirty !== null && !context.dirty.has(id)) {
+            context.mapping.link(id, existing.getKey());
+            return existing;
+        }
+        if ($applyProps(container, existing, context)) {
+            context.mapping.link(id, existing.getKey());
+            if ($isElementNode(existing))
+                $reconcileChildren(container, existing, context);
+            return existing;
+        }
+        // Props could not be applied in place; fall through and rebuild.
+    }
+    context.changed = true;
+    return $buildNode(container, context);
+}
+/**
+ * Build a fresh Lexical subtree from a container the registry cannot resolve —
+ * a block a peer just created.
+ *
+ * Nodes are constructed through `$parseSerializedNode`, the inverse of the
+ * `exportJSON` the outbound direction wrote, so custom node types (including
+ * `LLuiDecoratorNode`) round-trip through their own `importJSON` with no
+ * special-casing here.
+ */
+function $buildNode(container, context) {
+    const serialized = {
+        ...elementProps(container).toJSON(),
+        type: elementType(container),
+        version: 1,
+    };
+    const node = $parseSerializedNode(serialized);
+    context.mapping.link(containerId(container), node.getKey());
+    if ($isElementNode(node)) {
+        for (const child of liveChildren(container))
+            $appendChild(node, child, context);
+    }
+    return node;
+}
+/**
+ * An element's children, in the order the shared document renders them.
+ *
+ * The ordering is `sort by (pos, uuid)` over the child carriers — see
+ * `order.ts`. This is the ONE place the inbound walk touches the ordering model
+ * at all: every carrier is dereferenced to the container the registry addresses
+ * it by (the `LoroText` for a run, the element map for an element), and from
+ * there this module is exactly as it was under the list schema.
+ *
+ * ── PROJECTION MUST DEPEND ONLY ON REPLICATED STATE ────────────────────────
+ *
+ * `orderedChildren` consults no `isDeleted()`, and nothing here may add one.
+ * Under the previous `LoroMovableList` schema an earlier version of this
+ * function filtered "tombstones" out, reasoning that a shared rule keeps both
+ * peers showing the same thing. It does not, and cannot: `isDeleted()` is
+ * PEER-LOCAL bookkeeping, not replicated state. The peer that issued a delete
+ * kept reporting `true` while every other peer reported `false`, for the same
+ * ContainerID in the same list, so it rendered one block fewer than everybody
+ * else — permanently, since no later batch ever mentioned the container again.
+ *
+ * The carrier schema removes the temptation rather than relying on the rule
+ * being remembered: a deleted carrier's key is absent from `keys()` on every
+ * peer, symmetrically, so the projection is a pure function of the document by
+ * construction.
+ */
+function liveChildren(container) {
+    return orderedChildren(container).map((entry) => entry.container);
+}
+function $appendChild(parent, child, context) {
+    if (isTextContainer(child)) {
+        const nodes = buildTextNodes(runsFromText(child));
+        if (nodes.length === 0)
+            return;
+        context.mapping.link(containerId(child), nodes[0].getKey());
+        for (const node of nodes)
+            parent.append(node);
+        return;
+    }
+    parent.append($buildNode(child, context));
+}
+// ---------------------------------------------------------------------------
+// Text runs
+// ---------------------------------------------------------------------------
+function buildTextNodes(runs) {
+    return runs.map((run) => {
+        const node = $createTextNode(run.text);
+        if (run.format !== 0)
+            node.setFormat(run.format);
+        return node;
+    });
+}
+/**
+ * Reconcile one text run in place, reusing the existing `TextNode`s.
+ *
+ * The FIRST node is the run's registry anchor, so keeping it is what keeps the
+ * container's address stable across the edit. Nodes are reused positionally and
+ * only written when their text or format actually differs, which is what keeps a
+ * caret in an unchanged part of the run untouched.
+ *
+ * An EMPTY container yields zero nodes rather than one empty `TextNode`: the
+ * outbound direction EMPTIES a run's last `LoroText` instead of deleting it (so
+ * a peer's concurrent insertion into that exact container survives), and an
+ * empty run must project as no text at all.
+ */
+function $reconcileTextRun(text, existing, context) {
+    const target = runsFromText(text);
+    const current = normalizeRuns(existing.map((node) => ({ text: node.getTextContent(), format: node.getFormat() })));
+    if (runsEqual(current, target))
+        return [...existing];
+    $transformPoints(current, target, existing, context);
+    const out = [];
+    for (let i = 0; i < target.length; i++) {
+        const run = target[i];
+        const node = existing[i];
+        if (node === undefined) {
+            out.push(buildTextNodes([run])[0]);
+            continue;
+        }
+        if (node.getTextContent() !== run.text)
+            node.setTextContent(run.text);
+        if (node.getFormat() !== run.format)
+            node.setFormat(run.format);
+        out.push(node);
+    }
+    for (let i = target.length; i < existing.length; i++) {
+        const node = existing[i];
+        context.mapping.unlinkNode(node.getKey());
+        node.remove(true);
+        context.removed = true;
+    }
+    context.changed = true;
+    $resolvePoints(target, out, context);
+    return out;
+}
+function runsEqual(a, b) {
+    return (a.length === b.length &&
+        a.every((run, i) => run.text === b[i].text && run.format === b[i].format));
+}
+// ---------------------------------------------------------------------------
+// Selection
+// ---------------------------------------------------------------------------
+/**
+ * Record where the caret sits, as a run-absolute offset.
+ *
+ * Only TEXT points are captured. An element point addresses a `NodeKey` this
+ * module preserves, so it survives on its own; a text point is the one thing a
+ * remote edit to the same run can invalidate.
+ */
+function capturePoints(context) {
+    const selection = $getSelection();
+    if (!$isRangeSelection(selection))
+        return;
+    for (const point of [selection.anchor, selection.focus]) {
+        if (point.type !== 'text')
+            continue;
+        const node = point.getNode();
+        if (!$isTextNode(node))
+            continue;
+        const run = runNodesFor(node);
+        let offset = 0;
+        for (const sibling of run) {
+            if (sibling.is(node))
+                break;
+            offset += sibling.getTextContentSize();
+        }
+        context.points.push({
+            point,
+            runKeys: run.map((n) => n.getKey()),
+            offset: offset + point.offset,
+            resolved: null,
+        });
+    }
+}
+/** The maximal run of adjacent text nodes containing `node`. */
+function runNodesFor(node) {
+    const run = [node];
+    for (let prev = node.getPreviousSibling(); $isTextNode(prev); prev = prev.getPreviousSibling()) {
+        run.unshift(prev);
+    }
+    for (let next = node.getNextSibling(); $isTextNode(next); next = next.getNextSibling()) {
+        run.push(next);
+    }
+    return run;
+}
+/**
+ * Move a captured caret through the text change about to be applied.
+ *
+ * The change is described as ONE region (`diffTextWithCursor`, biased to the
+ * caret so a repeated-character edit is attributed where the user actually is):
+ * a caret at or before the region is unmoved, one after it shifts by
+ * `insert.length - remove`, and one inside a deleted span clamps to the region's
+ * start — which is where a user would expect to be left standing.
+ */
+function $transformPoints(current, target, existing, context) {
+    const affected = context.points.filter((captured) => existing.some((node) => captured.runKeys.includes(node.getKey())));
+    if (affected.length === 0)
+        return;
+    const before = runsText(current);
+    const after = runsText(target);
+    for (const captured of affected) {
+        const diff = diffTextWithCursor(before, after, captured.offset);
+        if (captured.offset <= diff.index)
+            continue;
+        if (captured.offset <= diff.index + diff.remove)
+            captured.offset = diff.index;
+        else
+            captured.offset += diff.insert.length - diff.remove;
+    }
+}
+/** Locate each affected caret inside the rebuilt run. */
+function $resolvePoints(target, nodes, context) {
+    for (const captured of context.points) {
+        if (!nodes.some((node) => captured.runKeys.includes(node.getKey())))
+            continue;
+        if (nodes.length === 0)
+            continue;
+        let remaining = Math.max(0, Math.min(captured.offset, runsText(target).length));
+        let resolved = null;
+        for (const node of nodes) {
+            const size = node.getTextContentSize();
+            if (remaining <= size) {
+                resolved = { node, offset: remaining };
+                break;
+            }
+            remaining -= size;
+        }
+        captured.resolved = resolved ?? {
+            node: nodes[nodes.length - 1],
+            offset: nodes[nodes.length - 1].getTextContentSize(),
+        };
+    }
+}
+/** Re-place every caret whose run this pass rebuilt. */
+function $restorePoints(context) {
+    for (const captured of context.points) {
+        const resolved = captured.resolved;
+        if (resolved === null)
+            continue;
+        captured.point.set(resolved.node.getKey(), resolved.offset, 'text');
+    }
+    // Writing a point mutates the live selection in place; nothing else is needed,
+    // but re-setting it makes Lexical mark the selection dirty so the change is
+    // reconciled to the DOM.
+    const selection = $getSelection();
+    if (selection !== null && context.points.some((captured) => captured.resolved !== null)) {
+        $setSelection(selection.clone());
+    }
+}
+//# sourceMappingURL=to-lexical.js.map

package/dist/to-lexical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-lexical.js","sourceRoot":"","sources":["../src/to-lexical.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwDG;AAEH,OAAO,EACL,eAAe,EACf,QAAQ,EACR,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,WAAW,EACX,oBAAoB,EACpB,aAAa,EACb,iBAAiB,EACjB,yBAAyB,GAQ1B,MAAM,SAAS,CAAA;AAChB,OAAO,EACL,OAAO,GAKR,MAAM,WAAW,CAAA;AAElB,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,EACL,QAAQ,EACR,WAAW,EACX,eAAe,EACf,YAAY,EACZ,WAAW,EACX,eAAe,EACf,eAAe,GAIhB,MAAM,aAAa,CAAA;AACpB,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,YAAY,EAAE,QAAQ,EAAgB,MAAM,WAAW,CAAA;AAEnG,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,YAAY,GAAsB,CAAC,iBAAiB,EAAE,yBAAyB,CAAC,CAAA;AA6B7F;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAqB,EAAE,KAAqB;IAC7E,2EAA2E;IAC3E,6EAA6E;IAC7E,+EAA+E;IAC/E,kEAAkE;IAClE,IAAI,KAAK,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,IAAI,EAAE,CAAA;QACzC,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAA;IACjF,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IAE3C,MAAM,KAAK,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;IACtF,OAAO,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAqB;IACrD,OAAO,oBAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;AAC3C,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,SAAS,oBAAoB,CAC3B,GAAY,EACZ,MAAmB,EACnB,MAAgC;IAEhC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAe,CAAA;IACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,MAAM,GAA0B,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QACtE,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,OAAO,MAAM,KAAK,SAAS,EAAE,CAAC;YAC5B,yEAAyE;YACzE,qEAAqE;YACrE,IAAI,MAAM,YAAY,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,SAAS;gBAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACzF,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM;gBAAE,OAAO,GAAG,IAAI,CAAA;YACxC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAA;QAC1B,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAA;IAC3B,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AA+BD,SAAS,oBAAoB,CAAC,MAAqB,EAAE,KAA8B;IACjF,MAAM,OAAO,GAAY;QACvB,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,KAAK;QACL,MAAM,EAAE,EAAE;QACV,OAAO,EAAE,KAAK;QACd,OAAO,EAAE,KAAK;KACf,CAAA;IAED,MAAM,CAAC,MAAM,CAAC,MAAM,CAClB,GAAG,EAAE;QACH,aAAa,CAAC,OAAO,CAAC,CAAA;QACtB,MAAM,IAAI,GAAG,QAAQ,EAAE,CAAA;QACvB,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QAC7D,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QACvC,kBAAkB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC9C,cAAc,CAAC,OAAO,CAAC,CAAA;IACzB,CAAC,EACD;QACE,GAAG,EAAE,CAAC,GAAG,YAAY,CAAC;QACtB,cAAc,EAAE,IAAI;QACpB,yEAAyE;QACzE,wEAAwE;QACxE,kEAAkE;QAClE,QAAQ,EAAE,IAAI;KACf,CACF,CAAA;IAED,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QACpB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAA;QACvD,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YACnB,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC;YACrD,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;SACnC,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,OAAO,CAAC,OAAO,CAAA;AACxB,CAAC;AAED,8EAA8E;AAC9E,QAAQ;AACR,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CAAC,SAA2B,EAAE,IAAiB,EAAE,OAAgB;IACnF,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,MAAM,EAA+B,CAAA;IAC3E,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IAE1C,IAAI,CAAC,cAAc,CAAC,KAA8B,CAAC,CAAA;IACnD,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;IAEtB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC;QAAE,OAAO,IAAI,CAAA;IAC1C,4EAA4E;IAC5E,8EAA8E;IAC9E,6EAA6E;IAC7E,OAAO,CAAC,KAAK,CACX,kBAAkB,IAAI,CAAC,OAAO,EAAE,uDAAuD;QACrF,0FAA0F;QAC1F,oFAAoF,CACvF,CAAA;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,KAAgC,EAAE,IAAiB;IACtE,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,UAAU,EAA6B,CAAA;IACxE,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;IAClD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAU,EAAE,CAAU;IACvC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAA;IAC5F,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IACvD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC7E,CAAC;IACD,MAAM,IAAI,GAAG,CAA4B,CAAA;IACzC,MAAM,KAAK,GAAG,CAA4B,CAAA;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC9B,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAC3D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAC9E,CAAC;AA6BD,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,GAAG,GAAY,EAAE,CAAA;IACvB,IAAI,GAAG,GAAe,EAAE,CAAA;IACxB,MAAM,KAAK,GAAG,GAAS,EAAE;QACvB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAC5B,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QAChE,GAAG,GAAG,EAAE,CAAA;IACV,CAAC,CAAA;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,WAAW,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;aAClC,CAAC;YACJ,KAAK,EAAE,CAAA;YACP,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;QACjE,CAAC;IACH,CAAC;IACD,KAAK,EAAE,CAAA;IACP,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,kBAAkB,CACzB,SAA2B,EAC3B,IAAiB,EACjB,OAAgB;IAEhB,MAAM,OAAO,GAAG,YAAY,CAAC,SAAS,CAAC,CAAA;IACvC,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAS,CAAA;IAEhC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAA;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IACpE,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAsB,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAA;IACtF,IAAI,QAAQ,GAAG,CAAC,CAAA;IAEhB,MAAM,OAAO,GAA0B,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3D,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAA;QACvD,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC5D,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/C,yEAAyE;YACzE,IAAI,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,CAAC;gBACvD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAClB,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QAC7C,OAAO,QAAQ,GAAG,UAAU,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAE,CAAC;YAAE,QAAQ,EAAE,CAAA;QACrF,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAA;QACpC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAC3C,QAAQ,EAAE,CAAA;QACV,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACpB,OAAO,OAAO,CAAA;IAChB,CAAC,CAAC,CAAA;IAEF,wEAAwE;IACxE,MAAM,OAAO,GAAkB,EAAE,CAAA;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;YAChF,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;YACzD,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC,CAAA;;gBACtD,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC,CAAA;YACjD,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;YACtB,SAAQ;QACV,CAAC;QACD,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAA;QACzF,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAA;IAChE,CAAC;IAED,yEAAyE;IACzE,4EAA4E;IAC5E,qDAAqD;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IAC5D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAChE,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBAAE,SAAQ;YACtC,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;YACtD,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;YAChE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAClB,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;YACtB,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;QACxB,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,8EAA8E;IAC9E,wEAAwE;IACxE,IAAI,QAAQ,GAAuB,IAAI,CAAA;IACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE,CAAA;QAChC,MAAM,QAAQ,GAAG,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;QACnD,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,SAAS,CAAA;QAChE,MAAM,OAAO,GACX,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAA;QACzF,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAA;gBAClC,IAAI,KAAK,KAAK,IAAI;oBAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;;oBACjC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YACvC,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YACpC,CAAC;YACD,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;QACxB,CAAC;QACD,QAAQ,GAAG,KAAK,CAAA;IAClB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAC7B,SAA2B,EAC3B,QAAiC,EACjC,OAAgB;IAEhB,MAAM,EAAE,GAAG,WAAW,CAAC,SAAS,CAAC,CAAA;IACjC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,EAAE,KAAK,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5E,uEAAuE;QACvE,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrD,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAC3C,OAAO,QAAQ,CAAA;QACjB,CAAC;QACD,IAAI,WAAW,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;YAC9C,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAC3C,IAAI,cAAc,CAAC,QAAQ,CAAC;gBAAE,kBAAkB,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;YAC9E,OAAO,QAAQ,CAAA;QACjB,CAAC;QACD,iEAAiE;IACnE,CAAC;IACD,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;IACtB,OAAO,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;AACvC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,SAA2B,EAAE,OAAgB;IAC/D,MAAM,UAAU,GAAG;QACjB,GAAI,YAAY,CAAC,SAAS,CAAC,CAAC,MAAM,EAA8B;QAChE,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC;QAC5B,OAAO,EAAE,CAAC;KACc,CAAA;IAC1B,MAAM,IAAI,GAAG,oBAAoB,CAAC,UAAU,CAAC,CAAA;IAC7C,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;IAE3D,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,SAAS,CAAC;YAAE,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;IACjF,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,SAAS,YAAY,CAAC,SAA2B;IAC/C,OAAO,eAAe,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;AACnE,CAAC;AAED,SAAS,YAAY,CAAC,MAAmB,EAAE,KAAqB,EAAE,OAAgB;IAChF,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,cAAc,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAA;QACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAC9B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC,CAAA;QAC5D,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC7C,OAAM;IACR,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAA;AAC3C,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,SAAS,cAAc,CAAC,IAAwB;IAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChD,OAAO,IAAI,CAAA;IACb,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,iBAAiB,CACxB,IAAkC,EAClC,QAA6B,EAC7B,OAAgB;IAEhB,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;IACjC,MAAM,OAAO,GAAG,aAAa,CAC3B,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CACpF,CAAA;IACD,IAAI,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC;QAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAA;IAEpD,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;IAEpD,MAAM,GAAG,GAAe,EAAE,CAAA;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAE,CAAA;QACtB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QACxB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAA;YACnC,SAAQ;QACV,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,IAAI;YAAE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrE,IAAI,IAAI,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,MAAM;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC/D,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAChB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;QACzB,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QACzC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACjB,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;IACxB,CAAC;IACD,OAAO,CAAC,OAAO,GAAG,IAAI,CAAA;IAEtB,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,CAAA;IACpC,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,SAAS,CAAC,CAAqB,EAAE,CAAqB;IAC7D,OAAO,CACL,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACrB,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAE,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAC5E,CAAA;AACH,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,OAAgB;IACrC,MAAM,SAAS,GAAG,aAAa,EAAE,CAAA;IACjC,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC;QAAE,OAAM;IACzC,KAAK,MAAM,KAAK,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QACxD,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;YAAE,SAAQ;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;QAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YAAE,SAAQ;QAChC,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,MAAM,OAAO,IAAI,GAAG,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC;gBAAE,MAAK;YAC3B,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAA;QACxC,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;YAClB,KAAK;YACL,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM;YAC7B,QAAQ,EAAE,IAAI;SACf,CAAC,CAAA;IACJ,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAS,WAAW,CAAC,IAAc;IACjC,MAAM,GAAG,GAAe,CAAC,IAAI,CAAC,CAAA;IAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,kBAAkB,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC;QAC/F,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IACnB,CAAC;IACD,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;QACvF,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAChB,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,OAA2B,EAC3B,MAA0B,EAC1B,QAA6B,EAC7B,OAAgB;IAEhB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAClD,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAClE,CAAA;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAM;IAEjC,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAA;IAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAA;IAC9B,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;QAC/D,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK;YAAE,SAAQ;QAC3C,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM;YAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAA;;YACxE,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;IAC1D,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,SAAS,cAAc,CACrB,MAA0B,EAC1B,KAA0B,EAC1B,OAAgB;IAEhB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAAE,SAAQ;QAC7E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAChC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAA;QAC/E,IAAI,QAAQ,GAA8C,IAAI,CAAA;QAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAA;YACtC,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;gBACtB,QAAQ,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;gBACtC,MAAK;YACP,CAAC;YACD,SAAS,IAAI,IAAI,CAAA;QACnB,CAAC;QACD,QAAQ,CAAC,QAAQ,GAAG,QAAQ,IAAI;YAC9B,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE;YAC9B,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,kBAAkB,EAAE;SACtD,CAAA;IACH,CAAC;AACH,CAAC;AAED,wDAAwD;AACxD,SAAS,cAAc,CAAC,OAAgB;IACtC,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAA;QAClC,IAAI,QAAQ,KAAK,IAAI;YAAE,SAAQ;QAC/B,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACrE,CAAC;IACD,+EAA+E;IAC/E,4EAA4E;IAC5E,yBAAyB;IACzB,MAAM,SAAS,GAAG,aAAa,EAAE,CAAA;IACjC,IAAI,SAAS,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC;QACxF,aAAa,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAA;IAClC,CAAC;AACH,CAAC"}