@onereach/ui-components-vue2 16.2.0-beta.4827.0

package/dist/bundled/index-0c3e5ac3.js

@@ -0,0 +1,4147 @@
+import { codePointSize, codePointAt, EditorSelection, CharCategory, Prec, Facet, combineConfig, StateField, StateEffect, MapMode, RangeValue, RangeSet, fromCodePoint, Annotation, Text, Transaction } from '@codemirror/state';
+import { EditorView, keymap, Direction, showTooltip, getTooltip, ViewPlugin, logException, Decoration, WidgetType } from '@codemirror/view';
+import { syntaxTree, indentUnit } from '@codemirror/language';
+
+/**
+The default maximum length of a `TreeBuffer` node.
+*/
+const DefaultBufferLength = 1024;
+let nextPropID = 0;
+class Range {
+  constructor(from, to) {
+    this.from = from;
+    this.to = to;
+  }
+}
+/**
+Each [node type](#common.NodeType) or [individual tree](#common.Tree)
+can have metadata associated with it in props. Instances of this
+class represent prop names.
+*/
+class NodeProp {
+  /**
+  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 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 === undefined ? null : [this, result];
+    };
+  }
+}
+/**
+Prop that is used to describe matching delimiters. For opening
+delimiters, this holds an array of node names (written as a
+space-separated string when declaring this prop in a grammar)
+for the node types of closing delimiters that match it.
+*/
+NodeProp.closedBy = new NodeProp({
+  deserialize: str => str.split(" ")
+});
+/**
+The inverse of [`closedBy`](#common.NodeProp^closedBy). This is
+attached to closing delimiters, holding an array of node names
+of types of matching opening delimiters.
+*/
+NodeProp.openedBy = new NodeProp({
+  deserialize: str => str.split(" ")
+});
+/**
+Used to assign node types to groups (for example, all node
+types that represent an expression could be tagged with an
+`"Expression"` group).
+*/
+NodeProp.group = new NodeProp({
+  deserialize: str => str.split(" ")
+});
+/**
+Attached to nodes to indicate these should be
+[displayed](https://codemirror.net/docs/ref/#language.syntaxTree)
+in a bidirectional text isolate, so that direction-neutral
+characters on their sides don't incorrectly get associated with
+surrounding text. You'll generally want to set this for nodes
+that contain arbitrary text, like strings and comments, and for
+nodes that appear _inside_ arbitrary text, like HTML tags. When
+not given a value, in a grammar declaration, defaults to
+`"auto"`.
+*/
+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";
+  }
+});
+/**
+The hash of the [context](#lr.ContextTracker.constructor)
+that the node was parsed in, if any. Used to limit reuse of
+contextual nodes.
+*/
+NodeProp.contextHash = new NodeProp({
+  perNode: true
+});
+/**
+The distance beyond the end of the node that the tokenizer
+looked ahead for any of the tokens inside the node. (The LR
+parser only stores this when it is larger than 25, for
+efficiency reasons.)
+*/
+NodeProp.lookAhead = new NodeProp({
+  perNode: true
+});
+/**
+This per-node prop is used to replace a given node, or part of a
+node, with another tree. This is useful to include trees from
+different languages in mixed-language parsers.
+*/
+NodeProp.mounted = new NodeProp({
+  perNode: true
+});
+/**
+A mounted tree, which can be [stored](#common.NodeProp^mounted) on
+a tree node to indicate that parts of its content are
+represented by another tree.
+*/
+class MountedTree {
+  constructor(
+  /**
+  The inner tree.
+  */
+  tree,
+  /**
+  If this is null, this tree replaces the entire node (it will
+  be included in the regular iteration instead of its host
+  node). If not, only the given ranges are considered to be
+  covered by this tree. This is used for trees that are mixed in
+  a way that isn't strictly hierarchical. Such mounted trees are
+  only entered by [`resolveInner`](#common.Tree.resolveInner)
+  and [`enter`](#common.SyntaxNode.enter).
+  */
+  overlay,
+  /**
+  The parser used to create this subtree.
+  */
+  parser) {
+    this.tree = tree;
+    this.overlay = overlay;
+    this.parser = parser;
+  }
+  /**
+  @internal
+  */
+  static get(tree) {
+    return tree && tree.props && tree.props[NodeProp.mounted.id];
+  }
+}
+const noProps = Object.create(null);
+/**
+Each node in a syntax tree has a node type associated with it.
+*/
+class NodeType {
+  /**
+  @internal
+  */
+  constructor(
+  /**
+  The name of the node type. Not necessarily unique, but if the
+  grammar was written properly, different node types with the
+  same name within a node set should play the same semantic
+  role.
+  */
+  name,
+  /**
+  @internal
+  */
+  props,
+  /**
+  The id of this node in its set. Corresponds to the term ids
+  used in the parser.
+  */
+  id,
+  /**
+  @internal
+  */
+  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 ? Object.create(null) : noProps;
+    let flags = (spec.top ? 1 /* NodeFlag.Top */ : 0) | (spec.skipped ? 2 /* NodeFlag.Skipped */ : 0) | (spec.error ? 4 /* NodeFlag.Error */ : 0) | (spec.name == null ? 8 /* NodeFlag.Anonymous */ : 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 /* NodeFlag.Top */) > 0;
+  }
+  /**
+  True when this node is produced by a skip rule.
+  */
+  get isSkipped() {
+    return (this.flags & 2 /* NodeFlag.Skipped */) > 0;
+  }
+  /**
+  Indicates whether this is an error node.
+  */
+  get isError() {
+    return (this.flags & 4 /* NodeFlag.Error */) > 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 /* NodeFlag.Anonymous */) > 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 = 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;
+      }
+    };
+  }
+}
+/**
+An empty dummy node type to use when no actual type is available.
+*/
+NodeType.none = new NodeType("", Object.create(null), 0, 8 /* NodeFlag.Anonymous */);
+/**
+A node set holds a collection of node types. It is used to
+compactly represent trees by storing their type ids, rather than a
+full pointer to the type object, in a numeric array. Each parser
+[has](#lr.LRParser.nodeSet) a node set, and [tree
+buffers](#common.TreeBuffer) can only store collections of nodes
+from the same set. A set can have a maximum of 2**16 (65536) node
+types in it, so that the ids fit into 16-bit typed array slots.
+*/
+class NodeSet {
+  /**
+  Create a set with the given types. The `id` property of each
+  type should correspond to its position within the array.
+  */
+  constructor(
+  /**
+  The node types in this set, by id.
+  */
+  types) {
+    this.types = types;
+    for (let i = 0; i < types.length; i++) if (types[i].id != i) throw new RangeError("Node type ids should correspond to array positions when creating a node set");
+  }
+  /**
+  Create a copy of this set with some node properties added. The
+  arguments to this method can be created with
+  [`NodeProp.add`](#common.NodeProp.add).
+  */
+  extend(...props) {
+    let newTypes = [];
+    for (let type of this.types) {
+      let newProps = null;
+      for (let source of props) {
+        let add = source(type);
+        if (add) {
+          if (!newProps) newProps = Object.assign({}, type.props);
+          newProps[add[0].id] = add[1];
+        }
+      }
+      newTypes.push(newProps ? new NodeType(type.name, newProps, type.id, type.flags) : type);
+    }
+    return new NodeSet(newTypes);
+  }
+}
+const CachedNode = new WeakMap(),
+  CachedInnerNode = new WeakMap();
+/**
+Options that control iteration. Can be combined with the `|`
+operator to enable multiple ones.
+*/
+var IterMode;
+(function (IterMode) {
+  /**
+  When enabled, iteration will only visit [`Tree`](#common.Tree)
+  objects, not nodes packed into
+  [`TreeBuffer`](#common.TreeBuffer)s.
+  */
+  IterMode[IterMode["ExcludeBuffers"] = 1] = "ExcludeBuffers";
+  /**
+  Enable this to make iteration include anonymous nodes (such as
+  the nodes that wrap repeated grammar constructs into a balanced
+  tree).
+  */
+  IterMode[IterMode["IncludeAnonymous"] = 2] = "IncludeAnonymous";
+  /**
+  By default, regular [mounted](#common.NodeProp^mounted) nodes
+  replace their base node in iteration. Enable this to ignore them
+  instead.
+  */
+  IterMode[IterMode["IgnoreMounts"] = 4] = "IgnoreMounts";
+  /**
+  This option only applies in
+  [`enter`](#common.SyntaxNode.enter)-style methods. It tells the
+  library to not enter mounted overlays if one covers the given
+  position.
+  */
+  IterMode[IterMode["IgnoreOverlays"] = 8] = "IgnoreOverlays";
+})(IterMode || (IterMode = {}));
+/**
+A piece of syntax tree. There are two ways to approach these
+trees: the way they are actually stored in memory, and the
+convenient way.
+
+Syntax trees are stored as a tree of `Tree` and `TreeBuffer`
+objects. By packing detail information into `TreeBuffer` leaf
+nodes, the representation is made a lot more memory-efficient.
+
+However, when you want to actually work with tree nodes, this
+representation is very awkward, so most client code will want to
+use the [`TreeCursor`](#common.TreeCursor) or
+[`SyntaxNode`](#common.SyntaxNode) interface instead, which provides
+a view on some part of this data structure, and can be used to
+move around to adjacent nodes.
+*/
+class Tree {
+  /**
+  Construct a new tree. See also [`Tree.build`](#common.Tree^build).
+  */
+  constructor(
+  /**
+  The type of the top node.
+  */
+  type,
+  /**
+  This node's child nodes.
+  */
+  children,
+  /**
+  The positions (offsets relative to the start of this tree) of
+  the children.
+  */
+  positions,
+  /**
+  The total length of this tree
+  */
+  length,
+  /**
+  Per-node [node props](#common.NodeProp) to associate with this node.
+  */
+  props) {
+    this.type = type;
+    this.children = children;
+    this.positions = positions;
+    this.length = length;
+    /**
+    @internal
+    */
+    this.props = null;
+    if (props && props.length) {
+      this.props = 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] : undefined;
+  }
+  /**
+  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 /* Balance.BranchFactor */ ? 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);
+  }
+}
+/**
+The empty tree
+*/
+Tree.empty = new Tree(NodeType.none, [], [], 0);
+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);
+  }
+}
+/**
+Tree buffers contain (type, start, end, endIndex) quads for each
+node. In such a buffer, nodes are stored in prefix order (parents
+before children, with the endIndex of the parent indicating which
+children belong to it).
+*/
+class TreeBuffer {
+  /**
+  Create a tree buffer.
+  */
+  constructor(
+  /**
+  The buffer's content.
+  */
+  buffer,
+  /**
+  The total length of the group of nodes in the buffer.
+  */
+  length,
+  /**
+  The node set used in this buffer.
+  */
+  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 /* Side.Before */:
+      return from < pos;
+    case -1 /* Side.AtOrBefore */:
+      return to >= pos && from < pos;
+    case 0 /* Side.Around */:
+      return from < pos && to > pos;
+    case 1 /* Side.AtOrAfter */:
+      return from <= pos && to > pos;
+    case 2 /* Side.After */:
+      return to > pos;
+    case 4 /* Side.DontCare */:
+      return true;
+  }
+}
+function resolveNode(node, pos, side, overlays) {
+  var _a;
+  // Move up to a node that actually holds the position, if possible
+  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;
+  // Must go up out of overlays when those do not overlap with pos
+  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;
+  }
+}
+class BaseNode {
+  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, 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;
+  }
+}
+class TreeNode extends BaseNode {
+  constructor(_tree, from,
+  // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)
+  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;
+        if (!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 mounted;
+          if (!(mode & IterMode.IgnoreMounts) && (mounted = MountedTree.get(next)) && !mounted.overlay) return new TreeNode(mounted.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);
+        }
+      }
+      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 */);
+  }
+  enter(pos, side, mode = 0) {
+    let mounted;
+    if (!(mode & IterMode.IgnoreOverlays) && (mounted = MountedTree.get(this._tree)) && mounted.overlay) {
+      let rPos = pos - this.from;
+      for (let {
+        from,
+        to
+      } of mounted.overlay) {
+        if ((side > 0 ? from <= rPos : from < rPos) && (side < 0 ? 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.parent; 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;
+}
+class BufferContext {
+  constructor(parent, buffer, index, start) {
+    this.parent = parent;
+    this.buffer = buffer;
+    this.index = index;
+    this.start = start;
+  }
+}
+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 */);
+  }
+  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);
+}
+class StackIterator {
+  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) {
+      // This is an overlay root
+      let parent = scan.parent;
+      (layers || (layers = [inner])).push(parent.resolve(pos, side));
+      scan = parent;
+    } else {
+      let mount = MountedTree.get(scan.tree);
+      // Relevant overlay branching off
+      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;
+}
+/**
+A tree cursor object focuses on a given node in a syntax tree, and
+allows you to move to adjacent nodes.
+*/
+class TreeCursor {
+  /**
+  Shorthand for `.type.name`.
+  */
+  get name() {
+    return this.type.name;
+  }
+  /**
+  @internal
+  */
+  constructor(node,
+  /**
+  @internal
+  */
+  mode = 0) {
+    this.mode = mode;
+    /**
+    @internal
+    */
+    this.buffer = null;
+    this.stack = [];
+    /**
+    @internal
+    */
+    this.index = 0;
+    this.bufferNode = null;
+    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 /* Side.DontCare */, 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 /* Side.DontCare */, 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 traveral. 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) {
+    // Move up to a node that actually holds the position, if possible
+    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;
+    // Then scan down into child nodes as far as possible
+    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 (this.nextSibling()) break;
+        if (!depth) return;
+        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, 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.node, 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, children, positions, inRepeat, depth) {
+    let {
+      id,
+      start,
+      end,
+      size
+    } = cursor;
+    let lookAheadAtStart = lookAhead;
+    while (size < 0) {
+      cursor.next();
+      if (size == -1 /* SpecialRecord.Reuse */) {
+        let node = reused[id];
+        children.push(node);
+        positions.push(start - parentStart);
+        return;
+      } else if (size == -3 /* SpecialRecord.ContextChange */) {
+        // Context change
+        contextHash = id;
+        return;
+      } else if (size == -4 /* SpecialRecord.LookAhead */) {
+        lookAhead = id;
+        return;
+      } else {
+        throw new RangeError(`Unrecognized record size: ${size}`);
+      }
+    }
+    let type = types[id],
+      node,
+      buffer;
+    let startPos = start - parentStart;
+    if (end - start <= maxBufferLength && (buffer = findBufferSize(cursor.pos - minPos, inRepeat))) {
+      // Small enough for a buffer, and no reused nodes inside
+      let data = new Uint16Array(buffer.size - buffer.skip);
+      let endPos = cursor.pos - buffer.size,
+        index = data.length;
+      while (cursor.pos > endPos) index = copyToBuffer(buffer.start, data, index);
+      node = new TreeBuffer(data, end - buffer.start, nodeSet);
+      startPos = buffer.start - parentStart;
+    } else {
+      // Make it a node
+      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);
+            lastGroup = localChildren.length;
+            lastEnd = cursor.end;
+          }
+          cursor.next();
+        } else if (depth > 2500 /* CutOff.Depth */) {
+          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);
+      localChildren.reverse();
+      localPositions.reverse();
+      if (localInRepeat > -1 && lastGroup > 0) {
+        let make = makeBalanced(type);
+        node = balanceRange(type, localChildren, localPositions, 0, localChildren.length, 0, end - start, make, make);
+      } else {
+        node = makeTree(type, localChildren, localPositions, end - start, lookAheadAtStart - end);
+      }
+    }
+    children.push(node);
+    positions.push(startPos);
+  }
+  function takeFlatNode(parentStart, minPos, children, positions) {
+    let nodes = []; // Temporary, inverted array of leaf nodes found, with absolute positions
+    let nodeCount = 0,
+      stopAt = -1;
+    while (cursor.pos > minPos) {
+      let {
+        id,
+        start,
+        end,
+        size
+      } = cursor;
+      if (size > 4) {
+        // Not a leaf
+        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 buffer = new Uint16Array(nodeCount * 4);
+      let start = nodes[nodes.length - 2];
+      for (let i = nodes.length - 3, j = 0; i >= 0; i -= 3) {
+        buffer[j++] = nodes[i];
+        buffer[j++] = nodes[i + 1] - start;
+        buffer[j++] = nodes[i + 2] - start;
+        buffer[j++] = j;
+      }
+      children.push(new TreeBuffer(buffer, nodes[2] - start, nodeSet));
+      positions.push(start - parentStart);
+    }
+  }
+  function makeBalanced(type) {
+    return (children, positions, length) => {
+      let lookAhead = 0,
+        lastI = children.length - 1,
+        last,
+        lookAheadProp;
+      if (lastI >= 0 && (last = children[lastI]) instanceof Tree) {
+        if (!lastI && last.type == type && last.length == length) return last;
+        if (lookAheadProp = last.prop(NodeProp.lookAhead)) lookAhead = positions[lastI] + last.length + lookAheadProp;
+      }
+      return makeTree(type, children, positions, length, lookAhead);
+    };
+  }
+  function makeRepeatLeaf(children, positions, base, i, from, to, type, lookAhead) {
+    let localChildren = [],
+      localPositions = [];
+    while (children.length > i) {
+      localChildren.push(children.pop());
+      localPositions.push(positions.pop() + base - from);
+    }
+    children.push(makeTree(nodeSet.types[type], localChildren, localPositions, to - from, lookAhead - to));
+    positions.push(from - base);
+  }
+  function makeTree(type, children, positions, length, lookAhead = 0, props) {
+    if (contextHash) {
+      let pair = [NodeProp.contextHash, contextHash];
+      props = props ? [pair].concat(props) : [pair];
+    }
+    if (lookAhead > 25) {
+      let pair = [NodeProp.lookAhead, lookAhead];
+      props = props ? [pair].concat(props) : [pair];
+    }
+    return new Tree(type, children, positions, length, props);
+  }
+  function findBufferSize(maxSize, inRepeat) {
+    // Scan through the buffer to find previous siblings that fit
+    // together in a TreeBuffer, and don't contain any reused nodes
+    // (which can't be stored in a buffer).
+    // If `inRepeat` is > -1, ignore node boundaries of that type for
+    // nesting, but make sure the end falls either at the start
+    // (`maxSize`) or before such a node.
+    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 nodeSize = fork.size;
+      // Pretend nested repeat nodes of the same type don't exist
+      if (fork.id == inRepeat && nodeSize >= 0) {
+        // Except that we store the current state as a valid return
+        // value.
+        result.size = size;
+        result.start = start;
+        result.skip = skip;
+        skip += 4;
+        size += 4;
+        fork.next();
+        continue;
+      }
+      let startPos = fork.pos - nodeSize;
+      if (nodeSize < 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 /* SpecialRecord.ContextChange */) localSkipped += 4;else break scan;
+        } else if (fork.id >= minRepeatType) {
+          localSkipped += 4;
+        }
+        fork.next();
+      }
+      start = nodeStart;
+      size += nodeSize;
+      skip += localSkipped;
+    }
+    if (inRepeat < 0 || size == maxSize) {
+      result.size = size;
+      result.start = start;
+      result.skip = skip;
+    }
+    return result.size > 4 ? result : undefined;
+  }
+  function copyToBuffer(bufferStart, buffer, 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, buffer, index);
+      }
+      buffer[--index] = startIndex;
+      buffer[--index] = end - bufferStart;
+      buffer[--index] = start - bufferStart;
+      buffer[--index] = id;
+    } else if (size == -3 /* SpecialRecord.ContextChange */) {
+      contextHash = id;
+    } else if (size == -4 /* SpecialRecord.LookAhead */) {
+      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);
+}
+const nodeSizeCache = 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(
+// The type the balanced tree's inner nodes.
+balanceType,
+// The direct children and their positions
+children, positions,
+// The index range in children/positions to use
+from, to,
+// The start position of the nodes, relative to their parent.
+start,
+// Length of the outer node
+length,
+// Function to build the top node of the balanced tree
+mkTop,
+// Function to build internal nodes for the balanced tree
+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(children, positions, from, to, offset) {
+    for (let i = from; i < to;) {
+      let groupFrom = i,
+        groupStart = positions[i],
+        groupSize = nodeSize(balanceType, children[i]);
+      i++;
+      for (; i < to; i++) {
+        let nextSize = nodeSize(balanceType, children[i]);
+        if (groupSize + nextSize >= maxChild) break;
+        groupSize += nextSize;
+      }
+      if (i == groupFrom + 1) {
+        if (groupSize > maxChild) {
+          let only = children[groupFrom]; // Only trees can have a size > 1
+          divide(only.children, only.positions, 0, only.children.length, positions[groupFrom] + offset);
+          continue;
+        }
+        localChildren.push(children[groupFrom]);
+      } else {
+        let length = positions[i - 1] + children[i - 1].length - groupStart;
+        localChildren.push(balanceRange(balanceType, children, positions, groupFrom, i, groupStart, length, null, mkTree));
+      }
+      localPositions.push(groupStart + offset - start);
+    }
+  }
+  divide(children, positions, from, to, 0);
+  return (mkTop || mkTree)(localChildren, localPositions, length);
+}
+/**
+Provides a way to associate values with pieces of trees. As long
+as that part of the tree is reused, the associated values can be
+retrieved from an updated tree.
+*/
+class NodeWeakMap {
+  constructor() {
+    this.map = new WeakMap();
+  }
+  setBuffer(buffer, index, value) {
+    let inner = this.map.get(buffer);
+    if (!inner) this.map.set(buffer, inner = new Map());
+    inner.set(index, value);
+  }
+  getBuffer(buffer, index) {
+    let inner = this.map.get(buffer);
+    return inner && inner.get(index);
+  }
+  /**
+  Set the value for this syntax node.
+  */
+  set(node, value) {
+    if (node instanceof BufferNode) this.setBuffer(node.context.buffer, node.index, value);else if (node instanceof TreeNode) this.map.set(node.tree, value);
+  }
+  /**
+  Retrieve value for this syntax node, if it exists in the map.
+  */
+  get(node) {
+    return node instanceof BufferNode ? this.getBuffer(node.context.buffer, node.index) : node instanceof TreeNode ? this.map.get(node.tree) : undefined;
+  }
+  /**
+  Set the value for the node that a cursor currently points to.
+  */
+  cursorSet(cursor, value) {
+    if (cursor.buffer) this.setBuffer(cursor.buffer.buffer, cursor.index, value);else this.map.set(cursor.tree, value);
+  }
+  /**
+  Retrieve the value for the node that a cursor currently points
+  to.
+  */
+  cursorGet(cursor) {
+    return cursor.buffer ? this.getBuffer(cursor.buffer.buffer, cursor.index) : this.map.get(cursor.tree);
+  }
+}
+
+/**
+Tree fragments are used during [incremental
+parsing](#common.Parser.startParse) to track parts of old trees
+that can be reused in a new parse. An array of fragments is used
+to track regions of an old tree whose nodes might be reused in new
+parses. Use the static
+[`applyChanges`](#common.TreeFragment^applyChanges) method to
+update fragments for document changes.
+*/
+class TreeFragment {
+  /**
+  Construct a tree fragment. You'll usually want to use
+  [`addTree`](#common.TreeFragment^addTree) and
+  [`applyChanges`](#common.TreeFragment^applyChanges) instead of
+  calling this directly.
+  */
+  constructor(
+  /**
+  The start of the unchanged range pointed to by this fragment.
+  This refers to an offset in the _updated_ document (as opposed
+  to the original tree).
+  */
+  from,
+  /**
+  The end of the unchanged range.
+  */
+  to,
+  /**
+  The tree that this fragment is based on.
+  */
+  tree,
+  /**
+  The offset between the fragment's tree and the document that
+  this fragment can be used against. Add this when going from
+  document to tree positions, subtract it to go from tree to
+  document positions.
+  */
+  offset, openStart = false, openEnd = false) {
+    this.from = from;
+    this.to = to;
+    this.tree = tree;
+    this.offset = offset;
+    this.open = (openStart ? 1 /* Open.Start */ : 0) | (openEnd ? 2 /* Open.End */ : 0);
+  }
+  /**
+  Whether the start of the fragment represents the start of a
+  parse, or the end of a change. (In the second case, it may not
+  be safe to reuse some nodes at the start, depending on the
+  parsing algorithm.)
+  */
+  get openStart() {
+    return (this.open & 1 /* Open.Start */) > 0;
+  }
+  /**
+  Whether the end of the fragment represents the end of a
+  full-document parse, or the start of a change.
+  */
+  get openEnd() {
+    return (this.open & 2 /* Open.End */) > 0;
+  }
+  /**
+  Create a set of fragments from a freshly parsed tree, or update
+  an existing set of fragments by replacing the ones that overlap
+  with a tree with content from the new tree. When `partial` is
+  true, the parse is treated as incomplete, and the resulting
+  fragment has [`openEnd`](#common.TreeFragment.openEnd) set to
+  true.
+  */
+  static addTree(tree, fragments = [], partial = false) {
+    let result = [new TreeFragment(0, tree.length, tree, 0, false, partial)];
+    for (let f of fragments) if (f.to > tree.length) result.push(f);
+    return result;
+  }
+  /**
+  Apply a set of edits to an array of fragments, removing or
+  splitting fragments as necessary to remove edited ranges, and
+  adjusting offsets for fragments that moved.
+  */
+  static applyChanges(fragments, changes, minGap = 128) {
+    if (!changes.length) return fragments;
+    let result = [];
+    let fI = 1,
+      nextF = fragments.length ? fragments[0] : null;
+    for (let cI = 0, pos = 0, off = 0;; cI++) {
+      let nextC = cI < changes.length ? changes[cI] : null;
+      let nextPos = nextC ? nextC.fromA : 1e9;
+      if (nextPos - pos >= minGap) while (nextF && nextF.from < nextPos) {
+        let cut = nextF;
+        if (pos >= cut.from || nextPos <= cut.to || off) {
+          let fFrom = Math.max(cut.from, pos) - off,
+            fTo = Math.min(cut.to, nextPos) - off;
+          cut = fFrom >= fTo ? null : new TreeFragment(fFrom, fTo, cut.tree, cut.offset + off, cI > 0, !!nextC);
+        }
+        if (cut) result.push(cut);
+        if (nextF.to > nextPos) break;
+        nextF = fI < fragments.length ? fragments[fI++] : null;
+      }
+      if (!nextC) break;
+      pos = nextC.toA;
+      off = nextC.toA - nextC.toB;
+    }
+    return result;
+  }
+}
+/**
+A superclass that parsers should extend.
+*/
+class Parser {
+  /**
+  Start a parse, returning a [partial parse](#common.PartialParse)
+  object. [`fragments`](#common.TreeFragment) can be passed in to
+  make the parse incremental.
+  
+  By default, the entire input is parsed. You can pass `ranges`,
+  which should be a sorted array of non-empty, non-overlapping
+  ranges, to parse only those ranges. The tree returned in that
+  case will start at `ranges[0].from`.
+  */
+  startParse(input, fragments, ranges) {
+    if (typeof input == "string") input = new StringInput(input);
+    ranges = !ranges ? [new Range(0, input.length)] : ranges.length ? ranges.map(r => new Range(r.from, r.to)) : [new Range(0, 0)];
+    return this.createParse(input, fragments || [], ranges);
+  }
+  /**
+  Run a full parse, returning the resulting tree.
+  */
+  parse(input, fragments, ranges) {
+    let parse = this.startParse(input, fragments, ranges);
+    for (;;) {
+      let done = parse.advance();
+      if (done) return done;
+    }
+  }
+}
+class StringInput {
+  constructor(string) {
+    this.string = string;
+  }
+  get length() {
+    return this.string.length;
+  }
+  chunk(from) {
+    return this.string.slice(from);
+  }
+  get lineChunks() {
+    return false;
+  }
+  read(from, to) {
+    return this.string.slice(from, to);
+  }
+}
+
+/**
+Create a parse wrapper that, after the inner parse completes,
+scans its tree for mixed language regions with the `nest`
+function, runs the resulting [inner parses](#common.NestedParse),
+and then [mounts](#common.NodeProp^mounted) their results onto the
+tree.
+*/
+function parseMixed(nest) {
+  return (parse, input, fragments, ranges) => new MixedParse(parse, nest, input, fragments, ranges);
+}
+class InnerParse {
+  constructor(parser, parse, overlay, target, from) {
+    this.parser = parser;
+    this.parse = parse;
+    this.overlay = overlay;
+    this.target = target;
+    this.from = from;
+  }
+}
+function checkRanges(ranges) {
+  if (!ranges.length || ranges.some(r => r.from >= r.to)) throw new RangeError("Invalid inner parse ranges given: " + JSON.stringify(ranges));
+}
+class ActiveOverlay {
+  constructor(parser, predicate, mounts, index, start, target, prev) {
+    this.parser = parser;
+    this.predicate = predicate;
+    this.mounts = mounts;
+    this.index = index;
+    this.start = start;
+    this.target = target;
+    this.prev = prev;
+    this.depth = 0;
+    this.ranges = [];
+  }
+}
+const stoppedInner = new NodeProp({
+  perNode: true
+});
+class MixedParse {
+  constructor(base, nest, input, fragments, ranges) {
+    this.nest = nest;
+    this.input = input;
+    this.fragments = fragments;
+    this.ranges = ranges;
+    this.inner = [];
+    this.innerDone = 0;
+    this.baseTree = null;
+    this.stoppedAt = null;
+    this.baseParse = base;
+  }
+  advance() {
+    if (this.baseParse) {
+      let done = this.baseParse.advance();
+      if (!done) return null;
+      this.baseParse = null;
+      this.baseTree = done;
+      this.startInner();
+      if (this.stoppedAt != null) for (let inner of this.inner) inner.parse.stopAt(this.stoppedAt);
+    }
+    if (this.innerDone == this.inner.length) {
+      let result = this.baseTree;
+      if (this.stoppedAt != null) result = new Tree(result.type, result.children, result.positions, result.length, result.propValues.concat([[stoppedInner, this.stoppedAt]]));
+      return result;
+    }
+    let inner = this.inner[this.innerDone],
+      done = inner.parse.advance();
+    if (done) {
+      this.innerDone++;
+      // This is a somewhat dodgy but super helpful hack where we
+      // patch up nodes created by the inner parse (and thus
+      // presumably not aliased anywhere else) to hold the information
+      // about the inner parse.
+      let props = Object.assign(Object.create(null), inner.target.props);
+      props[NodeProp.mounted.id] = new MountedTree(done, inner.overlay, inner.parser);
+      inner.target.props = props;
+    }
+    return null;
+  }
+  get parsedPos() {
+    if (this.baseParse) return 0;
+    let pos = this.input.length;
+    for (let i = this.innerDone; i < this.inner.length; i++) {
+      if (this.inner[i].from < pos) pos = Math.min(pos, this.inner[i].parse.parsedPos);
+    }
+    return pos;
+  }
+  stopAt(pos) {
+    this.stoppedAt = pos;
+    if (this.baseParse) this.baseParse.stopAt(pos);else for (let i = this.innerDone; i < this.inner.length; i++) this.inner[i].parse.stopAt(pos);
+  }
+  startInner() {
+    let fragmentCursor = new FragmentCursor(this.fragments);
+    let overlay = null;
+    let covered = null;
+    let cursor = new TreeCursor(new TreeNode(this.baseTree, this.ranges[0].from, 0, null), IterMode.IncludeAnonymous | IterMode.IgnoreMounts);
+    scan: for (let nest, isCovered;;) {
+      let enter = true,
+        range;
+      if (this.stoppedAt != null && cursor.from >= this.stoppedAt) {
+        enter = false;
+      } else if (fragmentCursor.hasNode(cursor)) {
+        if (overlay) {
+          let match = overlay.mounts.find(m => m.frag.from <= cursor.from && m.frag.to >= cursor.to && m.mount.overlay);
+          if (match) for (let r of match.mount.overlay) {
+            let from = r.from + match.pos,
+              to = r.to + match.pos;
+            if (from >= cursor.from && to <= cursor.to && !overlay.ranges.some(r => r.from < to && r.to > from)) overlay.ranges.push({
+              from,
+              to
+            });
+          }
+        }
+        enter = false;
+      } else if (covered && (isCovered = checkCover(covered.ranges, cursor.from, cursor.to))) {
+        enter = isCovered != 2 /* Cover.Full */;
+      } else if (!cursor.type.isAnonymous && (nest = this.nest(cursor, this.input)) && (cursor.from < cursor.to || !nest.overlay)) {
+        if (!cursor.tree) materialize(cursor);
+        let oldMounts = fragmentCursor.findMounts(cursor.from, nest.parser);
+        if (typeof nest.overlay == "function") {
+          overlay = new ActiveOverlay(nest.parser, nest.overlay, oldMounts, this.inner.length, cursor.from, cursor.tree, overlay);
+        } else {
+          let ranges = punchRanges(this.ranges, nest.overlay || (cursor.from < cursor.to ? [new Range(cursor.from, cursor.to)] : []));
+          if (ranges.length) checkRanges(ranges);
+          if (ranges.length || !nest.overlay) this.inner.push(new InnerParse(nest.parser, ranges.length ? nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges) : nest.parser.startParse(""), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges.length ? ranges[0].from : cursor.from));
+          if (!nest.overlay) enter = false;else if (ranges.length) covered = {
+            ranges,
+            depth: 0,
+            prev: covered
+          };
+        }
+      } else if (overlay && (range = overlay.predicate(cursor))) {
+        if (range === true) range = new Range(cursor.from, cursor.to);
+        if (range.from < range.to) overlay.ranges.push(range);
+      }
+      if (enter && cursor.firstChild()) {
+        if (overlay) overlay.depth++;
+        if (covered) covered.depth++;
+      } else {
+        for (;;) {
+          if (cursor.nextSibling()) break;
+          if (!cursor.parent()) break scan;
+          if (overlay && ! --overlay.depth) {
+            let ranges = punchRanges(this.ranges, overlay.ranges);
+            if (ranges.length) {
+              checkRanges(ranges);
+              this.inner.splice(overlay.index, 0, new InnerParse(overlay.parser, overlay.parser.startParse(this.input, enterFragments(overlay.mounts, ranges), ranges), overlay.ranges.map(r => new Range(r.from - overlay.start, r.to - overlay.start)), overlay.target, ranges[0].from));
+            }
+            overlay = overlay.prev;
+          }
+          if (covered && ! --covered.depth) covered = covered.prev;
+        }
+      }
+    }
+  }
+}
+function checkCover(covered, from, to) {
+  for (let range of covered) {
+    if (range.from >= to) break;
+    if (range.to > from) return range.from <= from && range.to >= to ? 2 /* Cover.Full */ : 1 /* Cover.Partial */;
+  }
+  return 0 /* Cover.None */;
+}
+// Take a piece of buffer and convert it into a stand-alone
+// TreeBuffer.
+function sliceBuf(buf, startI, endI, nodes, positions, off) {
+  if (startI < endI) {
+    let from = buf.buffer[startI + 1];
+    nodes.push(buf.slice(startI, endI, from));
+    positions.push(from - off);
+  }
+}
+// This function takes a node that's in a buffer, and converts it, and
+// its parent buffer nodes, into a Tree. This is again acting on the
+// assumption that the trees and buffers have been constructed by the
+// parse that was ran via the mix parser, and thus aren't shared with
+// any other code, making violations of the immutability safe.
+function materialize(cursor) {
+  let {
+      node
+    } = cursor,
+    stack = [];
+  let buffer = node.context.buffer;
+  // Scan up to the nearest tree
+  do {
+    stack.push(cursor.index);
+    cursor.parent();
+  } while (!cursor.tree);
+  // Find the index of the buffer in that tree
+  let base = cursor.tree,
+    i = base.children.indexOf(buffer);
+  let buf = base.children[i],
+    b = buf.buffer,
+    newStack = [i];
+  // Split a level in the buffer, putting the nodes before and after
+  // the child that contains `node` into new buffers.
+  function split(startI, endI, type, innerOffset, length, stackPos) {
+    let targetI = stack[stackPos];
+    let children = [],
+      positions = [];
+    sliceBuf(buf, startI, targetI, children, positions, innerOffset);
+    let from = b[targetI + 1],
+      to = b[targetI + 2];
+    newStack.push(children.length);
+    let child = stackPos ? split(targetI + 4, b[targetI + 3], buf.set.types[b[targetI]], from, to - from, stackPos - 1) : node.toTree();
+    children.push(child);
+    positions.push(from - innerOffset);
+    sliceBuf(buf, b[targetI + 3], endI, children, positions, innerOffset);
+    return new Tree(type, children, positions, length);
+  }
+  base.children[i] = split(0, b.length, NodeType.none, 0, buf.length, stack.length - 1);
+  // Move the cursor back to the target node
+  for (let index of newStack) {
+    let tree = cursor.tree.children[index],
+      pos = cursor.tree.positions[index];
+    cursor.yield(new TreeNode(tree, pos + cursor.from, index, cursor._tree));
+  }
+}
+class StructureCursor {
+  constructor(root, offset) {
+    this.offset = offset;
+    this.done = false;
+    this.cursor = root.cursor(IterMode.IncludeAnonymous | IterMode.IgnoreMounts);
+  }
+  // Move to the first node (in pre-order) that starts at or after `pos`.
+  moveTo(pos) {
+    let {
+        cursor
+      } = this,
+      p = pos - this.offset;
+    while (!this.done && cursor.from < p) {
+      if (cursor.to >= pos && cursor.enter(p, 1, IterMode.IgnoreOverlays | IterMode.ExcludeBuffers)) ;else if (!cursor.next(false)) this.done = true;
+    }
+  }
+  hasNode(cursor) {
+    this.moveTo(cursor.from);
+    if (!this.done && this.cursor.from + this.offset == cursor.from && this.cursor.tree) {
+      for (let tree = this.cursor.tree;;) {
+        if (tree == cursor.tree) return true;
+        if (tree.children.length && tree.positions[0] == 0 && tree.children[0] instanceof Tree) tree = tree.children[0];else break;
+      }
+    }
+    return false;
+  }
+}
+class FragmentCursor {
+  constructor(fragments) {
+    var _a;
+    this.fragments = fragments;
+    this.curTo = 0;
+    this.fragI = 0;
+    if (fragments.length) {
+      let first = this.curFrag = fragments[0];
+      this.curTo = (_a = first.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : first.to;
+      this.inner = new StructureCursor(first.tree, -first.offset);
+    } else {
+      this.curFrag = this.inner = null;
+    }
+  }
+  hasNode(node) {
+    while (this.curFrag && node.from >= this.curTo) this.nextFrag();
+    return this.curFrag && this.curFrag.from <= node.from && this.curTo >= node.to && this.inner.hasNode(node);
+  }
+  nextFrag() {
+    var _a;
+    this.fragI++;
+    if (this.fragI == this.fragments.length) {
+      this.curFrag = this.inner = null;
+    } else {
+      let frag = this.curFrag = this.fragments[this.fragI];
+      this.curTo = (_a = frag.tree.prop(stoppedInner)) !== null && _a !== void 0 ? _a : frag.to;
+      this.inner = new StructureCursor(frag.tree, -frag.offset);
+    }
+  }
+  findMounts(pos, parser) {
+    var _a;
+    let result = [];
+    if (this.inner) {
+      this.inner.cursor.moveTo(pos, 1);
+      for (let pos = this.inner.cursor.node; pos; pos = pos.parent) {
+        let mount = (_a = pos.tree) === null || _a === void 0 ? void 0 : _a.prop(NodeProp.mounted);
+        if (mount && mount.parser == parser) {
+          for (let i = this.fragI; i < this.fragments.length; i++) {
+            let frag = this.fragments[i];
+            if (frag.from >= pos.to) break;
+            if (frag.tree == this.curFrag.tree) result.push({
+              frag,
+              pos: pos.from - frag.offset,
+              mount
+            });
+          }
+        }
+      }
+    }
+    return result;
+  }
+}
+function punchRanges(outer, ranges) {
+  let copy = null,
+    current = ranges;
+  for (let i = 1, j = 0; i < outer.length; i++) {
+    let gapFrom = outer[i - 1].to,
+      gapTo = outer[i].from;
+    for (; j < current.length; j++) {
+      let r = current[j];
+      if (r.from >= gapTo) break;
+      if (r.to <= gapFrom) continue;
+      if (!copy) current = copy = ranges.slice();
+      if (r.from < gapFrom) {
+        copy[j] = new Range(r.from, gapFrom);
+        if (r.to > gapTo) copy.splice(j + 1, 0, new Range(gapTo, r.to));
+      } else if (r.to > gapTo) {
+        copy[j--] = new Range(gapTo, r.to);
+      } else {
+        copy.splice(j--, 1);
+      }
+    }
+  }
+  return current;
+}
+function findCoverChanges(a, b, from, to) {
+  let iA = 0,
+    iB = 0,
+    inA = false,
+    inB = false,
+    pos = -1e9;
+  let result = [];
+  for (;;) {
+    let nextA = iA == a.length ? 1e9 : inA ? a[iA].to : a[iA].from;
+    let nextB = iB == b.length ? 1e9 : inB ? b[iB].to : b[iB].from;
+    if (inA != inB) {
+      let start = Math.max(pos, from),
+        end = Math.min(nextA, nextB, to);
+      if (start < end) result.push(new Range(start, end));
+    }
+    pos = Math.min(nextA, nextB);
+    if (pos == 1e9) break;
+    if (nextA == pos) {
+      if (!inA) inA = true;else {
+        inA = false;
+        iA++;
+      }
+    }
+    if (nextB == pos) {
+      if (!inB) inB = true;else {
+        inB = false;
+        iB++;
+      }
+    }
+  }
+  return result;
+}
+// Given a number of fragments for the outer tree, and a set of ranges
+// to parse, find fragments for inner trees mounted around those
+// ranges, if any.
+function enterFragments(mounts, ranges) {
+  let result = [];
+  for (let {
+    pos,
+    mount,
+    frag
+  } of mounts) {
+    let startPos = pos + (mount.overlay ? mount.overlay[0].from : 0),
+      endPos = startPos + mount.tree.length;
+    let from = Math.max(frag.from, startPos),
+      to = Math.min(frag.to, endPos);
+    if (mount.overlay) {
+      let overlay = mount.overlay.map(r => new Range(r.from + pos, r.to + pos));
+      let changes = findCoverChanges(ranges, overlay, from, to);
+      for (let i = 0, pos = from;; i++) {
+        let last = i == changes.length,
+          end = last ? to : changes[i].from;
+        if (end > pos) result.push(new TreeFragment(pos, end, mount.tree, -startPos, frag.from >= pos || frag.openStart, frag.to <= end || frag.openEnd));
+        if (last) break;
+        pos = changes[i].to;
+      }
+    } else {
+      result.push(new TreeFragment(from, to, mount.tree, -startPos, frag.from >= startPos || frag.openStart, frag.to <= endPos || frag.openEnd));
+    }
+  }
+  return result;
+}
+
+/**
+An instance of this is passed to completion source functions.
+*/
+class CompletionContext {
+  /**
+  Create a new completion context. (Mostly useful for testing
+  completion sources—in the editor, the extension will create
+  these for you.)
+  */
+  constructor(
+  /**
+  The editor state that the completion happens in.
+  */
+  state,
+  /**
+  The position at which the completion is happening.
+  */
+  pos,
+  /**
+  Indicates whether completion was activated explicitly, or
+  implicitly by typing. The usual way to respond to this is to
+  only return completions when either there is part of a
+  completable entity before the cursor, or `explicit` is true.
+  */
+  explicit) {
+    this.state = state;
+    this.pos = pos;
+    this.explicit = explicit;
+    /**
+    @internal
+    */
+    this.abortListeners = [];
+  }
+  /**
+  Get the extent, content, and (if there is a token) type of the
+  token before `this.pos`.
+  */
+  tokenBefore(types) {
+    let token = syntaxTree(this.state).resolveInner(this.pos, -1);
+    while (token && types.indexOf(token.name) < 0) token = token.parent;
+    return token ? {
+      from: token.from,
+      to: this.pos,
+      text: this.state.sliceDoc(token.from, this.pos),
+      type: token.type
+    } : null;
+  }
+  /**
+  Get the match of the given expression directly before the
+  cursor.
+  */
+  matchBefore(expr) {
+    let line = this.state.doc.lineAt(this.pos);
+    let start = Math.max(line.from, this.pos - 250);
+    let str = line.text.slice(start - line.from, this.pos - line.from);
+    let found = str.search(ensureAnchor(expr, false));
+    return found < 0 ? null : {
+      from: start + found,
+      to: this.pos,
+      text: str.slice(found)
+    };
+  }
+  /**
+  Yields true when the query has been aborted. Can be useful in
+  asynchronous queries to avoid doing work that will be ignored.
+  */
+  get aborted() {
+    return this.abortListeners == null;
+  }
+  /**
+  Allows you to register abort handlers, which will be called when
+  the query is
+  [aborted](https://codemirror.net/6/docs/ref/#autocomplete.CompletionContext.aborted).
+  */
+  addEventListener(type, listener) {
+    if (type == "abort" && this.abortListeners) this.abortListeners.push(listener);
+  }
+}
+function toSet(chars) {
+  let flat = Object.keys(chars).join("");
+  let words = /\w/.test(flat);
+  if (words) flat = flat.replace(/\w/g, "");
+  return `[${words ? "\\w" : ""}${flat.replace(/[^\w\s]/g, "\\$&")}]`;
+}
+function prefixMatch(options) {
+  let first = Object.create(null),
+    rest = Object.create(null);
+  for (let {
+    label
+  } of options) {
+    first[label[0]] = true;
+    for (let i = 1; i < label.length; i++) rest[label[i]] = true;
+  }
+  let source = toSet(first) + toSet(rest) + "*$";
+  return [new RegExp("^" + source), new RegExp(source)];
+}
+/**
+Given a a fixed array of options, return an autocompleter that
+completes them.
+*/
+function completeFromList(list) {
+  let options = list.map(o => typeof o == "string" ? {
+    label: o
+  } : o);
+  let [validFor, match] = options.every(o => /^\w+$/.test(o.label)) ? [/\w*$/, /\w+$/] : prefixMatch(options);
+  return context => {
+    let token = context.matchBefore(match);
+    return token || context.explicit ? {
+      from: token ? token.from : context.pos,
+      options,
+      validFor
+    } : null;
+  };
+}
+/**
+Wrap the given completion source so that it will not fire when the
+cursor is in a syntax node with one of the given names.
+*/
+function ifNotIn(nodes, source) {
+  return context => {
+    for (let pos = syntaxTree(context.state).resolveInner(context.pos, -1); pos; pos = pos.parent) {
+      if (nodes.indexOf(pos.name) > -1) return null;
+      if (pos.type.isTop) break;
+    }
+    return source(context);
+  };
+}
+class Option {
+  constructor(completion, source, match, score) {
+    this.completion = completion;
+    this.source = source;
+    this.match = match;
+    this.score = score;
+  }
+}
+function cur(state) {
+  return state.selection.main.from;
+}
+// Make sure the given regexp has a $ at its end and, if `start` is
+// true, a ^ at its start.
+function ensureAnchor(expr, start) {
+  var _a;
+  let {
+    source
+  } = expr;
+  let addStart = start && source[0] != "^",
+    addEnd = source[source.length - 1] != "$";
+  if (!addStart && !addEnd) return expr;
+  return new RegExp(`${addStart ? "^" : ""}(?:${source})${addEnd ? "$" : ""}`, (_a = expr.flags) !== null && _a !== void 0 ? _a : expr.ignoreCase ? "i" : "");
+}
+/**
+This annotation is added to transactions that are produced by
+picking a completion.
+*/
+const pickedCompletion = /*@__PURE__*/Annotation.define();
+/**
+Helper function that returns a transaction spec which inserts a
+completion's text in the main selection range, and any other
+selection range that has the same text in front of it.
+*/
+function insertCompletionText(state, text, from, to) {
+  let {
+      main
+    } = state.selection,
+    fromOff = from - main.from,
+    toOff = to - main.from;
+  return Object.assign(Object.assign({}, state.changeByRange(range => {
+    if (range != main && from != to && state.sliceDoc(range.from + fromOff, range.from + toOff) != state.sliceDoc(from, to)) return {
+      range
+    };
+    return {
+      changes: {
+        from: range.from + fromOff,
+        to: to == main.from ? range.to : range.from + toOff,
+        insert: text
+      },
+      range: EditorSelection.cursor(range.from + fromOff + text.length)
+    };
+  })), {
+    scrollIntoView: true,
+    userEvent: "input.complete"
+  });
+}
+const SourceCache = /*@__PURE__*/new WeakMap();
+function asSource(source) {
+  if (!Array.isArray(source)) return source;
+  let known = SourceCache.get(source);
+  if (!known) SourceCache.set(source, known = completeFromList(source));
+  return known;
+}
+const startCompletionEffect = /*@__PURE__*/StateEffect.define();
+const closeCompletionEffect = /*@__PURE__*/StateEffect.define();
+
+// A pattern matcher for fuzzy completion matching. Create an instance
+// once for a pattern, and then use that to match any number of
+// completions.
+class FuzzyMatcher {
+  constructor(pattern) {
+    this.pattern = pattern;
+    this.chars = [];
+    this.folded = [];
+    // Buffers reused by calls to `match` to track matched character
+    // positions.
+    this.any = [];
+    this.precise = [];
+    this.byWord = [];
+    this.score = 0;
+    this.matched = [];
+    for (let p = 0; p < pattern.length;) {
+      let char = codePointAt(pattern, p),
+        size = codePointSize(char);
+      this.chars.push(char);
+      let part = pattern.slice(p, p + size),
+        upper = part.toUpperCase();
+      this.folded.push(codePointAt(upper == part ? part.toLowerCase() : upper, 0));
+      p += size;
+    }
+    this.astral = pattern.length != this.chars.length;
+  }
+  ret(score, matched) {
+    this.score = score;
+    this.matched = matched;
+    return true;
+  }
+  // Matches a given word (completion) against the pattern (input).
+  // Will return a boolean indicating whether there was a match and,
+  // on success, set `this.score` to the score, `this.matched` to an
+  // array of `from, to` pairs indicating the matched parts of `word`.
+  //
+  // The score is a number that is more negative the worse the match
+  // is. See `Penalty` above.
+  match(word) {
+    if (this.pattern.length == 0) return this.ret(-100 /* Penalty.NotFull */, []);
+    if (word.length < this.pattern.length) return false;
+    let {
+      chars,
+      folded,
+      any,
+      precise,
+      byWord
+    } = this;
+    // For single-character queries, only match when they occur right
+    // at the start
+    if (chars.length == 1) {
+      let first = codePointAt(word, 0),
+        firstSize = codePointSize(first);
+      let score = firstSize == word.length ? 0 : -100 /* Penalty.NotFull */;
+      if (first == chars[0]) ;else if (first == folded[0]) score += -200 /* Penalty.CaseFold */;else return false;
+      return this.ret(score, [0, firstSize]);
+    }
+    let direct = word.indexOf(this.pattern);
+    if (direct == 0) return this.ret(word.length == this.pattern.length ? 0 : -100 /* Penalty.NotFull */, [0, this.pattern.length]);
+    let len = chars.length,
+      anyTo = 0;
+    if (direct < 0) {
+      for (let i = 0, e = Math.min(word.length, 200); i < e && anyTo < len;) {
+        let next = codePointAt(word, i);
+        if (next == chars[anyTo] || next == folded[anyTo]) any[anyTo++] = i;
+        i += codePointSize(next);
+      }
+      // No match, exit immediately
+      if (anyTo < len) return false;
+    }
+    // This tracks the extent of the precise (non-folded, not
+    // necessarily adjacent) match
+    let preciseTo = 0;
+    // Tracks whether there is a match that hits only characters that
+    // appear to be starting words. `byWordFolded` is set to true when
+    // a case folded character is encountered in such a match
+    let byWordTo = 0,
+      byWordFolded = false;
+    // If we've found a partial adjacent match, these track its state
+    let adjacentTo = 0,
+      adjacentStart = -1,
+      adjacentEnd = -1;
+    let hasLower = /[a-z]/.test(word),
+      wordAdjacent = true;
+    // Go over the option's text, scanning for the various kinds of matches
+    for (let i = 0, e = Math.min(word.length, 200), prevType = 0 /* Tp.NonWord */; i < e && byWordTo < len;) {
+      let next = codePointAt(word, i);
+      if (direct < 0) {
+        if (preciseTo < len && next == chars[preciseTo]) precise[preciseTo++] = i;
+        if (adjacentTo < len) {
+          if (next == chars[adjacentTo] || next == folded[adjacentTo]) {
+            if (adjacentTo == 0) adjacentStart = i;
+            adjacentEnd = i + 1;
+            adjacentTo++;
+          } else {
+            adjacentTo = 0;
+          }
+        }
+      }
+      let ch,
+        type = next < 0xff ? next >= 48 && next <= 57 || next >= 97 && next <= 122 ? 2 /* Tp.Lower */ : next >= 65 && next <= 90 ? 1 /* Tp.Upper */ : 0 /* Tp.NonWord */ : (ch = fromCodePoint(next)) != ch.toLowerCase() ? 1 /* Tp.Upper */ : ch != ch.toUpperCase() ? 2 /* Tp.Lower */ : 0 /* Tp.NonWord */;
+      if (!i || type == 1 /* Tp.Upper */ && hasLower || prevType == 0 /* Tp.NonWord */ && type != 0 /* Tp.NonWord */) {
+        if (chars[byWordTo] == next || folded[byWordTo] == next && (byWordFolded = true)) byWord[byWordTo++] = i;else if (byWord.length) wordAdjacent = false;
+      }
+      prevType = type;
+      i += codePointSize(next);
+    }
+    if (byWordTo == len && byWord[0] == 0 && wordAdjacent) return this.result(-100 /* Penalty.ByWord */ + (byWordFolded ? -200 /* Penalty.CaseFold */ : 0), byWord, word);
+    if (adjacentTo == len && adjacentStart == 0) return this.ret(-200 /* Penalty.CaseFold */ - word.length + (adjacentEnd == word.length ? 0 : -100 /* Penalty.NotFull */), [0, adjacentEnd]);
+    if (direct > -1) return this.ret(-700 /* Penalty.NotStart */ - word.length, [direct, direct + this.pattern.length]);
+    if (adjacentTo == len) return this.ret(-200 /* Penalty.CaseFold */ + -700 /* Penalty.NotStart */ - word.length, [adjacentStart, adjacentEnd]);
+    if (byWordTo == len) return this.result(-100 /* Penalty.ByWord */ + (byWordFolded ? -200 /* Penalty.CaseFold */ : 0) + -700 /* Penalty.NotStart */ + (wordAdjacent ? 0 : -1100 /* Penalty.Gap */), byWord, word);
+    return chars.length == 2 ? false : this.result((any[0] ? -700 /* Penalty.NotStart */ : 0) + -200 /* Penalty.CaseFold */ + -1100 /* Penalty.Gap */, any, word);
+  }
+  result(score, positions, word) {
+    let result = [],
+      i = 0;
+    for (let pos of positions) {
+      let to = pos + (this.astral ? codePointSize(codePointAt(word, pos)) : 1);
+      if (i && result[i - 1] == pos) result[i - 1] = to;else {
+        result[i++] = pos;
+        result[i++] = to;
+      }
+    }
+    return this.ret(score - word.length, result);
+  }
+}
+const completionConfig = /*@__PURE__*/Facet.define({
+  combine(configs) {
+    return combineConfig(configs, {
+      activateOnTyping: true,
+      activateOnTypingDelay: 100,
+      selectOnOpen: true,
+      override: null,
+      closeOnBlur: true,
+      maxRenderedOptions: 100,
+      defaultKeymap: true,
+      tooltipClass: () => "",
+      optionClass: () => "",
+      aboveCursor: false,
+      icons: true,
+      addToOptions: [],
+      positionInfo: defaultPositionInfo,
+      compareCompletions: (a, b) => a.label.localeCompare(b.label),
+      interactionDelay: 75,
+      updateSyncTime: 100
+    }, {
+      defaultKeymap: (a, b) => a && b,
+      closeOnBlur: (a, b) => a && b,
+      icons: (a, b) => a && b,
+      tooltipClass: (a, b) => c => joinClass(a(c), b(c)),
+      optionClass: (a, b) => c => joinClass(a(c), b(c)),
+      addToOptions: (a, b) => a.concat(b)
+    });
+  }
+});
+function joinClass(a, b) {
+  return a ? b ? a + " " + b : a : b;
+}
+function defaultPositionInfo(view, list, option, info, space, tooltip) {
+  let rtl = view.textDirection == Direction.RTL,
+    left = rtl,
+    narrow = false;
+  let side = "top",
+    offset,
+    maxWidth;
+  let spaceLeft = list.left - space.left,
+    spaceRight = space.right - list.right;
+  let infoWidth = info.right - info.left,
+    infoHeight = info.bottom - info.top;
+  if (left && spaceLeft < Math.min(infoWidth, spaceRight)) left = false;else if (!left && spaceRight < Math.min(infoWidth, spaceLeft)) left = true;
+  if (infoWidth <= (left ? spaceLeft : spaceRight)) {
+    offset = Math.max(space.top, Math.min(option.top, space.bottom - infoHeight)) - list.top;
+    maxWidth = Math.min(400 /* Info.Width */, left ? spaceLeft : spaceRight);
+  } else {
+    narrow = true;
+    maxWidth = Math.min(400 /* Info.Width */, (rtl ? list.right : space.right - list.left) - 30 /* Info.Margin */);
+    let spaceBelow = space.bottom - list.bottom;
+    if (spaceBelow >= infoHeight || spaceBelow > list.top) {
+      // Below the completion
+      offset = option.bottom - list.top;
+    } else {
+      // Above it
+      side = "bottom";
+      offset = list.bottom - option.top;
+    }
+  }
+  let scaleY = (list.bottom - list.top) / tooltip.offsetHeight;
+  let scaleX = (list.right - list.left) / tooltip.offsetWidth;
+  return {
+    style: `${side}: ${offset / scaleY}px; max-width: ${maxWidth / scaleX}px`,
+    class: "cm-completionInfo-" + (narrow ? rtl ? "left-narrow" : "right-narrow" : left ? "left" : "right")
+  };
+}
+function optionContent(config) {
+  let content = config.addToOptions.slice();
+  if (config.icons) content.push({
+    render(completion) {
+      let icon = document.createElement("div");
+      icon.classList.add("cm-completionIcon");
+      if (completion.type) icon.classList.add(...completion.type.split(/\s+/g).map(cls => "cm-completionIcon-" + cls));
+      icon.setAttribute("aria-hidden", "true");
+      return icon;
+    },
+    position: 20
+  });
+  content.push({
+    render(completion, _s, _v, match) {
+      let labelElt = document.createElement("span");
+      labelElt.className = "cm-completionLabel";
+      let label = completion.displayLabel || completion.label,
+        off = 0;
+      for (let j = 0; j < match.length;) {
+        let from = match[j++],
+          to = match[j++];
+        if (from > off) labelElt.appendChild(document.createTextNode(label.slice(off, from)));
+        let span = labelElt.appendChild(document.createElement("span"));
+        span.appendChild(document.createTextNode(label.slice(from, to)));
+        span.className = "cm-completionMatchedText";
+        off = to;
+      }
+      if (off < label.length) labelElt.appendChild(document.createTextNode(label.slice(off)));
+      return labelElt;
+    },
+    position: 50
+  }, {
+    render(completion) {
+      if (!completion.detail) return null;
+      let detailElt = document.createElement("span");
+      detailElt.className = "cm-completionDetail";
+      detailElt.textContent = completion.detail;
+      return detailElt;
+    },
+    position: 80
+  });
+  return content.sort((a, b) => a.position - b.position).map(a => a.render);
+}
+function rangeAroundSelected(total, selected, max) {
+  if (total <= max) return {
+    from: 0,
+    to: total
+  };
+  if (selected < 0) selected = 0;
+  if (selected <= total >> 1) {
+    let off = Math.floor(selected / max);
+    return {
+      from: off * max,
+      to: (off + 1) * max
+    };
+  }
+  let off = Math.floor((total - selected) / max);
+  return {
+    from: total - (off + 1) * max,
+    to: total - off * max
+  };
+}
+class CompletionTooltip {
+  constructor(view, stateField, applyCompletion) {
+    this.view = view;
+    this.stateField = stateField;
+    this.applyCompletion = applyCompletion;
+    this.info = null;
+    this.infoDestroy = null;
+    this.placeInfoReq = {
+      read: () => this.measureInfo(),
+      write: pos => this.placeInfo(pos),
+      key: this
+    };
+    this.space = null;
+    this.currentClass = "";
+    let cState = view.state.field(stateField);
+    let {
+      options,
+      selected
+    } = cState.open;
+    let config = view.state.facet(completionConfig);
+    this.optionContent = optionContent(config);
+    this.optionClass = config.optionClass;
+    this.tooltipClass = config.tooltipClass;
+    this.range = rangeAroundSelected(options.length, selected, config.maxRenderedOptions);
+    this.dom = document.createElement("div");
+    this.dom.className = "cm-tooltip-autocomplete";
+    this.updateTooltipClass(view.state);
+    this.dom.addEventListener("mousedown", e => {
+      let {
+        options
+      } = view.state.field(stateField).open;
+      for (let dom = e.target, match; dom && dom != this.dom; dom = dom.parentNode) {
+        if (dom.nodeName == "LI" && (match = /-(\d+)$/.exec(dom.id)) && +match[1] < options.length) {
+          this.applyCompletion(view, options[+match[1]]);
+          e.preventDefault();
+          return;
+        }
+      }
+    });
+    this.dom.addEventListener("focusout", e => {
+      let state = view.state.field(this.stateField, false);
+      if (state && state.tooltip && view.state.facet(completionConfig).closeOnBlur && e.relatedTarget != view.contentDOM) view.dispatch({
+        effects: closeCompletionEffect.of(null)
+      });
+    });
+    this.showOptions(options, cState.id);
+  }
+  mount() {
+    this.updateSel();
+  }
+  showOptions(options, id) {
+    if (this.list) this.list.remove();
+    this.list = this.dom.appendChild(this.createListBox(options, id, this.range));
+    this.list.addEventListener("scroll", () => {
+      if (this.info) this.view.requestMeasure(this.placeInfoReq);
+    });
+  }
+  update(update) {
+    var _a;
+    let cState = update.state.field(this.stateField);
+    let prevState = update.startState.field(this.stateField);
+    this.updateTooltipClass(update.state);
+    if (cState != prevState) {
+      let {
+        options,
+        selected,
+        disabled
+      } = cState.open;
+      if (!prevState.open || prevState.open.options != options) {
+        this.range = rangeAroundSelected(options.length, selected, update.state.facet(completionConfig).maxRenderedOptions);
+        this.showOptions(options, cState.id);
+      }
+      this.updateSel();
+      if (disabled != ((_a = prevState.open) === null || _a === void 0 ? void 0 : _a.disabled)) this.dom.classList.toggle("cm-tooltip-autocomplete-disabled", !!disabled);
+    }
+  }
+  updateTooltipClass(state) {
+    let cls = this.tooltipClass(state);
+    if (cls != this.currentClass) {
+      for (let c of this.currentClass.split(" ")) if (c) this.dom.classList.remove(c);
+      for (let c of cls.split(" ")) if (c) this.dom.classList.add(c);
+      this.currentClass = cls;
+    }
+  }
+  positioned(space) {
+    this.space = space;
+    if (this.info) this.view.requestMeasure(this.placeInfoReq);
+  }
+  updateSel() {
+    let cState = this.view.state.field(this.stateField),
+      open = cState.open;
+    if (open.selected > -1 && open.selected < this.range.from || open.selected >= this.range.to) {
+      this.range = rangeAroundSelected(open.options.length, open.selected, this.view.state.facet(completionConfig).maxRenderedOptions);
+      this.showOptions(open.options, cState.id);
+    }
+    if (this.updateSelectedOption(open.selected)) {
+      this.destroyInfo();
+      let {
+        completion
+      } = open.options[open.selected];
+      let {
+        info
+      } = completion;
+      if (!info) return;
+      let infoResult = typeof info === "string" ? document.createTextNode(info) : info(completion);
+      if (!infoResult) return;
+      if ("then" in infoResult) {
+        infoResult.then(obj => {
+          if (obj && this.view.state.field(this.stateField, false) == cState) this.addInfoPane(obj, completion);
+        }).catch(e => logException(this.view.state, e, "completion info"));
+      } else {
+        this.addInfoPane(infoResult, completion);
+      }
+    }
+  }
+  addInfoPane(content, completion) {
+    this.destroyInfo();
+    let wrap = this.info = document.createElement("div");
+    wrap.className = "cm-tooltip cm-completionInfo";
+    if (content.nodeType != null) {
+      wrap.appendChild(content);
+      this.infoDestroy = null;
+    } else {
+      let {
+        dom,
+        destroy
+      } = content;
+      wrap.appendChild(dom);
+      this.infoDestroy = destroy || null;
+    }
+    this.dom.appendChild(wrap);
+    this.view.requestMeasure(this.placeInfoReq);
+  }
+  updateSelectedOption(selected) {
+    let set = null;
+    for (let opt = this.list.firstChild, i = this.range.from; opt; opt = opt.nextSibling, i++) {
+      if (opt.nodeName != "LI" || !opt.id) {
+        i--; // A section header
+      } else if (i == selected) {
+        if (!opt.hasAttribute("aria-selected")) {
+          opt.setAttribute("aria-selected", "true");
+          set = opt;
+        }
+      } else {
+        if (opt.hasAttribute("aria-selected")) opt.removeAttribute("aria-selected");
+      }
+    }
+    if (set) scrollIntoView(this.list, set);
+    return set;
+  }
+  measureInfo() {
+    let sel = this.dom.querySelector("[aria-selected]");
+    if (!sel || !this.info) return null;
+    let listRect = this.dom.getBoundingClientRect();
+    let infoRect = this.info.getBoundingClientRect();
+    let selRect = sel.getBoundingClientRect();
+    let space = this.space;
+    if (!space) {
+      let win = this.dom.ownerDocument.defaultView || window;
+      space = {
+        left: 0,
+        top: 0,
+        right: win.innerWidth,
+        bottom: win.innerHeight
+      };
+    }
+    if (selRect.top > Math.min(space.bottom, listRect.bottom) - 10 || selRect.bottom < Math.max(space.top, listRect.top) + 10) return null;
+    return this.view.state.facet(completionConfig).positionInfo(this.view, listRect, selRect, infoRect, space, this.dom);
+  }
+  placeInfo(pos) {
+    if (this.info) {
+      if (pos) {
+        if (pos.style) this.info.style.cssText = pos.style;
+        this.info.className = "cm-tooltip cm-completionInfo " + (pos.class || "");
+      } else {
+        this.info.style.cssText = "top: -1e6px";
+      }
+    }
+  }
+  createListBox(options, id, range) {
+    const ul = document.createElement("ul");
+    ul.id = id;
+    ul.setAttribute("role", "listbox");
+    ul.setAttribute("aria-expanded", "true");
+    ul.setAttribute("aria-label", this.view.state.phrase("Completions"));
+    let curSection = null;
+    for (let i = range.from; i < range.to; i++) {
+      let {
+          completion,
+          match
+        } = options[i],
+        {
+          section
+        } = completion;
+      if (section) {
+        let name = typeof section == "string" ? section : section.name;
+        if (name != curSection && (i > range.from || range.from == 0)) {
+          curSection = name;
+          if (typeof section != "string" && section.header) {
+            ul.appendChild(section.header(section));
+          } else {
+            let header = ul.appendChild(document.createElement("completion-section"));
+            header.textContent = name;
+          }
+        }
+      }
+      const li = ul.appendChild(document.createElement("li"));
+      li.id = id + "-" + i;
+      li.setAttribute("role", "option");
+      let cls = this.optionClass(completion);
+      if (cls) li.className = cls;
+      for (let source of this.optionContent) {
+        let node = source(completion, this.view.state, this.view, match);
+        if (node) li.appendChild(node);
+      }
+    }
+    if (range.from) ul.classList.add("cm-completionListIncompleteTop");
+    if (range.to < options.length) ul.classList.add("cm-completionListIncompleteBottom");
+    return ul;
+  }
+  destroyInfo() {
+    if (this.info) {
+      if (this.infoDestroy) this.infoDestroy();
+      this.info.remove();
+      this.info = null;
+    }
+  }
+  destroy() {
+    this.destroyInfo();
+  }
+}
+function completionTooltip(stateField, applyCompletion) {
+  return view => new CompletionTooltip(view, stateField, applyCompletion);
+}
+function scrollIntoView(container, element) {
+  let parent = container.getBoundingClientRect();
+  let self = element.getBoundingClientRect();
+  let scaleY = parent.height / container.offsetHeight;
+  if (self.top < parent.top) container.scrollTop -= (parent.top - self.top) / scaleY;else if (self.bottom > parent.bottom) container.scrollTop += (self.bottom - parent.bottom) / scaleY;
+}
+
+// Used to pick a preferred option when two options with the same
+// label occur in the result.
+function score(option) {
+  return (option.boost || 0) * 100 + (option.apply ? 10 : 0) + (option.info ? 5 : 0) + (option.type ? 1 : 0);
+}
+function sortOptions(active, state) {
+  let options = [];
+  let sections = null;
+  let addOption = option => {
+    options.push(option);
+    let {
+      section
+    } = option.completion;
+    if (section) {
+      if (!sections) sections = [];
+      let name = typeof section == "string" ? section : section.name;
+      if (!sections.some(s => s.name == name)) sections.push(typeof section == "string" ? {
+        name
+      } : section);
+    }
+  };
+  for (let a of active) if (a.hasResult()) {
+    let getMatch = a.result.getMatch;
+    if (a.result.filter === false) {
+      for (let option of a.result.options) {
+        addOption(new Option(option, a.source, getMatch ? getMatch(option) : [], 1e9 - options.length));
+      }
+    } else {
+      let matcher = new FuzzyMatcher(state.sliceDoc(a.from, a.to));
+      for (let option of a.result.options) if (matcher.match(option.label)) {
+        let matched = !option.displayLabel ? matcher.matched : getMatch ? getMatch(option, matcher.matched) : [];
+        addOption(new Option(option, a.source, matched, matcher.score + (option.boost || 0)));
+      }
+    }
+  }
+  if (sections) {
+    let sectionOrder = Object.create(null),
+      pos = 0;
+    let cmp = (a, b) => {
+      var _a, _b;
+      return ((_a = a.rank) !== null && _a !== void 0 ? _a : 1e9) - ((_b = b.rank) !== null && _b !== void 0 ? _b : 1e9) || (a.name < b.name ? -1 : 1);
+    };
+    for (let s of sections.sort(cmp)) {
+      pos -= 1e5;
+      sectionOrder[s.name] = pos;
+    }
+    for (let option of options) {
+      let {
+        section
+      } = option.completion;
+      if (section) option.score += sectionOrder[typeof section == "string" ? section : section.name];
+    }
+  }
+  let result = [],
+    prev = null;
+  let compare = state.facet(completionConfig).compareCompletions;
+  for (let opt of options.sort((a, b) => b.score - a.score || compare(a.completion, b.completion))) {
+    let cur = opt.completion;
+    if (!prev || prev.label != cur.label || prev.detail != cur.detail || prev.type != null && cur.type != null && prev.type != cur.type || prev.apply != cur.apply || prev.boost != cur.boost) result.push(opt);else if (score(opt.completion) > score(prev)) result[result.length - 1] = opt;
+    prev = opt.completion;
+  }
+  return result;
+}
+class CompletionDialog {
+  constructor(options, attrs, tooltip, timestamp, selected, disabled) {
+    this.options = options;
+    this.attrs = attrs;
+    this.tooltip = tooltip;
+    this.timestamp = timestamp;
+    this.selected = selected;
+    this.disabled = disabled;
+  }
+  setSelected(selected, id) {
+    return selected == this.selected || selected >= this.options.length ? this : new CompletionDialog(this.options, makeAttrs(id, selected), this.tooltip, this.timestamp, selected, this.disabled);
+  }
+  static build(active, state, id, prev, conf) {
+    let options = sortOptions(active, state);
+    if (!options.length) {
+      return prev && active.some(a => a.state == 1 /* State.Pending */) ? new CompletionDialog(prev.options, prev.attrs, prev.tooltip, prev.timestamp, prev.selected, true) : null;
+    }
+    let selected = state.facet(completionConfig).selectOnOpen ? 0 : -1;
+    if (prev && prev.selected != selected && prev.selected != -1) {
+      let selectedValue = prev.options[prev.selected].completion;
+      for (let i = 0; i < options.length; i++) if (options[i].completion == selectedValue) {
+        selected = i;
+        break;
+      }
+    }
+    return new CompletionDialog(options, makeAttrs(id, selected), {
+      pos: active.reduce((a, b) => b.hasResult() ? Math.min(a, b.from) : a, 1e8),
+      create: createTooltip,
+      above: conf.aboveCursor
+    }, prev ? prev.timestamp : Date.now(), selected, false);
+  }
+  map(changes) {
+    return new CompletionDialog(this.options, this.attrs, Object.assign(Object.assign({}, this.tooltip), {
+      pos: changes.mapPos(this.tooltip.pos)
+    }), this.timestamp, this.selected, this.disabled);
+  }
+}
+class CompletionState {
+  constructor(active, id, open) {
+    this.active = active;
+    this.id = id;
+    this.open = open;
+  }
+  static start() {
+    return new CompletionState(none, "cm-ac-" + Math.floor(Math.random() * 2e6).toString(36), null);
+  }
+  update(tr) {
+    let {
+        state
+      } = tr,
+      conf = state.facet(completionConfig);
+    let sources = conf.override || state.languageDataAt("autocomplete", cur(state)).map(asSource);
+    let active = sources.map(source => {
+      let value = this.active.find(s => s.source == source) || new ActiveSource(source, this.active.some(a => a.state != 0 /* State.Inactive */) ? 1 /* State.Pending */ : 0 /* State.Inactive */);
+      return value.update(tr, conf);
+    });
+    if (active.length == this.active.length && active.every((a, i) => a == this.active[i])) active = this.active;
+    let open = this.open;
+    if (open && tr.docChanged) open = open.map(tr.changes);
+    if (tr.selection || active.some(a => a.hasResult() && tr.changes.touchesRange(a.from, a.to)) || !sameResults(active, this.active)) open = CompletionDialog.build(active, state, this.id, open, conf);else if (open && open.disabled && !active.some(a => a.state == 1 /* State.Pending */)) open = null;
+    if (!open && active.every(a => a.state != 1 /* State.Pending */) && active.some(a => a.hasResult())) active = active.map(a => a.hasResult() ? new ActiveSource(a.source, 0 /* State.Inactive */) : a);
+    for (let effect of tr.effects) if (effect.is(setSelectedEffect)) open = open && open.setSelected(effect.value, this.id);
+    return active == this.active && open == this.open ? this : new CompletionState(active, this.id, open);
+  }
+  get tooltip() {
+    return this.open ? this.open.tooltip : null;
+  }
+  get attrs() {
+    return this.open ? this.open.attrs : baseAttrs;
+  }
+}
+function sameResults(a, b) {
+  if (a == b) return true;
+  for (let iA = 0, iB = 0;;) {
+    while (iA < a.length && !a[iA].hasResult) iA++;
+    while (iB < b.length && !b[iB].hasResult) iB++;
+    let endA = iA == a.length,
+      endB = iB == b.length;
+    if (endA || endB) return endA == endB;
+    if (a[iA++].result != b[iB++].result) return false;
+  }
+}
+const baseAttrs = {
+  "aria-autocomplete": "list"
+};
+function makeAttrs(id, selected) {
+  let result = {
+    "aria-autocomplete": "list",
+    "aria-haspopup": "listbox",
+    "aria-controls": id
+  };
+  if (selected > -1) result["aria-activedescendant"] = id + "-" + selected;
+  return result;
+}
+const none = [];
+function getUserEvent(tr) {
+  return tr.isUserEvent("input.type") ? "input" : tr.isUserEvent("delete.backward") ? "delete" : null;
+}
+class ActiveSource {
+  constructor(source, state, explicitPos = -1) {
+    this.source = source;
+    this.state = state;
+    this.explicitPos = explicitPos;
+  }
+  hasResult() {
+    return false;
+  }
+  update(tr, conf) {
+    let event = getUserEvent(tr),
+      value = this;
+    if (event) value = value.handleUserEvent(tr, event, conf);else if (tr.docChanged) value = value.handleChange(tr);else if (tr.selection && value.state != 0 /* State.Inactive */) value = new ActiveSource(value.source, 0 /* State.Inactive */);
+    for (let effect of tr.effects) {
+      if (effect.is(startCompletionEffect)) value = new ActiveSource(value.source, 1 /* State.Pending */, effect.value ? cur(tr.state) : -1);else if (effect.is(closeCompletionEffect)) value = new ActiveSource(value.source, 0 /* State.Inactive */);else if (effect.is(setActiveEffect)) for (let active of effect.value) if (active.source == value.source) value = active;
+    }
+    return value;
+  }
+  handleUserEvent(tr, type, conf) {
+    return type == "delete" || !conf.activateOnTyping ? this.map(tr.changes) : new ActiveSource(this.source, 1 /* State.Pending */);
+  }
+  handleChange(tr) {
+    return tr.changes.touchesRange(cur(tr.startState)) ? new ActiveSource(this.source, 0 /* State.Inactive */) : this.map(tr.changes);
+  }
+  map(changes) {
+    return changes.empty || this.explicitPos < 0 ? this : new ActiveSource(this.source, this.state, changes.mapPos(this.explicitPos));
+  }
+}
+class ActiveResult extends ActiveSource {
+  constructor(source, explicitPos, result, from, to) {
+    super(source, 2 /* State.Result */, explicitPos);
+    this.result = result;
+    this.from = from;
+    this.to = to;
+  }
+  hasResult() {
+    return true;
+  }
+  handleUserEvent(tr, type, conf) {
+    var _a;
+    let from = tr.changes.mapPos(this.from),
+      to = tr.changes.mapPos(this.to, 1);
+    let pos = cur(tr.state);
+    if ((this.explicitPos < 0 ? pos <= from : pos < this.from) || pos > to || type == "delete" && cur(tr.startState) == this.from) return new ActiveSource(this.source, type == "input" && conf.activateOnTyping ? 1 /* State.Pending */ : 0 /* State.Inactive */);
+    let explicitPos = this.explicitPos < 0 ? -1 : tr.changes.mapPos(this.explicitPos),
+      updated;
+    if (checkValid(this.result.validFor, tr.state, from, to)) return new ActiveResult(this.source, explicitPos, this.result, from, to);
+    if (this.result.update && (updated = this.result.update(this.result, from, to, new CompletionContext(tr.state, pos, explicitPos >= 0)))) return new ActiveResult(this.source, explicitPos, updated, updated.from, (_a = updated.to) !== null && _a !== void 0 ? _a : cur(tr.state));
+    return new ActiveSource(this.source, 1 /* State.Pending */, explicitPos);
+  }
+  handleChange(tr) {
+    return tr.changes.touchesRange(this.from, this.to) ? new ActiveSource(this.source, 0 /* State.Inactive */) : this.map(tr.changes);
+  }
+  map(mapping) {
+    return mapping.empty ? this : new ActiveResult(this.source, this.explicitPos < 0 ? -1 : mapping.mapPos(this.explicitPos), this.result, mapping.mapPos(this.from), mapping.mapPos(this.to, 1));
+  }
+}
+function checkValid(validFor, state, from, to) {
+  if (!validFor) return false;
+  let text = state.sliceDoc(from, to);
+  return typeof validFor == "function" ? validFor(text, from, to, state) : ensureAnchor(validFor, true).test(text);
+}
+const setActiveEffect = /*@__PURE__*/StateEffect.define({
+  map(sources, mapping) {
+    return sources.map(s => s.map(mapping));
+  }
+});
+const setSelectedEffect = /*@__PURE__*/StateEffect.define();
+const completionState = /*@__PURE__*/StateField.define({
+  create() {
+    return CompletionState.start();
+  },
+  update(value, tr) {
+    return value.update(tr);
+  },
+  provide: f => [showTooltip.from(f, val => val.tooltip), EditorView.contentAttributes.from(f, state => state.attrs)]
+});
+function applyCompletion(view, option) {
+  const apply = option.completion.apply || option.completion.label;
+  let result = view.state.field(completionState).active.find(a => a.source == option.source);
+  if (!(result instanceof ActiveResult)) return false;
+  if (typeof apply == "string") view.dispatch(Object.assign(Object.assign({}, insertCompletionText(view.state, apply, result.from, result.to)), {
+    annotations: pickedCompletion.of(option.completion)
+  }));else apply(view, option.completion, result.from, result.to);
+  return true;
+}
+const createTooltip = /*@__PURE__*/completionTooltip(completionState, applyCompletion);
+
+/**
+Returns a command that moves the completion selection forward or
+backward by the given amount.
+*/
+function moveCompletionSelection(forward, by = "option") {
+  return view => {
+    let cState = view.state.field(completionState, false);
+    if (!cState || !cState.open || cState.open.disabled || Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay) return false;
+    let step = 1,
+      tooltip;
+    if (by == "page" && (tooltip = getTooltip(view, cState.open.tooltip))) step = Math.max(2, Math.floor(tooltip.dom.offsetHeight / tooltip.dom.querySelector("li").offsetHeight) - 1);
+    let {
+      length
+    } = cState.open.options;
+    let selected = cState.open.selected > -1 ? cState.open.selected + step * (forward ? 1 : -1) : forward ? 0 : length - 1;
+    if (selected < 0) selected = by == "page" ? 0 : length - 1;else if (selected >= length) selected = by == "page" ? length - 1 : 0;
+    view.dispatch({
+      effects: setSelectedEffect.of(selected)
+    });
+    return true;
+  };
+}
+/**
+Accept the current completion.
+*/
+const acceptCompletion = view => {
+  let cState = view.state.field(completionState, false);
+  if (view.state.readOnly || !cState || !cState.open || cState.open.selected < 0 || cState.open.disabled || Date.now() - cState.open.timestamp < view.state.facet(completionConfig).interactionDelay) return false;
+  return applyCompletion(view, cState.open.options[cState.open.selected]);
+};
+/**
+Explicitly start autocompletion.
+*/
+const startCompletion = view => {
+  let cState = view.state.field(completionState, false);
+  if (!cState) return false;
+  view.dispatch({
+    effects: startCompletionEffect.of(true)
+  });
+  return true;
+};
+/**
+Close the currently active completion.
+*/
+const closeCompletion = view => {
+  let cState = view.state.field(completionState, false);
+  if (!cState || !cState.active.some(a => a.state != 0 /* State.Inactive */)) return false;
+  view.dispatch({
+    effects: closeCompletionEffect.of(null)
+  });
+  return true;
+};
+class RunningQuery {
+  constructor(active, context) {
+    this.active = active;
+    this.context = context;
+    this.time = Date.now();
+    this.updates = [];
+    // Note that 'undefined' means 'not done yet', whereas 'null' means
+    // 'query returned null'.
+    this.done = undefined;
+  }
+}
+const MaxUpdateCount = 50,
+  MinAbortTime = 1000;
+const completionPlugin = /*@__PURE__*/ViewPlugin.fromClass(class {
+  constructor(view) {
+    this.view = view;
+    this.debounceUpdate = -1;
+    this.running = [];
+    this.debounceAccept = -1;
+    this.pendingStart = false;
+    this.composing = 0 /* CompositionState.None */;
+    for (let active of view.state.field(completionState).active) if (active.state == 1 /* State.Pending */) this.startQuery(active);
+  }
+  update(update) {
+    let cState = update.state.field(completionState);
+    if (!update.selectionSet && !update.docChanged && update.startState.field(completionState) == cState) return;
+    let doesReset = update.transactions.some(tr => {
+      return (tr.selection || tr.docChanged) && !getUserEvent(tr);
+    });
+    for (let i = 0; i < this.running.length; i++) {
+      let query = this.running[i];
+      if (doesReset || query.updates.length + update.transactions.length > MaxUpdateCount && Date.now() - query.time > MinAbortTime) {
+        for (let handler of query.context.abortListeners) {
+          try {
+            handler();
+          } catch (e) {
+            logException(this.view.state, e);
+          }
+        }
+        query.context.abortListeners = null;
+        this.running.splice(i--, 1);
+      } else {
+        query.updates.push(...update.transactions);
+      }
+    }
+    if (this.debounceUpdate > -1) clearTimeout(this.debounceUpdate);
+    if (update.transactions.some(tr => tr.effects.some(e => e.is(startCompletionEffect)))) this.pendingStart = true;
+    let delay = this.pendingStart ? 50 : update.state.facet(completionConfig).activateOnTypingDelay;
+    this.debounceUpdate = cState.active.some(a => a.state == 1 /* State.Pending */ && !this.running.some(q => q.active.source == a.source)) ? setTimeout(() => this.startUpdate(), delay) : -1;
+    if (this.composing != 0 /* CompositionState.None */) for (let tr of update.transactions) {
+      if (getUserEvent(tr) == "input") this.composing = 2 /* CompositionState.Changed */;else if (this.composing == 2 /* CompositionState.Changed */ && tr.selection) this.composing = 3 /* CompositionState.ChangedAndMoved */;
+    }
+  }
+  startUpdate() {
+    this.debounceUpdate = -1;
+    this.pendingStart = false;
+    let {
+        state
+      } = this.view,
+      cState = state.field(completionState);
+    for (let active of cState.active) {
+      if (active.state == 1 /* State.Pending */ && !this.running.some(r => r.active.source == active.source)) this.startQuery(active);
+    }
+  }
+  startQuery(active) {
+    let {
+        state
+      } = this.view,
+      pos = cur(state);
+    let context = new CompletionContext(state, pos, active.explicitPos == pos);
+    let pending = new RunningQuery(active, context);
+    this.running.push(pending);
+    Promise.resolve(active.source(context)).then(result => {
+      if (!pending.context.aborted) {
+        pending.done = result || null;
+        this.scheduleAccept();
+      }
+    }, err => {
+      this.view.dispatch({
+        effects: closeCompletionEffect.of(null)
+      });
+      logException(this.view.state, err);
+    });
+  }
+  scheduleAccept() {
+    if (this.running.every(q => q.done !== undefined)) this.accept();else if (this.debounceAccept < 0) this.debounceAccept = setTimeout(() => this.accept(), this.view.state.facet(completionConfig).updateSyncTime);
+  }
+  // For each finished query in this.running, try to create a result
+  // or, if appropriate, restart the query.
+  accept() {
+    var _a;
+    if (this.debounceAccept > -1) clearTimeout(this.debounceAccept);
+    this.debounceAccept = -1;
+    let updated = [];
+    let conf = this.view.state.facet(completionConfig);
+    for (let i = 0; i < this.running.length; i++) {
+      let query = this.running[i];
+      if (query.done === undefined) continue;
+      this.running.splice(i--, 1);
+      if (query.done) {
+        let active = new ActiveResult(query.active.source, query.active.explicitPos, query.done, query.done.from, (_a = query.done.to) !== null && _a !== void 0 ? _a : cur(query.updates.length ? query.updates[0].startState : this.view.state));
+        // Replay the transactions that happened since the start of
+        // the request and see if that preserves the result
+        for (let tr of query.updates) active = active.update(tr, conf);
+        if (active.hasResult()) {
+          updated.push(active);
+          continue;
+        }
+      }
+      let current = this.view.state.field(completionState).active.find(a => a.source == query.active.source);
+      if (current && current.state == 1 /* State.Pending */) {
+        if (query.done == null) {
+          // Explicitly failed. Should clear the pending status if it
+          // hasn't been re-set in the meantime.
+          let active = new ActiveSource(query.active.source, 0 /* State.Inactive */);
+          for (let tr of query.updates) active = active.update(tr, conf);
+          if (active.state != 1 /* State.Pending */) updated.push(active);
+        } else {
+          // Cleared by subsequent transactions. Restart.
+          this.startQuery(current);
+        }
+      }
+    }
+    if (updated.length) this.view.dispatch({
+      effects: setActiveEffect.of(updated)
+    });
+  }
+}, {
+  eventHandlers: {
+    blur(event) {
+      let state = this.view.state.field(completionState, false);
+      if (state && state.tooltip && this.view.state.facet(completionConfig).closeOnBlur) {
+        let dialog = state.open && getTooltip(this.view, state.open.tooltip);
+        if (!dialog || !dialog.dom.contains(event.relatedTarget)) setTimeout(() => this.view.dispatch({
+          effects: closeCompletionEffect.of(null)
+        }), 10);
+      }
+    },
+    compositionstart() {
+      this.composing = 1 /* CompositionState.Started */;
+    },
+    compositionend() {
+      if (this.composing == 3 /* CompositionState.ChangedAndMoved */) {
+        // Safari fires compositionend events synchronously, possibly
+        // from inside an update, so dispatch asynchronously to avoid reentrancy
+        setTimeout(() => this.view.dispatch({
+          effects: startCompletionEffect.of(false)
+        }), 20);
+      }
+      this.composing = 0 /* CompositionState.None */;
+    }
+  }
+});
+const baseTheme = /*@__PURE__*/EditorView.baseTheme({
+  ".cm-tooltip.cm-tooltip-autocomplete": {
+    "& > ul": {
+      fontFamily: "monospace",
+      whiteSpace: "nowrap",
+      overflow: "hidden auto",
+      maxWidth_fallback: "700px",
+      maxWidth: "min(700px, 95vw)",
+      minWidth: "250px",
+      maxHeight: "10em",
+      height: "100%",
+      listStyle: "none",
+      margin: 0,
+      padding: 0,
+      "& > li, & > completion-section": {
+        padding: "1px 3px",
+        lineHeight: 1.2
+      },
+      "& > li": {
+        overflowX: "hidden",
+        textOverflow: "ellipsis",
+        cursor: "pointer"
+      },
+      "& > completion-section": {
+        display: "list-item",
+        borderBottom: "1px solid silver",
+        paddingLeft: "0.5em",
+        opacity: 0.7
+      }
+    }
+  },
+  "&light .cm-tooltip-autocomplete ul li[aria-selected]": {
+    background: "#17c",
+    color: "white"
+  },
+  "&light .cm-tooltip-autocomplete-disabled ul li[aria-selected]": {
+    background: "#777"
+  },
+  "&dark .cm-tooltip-autocomplete ul li[aria-selected]": {
+    background: "#347",
+    color: "white"
+  },
+  "&dark .cm-tooltip-autocomplete-disabled ul li[aria-selected]": {
+    background: "#444"
+  },
+  ".cm-completionListIncompleteTop:before, .cm-completionListIncompleteBottom:after": {
+    content: '"···"',
+    opacity: 0.5,
+    display: "block",
+    textAlign: "center"
+  },
+  ".cm-tooltip.cm-completionInfo": {
+    position: "absolute",
+    padding: "3px 9px",
+    width: "max-content",
+    maxWidth: `${400 /* Info.Width */}px`,
+    boxSizing: "border-box"
+  },
+  ".cm-completionInfo.cm-completionInfo-left": {
+    right: "100%"
+  },
+  ".cm-completionInfo.cm-completionInfo-right": {
+    left: "100%"
+  },
+  ".cm-completionInfo.cm-completionInfo-left-narrow": {
+    right: `${30 /* Info.Margin */}px`
+  },
+  ".cm-completionInfo.cm-completionInfo-right-narrow": {
+    left: `${30 /* Info.Margin */}px`
+  },
+  "&light .cm-snippetField": {
+    backgroundColor: "#00000022"
+  },
+  "&dark .cm-snippetField": {
+    backgroundColor: "#ffffff22"
+  },
+  ".cm-snippetFieldPosition": {
+    verticalAlign: "text-top",
+    width: 0,
+    height: "1.15em",
+    display: "inline-block",
+    margin: "0 -0.7px -.7em",
+    borderLeft: "1.4px dotted #888"
+  },
+  ".cm-completionMatchedText": {
+    textDecoration: "underline"
+  },
+  ".cm-completionDetail": {
+    marginLeft: "0.5em",
+    fontStyle: "italic"
+  },
+  ".cm-completionIcon": {
+    fontSize: "90%",
+    width: ".8em",
+    display: "inline-block",
+    textAlign: "center",
+    paddingRight: ".6em",
+    opacity: "0.6",
+    boxSizing: "content-box"
+  },
+  ".cm-completionIcon-function, .cm-completionIcon-method": {
+    "&:after": {
+      content: "'ƒ'"
+    }
+  },
+  ".cm-completionIcon-class": {
+    "&:after": {
+      content: "'○'"
+    }
+  },
+  ".cm-completionIcon-interface": {
+    "&:after": {
+      content: "'◌'"
+    }
+  },
+  ".cm-completionIcon-variable": {
+    "&:after": {
+      content: "'𝑥'"
+    }
+  },
+  ".cm-completionIcon-constant": {
+    "&:after": {
+      content: "'𝐶'"
+    }
+  },
+  ".cm-completionIcon-type": {
+    "&:after": {
+      content: "'𝑡'"
+    }
+  },
+  ".cm-completionIcon-enum": {
+    "&:after": {
+      content: "'∪'"
+    }
+  },
+  ".cm-completionIcon-property": {
+    "&:after": {
+      content: "'□'"
+    }
+  },
+  ".cm-completionIcon-keyword": {
+    "&:after": {
+      content: "'🔑\uFE0E'"
+    } // Disable emoji rendering
+  },
+  ".cm-completionIcon-namespace": {
+    "&:after": {
+      content: "'▢'"
+    }
+  },
+  ".cm-completionIcon-text": {
+    "&:after": {
+      content: "'abc'",
+      fontSize: "50%",
+      verticalAlign: "middle"
+    }
+  }
+});
+class FieldPos {
+  constructor(field, line, from, to) {
+    this.field = field;
+    this.line = line;
+    this.from = from;
+    this.to = to;
+  }
+}
+class FieldRange {
+  constructor(field, from, to) {
+    this.field = field;
+    this.from = from;
+    this.to = to;
+  }
+  map(changes) {
+    let from = changes.mapPos(this.from, -1, MapMode.TrackDel);
+    let to = changes.mapPos(this.to, 1, MapMode.TrackDel);
+    return from == null || to == null ? null : new FieldRange(this.field, from, to);
+  }
+}
+class Snippet {
+  constructor(lines, fieldPositions) {
+    this.lines = lines;
+    this.fieldPositions = fieldPositions;
+  }
+  instantiate(state, pos) {
+    let text = [],
+      lineStart = [pos];
+    let lineObj = state.doc.lineAt(pos),
+      baseIndent = /^\s*/.exec(lineObj.text)[0];
+    for (let line of this.lines) {
+      if (text.length) {
+        let indent = baseIndent,
+          tabs = /^\t*/.exec(line)[0].length;
+        for (let i = 0; i < tabs; i++) indent += state.facet(indentUnit);
+        lineStart.push(pos + indent.length - tabs);
+        line = indent + line.slice(tabs);
+      }
+      text.push(line);
+      pos += line.length + 1;
+    }
+    let ranges = this.fieldPositions.map(pos => new FieldRange(pos.field, lineStart[pos.line] + pos.from, lineStart[pos.line] + pos.to));
+    return {
+      text,
+      ranges
+    };
+  }
+  static parse(template) {
+    let fields = [];
+    let lines = [],
+      positions = [],
+      m;
+    for (let line of template.split(/\r\n?|\n/)) {
+      while (m = /[#$]\{(?:(\d+)(?::([^}]*))?|([^}]*))\}/.exec(line)) {
+        let seq = m[1] ? +m[1] : null,
+          name = m[2] || m[3] || "",
+          found = -1;
+        for (let i = 0; i < fields.length; i++) {
+          if (seq != null ? fields[i].seq == seq : name ? fields[i].name == name : false) found = i;
+        }
+        if (found < 0) {
+          let i = 0;
+          while (i < fields.length && (seq == null || fields[i].seq != null && fields[i].seq < seq)) i++;
+          fields.splice(i, 0, {
+            seq,
+            name
+          });
+          found = i;
+          for (let pos of positions) if (pos.field >= found) pos.field++;
+        }
+        positions.push(new FieldPos(found, lines.length, m.index, m.index + name.length));
+        line = line.slice(0, m.index) + name + line.slice(m.index + m[0].length);
+      }
+      for (let esc; esc = /\\([{}])/.exec(line);) {
+        line = line.slice(0, esc.index) + esc[1] + line.slice(esc.index + esc[0].length);
+        for (let pos of positions) if (pos.line == lines.length && pos.from > esc.index) {
+          pos.from--;
+          pos.to--;
+        }
+      }
+      lines.push(line);
+    }
+    return new Snippet(lines, positions);
+  }
+}
+let fieldMarker = /*@__PURE__*/Decoration.widget({
+  widget: /*@__PURE__*/new class extends WidgetType {
+    toDOM() {
+      let span = document.createElement("span");
+      span.className = "cm-snippetFieldPosition";
+      return span;
+    }
+    ignoreEvent() {
+      return false;
+    }
+  }()
+});
+let fieldRange = /*@__PURE__*/Decoration.mark({
+  class: "cm-snippetField"
+});
+class ActiveSnippet {
+  constructor(ranges, active) {
+    this.ranges = ranges;
+    this.active = active;
+    this.deco = Decoration.set(ranges.map(r => (r.from == r.to ? fieldMarker : fieldRange).range(r.from, r.to)));
+  }
+  map(changes) {
+    let ranges = [];
+    for (let r of this.ranges) {
+      let mapped = r.map(changes);
+      if (!mapped) return null;
+      ranges.push(mapped);
+    }
+    return new ActiveSnippet(ranges, this.active);
+  }
+  selectionInsideField(sel) {
+    return sel.ranges.every(range => this.ranges.some(r => r.field == this.active && r.from <= range.from && r.to >= range.to));
+  }
+}
+const setActive = /*@__PURE__*/StateEffect.define({
+  map(value, changes) {
+    return value && value.map(changes);
+  }
+});
+const moveToField = /*@__PURE__*/StateEffect.define();
+const snippetState = /*@__PURE__*/StateField.define({
+  create() {
+    return null;
+  },
+  update(value, tr) {
+    for (let effect of tr.effects) {
+      if (effect.is(setActive)) return effect.value;
+      if (effect.is(moveToField) && value) return new ActiveSnippet(value.ranges, effect.value);
+    }
+    if (value && tr.docChanged) value = value.map(tr.changes);
+    if (value && tr.selection && !value.selectionInsideField(tr.selection)) value = null;
+    return value;
+  },
+  provide: f => EditorView.decorations.from(f, val => val ? val.deco : Decoration.none)
+});
+function fieldSelection(ranges, field) {
+  return EditorSelection.create(ranges.filter(r => r.field == field).map(r => EditorSelection.range(r.from, r.to)));
+}
+/**
+Convert a snippet template to a function that can
+[apply](https://codemirror.net/6/docs/ref/#autocomplete.Completion.apply) it. Snippets are written
+using syntax like this:
+
+    "for (let ${index} = 0; ${index} < ${end}; ${index}++) {\n\t${}\n}"
+
+Each `${}` placeholder (you may also use `#{}`) indicates a field
+that the user can fill in. Its name, if any, will be the default
+content for the field.
+
+When the snippet is activated by calling the returned function,
+the code is inserted at the given position. Newlines in the
+template are indented by the indentation of the start line, plus
+one [indent unit](https://codemirror.net/6/docs/ref/#language.indentUnit) per tab character after
+the newline.
+
+On activation, (all instances of) the first field are selected.
+The user can move between fields with Tab and Shift-Tab as long as
+the fields are active. Moving to the last field or moving the
+cursor out of the current field deactivates the fields.
+
+The order of fields defaults to textual order, but you can add
+numbers to placeholders (`${1}` or `${1:defaultText}`) to provide
+a custom order.
+
+To include a literal `{` or `}` in your template, put a backslash
+in front of it. This will be removed and the brace will not be
+interpreted as indicating a placeholder.
+*/
+function snippet(template) {
+  let snippet = Snippet.parse(template);
+  return (editor, completion, from, to) => {
+    let {
+      text,
+      ranges
+    } = snippet.instantiate(editor.state, from);
+    let spec = {
+      changes: {
+        from,
+        to,
+        insert: Text.of(text)
+      },
+      scrollIntoView: true,
+      annotations: completion ? [pickedCompletion.of(completion), Transaction.userEvent.of("input.complete")] : undefined
+    };
+    if (ranges.length) spec.selection = fieldSelection(ranges, 0);
+    if (ranges.some(r => r.field > 0)) {
+      let active = new ActiveSnippet(ranges, 0);
+      let effects = spec.effects = [setActive.of(active)];
+      if (editor.state.field(snippetState, false) === undefined) effects.push(StateEffect.appendConfig.of([snippetState, addSnippetKeymap, snippetPointerHandler, baseTheme]));
+    }
+    editor.dispatch(editor.state.update(spec));
+  };
+}
+function moveField(dir) {
+  return ({
+    state,
+    dispatch
+  }) => {
+    let active = state.field(snippetState, false);
+    if (!active || dir < 0 && active.active == 0) return false;
+    let next = active.active + dir,
+      last = dir > 0 && !active.ranges.some(r => r.field == next + dir);
+    dispatch(state.update({
+      selection: fieldSelection(active.ranges, next),
+      effects: setActive.of(last ? null : new ActiveSnippet(active.ranges, next)),
+      scrollIntoView: true
+    }));
+    return true;
+  };
+}
+/**
+A command that clears the active snippet, if any.
+*/
+const clearSnippet = ({
+  state,
+  dispatch
+}) => {
+  let active = state.field(snippetState, false);
+  if (!active) return false;
+  dispatch(state.update({
+    effects: setActive.of(null)
+  }));
+  return true;
+};
+/**
+Move to the next snippet field, if available.
+*/
+const nextSnippetField = /*@__PURE__*/moveField(1);
+/**
+Move to the previous snippet field, if available.
+*/
+const prevSnippetField = /*@__PURE__*/moveField(-1);
+const defaultSnippetKeymap = [{
+  key: "Tab",
+  run: nextSnippetField,
+  shift: prevSnippetField
+}, {
+  key: "Escape",
+  run: clearSnippet
+}];
+/**
+A facet that can be used to configure the key bindings used by
+snippets. The default binds Tab to
+[`nextSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.nextSnippetField), Shift-Tab to
+[`prevSnippetField`](https://codemirror.net/6/docs/ref/#autocomplete.prevSnippetField), and Escape
+to [`clearSnippet`](https://codemirror.net/6/docs/ref/#autocomplete.clearSnippet).
+*/
+const snippetKeymap = /*@__PURE__*/Facet.define({
+  combine(maps) {
+    return maps.length ? maps[0] : defaultSnippetKeymap;
+  }
+});
+const addSnippetKeymap = /*@__PURE__*/Prec.highest( /*@__PURE__*/keymap.compute([snippetKeymap], state => state.facet(snippetKeymap)));
+/**
+Create a completion from a snippet. Returns an object with the
+properties from `completion`, plus an `apply` function that
+applies the snippet.
+*/
+function snippetCompletion(template, completion) {
+  return Object.assign(Object.assign({}, completion), {
+    apply: snippet(template)
+  });
+}
+const snippetPointerHandler = /*@__PURE__*/EditorView.domEventHandlers({
+  mousedown(event, view) {
+    let active = view.state.field(snippetState, false),
+      pos;
+    if (!active || (pos = view.posAtCoords({
+      x: event.clientX,
+      y: event.clientY
+    })) == null) return false;
+    let match = active.ranges.find(r => r.from <= pos && r.to >= pos);
+    if (!match || match.field == active.active) return false;
+    view.dispatch({
+      selection: fieldSelection(active.ranges, match.field),
+      effects: setActive.of(active.ranges.some(r => r.field > match.field) ? new ActiveSnippet(active.ranges, match.field) : null),
+      scrollIntoView: true
+    });
+    return true;
+  }
+});
+const defaults = {
+  brackets: ["(", "[", "{", "'", '"'],
+  before: ")]}:;>",
+  stringPrefixes: []
+};
+const closeBracketEffect = /*@__PURE__*/StateEffect.define({
+  map(value, mapping) {
+    let mapped = mapping.mapPos(value, -1, MapMode.TrackAfter);
+    return mapped == null ? undefined : mapped;
+  }
+});
+const closedBracket = /*@__PURE__*/new class extends RangeValue {}();
+closedBracket.startSide = 1;
+closedBracket.endSide = -1;
+const bracketState = /*@__PURE__*/StateField.define({
+  create() {
+    return RangeSet.empty;
+  },
+  update(value, tr) {
+    value = value.map(tr.changes);
+    if (tr.selection) {
+      let line = tr.state.doc.lineAt(tr.selection.main.head);
+      value = value.update({
+        filter: from => from >= line.from && from <= line.to
+      });
+    }
+    for (let effect of tr.effects) if (effect.is(closeBracketEffect)) value = value.update({
+      add: [closedBracket.range(effect.value, effect.value + 1)]
+    });
+    return value;
+  }
+});
+/**
+Extension to enable bracket-closing behavior. When a closeable
+bracket is typed, its closing bracket is immediately inserted
+after the cursor. When closing a bracket directly in front of a
+closing bracket inserted by the extension, the cursor moves over
+that bracket.
+*/
+function closeBrackets() {
+  return [inputHandler, bracketState];
+}
+const definedClosing = "()[]{}<>";
+function closing(ch) {
+  for (let i = 0; i < definedClosing.length; i += 2) if (definedClosing.charCodeAt(i) == ch) return definedClosing.charAt(i + 1);
+  return fromCodePoint(ch < 128 ? ch : ch + 1);
+}
+function config(state, pos) {
+  return state.languageDataAt("closeBrackets", pos)[0] || defaults;
+}
+const android = typeof navigator == "object" && /*@__PURE__*/ /Android\b/.test(navigator.userAgent);
+const inputHandler = /*@__PURE__*/EditorView.inputHandler.of((view, from, to, insert) => {
+  if ((android ? view.composing : view.compositionStarted) || view.state.readOnly) return false;
+  let sel = view.state.selection.main;
+  if (insert.length > 2 || insert.length == 2 && codePointSize(codePointAt(insert, 0)) == 1 || from != sel.from || to != sel.to) return false;
+  let tr = insertBracket(view.state, insert);
+  if (!tr) return false;
+  view.dispatch(tr);
+  return true;
+});
+/**
+Command that implements deleting a pair of matching brackets when
+the cursor is between them.
+*/
+const deleteBracketPair = ({
+  state,
+  dispatch
+}) => {
+  if (state.readOnly) return false;
+  let conf = config(state, state.selection.main.head);
+  let tokens = conf.brackets || defaults.brackets;
+  let dont = null,
+    changes = state.changeByRange(range => {
+      if (range.empty) {
+        let before = prevChar(state.doc, range.head);
+        for (let token of tokens) {
+          if (token == before && nextChar(state.doc, range.head) == closing(codePointAt(token, 0))) return {
+            changes: {
+              from: range.head - token.length,
+              to: range.head + token.length
+            },
+            range: EditorSelection.cursor(range.head - token.length)
+          };
+        }
+      }
+      return {
+        range: dont = range
+      };
+    });
+  if (!dont) dispatch(state.update(changes, {
+    scrollIntoView: true,
+    userEvent: "delete.backward"
+  }));
+  return !dont;
+};
+/**
+Close-brackets related key bindings. Binds Backspace to
+[`deleteBracketPair`](https://codemirror.net/6/docs/ref/#autocomplete.deleteBracketPair).
+*/
+const closeBracketsKeymap = [{
+  key: "Backspace",
+  run: deleteBracketPair
+}];
+/**
+Implements the extension's behavior on text insertion. If the
+given string counts as a bracket in the language around the
+selection, and replacing the selection with it requires custom
+behavior (inserting a closing version or skipping past a
+previously-closed bracket), this function returns a transaction
+representing that custom behavior. (You only need this if you want
+to programmatically insert brackets—the
+[`closeBrackets`](https://codemirror.net/6/docs/ref/#autocomplete.closeBrackets) extension will
+take care of running this for user input.)
+*/
+function insertBracket(state, bracket) {
+  let conf = config(state, state.selection.main.head);
+  let tokens = conf.brackets || defaults.brackets;
+  for (let tok of tokens) {
+    let closed = closing(codePointAt(tok, 0));
+    if (bracket == tok) return closed == tok ? handleSame(state, tok, tokens.indexOf(tok + tok + tok) > -1, conf) : handleOpen(state, tok, closed, conf.before || defaults.before);
+    if (bracket == closed && closedBracketAt(state, state.selection.main.from)) return handleClose(state, tok, closed);
+  }
+  return null;
+}
+function closedBracketAt(state, pos) {
+  let found = false;
+  state.field(bracketState).between(0, state.doc.length, from => {
+    if (from == pos) found = true;
+  });
+  return found;
+}
+function nextChar(doc, pos) {
+  let next = doc.sliceString(pos, pos + 2);
+  return next.slice(0, codePointSize(codePointAt(next, 0)));
+}
+function prevChar(doc, pos) {
+  let prev = doc.sliceString(pos - 2, pos);
+  return codePointSize(codePointAt(prev, 0)) == prev.length ? prev : prev.slice(1);
+}
+function handleOpen(state, open, close, closeBefore) {
+  let dont = null,
+    changes = state.changeByRange(range => {
+      if (!range.empty) return {
+        changes: [{
+          insert: open,
+          from: range.from
+        }, {
+          insert: close,
+          from: range.to
+        }],
+        effects: closeBracketEffect.of(range.to + open.length),
+        range: EditorSelection.range(range.anchor + open.length, range.head + open.length)
+      };
+      let next = nextChar(state.doc, range.head);
+      if (!next || /\s/.test(next) || closeBefore.indexOf(next) > -1) return {
+        changes: {
+          insert: open + close,
+          from: range.head
+        },
+        effects: closeBracketEffect.of(range.head + open.length),
+        range: EditorSelection.cursor(range.head + open.length)
+      };
+      return {
+        range: dont = range
+      };
+    });
+  return dont ? null : state.update(changes, {
+    scrollIntoView: true,
+    userEvent: "input.type"
+  });
+}
+function handleClose(state, _open, close) {
+  let dont = null,
+    changes = state.changeByRange(range => {
+      if (range.empty && nextChar(state.doc, range.head) == close) return {
+        changes: {
+          from: range.head,
+          to: range.head + close.length,
+          insert: close
+        },
+        range: EditorSelection.cursor(range.head + close.length)
+      };
+      return dont = {
+        range
+      };
+    });
+  return dont ? null : state.update(changes, {
+    scrollIntoView: true,
+    userEvent: "input.type"
+  });
+}
+// Handles cases where the open and close token are the same, and
+// possibly triple quotes (as in `"""abc"""`-style quoting).
+function handleSame(state, token, allowTriple, config) {
+  let stringPrefixes = config.stringPrefixes || defaults.stringPrefixes;
+  let dont = null,
+    changes = state.changeByRange(range => {
+      if (!range.empty) return {
+        changes: [{
+          insert: token,
+          from: range.from
+        }, {
+          insert: token,
+          from: range.to
+        }],
+        effects: closeBracketEffect.of(range.to + token.length),
+        range: EditorSelection.range(range.anchor + token.length, range.head + token.length)
+      };
+      let pos = range.head,
+        next = nextChar(state.doc, pos),
+        start;
+      if (next == token) {
+        if (nodeStart(state, pos)) {
+          return {
+            changes: {
+              insert: token + token,
+              from: pos
+            },
+            effects: closeBracketEffect.of(pos + token.length),
+            range: EditorSelection.cursor(pos + token.length)
+          };
+        } else if (closedBracketAt(state, pos)) {
+          let isTriple = allowTriple && state.sliceDoc(pos, pos + token.length * 3) == token + token + token;
+          let content = isTriple ? token + token + token : token;
+          return {
+            changes: {
+              from: pos,
+              to: pos + content.length,
+              insert: content
+            },
+            range: EditorSelection.cursor(pos + content.length)
+          };
+        }
+      } else if (allowTriple && state.sliceDoc(pos - 2 * token.length, pos) == token + token && (start = canStartStringAt(state, pos - 2 * token.length, stringPrefixes)) > -1 && nodeStart(state, start)) {
+        return {
+          changes: {
+            insert: token + token + token + token,
+            from: pos
+          },
+          effects: closeBracketEffect.of(pos + token.length),
+          range: EditorSelection.cursor(pos + token.length)
+        };
+      } else if (state.charCategorizer(pos)(next) != CharCategory.Word) {
+        if (canStartStringAt(state, pos, stringPrefixes) > -1 && !probablyInString(state, pos, token, stringPrefixes)) return {
+          changes: {
+            insert: token + token,
+            from: pos
+          },
+          effects: closeBracketEffect.of(pos + token.length),
+          range: EditorSelection.cursor(pos + token.length)
+        };
+      }
+      return {
+        range: dont = range
+      };
+    });
+  return dont ? null : state.update(changes, {
+    scrollIntoView: true,
+    userEvent: "input.type"
+  });
+}
+function nodeStart(state, pos) {
+  let tree = syntaxTree(state).resolveInner(pos + 1);
+  return tree.parent && tree.from == pos;
+}
+function probablyInString(state, pos, quoteToken, prefixes) {
+  let node = syntaxTree(state).resolveInner(pos, -1);
+  let maxPrefix = prefixes.reduce((m, p) => Math.max(m, p.length), 0);
+  for (let i = 0; i < 5; i++) {
+    let start = state.sliceDoc(node.from, Math.min(node.to, node.from + quoteToken.length + maxPrefix));
+    let quotePos = start.indexOf(quoteToken);
+    if (!quotePos || quotePos > -1 && prefixes.indexOf(start.slice(0, quotePos)) > -1) {
+      let first = node.firstChild;
+      while (first && first.from == node.from && first.to - first.from > quoteToken.length + quotePos) {
+        if (state.sliceDoc(first.to - quoteToken.length, first.to) == quoteToken) return false;
+        first = first.firstChild;
+      }
+      return true;
+    }
+    let parent = node.to == pos && node.parent;
+    if (!parent) break;
+    node = parent;
+  }
+  return false;
+}
+function canStartStringAt(state, pos, prefixes) {
+  let charCat = state.charCategorizer(pos);
+  if (charCat(state.sliceDoc(pos - 1, pos)) != CharCategory.Word) return pos;
+  for (let prefix of prefixes) {
+    let start = pos - prefix.length;
+    if (state.sliceDoc(start, pos) == prefix && charCat(state.sliceDoc(start - 1, start)) != CharCategory.Word) return start;
+  }
+  return -1;
+}
+
+/**
+Returns an extension that enables autocompletion.
+*/
+function autocompletion(config = {}) {
+  return [completionState, completionConfig.of(config), completionPlugin, completionKeymapExt, baseTheme];
+}
+/**
+Basic keybindings for autocompletion.
+
+ - Ctrl-Space: [`startCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.startCompletion)
+ - Escape: [`closeCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.closeCompletion)
+ - ArrowDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true)`
+ - ArrowUp: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(false)`
+ - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")`
+ - PageDown: [`moveCompletionSelection`](https://codemirror.net/6/docs/ref/#autocomplete.moveCompletionSelection)`(true, "page")`
+ - Enter: [`acceptCompletion`](https://codemirror.net/6/docs/ref/#autocomplete.acceptCompletion)
+*/
+const completionKeymap = [{
+  key: "Ctrl-Space",
+  run: startCompletion
+}, {
+  key: "Escape",
+  run: closeCompletion
+}, {
+  key: "ArrowDown",
+  run: /*@__PURE__*/moveCompletionSelection(true)
+}, {
+  key: "ArrowUp",
+  run: /*@__PURE__*/moveCompletionSelection(false)
+}, {
+  key: "PageDown",
+  run: /*@__PURE__*/moveCompletionSelection(true, "page")
+}, {
+  key: "PageUp",
+  run: /*@__PURE__*/moveCompletionSelection(false, "page")
+}, {
+  key: "Enter",
+  run: acceptCompletion
+}];
+const completionKeymapExt = /*@__PURE__*/Prec.highest( /*@__PURE__*/keymap.computeN([completionConfig], state => state.facet(completionConfig).defaultKeymap ? [completionKeymap] : []));
+
+export { DefaultBufferLength as D, IterMode as I, NodeSet as N, Parser as P, Tree as T, NodeType as a, NodeProp as b, completeFromList as c, NodeWeakMap as d, closeBrackets as e, autocompletion as f, closeBracketsKeymap as g, completionKeymap as h, ifNotIn as i, parseMixed as p, snippetCompletion as s };