@inkandswitch/patchwork-pkg-base 0.0.41 → 0.0.42

package/packages/codemirror-base/dist/chunk-H5POLO74.js

@@ -0,0 +1,2658 @@
+// src/lib/codemirror.tsx
+import { onCleanup, createEffect as createEffect7 } from "solid-js";
+import { EditorView as EditorView10 } from "@codemirror/view";
+import { EditorState as EditorState4, Compartment as Compartment6 } from "@codemirror/state";
+
+// src/lib/extensions/decorations.ts
+import { createEffect } from "solid-js";
+import { Decoration, EditorView } from "@codemirror/view";
+import { StateEffect, StateField } from "@codemirror/state";
+function createDecorationsExtension(decorations) {
+  const setDecorations = StateEffect.define();
+  const decorationsField = StateField.define({
+    create() {
+      return Decoration.none;
+    },
+    update(value, tr) {
+      for (const e of tr.effects) {
+        if (e.is(setDecorations)) return e.value;
+      }
+      if (tr.docChanged) return value.map(tr.changes);
+      return value;
+    },
+    provide: (f) => EditorView.decorations.from(f)
+  });
+  const createDecorationsEffect = (view) => createEffect(() => {
+    decorations() && view.dispatch({
+      effects: setDecorations.of(decorations())
+    });
+  });
+  return [decorationsField, createDecorationsEffect];
+}
+
+// src/lib/extensions/readOnly.ts
+import { createEffect as createEffect2 } from "solid-js";
+import { EditorView as EditorView2 } from "@codemirror/view";
+import { Compartment, EditorState } from "@codemirror/state";
+function createReadOnlyExtension(force) {
+  const compartment = new Compartment();
+  const extensions = () => force() ? [EditorState.readOnly.of(true), EditorView2.editable.of(false)] : [];
+  const createReconfigureEffect = (view) => createEffect2(() => {
+    view.dispatch({
+      effects: compartment.reconfigure(extensions())
+    });
+  });
+  return [compartment.of(extensions()), createReconfigureEffect];
+}
+
+// src/lib/extensions/automerge.ts
+import { createEffect as createEffect3 } from "solid-js";
+import { Compartment as Compartment4, Transaction as Transaction4 } from "@codemirror/state";
+
+// src/vendor/automerge-codemirror/plugin.ts
+import * as A2 from "@automerge/automerge";
+import { ViewPlugin } from "@codemirror/view";
+import { Annotation } from "@codemirror/state";
+
+// src/vendor/automerge-codemirror/codeMirrorToAm.ts
+import * as A from "@automerge/automerge";
+var applyCmTransactionsToAmHandle = (handle, path, transactions) => {
+  const transactionsWithChanges = transactions.filter(
+    (tr) => !isReconcileTx(tr) && !tr.changes.empty
+  );
+  if (transactionsWithChanges.length === 0) {
+    return;
+  }
+  if (handle.isReadOnly?.()) {
+    return;
+  }
+  handle.change((doc) => {
+    transactionsWithChanges.forEach((tr) => {
+      tr.changes.iterChanges(
+        (fromA, toA, fromB, _toB, inserted) => {
+          A.splice(doc, path.slice(), fromB, toA - fromA, inserted.toString());
+        }
+      );
+    });
+  });
+  return A.getHeads(handle.doc());
+};
+
+// src/vendor/automerge-codemirror/amToCodemirror.ts
+import {
+  ChangeSet,
+  Transaction
+} from "@codemirror/state";
+var applyAmPatchesToCm = (view, target, patches) => {
+  let selection = view.state.selection;
+  for (const patch of patches) {
+    const changeSpec = handlePatch(patch, target, view.state);
+    if (changeSpec != null) {
+      const changeSet = ChangeSet.of(changeSpec, view.state.doc.length, "\n");
+      selection = selection.map(changeSet, 1);
+      view.dispatch({
+        changes: changeSet,
+        annotations: [
+          reconcileAnnotationType.of({}),
+          Transaction.addToHistory.of(false),
+          Transaction.remote.of(true)
+        ]
+      });
+    }
+  }
+  view.dispatch({
+    selection,
+    annotations: reconcileAnnotationType.of({})
+  });
+};
+function handlePatch(patch, target, state) {
+  if (patch.action === "insert") {
+    return handleInsert(target, patch);
+  } else if (patch.action === "splice") {
+    return handleSplice(target, patch);
+  } else if (patch.action === "del") {
+    return handleDel(target, patch);
+  } else if (patch.action === "put") {
+    return handlePut(target, patch, state);
+  } else {
+    return null;
+  }
+}
+function handleInsert(target, patch) {
+  const index = charPath(target, patch.path);
+  if (index == null) {
+    return [];
+  }
+  const text = patch.values.map((v) => v ? v.toString() : "").join("");
+  return [{ from: index, to: index, insert: text }];
+}
+function handleSplice(target, patch) {
+  const index = charPath(target, patch.path);
+  if (index == null) {
+    return [];
+  }
+  return [{ from: index, insert: patch.value }];
+}
+function handleDel(target, patch) {
+  const index = charPath(target, patch.path);
+  if (index == null) {
+    return [];
+  }
+  const length = patch.length || 1;
+  return [{ from: index, to: index + length }];
+}
+function handlePut(target, patch, state) {
+  const index = charPath(target, [...patch.path, 0]);
+  if (index == null) {
+    return [];
+  }
+  const length = state.doc.length;
+  if (typeof patch.value !== "string") {
+    return [];
+  }
+  return [{ from: 0, to: length, insert: patch.value }];
+}
+function charPath(textPath, candidatePath) {
+  if (candidatePath.length !== textPath.length + 1) return null;
+  for (let i = 0; i < textPath.length; i++) {
+    if (textPath[i] !== candidatePath[i]) return null;
+  }
+  const index = candidatePath[candidatePath.length - 1];
+  if (typeof index === "number") return index;
+  return null;
+}
+
+// src/vendor/automerge-codemirror/plugin.ts
+var reconcileAnnotationType = Annotation.define();
+var isReconcileTx = (tr) => !!tr.annotation(reconcileAnnotationType);
+var automergeSyncPlugin = ({
+  handle,
+  path
+}) => {
+  if (!handle.isReady()) {
+    throw new Error(
+      "ensure the handle is ready before initializing the automergeSyncPlugin"
+    );
+  }
+  return ViewPlugin.fromClass(
+    class {
+      view;
+      reconciledHeads = A2.getHeads(handle.doc());
+      isProcessingCmTransaction = false;
+      constructor(view) {
+        this.view = view;
+        this.onChange = this.onChange.bind(this);
+        handle.on("change", this.onChange);
+      }
+      update(update) {
+        this.isProcessingCmTransaction = true;
+        const newHeads = applyCmTransactionsToAmHandle(
+          handle,
+          path,
+          update.transactions
+        );
+        if (newHeads) {
+          this.reconciledHeads = newHeads;
+        }
+        this.isProcessingCmTransaction = false;
+      }
+      // Changes with a replaced scope (the handle was re-pointed at a
+      // different backing document) need no special-casing here. A.diff
+      // ignores heads that aren't in the doc's history, treating that side
+      // as the empty document: when the backings share history (heads
+      // pinning, clones) it yields minimal patches that preserve the
+      // selection, and when they share nothing it degenerates into
+      // full-document patches that rebuild the editor wholesale. Either
+      // way the patches are kept off the undo stack by applyAmPatchesToCm.
+      // The history and read-only extensions are the ones that consume the
+      // `scopeReplaced` flag.
+      onChange = () => {
+        if (this.isProcessingCmTransaction) {
+          return;
+        }
+        const currentHeads = A2.getHeads(handle.doc());
+        if (A2.equals(currentHeads, this.reconciledHeads)) {
+          return;
+        }
+        const patches = A2.diff(handle.doc(), this.reconciledHeads, currentHeads);
+        applyAmPatchesToCm(this.view, path, patches);
+        this.reconciledHeads = currentHeads;
+      };
+      destroy() {
+        handle.off("change", this.onChange);
+      }
+    }
+  );
+};
+
+// node_modules/.pnpm/@codemirror+commands@6.10.3/node_modules/@codemirror/commands/dist/index.js
+import { Annotation as Annotation2, Facet, combineConfig, StateField as StateField2, Transaction as Transaction3, ChangeSet as ChangeSet2, ChangeDesc, EditorSelection, StateEffect as StateEffect2, Text, findClusterBreak, countColumn, CharCategory } from "@codemirror/state";
+import { EditorView as EditorView4, Direction } from "@codemirror/view";
+import { IndentContext, getIndentation, indentString, matchBrackets, syntaxTree, getIndentUnit, indentUnit } from "@codemirror/language";
+
+// node_modules/.pnpm/@lezer+common@1.5.2/node_modules/@lezer/common/dist/index.js
+var DefaultBufferLength = 1024;
+var nextPropID = 0;
+var NodeProp = class {
+  /**
+  Create a new node prop type.
+  */
+  constructor(config = {}) {
+    this.id = nextPropID++;
+    this.perNode = !!config.perNode;
+    this.deserialize = config.deserialize || (() => {
+      throw new Error("This node type doesn't define a deserialize function");
+    });
+    this.combine = config.combine || null;
+  }
+  /**
+  This is meant to be used with
+  [`NodeSet.extend`](#common.NodeSet.extend) or
+  [`LRParser.configure`](#lr.ParserConfig.props) to compute
+  prop values for each node type in the set. Takes a [match
+  object](#common.NodeType^match) or function that returns undefined
+  if the node type doesn't get this prop, and the prop's value if
+  it does.
+  */
+  add(match) {
+    if (this.perNode)
+      throw new RangeError("Can't add per-node props to node types");
+    if (typeof match != "function")
+      match = NodeType.match(match);
+    return (type) => {
+      let result = match(type);
+      return result === void 0 ? null : [this, result];
+    };
+  }
+};
+NodeProp.closedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.openedBy = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.group = new NodeProp({ deserialize: (str) => str.split(" ") });
+NodeProp.isolate = new NodeProp({ deserialize: (value) => {
+  if (value && value != "rtl" && value != "ltr" && value != "auto")
+    throw new RangeError("Invalid value for isolate: " + value);
+  return value || "auto";
+} });
+NodeProp.contextHash = new NodeProp({ perNode: true });
+NodeProp.lookAhead = new NodeProp({ perNode: true });
+NodeProp.mounted = new NodeProp({ perNode: true });
+var MountedTree = class {
+  constructor(tree, overlay, parser, bracketed = false) {
+    this.tree = tree;
+    this.overlay = overlay;
+    this.parser = parser;
+    this.bracketed = bracketed;
+  }
+  /**
+  @internal
+  */
+  static get(tree) {
+    return tree && tree.props && tree.props[NodeProp.mounted.id];
+  }
+};
+var noProps = /* @__PURE__ */ Object.create(null);
+var NodeType = class _NodeType {
+  /**
+  @internal
+  */
+  constructor(name, props, id, flags = 0) {
+    this.name = name;
+    this.props = props;
+    this.id = id;
+    this.flags = flags;
+  }
+  /**
+  Define a node type.
+  */
+  static define(spec) {
+    let props = spec.props && spec.props.length ? /* @__PURE__ */ Object.create(null) : noProps;
+    let flags = (spec.top ? 1 : 0) | (spec.skipped ? 2 : 0) | (spec.error ? 4 : 0) | (spec.name == null ? 8 : 0);
+    let type = new _NodeType(spec.name || "", props, spec.id, flags);
+    if (spec.props)
+      for (let src of spec.props) {
+        if (!Array.isArray(src))
+          src = src(type);
+        if (src) {
+          if (src[0].perNode)
+            throw new RangeError("Can't store a per-node prop on a node type");
+          props[src[0].id] = src[1];
+        }
+      }
+    return type;
+  }
+  /**
+  Retrieves a node prop for this type. Will return `undefined` if
+  the prop isn't present on this node.
+  */
+  prop(prop) {
+    return this.props[prop.id];
+  }
+  /**
+  True when this is the top node of a grammar.
+  */
+  get isTop() {
+    return (this.flags & 1) > 0;
+  }
+  /**
+  True when this node is produced by a skip rule.
+  */
+  get isSkipped() {
+    return (this.flags & 2) > 0;
+  }
+  /**
+  Indicates whether this is an error node.
+  */
+  get isError() {
+    return (this.flags & 4) > 0;
+  }
+  /**
+  When true, this node type doesn't correspond to a user-declared
+  named node, for example because it is used to cache repetition.
+  */
+  get isAnonymous() {
+    return (this.flags & 8) > 0;
+  }
+  /**
+  Returns true when this node's name or one of its
+  [groups](#common.NodeProp^group) matches the given string.
+  */
+  is(name) {
+    if (typeof name == "string") {
+      if (this.name == name)
+        return true;
+      let group = this.prop(NodeProp.group);
+      return group ? group.indexOf(name) > -1 : false;
+    }
+    return this.id == name;
+  }
+  /**
+  Create a function from node types to arbitrary values by
+  specifying an object whose property names are node or
+  [group](#common.NodeProp^group) names. Often useful with
+  [`NodeProp.add`](#common.NodeProp.add). You can put multiple
+  names, separated by spaces, in a single property name to map
+  multiple node names to a single value.
+  */
+  static match(map) {
+    let direct = /* @__PURE__ */ Object.create(null);
+    for (let prop in map)
+      for (let name of prop.split(" "))
+        direct[name] = map[prop];
+    return (node) => {
+      for (let groups = node.prop(NodeProp.group), i = -1; i < (groups ? groups.length : 0); i++) {
+        let found = direct[i < 0 ? node.name : groups[i]];
+        if (found)
+          return found;
+      }
+    };
+  }
+};
+NodeType.none = new NodeType(
+  "",
+  /* @__PURE__ */ Object.create(null),
+  0,
+  8
+  /* NodeFlag.Anonymous */
+);
+var CachedNode = /* @__PURE__ */ new WeakMap();
+var CachedInnerNode = /* @__PURE__ */ new WeakMap();
+var IterMode;
+(function(IterMode2) {
+  IterMode2[IterMode2["ExcludeBuffers"] = 1] = "ExcludeBuffers";
+  IterMode2[IterMode2["IncludeAnonymous"] = 2] = "IncludeAnonymous";
+  IterMode2[IterMode2["IgnoreMounts"] = 4] = "IgnoreMounts";
+  IterMode2[IterMode2["IgnoreOverlays"] = 8] = "IgnoreOverlays";
+  IterMode2[IterMode2["EnterBracketed"] = 16] = "EnterBracketed";
+})(IterMode || (IterMode = {}));
+var Tree = class _Tree {
+  /**
+  Construct a new tree. See also [`Tree.build`](#common.Tree^build).
+  */
+  constructor(type, children, positions, length, props) {
+    this.type = type;
+    this.children = children;
+    this.positions = positions;
+    this.length = length;
+    this.props = null;
+    if (props && props.length) {
+      this.props = /* @__PURE__ */ Object.create(null);
+      for (let [prop, value] of props)
+        this.props[typeof prop == "number" ? prop : prop.id] = value;
+    }
+  }
+  /**
+  @internal
+  */
+  toString() {
+    let mounted = MountedTree.get(this);
+    if (mounted && !mounted.overlay)
+      return mounted.tree.toString();
+    let children = "";
+    for (let ch of this.children) {
+      let str = ch.toString();
+      if (str) {
+        if (children)
+          children += ",";
+        children += str;
+      }
+    }
+    return !this.type.name ? children : (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (children.length ? "(" + children + ")" : "");
+  }
+  /**
+  Get a [tree cursor](#common.TreeCursor) positioned at the top of
+  the tree. Mode can be used to [control](#common.IterMode) which
+  nodes the cursor visits.
+  */
+  cursor(mode = 0) {
+    return new TreeCursor(this.topNode, mode);
+  }
+  /**
+  Get a [tree cursor](#common.TreeCursor) pointing into this tree
+  at the given position and side (see
+  [`moveTo`](#common.TreeCursor.moveTo).
+  */
+  cursorAt(pos, side = 0, mode = 0) {
+    let scope = CachedNode.get(this) || this.topNode;
+    let cursor = new TreeCursor(scope);
+    cursor.moveTo(pos, side);
+    CachedNode.set(this, cursor._tree);
+    return cursor;
+  }
+  /**
+  Get a [syntax node](#common.SyntaxNode) object for the top of the
+  tree.
+  */
+  get topNode() {
+    return new TreeNode(this, 0, 0, null);
+  }
+  /**
+  Get the [syntax node](#common.SyntaxNode) at the given position.
+  If `side` is -1, this will move into nodes that end at the
+  position. If 1, it'll move into nodes that start at the
+  position. With 0, it'll only enter nodes that cover the position
+  from both sides.
+  
+  Note that this will not enter
+  [overlays](#common.MountedTree.overlay), and you often want
+  [`resolveInner`](#common.Tree.resolveInner) instead.
+  */
+  resolve(pos, side = 0) {
+    let node = resolveNode(CachedNode.get(this) || this.topNode, pos, side, false);
+    CachedNode.set(this, node);
+    return node;
+  }
+  /**
+  Like [`resolve`](#common.Tree.resolve), but will enter
+  [overlaid](#common.MountedTree.overlay) nodes, producing a syntax node
+  pointing into the innermost overlaid tree at the given position
+  (with parent links going through all parent structure, including
+  the host trees).
+  */
+  resolveInner(pos, side = 0) {
+    let node = resolveNode(CachedInnerNode.get(this) || this.topNode, pos, side, true);
+    CachedInnerNode.set(this, node);
+    return node;
+  }
+  /**
+  In some situations, it can be useful to iterate through all
+  nodes around a position, including those in overlays that don't
+  directly cover the position. This method gives you an iterator
+  that will produce all nodes, from small to big, around the given
+  position.
+  */
+  resolveStack(pos, side = 0) {
+    return stackIterator(this, pos, side);
+  }
+  /**
+  Iterate over the tree and its children, calling `enter` for any
+  node that touches the `from`/`to` region (if given) before
+  running over such a node's children, and `leave` (if given) when
+  leaving the node. When `enter` returns `false`, that node will
+  not have its children iterated over (or `leave` called).
+  */
+  iterate(spec) {
+    let { enter, leave, from = 0, to = this.length } = spec;
+    let mode = spec.mode || 0, anon = (mode & IterMode.IncludeAnonymous) > 0;
+    for (let c = this.cursor(mode | IterMode.IncludeAnonymous); ; ) {
+      let entered = false;
+      if (c.from <= to && c.to >= from && (!anon && c.type.isAnonymous || enter(c) !== false)) {
+        if (c.firstChild())
+          continue;
+        entered = true;
+      }
+      for (; ; ) {
+        if (entered && leave && (anon || !c.type.isAnonymous))
+          leave(c);
+        if (c.nextSibling())
+          break;
+        if (!c.parent())
+          return;
+        entered = true;
+      }
+    }
+  }
+  /**
+  Get the value of the given [node prop](#common.NodeProp) for this
+  node. Works with both per-node and per-type props.
+  */
+  prop(prop) {
+    return !prop.perNode ? this.type.prop(prop) : this.props ? this.props[prop.id] : void 0;
+  }
+  /**
+  Returns the node's [per-node props](#common.NodeProp.perNode) in a
+  format that can be passed to the [`Tree`](#common.Tree)
+  constructor.
+  */
+  get propValues() {
+    let result = [];
+    if (this.props)
+      for (let id in this.props)
+        result.push([+id, this.props[id]]);
+    return result;
+  }
+  /**
+  Balance the direct children of this tree, producing a copy of
+  which may have children grouped into subtrees with type
+  [`NodeType.none`](#common.NodeType^none).
+  */
+  balance(config = {}) {
+    return this.children.length <= 8 ? this : balanceRange(NodeType.none, this.children, this.positions, 0, this.children.length, 0, this.length, (children, positions, length) => new _Tree(this.type, children, positions, length, this.propValues), config.makeTree || ((children, positions, length) => new _Tree(NodeType.none, children, positions, length)));
+  }
+  /**
+  Build a tree from a postfix-ordered buffer of node information,
+  or a cursor over such a buffer.
+  */
+  static build(data) {
+    return buildTree(data);
+  }
+};
+Tree.empty = new Tree(NodeType.none, [], [], 0);
+var FlatBufferCursor = class _FlatBufferCursor {
+  constructor(buffer, index) {
+    this.buffer = buffer;
+    this.index = index;
+  }
+  get id() {
+    return this.buffer[this.index - 4];
+  }
+  get start() {
+    return this.buffer[this.index - 3];
+  }
+  get end() {
+    return this.buffer[this.index - 2];
+  }
+  get size() {
+    return this.buffer[this.index - 1];
+  }
+  get pos() {
+    return this.index;
+  }
+  next() {
+    this.index -= 4;
+  }
+  fork() {
+    return new _FlatBufferCursor(this.buffer, this.index);
+  }
+};
+var TreeBuffer = class _TreeBuffer {
+  /**
+  Create a tree buffer.
+  */
+  constructor(buffer, length, set) {
+    this.buffer = buffer;
+    this.length = length;
+    this.set = set;
+  }
+  /**
+  @internal
+  */
+  get type() {
+    return NodeType.none;
+  }
+  /**
+  @internal
+  */
+  toString() {
+    let result = [];
+    for (let index = 0; index < this.buffer.length; ) {
+      result.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result.join(",");
+  }
+  /**
+  @internal
+  */
+  childString(index) {
+    let id = this.buffer[index], endIndex = this.buffer[index + 3];
+    let type = this.set.types[id], result = type.name;
+    if (/\W/.test(result) && !type.isError)
+      result = JSON.stringify(result);
+    index += 4;
+    if (endIndex == index)
+      return result;
+    let children = [];
+    while (index < endIndex) {
+      children.push(this.childString(index));
+      index = this.buffer[index + 3];
+    }
+    return result + "(" + children.join(",") + ")";
+  }
+  /**
+  @internal
+  */
+  findChild(startIndex, endIndex, dir, pos, side) {
+    let { buffer } = this, pick = -1;
+    for (let i = startIndex; i != endIndex; i = buffer[i + 3]) {
+      if (checkSide(side, pos, buffer[i + 1], buffer[i + 2])) {
+        pick = i;
+        if (dir > 0)
+          break;
+      }
+    }
+    return pick;
+  }
+  /**
+  @internal
+  */
+  slice(startI, endI, from) {
+    let b = this.buffer;
+    let copy = new Uint16Array(endI - startI), len = 0;
+    for (let i = startI, j = 0; i < endI; ) {
+      copy[j++] = b[i++];
+      copy[j++] = b[i++] - from;
+      let to = copy[j++] = b[i++] - from;
+      copy[j++] = b[i++] - startI;
+      len = Math.max(len, to);
+    }
+    return new _TreeBuffer(copy, len, this.set);
+  }
+};
+function checkSide(side, pos, from, to) {
+  switch (side) {
+    case -2:
+      return from < pos;
+    case -1:
+      return to >= pos && from < pos;
+    case 0:
+      return from < pos && to > pos;
+    case 1:
+      return from <= pos && to > pos;
+    case 2:
+      return to > pos;
+    case 4:
+      return true;
+  }
+}
+function resolveNode(node, pos, side, overlays) {
+  var _a;
+  while (node.from == node.to || (side < 1 ? node.from >= pos : node.from > pos) || (side > -1 ? node.to <= pos : node.to < pos)) {
+    let parent = !overlays && node instanceof TreeNode && node.index < 0 ? null : node.parent;
+    if (!parent)
+      return node;
+    node = parent;
+  }
+  let mode = overlays ? 0 : IterMode.IgnoreOverlays;
+  if (overlays)
+    for (let scan = node, parent = scan.parent; parent; scan = parent, parent = scan.parent) {
+      if (scan instanceof TreeNode && scan.index < 0 && ((_a = parent.enter(pos, side, mode)) === null || _a === void 0 ? void 0 : _a.from) != scan.from)
+        node = parent;
+    }
+  for (; ; ) {
+    let inner = node.enter(pos, side, mode);
+    if (!inner)
+      return node;
+    node = inner;
+  }
+}
+var BaseNode = class {
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  getChild(type, before = null, after = null) {
+    let r = getChildren(this, type, before, after);
+    return r.length ? r[0] : null;
+  }
+  getChildren(type, before = null, after = null) {
+    return getChildren(this, type, before, after);
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  matchContext(context) {
+    return matchNodeContext(this.parent, context);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    let scan = this.childBefore(pos), node = this;
+    while (scan) {
+      let last = scan.lastChild;
+      if (!last || last.to != scan.to)
+        break;
+      if (last.type.isError && last.from == last.to) {
+        node = scan;
+        scan = last.prevSibling;
+      } else {
+        scan = last;
+      }
+    }
+    return node;
+  }
+  get node() {
+    return this;
+  }
+  get next() {
+    return this.parent;
+  }
+};
+var TreeNode = class _TreeNode extends BaseNode {
+  constructor(_tree, from, index, _parent) {
+    super();
+    this._tree = _tree;
+    this.from = from;
+    this.index = index;
+    this._parent = _parent;
+  }
+  get type() {
+    return this._tree.type;
+  }
+  get name() {
+    return this._tree.type.name;
+  }
+  get to() {
+    return this.from + this._tree.length;
+  }
+  nextChild(i, dir, pos, side, mode = 0) {
+    for (let parent = this; ; ) {
+      for (let { children, positions } = parent._tree, e = dir > 0 ? children.length : -1; i != e; i += dir) {
+        let next = children[i], start = positions[i] + parent.from, mounted;
+        if (!(mode & IterMode.EnterBracketed && next instanceof Tree && (mounted = MountedTree.get(next)) && !mounted.overlay && mounted.bracketed && pos >= start && pos <= start + next.length) && !checkSide(side, pos, start, start + next.length))
+          continue;
+        if (next instanceof TreeBuffer) {
+          if (mode & IterMode.ExcludeBuffers)
+            continue;
+          let index = next.findChild(0, next.buffer.length, dir, pos - start, side);
+          if (index > -1)
+            return new BufferNode(new BufferContext(parent, next, i, start), null, index);
+        } else if (mode & IterMode.IncludeAnonymous || (!next.type.isAnonymous || hasChild(next))) {
+          let mounted2;
+          if (!(mode & IterMode.IgnoreMounts) && (mounted2 = MountedTree.get(next)) && !mounted2.overlay)
+            return new _TreeNode(mounted2.tree, start, i, parent);
+          let inner = new _TreeNode(next, start, i, parent);
+          return mode & IterMode.IncludeAnonymous || !inner.type.isAnonymous ? inner : inner.nextChild(dir < 0 ? next.children.length - 1 : 0, dir, pos, side, mode);
+        }
+      }
+      if (mode & IterMode.IncludeAnonymous || !parent.type.isAnonymous)
+        return null;
+      if (parent.index >= 0)
+        i = parent.index + dir;
+      else
+        i = dir < 0 ? -1 : parent._parent._tree.children.length;
+      parent = parent._parent;
+      if (!parent)
+        return null;
+    }
+  }
+  get firstChild() {
+    return this.nextChild(
+      0,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.nextChild(
+      0,
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.nextChild(
+      this._tree.children.length - 1,
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  prop(prop) {
+    return this._tree.prop(prop);
+  }
+  enter(pos, side, mode = 0) {
+    let mounted;
+    if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {
+      let rPos = pos - this.from, enterBracketed = mode & IterMode.EnterBracketed && mounted.bracketed;
+      for (let { from, to } of mounted.overlay) {
+        if ((side > 0 || enterBracketed ? from <= rPos : from < rPos) && (side < 0 || enterBracketed ? to >= rPos : to > rPos))
+          return new _TreeNode(mounted.tree, mounted.overlay[0].from + this.from, -1, this);
+      }
+    }
+    return this.nextChild(0, 1, pos, side, mode);
+  }
+  nextSignificantParent() {
+    let val = this;
+    while (val.type.isAnonymous && val._parent)
+      val = val._parent;
+    return val;
+  }
+  get parent() {
+    return this._parent ? this._parent.nextSignificantParent() : null;
+  }
+  get nextSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index + 1,
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  get prevSibling() {
+    return this._parent && this.index >= 0 ? this._parent.nextChild(
+      this.index - 1,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ) : null;
+  }
+  get tree() {
+    return this._tree;
+  }
+  toTree() {
+    return this._tree;
+  }
+  /**
+  @internal
+  */
+  toString() {
+    return this._tree.toString();
+  }
+};
+function getChildren(node, type, before, after) {
+  let cur = node.cursor(), result = [];
+  if (!cur.firstChild())
+    return result;
+  if (before != null)
+    for (let found = false; !found; ) {
+      found = cur.type.is(before);
+      if (!cur.nextSibling())
+        return result;
+    }
+  for (; ; ) {
+    if (after != null && cur.type.is(after))
+      return result;
+    if (cur.type.is(type))
+      result.push(cur.node);
+    if (!cur.nextSibling())
+      return after == null ? result : [];
+  }
+}
+function matchNodeContext(node, context, i = context.length - 1) {
+  for (let p = node; i >= 0; p = p.parent) {
+    if (!p)
+      return false;
+    if (!p.type.isAnonymous) {
+      if (context[i] && context[i] != p.name)
+        return false;
+      i--;
+    }
+  }
+  return true;
+}
+var BufferContext = class {
+  constructor(parent, buffer, index, start) {
+    this.parent = parent;
+    this.buffer = buffer;
+    this.index = index;
+    this.start = start;
+  }
+};
+var BufferNode = class _BufferNode extends BaseNode {
+  get name() {
+    return this.type.name;
+  }
+  get from() {
+    return this.context.start + this.context.buffer.buffer[this.index + 1];
+  }
+  get to() {
+    return this.context.start + this.context.buffer.buffer[this.index + 2];
+  }
+  constructor(context, _parent, index) {
+    super();
+    this.context = context;
+    this._parent = _parent;
+    this.index = index;
+    this.type = context.buffer.set.types[context.buffer.buffer[index]];
+  }
+  child(dir, pos, side) {
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.context.start, side);
+    return index < 0 ? null : new _BufferNode(this.context, this, index);
+  }
+  get firstChild() {
+    return this.child(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get lastChild() {
+    return this.child(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  childAfter(pos) {
+    return this.child(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  childBefore(pos) {
+    return this.child(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  prop(prop) {
+    return this.type.prop(prop);
+  }
+  enter(pos, side, mode = 0) {
+    if (mode & IterMode.ExcludeBuffers)
+      return null;
+    let { buffer } = this.context;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], side > 0 ? 1 : -1, pos - this.context.start, side);
+    return index < 0 ? null : new _BufferNode(this.context, this, index);
+  }
+  get parent() {
+    return this._parent || this.context.parent.nextSignificantParent();
+  }
+  externalSibling(dir) {
+    return this._parent ? null : this.context.parent.nextChild(
+      this.context.index + dir,
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  get nextSibling() {
+    let { buffer } = this.context;
+    let after = buffer.buffer[this.index + 3];
+    if (after < (this._parent ? buffer.buffer[this._parent.index + 3] : buffer.buffer.length))
+      return new _BufferNode(this.context, this._parent, after);
+    return this.externalSibling(1);
+  }
+  get prevSibling() {
+    let { buffer } = this.context;
+    let parentStart = this._parent ? this._parent.index + 4 : 0;
+    if (this.index == parentStart)
+      return this.externalSibling(-1);
+    return new _BufferNode(this.context, this._parent, buffer.findChild(
+      parentStart,
+      this.index,
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    ));
+  }
+  get tree() {
+    return null;
+  }
+  toTree() {
+    let children = [], positions = [];
+    let { buffer } = this.context;
+    let startI = this.index + 4, endI = buffer.buffer[this.index + 3];
+    if (endI > startI) {
+      let from = buffer.buffer[this.index + 1];
+      children.push(buffer.slice(startI, endI, from));
+      positions.push(0);
+    }
+    return new Tree(this.type, children, positions, this.to - this.from);
+  }
+  /**
+  @internal
+  */
+  toString() {
+    return this.context.buffer.childString(this.index);
+  }
+};
+function iterStack(heads) {
+  if (!heads.length)
+    return null;
+  let pick = 0, picked = heads[0];
+  for (let i = 1; i < heads.length; i++) {
+    let node = heads[i];
+    if (node.from > picked.from || node.to < picked.to) {
+      picked = node;
+      pick = i;
+    }
+  }
+  let next = picked instanceof TreeNode && picked.index < 0 ? null : picked.parent;
+  let newHeads = heads.slice();
+  if (next)
+    newHeads[pick] = next;
+  else
+    newHeads.splice(pick, 1);
+  return new StackIterator(newHeads, picked);
+}
+var StackIterator = class {
+  constructor(heads, node) {
+    this.heads = heads;
+    this.node = node;
+  }
+  get next() {
+    return iterStack(this.heads);
+  }
+};
+function stackIterator(tree, pos, side) {
+  let inner = tree.resolveInner(pos, side), layers = null;
+  for (let scan = inner instanceof TreeNode ? inner : inner.context.parent; scan; scan = scan.parent) {
+    if (scan.index < 0) {
+      let parent = scan.parent;
+      (layers || (layers = [inner])).push(parent.resolve(pos, side));
+      scan = parent;
+    } else {
+      let mount = MountedTree.get(scan.tree);
+      if (mount && mount.overlay && mount.overlay[0].from <= pos && mount.overlay[mount.overlay.length - 1].to >= pos) {
+        let root = new TreeNode(mount.tree, mount.overlay[0].from + scan.from, -1, scan);
+        (layers || (layers = [inner])).push(resolveNode(root, pos, side, false));
+      }
+    }
+  }
+  return layers ? iterStack(layers) : inner;
+}
+var TreeCursor = class {
+  /**
+  Shorthand for `.type.name`.
+  */
+  get name() {
+    return this.type.name;
+  }
+  /**
+  @internal
+  */
+  constructor(node, mode = 0) {
+    this.buffer = null;
+    this.stack = [];
+    this.index = 0;
+    this.bufferNode = null;
+    this.mode = mode & ~IterMode.EnterBracketed;
+    if (node instanceof TreeNode) {
+      this.yieldNode(node);
+    } else {
+      this._tree = node.context.parent;
+      this.buffer = node.context;
+      for (let n = node._parent; n; n = n._parent)
+        this.stack.unshift(n.index);
+      this.bufferNode = node;
+      this.yieldBuf(node.index);
+    }
+  }
+  yieldNode(node) {
+    if (!node)
+      return false;
+    this._tree = node;
+    this.type = node.type;
+    this.from = node.from;
+    this.to = node.to;
+    return true;
+  }
+  yieldBuf(index, type) {
+    this.index = index;
+    let { start, buffer } = this.buffer;
+    this.type = type || buffer.set.types[buffer.buffer[index]];
+    this.from = start + buffer.buffer[index + 1];
+    this.to = start + buffer.buffer[index + 2];
+    return true;
+  }
+  /**
+  @internal
+  */
+  yield(node) {
+    if (!node)
+      return false;
+    if (node instanceof TreeNode) {
+      this.buffer = null;
+      return this.yieldNode(node);
+    }
+    this.buffer = node.context;
+    return this.yieldBuf(node.index, node.type);
+  }
+  /**
+  @internal
+  */
+  toString() {
+    return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
+  }
+  /**
+  @internal
+  */
+  enterChild(dir, pos, side) {
+    if (!this.buffer)
+      return this.yield(this._tree.nextChild(dir < 0 ? this._tree._tree.children.length - 1 : 0, dir, pos, side, this.mode));
+    let { buffer } = this.buffer;
+    let index = buffer.findChild(this.index + 4, buffer.buffer[this.index + 3], dir, pos - this.buffer.start, side);
+    if (index < 0)
+      return false;
+    this.stack.push(this.index);
+    return this.yieldBuf(index);
+  }
+  /**
+  Move the cursor to this node's first child. When this returns
+  false, the node has no child, and the cursor has not been moved.
+  */
+  firstChild() {
+    return this.enterChild(
+      1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /**
+  Move the cursor to this node's last child.
+  */
+  lastChild() {
+    return this.enterChild(
+      -1,
+      0,
+      4
+      /* Side.DontCare */
+    );
+  }
+  /**
+  Move the cursor to the first child that ends after `pos`.
+  */
+  childAfter(pos) {
+    return this.enterChild(
+      1,
+      pos,
+      2
+      /* Side.After */
+    );
+  }
+  /**
+  Move to the last child that starts before `pos`.
+  */
+  childBefore(pos) {
+    return this.enterChild(
+      -1,
+      pos,
+      -2
+      /* Side.Before */
+    );
+  }
+  /**
+  Move the cursor to the child around `pos`. If side is -1 the
+  child may end at that position, when 1 it may start there. This
+  will also enter [overlaid](#common.MountedTree.overlay)
+  [mounted](#common.NodeProp^mounted) trees unless `overlays` is
+  set to false.
+  */
+  enter(pos, side, mode = this.mode) {
+    if (!this.buffer)
+      return this.yield(this._tree.enter(pos, side, mode));
+    return mode & IterMode.ExcludeBuffers ? false : this.enterChild(1, pos, side);
+  }
+  /**
+  Move to the node's parent node, if this isn't the top node.
+  */
+  parent() {
+    if (!this.buffer)
+      return this.yieldNode(this.mode & IterMode.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+    if (this.stack.length)
+      return this.yieldBuf(this.stack.pop());
+    let parent = this.mode & IterMode.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    this.buffer = null;
+    return this.yieldNode(parent);
+  }
+  /**
+  @internal
+  */
+  sibling(dir) {
+    if (!this.buffer)
+      return !this._tree._parent ? false : this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + dir, dir, 0, 4, this.mode));
+    let { buffer } = this.buffer, d = this.stack.length - 1;
+    if (dir < 0) {
+      let parentStart = d < 0 ? 0 : this.stack[d] + 4;
+      if (this.index != parentStart)
+        return this.yieldBuf(buffer.findChild(
+          parentStart,
+          this.index,
+          -1,
+          0,
+          4
+          /* Side.DontCare */
+        ));
+    } else {
+      let after = buffer.buffer[this.index + 3];
+      if (after < (d < 0 ? buffer.buffer.length : buffer.buffer[this.stack[d] + 3]))
+        return this.yieldBuf(after);
+    }
+    return d < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + dir, dir, 0, 4, this.mode)) : false;
+  }
+  /**
+  Move to this node's next sibling, if any.
+  */
+  nextSibling() {
+    return this.sibling(1);
+  }
+  /**
+  Move to this node's previous sibling, if any.
+  */
+  prevSibling() {
+    return this.sibling(-1);
+  }
+  atLastNode(dir) {
+    let index, parent, { buffer } = this;
+    if (buffer) {
+      if (dir > 0) {
+        if (this.index < buffer.buffer.buffer.length)
+          return false;
+      } else {
+        for (let i = 0; i < this.index; i++)
+          if (buffer.buffer.buffer[i + 3] < this.index)
+            return false;
+      }
+      ({ index, parent } = buffer);
+    } else {
+      ({ index, _parent: parent } = this._tree);
+    }
+    for (; parent; { index, _parent: parent } = parent) {
+      if (index > -1)
+        for (let i = index + dir, e = dir < 0 ? -1 : parent._tree.children.length; i != e; i += dir) {
+          let child = parent._tree.children[i];
+          if (this.mode & IterMode.IncludeAnonymous || child instanceof TreeBuffer || !child.type.isAnonymous || hasChild(child))
+            return false;
+        }
+    }
+    return true;
+  }
+  move(dir, enter) {
+    if (enter && this.enterChild(
+      dir,
+      0,
+      4
+      /* Side.DontCare */
+    ))
+      return true;
+    for (; ; ) {
+      if (this.sibling(dir))
+        return true;
+      if (this.atLastNode(dir) || !this.parent())
+        return false;
+    }
+  }
+  /**
+  Move to the next node in a
+  [pre-order](https://en.wikipedia.org/wiki/Tree_traversal#Pre-order,_NLR)
+  traversal, going from a node to its first child or, if the
+  current node is empty or `enter` is false, its next sibling or
+  the next sibling of the first parent node that has one.
+  */
+  next(enter = true) {
+    return this.move(1, enter);
+  }
+  /**
+  Move to the next node in a last-to-first pre-order traversal. A
+  node is followed by its last child or, if it has none, its
+  previous sibling or the previous sibling of the first parent
+  node that has one.
+  */
+  prev(enter = true) {
+    return this.move(-1, enter);
+  }
+  /**
+  Move the cursor to the innermost node that covers `pos`. If
+  `side` is -1, it will enter nodes that end at `pos`. If it is 1,
+  it will enter nodes that start at `pos`.
+  */
+  moveTo(pos, side = 0) {
+    while (this.from == this.to || (side < 1 ? this.from >= pos : this.from > pos) || (side > -1 ? this.to <= pos : this.to < pos))
+      if (!this.parent())
+        break;
+    while (this.enterChild(1, pos, side)) {
+    }
+    return this;
+  }
+  /**
+  Get a [syntax node](#common.SyntaxNode) at the cursor's current
+  position.
+  */
+  get node() {
+    if (!this.buffer)
+      return this._tree;
+    let cache = this.bufferNode, result = null, depth = 0;
+    if (cache && cache.context == this.buffer) {
+      scan: for (let index = this.index, d = this.stack.length; d >= 0; ) {
+        for (let c = cache; c; c = c._parent)
+          if (c.index == index) {
+            if (index == this.index)
+              return c;
+            result = c;
+            depth = d + 1;
+            break scan;
+          }
+        index = this.stack[--d];
+      }
+    }
+    for (let i = depth; i < this.stack.length; i++)
+      result = new BufferNode(this.buffer, result, this.stack[i]);
+    return this.bufferNode = new BufferNode(this.buffer, result, this.index);
+  }
+  /**
+  Get the [tree](#common.Tree) that represents the current node, if
+  any. Will return null when the node is in a [tree
+  buffer](#common.TreeBuffer).
+  */
+  get tree() {
+    return this.buffer ? null : this._tree._tree;
+  }
+  /**
+  Iterate over the current node and all its descendants, calling
+  `enter` when entering a node and `leave`, if given, when leaving
+  one. When `enter` returns `false`, any children of that node are
+  skipped, and `leave` isn't called for it.
+  */
+  iterate(enter, leave) {
+    for (let depth = 0; ; ) {
+      let mustLeave = false;
+      if (this.type.isAnonymous || enter(this) !== false) {
+        if (this.firstChild()) {
+          depth++;
+          continue;
+        }
+        if (!this.type.isAnonymous)
+          mustLeave = true;
+      }
+      for (; ; ) {
+        if (mustLeave && leave)
+          leave(this);
+        mustLeave = this.type.isAnonymous;
+        if (!depth)
+          return;
+        if (this.nextSibling())
+          break;
+        this.parent();
+        depth--;
+        mustLeave = true;
+      }
+    }
+  }
+  /**
+  Test whether the current node matches a given context—a sequence
+  of direct parent node names. Empty strings in the context array
+  are treated as wildcards.
+  */
+  matchContext(context) {
+    if (!this.buffer)
+      return matchNodeContext(this.node.parent, context);
+    let { buffer } = this.buffer, { types } = buffer.set;
+    for (let i = context.length - 1, d = this.stack.length - 1; i >= 0; d--) {
+      if (d < 0)
+        return matchNodeContext(this._tree, context, i);
+      let type = types[buffer.buffer[this.stack[d]]];
+      if (!type.isAnonymous) {
+        if (context[i] && context[i] != type.name)
+          return false;
+        i--;
+      }
+    }
+    return true;
+  }
+};
+function hasChild(tree) {
+  return tree.children.some((ch) => ch instanceof TreeBuffer || !ch.type.isAnonymous || hasChild(ch));
+}
+function buildTree(data) {
+  var _a;
+  let { buffer, nodeSet, maxBufferLength = DefaultBufferLength, reused = [], minRepeatType = nodeSet.types.length } = data;
+  let cursor = Array.isArray(buffer) ? new FlatBufferCursor(buffer, buffer.length) : buffer;
+  let types = nodeSet.types;
+  let contextHash = 0, lookAhead = 0;
+  function takeNode(parentStart, minPos, children2, positions2, inRepeat, depth) {
+    let { id, start, end, size } = cursor;
+    let lookAheadAtStart = lookAhead, contextAtStart = contextHash;
+    if (size < 0) {
+      cursor.next();
+      if (size == -1) {
+        let node2 = reused[id];
+        children2.push(node2);
+        positions2.push(start - parentStart);
+        return;
+      } else if (size == -3) {
+        contextHash = id;
+        return;
+      } else if (size == -4) {
+        lookAhead = id;
+        return;
+      } else {
+        throw new RangeError(`Unrecognized record size: ${size}`);
+      }
+    }
+    let type = types[id], node, buffer2;
+    let startPos = start - parentStart;
+    if (end - start <= maxBufferLength && (buffer2 = findBufferSize(cursor.pos - minPos, inRepeat))) {
+      let data2 = new Uint16Array(buffer2.size - buffer2.skip);
+      let endPos = cursor.pos - buffer2.size, index = data2.length;
+      while (cursor.pos > endPos)
+        index = copyToBuffer(buffer2.start, data2, index);
+      node = new TreeBuffer(data2, end - buffer2.start, nodeSet);
+      startPos = buffer2.start - parentStart;
+    } else {
+      let endPos = cursor.pos - size;
+      cursor.next();
+      let localChildren = [], localPositions = [];
+      let localInRepeat = id >= minRepeatType ? id : -1;
+      let lastGroup = 0, lastEnd = end;
+      while (cursor.pos > endPos) {
+        if (localInRepeat >= 0 && cursor.id == localInRepeat && cursor.size >= 0) {
+          if (cursor.end <= lastEnd - maxBufferLength) {
+            makeRepeatLeaf(localChildren, localPositions, start, lastGroup, cursor.end, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);
+            lastGroup = localChildren.length;
+            lastEnd = cursor.end;
+          }
+          cursor.next();
+        } else if (depth > 2500) {
+          takeFlatNode(start, endPos, localChildren, localPositions);
+        } else {
+          takeNode(start, endPos, localChildren, localPositions, localInRepeat, depth + 1);
+        }
+      }
+      if (localInRepeat >= 0 && lastGroup > 0 && lastGroup < localChildren.length)
+        makeRepeatLeaf(localChildren, localPositions, start, lastGroup, start, lastEnd, localInRepeat, lookAheadAtStart, contextAtStart);
+      localChildren.reverse();
+      localPositions.reverse();
+      if (localInRepeat > -1 && lastGroup > 0) {
+        let make = makeBalanced(type, contextAtStart);
+        node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);
+      } else {
+        node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end, contextAtStart);
+      }
+    }
+    children2.push(node);
+    positions2.push(startPos);
+  }
+  function takeFlatNode(parentStart, minPos, children2, positions2) {
+    let nodes = [];
+    let nodeCount = 0, stopAt = -1;
+    while (cursor.pos > minPos) {
+      let { id, start, end, size } = cursor;
+      if (size > 4) {
+        cursor.next();
+      } else if (stopAt > -1 && start < stopAt) {
+        break;
+      } else {
+        if (stopAt < 0)
+          stopAt = end - maxBufferLength;
+        nodes.push(id, start, end);
+        nodeCount++;
+        cursor.next();
+      }
+    }
+    if (nodeCount) {
+      let buffer2 = new Uint16Array(nodeCount * 4);
+      let start = nodes[nodes.length - 2];
+      for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {
+        buffer2[j++] = nodes[i];
+        buffer2[j++] = nodes[i + 1] - start;
+        buffer2[j++] = nodes[i + 2] - start;
+        buffer2[j++] = j;
+      }
+      children2.push(new TreeBuffer(buffer2, nodes[2] - start, nodeSet));
+      positions2.push(start - parentStart);
+    }
+  }
+  function makeBalanced(type, contextHash2) {
+    return (children2, positions2, length2) => {
+      let lookAhead2 = 0, lastI = children2.length - 1, last, lookAheadProp;
+      if (lastI >= 0 && (last = children2[lastI]) instanceof Tree) {
+        if (!lastI && last.type == type && last.length == length2)
+          return last;
+        if (lookAheadProp = last.prop(NodeProp.lookAhead))
+          lookAhead2 = positions2[lastI] + last.length + lookAheadProp;
+      }
+      return makeTree(type, children2, positions2, length2, lookAhead2, contextHash2);
+    };
+  }
+  function makeRepeatLeaf(children2, positions2, base, i, from, to, type, lookAhead2, contextHash2) {
+    let localChildren = [], localPositions = [];
+    while (children2.length > i) {
+      localChildren.push(children2.pop());
+      localPositions.push(positions2.pop() + base - from);
+    }
+    children2.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead2 - to, contextHash2));
+    positions2.push(from - base);
+  }
+  function makeTree(type, children2, positions2, length2, lookAhead2, contextHash2, props) {
+    if (contextHash2) {
+      let pair = [NodeProp.contextHash, contextHash2];
+      props = props ? [pair].concat(props) : [pair];
+    }
+    if (lookAhead2 > 25) {
+      let pair = [NodeProp.lookAhead, lookAhead2];
+      props = props ? [pair].concat(props) : [pair];
+    }
+    return new Tree(type, children2, positions2, length2, props);
+  }
+  function findBufferSize(maxSize, inRepeat) {
+    let fork = cursor.fork();
+    let size = 0, start = 0, skip = 0, minStart = fork.end - maxBufferLength;
+    let result = { size: 0, start: 0, skip: 0 };
+    scan: for (let minPos = fork.pos - maxSize; fork.pos > minPos; ) {
+      let nodeSize2 = fork.size;
+      if (fork.id == inRepeat && nodeSize2 >= 0) {
+        result.size = size;
+        result.start = start;
+        result.skip = skip;
+        skip += 4;
+        size += 4;
+        fork.next();
+        continue;
+      }
+      let startPos = fork.pos - nodeSize2;
+      if (nodeSize2 < 0 || startPos < minPos || fork.start < minStart)
+        break;
+      let localSkipped = fork.id >= minRepeatType ? 4 : 0;
+      let nodeStart = fork.start;
+      fork.next();
+      while (fork.pos > startPos) {
+        if (fork.size < 0) {
+          if (fork.size == -3 || fork.size == -4)
+            localSkipped += 4;
+          else
+            break scan;
+        } else if (fork.id >= minRepeatType) {
+          localSkipped += 4;
+        }
+        fork.next();
+      }
+      start = nodeStart;
+      size += nodeSize2;
+      skip += localSkipped;
+    }
+    if (inRepeat < 0 || size == maxSize) {
+      result.size = size;
+      result.start = start;
+      result.skip = skip;
+    }
+    return result.size > 4 ? result : void 0;
+  }
+  function copyToBuffer(bufferStart, buffer2, index) {
+    let { id, start, end, size } = cursor;
+    cursor.next();
+    if (size >= 0 && id < minRepeatType) {
+      let startIndex = index;
+      if (size > 4) {
+        let endPos = cursor.pos - (size - 4);
+        while (cursor.pos > endPos)
+          index = copyToBuffer(bufferStart, buffer2, index);
+      }
+      buffer2[--index] = startIndex;
+      buffer2[--index] = end - bufferStart;
+      buffer2[--index] = start - bufferStart;
+      buffer2[--index] = id;
+    } else if (size == -3) {
+      contextHash = id;
+    } else if (size == -4) {
+      lookAhead = id;
+    }
+    return index;
+  }
+  let children = [], positions = [];
+  while (cursor.pos > 0)
+    takeNode(data.start || 0, data.bufferStart || 0, children, positions, -1, 0);
+  let length = (_a = data.length) !== null && _a !== void 0 ? _a : children.length ? positions[0] + children[0].length : 0;
+  return new Tree(types[data.topID], children.reverse(), positions.reverse(), length);
+}
+var nodeSizeCache = /* @__PURE__ */ new WeakMap();
+function nodeSize(balanceType, node) {
+  if (!balanceType.isAnonymous || node instanceof TreeBuffer || node.type != balanceType)
+    return 1;
+  let size = nodeSizeCache.get(node);
+  if (size == null) {
+    size = 1;
+    for (let child of node.children) {
+      if (child.type != balanceType || !(child instanceof Tree)) {
+        size = 1;
+        break;
+      }
+      size += nodeSize(balanceType, child);
+    }
+    nodeSizeCache.set(node, size);
+  }
+  return size;
+}
+function balanceRange(balanceType, children, positions, from, to, start, length, mkTop, mkTree) {
+  let total = 0;
+  for (let i = from; i < to; i++)
+    total += nodeSize(balanceType, children[i]);
+  let maxChild = Math.ceil(
+    total * 1.5 / 8
+    /* Balance.BranchFactor */
+  );
+  let localChildren = [], localPositions = [];
+  function divide(children2, positions2, from2, to2, offset) {
+    for (let i = from2; i < to2; ) {
+      let groupFrom = i, groupStart = positions2[i], groupSize = nodeSize(balanceType, children2[i]);
+      i++;
+      for (; i < to2; i++) {
+        let nextSize = nodeSize(balanceType, children2[i]);
+        if (groupSize + nextSize >= maxChild)
+          break;
+        groupSize += nextSize;
+      }
+      if (i == groupFrom + 1) {
+        if (groupSize > maxChild) {
+          let only = children2[groupFrom];
+          divide(only.children, only.positions, 0, only.children.length, positions2[groupFrom] + offset);
+          continue;
+        }
+        localChildren.push(children2[groupFrom]);
+      } else {
+        let length2 = positions2[i - 1] + children2[i - 1].length - groupStart;
+        localChildren.push(balanceRange(balanceType, children2, positions2, groupFrom, i, groupStart, length2, null, mkTree));
+      }
+      localPositions.push(groupStart + offset - start);
+    }
+  }
+  divide(children, positions, from, to, 0);
+  return (mkTop || mkTree)(localChildren, localPositions, length);
+}
+var stoppedInner = new NodeProp({ perNode: true });
+
+// node_modules/.pnpm/@codemirror+commands@6.10.3/node_modules/@codemirror/commands/dist/index.js
+var fromHistory = /* @__PURE__ */ Annotation2.define();
+var isolateHistory = /* @__PURE__ */ Annotation2.define();
+var invertedEffects = /* @__PURE__ */ Facet.define();
+var historyConfig = /* @__PURE__ */ Facet.define({
+  combine(configs) {
+    return combineConfig(configs, {
+      minDepth: 100,
+      newGroupDelay: 500,
+      joinToEvent: (_t, isAdjacent2) => isAdjacent2
+    }, {
+      minDepth: Math.max,
+      newGroupDelay: Math.min,
+      joinToEvent: (a, b) => (tr, adj) => a(tr, adj) || b(tr, adj)
+    });
+  }
+});
+var historyField_ = /* @__PURE__ */ StateField2.define({
+  create() {
+    return HistoryState.empty;
+  },
+  update(state, tr) {
+    let config = tr.state.facet(historyConfig);
+    let fromHist = tr.annotation(fromHistory);
+    if (fromHist) {
+      let item = HistEvent.fromTransaction(tr, fromHist.selection), from = fromHist.side;
+      let other = from == 0 ? state.undone : state.done;
+      if (item)
+        other = updateBranch(other, other.length, config.minDepth, item);
+      else
+        other = addSelection(other, tr.startState.selection);
+      return new HistoryState(from == 0 ? fromHist.rest : other, from == 0 ? other : fromHist.rest);
+    }
+    let isolate = tr.annotation(isolateHistory);
+    if (isolate == "full" || isolate == "before")
+      state = state.isolate();
+    if (tr.annotation(Transaction3.addToHistory) === false)
+      return !tr.changes.empty ? state.addMapping(tr.changes.desc) : state;
+    let event = HistEvent.fromTransaction(tr);
+    let time = tr.annotation(Transaction3.time), userEvent = tr.annotation(Transaction3.userEvent);
+    if (event)
+      state = state.addChanges(event, time, userEvent, config, tr);
+    else if (tr.selection)
+      state = state.addSelection(tr.startState.selection, time, userEvent, config.newGroupDelay);
+    if (isolate == "full" || isolate == "after")
+      state = state.isolate();
+    return state;
+  },
+  toJSON(value) {
+    return { done: value.done.map((e) => e.toJSON()), undone: value.undone.map((e) => e.toJSON()) };
+  },
+  fromJSON(json) {
+    return new HistoryState(json.done.map(HistEvent.fromJSON), json.undone.map(HistEvent.fromJSON));
+  }
+});
+function history(config = {}) {
+  return [
+    historyField_,
+    historyConfig.of(config),
+    EditorView4.domEventHandlers({
+      beforeinput(e, view) {
+        let command = e.inputType == "historyUndo" ? undo : e.inputType == "historyRedo" ? redo : null;
+        if (!command)
+          return false;
+        e.preventDefault();
+        return command(view);
+      }
+    })
+  ];
+}
+var historyField = historyField_;
+function cmd(side, selection) {
+  return function({ state, dispatch }) {
+    if (!selection && state.readOnly)
+      return false;
+    let historyState = state.field(historyField_, false);
+    if (!historyState)
+      return false;
+    let tr = historyState.pop(side, state, selection);
+    if (!tr)
+      return false;
+    dispatch(tr);
+    return true;
+  };
+}
+var undo = /* @__PURE__ */ cmd(0, false);
+var redo = /* @__PURE__ */ cmd(1, false);
+var undoSelection = /* @__PURE__ */ cmd(0, true);
+var redoSelection = /* @__PURE__ */ cmd(1, true);
+var HistEvent = class _HistEvent {
+  constructor(changes, effects, mapped, startSelection, selectionsAfter) {
+    this.changes = changes;
+    this.effects = effects;
+    this.mapped = mapped;
+    this.startSelection = startSelection;
+    this.selectionsAfter = selectionsAfter;
+  }
+  setSelAfter(after) {
+    return new _HistEvent(this.changes, this.effects, this.mapped, this.startSelection, after);
+  }
+  toJSON() {
+    var _a, _b, _c;
+    return {
+      changes: (_a = this.changes) === null || _a === void 0 ? void 0 : _a.toJSON(),
+      mapped: (_b = this.mapped) === null || _b === void 0 ? void 0 : _b.toJSON(),
+      startSelection: (_c = this.startSelection) === null || _c === void 0 ? void 0 : _c.toJSON(),
+      selectionsAfter: this.selectionsAfter.map((s) => s.toJSON())
+    };
+  }
+  static fromJSON(json) {
+    return new _HistEvent(json.changes && ChangeSet2.fromJSON(json.changes), [], json.mapped && ChangeDesc.fromJSON(json.mapped), json.startSelection && EditorSelection.fromJSON(json.startSelection), json.selectionsAfter.map(EditorSelection.fromJSON));
+  }
+  // This does not check `addToHistory` and such, it assumes the
+  // transaction needs to be converted to an item. Returns null when
+  // there are no changes or effects in the transaction.
+  static fromTransaction(tr, selection) {
+    let effects = none;
+    for (let invert of tr.startState.facet(invertedEffects)) {
+      let result = invert(tr);
+      if (result.length)
+        effects = effects.concat(result);
+    }
+    if (!effects.length && tr.changes.empty)
+      return null;
+    return new _HistEvent(tr.changes.invert(tr.startState.doc), effects, void 0, selection || tr.startState.selection, none);
+  }
+  static selection(selections) {
+    return new _HistEvent(void 0, none, void 0, void 0, selections);
+  }
+};
+function updateBranch(branch, to, maxLen, newEvent) {
+  let start = to + 1 > maxLen + 20 ? to - maxLen - 1 : 0;
+  let newBranch = branch.slice(start, to);
+  newBranch.push(newEvent);
+  return newBranch;
+}
+function isAdjacent(a, b) {
+  let ranges = [], isAdjacent2 = false;
+  a.iterChangedRanges((f, t) => ranges.push(f, t));
+  b.iterChangedRanges((_f, _t, f, t) => {
+    for (let i = 0; i < ranges.length; ) {
+      let from = ranges[i++], to = ranges[i++];
+      if (t >= from && f <= to)
+        isAdjacent2 = true;
+    }
+  });
+  return isAdjacent2;
+}
+function eqSelectionShape(a, b) {
+  return a.ranges.length == b.ranges.length && a.ranges.filter((r, i) => r.empty != b.ranges[i].empty).length === 0;
+}
+function conc(a, b) {
+  return !a.length ? b : !b.length ? a : a.concat(b);
+}
+var none = [];
+var MaxSelectionsPerEvent = 200;
+function addSelection(branch, selection) {
+  if (!branch.length) {
+    return [HistEvent.selection([selection])];
+  } else {
+    let lastEvent = branch[branch.length - 1];
+    let sels = lastEvent.selectionsAfter.slice(Math.max(0, lastEvent.selectionsAfter.length - MaxSelectionsPerEvent));
+    if (sels.length && sels[sels.length - 1].eq(selection))
+      return branch;
+    sels.push(selection);
+    return updateBranch(branch, branch.length - 1, 1e9, lastEvent.setSelAfter(sels));
+  }
+}
+function popSelection(branch) {
+  let last = branch[branch.length - 1];
+  let newBranch = branch.slice();
+  newBranch[branch.length - 1] = last.setSelAfter(last.selectionsAfter.slice(0, last.selectionsAfter.length - 1));
+  return newBranch;
+}
+function addMappingToBranch(branch, mapping) {
+  if (!branch.length)
+    return branch;
+  let length = branch.length, selections = none;
+  while (length) {
+    let event = mapEvent(branch[length - 1], mapping, selections);
+    if (event.changes && !event.changes.empty || event.effects.length) {
+      let result = branch.slice(0, length);
+      result[length - 1] = event;
+      return result;
+    } else {
+      mapping = event.mapped;
+      length--;
+      selections = event.selectionsAfter;
+    }
+  }
+  return selections.length ? [HistEvent.selection(selections)] : none;
+}
+function mapEvent(event, mapping, extraSelections) {
+  let selections = conc(event.selectionsAfter.length ? event.selectionsAfter.map((s) => s.map(mapping)) : none, extraSelections);
+  if (!event.changes)
+    return HistEvent.selection(selections);
+  let mappedChanges = event.changes.map(mapping), before = mapping.mapDesc(event.changes, true);
+  let fullMapping = event.mapped ? event.mapped.composeDesc(before) : before;
+  return new HistEvent(mappedChanges, StateEffect2.mapEffects(event.effects, mapping), fullMapping, event.startSelection.map(before), selections);
+}
+var joinableUserEvent = /^(input\.type|delete)($|\.)/;
+var HistoryState = class _HistoryState {
+  constructor(done, undone, prevTime = 0, prevUserEvent = void 0) {
+    this.done = done;
+    this.undone = undone;
+    this.prevTime = prevTime;
+    this.prevUserEvent = prevUserEvent;
+  }
+  isolate() {
+    return this.prevTime ? new _HistoryState(this.done, this.undone) : this;
+  }
+  addChanges(event, time, userEvent, config, tr) {
+    let done = this.done, lastEvent = done[done.length - 1];
+    if (lastEvent && lastEvent.changes && !lastEvent.changes.empty && event.changes && (!userEvent || joinableUserEvent.test(userEvent)) && (!lastEvent.selectionsAfter.length && time - this.prevTime < config.newGroupDelay && config.joinToEvent(tr, isAdjacent(lastEvent.changes, event.changes)) || // For compose (but not compose.start) events, always join with previous event
+    userEvent == "input.type.compose")) {
+      done = updateBranch(done, done.length - 1, config.minDepth, new HistEvent(event.changes.compose(lastEvent.changes), conc(StateEffect2.mapEffects(event.effects, lastEvent.changes), lastEvent.effects), lastEvent.mapped, lastEvent.startSelection, none));
+    } else {
+      done = updateBranch(done, done.length, config.minDepth, event);
+    }
+    return new _HistoryState(done, none, time, userEvent);
+  }
+  addSelection(selection, time, userEvent, newGroupDelay) {
+    let last = this.done.length ? this.done[this.done.length - 1].selectionsAfter : none;
+    if (last.length > 0 && time - this.prevTime < newGroupDelay && userEvent == this.prevUserEvent && userEvent && /^select($|\.)/.test(userEvent) && eqSelectionShape(last[last.length - 1], selection))
+      return this;
+    return new _HistoryState(addSelection(this.done, selection), this.undone, time, userEvent);
+  }
+  addMapping(mapping) {
+    return new _HistoryState(addMappingToBranch(this.done, mapping), addMappingToBranch(this.undone, mapping), this.prevTime, this.prevUserEvent);
+  }
+  pop(side, state, onlySelection) {
+    let branch = side == 0 ? this.done : this.undone;
+    if (branch.length == 0)
+      return null;
+    let event = branch[branch.length - 1], selection = event.selectionsAfter[0] || (event.startSelection ? event.startSelection.map(event.changes.invertedDesc, 1) : state.selection);
+    if (onlySelection && event.selectionsAfter.length) {
+      return state.update({
+        selection: event.selectionsAfter[event.selectionsAfter.length - 1],
+        annotations: fromHistory.of({ side, rest: popSelection(branch), selection }),
+        userEvent: side == 0 ? "select.undo" : "select.redo",
+        scrollIntoView: true
+      });
+    } else if (!event.changes) {
+      return null;
+    } else {
+      let rest = branch.length == 1 ? none : branch.slice(0, branch.length - 1);
+      if (event.mapped)
+        rest = addMappingToBranch(rest, event.mapped);
+      return state.update({
+        changes: event.changes,
+        selection: event.startSelection,
+        effects: event.effects,
+        annotations: fromHistory.of({ side, rest, selection }),
+        filter: false,
+        userEvent: side == 0 ? "undo" : "redo",
+        scrollIntoView: true
+      });
+    }
+  }
+};
+HistoryState.empty = /* @__PURE__ */ new HistoryState(none, none);
+var historyKeymap = [
+  { key: "Mod-z", run: undo, preventDefault: true },
+  { key: "Mod-y", mac: "Mod-Shift-z", run: redo, preventDefault: true },
+  { linux: "Ctrl-Shift-z", run: redo, preventDefault: true },
+  { key: "Mod-u", run: undoSelection, preventDefault: true },
+  { key: "Alt-u", mac: "Mod-Shift-u", run: redoSelection, preventDefault: true }
+];
+var segmenter = typeof Intl != "undefined" && Intl.Segmenter ? /* @__PURE__ */ new Intl.Segmenter(void 0, { granularity: "word" }) : null;
+
+// src/vendor/automerge-codemirror/history.ts
+import { Compartment as Compartment2 } from "@codemirror/state";
+import { ViewPlugin as ViewPlugin2, keymap } from "@codemirror/view";
+var automergeHistory = ({
+  handle
+}) => {
+  const compartment = new Compartment2();
+  const historyExtension = () => [history(), keymap.of(historyKeymap)];
+  const resetPlugin = ViewPlugin2.fromClass(
+    class {
+      warned = false;
+      destroyed = false;
+      view;
+      constructor(view) {
+        this.view = view;
+        this.onChange = this.onChange.bind(this);
+        handle.on("change", this.onChange);
+        queueMicrotask(() => {
+          if (!this.destroyed) this.reset();
+        });
+      }
+      onChange(payload) {
+        if (payload?.scopeReplaced) this.reset();
+      }
+      // CodeMirror has no clear-history API; the sanctioned reset is cycling
+      // the extension out of and back into the configuration, which drops
+      // the history field's state and re-creates it empty.
+      reset() {
+        this.view.dispatch({ effects: compartment.reconfigure([]) });
+        if (!this.warned && this.view.state.field(historyField, false) !== void 0) {
+          this.warned = true;
+          console.warn(
+            "[automerge-codemirror] another history() extension is present in this editor's configuration, so the undo history cannot be reset when the handle's backing is swapped. Remove the other copy \u2014 note that basicSetup includes one."
+          );
+        }
+        this.view.dispatch({
+          effects: compartment.reconfigure(historyExtension())
+        });
+      }
+      destroy() {
+        this.destroyed = true;
+        handle.off("change", this.onChange);
+      }
+    }
+  );
+  return [compartment.of(historyExtension()), resetPlugin];
+};
+
+// src/vendor/automerge-codemirror/readOnly.ts
+import { Compartment as Compartment3, EditorState as EditorState3 } from "@codemirror/state";
+import { EditorView as EditorView6, ViewPlugin as ViewPlugin3 } from "@codemirror/view";
+var automergeReadOnly = ({
+  handle
+}) => {
+  const compartment = new Compartment3();
+  const isReadOnly = () => !!handle.isReadOnly?.();
+  const extensions = () => isReadOnly() ? [EditorState3.readOnly.of(true), EditorView6.editable.of(false)] : [];
+  const trackPlugin = ViewPlugin3.fromClass(
+    class {
+      wasPrevReadOnly = isReadOnly();
+      destroyed = false;
+      view;
+      constructor(view) {
+        this.view = view;
+        this.onChange = this.onChange.bind(this);
+        handle.on("change", this.onChange);
+        queueMicrotask(() => {
+          if (!this.destroyed) this.sync();
+        });
+      }
+      onChange(payload) {
+        if (payload?.scopeReplaced) this.sync();
+      }
+      sync() {
+        const current = isReadOnly();
+        if (current === this.wasPrevReadOnly) return;
+        this.wasPrevReadOnly = current;
+        this.view.dispatch({ effects: compartment.reconfigure(extensions()) });
+      }
+      destroy() {
+        this.destroyed = true;
+        handle.off("change", this.onChange);
+      }
+    }
+  );
+  return [compartment.of(extensions()), trackPlugin];
+};
+
+// src/vendor/automerge-codemirror/index.ts
+var automergePlugin = ({
+  handle,
+  path
+}) => [
+  automergeSyncPlugin({ handle, path }),
+  automergeHistory({ handle }),
+  automergeReadOnly({ handle })
+];
+
+// src/lib/extensions/automerge.ts
+function createAutomergeExtension(handle, path, initialDoc) {
+  const compartment = new Compartment4();
+  const extension = () => handle() && path() ? automergePlugin({
+    handle: handle(),
+    // typescript is confused by different version of doc handle
+    path: path()
+  }) : [];
+  const createReconfigureEffect = (view) => createEffect3(() => {
+    view.dispatch({
+      effects: compartment.reconfigure(extension()),
+      changes: {
+        from: 0,
+        to: view.state.doc.length,
+        insert: initialDoc()
+      },
+      annotations: [
+        Transaction4.addToHistory.of(false),
+        Transaction4.remote.of(true)
+      ]
+    });
+  });
+  return [compartment.of(extension()), createReconfigureEffect];
+}
+
+// src/lib/extensions/diff.ts
+import { createEffect as createEffect4 } from "solid-js";
+import {
+  Decoration as Decoration2,
+  ViewPlugin as ViewPlugin4,
+  WidgetType
+} from "@codemirror/view";
+import { RangeSet, StateEffect as StateEffect3 } from "@codemirror/state";
+import { next as Automerge } from "@automerge/automerge/slim";
+import {
+  decodeHeads
+} from "@automerge/automerge-repo/slim";
+var setBaseline = StateEffect3.define();
+function createDiffExtension(handle, path, baseline) {
+  const plugin = ViewPlugin4.fromClass(
+    class {
+      baseline = null;
+      decorations = Decoration2.none;
+      update(update) {
+        let baselineChanged = false;
+        for (const tr of update.transactions) {
+          for (const effect of tr.effects) {
+            if (effect.is(setBaseline)) {
+              this.baseline = effect.value;
+              baselineChanged = true;
+            }
+          }
+        }
+        if (update.docChanged || baselineChanged) {
+          this.decorations = this.build();
+        }
+      }
+      build() {
+        const heads = this.baseline;
+        const doc = handle()?.doc();
+        if (!heads || !doc) return Decoration2.none;
+        return RangeSet.of(
+          buildDiffDecorations(
+            diffContent(doc, heads, path()),
+            prefersDarkMode()
+          ),
+          true
+          // sort ranges
+        );
+      }
+    },
+    { decorations: (v) => v.decorations }
+  );
+  const createReconfigureEffect = (view) => createEffect4(() => {
+    view.dispatch({ effects: setBaseline.of(baseline()) });
+  });
+  return [plugin, createReconfigureEffect];
+}
+function diffContent(doc, baselineHeads, path) {
+  const before = decodeHeads(baselineHeads);
+  const beforeContent = lookupString(Automerge.view(doc, before), path);
+  const patches = Automerge.diff(doc, before, Automerge.getHeads(doc));
+  const out = [];
+  let offset = 0;
+  for (const patch of patches) {
+    if (!isIndexedChildOf(patch.path, path)) continue;
+    const pos = patch.path[path.length];
+    if (patch.action === "splice") {
+      const len = patch.value.length;
+      out.push({ type: "added", from: pos, to: pos + len });
+      offset -= len;
+    } else if (patch.action === "del") {
+      const len = patch.length ?? 1;
+      const original = pos + offset;
+      out.push({
+        type: "deleted",
+        at: pos,
+        text: beforeContent.substring(original, original + len)
+      });
+      offset += len;
+    }
+  }
+  return out;
+}
+function buildDiffDecorations(diffs, dark) {
+  const out = [];
+  for (const diff2 of diffs) {
+    if (diff2.type === "deleted") {
+      out.push(
+        Decoration2.widget({
+          widget: new DeletionMarker(diff2.text, false),
+          side: 1
+        }).range(diff2.at)
+      );
+      continue;
+    }
+    if (diff2.from === diff2.to) continue;
+    out.push(
+      Decoration2.mark({
+        attributes: { style: addedDiffStyle(dark) }
+      }).range(diff2.from, diff2.to)
+    );
+  }
+  return out;
+}
+function isIndexedChildOf(patchPath, path) {
+  if (patchPath.length !== path.length + 1) return false;
+  for (let i = 0; i < path.length; i++) {
+    if (patchPath[i] !== path[i]) return false;
+  }
+  return typeof patchPath[path.length] === "number";
+}
+function lookupString(doc, path) {
+  let current = doc;
+  for (const key of path) {
+    if (current == null) return "";
+    current = current[key];
+  }
+  return typeof current === "string" ? current : "";
+}
+function addedDiffStyle(dark) {
+  return `
+    border-bottom: 2px solid ${dark ? "#4ade80" : "#22c55e"};
+    background-color: ${dark ? "#14532d" : "#dcfce7"};
+  `;
+}
+function prefersDarkMode() {
+  return window.matchMedia("(prefers-color-scheme: dark)").matches;
+}
+var DeletionMarker = class extends WidgetType {
+  deletedText;
+  isActive;
+  constructor(deletedText, isActive) {
+    super();
+    this.deletedText = deletedText;
+    this.isActive = isActive;
+  }
+  toDOM() {
+    const box = document.createElement("div");
+    box.style.display = "inline-block";
+    box.style.position = "relative";
+    box.style.lineHeight = "1";
+    box.style.verticalAlign = "middle";
+    box.style.boxSizing = "border-box";
+    box.style.padding = "2px 3px";
+    box.style.color = "rgb(239 68 68)";
+    box.style.margin = "0 4px";
+    box.style.fontSize = "1.2em";
+    box.style.whiteSpace = "nowrap";
+    box.style.backgroundColor = this.isActive ? "rgb(239 68 68 / 20%)" : "rgb(239 68 68 / 10%)";
+    box.style.borderRadius = "3px";
+    box.style.cursor = "default";
+    box.innerText = "\u232B";
+    const hoverText = document.createElement("div");
+    hoverText.style.position = "absolute";
+    hoverText.style.top = "100%";
+    hoverText.style.left = "0";
+    hoverText.style.zIndex = "1";
+    hoverText.style.padding = "5px";
+    hoverText.style.backgroundColor = "rgb(254 242 242)";
+    hoverText.style.fontSize = "15px";
+    hoverText.style.color = "rgb(17 24 39)";
+    hoverText.style.border = "1px solid rgb(185 28 28)";
+    hoverText.style.boxShadow = "0px 0px 6px rgba(0, 0, 0, 0.1)";
+    hoverText.style.borderRadius = "3px";
+    hoverText.style.visibility = "hidden";
+    hoverText.innerText = this.deletedText;
+    const isDarkMode = document.documentElement.classList.contains("dark") || window.matchMedia("(prefers-color-scheme: dark)").matches;
+    if (isDarkMode) {
+      box.style.color = "rgb(248 113 113)";
+      box.style.backgroundColor = this.isActive ? "rgb(248 113 113 / 20%)" : "rgb(248 113 113 / 10%)";
+      hoverText.style.backgroundColor = "rgb(69 10 10)";
+      hoverText.style.color = "rgb(254 226 226)";
+      hoverText.style.border = "1px solid rgb(153 27 27)";
+    }
+    box.appendChild(hoverText);
+    box.onmouseover = function() {
+      hoverText.style.visibility = "visible";
+    };
+    box.onmouseout = function() {
+      hoverText.style.visibility = "hidden";
+    };
+    return box;
+  }
+  eq(other) {
+    return other.deletedText === this.deletedText && other.isActive === this.isActive;
+  }
+  ignoreEvent() {
+    return true;
+  }
+};
+
+// src/lib/extensions/scrollHighlightIntoView.ts
+import { createEffect as createEffect5 } from "solid-js";
+import { EditorView as EditorView8 } from "@codemirror/view";
+import { EditorSelection as EditorSelection2 } from "@codemirror/state";
+function createScrollHighlightIntoViewExtension(target) {
+  const extension = [];
+  const createScrollHighlightIntoViewEffect = (view) => createEffect5(() => {
+    const range = target();
+    if (!range) return;
+    const docLength = view.state.doc.length;
+    const from = Math.min(range[0], docLength);
+    const to = Math.min(range[1], docLength);
+    view.dispatch({
+      effects: EditorView8.scrollIntoView(EditorSelection2.range(from, to), {
+        x: "nearest",
+        y: "nearest"
+      })
+    });
+  });
+  return [extension, createScrollHighlightIntoViewEffect];
+}
+
+// src/lib/extensions/presence.ts
+import { createEffect as createEffect6 } from "solid-js";
+import {
+  Decoration as Decoration3,
+  EditorView as EditorView9,
+  RectangleMarker,
+  ViewPlugin as ViewPlugin5,
+  layer
+} from "@codemirror/view";
+import {
+  Compartment as Compartment5,
+  EditorSelection as EditorSelection3,
+  StateEffect as StateEffect4,
+  StateField as StateField3,
+  Transaction as Transaction5
+} from "@codemirror/state";
+import {
+  next as A3
+} from "@automerge/automerge/slim";
+import {
+  Presence
+} from "@automerge/automerge-repo/slim";
+function createPresenceExtension(handle, path, contactUrl) {
+  const compartment = new Compartment5();
+  const extension = () => {
+    const url = contactUrl();
+    return url ? presence(handle(), path(), url) : [];
+  };
+  const createReconfigureEffect = (view) => createEffect6(() => {
+    view.dispatch({ effects: compartment.reconfigure(extension()) });
+  });
+  return [compartment.of(extension()), createReconfigureEffect];
+}
+function presence(handle, path, contactUrl) {
+  const setRemoteSelections = StateEffect4.define();
+  const remoteSelectionField = StateField3.define({
+    create() {
+      return [];
+    },
+    update(value, tr) {
+      if (tr.docChanged) {
+        value = value.map((sel) => ({
+          ...sel,
+          from: tr.changes.mapPos(sel.from),
+          to: tr.changes.mapPos(sel.to),
+          head: tr.changes.mapPos(sel.head)
+        }));
+      }
+      for (const e of tr.effects) {
+        if (e.is(setRemoteSelections)) value = e.value;
+      }
+      return value;
+    },
+    // Selection tints are plain mark decorations: they carry no stateful
+    // DOM, so redrawing them is invisible.
+    provide: (f) => EditorView9.decorations.from(f, buildSelectionTints)
+  });
+  const caretLayer = layer({
+    above: true,
+    class: "cm-presence-layer",
+    update: (update) => update.docChanged || update.transactions.some(
+      (tr) => tr.effects.some((e) => e.is(setRemoteSelections))
+    ),
+    markers(view) {
+      const selections = [...view.state.field(remoteSelectionField)].sort(
+        (a, b) => a.peerId < b.peerId ? -1 : a.peerId > b.peerId ? 1 : 0
+      );
+      const markers = [];
+      for (const sel of selections) {
+        const [rect] = RectangleMarker.forRange(
+          view,
+          "cm-presence-caret",
+          EditorSelection3.cursor(sel.head)
+        );
+        if (!rect) continue;
+        markers.push(
+          new PresenceCaretMarker(sel, rect.left, rect.top, rect.height)
+        );
+      }
+      return markers;
+    }
+  });
+  const plugin = ViewPlugin5.fromClass(
+    class {
+      view;
+      presence;
+      destroyed = false;
+      broadcastQueued = false;
+      constructor(view) {
+        this.view = view;
+        this.presence = new Presence({
+          handle,
+          userId: contactUrl
+        });
+        this.presence.start({ initialState: { selection: null } });
+        this.presence.on("update", this.refresh);
+        this.presence.on("snapshot", this.refresh);
+        this.presence.on("goodbye", this.refresh);
+        this.presence.on("pruned", this.refresh);
+        window.addEventListener("pagehide", this.stopPresence);
+      }
+      update(update) {
+        const typed = update.docChanged && update.transactions.some(
+          (tr) => tr.annotation(Transaction5.userEvent) !== void 0
+        );
+        if (update.focusChanged && !update.view.hasFocus) {
+          if (this.presence.running) {
+            this.presence.broadcast("selection", null);
+          }
+        } else if (update.selectionSet || typed || update.focusChanged && update.view.hasFocus) {
+          this.scheduleBroadcast();
+        }
+        if (update.docChanged) {
+          queueMicrotask(this.refresh);
+        }
+      }
+      destroy() {
+        this.destroyed = true;
+        this.stopPresence();
+        window.removeEventListener("pagehide", this.stopPresence);
+      }
+      stopPresence = () => {
+        if (this.presence.running) this.presence.stop();
+      };
+      // rAF-throttled (matching tldraw4) so drag-selections don't flood the
+      // channel. The selection is read fresh at flush time.
+      scheduleBroadcast() {
+        if (this.broadcastQueued) return;
+        this.broadcastQueued = true;
+        requestAnimationFrame(() => {
+          this.broadcastQueued = false;
+          if (this.destroyed || !this.presence.running) return;
+          if (!this.view.hasFocus) return;
+          const doc = handle.doc();
+          const sel = this.view.state.selection.main;
+          this.presence.broadcast("selection", {
+            start: A3.getCursor(doc, path, sel.from),
+            end: A3.getCursor(doc, path, sel.to),
+            headAtStart: sel.to > sel.from && sel.head === sel.from,
+            lastMoved: Date.now()
+          });
+        });
+      }
+      // Re-resolve every peer's cursors against the current doc. A cursor can
+      // briefly fail to resolve when a presence message races ahead of doc
+      // sync -- the peer is skipped and picked up again on the next change.
+      refresh = () => {
+        if (this.destroyed) return;
+        const doc = handle.doc();
+        const resolved = [];
+        for (const peer of this.presence.getPeerStates().peers) {
+          const peerId = String(peer.peerId);
+          const selection = peer.value?.selection ?? null;
+          if (!selection) continue;
+          try {
+            const from = A3.getCursorPosition(doc, path, selection.start);
+            const to = A3.getCursorPosition(doc, path, selection.end);
+            const peerContactUrl = peer.userId ?? null;
+            resolved.push({
+              peerId,
+              contactUrl: peerContactUrl,
+              // Same rule as the contact-cursor token (palette hash of the
+              // contact url), so the tint and the token can't drift apart.
+              color: generateColorFromString(peerContactUrl ?? peerId),
+              from,
+              to,
+              head: selection.headAtStart ? from : to,
+              lastMoved: selection.lastMoved
+            });
+          } catch {
+            continue;
+          }
+        }
+        this.view.dispatch({ effects: setRemoteSelections.of(resolved) });
+      };
+    }
+  );
+  return [remoteSelectionField, caretLayer, plugin, presenceTheme];
+}
+function buildSelectionTints(selections) {
+  const ranges = [];
+  for (const sel of selections) {
+    if (sel.from < sel.to) {
+      ranges.push(
+        Decoration3.mark({
+          class: "cm-presence-range",
+          attributes: {
+            style: `background-color: color-mix(in srgb, ${sel.color} 25%, transparent);`
+          }
+        }).range(sel.from, sel.to)
+      );
+    }
+  }
+  return Decoration3.set(ranges, true);
+}
+var LABEL_TIMEOUT_MS = 2e3;
+var PresenceCaretMarker = class {
+  sel;
+  left;
+  top;
+  height;
+  constructor(sel, left, top, height) {
+    this.sel = sel;
+    this.left = left;
+    this.top = top;
+    this.height = height;
+  }
+  eq(other) {
+    return other.sel.peerId === this.sel.peerId && other.sel.contactUrl === this.sel.contactUrl && other.sel.color === this.sel.color && other.sel.lastMoved === this.sel.lastMoved && other.left === this.left && other.top === this.top && other.height === this.height;
+  }
+  draw() {
+    const caret = document.createElement("div");
+    caret.className = "cm-presence-caret";
+    caret.dataset.peerId = this.sel.peerId;
+    if (this.sel.contactUrl) {
+      const label = document.createElement("span");
+      label.className = "cm-presence-caret-label";
+      const token = document.createElement("patchwork-view");
+      token.setAttribute("doc-url", this.sel.contactUrl);
+      token.setAttribute("tool-id", "contact-cursor");
+      token.style.display = "block";
+      label.appendChild(token);
+      caret.appendChild(label);
+    }
+    this.adjust(caret);
+    restartIdleCountdown(caret);
+    return caret;
+  }
+  // Reposition the peer's existing element instead of redrawing it, keeping
+  // the mounted contact token alive (a remount re-renders asynchronously and
+  // flickers -- see the layer comment in `presence`).
+  update(dom, prev) {
+    if (prev.sel.peerId !== this.sel.peerId || prev.sel.contactUrl !== this.sel.contactUrl) {
+      return false;
+    }
+    this.adjust(dom);
+    if (prev.sel.lastMoved !== this.sel.lastMoved) restartIdleCountdown(dom);
+    return true;
+  }
+  adjust(dom) {
+    dom.style.left = `${this.left}px`;
+    dom.style.top = `${this.top}px`;
+    dom.style.height = `${this.height}px`;
+    dom.style.setProperty("--cm-presence-color", this.sel.color);
+  }
+};
+var idleTimers = /* @__PURE__ */ new WeakMap();
+function restartIdleCountdown(caret) {
+  clearTimeout(idleTimers.get(caret));
+  caret.classList.remove("cm-presence-caret--idle");
+  idleTimers.set(
+    caret,
+    setTimeout(
+      () => caret.classList.add("cm-presence-caret--idle"),
+      LABEL_TIMEOUT_MS
+    )
+  );
+}
+var presenceTheme = EditorView9.baseTheme({
+  // Positioned absolutely by the layer (document-relative); -1px centers
+  // the 2px bar on the caret position.
+  ".cm-presence-caret": {
+    borderLeft: "2px solid var(--cm-presence-color)",
+    marginLeft: "-1px",
+    pointerEvents: "none"
+  },
+  ".cm-presence-caret-label": {
+    position: "absolute",
+    top: "-1.4em",
+    left: "-2px",
+    zIndex: "150",
+    whiteSpace: "nowrap",
+    pointerEvents: "none",
+    userSelect: "none",
+    opacity: "1",
+    transition: "opacity 200ms ease-in-out"
+  },
+  ".cm-presence-caret--idle .cm-presence-caret-label": {
+    opacity: "0"
+  }
+});
+var USER_COLOR_PALETTE = [
+  "hsl(200, 70%, 50%)",
+  "hsl(10, 75%, 58%)",
+  "hsl(145, 70%, 45%)",
+  "hsl(270, 70%, 55%)",
+  "hsl(38, 85%, 50%)",
+  "hsl(350, 70%, 55%)",
+  "hsl(178, 70%, 45%)",
+  "hsl(235, 70%, 58%)",
+  "hsl(85, 70%, 45%)",
+  "hsl(310, 70%, 55%)",
+  "hsl(25, 80%, 52%)",
+  "hsl(188, 75%, 48%)"
+];
+function generateColorFromString(str) {
+  const hash = Math.abs(
+    str.split("").reduce((acc, char) => acc + char.charCodeAt(0), 0)
+  );
+  return USER_COLOR_PALETTE[hash % USER_COLOR_PALETTE.length];
+}
+
+// src/lib/codemirror.tsx
+var lookup = (doc, path) => {
+  let current = doc;
+  for (const key of path) {
+    current = current[key];
+    if (current === void 0) {
+      return void 0;
+    }
+  }
+  return current;
+};
+function CodeMirror(props) {
+  const initialDoc = () => props.handle && lookup(props.handle.doc(), props.path) || "";
+  const [automergeExtension, createEffectReconfigureAutomerge] = createAutomergeExtension(() => props.handle, () => props.path, initialDoc);
+  const [readOnlyExtension, createEffectReconfigureReadOnly] = createReadOnlyExtension(() => !!props.readOnly);
+  const [decorationsExtension, createEffectReconfigureDecorations] = createDecorationsExtension(() => props.decorations?.());
+  const [diffExtension, createEffectReconfigureDiff] = createDiffExtension(() => props.handle, () => props.path, () => props.baseline?.() ?? null);
+  const [scrollHighlightIntoViewExtension, createEffectScrollHighlightIntoView] = createScrollHighlightIntoViewExtension(() => props.scrollTarget?.() ?? null);
+  const [presenceExtension, createEffectReconfigurePresence] = createPresenceExtension(() => props.handle, () => props.path, () => props.readOnly || props.handle.isReadOnly() ? null : props.contactUrl?.() ?? null);
+  const userExtensionsCompartment = new Compartment6();
+  const selectionExtension = EditorView10.updateListener.of((update) => {
+    if (!props.onChangeSelection) return;
+    if (update.selectionSet) {
+      const sel = update.state.selection.main;
+      props.onChangeSelection(sel.from, sel.to);
+    }
+  });
+  const extensions = [
+    selectionExtension,
+    decorationsExtension,
+    // automergeExtension must come before diffExtension so diff stays in sync with edits.
+    automergeExtension,
+    diffExtension,
+    scrollHighlightIntoViewExtension,
+    presenceExtension,
+    userExtensionsCompartment.of(props.extensions || []),
+    readOnlyExtension
+  ].filter(Boolean);
+  const state = EditorState4.create({
+    doc: initialDoc(),
+    extensions
+  });
+  const view = new EditorView10({
+    state
+  });
+  props.withView?.(view);
+  createEffectReconfigureAutomerge(view);
+  createEffectReconfigureReadOnly(view);
+  createEffectReconfigureDecorations?.(view);
+  createEffectReconfigureDiff(view);
+  createEffectScrollHighlightIntoView(view);
+  createEffectReconfigurePresence(view);
+  createEffect7(() => {
+    view.dispatch({
+      effects: userExtensionsCompartment.reconfigure(props.extensions || [])
+    });
+  });
+  onCleanup(() => view.destroy());
+  return view.dom;
+}
+
+export {
+  CodeMirror
+};
+//# sourceMappingURL=chunk-H5POLO74.js.map