@onereach/ui-components 4.0.2 → 4.1.0-beta.2508.0

package/dist/bundled/v3/index-62e39ec2.js

@@ -0,0 +1,4534 @@
+import { E as EditorView, P as Prec, V as ViewPlugin, a as EditorState, g as StateEffect, S as StateField, F as Facet, G as gutter, H as RangeSet, I as StyleModule, i as Decoration, q as logException, f as countColumn, W as WidgetType, J as GutterMarker, R as RangeSetBuilder, c as combineConfig } from './index-c76372bb.js';
+
+// FIXME profile adding a per-Tree TreeNode cache, validating it by
+// parent pointer
+/// 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(" ")
+});
+/// 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;
+  }
+}
+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 = this.prop(NodeProp.mounted);
+    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;
+  }
+  /// 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;
+    for (let c = this.cursor((spec.mode || 0) | IterMode.IncludeAnonymous);;) {
+      let entered = false;
+      if (c.from <= to && c.to >= from && (c.type.isAnonymous || enter(c) !== false)) {
+        if (c.firstChild()) continue;
+        entered = true;
+      }
+      for (;;) {
+        if (entered && leave && !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 enterUnfinishedNodesBefore(node, pos) {
+  let scan = node.childBefore(pos);
+  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;
+}
+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 TreeNode {
+  constructor(_tree, from,
+  // Index in parent node, set to -1 if the node is not a direct child of _parent.node (overlay)
+  index, _parent) {
+    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) && next.props && (mounted = next.prop(NodeProp.mounted)) && !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 = this._tree.prop(NodeProp.mounted)) && 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;
+  }
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  get tree() {
+    return this._tree;
+  }
+  toTree() {
+    return this._tree;
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  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);
+  }
+  /// @internal
+  toString() {
+    return this._tree.toString();
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+}
+function getChildren(node, type, before, after) {
+  let cur = node.cursor(),
+    result = [];
+  if (!cur.firstChild()) return result;
+  if (before != null) while (!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 {
+  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) {
+    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 */));
+  }
+
+  cursor(mode = 0) {
+    return new TreeCursor(this, mode);
+  }
+  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);
+  }
+  resolve(pos, side = 0) {
+    return resolveNode(this, pos, side, false);
+  }
+  resolveInner(pos, side = 0) {
+    return resolveNode(this, pos, side, true);
+  }
+  enterUnfinishedNodesBefore(pos) {
+    return enterUnfinishedNodesBefore(this, pos);
+  }
+  /// @internal
+  toString() {
+    return this.context.buffer.childString(this.index);
+  }
+  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);
+  }
+  get node() {
+    return this;
+  }
+  matchContext(context) {
+    return matchNodeContext(this, context);
+  }
+}
+/// 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;
+  }
+  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) {
+    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 {
+          takeNode(start, endPos, localChildren, localPositions, localInRepeat);
+        }
+      }
+      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 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);
+  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, ranges) {
+    this.parser = parser;
+    this.parse = parse;
+    this.overlay = overlay;
+    this.target = target;
+    this.ranges = 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].ranges[0].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; this.stoppedAt == null || cursor.from < this.stoppedAt;) {
+      let enter = true,
+        range;
+      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 && cursor.from < cursor.to && (nest = this.nest(cursor, this.input))) {
+        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 || [new Range(cursor.from, cursor.to)]);
+          if (ranges.length) this.inner.push(new InnerParse(nest.parser, nest.parser.startParse(this.input, enterFragments(oldMounts, ranges), ranges), nest.overlay ? nest.overlay.map(r => new Range(r.from - cursor.from, r.to - cursor.from)) : null, cursor.tree, ranges));
+          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) 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));
+            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,
+    depth = 0;
+  // Scan up to the nearest tree
+  do {
+    cursor.parent();
+    depth++;
+  } while (!cursor.tree);
+  // Find the index of the buffer in that tree
+  let i = 0,
+    base = cursor.tree,
+    off = 0;
+  for (;; i++) {
+    off = base.positions[i] + cursor.from;
+    if (off <= node.from && off + base.children[i].length >= node.to) break;
+  }
+  let buf = base.children[i],
+    b = buf.buffer;
+  // 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) {
+    let i = startI;
+    while (b[i + 2] + off <= node.from) i = b[i + 3];
+    let children = [],
+      positions = [];
+    sliceBuf(buf, startI, i, children, positions, innerOffset);
+    let from = b[i + 1],
+      to = b[i + 2];
+    let isTarget = from + off == node.from && to + off == node.to && b[i] == node.type.id;
+    children.push(isTarget ? node.toTree() : split(i + 4, b[i + 3], buf.set.types[b[i]], from, to - from));
+    positions.push(from - innerOffset);
+    sliceBuf(buf, b[i + 3], endI, children, positions, innerOffset);
+    return new Tree(type, children, positions, length);
+  }
+  base.children[i] = split(0, b.length, NodeType.none, 0, buf.length);
+  // Move the cursor back to the target node
+  for (let d = 0; d <= depth; d++) cursor.childAfter(node.from);
+}
+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;
+}
+
+let nextTagID = 0;
+/// Highlighting tags are markers that denote a highlighting category.
+/// They are [associated](#highlight.styleTags) with parts of a syntax
+/// tree by a language mode, and then mapped to an actual CSS style by
+/// a [highlighter](#highlight.Highlighter).
+///
+/// Because syntax tree node types and highlight styles have to be
+/// able to talk the same language, CodeMirror uses a mostly _closed_
+/// [vocabulary](#highlight.tags) of syntax tags (as opposed to
+/// traditional open string-based systems, which make it hard for
+/// highlighting themes to cover all the tokens produced by the
+/// various languages).
+///
+/// It _is_ possible to [define](#highlight.Tag^define) your own
+/// highlighting tags for system-internal use (where you control both
+/// the language package and the highlighter), but such tags will not
+/// be picked up by regular highlighters (though you can derive them
+/// from standard tags to allow highlighters to fall back to those).
+class Tag {
+  /// @internal
+  constructor(
+  /// The set of this tag and all its parent tags, starting with
+  /// this one itself and sorted in order of decreasing specificity.
+  set,
+  /// The base unmodified tag that this one is based on, if it's
+  /// modified @internal
+  base,
+  /// The modifiers applied to this.base @internal
+  modified) {
+    this.set = set;
+    this.base = base;
+    this.modified = modified;
+    /// @internal
+    this.id = nextTagID++;
+  }
+  /// Define a new tag. If `parent` is given, the tag is treated as a
+  /// sub-tag of that parent, and
+  /// [highlighters](#highlight.tagHighlighter) that don't mention
+  /// this tag will try to fall back to the parent tag (or grandparent
+  /// tag, etc).
+  static define(parent) {
+    if (parent === null || parent === void 0 ? void 0 : parent.base) throw new Error("Can not derive from a modified tag");
+    let tag = new Tag([], null, []);
+    tag.set.push(tag);
+    if (parent) for (let t of parent.set) tag.set.push(t);
+    return tag;
+  }
+  /// Define a tag _modifier_, which is a function that, given a tag,
+  /// will return a tag that is a subtag of the original. Applying the
+  /// same modifier to a twice tag will return the same value (`m1(t1)
+  /// == m1(t1)`) and applying multiple modifiers will, regardless or
+  /// order, produce the same tag (`m1(m2(t1)) == m2(m1(t1))`).
+  ///
+  /// When multiple modifiers are applied to a given base tag, each
+  /// smaller set of modifiers is registered as a parent, so that for
+  /// example `m1(m2(m3(t1)))` is a subtype of `m1(m2(t1))`,
+  /// `m1(m3(t1)`, and so on.
+  static defineModifier() {
+    let mod = new Modifier();
+    return tag => {
+      if (tag.modified.indexOf(mod) > -1) return tag;
+      return Modifier.get(tag.base || tag, tag.modified.concat(mod).sort((a, b) => a.id - b.id));
+    };
+  }
+}
+let nextModifierID = 0;
+class Modifier {
+  constructor() {
+    this.instances = [];
+    this.id = nextModifierID++;
+  }
+  static get(base, mods) {
+    if (!mods.length) return base;
+    let exists = mods[0].instances.find(t => t.base == base && sameArray(mods, t.modified));
+    if (exists) return exists;
+    let set = [],
+      tag = new Tag(set, base, mods);
+    for (let m of mods) m.instances.push(tag);
+    let configs = powerSet(mods);
+    for (let parent of base.set) if (!parent.modified.length) for (let config of configs) set.push(Modifier.get(parent, config));
+    return tag;
+  }
+}
+function sameArray(a, b) {
+  return a.length == b.length && a.every((x, i) => x == b[i]);
+}
+function powerSet(array) {
+  let sets = [[]];
+  for (let i = 0; i < array.length; i++) {
+    for (let j = 0, e = sets.length; j < e; j++) {
+      sets.push(sets[j].concat(array[i]));
+    }
+  }
+  return sets.sort((a, b) => b.length - a.length);
+}
+/// This function is used to add a set of tags to a language syntax
+/// via [`NodeSet.extend`](#common.NodeSet.extend) or
+/// [`LRParser.configure`](#lr.LRParser.configure).
+///
+/// The argument object maps node selectors to [highlighting
+/// tags](#highlight.Tag) or arrays of tags.
+///
+/// Node selectors may hold one or more (space-separated) node paths.
+/// Such a path can be a [node name](#common.NodeType.name), or
+/// multiple node names (or `*` wildcards) separated by slash
+/// characters, as in `"Block/Declaration/VariableName"`. Such a path
+/// matches the final node but only if its direct parent nodes are the
+/// other nodes mentioned. A `*` in such a path matches any parent,
+/// but only a single level—wildcards that match multiple parents
+/// aren't supported, both for efficiency reasons and because Lezer
+/// trees make it rather hard to reason about what they would match.)
+///
+/// A path can be ended with `/...` to indicate that the tag assigned
+/// to the node should also apply to all child nodes, even if they
+/// match their own style (by default, only the innermost style is
+/// used).
+///
+/// When a path ends in `!`, as in `Attribute!`, no further matching
+/// happens for the node's child nodes, and the entire node gets the
+/// given style.
+///
+/// In this notation, node names that contain `/`, `!`, `*`, or `...`
+/// must be quoted as JSON strings.
+///
+/// For example:
+///
+/// ```javascript
+/// parser.withProps(
+///   styleTags({
+///     // Style Number and BigNumber nodes
+///     "Number BigNumber": tags.number,
+///     // Style Escape nodes whose parent is String
+///     "String/Escape": tags.escape,
+///     // Style anything inside Attributes nodes
+///     "Attributes!": tags.meta,
+///     // Add a style to all content inside Italic nodes
+///     "Italic/...": tags.emphasis,
+///     // Style InvalidString nodes as both `string` and `invalid`
+///     "InvalidString": [tags.string, tags.invalid],
+///     // Style the node named "/" as punctuation
+///     '"/"': tags.punctuation
+///   })
+/// )
+/// ```
+function styleTags(spec) {
+  let byName = Object.create(null);
+  for (let prop in spec) {
+    let tags = spec[prop];
+    if (!Array.isArray(tags)) tags = [tags];
+    for (let part of prop.split(" ")) if (part) {
+      let pieces = [],
+        mode = 2 /* Mode.Normal */,
+        rest = part;
+      for (let pos = 0;;) {
+        if (rest == "..." && pos > 0 && pos + 3 == part.length) {
+          mode = 1 /* Mode.Inherit */;
+          break;
+        }
+        let m = /^"(?:[^"\\]|\\.)*?"|[^\/!]+/.exec(rest);
+        if (!m) throw new RangeError("Invalid path: " + part);
+        pieces.push(m[0] == "*" ? "" : m[0][0] == '"' ? JSON.parse(m[0]) : m[0]);
+        pos += m[0].length;
+        if (pos == part.length) break;
+        let next = part[pos++];
+        if (pos == part.length && next == "!") {
+          mode = 0 /* Mode.Opaque */;
+          break;
+        }
+        if (next != "/") throw new RangeError("Invalid path: " + part);
+        rest = part.slice(pos);
+      }
+      let last = pieces.length - 1,
+        inner = pieces[last];
+      if (!inner) throw new RangeError("Invalid path: " + part);
+      let rule = new Rule(tags, mode, last > 0 ? pieces.slice(0, last) : null);
+      byName[inner] = rule.sort(byName[inner]);
+    }
+  }
+  return ruleNodeProp.add(byName);
+}
+const ruleNodeProp = new NodeProp();
+class Rule {
+  constructor(tags, mode, context, next) {
+    this.tags = tags;
+    this.mode = mode;
+    this.context = context;
+    this.next = next;
+  }
+  get opaque() {
+    return this.mode == 0 /* Mode.Opaque */;
+  }
+  get inherit() {
+    return this.mode == 1 /* Mode.Inherit */;
+  }
+  sort(other) {
+    if (!other || other.depth < this.depth) {
+      this.next = other;
+      return this;
+    }
+    other.next = this.sort(other.next);
+    return other;
+  }
+  get depth() {
+    return this.context ? this.context.length : 0;
+  }
+}
+Rule.empty = new Rule([], 2 /* Mode.Normal */, null);
+/// Define a [highlighter](#highlight.Highlighter) from an array of
+/// tag/class pairs. Classes associated with more specific tags will
+/// take precedence.
+function tagHighlighter(tags, options) {
+  let map = Object.create(null);
+  for (let style of tags) {
+    if (!Array.isArray(style.tag)) map[style.tag.id] = style.class;else for (let tag of style.tag) map[tag.id] = style.class;
+  }
+  let {
+    scope,
+    all = null
+  } = options || {};
+  return {
+    style: tags => {
+      let cls = all;
+      for (let tag of tags) {
+        for (let sub of tag.set) {
+          let tagClass = map[sub.id];
+          if (tagClass) {
+            cls = cls ? cls + " " + tagClass : tagClass;
+            break;
+          }
+        }
+      }
+      return cls;
+    },
+    scope
+  };
+}
+function highlightTags(highlighters, tags) {
+  let result = null;
+  for (let highlighter of highlighters) {
+    let value = highlighter.style(tags);
+    if (value) result = result ? result + " " + value : value;
+  }
+  return result;
+}
+/// Highlight the given [tree](#common.Tree) with the given
+/// [highlighter](#highlight.Highlighter).
+function highlightTree(tree, highlighter,
+/// Assign styling to a region of the text. Will be called, in order
+/// of position, for any ranges where more than zero classes apply.
+/// `classes` is a space separated string of CSS classes.
+putStyle,
+/// The start of the range to highlight.
+from = 0,
+/// The end of the range.
+to = tree.length) {
+  let builder = new HighlightBuilder(from, Array.isArray(highlighter) ? highlighter : [highlighter], putStyle);
+  builder.highlightRange(tree.cursor(), from, to, "", builder.highlighters);
+  builder.flush(to);
+}
+class HighlightBuilder {
+  constructor(at, highlighters, span) {
+    this.at = at;
+    this.highlighters = highlighters;
+    this.span = span;
+    this.class = "";
+  }
+  startSpan(at, cls) {
+    if (cls != this.class) {
+      this.flush(at);
+      if (at > this.at) this.at = at;
+      this.class = cls;
+    }
+  }
+  flush(to) {
+    if (to > this.at && this.class) this.span(this.at, to, this.class);
+  }
+  highlightRange(cursor, from, to, inheritedClass, highlighters) {
+    let {
+      type,
+      from: start,
+      to: end
+    } = cursor;
+    if (start >= to || end <= from) return;
+    if (type.isTop) highlighters = this.highlighters.filter(h => !h.scope || h.scope(type));
+    let cls = inheritedClass;
+    let rule = getStyleTags(cursor) || Rule.empty;
+    let tagCls = highlightTags(highlighters, rule.tags);
+    if (tagCls) {
+      if (cls) cls += " ";
+      cls += tagCls;
+      if (rule.mode == 1 /* Mode.Inherit */) inheritedClass += (inheritedClass ? " " : "") + tagCls;
+    }
+    this.startSpan(cursor.from, cls);
+    if (rule.opaque) return;
+    let mounted = cursor.tree && cursor.tree.prop(NodeProp.mounted);
+    if (mounted && mounted.overlay) {
+      let inner = cursor.node.enter(mounted.overlay[0].from + start, 1);
+      let innerHighlighters = this.highlighters.filter(h => !h.scope || h.scope(mounted.tree.type));
+      let hasChild = cursor.firstChild();
+      for (let i = 0, pos = start;; i++) {
+        let next = i < mounted.overlay.length ? mounted.overlay[i] : null;
+        let nextPos = next ? next.from + start : end;
+        let rangeFrom = Math.max(from, pos),
+          rangeTo = Math.min(to, nextPos);
+        if (rangeFrom < rangeTo && hasChild) {
+          while (cursor.from < rangeTo) {
+            this.highlightRange(cursor, rangeFrom, rangeTo, inheritedClass, highlighters);
+            this.startSpan(Math.min(rangeTo, cursor.to), cls);
+            if (cursor.to >= nextPos || !cursor.nextSibling()) break;
+          }
+        }
+        if (!next || nextPos > to) break;
+        pos = next.to + start;
+        if (pos > from) {
+          this.highlightRange(inner.cursor(), Math.max(from, next.from + start), Math.min(to, pos), inheritedClass, innerHighlighters);
+          this.startSpan(pos, cls);
+        }
+      }
+      if (hasChild) cursor.parent();
+    } else if (cursor.firstChild()) {
+      do {
+        if (cursor.to <= from) continue;
+        if (cursor.from >= to) break;
+        this.highlightRange(cursor, from, to, inheritedClass, highlighters);
+        this.startSpan(Math.min(to, cursor.to), cls);
+      } while (cursor.nextSibling());
+      cursor.parent();
+    }
+  }
+}
+/// Match a syntax node's [highlight rules](#highlight.styleTags). If
+/// there's a match, return its set of tags, and whether it is
+/// opaque (uses a `!`) or applies to all child nodes (`/...`).
+function getStyleTags(node) {
+  let rule = node.type.prop(ruleNodeProp);
+  while (rule && rule.context && !node.matchContext(rule.context)) rule = rule.next;
+  return rule || null;
+}
+const t = Tag.define;
+const comment = t(),
+  name = t(),
+  typeName = t(name),
+  propertyName = t(name),
+  literal = t(),
+  string = t(literal),
+  number = t(literal),
+  content = t(),
+  heading = t(content),
+  keyword = t(),
+  operator = t(),
+  punctuation = t(),
+  bracket = t(punctuation),
+  meta = t();
+/// The default set of highlighting [tags](#highlight.Tag).
+///
+/// This collection is heavily biased towards programming languages,
+/// and necessarily incomplete. A full ontology of syntactic
+/// constructs would fill a stack of books, and be impractical to
+/// write themes for. So try to make do with this set. If all else
+/// fails, [open an
+/// issue](https://github.com/codemirror/codemirror.next) to propose a
+/// new tag, or [define](#highlight.Tag^define) a local custom tag for
+/// your use case.
+///
+/// Note that it is not obligatory to always attach the most specific
+/// tag possible to an element—if your grammar can't easily
+/// distinguish a certain type of element (such as a local variable),
+/// it is okay to style it as its more general variant (a variable).
+/// 
+/// For tags that extend some parent tag, the documentation links to
+/// the parent.
+const tags = {
+  /// A comment.
+  comment,
+  /// A line [comment](#highlight.tags.comment).
+  lineComment: t(comment),
+  /// A block [comment](#highlight.tags.comment).
+  blockComment: t(comment),
+  /// A documentation [comment](#highlight.tags.comment).
+  docComment: t(comment),
+  /// Any kind of identifier.
+  name,
+  /// The [name](#highlight.tags.name) of a variable.
+  variableName: t(name),
+  /// A type [name](#highlight.tags.name).
+  typeName: typeName,
+  /// A tag name (subtag of [`typeName`](#highlight.tags.typeName)).
+  tagName: t(typeName),
+  /// A property or field [name](#highlight.tags.name).
+  propertyName: propertyName,
+  /// An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).
+  attributeName: t(propertyName),
+  /// The [name](#highlight.tags.name) of a class.
+  className: t(name),
+  /// A label [name](#highlight.tags.name).
+  labelName: t(name),
+  /// A namespace [name](#highlight.tags.name).
+  namespace: t(name),
+  /// The [name](#highlight.tags.name) of a macro.
+  macroName: t(name),
+  /// A literal value.
+  literal,
+  /// A string [literal](#highlight.tags.literal).
+  string,
+  /// A documentation [string](#highlight.tags.string).
+  docString: t(string),
+  /// A character literal (subtag of [string](#highlight.tags.string)).
+  character: t(string),
+  /// An attribute value (subtag of [string](#highlight.tags.string)).
+  attributeValue: t(string),
+  /// A number [literal](#highlight.tags.literal).
+  number,
+  /// An integer [number](#highlight.tags.number) literal.
+  integer: t(number),
+  /// A floating-point [number](#highlight.tags.number) literal.
+  float: t(number),
+  /// A boolean [literal](#highlight.tags.literal).
+  bool: t(literal),
+  /// Regular expression [literal](#highlight.tags.literal).
+  regexp: t(literal),
+  /// An escape [literal](#highlight.tags.literal), for example a
+  /// backslash escape in a string.
+  escape: t(literal),
+  /// A color [literal](#highlight.tags.literal).
+  color: t(literal),
+  /// A URL [literal](#highlight.tags.literal).
+  url: t(literal),
+  /// A language keyword.
+  keyword,
+  /// The [keyword](#highlight.tags.keyword) for the self or this
+  /// object.
+  self: t(keyword),
+  /// The [keyword](#highlight.tags.keyword) for null.
+  null: t(keyword),
+  /// A [keyword](#highlight.tags.keyword) denoting some atomic value.
+  atom: t(keyword),
+  /// A [keyword](#highlight.tags.keyword) that represents a unit.
+  unit: t(keyword),
+  /// A modifier [keyword](#highlight.tags.keyword).
+  modifier: t(keyword),
+  /// A [keyword](#highlight.tags.keyword) that acts as an operator.
+  operatorKeyword: t(keyword),
+  /// A control-flow related [keyword](#highlight.tags.keyword).
+  controlKeyword: t(keyword),
+  /// A [keyword](#highlight.tags.keyword) that defines something.
+  definitionKeyword: t(keyword),
+  /// A [keyword](#highlight.tags.keyword) related to defining or
+  /// interfacing with modules.
+  moduleKeyword: t(keyword),
+  /// An operator.
+  operator,
+  /// An [operator](#highlight.tags.operator) that dereferences something.
+  derefOperator: t(operator),
+  /// Arithmetic-related [operator](#highlight.tags.operator).
+  arithmeticOperator: t(operator),
+  /// Logical [operator](#highlight.tags.operator).
+  logicOperator: t(operator),
+  /// Bit [operator](#highlight.tags.operator).
+  bitwiseOperator: t(operator),
+  /// Comparison [operator](#highlight.tags.operator).
+  compareOperator: t(operator),
+  /// [Operator](#highlight.tags.operator) that updates its operand.
+  updateOperator: t(operator),
+  /// [Operator](#highlight.tags.operator) that defines something.
+  definitionOperator: t(operator),
+  /// Type-related [operator](#highlight.tags.operator).
+  typeOperator: t(operator),
+  /// Control-flow [operator](#highlight.tags.operator).
+  controlOperator: t(operator),
+  /// Program or markup punctuation.
+  punctuation,
+  /// [Punctuation](#highlight.tags.punctuation) that separates
+  /// things.
+  separator: t(punctuation),
+  /// Bracket-style [punctuation](#highlight.tags.punctuation).
+  bracket,
+  /// Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
+  /// tokens).
+  angleBracket: t(bracket),
+  /// Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
+  /// tokens).
+  squareBracket: t(bracket),
+  /// Parentheses (usually `(` and `)` tokens). Subtag of
+  /// [bracket](#highlight.tags.bracket).
+  paren: t(bracket),
+  /// Braces (usually `{` and `}` tokens). Subtag of
+  /// [bracket](#highlight.tags.bracket).
+  brace: t(bracket),
+  /// Content, for example plain text in XML or markup documents.
+  content,
+  /// [Content](#highlight.tags.content) that represents a heading.
+  heading,
+  /// A level 1 [heading](#highlight.tags.heading).
+  heading1: t(heading),
+  /// A level 2 [heading](#highlight.tags.heading).
+  heading2: t(heading),
+  /// A level 3 [heading](#highlight.tags.heading).
+  heading3: t(heading),
+  /// A level 4 [heading](#highlight.tags.heading).
+  heading4: t(heading),
+  /// A level 5 [heading](#highlight.tags.heading).
+  heading5: t(heading),
+  /// A level 6 [heading](#highlight.tags.heading).
+  heading6: t(heading),
+  /// A prose separator (such as a horizontal rule).
+  contentSeparator: t(content),
+  /// [Content](#highlight.tags.content) that represents a list.
+  list: t(content),
+  /// [Content](#highlight.tags.content) that represents a quote.
+  quote: t(content),
+  /// [Content](#highlight.tags.content) that is emphasized.
+  emphasis: t(content),
+  /// [Content](#highlight.tags.content) that is styled strong.
+  strong: t(content),
+  /// [Content](#highlight.tags.content) that is part of a link.
+  link: t(content),
+  /// [Content](#highlight.tags.content) that is styled as code or
+  /// monospace.
+  monospace: t(content),
+  /// [Content](#highlight.tags.content) that has a strike-through
+  /// style.
+  strikethrough: t(content),
+  /// Inserted text in a change-tracking format.
+  inserted: t(),
+  /// Deleted text.
+  deleted: t(),
+  /// Changed text.
+  changed: t(),
+  /// An invalid or unsyntactic element.
+  invalid: t(),
+  /// Metadata or meta-instruction.
+  meta,
+  /// [Metadata](#highlight.tags.meta) that applies to the entire
+  /// document.
+  documentMeta: t(meta),
+  /// [Metadata](#highlight.tags.meta) that annotates or adds
+  /// attributes to a given syntactic element.
+  annotation: t(meta),
+  /// Processing instruction or preprocessor directive. Subtag of
+  /// [meta](#highlight.tags.meta).
+  processingInstruction: t(meta),
+  /// [Modifier](#highlight.Tag^defineModifier) that indicates that a
+  /// given element is being defined. Expected to be used with the
+  /// various [name](#highlight.tags.name) tags.
+  definition: Tag.defineModifier(),
+  /// [Modifier](#highlight.Tag^defineModifier) that indicates that
+  /// something is constant. Mostly expected to be used with
+  /// [variable names](#highlight.tags.variableName).
+  constant: Tag.defineModifier(),
+  /// [Modifier](#highlight.Tag^defineModifier) used to indicate that
+  /// a [variable](#highlight.tags.variableName) or [property
+  /// name](#highlight.tags.propertyName) is being called or defined
+  /// as a function.
+  function: Tag.defineModifier(),
+  /// [Modifier](#highlight.Tag^defineModifier) that can be applied to
+  /// [names](#highlight.tags.name) to indicate that they belong to
+  /// the language's standard environment.
+  standard: Tag.defineModifier(),
+  /// [Modifier](#highlight.Tag^defineModifier) that indicates a given
+  /// [names](#highlight.tags.name) is local to some scope.
+  local: Tag.defineModifier(),
+  /// A generic variant [modifier](#highlight.Tag^defineModifier) that
+  /// can be used to tag language-specific alternative variants of
+  /// some common tag. It is recommended for themes to define special
+  /// forms of at least the [string](#highlight.tags.string) and
+  /// [variable name](#highlight.tags.variableName) tags, since those
+  /// come up a lot.
+  special: Tag.defineModifier()
+};
+/// This is a highlighter that adds stable, predictable classes to
+/// tokens, for styling with external CSS.
+///
+/// The following tags are mapped to their name prefixed with `"tok-"`
+/// (for example `"tok-comment"`):
+///
+/// * [`link`](#highlight.tags.link)
+/// * [`heading`](#highlight.tags.heading)
+/// * [`emphasis`](#highlight.tags.emphasis)
+/// * [`strong`](#highlight.tags.strong)
+/// * [`keyword`](#highlight.tags.keyword)
+/// * [`atom`](#highlight.tags.atom)
+/// * [`bool`](#highlight.tags.bool)
+/// * [`url`](#highlight.tags.url)
+/// * [`labelName`](#highlight.tags.labelName)
+/// * [`inserted`](#highlight.tags.inserted)
+/// * [`deleted`](#highlight.tags.deleted)
+/// * [`literal`](#highlight.tags.literal)
+/// * [`string`](#highlight.tags.string)
+/// * [`number`](#highlight.tags.number)
+/// * [`variableName`](#highlight.tags.variableName)
+/// * [`typeName`](#highlight.tags.typeName)
+/// * [`namespace`](#highlight.tags.namespace)
+/// * [`className`](#highlight.tags.className)
+/// * [`macroName`](#highlight.tags.macroName)
+/// * [`propertyName`](#highlight.tags.propertyName)
+/// * [`operator`](#highlight.tags.operator)
+/// * [`comment`](#highlight.tags.comment)
+/// * [`meta`](#highlight.tags.meta)
+/// * [`punctuation`](#highlight.tags.punctuation)
+/// * [`invalid`](#highlight.tags.invalid)
+///
+/// In addition, these mappings are provided:
+///
+/// * [`regexp`](#highlight.tags.regexp),
+///   [`escape`](#highlight.tags.escape), and
+///   [`special`](#highlight.tags.special)[`(string)`](#highlight.tags.string)
+///   are mapped to `"tok-string2"`
+/// * [`special`](#highlight.tags.special)[`(variableName)`](#highlight.tags.variableName)
+///   to `"tok-variableName2"`
+/// * [`local`](#highlight.tags.local)[`(variableName)`](#highlight.tags.variableName)
+///   to `"tok-variableName tok-local"`
+/// * [`definition`](#highlight.tags.definition)[`(variableName)`](#highlight.tags.variableName)
+///   to `"tok-variableName tok-definition"`
+/// * [`definition`](#highlight.tags.definition)[`(propertyName)`](#highlight.tags.propertyName)
+///   to `"tok-propertyName tok-definition"`
+tagHighlighter([{
+  tag: tags.link,
+  class: "tok-link"
+}, {
+  tag: tags.heading,
+  class: "tok-heading"
+}, {
+  tag: tags.emphasis,
+  class: "tok-emphasis"
+}, {
+  tag: tags.strong,
+  class: "tok-strong"
+}, {
+  tag: tags.keyword,
+  class: "tok-keyword"
+}, {
+  tag: tags.atom,
+  class: "tok-atom"
+}, {
+  tag: tags.bool,
+  class: "tok-bool"
+}, {
+  tag: tags.url,
+  class: "tok-url"
+}, {
+  tag: tags.labelName,
+  class: "tok-labelName"
+}, {
+  tag: tags.inserted,
+  class: "tok-inserted"
+}, {
+  tag: tags.deleted,
+  class: "tok-deleted"
+}, {
+  tag: tags.literal,
+  class: "tok-literal"
+}, {
+  tag: tags.string,
+  class: "tok-string"
+}, {
+  tag: tags.number,
+  class: "tok-number"
+}, {
+  tag: [tags.regexp, tags.escape, tags.special(tags.string)],
+  class: "tok-string2"
+}, {
+  tag: tags.variableName,
+  class: "tok-variableName"
+}, {
+  tag: tags.local(tags.variableName),
+  class: "tok-variableName tok-local"
+}, {
+  tag: tags.definition(tags.variableName),
+  class: "tok-variableName tok-definition"
+}, {
+  tag: tags.special(tags.variableName),
+  class: "tok-variableName2"
+}, {
+  tag: tags.definition(tags.propertyName),
+  class: "tok-propertyName tok-definition"
+}, {
+  tag: tags.typeName,
+  class: "tok-typeName"
+}, {
+  tag: tags.namespace,
+  class: "tok-namespace"
+}, {
+  tag: tags.className,
+  class: "tok-className"
+}, {
+  tag: tags.macroName,
+  class: "tok-macroName"
+}, {
+  tag: tags.propertyName,
+  class: "tok-propertyName"
+}, {
+  tag: tags.operator,
+  class: "tok-operator"
+}, {
+  tag: tags.comment,
+  class: "tok-comment"
+}, {
+  tag: tags.meta,
+  class: "tok-meta"
+}, {
+  tag: tags.invalid,
+  class: "tok-invalid"
+}, {
+  tag: tags.punctuation,
+  class: "tok-punctuation"
+}]);
+
+var _a;
+/**
+Node prop stored in a parser's top syntax node to provide the
+facet that stores language-specific data for that language.
+*/
+const languageDataProp = /*@__PURE__*/new NodeProp();
+/**
+Helper function to define a facet (to be added to the top syntax
+node(s) for a language via
+[`languageDataProp`](https://codemirror.net/6/docs/ref/#language.languageDataProp)), that will be
+used to associate language data with the language. You
+probably only need this when subclassing
+[`Language`](https://codemirror.net/6/docs/ref/#language.Language).
+*/
+function defineLanguageFacet(baseData) {
+  return Facet.define({
+    combine: baseData ? values => values.concat(baseData) : undefined
+  });
+}
+/**
+A language object manages parsing and per-language
+[metadata](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt). Parse data is
+managed as a [Lezer](https://lezer.codemirror.net) tree. The class
+can be used directly, via the [`LRLanguage`](https://codemirror.net/6/docs/ref/#language.LRLanguage)
+subclass for [Lezer](https://lezer.codemirror.net/) LR parsers, or
+via the [`StreamLanguage`](https://codemirror.net/6/docs/ref/#language.StreamLanguage) subclass
+for stream parsers.
+*/
+class Language {
+  /**
+  Construct a language object. If you need to invoke this
+  directly, first define a data facet with
+  [`defineLanguageFacet`](https://codemirror.net/6/docs/ref/#language.defineLanguageFacet), and then
+  configure your parser to [attach](https://codemirror.net/6/docs/ref/#language.languageDataProp) it
+  to the language's outer syntax node.
+  */
+  constructor(
+  /**
+  The [language data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt) facet
+  used for this language.
+  */
+  data, parser, extraExtensions = [],
+  /**
+  A language name.
+  */
+  name = "") {
+    this.data = data;
+    this.name = name;
+    // Kludge to define EditorState.tree as a debugging helper,
+    // without the EditorState package actually knowing about
+    // languages and lezer trees.
+    if (!EditorState.prototype.hasOwnProperty("tree")) Object.defineProperty(EditorState.prototype, "tree", {
+      get() {
+        return syntaxTree(this);
+      }
+    });
+    this.parser = parser;
+    this.extension = [language.of(this), EditorState.languageData.of((state, pos, side) => state.facet(languageDataFacetAt(state, pos, side)))].concat(extraExtensions);
+  }
+  /**
+  Query whether this language is active at the given position.
+  */
+  isActiveAt(state, pos, side = -1) {
+    return languageDataFacetAt(state, pos, side) == this.data;
+  }
+  /**
+  Find the document regions that were parsed using this language.
+  The returned regions will _include_ any nested languages rooted
+  in this language, when those exist.
+  */
+  findRegions(state) {
+    let lang = state.facet(language);
+    if ((lang === null || lang === void 0 ? void 0 : lang.data) == this.data) return [{
+      from: 0,
+      to: state.doc.length
+    }];
+    if (!lang || !lang.allowsNesting) return [];
+    let result = [];
+    let explore = (tree, from) => {
+      if (tree.prop(languageDataProp) == this.data) {
+        result.push({
+          from,
+          to: from + tree.length
+        });
+        return;
+      }
+      let mount = tree.prop(NodeProp.mounted);
+      if (mount) {
+        if (mount.tree.prop(languageDataProp) == this.data) {
+          if (mount.overlay) for (let r of mount.overlay) result.push({
+            from: r.from + from,
+            to: r.to + from
+          });else result.push({
+            from: from,
+            to: from + tree.length
+          });
+          return;
+        } else if (mount.overlay) {
+          let size = result.length;
+          explore(mount.tree, mount.overlay[0].from + from);
+          if (result.length > size) return;
+        }
+      }
+      for (let i = 0; i < tree.children.length; i++) {
+        let ch = tree.children[i];
+        if (ch instanceof Tree) explore(ch, tree.positions[i] + from);
+      }
+    };
+    explore(syntaxTree(state), 0);
+    return result;
+  }
+  /**
+  Indicates whether this language allows nested languages. The
+  default implementation returns true.
+  */
+  get allowsNesting() {
+    return true;
+  }
+}
+/**
+@internal
+*/
+Language.setState = /*@__PURE__*/StateEffect.define();
+function languageDataFacetAt(state, pos, side) {
+  let topLang = state.facet(language);
+  if (!topLang) return null;
+  let facet = topLang.data;
+  if (topLang.allowsNesting) {
+    for (let node = syntaxTree(state).topNode; node; node = node.enter(pos, side, IterMode.ExcludeBuffers)) facet = node.type.prop(languageDataProp) || facet;
+  }
+  return facet;
+}
+/**
+A subclass of [`Language`](https://codemirror.net/6/docs/ref/#language.Language) for use with Lezer
+[LR parsers](https://lezer.codemirror.net/docs/ref#lr.LRParser)
+parsers.
+*/
+class LRLanguage extends Language {
+  constructor(data, parser, name) {
+    super(data, parser, [], name);
+    this.parser = parser;
+  }
+  /**
+  Define a language from a parser.
+  */
+  static define(spec) {
+    let data = defineLanguageFacet(spec.languageData);
+    return new LRLanguage(data, spec.parser.configure({
+      props: [languageDataProp.add(type => type.isTop ? data : undefined)]
+    }), spec.name);
+  }
+  /**
+  Create a new instance of this language with a reconfigured
+  version of its parser and optionally a new name.
+  */
+  configure(options, name) {
+    return new LRLanguage(this.data, this.parser.configure(options), name || this.name);
+  }
+  get allowsNesting() {
+    return this.parser.hasWrappers();
+  }
+}
+/**
+Get the syntax tree for a state, which is the current (possibly
+incomplete) parse tree of the active
+[language](https://codemirror.net/6/docs/ref/#language.Language), or the empty tree if there is no
+language available.
+*/
+function syntaxTree(state) {
+  let field = state.field(Language.state, false);
+  return field ? field.tree : Tree.empty;
+}
+// Lezer-style Input object for a Text document.
+class DocInput {
+  constructor(doc, length = doc.length) {
+    this.doc = doc;
+    this.length = length;
+    this.cursorPos = 0;
+    this.string = "";
+    this.cursor = doc.iter();
+  }
+  syncTo(pos) {
+    this.string = this.cursor.next(pos - this.cursorPos).value;
+    this.cursorPos = pos + this.string.length;
+    return this.cursorPos - this.string.length;
+  }
+  chunk(pos) {
+    this.syncTo(pos);
+    return this.string;
+  }
+  get lineChunks() {
+    return true;
+  }
+  read(from, to) {
+    let stringStart = this.cursorPos - this.string.length;
+    if (from < stringStart || to >= this.cursorPos) return this.doc.sliceString(from, to);else return this.string.slice(from - stringStart, to - stringStart);
+  }
+}
+let currentContext = null;
+/**
+A parse context provided to parsers working on the editor content.
+*/
+class ParseContext {
+  constructor(parser,
+  /**
+  The current editor state.
+  */
+  state,
+  /**
+  Tree fragments that can be reused by incremental re-parses.
+  */
+  fragments = [],
+  /**
+  @internal
+  */
+  tree,
+  /**
+  @internal
+  */
+  treeLen,
+  /**
+  The current editor viewport (or some overapproximation
+  thereof). Intended to be used for opportunistically avoiding
+  work (in which case
+  [`skipUntilInView`](https://codemirror.net/6/docs/ref/#language.ParseContext.skipUntilInView)
+  should be called to make sure the parser is restarted when the
+  skipped region becomes visible).
+  */
+  viewport,
+  /**
+  @internal
+  */
+  skipped,
+  /**
+  This is where skipping parsers can register a promise that,
+  when resolved, will schedule a new parse. It is cleared when
+  the parse worker picks up the promise. @internal
+  */
+  scheduleOn) {
+    this.parser = parser;
+    this.state = state;
+    this.fragments = fragments;
+    this.tree = tree;
+    this.treeLen = treeLen;
+    this.viewport = viewport;
+    this.skipped = skipped;
+    this.scheduleOn = scheduleOn;
+    this.parse = null;
+    /**
+    @internal
+    */
+    this.tempSkipped = [];
+  }
+  /**
+  @internal
+  */
+  static create(parser, state, viewport) {
+    return new ParseContext(parser, state, [], Tree.empty, 0, viewport, [], null);
+  }
+  startParse() {
+    return this.parser.startParse(new DocInput(this.state.doc), this.fragments);
+  }
+  /**
+  @internal
+  */
+  work(until, upto) {
+    if (upto != null && upto >= this.state.doc.length) upto = undefined;
+    if (this.tree != Tree.empty && this.isDone(upto !== null && upto !== void 0 ? upto : this.state.doc.length)) {
+      this.takeTree();
+      return true;
+    }
+    return this.withContext(() => {
+      var _a;
+      if (typeof until == "number") {
+        let endTime = Date.now() + until;
+        until = () => Date.now() > endTime;
+      }
+      if (!this.parse) this.parse = this.startParse();
+      if (upto != null && (this.parse.stoppedAt == null || this.parse.stoppedAt > upto) && upto < this.state.doc.length) this.parse.stopAt(upto);
+      for (;;) {
+        let done = this.parse.advance();
+        if (done) {
+          this.fragments = this.withoutTempSkipped(TreeFragment.addTree(done, this.fragments, this.parse.stoppedAt != null));
+          this.treeLen = (_a = this.parse.stoppedAt) !== null && _a !== void 0 ? _a : this.state.doc.length;
+          this.tree = done;
+          this.parse = null;
+          if (this.treeLen < (upto !== null && upto !== void 0 ? upto : this.state.doc.length)) this.parse = this.startParse();else return true;
+        }
+        if (until()) return false;
+      }
+    });
+  }
+  /**
+  @internal
+  */
+  takeTree() {
+    let pos, tree;
+    if (this.parse && (pos = this.parse.parsedPos) >= this.treeLen) {
+      if (this.parse.stoppedAt == null || this.parse.stoppedAt > pos) this.parse.stopAt(pos);
+      this.withContext(() => {
+        while (!(tree = this.parse.advance())) {}
+      });
+      this.treeLen = pos;
+      this.tree = tree;
+      this.fragments = this.withoutTempSkipped(TreeFragment.addTree(this.tree, this.fragments, true));
+      this.parse = null;
+    }
+  }
+  withContext(f) {
+    let prev = currentContext;
+    currentContext = this;
+    try {
+      return f();
+    } finally {
+      currentContext = prev;
+    }
+  }
+  withoutTempSkipped(fragments) {
+    for (let r; r = this.tempSkipped.pop();) fragments = cutFragments(fragments, r.from, r.to);
+    return fragments;
+  }
+  /**
+  @internal
+  */
+  changes(changes, newState) {
+    let {
+      fragments,
+      tree,
+      treeLen,
+      viewport,
+      skipped
+    } = this;
+    this.takeTree();
+    if (!changes.empty) {
+      let ranges = [];
+      changes.iterChangedRanges((fromA, toA, fromB, toB) => ranges.push({
+        fromA,
+        toA,
+        fromB,
+        toB
+      }));
+      fragments = TreeFragment.applyChanges(fragments, ranges);
+      tree = Tree.empty;
+      treeLen = 0;
+      viewport = {
+        from: changes.mapPos(viewport.from, -1),
+        to: changes.mapPos(viewport.to, 1)
+      };
+      if (this.skipped.length) {
+        skipped = [];
+        for (let r of this.skipped) {
+          let from = changes.mapPos(r.from, 1),
+            to = changes.mapPos(r.to, -1);
+          if (from < to) skipped.push({
+            from,
+            to
+          });
+        }
+      }
+    }
+    return new ParseContext(this.parser, newState, fragments, tree, treeLen, viewport, skipped, this.scheduleOn);
+  }
+  /**
+  @internal
+  */
+  updateViewport(viewport) {
+    if (this.viewport.from == viewport.from && this.viewport.to == viewport.to) return false;
+    this.viewport = viewport;
+    let startLen = this.skipped.length;
+    for (let i = 0; i < this.skipped.length; i++) {
+      let {
+        from,
+        to
+      } = this.skipped[i];
+      if (from < viewport.to && to > viewport.from) {
+        this.fragments = cutFragments(this.fragments, from, to);
+        this.skipped.splice(i--, 1);
+      }
+    }
+    if (this.skipped.length >= startLen) return false;
+    this.reset();
+    return true;
+  }
+  /**
+  @internal
+  */
+  reset() {
+    if (this.parse) {
+      this.takeTree();
+      this.parse = null;
+    }
+  }
+  /**
+  Notify the parse scheduler that the given region was skipped
+  because it wasn't in view, and the parse should be restarted
+  when it comes into view.
+  */
+  skipUntilInView(from, to) {
+    this.skipped.push({
+      from,
+      to
+    });
+  }
+  /**
+  Returns a parser intended to be used as placeholder when
+  asynchronously loading a nested parser. It'll skip its input and
+  mark it as not-really-parsed, so that the next update will parse
+  it again.
+  
+  When `until` is given, a reparse will be scheduled when that
+  promise resolves.
+  */
+  static getSkippingParser(until) {
+    return new class extends Parser {
+      createParse(input, fragments, ranges) {
+        let from = ranges[0].from,
+          to = ranges[ranges.length - 1].to;
+        let parser = {
+          parsedPos: from,
+          advance() {
+            let cx = currentContext;
+            if (cx) {
+              for (let r of ranges) cx.tempSkipped.push(r);
+              if (until) cx.scheduleOn = cx.scheduleOn ? Promise.all([cx.scheduleOn, until]) : until;
+            }
+            this.parsedPos = to;
+            return new Tree(NodeType.none, [], [], to - from);
+          },
+          stoppedAt: null,
+          stopAt() {}
+        };
+        return parser;
+      }
+    }();
+  }
+  /**
+  @internal
+  */
+  isDone(upto) {
+    upto = Math.min(upto, this.state.doc.length);
+    let frags = this.fragments;
+    return this.treeLen >= upto && frags.length && frags[0].from == 0 && frags[0].to >= upto;
+  }
+  /**
+  Get the context for the current parse, or `null` if no editor
+  parse is in progress.
+  */
+  static get() {
+    return currentContext;
+  }
+}
+function cutFragments(fragments, from, to) {
+  return TreeFragment.applyChanges(fragments, [{
+    fromA: from,
+    toA: to,
+    fromB: from,
+    toB: to
+  }]);
+}
+class LanguageState {
+  constructor(
+  // A mutable parse state that is used to preserve work done during
+  // the lifetime of a state when moving to the next state.
+  context) {
+    this.context = context;
+    this.tree = context.tree;
+  }
+  apply(tr) {
+    if (!tr.docChanged && this.tree == this.context.tree) return this;
+    let newCx = this.context.changes(tr.changes, tr.state);
+    // If the previous parse wasn't done, go forward only up to its
+    // end position or the end of the viewport, to avoid slowing down
+    // state updates with parse work beyond the viewport.
+    let upto = this.context.treeLen == tr.startState.doc.length ? undefined : Math.max(tr.changes.mapPos(this.context.treeLen), newCx.viewport.to);
+    if (!newCx.work(20 /* Work.Apply */, upto)) newCx.takeTree();
+    return new LanguageState(newCx);
+  }
+  static init(state) {
+    let vpTo = Math.min(3000 /* Work.InitViewport */, state.doc.length);
+    let parseState = ParseContext.create(state.facet(language).parser, state, {
+      from: 0,
+      to: vpTo
+    });
+    if (!parseState.work(20 /* Work.Apply */, vpTo)) parseState.takeTree();
+    return new LanguageState(parseState);
+  }
+}
+Language.state = /*@__PURE__*/StateField.define({
+  create: LanguageState.init,
+  update(value, tr) {
+    for (let e of tr.effects) if (e.is(Language.setState)) return e.value;
+    if (tr.startState.facet(language) != tr.state.facet(language)) return LanguageState.init(tr.state);
+    return value.apply(tr);
+  }
+});
+let requestIdle = callback => {
+  let timeout = setTimeout(() => callback(), 500 /* Work.MaxPause */);
+  return () => clearTimeout(timeout);
+};
+if (typeof requestIdleCallback != "undefined") requestIdle = callback => {
+  let idle = -1,
+    timeout = setTimeout(() => {
+      idle = requestIdleCallback(callback, {
+        timeout: 500 /* Work.MaxPause */ - 100 /* Work.MinPause */
+      });
+    }, 100 /* Work.MinPause */);
+  return () => idle < 0 ? clearTimeout(timeout) : cancelIdleCallback(idle);
+};
+const isInputPending = typeof navigator != "undefined" && ((_a = navigator.scheduling) === null || _a === void 0 ? void 0 : _a.isInputPending) ? () => navigator.scheduling.isInputPending() : null;
+const parseWorker = /*@__PURE__*/ViewPlugin.fromClass(class ParseWorker {
+  constructor(view) {
+    this.view = view;
+    this.working = null;
+    this.workScheduled = 0;
+    // End of the current time chunk
+    this.chunkEnd = -1;
+    // Milliseconds of budget left for this chunk
+    this.chunkBudget = -1;
+    this.work = this.work.bind(this);
+    this.scheduleWork();
+  }
+  update(update) {
+    let cx = this.view.state.field(Language.state).context;
+    if (cx.updateViewport(update.view.viewport) || this.view.viewport.to > cx.treeLen) this.scheduleWork();
+    if (update.docChanged) {
+      if (this.view.hasFocus) this.chunkBudget += 50 /* Work.ChangeBonus */;
+      this.scheduleWork();
+    }
+    this.checkAsyncSchedule(cx);
+  }
+  scheduleWork() {
+    if (this.working) return;
+    let {
+        state
+      } = this.view,
+      field = state.field(Language.state);
+    if (field.tree != field.context.tree || !field.context.isDone(state.doc.length)) this.working = requestIdle(this.work);
+  }
+  work(deadline) {
+    this.working = null;
+    let now = Date.now();
+    if (this.chunkEnd < now && (this.chunkEnd < 0 || this.view.hasFocus)) {
+      // Start a new chunk
+      this.chunkEnd = now + 30000 /* Work.ChunkTime */;
+      this.chunkBudget = 3000 /* Work.ChunkBudget */;
+    }
+
+    if (this.chunkBudget <= 0) return; // No more budget
+    let {
+        state,
+        viewport: {
+          to: vpTo
+        }
+      } = this.view,
+      field = state.field(Language.state);
+    if (field.tree == field.context.tree && field.context.isDone(vpTo + 100000 /* Work.MaxParseAhead */)) return;
+    let endTime = Date.now() + Math.min(this.chunkBudget, 100 /* Work.Slice */, deadline && !isInputPending ? Math.max(25 /* Work.MinSlice */, deadline.timeRemaining() - 5) : 1e9);
+    let viewportFirst = field.context.treeLen < vpTo && state.doc.length > vpTo + 1000;
+    let done = field.context.work(() => {
+      return isInputPending && isInputPending() || Date.now() > endTime;
+    }, vpTo + (viewportFirst ? 0 : 100000 /* Work.MaxParseAhead */));
+    this.chunkBudget -= Date.now() - now;
+    if (done || this.chunkBudget <= 0) {
+      field.context.takeTree();
+      this.view.dispatch({
+        effects: Language.setState.of(new LanguageState(field.context))
+      });
+    }
+    if (this.chunkBudget > 0 && !(done && !viewportFirst)) this.scheduleWork();
+    this.checkAsyncSchedule(field.context);
+  }
+  checkAsyncSchedule(cx) {
+    if (cx.scheduleOn) {
+      this.workScheduled++;
+      cx.scheduleOn.then(() => this.scheduleWork()).catch(err => logException(this.view.state, err)).then(() => this.workScheduled--);
+      cx.scheduleOn = null;
+    }
+  }
+  destroy() {
+    if (this.working) this.working();
+  }
+  isWorking() {
+    return !!(this.working || this.workScheduled > 0);
+  }
+}, {
+  eventHandlers: {
+    focus() {
+      this.scheduleWork();
+    }
+  }
+});
+/**
+The facet used to associate a language with an editor state. Used
+by `Language` object's `extension` property (so you don't need to
+manually wrap your languages in this). Can be used to access the
+current language on a state.
+*/
+const language = /*@__PURE__*/Facet.define({
+  combine(languages) {
+    return languages.length ? languages[0] : null;
+  },
+  enables: language => [Language.state, parseWorker, EditorView.contentAttributes.compute([language], state => {
+    let lang = state.facet(language);
+    return lang && lang.name ? {
+      "data-language": lang.name
+    } : {};
+  })]
+});
+/**
+This class bundles a [language](https://codemirror.net/6/docs/ref/#language.Language) with an
+optional set of supporting extensions. Language packages are
+encouraged to export a function that optionally takes a
+configuration object and returns a `LanguageSupport` instance, as
+the main way for client code to use the package.
+*/
+class LanguageSupport {
+  /**
+  Create a language support object.
+  */
+  constructor(
+  /**
+  The language object.
+  */
+  language,
+  /**
+  An optional set of supporting extensions. When nesting a
+  language in another language, the outer language is encouraged
+  to include the supporting extensions for its inner languages
+  in its own set of support extensions.
+  */
+  support = []) {
+    this.language = language;
+    this.support = support;
+    this.extension = [language, support];
+  }
+}
+/**
+Language descriptions are used to store metadata about languages
+and to dynamically load them. Their main role is finding the
+appropriate language for a filename or dynamically loading nested
+parsers.
+*/
+class LanguageDescription {
+  constructor(
+  /**
+  The name of this language.
+  */
+  name,
+  /**
+  Alternative names for the mode (lowercased, includes `this.name`).
+  */
+  alias,
+  /**
+  File extensions associated with this language.
+  */
+  extensions,
+  /**
+  Optional filename pattern that should be associated with this
+  language.
+  */
+  filename, loadFunc,
+  /**
+  If the language has been loaded, this will hold its value.
+  */
+  support = undefined) {
+    this.name = name;
+    this.alias = alias;
+    this.extensions = extensions;
+    this.filename = filename;
+    this.loadFunc = loadFunc;
+    this.support = support;
+    this.loading = null;
+  }
+  /**
+  Start loading the the language. Will return a promise that
+  resolves to a [`LanguageSupport`](https://codemirror.net/6/docs/ref/#language.LanguageSupport)
+  object when the language successfully loads.
+  */
+  load() {
+    return this.loading || (this.loading = this.loadFunc().then(support => this.support = support, err => {
+      this.loading = null;
+      throw err;
+    }));
+  }
+  /**
+  Create a language description.
+  */
+  static of(spec) {
+    let {
+      load,
+      support
+    } = spec;
+    if (!load) {
+      if (!support) throw new RangeError("Must pass either 'load' or 'support' to LanguageDescription.of");
+      load = () => Promise.resolve(support);
+    }
+    return new LanguageDescription(spec.name, (spec.alias || []).concat(spec.name).map(s => s.toLowerCase()), spec.extensions || [], spec.filename, load, support);
+  }
+  /**
+  Look for a language in the given array of descriptions that
+  matches the filename. Will first match
+  [`filename`](https://codemirror.net/6/docs/ref/#language.LanguageDescription.filename) patterns,
+  and then [extensions](https://codemirror.net/6/docs/ref/#language.LanguageDescription.extensions),
+  and return the first language that matches.
+  */
+  static matchFilename(descs, filename) {
+    for (let d of descs) if (d.filename && d.filename.test(filename)) return d;
+    let ext = /\.([^.]+)$/.exec(filename);
+    if (ext) for (let d of descs) if (d.extensions.indexOf(ext[1]) > -1) return d;
+    return null;
+  }
+  /**
+  Look for a language whose name or alias matches the the given
+  name (case-insensitively). If `fuzzy` is true, and no direct
+  matchs is found, this'll also search for a language whose name
+  or alias occurs in the string (for names shorter than three
+  characters, only when surrounded by non-word characters).
+  */
+  static matchLanguageName(descs, name, fuzzy = true) {
+    name = name.toLowerCase();
+    for (let d of descs) if (d.alias.some(a => a == name)) return d;
+    if (fuzzy) for (let d of descs) for (let a of d.alias) {
+      let found = name.indexOf(a);
+      if (found > -1 && (a.length > 2 || !/\w/.test(name[found - 1]) && !/\w/.test(name[found + a.length]))) return d;
+    }
+    return null;
+  }
+}
+
+/**
+Facet that defines a way to provide a function that computes the
+appropriate indentation depth, as a column number (see
+[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)), at the start of a given
+line. A return value of `null` indicates no indentation can be
+determined, and the line should inherit the indentation of the one
+above it. A return value of `undefined` defers to the next indent
+service.
+*/
+const indentService = /*@__PURE__*/Facet.define();
+/**
+Facet for overriding the unit by which indentation happens.
+Should be a string consisting either entirely of spaces or
+entirely of tabs. When not set, this defaults to 2 spaces.
+*/
+const indentUnit = /*@__PURE__*/Facet.define({
+  combine: values => {
+    if (!values.length) return "  ";
+    if (!/^(?: +|\t+)$/.test(values[0])) throw new Error("Invalid indent unit: " + JSON.stringify(values[0]));
+    return values[0];
+  }
+});
+/**
+Return the _column width_ of an indent unit in the state.
+Determined by the [`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit)
+facet, and [`tabSize`](https://codemirror.net/6/docs/ref/#state.EditorState^tabSize) when that
+contains tabs.
+*/
+function getIndentUnit(state) {
+  let unit = state.facet(indentUnit);
+  return unit.charCodeAt(0) == 9 ? state.tabSize * unit.length : unit.length;
+}
+/**
+Create an indentation string that covers columns 0 to `cols`.
+Will use tabs for as much of the columns as possible when the
+[`indentUnit`](https://codemirror.net/6/docs/ref/#language.indentUnit) facet contains
+tabs.
+*/
+function indentString(state, cols) {
+  let result = "",
+    ts = state.tabSize;
+  if (state.facet(indentUnit).charCodeAt(0) == 9) while (cols >= ts) {
+    result += "\t";
+    cols -= ts;
+  }
+  for (let i = 0; i < cols; i++) result += " ";
+  return result;
+}
+/**
+Get the indentation, as a column number, at the given position.
+Will first consult any [indent services](https://codemirror.net/6/docs/ref/#language.indentService)
+that are registered, and if none of those return an indentation,
+this will check the syntax tree for the [indent node
+prop](https://codemirror.net/6/docs/ref/#language.indentNodeProp) and use that if found. Returns a
+number when an indentation could be determined, and null
+otherwise.
+*/
+function getIndentation(context, pos) {
+  if (context instanceof EditorState) context = new IndentContext(context);
+  for (let service of context.state.facet(indentService)) {
+    let result = service(context, pos);
+    if (result !== undefined) return result;
+  }
+  let tree = syntaxTree(context.state);
+  return tree ? syntaxIndentation(context, tree, pos) : null;
+}
+/**
+Indentation contexts are used when calling [indentation
+services](https://codemirror.net/6/docs/ref/#language.indentService). They provide helper utilities
+useful in indentation logic, and can selectively override the
+indentation reported for some lines.
+*/
+class IndentContext {
+  /**
+  Create an indent context.
+  */
+  constructor(
+  /**
+  The editor state.
+  */
+  state,
+  /**
+  @internal
+  */
+  options = {}) {
+    this.state = state;
+    this.options = options;
+    this.unit = getIndentUnit(state);
+  }
+  /**
+  Get a description of the line at the given position, taking
+  [simulated line
+  breaks](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
+  into account. If there is such a break at `pos`, the `bias`
+  argument determines whether the part of the line line before or
+  after the break is used.
+  */
+  lineAt(pos, bias = 1) {
+    let line = this.state.doc.lineAt(pos);
+    let {
+      simulateBreak,
+      simulateDoubleBreak
+    } = this.options;
+    if (simulateBreak != null && simulateBreak >= line.from && simulateBreak <= line.to) {
+      if (simulateDoubleBreak && simulateBreak == pos) return {
+        text: "",
+        from: pos
+      };else if (bias < 0 ? simulateBreak < pos : simulateBreak <= pos) return {
+        text: line.text.slice(simulateBreak - line.from),
+        from: simulateBreak
+      };else return {
+        text: line.text.slice(0, simulateBreak - line.from),
+        from: line.from
+      };
+    }
+    return line;
+  }
+  /**
+  Get the text directly after `pos`, either the entire line
+  or the next 100 characters, whichever is shorter.
+  */
+  textAfterPos(pos, bias = 1) {
+    if (this.options.simulateDoubleBreak && pos == this.options.simulateBreak) return "";
+    let {
+      text,
+      from
+    } = this.lineAt(pos, bias);
+    return text.slice(pos - from, Math.min(text.length, pos + 100 - from));
+  }
+  /**
+  Find the column for the given position.
+  */
+  column(pos, bias = 1) {
+    let {
+      text,
+      from
+    } = this.lineAt(pos, bias);
+    let result = this.countColumn(text, pos - from);
+    let override = this.options.overrideIndentation ? this.options.overrideIndentation(from) : -1;
+    if (override > -1) result += override - this.countColumn(text, text.search(/\S|$/));
+    return result;
+  }
+  /**
+  Find the column position (taking tabs into account) of the given
+  position in the given string.
+  */
+  countColumn(line, pos = line.length) {
+    return countColumn(line, this.state.tabSize, pos);
+  }
+  /**
+  Find the indentation column of the line at the given point.
+  */
+  lineIndent(pos, bias = 1) {
+    let {
+      text,
+      from
+    } = this.lineAt(pos, bias);
+    let override = this.options.overrideIndentation;
+    if (override) {
+      let overriden = override(from);
+      if (overriden > -1) return overriden;
+    }
+    return this.countColumn(text, text.search(/\S|$/));
+  }
+  /**
+  Returns the [simulated line
+  break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
+  for this context, if any.
+  */
+  get simulatedBreak() {
+    return this.options.simulateBreak || null;
+  }
+}
+/**
+A syntax tree node prop used to associate indentation strategies
+with node types. Such a strategy is a function from an indentation
+context to a column number (see also
+[`indentString`](https://codemirror.net/6/docs/ref/#language.indentString)) or null, where null
+indicates that no definitive indentation can be determined.
+*/
+const indentNodeProp = /*@__PURE__*/new NodeProp();
+// Compute the indentation for a given position from the syntax tree.
+function syntaxIndentation(cx, ast, pos) {
+  return indentFrom(ast.resolveInner(pos).enterUnfinishedNodesBefore(pos), pos, cx);
+}
+function ignoreClosed(cx) {
+  return cx.pos == cx.options.simulateBreak && cx.options.simulateDoubleBreak;
+}
+function indentStrategy(tree) {
+  let strategy = tree.type.prop(indentNodeProp);
+  if (strategy) return strategy;
+  let first = tree.firstChild,
+    close;
+  if (first && (close = first.type.prop(NodeProp.closedBy))) {
+    let last = tree.lastChild,
+      closed = last && close.indexOf(last.name) > -1;
+    return cx => delimitedStrategy(cx, true, 1, undefined, closed && !ignoreClosed(cx) ? last.from : undefined);
+  }
+  return tree.parent == null ? topIndent : null;
+}
+function indentFrom(node, pos, base) {
+  for (; node; node = node.parent) {
+    let strategy = indentStrategy(node);
+    if (strategy) return strategy(TreeIndentContext.create(base, pos, node));
+  }
+  return null;
+}
+function topIndent() {
+  return 0;
+}
+/**
+Objects of this type provide context information and helper
+methods to indentation functions registered on syntax nodes.
+*/
+class TreeIndentContext extends IndentContext {
+  constructor(base,
+  /**
+  The position at which indentation is being computed.
+  */
+  pos,
+  /**
+  The syntax tree node to which the indentation strategy
+  applies.
+  */
+  node) {
+    super(base.state, base.options);
+    this.base = base;
+    this.pos = pos;
+    this.node = node;
+  }
+  /**
+  @internal
+  */
+  static create(base, pos, node) {
+    return new TreeIndentContext(base, pos, node);
+  }
+  /**
+  Get the text directly after `this.pos`, either the entire line
+  or the next 100 characters, whichever is shorter.
+  */
+  get textAfter() {
+    return this.textAfterPos(this.pos);
+  }
+  /**
+  Get the indentation at the reference line for `this.node`, which
+  is the line on which it starts, unless there is a node that is
+  _not_ a parent of this node covering the start of that line. If
+  so, the line at the start of that node is tried, again skipping
+  on if it is covered by another such node.
+  */
+  get baseIndent() {
+    let line = this.state.doc.lineAt(this.node.from);
+    // Skip line starts that are covered by a sibling (or cousin, etc)
+    for (;;) {
+      let atBreak = this.node.resolve(line.from);
+      while (atBreak.parent && atBreak.parent.from == atBreak.from) atBreak = atBreak.parent;
+      if (isParent(atBreak, this.node)) break;
+      line = this.state.doc.lineAt(atBreak.from);
+    }
+    return this.lineIndent(line.from);
+  }
+  /**
+  Continue looking for indentations in the node's parent nodes,
+  and return the result of that.
+  */
+  continue() {
+    let parent = this.node.parent;
+    return parent ? indentFrom(parent, this.pos, this.base) : 0;
+  }
+}
+function isParent(parent, of) {
+  for (let cur = of; cur; cur = cur.parent) if (parent == cur) return true;
+  return false;
+}
+// Check whether a delimited node is aligned (meaning there are
+// non-skipped nodes on the same line as the opening delimiter). And
+// if so, return the opening token.
+function bracketedAligned(context) {
+  let tree = context.node;
+  let openToken = tree.childAfter(tree.from),
+    last = tree.lastChild;
+  if (!openToken) return null;
+  let sim = context.options.simulateBreak;
+  let openLine = context.state.doc.lineAt(openToken.from);
+  let lineEnd = sim == null || sim <= openLine.from ? openLine.to : Math.min(openLine.to, sim);
+  for (let pos = openToken.to;;) {
+    let next = tree.childAfter(pos);
+    if (!next || next == last) return null;
+    if (!next.type.isSkipped) return next.from < lineEnd ? openToken : null;
+    pos = next.to;
+  }
+}
+/**
+An indentation strategy for delimited (usually bracketed) nodes.
+Will, by default, indent one unit more than the parent's base
+indent unless the line starts with a closing token. When `align`
+is true and there are non-skipped nodes on the node's opening
+line, the content of the node will be aligned with the end of the
+opening node, like this:
+
+    foo(bar,
+        baz)
+*/
+function delimitedIndent({
+  closing,
+  align = true,
+  units = 1
+}) {
+  return context => delimitedStrategy(context, align, units, closing);
+}
+function delimitedStrategy(context, align, units, closing, closedAt) {
+  let after = context.textAfter,
+    space = after.match(/^\s*/)[0].length;
+  let closed = closing && after.slice(space, space + closing.length) == closing || closedAt == context.pos + space;
+  let aligned = align ? bracketedAligned(context) : null;
+  if (aligned) return closed ? context.column(aligned.from) : context.column(aligned.to);
+  return context.baseIndent + (closed ? 0 : context.unit * units);
+}
+/**
+An indentation strategy that aligns a node's content to its base
+indentation.
+*/
+const flatIndent = context => context.baseIndent;
+/**
+Creates an indentation strategy that, by default, indents
+continued lines one unit more than the node's base indentation.
+You can provide `except` to prevent indentation of lines that
+match a pattern (for example `/^else\b/` in `if`/`else`
+constructs), and you can change the amount of units used with the
+`units` option.
+*/
+function continuedIndent({
+  except,
+  units = 1
+} = {}) {
+  return context => {
+    let matchExcept = except && except.test(context.textAfter);
+    return context.baseIndent + (matchExcept ? 0 : units * context.unit);
+  };
+}
+const DontIndentBeyond = 200;
+/**
+Enables reindentation on input. When a language defines an
+`indentOnInput` field in its [language
+data](https://codemirror.net/6/docs/ref/#state.EditorState.languageDataAt), which must hold a regular
+expression, the line at the cursor will be reindented whenever new
+text is typed and the input from the start of the line up to the
+cursor matches that regexp.
+
+To avoid unneccesary reindents, it is recommended to start the
+regexp with `^` (usually followed by `\s*`), and end it with `$`.
+For example, `/^\s*\}$/` will reindent when a closing brace is
+added at the start of a line.
+*/
+function indentOnInput() {
+  return EditorState.transactionFilter.of(tr => {
+    if (!tr.docChanged || !tr.isUserEvent("input.type") && !tr.isUserEvent("input.complete")) return tr;
+    let rules = tr.startState.languageDataAt("indentOnInput", tr.startState.selection.main.head);
+    if (!rules.length) return tr;
+    let doc = tr.newDoc,
+      {
+        head
+      } = tr.newSelection.main,
+      line = doc.lineAt(head);
+    if (head > line.from + DontIndentBeyond) return tr;
+    let lineStart = doc.sliceString(line.from, head);
+    if (!rules.some(r => r.test(lineStart))) return tr;
+    let {
+        state
+      } = tr,
+      last = -1,
+      changes = [];
+    for (let {
+      head
+    } of state.selection.ranges) {
+      let line = state.doc.lineAt(head);
+      if (line.from == last) continue;
+      last = line.from;
+      let indent = getIndentation(state, line.from);
+      if (indent == null) continue;
+      let cur = /^\s*/.exec(line.text)[0];
+      let norm = indentString(state, indent);
+      if (cur != norm) changes.push({
+        from: line.from,
+        to: line.from + cur.length,
+        insert: norm
+      });
+    }
+    return changes.length ? [tr, {
+      changes,
+      sequential: true
+    }] : tr;
+  });
+}
+
+/**
+A facet that registers a code folding service. When called with
+the extent of a line, such a function should return a foldable
+range that starts on that line (but continues beyond it), if one
+can be found.
+*/
+const foldService = /*@__PURE__*/Facet.define();
+/**
+This node prop is used to associate folding information with
+syntax node types. Given a syntax node, it should check whether
+that tree is foldable and return the range that can be collapsed
+when it is.
+*/
+const foldNodeProp = /*@__PURE__*/new NodeProp();
+/**
+[Fold](https://codemirror.net/6/docs/ref/#language.foldNodeProp) function that folds everything but
+the first and the last child of a syntax node. Useful for nodes
+that start and end with delimiters.
+*/
+function foldInside(node) {
+  let first = node.firstChild,
+    last = node.lastChild;
+  return first && first.to < last.from ? {
+    from: first.to,
+    to: last.type.isError ? node.to : last.from
+  } : null;
+}
+function syntaxFolding(state, start, end) {
+  let tree = syntaxTree(state);
+  if (tree.length < end) return null;
+  let inner = tree.resolveInner(end, 1);
+  let found = null;
+  for (let cur = inner; cur; cur = cur.parent) {
+    if (cur.to <= end || cur.from > end) continue;
+    if (found && cur.from < start) break;
+    let prop = cur.type.prop(foldNodeProp);
+    if (prop && (cur.to < tree.length - 50 || tree.length == state.doc.length || !isUnfinished(cur))) {
+      let value = prop(cur, state);
+      if (value && value.from <= end && value.from >= start && value.to > end) found = value;
+    }
+  }
+  return found;
+}
+function isUnfinished(node) {
+  let ch = node.lastChild;
+  return ch && ch.to == node.to && ch.type.isError;
+}
+/**
+Check whether the given line is foldable. First asks any fold
+services registered through
+[`foldService`](https://codemirror.net/6/docs/ref/#language.foldService), and if none of them return
+a result, tries to query the [fold node
+prop](https://codemirror.net/6/docs/ref/#language.foldNodeProp) of syntax nodes that cover the end
+of the line.
+*/
+function foldable(state, lineStart, lineEnd) {
+  for (let service of state.facet(foldService)) {
+    let result = service(state, lineStart, lineEnd);
+    if (result) return result;
+  }
+  return syntaxFolding(state, lineStart, lineEnd);
+}
+function mapRange(range, mapping) {
+  let from = mapping.mapPos(range.from, 1),
+    to = mapping.mapPos(range.to, -1);
+  return from >= to ? undefined : {
+    from,
+    to
+  };
+}
+/**
+State effect that can be attached to a transaction to fold the
+given range. (You probably only need this in exceptional
+circumstances—usually you'll just want to let
+[`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode) and the [fold
+gutter](https://codemirror.net/6/docs/ref/#language.foldGutter) create the transactions.)
+*/
+const foldEffect = /*@__PURE__*/StateEffect.define({
+  map: mapRange
+});
+/**
+State effect that unfolds the given range (if it was folded).
+*/
+const unfoldEffect = /*@__PURE__*/StateEffect.define({
+  map: mapRange
+});
+function selectedLines(view) {
+  let lines = [];
+  for (let {
+    head
+  } of view.state.selection.ranges) {
+    if (lines.some(l => l.from <= head && l.to >= head)) continue;
+    lines.push(view.lineBlockAt(head));
+  }
+  return lines;
+}
+/**
+The state field that stores the folded ranges (as a [decoration
+set](https://codemirror.net/6/docs/ref/#view.DecorationSet)). Can be passed to
+[`EditorState.toJSON`](https://codemirror.net/6/docs/ref/#state.EditorState.toJSON) and
+[`fromJSON`](https://codemirror.net/6/docs/ref/#state.EditorState^fromJSON) to serialize the fold
+state.
+*/
+const foldState = /*@__PURE__*/StateField.define({
+  create() {
+    return Decoration.none;
+  },
+  update(folded, tr) {
+    folded = folded.map(tr.changes);
+    for (let e of tr.effects) {
+      if (e.is(foldEffect) && !foldExists(folded, e.value.from, e.value.to)) folded = folded.update({
+        add: [foldWidget.range(e.value.from, e.value.to)]
+      });else if (e.is(unfoldEffect)) folded = folded.update({
+        filter: (from, to) => e.value.from != from || e.value.to != to,
+        filterFrom: e.value.from,
+        filterTo: e.value.to
+      });
+    }
+    // Clear folded ranges that cover the selection head
+    if (tr.selection) {
+      let onSelection = false,
+        {
+          head
+        } = tr.selection.main;
+      folded.between(head, head, (a, b) => {
+        if (a < head && b > head) onSelection = true;
+      });
+      if (onSelection) folded = folded.update({
+        filterFrom: head,
+        filterTo: head,
+        filter: (a, b) => b <= head || a >= head
+      });
+    }
+    return folded;
+  },
+  provide: f => EditorView.decorations.from(f),
+  toJSON(folded, state) {
+    let ranges = [];
+    folded.between(0, state.doc.length, (from, to) => {
+      ranges.push(from, to);
+    });
+    return ranges;
+  },
+  fromJSON(value) {
+    if (!Array.isArray(value) || value.length % 2) throw new RangeError("Invalid JSON for fold state");
+    let ranges = [];
+    for (let i = 0; i < value.length;) {
+      let from = value[i++],
+        to = value[i++];
+      if (typeof from != "number" || typeof to != "number") throw new RangeError("Invalid JSON for fold state");
+      ranges.push(foldWidget.range(from, to));
+    }
+    return Decoration.set(ranges, true);
+  }
+});
+function findFold(state, from, to) {
+  var _a;
+  let found = null;
+  (_a = state.field(foldState, false)) === null || _a === void 0 ? void 0 : _a.between(from, to, (from, to) => {
+    if (!found || found.from > from) found = {
+      from,
+      to
+    };
+  });
+  return found;
+}
+function foldExists(folded, from, to) {
+  let found = false;
+  folded.between(from, from, (a, b) => {
+    if (a == from && b == to) found = true;
+  });
+  return found;
+}
+function maybeEnable(state, other) {
+  return state.field(foldState, false) ? other : other.concat(StateEffect.appendConfig.of(codeFolding()));
+}
+/**
+Fold the lines that are selected, if possible.
+*/
+const foldCode = view => {
+  for (let line of selectedLines(view)) {
+    let range = foldable(view.state, line.from, line.to);
+    if (range) {
+      view.dispatch({
+        effects: maybeEnable(view.state, [foldEffect.of(range), announceFold(view, range)])
+      });
+      return true;
+    }
+  }
+  return false;
+};
+/**
+Unfold folded ranges on selected lines.
+*/
+const unfoldCode = view => {
+  if (!view.state.field(foldState, false)) return false;
+  let effects = [];
+  for (let line of selectedLines(view)) {
+    let folded = findFold(view.state, line.from, line.to);
+    if (folded) effects.push(unfoldEffect.of(folded), announceFold(view, folded, false));
+  }
+  if (effects.length) view.dispatch({
+    effects
+  });
+  return effects.length > 0;
+};
+function announceFold(view, range, fold = true) {
+  let lineFrom = view.state.doc.lineAt(range.from).number,
+    lineTo = view.state.doc.lineAt(range.to).number;
+  return EditorView.announce.of(`${view.state.phrase(fold ? "Folded lines" : "Unfolded lines")} ${lineFrom} ${view.state.phrase("to")} ${lineTo}.`);
+}
+/**
+Fold all top-level foldable ranges. Note that, in most cases,
+folding information will depend on the [syntax
+tree](https://codemirror.net/6/docs/ref/#language.syntaxTree), and folding everything may not work
+reliably when the document hasn't been fully parsed (either
+because the editor state was only just initialized, or because the
+document is so big that the parser decided not to parse it
+entirely).
+*/
+const foldAll = view => {
+  let {
+      state
+    } = view,
+    effects = [];
+  for (let pos = 0; pos < state.doc.length;) {
+    let line = view.lineBlockAt(pos),
+      range = foldable(state, line.from, line.to);
+    if (range) effects.push(foldEffect.of(range));
+    pos = (range ? view.lineBlockAt(range.to) : line).to + 1;
+  }
+  if (effects.length) view.dispatch({
+    effects: maybeEnable(view.state, effects)
+  });
+  return !!effects.length;
+};
+/**
+Unfold all folded code.
+*/
+const unfoldAll = view => {
+  let field = view.state.field(foldState, false);
+  if (!field || !field.size) return false;
+  let effects = [];
+  field.between(0, view.state.doc.length, (from, to) => {
+    effects.push(unfoldEffect.of({
+      from,
+      to
+    }));
+  });
+  view.dispatch({
+    effects
+  });
+  return true;
+};
+/**
+Default fold-related key bindings.
+
+ - Ctrl-Shift-[ (Cmd-Alt-[ on macOS): [`foldCode`](https://codemirror.net/6/docs/ref/#language.foldCode).
+ - Ctrl-Shift-] (Cmd-Alt-] on macOS): [`unfoldCode`](https://codemirror.net/6/docs/ref/#language.unfoldCode).
+ - Ctrl-Alt-[: [`foldAll`](https://codemirror.net/6/docs/ref/#language.foldAll).
+ - Ctrl-Alt-]: [`unfoldAll`](https://codemirror.net/6/docs/ref/#language.unfoldAll).
+*/
+const foldKeymap = [{
+  key: "Ctrl-Shift-[",
+  mac: "Cmd-Alt-[",
+  run: foldCode
+}, {
+  key: "Ctrl-Shift-]",
+  mac: "Cmd-Alt-]",
+  run: unfoldCode
+}, {
+  key: "Ctrl-Alt-[",
+  run: foldAll
+}, {
+  key: "Ctrl-Alt-]",
+  run: unfoldAll
+}];
+const defaultConfig = {
+  placeholderDOM: null,
+  placeholderText: "…"
+};
+const foldConfig = /*@__PURE__*/Facet.define({
+  combine(values) {
+    return combineConfig(values, defaultConfig);
+  }
+});
+/**
+Create an extension that configures code folding.
+*/
+function codeFolding(config) {
+  let result = [foldState, baseTheme$1];
+  if (config) result.push(foldConfig.of(config));
+  return result;
+}
+const foldWidget = /*@__PURE__*/Decoration.replace({
+  widget: /*@__PURE__*/new class extends WidgetType {
+    toDOM(view) {
+      let {
+          state
+        } = view,
+        conf = state.facet(foldConfig);
+      let onclick = event => {
+        let line = view.lineBlockAt(view.posAtDOM(event.target));
+        let folded = findFold(view.state, line.from, line.to);
+        if (folded) view.dispatch({
+          effects: unfoldEffect.of(folded)
+        });
+        event.preventDefault();
+      };
+      if (conf.placeholderDOM) return conf.placeholderDOM(view, onclick);
+      let element = document.createElement("span");
+      element.textContent = conf.placeholderText;
+      element.setAttribute("aria-label", state.phrase("folded code"));
+      element.title = state.phrase("unfold");
+      element.className = "cm-foldPlaceholder";
+      element.onclick = onclick;
+      return element;
+    }
+  }()
+});
+const foldGutterDefaults = {
+  openText: "⌄",
+  closedText: "›",
+  markerDOM: null,
+  domEventHandlers: {},
+  foldingChanged: () => false
+};
+class FoldMarker extends GutterMarker {
+  constructor(config, open) {
+    super();
+    this.config = config;
+    this.open = open;
+  }
+  eq(other) {
+    return this.config == other.config && this.open == other.open;
+  }
+  toDOM(view) {
+    if (this.config.markerDOM) return this.config.markerDOM(this.open);
+    let span = document.createElement("span");
+    span.textContent = this.open ? this.config.openText : this.config.closedText;
+    span.title = view.state.phrase(this.open ? "Fold line" : "Unfold line");
+    return span;
+  }
+}
+/**
+Create an extension that registers a fold gutter, which shows a
+fold status indicator before foldable lines (which can be clicked
+to fold or unfold the line).
+*/
+function foldGutter(config = {}) {
+  let fullConfig = Object.assign(Object.assign({}, foldGutterDefaults), config);
+  let canFold = new FoldMarker(fullConfig, true),
+    canUnfold = new FoldMarker(fullConfig, false);
+  let markers = ViewPlugin.fromClass(class {
+    constructor(view) {
+      this.from = view.viewport.from;
+      this.markers = this.buildMarkers(view);
+    }
+    update(update) {
+      if (update.docChanged || update.viewportChanged || update.startState.facet(language) != update.state.facet(language) || update.startState.field(foldState, false) != update.state.field(foldState, false) || syntaxTree(update.startState) != syntaxTree(update.state) || fullConfig.foldingChanged(update)) this.markers = this.buildMarkers(update.view);
+    }
+    buildMarkers(view) {
+      let builder = new RangeSetBuilder();
+      for (let line of view.viewportLineBlocks) {
+        let mark = findFold(view.state, line.from, line.to) ? canUnfold : foldable(view.state, line.from, line.to) ? canFold : null;
+        if (mark) builder.add(line.from, line.from, mark);
+      }
+      return builder.finish();
+    }
+  });
+  let {
+    domEventHandlers
+  } = fullConfig;
+  return [markers, gutter({
+    class: "cm-foldGutter",
+    markers(view) {
+      var _a;
+      return ((_a = view.plugin(markers)) === null || _a === void 0 ? void 0 : _a.markers) || RangeSet.empty;
+    },
+    initialSpacer() {
+      return new FoldMarker(fullConfig, false);
+    },
+    domEventHandlers: Object.assign(Object.assign({}, domEventHandlers), {
+      click: (view, line, event) => {
+        if (domEventHandlers.click && domEventHandlers.click(view, line, event)) return true;
+        let folded = findFold(view.state, line.from, line.to);
+        if (folded) {
+          view.dispatch({
+            effects: unfoldEffect.of(folded)
+          });
+          return true;
+        }
+        let range = foldable(view.state, line.from, line.to);
+        if (range) {
+          view.dispatch({
+            effects: foldEffect.of(range)
+          });
+          return true;
+        }
+        return false;
+      }
+    })
+  }), codeFolding()];
+}
+const baseTheme$1 = /*@__PURE__*/EditorView.baseTheme({
+  ".cm-foldPlaceholder": {
+    backgroundColor: "#eee",
+    border: "1px solid #ddd",
+    color: "#888",
+    borderRadius: ".2em",
+    margin: "0 1px",
+    padding: "0 1px",
+    cursor: "pointer"
+  },
+  ".cm-foldGutter span": {
+    padding: "0 1px",
+    cursor: "pointer"
+  }
+});
+
+/**
+A highlight style associates CSS styles with higlighting
+[tags](https://lezer.codemirror.net/docs/ref#highlight.Tag).
+*/
+class HighlightStyle {
+  constructor(
+  /**
+  The tag styles used to create this highlight style.
+  */
+  specs, options) {
+    this.specs = specs;
+    let modSpec;
+    function def(spec) {
+      let cls = StyleModule.newName();
+      (modSpec || (modSpec = Object.create(null)))["." + cls] = spec;
+      return cls;
+    }
+    const all = typeof options.all == "string" ? options.all : options.all ? def(options.all) : undefined;
+    const scopeOpt = options.scope;
+    this.scope = scopeOpt instanceof Language ? type => type.prop(languageDataProp) == scopeOpt.data : scopeOpt ? type => type == scopeOpt : undefined;
+    this.style = tagHighlighter(specs.map(style => ({
+      tag: style.tag,
+      class: style.class || def(Object.assign({}, style, {
+        tag: null
+      }))
+    })), {
+      all
+    }).style;
+    this.module = modSpec ? new StyleModule(modSpec) : null;
+    this.themeType = options.themeType;
+  }
+  /**
+  Create a highlighter style that associates the given styles to
+  the given tags. The specs must be objects that hold a style tag
+  or array of tags in their `tag` property, and either a single
+  `class` property providing a static CSS class (for highlighter
+  that rely on external styling), or a
+  [`style-mod`](https://github.com/marijnh/style-mod#documentation)-style
+  set of CSS properties (which define the styling for those tags).
+  
+  The CSS rules created for a highlighter will be emitted in the
+  order of the spec's properties. That means that for elements that
+  have multiple tags associated with them, styles defined further
+  down in the list will have a higher CSS precedence than styles
+  defined earlier.
+  */
+  static define(specs, options) {
+    return new HighlightStyle(specs, options || {});
+  }
+}
+const highlighterFacet = /*@__PURE__*/Facet.define();
+const fallbackHighlighter = /*@__PURE__*/Facet.define({
+  combine(values) {
+    return values.length ? [values[0]] : null;
+  }
+});
+function getHighlighters(state) {
+  let main = state.facet(highlighterFacet);
+  return main.length ? main : state.facet(fallbackHighlighter);
+}
+/**
+Wrap a highlighter in an editor extension that uses it to apply
+syntax highlighting to the editor content.
+
+When multiple (non-fallback) styles are provided, the styling
+applied is the union of the classes they emit.
+*/
+function syntaxHighlighting(highlighter, options) {
+  let ext = [treeHighlighter],
+    themeType;
+  if (highlighter instanceof HighlightStyle) {
+    if (highlighter.module) ext.push(EditorView.styleModule.of(highlighter.module));
+    themeType = highlighter.themeType;
+  }
+  if (options === null || options === void 0 ? void 0 : options.fallback) ext.push(fallbackHighlighter.of(highlighter));else if (themeType) ext.push(highlighterFacet.computeN([EditorView.darkTheme], state => {
+    return state.facet(EditorView.darkTheme) == (themeType == "dark") ? [highlighter] : [];
+  }));else ext.push(highlighterFacet.of(highlighter));
+  return ext;
+}
+class TreeHighlighter {
+  constructor(view) {
+    this.markCache = Object.create(null);
+    this.tree = syntaxTree(view.state);
+    this.decorations = this.buildDeco(view, getHighlighters(view.state));
+  }
+  update(update) {
+    let tree = syntaxTree(update.state),
+      highlighters = getHighlighters(update.state);
+    let styleChange = highlighters != getHighlighters(update.startState);
+    if (tree.length < update.view.viewport.to && !styleChange && tree.type == this.tree.type) {
+      this.decorations = this.decorations.map(update.changes);
+    } else if (tree != this.tree || update.viewportChanged || styleChange) {
+      this.tree = tree;
+      this.decorations = this.buildDeco(update.view, highlighters);
+    }
+  }
+  buildDeco(view, highlighters) {
+    if (!highlighters || !this.tree.length) return Decoration.none;
+    let builder = new RangeSetBuilder();
+    for (let {
+      from,
+      to
+    } of view.visibleRanges) {
+      highlightTree(this.tree, highlighters, (from, to, style) => {
+        builder.add(from, to, this.markCache[style] || (this.markCache[style] = Decoration.mark({
+          class: style
+        })));
+      }, from, to);
+    }
+    return builder.finish();
+  }
+}
+const treeHighlighter = /*@__PURE__*/Prec.high( /*@__PURE__*/ViewPlugin.fromClass(TreeHighlighter, {
+  decorations: v => v.decorations
+}));
+/**
+A default highlight style (works well with light themes).
+*/
+const defaultHighlightStyle = /*@__PURE__*/HighlightStyle.define([{
+  tag: tags.meta,
+  color: "#404740"
+}, {
+  tag: tags.link,
+  textDecoration: "underline"
+}, {
+  tag: tags.heading,
+  textDecoration: "underline",
+  fontWeight: "bold"
+}, {
+  tag: tags.emphasis,
+  fontStyle: "italic"
+}, {
+  tag: tags.strong,
+  fontWeight: "bold"
+}, {
+  tag: tags.strikethrough,
+  textDecoration: "line-through"
+}, {
+  tag: tags.keyword,
+  color: "#708"
+}, {
+  tag: [tags.atom, tags.bool, tags.url, tags.contentSeparator, tags.labelName],
+  color: "#219"
+}, {
+  tag: [tags.literal, tags.inserted],
+  color: "#164"
+}, {
+  tag: [tags.string, tags.deleted],
+  color: "#a11"
+}, {
+  tag: [tags.regexp, tags.escape, /*@__PURE__*/tags.special(tags.string)],
+  color: "#e40"
+}, {
+  tag: /*@__PURE__*/tags.definition(tags.variableName),
+  color: "#00f"
+}, {
+  tag: /*@__PURE__*/tags.local(tags.variableName),
+  color: "#30a"
+}, {
+  tag: [tags.typeName, tags.namespace],
+  color: "#085"
+}, {
+  tag: tags.className,
+  color: "#167"
+}, {
+  tag: [/*@__PURE__*/tags.special(tags.variableName), tags.macroName],
+  color: "#256"
+}, {
+  tag: /*@__PURE__*/tags.definition(tags.propertyName),
+  color: "#00c"
+}, {
+  tag: tags.comment,
+  color: "#940"
+}, {
+  tag: tags.invalid,
+  color: "#f00"
+}]);
+const baseTheme = /*@__PURE__*/EditorView.baseTheme({
+  "&.cm-focused .cm-matchingBracket": {
+    backgroundColor: "#328c8252"
+  },
+  "&.cm-focused .cm-nonmatchingBracket": {
+    backgroundColor: "#bb555544"
+  }
+});
+const DefaultScanDist = 10000,
+  DefaultBrackets = "()[]{}";
+const bracketMatchingConfig = /*@__PURE__*/Facet.define({
+  combine(configs) {
+    return combineConfig(configs, {
+      afterCursor: true,
+      brackets: DefaultBrackets,
+      maxScanDistance: DefaultScanDist,
+      renderMatch: defaultRenderMatch
+    });
+  }
+});
+const matchingMark = /*@__PURE__*/Decoration.mark({
+    class: "cm-matchingBracket"
+  }),
+  nonmatchingMark = /*@__PURE__*/Decoration.mark({
+    class: "cm-nonmatchingBracket"
+  });
+function defaultRenderMatch(match) {
+  let decorations = [];
+  let mark = match.matched ? matchingMark : nonmatchingMark;
+  decorations.push(mark.range(match.start.from, match.start.to));
+  if (match.end) decorations.push(mark.range(match.end.from, match.end.to));
+  return decorations;
+}
+const bracketMatchingState = /*@__PURE__*/StateField.define({
+  create() {
+    return Decoration.none;
+  },
+  update(deco, tr) {
+    if (!tr.docChanged && !tr.selection) return deco;
+    let decorations = [];
+    let config = tr.state.facet(bracketMatchingConfig);
+    for (let range of tr.state.selection.ranges) {
+      if (!range.empty) continue;
+      let match = matchBrackets(tr.state, range.head, -1, config) || range.head > 0 && matchBrackets(tr.state, range.head - 1, 1, config) || config.afterCursor && (matchBrackets(tr.state, range.head, 1, config) || range.head < tr.state.doc.length && matchBrackets(tr.state, range.head + 1, -1, config));
+      if (match) decorations = decorations.concat(config.renderMatch(match, tr.state));
+    }
+    return Decoration.set(decorations, true);
+  },
+  provide: f => EditorView.decorations.from(f)
+});
+const bracketMatchingUnique = [bracketMatchingState, baseTheme];
+/**
+Create an extension that enables bracket matching. Whenever the
+cursor is next to a bracket, that bracket and the one it matches
+are highlighted. Or, when no matching bracket is found, another
+highlighting style is used to indicate this.
+*/
+function bracketMatching(config = {}) {
+  return [bracketMatchingConfig.of(config), bracketMatchingUnique];
+}
+/**
+When larger syntax nodes, such as HTML tags, are marked as
+opening/closing, it can be a bit messy to treat the whole node as
+a matchable bracket. This node prop allows you to define, for such
+a node, a ‘handle’—the part of the node that is highlighted, and
+that the cursor must be on to activate highlighting in the first
+place.
+*/
+const bracketMatchingHandle = /*@__PURE__*/new NodeProp();
+function matchingNodes(node, dir, brackets) {
+  let byProp = node.prop(dir < 0 ? NodeProp.openedBy : NodeProp.closedBy);
+  if (byProp) return byProp;
+  if (node.name.length == 1) {
+    let index = brackets.indexOf(node.name);
+    if (index > -1 && index % 2 == (dir < 0 ? 1 : 0)) return [brackets[index + dir]];
+  }
+  return null;
+}
+function findHandle(node) {
+  let hasHandle = node.type.prop(bracketMatchingHandle);
+  return hasHandle ? hasHandle(node.node) : node;
+}
+/**
+Find the matching bracket for the token at `pos`, scanning
+direction `dir`. Only the `brackets` and `maxScanDistance`
+properties are used from `config`, if given. Returns null if no
+bracket was found at `pos`, or a match result otherwise.
+*/
+function matchBrackets(state, pos, dir, config = {}) {
+  let maxScanDistance = config.maxScanDistance || DefaultScanDist,
+    brackets = config.brackets || DefaultBrackets;
+  let tree = syntaxTree(state),
+    node = tree.resolveInner(pos, dir);
+  for (let cur = node; cur; cur = cur.parent) {
+    let matches = matchingNodes(cur.type, dir, brackets);
+    if (matches && cur.from < cur.to) {
+      let handle = findHandle(cur);
+      if (handle && (dir > 0 ? pos >= handle.from && pos < handle.to : pos > handle.from && pos <= handle.to)) return matchMarkedBrackets(state, pos, dir, cur, handle, matches, brackets);
+    }
+  }
+  return matchPlainBrackets(state, pos, dir, tree, node.type, maxScanDistance, brackets);
+}
+function matchMarkedBrackets(_state, _pos, dir, token, handle, matching, brackets) {
+  let parent = token.parent,
+    firstToken = {
+      from: handle.from,
+      to: handle.to
+    };
+  let depth = 0,
+    cursor = parent === null || parent === void 0 ? void 0 : parent.cursor();
+  if (cursor && (dir < 0 ? cursor.childBefore(token.from) : cursor.childAfter(token.to))) do {
+    if (dir < 0 ? cursor.to <= token.from : cursor.from >= token.to) {
+      if (depth == 0 && matching.indexOf(cursor.type.name) > -1 && cursor.from < cursor.to) {
+        let endHandle = findHandle(cursor);
+        return {
+          start: firstToken,
+          end: endHandle ? {
+            from: endHandle.from,
+            to: endHandle.to
+          } : undefined,
+          matched: true
+        };
+      } else if (matchingNodes(cursor.type, dir, brackets)) {
+        depth++;
+      } else if (matchingNodes(cursor.type, -dir, brackets)) {
+        if (depth == 0) {
+          let endHandle = findHandle(cursor);
+          return {
+            start: firstToken,
+            end: endHandle && endHandle.from < endHandle.to ? {
+              from: endHandle.from,
+              to: endHandle.to
+            } : undefined,
+            matched: false
+          };
+        }
+        depth--;
+      }
+    }
+  } while (dir < 0 ? cursor.prevSibling() : cursor.nextSibling());
+  return {
+    start: firstToken,
+    matched: false
+  };
+}
+function matchPlainBrackets(state, pos, dir, tree, tokenType, maxScanDistance, brackets) {
+  let startCh = dir < 0 ? state.sliceDoc(pos - 1, pos) : state.sliceDoc(pos, pos + 1);
+  let bracket = brackets.indexOf(startCh);
+  if (bracket < 0 || bracket % 2 == 0 != dir > 0) return null;
+  let startToken = {
+    from: dir < 0 ? pos - 1 : pos,
+    to: dir > 0 ? pos + 1 : pos
+  };
+  let iter = state.doc.iterRange(pos, dir > 0 ? state.doc.length : 0),
+    depth = 0;
+  for (let distance = 0; !iter.next().done && distance <= maxScanDistance;) {
+    let text = iter.value;
+    if (dir < 0) distance += text.length;
+    let basePos = pos + distance * dir;
+    for (let pos = dir > 0 ? 0 : text.length - 1, end = dir > 0 ? text.length : -1; pos != end; pos += dir) {
+      let found = brackets.indexOf(text[pos]);
+      if (found < 0 || tree.resolveInner(basePos + pos, 1).type != tokenType) continue;
+      if (found % 2 == 0 == dir > 0) {
+        depth++;
+      } else if (depth == 1) {
+        // Closing
+        return {
+          start: startToken,
+          end: {
+            from: basePos + pos,
+            to: basePos + pos + 1
+          },
+          matched: found >> 1 == bracket >> 1
+        };
+      } else {
+        depth--;
+      }
+    }
+    if (dir > 0) distance += text.length;
+  }
+  return iter.done ? {
+    start: startToken,
+    matched: false
+  } : null;
+}
+const noTokens = /*@__PURE__*/Object.create(null);
+const typeArray = [NodeType.none];
+const warned = [];
+const defaultTable = /*@__PURE__*/Object.create(null);
+for (let [legacyName, name] of [["variable", "variableName"], ["variable-2", "variableName.special"], ["string-2", "string.special"], ["def", "variableName.definition"], ["tag", "tagName"], ["attribute", "attributeName"], ["type", "typeName"], ["builtin", "variableName.standard"], ["qualifier", "modifier"], ["error", "invalid"], ["header", "heading"], ["property", "propertyName"]]) defaultTable[legacyName] = /*@__PURE__*/createTokenType(noTokens, name);
+function warnForPart(part, msg) {
+  if (warned.indexOf(part) > -1) return;
+  warned.push(part);
+  console.warn(msg);
+}
+function createTokenType(extra, tagStr) {
+  let tag = null;
+  for (let part of tagStr.split(".")) {
+    let value = extra[part] || tags[part];
+    if (!value) {
+      warnForPart(part, `Unknown highlighting tag ${part}`);
+    } else if (typeof value == "function") {
+      if (!tag) warnForPart(part, `Modifier ${part} used at start of tag`);else tag = value(tag);
+    } else {
+      if (tag) warnForPart(part, `Tag ${part} used as modifier`);else tag = value;
+    }
+  }
+  if (!tag) return 0;
+  let name = tagStr.replace(/ /g, "_"),
+    type = NodeType.define({
+      id: typeArray.length,
+      name,
+      props: [styleTags({
+        [name]: tag
+      })]
+    });
+  typeArray.push(type);
+  return type.id;
+}
+
+export { LanguageDescription as A, ParseContext as B, IterMode as C, DefaultBufferLength as D, flatIndent as E, delimitedIndent as F, NodeWeakMap as G, HighlightStyle as H, IndentContext as I, LanguageSupport as L, NodeProp as N, Parser as P, Tag as T, indentUnit as a, getIndentUnit as b, indentOnInput as c, syntaxHighlighting as d, defaultHighlightStyle as e, foldGutter as f, getIndentation as g, bracketMatching as h, indentString as i, foldKeymap as j, styleTags as k, LRLanguage as l, matchBrackets as m, indentNodeProp as n, continuedIndent as o, parseMixed as p, foldNodeProp as q, foldInside as r, syntaxTree as s, tags as t, NodeType as u, NodeSet as v, Tree as w, Language as x, defineLanguageFacet as y, languageDataProp as z };