@adyen/bento-vue3 1.26.0 → 1.28.0

package/dist/code-snippet.js

@@ -1,2134 +1,8 @@
-import { openBlock as O, createElementBlock as le, mergeProps as Fe, toDisplayString as Ae, createCommentVNode as F, createElementVNode as ae, defineComponent as Ye, ref as ge, computed as ue, shallowRef as Pe, onMounted as et, watch as tt, watchEffect as nt, resolveComponent as K, normalizeClass as $e, createBlock as oe, createVNode as me, withCtx as he, createTextVNode as Ve, renderSlot as rt, normalizeProps as it, guardReactiveProps as st, pushScopeId as ot, popScopeId as lt } from "vue";
-import { highlightActiveLine as at, keymap as ut, EditorView as He, lineNumbers as ht } from "@codemirror/view";
-import { EditorSelection as ft, Compartment as Ne, EditorState as je } from "@codemirror/state";
-import { indentWithTab as ct, history as dt } from "@codemirror/commands";
-import { syntaxHighlighting as pt, HighlightStyle as gt } from "@codemirror/language";
-import { B as mt } from "./chunks/dropdown.d8587f36.js";
-import { a as bt } from "./chunks/button.60dad578.js";
-import { B as yt } from "./chunks/index.a3d60e4f.js";
-import { b as xt } from "./chunks/tooltip.1084d92b.js";
-import { BentoLoadingIndicator as kt } from "./loading-indicator.js";
-import { u as _t } from "./chunks/i18n.f7e6533e.js";
-import { _ as qe } from "./chunks/_plugin-vue_export-helper.dad06003.js";
-import { h as vt } from "./chunks/base-modal.29e062d0.js";
-import { C as wt } from "./chunks/copy.852d4cb8.js";
-import { json as Ct } from "@codemirror/lang-json";
-import { xml as Nt } from "@codemirror/lang-xml";
-import { javascript as St } from "@codemirror/lang-javascript";
-import { java as At } from "@codemirror/lang-java";
-import "./assets/index14.css";
-const It = 1024;
-let Lt = 0;
-class v {
-  /**
-  Create a new node prop type.
-  */
-  constructor(e = {}) {
-    this.id = Lt++, this.perNode = !!e.perNode, this.deserialize = e.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(e) {
-    if (this.perNode)
-      throw new RangeError("Can't add per-node props to node types");
-    return typeof e != "function" && (e = G.match(e)), (t) => {
-      let n = e(t);
-      return n === void 0 ? null : [this, n];
-    };
-  }
-}
-v.closedBy = new v({ deserialize: (r) => r.split(" ") });
-v.openedBy = new v({ deserialize: (r) => r.split(" ") });
-v.group = new v({ deserialize: (r) => r.split(" ") });
-v.isolate = new v({ deserialize: (r) => {
-  if (r && r != "rtl" && r != "ltr" && r != "auto")
-    throw new RangeError("Invalid value for isolate: " + r);
-  return r || "auto";
-} });
-v.contextHash = new v({ perNode: !0 });
-v.lookAhead = new v({ perNode: !0 });
-v.mounted = new v({ perNode: !0 });
-class we {
-  constructor(e, t, n) {
-    this.tree = e, this.overlay = t, this.parser = n;
-  }
-  /**
-  @internal
-  */
-  static get(e) {
-    return e && e.props && e.props[v.mounted.id];
-  }
-}
-const Bt = /* @__PURE__ */ Object.create(null);
-class G {
-  /**
-  @internal
-  */
-  constructor(e, t, n, i = 0) {
-    this.name = e, this.props = t, this.id = n, this.flags = i;
-  }
-  /**
-  Define a node type.
-  */
-  static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Bt, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), i = new G(e.name || "", t, e.id, n);
-    if (e.props) {
-      for (let s of e.props)
-        if (Array.isArray(s) || (s = s(i)), s) {
-          if (s[0].perNode)
-            throw new RangeError("Can't store a per-node prop on a node type");
-          t[s[0].id] = s[1];
-        }
-    }
-    return i;
-  }
-  /**
-  Retrieves a node prop for this type. Will return `undefined` if
-  the prop isn't present on this node.
-  */
-  prop(e) {
-    return this.props[e.id];
-  }
-  /**
-  True when this is the top node of a grammar.
-  */
-  get isTop() {
-    return (this.flags & 1) > 0;
-  }
-  /**
-  True when this node is produced by a skip rule.
-  */
-  get isSkipped() {
-    return (this.flags & 2) > 0;
-  }
-  /**
-  Indicates whether this is an error node.
-  */
-  get isError() {
-    return (this.flags & 4) > 0;
-  }
-  /**
-  When true, this node type doesn't correspond to a user-declared
-  named node, for example because it is used to cache repetition.
-  */
-  get isAnonymous() {
-    return (this.flags & 8) > 0;
-  }
-  /**
-  Returns true when this node's name or one of its
-  [groups](#common.NodeProp^group) matches the given string.
-  */
-  is(e) {
-    if (typeof e == "string") {
-      if (this.name == e)
-        return !0;
-      let t = this.prop(v.group);
-      return t ? t.indexOf(e) > -1 : !1;
-    }
-    return this.id == e;
-  }
-  /**
-  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(e) {
-    let t = /* @__PURE__ */ Object.create(null);
-    for (let n in e)
-      for (let i of n.split(" "))
-        t[i] = e[n];
-    return (n) => {
-      for (let i = n.prop(v.group), s = -1; s < (i ? i.length : 0); s++) {
-        let o = t[s < 0 ? n.name : i[s]];
-        if (o)
-          return o;
-      }
-    };
-  }
-}
-G.none = new G(
-  "",
-  /* @__PURE__ */ Object.create(null),
-  0,
-  8
-  /* NodeFlag.Anonymous */
-);
-const be = /* @__PURE__ */ new WeakMap(), Re = /* @__PURE__ */ new WeakMap();
-var I;
-(function(r) {
-  r[r.ExcludeBuffers = 1] = "ExcludeBuffers", r[r.IncludeAnonymous = 2] = "IncludeAnonymous", r[r.IgnoreMounts = 4] = "IgnoreMounts", r[r.IgnoreOverlays = 8] = "IgnoreOverlays";
-})(I || (I = {}));
-class R {
-  /**
-  Construct a new tree. See also [`Tree.build`](#common.Tree^build).
-  */
-  constructor(e, t, n, i, s) {
-    if (this.type = e, this.children = t, this.positions = n, this.length = i, this.props = null, s && s.length) {
-      this.props = /* @__PURE__ */ Object.create(null);
-      for (let [o, u] of s)
-        this.props[typeof o == "number" ? o : o.id] = u;
-    }
-  }
-  /**
-  @internal
-  */
-  toString() {
-    let e = we.get(this);
-    if (e && !e.overlay)
-      return e.tree.toString();
-    let t = "";
-    for (let n of this.children) {
-      let i = n.toString();
-      i && (t && (t += ","), t += i);
-    }
-    return this.type.name ? (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (t.length ? "(" + t + ")" : "") : t;
-  }
-  /**
-  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(e = 0) {
-    return new Le(this.topNode, e);
-  }
-  /**
-  Get a [tree cursor](#common.TreeCursor) pointing into this tree
-  at the given position and side (see
-  [`moveTo`](#common.TreeCursor.moveTo).
-  */
-  cursorAt(e, t = 0, n = 0) {
-    let i = be.get(this) || this.topNode, s = new Le(i);
-    return s.moveTo(e, t), be.set(this, s._tree), s;
-  }
-  /**
-  Get a [syntax node](#common.SyntaxNode) object for the top of the
-  tree.
-  */
-  get topNode() {
-    return new z(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(e, t = 0) {
-    let n = de(be.get(this) || this.topNode, e, t, !1);
-    return be.set(this, n), n;
-  }
-  /**
-  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(e, t = 0) {
-    let n = de(Re.get(this) || this.topNode, e, t, !0);
-    return Re.set(this, n), n;
-  }
-  /**
-  In some situations, it can be useful to iterate through all
-  nodes around a position, including those in overlays that don't
-  directly cover the position. This method gives you an iterator
-  that will produce all nodes, from small to big, around the given
-  position.
-  */
-  resolveStack(e, t = 0) {
-    return zt(this, e, t);
-  }
-  /**
-  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(e) {
-    let { enter: t, leave: n, from: i = 0, to: s = this.length } = e, o = e.mode || 0, u = (o & I.IncludeAnonymous) > 0;
-    for (let f = this.cursor(o | I.IncludeAnonymous); ; ) {
-      let x = !1;
-      if (f.from <= s && f.to >= i && (!u && f.type.isAnonymous || t(f) !== !1)) {
-        if (f.firstChild())
-          continue;
-        x = !0;
-      }
-      for (; x && n && (u || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
-        if (!f.parent())
-          return;
-        x = !0;
-      }
-    }
-  }
-  /**
-  Get the value of the given [node prop](#common.NodeProp) for this
-  node. Works with both per-node and per-type props.
-  */
-  prop(e) {
-    return e.perNode ? this.props ? this.props[e.id] : void 0 : this.type.prop(e);
-  }
-  /**
-  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 e = [];
-    if (this.props)
-      for (let t in this.props)
-        e.push([+t, this.props[t]]);
-    return e;
-  }
-  /**
-  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(e = {}) {
-    return this.children.length <= 8 ? this : ze(G.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, i) => new R(this.type, t, n, i, this.propValues), e.makeTree || ((t, n, i) => new R(G.none, t, n, i)));
-  }
-  /**
-  Build a tree from a postfix-ordered buffer of node information,
-  or a cursor over such a buffer.
-  */
-  static build(e) {
-    return Mt(e);
-  }
-}
-R.empty = new R(G.none, [], [], 0);
-class Ee {
-  constructor(e, t) {
-    this.buffer = e, this.index = t;
-  }
-  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 Ee(this.buffer, this.index);
-  }
-}
-class Q {
-  /**
-  Create a tree buffer.
-  */
-  constructor(e, t, n) {
-    this.buffer = e, this.length = t, this.set = n;
-  }
-  /**
-  @internal
-  */
-  get type() {
-    return G.none;
-  }
-  /**
-  @internal
-  */
-  toString() {
-    let e = [];
-    for (let t = 0; t < this.buffer.length; )
-      e.push(this.childString(t)), t = this.buffer[t + 3];
-    return e.join(",");
-  }
-  /**
-  @internal
-  */
-  childString(e) {
-    let t = this.buffer[e], n = this.buffer[e + 3], i = this.set.types[t], s = i.name;
-    if (/\W/.test(s) && !i.isError && (s = JSON.stringify(s)), e += 4, n == e)
-      return s;
-    let o = [];
-    for (; e < n; )
-      o.push(this.childString(e)), e = this.buffer[e + 3];
-    return s + "(" + o.join(",") + ")";
-  }
-  /**
-  @internal
-  */
-  findChild(e, t, n, i, s) {
-    let { buffer: o } = this, u = -1;
-    for (let f = e; f != t && !(Xe(s, i, o[f + 1], o[f + 2]) && (u = f, n > 0)); f = o[f + 3])
-      ;
-    return u;
-  }
-  /**
-  @internal
-  */
-  slice(e, t, n) {
-    let i = this.buffer, s = new Uint16Array(t - e), o = 0;
-    for (let u = e, f = 0; u < t; ) {
-      s[f++] = i[u++], s[f++] = i[u++] - n;
-      let x = s[f++] = i[u++] - n;
-      s[f++] = i[u++] - e, o = Math.max(o, x);
-    }
-    return new Q(s, o, this.set);
-  }
-}
-function Xe(r, e, t, n) {
-  switch (r) {
-    case -2:
-      return t < e;
-    case -1:
-      return n >= e && t < e;
-    case 0:
-      return t < e && n > e;
-    case 1:
-      return t <= e && n > e;
-    case 2:
-      return n > e;
-    case 4:
-      return !0;
-  }
-}
-function de(r, e, t, n) {
-  for (var i; r.from == r.to || (t < 1 ? r.from >= e : r.from > e) || (t > -1 ? r.to <= e : r.to < e); ) {
-    let o = !n && r instanceof z && r.index < 0 ? null : r.parent;
-    if (!o)
-      return r;
-    r = o;
-  }
-  let s = n ? 0 : I.IgnoreOverlays;
-  if (n)
-    for (let o = r, u = o.parent; u; o = u, u = o.parent)
-      o instanceof z && o.index < 0 && ((i = u.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (r = u);
-  for (; ; ) {
-    let o = r.enter(e, t, s);
-    if (!o)
-      return r;
-    r = o;
-  }
-}
-class Ze {
-  cursor(e = 0) {
-    return new Le(this, e);
-  }
-  getChild(e, t = null, n = null) {
-    let i = De(this, e, t, n);
-    return i.length ? i[0] : null;
-  }
-  getChildren(e, t = null, n = null) {
-    return De(this, e, t, n);
-  }
-  resolve(e, t = 0) {
-    return de(this, e, t, !1);
-  }
-  resolveInner(e, t = 0) {
-    return de(this, e, t, !0);
-  }
-  matchContext(e) {
-    return Ie(this, e);
-  }
-  enterUnfinishedNodesBefore(e) {
-    let t = this.childBefore(e), n = this;
-    for (; t; ) {
-      let i = t.lastChild;
-      if (!i || i.to != t.to)
-        break;
-      i.type.isError && i.from == i.to ? (n = t, t = i.prevSibling) : t = i;
-    }
-    return n;
-  }
-  get node() {
-    return this;
-  }
-  get next() {
-    return this.parent;
-  }
-}
-class z extends Ze {
-  constructor(e, t, n, i) {
-    super(), this._tree = e, this.from = t, this.index = n, this._parent = i;
-  }
-  get type() {
-    return this._tree.type;
-  }
-  get name() {
-    return this._tree.type.name;
-  }
-  get to() {
-    return this.from + this._tree.length;
-  }
-  nextChild(e, t, n, i, s = 0) {
-    for (let o = this; ; ) {
-      for (let { children: u, positions: f } = o._tree, x = t > 0 ? u.length : -1; e != x; e += t) {
-        let w = u[e], C = f[e] + o.from;
-        if (Xe(i, n, C, C + w.length)) {
-          if (w instanceof Q) {
-            if (s & I.ExcludeBuffers)
-              continue;
-            let A = w.findChild(0, w.buffer.length, t, n - C, i);
-            if (A > -1)
-              return new Z(new Et(o, w, e, C), null, A);
-          } else if (s & I.IncludeAnonymous || !w.type.isAnonymous || Oe(w)) {
-            let A;
-            if (!(s & I.IgnoreMounts) && (A = we.get(w)) && !A.overlay)
-              return new z(A.tree, C, e, o);
-            let B = new z(w, C, e, o);
-            return s & I.IncludeAnonymous || !B.type.isAnonymous ? B : B.nextChild(t < 0 ? w.children.length - 1 : 0, t, n, i);
-          }
-        }
-      }
-      if (s & I.IncludeAnonymous || !o.type.isAnonymous || (o.index >= 0 ? e = o.index + t : e = t < 0 ? -1 : o._parent._tree.children.length, o = o._parent, !o))
-        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(e) {
-    return this.nextChild(
-      0,
-      1,
-      e,
-      2
-      /* Side.After */
-    );
-  }
-  childBefore(e) {
-    return this.nextChild(
-      this._tree.children.length - 1,
-      -1,
-      e,
-      -2
-      /* Side.Before */
-    );
-  }
-  enter(e, t, n = 0) {
-    let i;
-    if (!(n & I.IgnoreOverlays) && (i = we.get(this._tree)) && i.overlay) {
-      let s = e - this.from;
-      for (let { from: o, to: u } of i.overlay)
-        if ((t > 0 ? o <= s : o < s) && (t < 0 ? u >= s : u > s))
-          return new z(i.tree, i.overlay[0].from + this.from, -1, this);
-    }
-    return this.nextChild(0, 1, e, t, n);
-  }
-  nextSignificantParent() {
-    let e = this;
-    for (; e.type.isAnonymous && e._parent; )
-      e = e._parent;
-    return e;
-  }
-  get parent() {
-    return this._parent ? this._parent.nextSignificantParent() : null;
-  }
-  get nextSibling() {
-    return this._parent && this.index >= 0 ? this._parent.nextChild(
-      this.index + 1,
-      1,
-      0,
-      4
-      /* Side.DontCare */
-    ) : null;
-  }
-  get prevSibling() {
-    return this._parent && this.index >= 0 ? this._parent.nextChild(
-      this.index - 1,
-      -1,
-      0,
-      4
-      /* Side.DontCare */
-    ) : null;
-  }
-  get tree() {
-    return this._tree;
-  }
-  toTree() {
-    return this._tree;
-  }
-  /**
-  @internal
-  */
-  toString() {
-    return this._tree.toString();
-  }
-}
-function De(r, e, t, n) {
-  let i = r.cursor(), s = [];
-  if (!i.firstChild())
-    return s;
-  if (t != null) {
-    for (let o = !1; !o; )
-      if (o = i.type.is(t), !i.nextSibling())
-        return s;
-  }
-  for (; ; ) {
-    if (n != null && i.type.is(n))
-      return s;
-    if (i.type.is(e) && s.push(i.node), !i.nextSibling())
-      return n == null ? s : [];
-  }
-}
-function Ie(r, e, t = e.length - 1) {
-  for (let n = r.parent; t >= 0; n = n.parent) {
-    if (!n)
-      return !1;
-    if (!n.type.isAnonymous) {
-      if (e[t] && e[t] != n.name)
-        return !1;
-      t--;
-    }
-  }
-  return !0;
-}
-class Et {
-  constructor(e, t, n, i) {
-    this.parent = e, this.buffer = t, this.index = n, this.start = i;
-  }
-}
-class Z extends Ze {
-  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(e, t, n) {
-    super(), this.context = e, this._parent = t, this.index = n, this.type = e.buffer.set.types[e.buffer.buffer[n]];
-  }
-  child(e, t, n) {
-    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, n);
-    return s < 0 ? null : new Z(this.context, this, s);
-  }
-  get firstChild() {
-    return this.child(
-      1,
-      0,
-      4
-      /* Side.DontCare */
-    );
-  }
-  get lastChild() {
-    return this.child(
-      -1,
-      0,
-      4
-      /* Side.DontCare */
-    );
-  }
-  childAfter(e) {
-    return this.child(
-      1,
-      e,
-      2
-      /* Side.After */
-    );
-  }
-  childBefore(e) {
-    return this.child(
-      -1,
-      e,
-      -2
-      /* Side.Before */
-    );
-  }
-  enter(e, t, n = 0) {
-    if (n & I.ExcludeBuffers)
-      return null;
-    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], t > 0 ? 1 : -1, e - this.context.start, t);
-    return s < 0 ? null : new Z(this.context, this, s);
-  }
-  get parent() {
-    return this._parent || this.context.parent.nextSignificantParent();
-  }
-  externalSibling(e) {
-    return this._parent ? null : this.context.parent.nextChild(
-      this.context.index + e,
-      e,
-      0,
-      4
-      /* Side.DontCare */
-    );
-  }
-  get nextSibling() {
-    let { buffer: e } = this.context, t = e.buffer[this.index + 3];
-    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new Z(this.context, this._parent, t) : this.externalSibling(1);
-  }
-  get prevSibling() {
-    let { buffer: e } = this.context, t = this._parent ? this._parent.index + 4 : 0;
-    return this.index == t ? this.externalSibling(-1) : new Z(this.context, this._parent, e.findChild(
-      t,
-      this.index,
-      -1,
-      0,
-      4
-      /* Side.DontCare */
-    ));
-  }
-  get tree() {
-    return null;
-  }
-  toTree() {
-    let e = [], t = [], { buffer: n } = this.context, i = this.index + 4, s = n.buffer[this.index + 3];
-    if (s > i) {
-      let o = n.buffer[this.index + 1];
-      e.push(n.slice(i, s, o)), t.push(0);
-    }
-    return new R(this.type, e, t, this.to - this.from);
-  }
-  /**
-  @internal
-  */
-  toString() {
-    return this.context.buffer.childString(this.index);
-  }
-}
-function Qe(r) {
-  if (!r.length)
-    return null;
-  let e = 0, t = r[0];
-  for (let s = 1; s < r.length; s++) {
-    let o = r[s];
-    (o.from > t.from || o.to < t.to) && (t = o, e = s);
-  }
-  let n = t instanceof z && t.index < 0 ? null : t.parent, i = r.slice();
-  return n ? i[e] = n : i.splice(e, 1), new Ot(i, t);
-}
-class Ot {
-  constructor(e, t) {
-    this.heads = e, this.node = t;
-  }
-  get next() {
-    return Qe(this.heads);
-  }
-}
-function zt(r, e, t) {
-  let n = r.resolveInner(e, t), i = null;
-  for (let s = n instanceof z ? n : n.context.parent; s; s = s.parent)
-    if (s.index < 0) {
-      let o = s.parent;
-      (i || (i = [n])).push(o.resolve(e, t)), s = o;
-    } else {
-      let o = we.get(s.tree);
-      if (o && o.overlay && o.overlay[0].from <= e && o.overlay[o.overlay.length - 1].to >= e) {
-        let u = new z(o.tree, o.overlay[0].from + s.from, -1, s);
-        (i || (i = [n])).push(de(u, e, t, !1));
-      }
-    }
-  return i ? Qe(i) : n;
-}
-class Le {
-  /**
-  Shorthand for `.type.name`.
-  */
-  get name() {
-    return this.type.name;
-  }
-  /**
-  @internal
-  */
-  constructor(e, t = 0) {
-    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof z)
-      this.yieldNode(e);
-    else {
-      this._tree = e.context.parent, this.buffer = e.context;
-      for (let n = e._parent; n; n = n._parent)
-        this.stack.unshift(n.index);
-      this.bufferNode = e, this.yieldBuf(e.index);
-    }
-  }
-  yieldNode(e) {
-    return e ? (this._tree = e, this.type = e.type, this.from = e.from, this.to = e.to, !0) : !1;
-  }
-  yieldBuf(e, t) {
-    this.index = e;
-    let { start: n, buffer: i } = this.buffer;
-    return this.type = t || i.set.types[i.buffer[e]], this.from = n + i.buffer[e + 1], this.to = n + i.buffer[e + 2], !0;
-  }
-  /**
-  @internal
-  */
-  yield(e) {
-    return e ? e instanceof z ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
-  }
-  /**
-  @internal
-  */
-  toString() {
-    return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
-  }
-  /**
-  @internal
-  */
-  enterChild(e, t, n) {
-    if (!this.buffer)
-      return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, n, this.mode));
-    let { buffer: i } = this.buffer, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.buffer.start, n);
-    return s < 0 ? !1 : (this.stack.push(this.index), this.yieldBuf(s));
-  }
-  /**
-  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(e) {
-    return this.enterChild(
-      1,
-      e,
-      2
-      /* Side.After */
-    );
-  }
-  /**
-  Move to the last child that starts before `pos`.
-  */
-  childBefore(e) {
-    return this.enterChild(
-      -1,
-      e,
-      -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(e, t, n = this.mode) {
-    return this.buffer ? n & I.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
-  }
-  /**
-  Move to the node's parent node, if this isn't the top node.
-  */
-  parent() {
-    if (!this.buffer)
-      return this.yieldNode(this.mode & I.IncludeAnonymous ? this._tree._parent : this._tree.parent);
-    if (this.stack.length)
-      return this.yieldBuf(this.stack.pop());
-    let e = this.mode & I.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
-    return this.buffer = null, this.yieldNode(e);
-  }
-  /**
-  @internal
-  */
-  sibling(e) {
-    if (!this.buffer)
-      return this._tree._parent ? this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + e, e, 0, 4, this.mode)) : !1;
-    let { buffer: t } = this.buffer, n = this.stack.length - 1;
-    if (e < 0) {
-      let i = n < 0 ? 0 : this.stack[n] + 4;
-      if (this.index != i)
-        return this.yieldBuf(t.findChild(
-          i,
-          this.index,
-          -1,
-          0,
-          4
-          /* Side.DontCare */
-        ));
-    } else {
-      let i = t.buffer[this.index + 3];
-      if (i < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3]))
-        return this.yieldBuf(i);
-    }
-    return n < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
-  }
-  /**
-  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(e) {
-    let t, n, { buffer: i } = this;
-    if (i) {
-      if (e > 0) {
-        if (this.index < i.buffer.buffer.length)
-          return !1;
-      } else
-        for (let s = 0; s < this.index; s++)
-          if (i.buffer.buffer[s + 3] < this.index)
-            return !1;
-      ({ index: t, parent: n } = i);
-    } else
-      ({ index: t, _parent: n } = this._tree);
-    for (; n; { index: t, _parent: n } = n)
-      if (t > -1)
-        for (let s = t + e, o = e < 0 ? -1 : n._tree.children.length; s != o; s += e) {
-          let u = n._tree.children[s];
-          if (this.mode & I.IncludeAnonymous || u instanceof Q || !u.type.isAnonymous || Oe(u))
-            return !1;
-        }
-    return !0;
-  }
-  move(e, t) {
-    if (t && this.enterChild(
-      e,
-      0,
-      4
-      /* Side.DontCare */
-    ))
-      return !0;
-    for (; ; ) {
-      if (this.sibling(e))
-        return !0;
-      if (this.atLastNode(e) || !this.parent())
-        return !1;
-    }
-  }
-  /**
-  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(e = !0) {
-    return this.move(1, e);
-  }
-  /**
-  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(e = !0) {
-    return this.move(-1, e);
-  }
-  /**
-  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(e, t = 0) {
-    for (; (this.from == this.to || (t < 1 ? this.from >= e : this.from > e) || (t > -1 ? this.to <= e : this.to < e)) && this.parent(); )
-      ;
-    for (; this.enterChild(1, e, t); )
-      ;
-    return this;
-  }
-  /**
-  Get a [syntax node](#common.SyntaxNode) at the cursor's current
-  position.
-  */
-  get node() {
-    if (!this.buffer)
-      return this._tree;
-    let e = this.bufferNode, t = null, n = 0;
-    if (e && e.context == this.buffer)
-      e:
-        for (let i = this.index, s = this.stack.length; s >= 0; ) {
-          for (let o = e; o; o = o._parent)
-            if (o.index == i) {
-              if (i == this.index)
-                return o;
-              t = o, n = s + 1;
-              break e;
-            }
-          i = this.stack[--s];
-        }
-    for (let i = n; i < this.stack.length; i++)
-      t = new Z(this.buffer, t, this.stack[i]);
-    return this.bufferNode = new Z(this.buffer, t, 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(e, t) {
-    for (let n = 0; ; ) {
-      let i = !1;
-      if (this.type.isAnonymous || e(this) !== !1) {
-        if (this.firstChild()) {
-          n++;
-          continue;
-        }
-        this.type.isAnonymous || (i = !0);
-      }
-      for (; i && t && t(this), i = this.type.isAnonymous, !this.nextSibling(); ) {
-        if (!n)
-          return;
-        this.parent(), n--, i = !0;
-      }
-    }
-  }
-  /**
-  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(e) {
-    if (!this.buffer)
-      return Ie(this.node, e);
-    let { buffer: t } = this.buffer, { types: n } = t.set;
-    for (let i = e.length - 1, s = this.stack.length - 1; i >= 0; s--) {
-      if (s < 0)
-        return Ie(this.node, e, i);
-      let o = n[t.buffer[this.stack[s]]];
-      if (!o.isAnonymous) {
-        if (e[i] && e[i] != o.name)
-          return !1;
-        i--;
-      }
-    }
-    return !0;
-  }
-}
-function Oe(r) {
-  return r.children.some((e) => e instanceof Q || !e.type.isAnonymous || Oe(e));
-}
-function Mt(r) {
-  var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: i = It, reused: s = [], minRepeatType: o = n.types.length } = r, u = Array.isArray(t) ? new Ee(t, t.length) : t, f = n.types, x = 0, w = 0;
-  function C(g, b, h, y, p, m) {
-    let { id: c, start: d, end: _, size: k } = u, L = w;
-    for (; k < 0; )
-      if (u.next(), k == -1) {
-        let W = s[c];
-        h.push(W), y.push(d - g);
-        return;
-      } else if (k == -3) {
-        x = c;
-        return;
-      } else if (k == -4) {
-        w = c;
-        return;
-      } else
-        throw new RangeError(`Unrecognized record size: ${k}`);
-    let Y = f[c], ie, ee, Me = d - g;
-    if (_ - d <= i && (ee = M(u.pos - b, p))) {
-      let W = new Uint16Array(ee.size - ee.skip), E = u.pos - ee.size, P = W.length;
-      for (; u.pos > E; )
-        P = D(ee.start, W, P);
-      ie = new Q(W, _ - ee.start, n), Me = ee.start - g;
-    } else {
-      let W = u.pos - k;
-      u.next();
-      let E = [], P = [], te = c >= o ? c : -1, se = 0, pe = _;
-      for (; u.pos > W; )
-        te >= 0 && u.id == te && u.size >= 0 ? (u.end <= pe - i && (N(E, P, d, se, u.end, pe, te, L), se = E.length, pe = u.end), u.next()) : m > 2500 ? A(d, W, E, P) : C(d, W, E, P, te, m + 1);
-      if (te >= 0 && se > 0 && se < E.length && N(E, P, d, se, d, pe, te, L), E.reverse(), P.reverse(), te > -1 && se > 0) {
-        let Te = B(Y);
-        ie = ze(Y, E, P, 0, E.length, 0, _ - d, Te, Te);
-      } else
-        ie = T(Y, E, P, _ - d, L - _);
-    }
-    h.push(ie), y.push(Me);
-  }
-  function A(g, b, h, y) {
-    let p = [], m = 0, c = -1;
-    for (; u.pos > b; ) {
-      let { id: d, start: _, end: k, size: L } = u;
-      if (L > 4)
-        u.next();
-      else {
-        if (c > -1 && _ < c)
-          break;
-        c < 0 && (c = k - i), p.push(d, _, k), m++, u.next();
-      }
-    }
-    if (m) {
-      let d = new Uint16Array(m * 4), _ = p[p.length - 2];
-      for (let k = p.length - 3, L = 0; k >= 0; k -= 3)
-        d[L++] = p[k], d[L++] = p[k + 1] - _, d[L++] = p[k + 2] - _, d[L++] = L;
-      h.push(new Q(d, p[2] - _, n)), y.push(_ - g);
-    }
-  }
-  function B(g) {
-    return (b, h, y) => {
-      let p = 0, m = b.length - 1, c, d;
-      if (m >= 0 && (c = b[m]) instanceof R) {
-        if (!m && c.type == g && c.length == y)
-          return c;
-        (d = c.prop(v.lookAhead)) && (p = h[m] + c.length + d);
-      }
-      return T(g, b, h, y, p);
-    };
-  }
-  function N(g, b, h, y, p, m, c, d) {
-    let _ = [], k = [];
-    for (; g.length > y; )
-      _.push(g.pop()), k.push(b.pop() + h - p);
-    g.push(T(n.types[c], _, k, m - p, d - m)), b.push(p - h);
-  }
-  function T(g, b, h, y, p = 0, m) {
-    if (x) {
-      let c = [v.contextHash, x];
-      m = m ? [c].concat(m) : [c];
-    }
-    if (p > 25) {
-      let c = [v.lookAhead, p];
-      m = m ? [c].concat(m) : [c];
-    }
-    return new R(g, b, h, y, m);
-  }
-  function M(g, b) {
-    let h = u.fork(), y = 0, p = 0, m = 0, c = h.end - i, d = { size: 0, start: 0, skip: 0 };
-    e:
-      for (let _ = h.pos - g; h.pos > _; ) {
-        let k = h.size;
-        if (h.id == b && k >= 0) {
-          d.size = y, d.start = p, d.skip = m, m += 4, y += 4, h.next();
-          continue;
-        }
-        let L = h.pos - k;
-        if (k < 0 || L < _ || h.start < c)
-          break;
-        let Y = h.id >= o ? 4 : 0, ie = h.start;
-        for (h.next(); h.pos > L; ) {
-          if (h.size < 0)
-            if (h.size == -3)
-              Y += 4;
-            else
-              break e;
-          else
-            h.id >= o && (Y += 4);
-          h.next();
-        }
-        p = ie, y += k, m += Y;
-      }
-    return (b < 0 || y == g) && (d.size = y, d.start = p, d.skip = m), d.size > 4 ? d : void 0;
-  }
-  function D(g, b, h) {
-    let { id: y, start: p, end: m, size: c } = u;
-    if (u.next(), c >= 0 && y < o) {
-      let d = h;
-      if (c > 4) {
-        let _ = u.pos - (c - 4);
-        for (; u.pos > _; )
-          h = D(g, b, h);
-      }
-      b[--h] = d, b[--h] = m - g, b[--h] = p - g, b[--h] = y;
-    } else
-      c == -3 ? x = y : c == -4 && (w = y);
-    return h;
-  }
-  let U = [], S = [];
-  for (; u.pos > 0; )
-    C(r.start || 0, r.bufferStart || 0, U, S, -1, 0);
-  let J = (e = r.length) !== null && e !== void 0 ? e : U.length ? S[0] + U[0].length : 0;
-  return new R(f[r.topID], U.reverse(), S.reverse(), J);
-}
-const Ue = /* @__PURE__ */ new WeakMap();
-function _e(r, e) {
-  if (!r.isAnonymous || e instanceof Q || e.type != r)
-    return 1;
-  let t = Ue.get(e);
-  if (t == null) {
-    t = 1;
-    for (let n of e.children) {
-      if (n.type != r || !(n instanceof R)) {
-        t = 1;
-        break;
-      }
-      t += _e(r, n);
-    }
-    Ue.set(e, t);
-  }
-  return t;
-}
-function ze(r, e, t, n, i, s, o, u, f) {
-  let x = 0;
-  for (let N = n; N < i; N++)
-    x += _e(r, e[N]);
-  let w = Math.ceil(
-    x * 1.5 / 8
-    /* Balance.BranchFactor */
-  ), C = [], A = [];
-  function B(N, T, M, D, U) {
-    for (let S = M; S < D; ) {
-      let J = S, g = T[S], b = _e(r, N[S]);
-      for (S++; S < D; S++) {
-        let h = _e(r, N[S]);
-        if (b + h >= w)
-          break;
-        b += h;
-      }
-      if (S == J + 1) {
-        if (b > w) {
-          let h = N[J];
-          B(h.children, h.positions, 0, h.children.length, T[J] + U);
-          continue;
-        }
-        C.push(N[J]);
-      } else {
-        let h = T[S - 1] + N[S - 1].length - g;
-        C.push(ze(r, N, T, J, S, g, h, null, f));
-      }
-      A.push(g + U - s);
-    }
-  }
-  return B(e, t, n, i, 0), (u || f)(C, A, o);
-}
-new v({ perNode: !0 });
-let Tt = 0;
-class j {
-  /**
-  @internal
-  */
-  constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = Tt++;
-  }
-  /**
-  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(e) {
-    if (e != null && e.base)
-      throw new Error("Can not derive from a modified tag");
-    let t = new j([], null, []);
-    if (t.set.push(t), e)
-      for (let n of e.set)
-        t.set.push(n);
-    return t;
-  }
-  /**
-  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 e = new Ce();
-    return (t) => t.modified.indexOf(e) > -1 ? t : Ce.get(t.base || t, t.modified.concat(e).sort((n, i) => n.id - i.id));
-  }
-}
-let Pt = 0;
-class Ce {
-  constructor() {
-    this.instances = [], this.id = Pt++;
-  }
-  static get(e, t) {
-    if (!t.length)
-      return e;
-    let n = t[0].instances.find((u) => u.base == e && $t(t, u.modified));
-    if (n)
-      return n;
-    let i = [], s = new j(i, e, t);
-    for (let u of t)
-      u.instances.push(s);
-    let o = Vt(t);
-    for (let u of e.set)
-      if (!u.modified.length)
-        for (let f of o)
-          i.push(Ce.get(u, f));
-    return s;
-  }
-}
-function $t(r, e) {
-  return r.length == e.length && r.every((t, n) => t == e[n]);
-}
-function Vt(r) {
-  let e = [[]];
-  for (let t = 0; t < r.length; t++)
-    for (let n = 0, i = e.length; n < i; n++)
-      e.push(e[n].concat(r[t]));
-  return e.sort((t, n) => n.length - t.length);
-}
-new v();
-function Ht(r, e) {
-  let t = /* @__PURE__ */ Object.create(null);
-  for (let s of r)
-    if (!Array.isArray(s.tag))
-      t[s.tag.id] = s.class;
-    else
-      for (let o of s.tag)
-        t[o.id] = s.class;
-  let { scope: n, all: i = null } = e || {};
-  return {
-    style: (s) => {
-      let o = i;
-      for (let u of s)
-        for (let f of u.set) {
-          let x = t[f.id];
-          if (x) {
-            o = o ? o + " " + x : x;
-            break;
-          }
-        }
-      return o;
-    },
-    scope: n
-  };
-}
-const a = j.define, ye = a(), q = a(), Je = a(q), We = a(q), X = a(), xe = a(X), Se = a(X), H = a(), ne = a(H), $ = a(), V = a(), Be = a(), fe = a(Be), ke = a(), l = {
-  /**
-  A comment.
-  */
-  comment: ye,
-  /**
-  A line [comment](#highlight.tags.comment).
-  */
-  lineComment: a(ye),
-  /**
-  A block [comment](#highlight.tags.comment).
-  */
-  blockComment: a(ye),
-  /**
-  A documentation [comment](#highlight.tags.comment).
-  */
-  docComment: a(ye),
-  /**
-  Any kind of identifier.
-  */
-  name: q,
-  /**
-  The [name](#highlight.tags.name) of a variable.
-  */
-  variableName: a(q),
-  /**
-  A type [name](#highlight.tags.name).
-  */
-  typeName: Je,
-  /**
-  A tag name (subtag of [`typeName`](#highlight.tags.typeName)).
-  */
-  tagName: a(Je),
-  /**
-  A property or field [name](#highlight.tags.name).
-  */
-  propertyName: We,
-  /**
-  An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).
-  */
-  attributeName: a(We),
-  /**
-  The [name](#highlight.tags.name) of a class.
-  */
-  className: a(q),
-  /**
-  A label [name](#highlight.tags.name).
-  */
-  labelName: a(q),
-  /**
-  A namespace [name](#highlight.tags.name).
-  */
-  namespace: a(q),
-  /**
-  The [name](#highlight.tags.name) of a macro.
-  */
-  macroName: a(q),
-  /**
-  A literal value.
-  */
-  literal: X,
-  /**
-  A string [literal](#highlight.tags.literal).
-  */
-  string: xe,
-  /**
-  A documentation [string](#highlight.tags.string).
-  */
-  docString: a(xe),
-  /**
-  A character literal (subtag of [string](#highlight.tags.string)).
-  */
-  character: a(xe),
-  /**
-  An attribute value (subtag of [string](#highlight.tags.string)).
-  */
-  attributeValue: a(xe),
-  /**
-  A number [literal](#highlight.tags.literal).
-  */
-  number: Se,
-  /**
-  An integer [number](#highlight.tags.number) literal.
-  */
-  integer: a(Se),
-  /**
-  A floating-point [number](#highlight.tags.number) literal.
-  */
-  float: a(Se),
-  /**
-  A boolean [literal](#highlight.tags.literal).
-  */
-  bool: a(X),
-  /**
-  Regular expression [literal](#highlight.tags.literal).
-  */
-  regexp: a(X),
-  /**
-  An escape [literal](#highlight.tags.literal), for example a
-  backslash escape in a string.
-  */
-  escape: a(X),
-  /**
-  A color [literal](#highlight.tags.literal).
-  */
-  color: a(X),
-  /**
-  A URL [literal](#highlight.tags.literal).
-  */
-  url: a(X),
-  /**
-  A language keyword.
-  */
-  keyword: $,
-  /**
-  The [keyword](#highlight.tags.keyword) for the self or this
-  object.
-  */
-  self: a($),
-  /**
-  The [keyword](#highlight.tags.keyword) for null.
-  */
-  null: a($),
-  /**
-  A [keyword](#highlight.tags.keyword) denoting some atomic value.
-  */
-  atom: a($),
-  /**
-  A [keyword](#highlight.tags.keyword) that represents a unit.
-  */
-  unit: a($),
-  /**
-  A modifier [keyword](#highlight.tags.keyword).
-  */
-  modifier: a($),
-  /**
-  A [keyword](#highlight.tags.keyword) that acts as an operator.
-  */
-  operatorKeyword: a($),
-  /**
-  A control-flow related [keyword](#highlight.tags.keyword).
-  */
-  controlKeyword: a($),
-  /**
-  A [keyword](#highlight.tags.keyword) that defines something.
-  */
-  definitionKeyword: a($),
-  /**
-  A [keyword](#highlight.tags.keyword) related to defining or
-  interfacing with modules.
-  */
-  moduleKeyword: a($),
-  /**
-  An operator.
-  */
-  operator: V,
-  /**
-  An [operator](#highlight.tags.operator) that dereferences something.
-  */
-  derefOperator: a(V),
-  /**
-  Arithmetic-related [operator](#highlight.tags.operator).
-  */
-  arithmeticOperator: a(V),
-  /**
-  Logical [operator](#highlight.tags.operator).
-  */
-  logicOperator: a(V),
-  /**
-  Bit [operator](#highlight.tags.operator).
-  */
-  bitwiseOperator: a(V),
-  /**
-  Comparison [operator](#highlight.tags.operator).
-  */
-  compareOperator: a(V),
-  /**
-  [Operator](#highlight.tags.operator) that updates its operand.
-  */
-  updateOperator: a(V),
-  /**
-  [Operator](#highlight.tags.operator) that defines something.
-  */
-  definitionOperator: a(V),
-  /**
-  Type-related [operator](#highlight.tags.operator).
-  */
-  typeOperator: a(V),
-  /**
-  Control-flow [operator](#highlight.tags.operator).
-  */
-  controlOperator: a(V),
-  /**
-  Program or markup punctuation.
-  */
-  punctuation: Be,
-  /**
-  [Punctuation](#highlight.tags.punctuation) that separates
-  things.
-  */
-  separator: a(Be),
-  /**
-  Bracket-style [punctuation](#highlight.tags.punctuation).
-  */
-  bracket: fe,
-  /**
-  Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
-  tokens).
-  */
-  angleBracket: a(fe),
-  /**
-  Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
-  tokens).
-  */
-  squareBracket: a(fe),
-  /**
-  Parentheses (usually `(` and `)` tokens). Subtag of
-  [bracket](#highlight.tags.bracket).
-  */
-  paren: a(fe),
-  /**
-  Braces (usually `{` and `}` tokens). Subtag of
-  [bracket](#highlight.tags.bracket).
-  */
-  brace: a(fe),
-  /**
-  Content, for example plain text in XML or markup documents.
-  */
-  content: H,
-  /**
-  [Content](#highlight.tags.content) that represents a heading.
-  */
-  heading: ne,
-  /**
-  A level 1 [heading](#highlight.tags.heading).
-  */
-  heading1: a(ne),
-  /**
-  A level 2 [heading](#highlight.tags.heading).
-  */
-  heading2: a(ne),
-  /**
-  A level 3 [heading](#highlight.tags.heading).
-  */
-  heading3: a(ne),
-  /**
-  A level 4 [heading](#highlight.tags.heading).
-  */
-  heading4: a(ne),
-  /**
-  A level 5 [heading](#highlight.tags.heading).
-  */
-  heading5: a(ne),
-  /**
-  A level 6 [heading](#highlight.tags.heading).
-  */
-  heading6: a(ne),
-  /**
-  A prose separator (such as a horizontal rule).
-  */
-  contentSeparator: a(H),
-  /**
-  [Content](#highlight.tags.content) that represents a list.
-  */
-  list: a(H),
-  /**
-  [Content](#highlight.tags.content) that represents a quote.
-  */
-  quote: a(H),
-  /**
-  [Content](#highlight.tags.content) that is emphasized.
-  */
-  emphasis: a(H),
-  /**
-  [Content](#highlight.tags.content) that is styled strong.
-  */
-  strong: a(H),
-  /**
-  [Content](#highlight.tags.content) that is part of a link.
-  */
-  link: a(H),
-  /**
-  [Content](#highlight.tags.content) that is styled as code or
-  monospace.
-  */
-  monospace: a(H),
-  /**
-  [Content](#highlight.tags.content) that has a strike-through
-  style.
-  */
-  strikethrough: a(H),
-  /**
-  Inserted text in a change-tracking format.
-  */
-  inserted: a(),
-  /**
-  Deleted text.
-  */
-  deleted: a(),
-  /**
-  Changed text.
-  */
-  changed: a(),
-  /**
-  An invalid or unsyntactic element.
-  */
-  invalid: a(),
-  /**
-  Metadata or meta-instruction.
-  */
-  meta: ke,
-  /**
-  [Metadata](#highlight.tags.meta) that applies to the entire
-  document.
-  */
-  documentMeta: a(ke),
-  /**
-  [Metadata](#highlight.tags.meta) that annotates or adds
-  attributes to a given syntactic element.
-  */
-  annotation: a(ke),
-  /**
-  Processing instruction or preprocessor directive. Subtag of
-  [meta](#highlight.tags.meta).
-  */
-  processingInstruction: a(ke),
-  /**
-  [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: j.defineModifier(),
-  /**
-  [Modifier](#highlight.Tag^defineModifier) that indicates that
-  something is constant. Mostly expected to be used with
-  [variable names](#highlight.tags.variableName).
-  */
-  constant: j.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: j.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: j.defineModifier(),
-  /**
-  [Modifier](#highlight.Tag^defineModifier) that indicates a given
-  [names](#highlight.tags.name) is local to some scope.
-  */
-  local: j.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: j.defineModifier()
-};
-Ht([
-  { tag: l.link, class: "tok-link" },
-  { tag: l.heading, class: "tok-heading" },
-  { tag: l.emphasis, class: "tok-emphasis" },
-  { tag: l.strong, class: "tok-strong" },
-  { tag: l.keyword, class: "tok-keyword" },
-  { tag: l.atom, class: "tok-atom" },
-  { tag: l.bool, class: "tok-bool" },
-  { tag: l.url, class: "tok-url" },
-  { tag: l.labelName, class: "tok-labelName" },
-  { tag: l.inserted, class: "tok-inserted" },
-  { tag: l.deleted, class: "tok-deleted" },
-  { tag: l.literal, class: "tok-literal" },
-  { tag: l.string, class: "tok-string" },
-  { tag: l.number, class: "tok-number" },
-  { tag: [l.regexp, l.escape, l.special(l.string)], class: "tok-string2" },
-  { tag: l.variableName, class: "tok-variableName" },
-  { tag: l.local(l.variableName), class: "tok-variableName tok-local" },
-  { tag: l.definition(l.variableName), class: "tok-variableName tok-definition" },
-  { tag: l.special(l.variableName), class: "tok-variableName2" },
-  { tag: l.definition(l.propertyName), class: "tok-propertyName tok-definition" },
-  { tag: l.typeName, class: "tok-typeName" },
-  { tag: l.namespace, class: "tok-namespace" },
-  { tag: l.className, class: "tok-className" },
-  { tag: l.macroName, class: "tok-macroName" },
-  { tag: l.propertyName, class: "tok-propertyName" },
-  { tag: l.operator, class: "tok-operator" },
-  { tag: l.comment, class: "tok-comment" },
-  { tag: l.meta, class: "tok-meta" },
-  { tag: l.invalid, class: "tok-invalid" },
-  { tag: l.punctuation, class: "tok-punctuation" }
-]);
-const jt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
-  red: jt,
-  orange: Rt,
-  green: Dt,
-  blue: Ut,
-  invalid: "#ffffff"
-}, Wt = (r) => gt.define([
-  {
-    tag: l.keyword,
-    color: r.red
-  },
-  {
-    tag: [l.name, l.deleted, l.character, l.propertyName, l.macroName],
-    color: r.green
-  },
-  {
-    tag: [l.function(l.variableName), l.labelName],
-    color: r.blue
-  },
-  {
-    tag: [l.color, l.constant(l.name), l.standard(l.name)],
-    color: r.red
-  },
-  {
-    tag: [l.definition(l.name), l.separator],
-    color: r.red
-  },
-  {
-    tag: [l.typeName, l.className, l.number, l.changed, l.annotation, l.modifier, l.self, l.namespace],
-    color: r.orange
-  },
-  {
-    tag: [l.operator, l.operatorKeyword, l.url, l.escape, l.regexp, l.link, l.special(l.string)],
-    color: r.blue
-  },
-  {
-    tag: [l.meta, l.comment],
-    color: r.orange
-  },
-  {
-    tag: l.strong,
-    fontWeight: "bold"
-  },
-  {
-    tag: l.emphasis,
-    fontStyle: "italic"
-  },
-  {
-    tag: l.strikethrough,
-    textDecoration: "line-through"
-  },
-  {
-    tag: l.link,
-    color: r.orange,
-    textDecoration: "underline"
-  },
-  {
-    tag: l.heading,
-    fontWeight: "bold",
-    color: r.blue
-  },
-  {
-    tag: [l.atom, l.bool, l.special(l.variableName)],
-    color: r.red
-  },
-  {
-    tag: [l.processingInstruction, l.string, l.inserted],
-    color: r.blue
-  },
-  {
-    tag: l.invalid,
-    color: r.invalid
-  }
-]), Gt = pt(Wt(Jt));
-var ve = /* @__PURE__ */ ((r) => (r.INLINE = "inline", r.SINGLELINE = "singleline", r.MULTILINE = "multiline", r))(ve || {}), re = /* @__PURE__ */ ((r) => (r.JSON = "json", r.XML = "xml", r.JAVA = "java", r.JAVASCRIPT = "javascript", r))(re || {}), ce = /* @__PURE__ */ ((r) => (r.ACTION = "action", r.CHANGE = "change", r))(ce || {});
-const Kt = {
-  [re.JSON]: Ct,
-  [re.XML]: Nt,
-  [re.JAVASCRIPT]: St,
-  [re.JAVA]: At
-}, Ft = (r) => async () => Kt[r], qt = (r, e) => {
-  const t = r.doc.lineAt(e.from), n = /^\s*/.exec(t.text);
-  return n ? n[0] : "";
-}, Xt = {
-  key: "Enter",
-  run: ({ state: r, dispatch: e }) => {
-    const t = r.changeByRange((n) => {
-      const s = `
-${qt(r, n)}`;
-      return {
-        changes: { from: n.from, to: n.to, insert: s },
-        range: ft.cursor(n.from + s.length)
-      };
-    });
-    return e(r.update(t, { scrollIntoView: !0, userEvent: "input" })), !0;
-  }
-};
-let Ge = 0;
-const Zt = {
-  beforeCreate() {
-    this.uuid = Ge.toString(), Ge += 1;
-  }
-}, Qt = { key: 0 }, Yt = /* @__PURE__ */ ae("path", {
-  fill: "#00112C",
-  d: "M14.75 1.25V6.75H13.25V3.81083L10.0001 7.06072L8.93945 6.00006L12.1895 2.75H9.25V1.25H14.75Z"
-}, null, -1), en = /* @__PURE__ */ ae("path", {
-  fill: "#00112C",
-  d: "M2.75 12.1895V9.25H1.25V14.75H6.75V13.25H3.81083L7.06072 10.0001L6.00006 8.93945L2.75 12.1895Z"
-}, null, -1);
-function tn(r, e, t, n, i, s) {
-  return O(), le("svg", Fe({ role: "img" }, r.$attrs, {
-    class: "ui-assets-icons-16",
-    xmlns: "http://www.w3.org/2000/svg",
-    width: "16",
-    height: "16",
-    fill: "none"
-  }), [
-    r.$attrs["svg-title"] ? (O(), le("title", Qt, Ae(r.$attrs["svg-title"]), 1)) : F("", !0),
-    Yt,
-    en
-  ], 16);
-}
-const nn = /* @__PURE__ */ qe(Zt, [["render", tn]]), Ke = {
-  "en-US": {
-    run: "Run",
-    expand: "Expand"
-  }
-}, rn = Ye({
-  i18n: { messages: Ke },
-  name: "bento-code-snippet",
-  components: {
-    BentoTypography: yt,
-    BentoButton: bt,
-    BentoDropdown: mt,
-    Copy: wt,
-    BaseModal: vt,
-    BentoLoadingIndicator: kt,
-    ExpandIcon: nn
-  },
-  directives: { BentoTooltipDirective: xt },
-  props: {
-    /**
-     * Defines the variant of code-snippet
-     */
-    variant: {
-      type: String,
-      default: ve.MULTILINE,
-      validator: (r) => Object.values(ve).includes(r)
-    },
-    /**
-     * Language name for syntax highlighting rules
-     */
-    lang: {
-      type: String,
-      default: re.JSON,
-      validator: (r) => Object.values(re).includes(r)
-    },
-    /**
-     * Label to show in the action-bar, describing the language
-     */
-    langLabel: {
-      type: String,
-      default: null
-    },
-    /**
-     * The code content
-     */
-    content: {
-      type: String,
-      default: ""
-    },
-    /**
-     * Allows editing of the code-snippet content by the user
-     */
-    editable: {
-      type: Boolean,
-      default: !1
-    },
-    /**
-     * Displays a button that when clicked will emit an action event
-     * Leaves to the parent component the logic of what to do with it
-     */
-    actionable: {
-      type: Boolean,
-      default: !1
-    },
-    /**
-     * Displays a button that can expand the codeblock into a modal to easily
-     * view large blocks of code.
-     */
-    expandable: {
-      type: Boolean,
-      default: !1
-    },
-    /**
-     * Displays a button that when clicked will emit a run event
-     * Leaves to the parent component the logic of what to do with it
-     */
-    actionableText: {
-      type: String,
-      default: "run"
-    },
-    /**
-     * Toggles the loading indicator within the action bar
-     */
-    loading: {
-      type: Boolean,
-      default: !1
-    }
-  },
-  emits: [ce.ACTION, ce.CHANGE],
-  setup(r, { emit: e }) {
-    const { t } = _t({ messages: Ke }), n = ge(null), i = [], s = () => {
-    }, o = ue(() => r.langLabel ?? r.lang.toUpperCase()), u = ue(() => r.variant === ve.INLINE), f = ue(() => ({
-      "b-code-snippet--inline": u.value,
-      "b-code-snippet--scrollable": !u.value
-    })), x = ue(() => ({
-      "b-code-snippet__code-area-content--editable": r.editable
-    })), w = Ft(r.lang), C = Pe(), A = Pe(), B = new Ne(), N = new Ne(), T = new Ne(), M = ge(null), D = ge(0);
-    et(async () => {
-      const g = await w();
-      M.value = r.content;
-      const b = ({ state: p }) => {
-        M.value = p.doc.toString();
-      }, h = [
-        at(),
-        ut.of([ct, Xt]),
-        B.of(g()),
-        N.of(Gt),
-        T.of(je.readOnly.of(!r.editable)),
-        He.updateListener.of((p) => b(p))
-      ];
-      r.variant === "multiline" && h.push([ht(), dt()]);
-      const y = je.create({
-        doc: r.content,
-        extensions: [...h]
-      });
-      D.value = y.doc.length, A.value = new He({
-        state: y,
-        parent: C.value
-      });
-    }), tt(
-      () => r.content,
-      () => {
-        if (r.content !== M.value) {
-          const g = r.content.length;
-          A.value.dispatch({
-            changes: {
-              from: 0,
-              to: D.value,
-              insert: r.content
-            }
-          }), D.value = g;
-        }
-      }
-    );
-    const U = ue(() => t(r.actionableText)), S = () => {
-      e(ce.ACTION, M.value);
-    };
-    nt(() => {
-      M.value !== null && e(ce.CHANGE, M.value);
-    });
-    const J = ge(!1);
-    return {
-      // Values
-      availableLanguages: i,
-      codeAreaContentConditionalClasses: x,
-      conditionalClasses: f,
-      container: C,
-      currentContents: M,
-      displayedLang: o,
-      editor: A,
-      selectedLanguage: n,
-      showModal: J,
-      isInlineVariant: u,
-      // Methods
-      handleChangeLanguage: s,
-      onActionClicked: S,
-      runText: U,
-      // Translations
-      t
-    };
-  }
-});
-const sn = (r) => (ot("data-v-5eb6a936"), r = r(), lt(), r), on = {
-  key: 0,
-  class: "b-code-snippet__action-bar"
-}, ln = { class: "b-code-snippet__action-bar--start" }, an = { class: "b-code-snippet__action-bar--end" }, un = {
-  key: 1,
-  class: "b-code-snippet__code-area"
-}, hn = { key: 2 }, fn = /* @__PURE__ */ sn(() => /* @__PURE__ */ ae("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
-function cn(r, e, t, n, i, s) {
-  const o = K("bento-dropdown"), u = K("bento-typography"), f = K("bento-loading-indicator"), x = K("copy"), w = K("expand-icon"), C = K("bento-button"), A = K("bento-code-snippet"), B = K("base-modal");
-  return O(), le("div", {
-    class: $e(["b-code-snippet", r.conditionalClasses])
-  }, [
-    r.isInlineVariant ? F("", !0) : (O(), le("section", on, [
-      ae("div", ln, [
-        r.availableLanguages.length > 0 ? (O(), oe(o, Fe({
-          key: 0,
-          modelValue: r.selectedLanguage,
-          "onUpdate:modelValue": e[0] || (e[0] = (N) => r.selectedLanguage = N)
-        }, r.$props, {
-          disabled: r.availableLanguages.length === 1,
-          items: r.availableLanguages,
-          class: "b-code-snippet__language-picker",
-          onInput: r.handleChangeLanguage
-        }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : F("", !0),
-        me(u, {
-          el: "span",
-          stronger: ""
-        }, {
-          default: he(() => [
-            Ve(Ae(r.displayedLang), 1)
-          ]),
-          _: 1
-        })
-      ]),
-      ae("div", an, [
-        r.loading ? (O(), oe(f, { key: 0 })) : F("", !0),
-        r.currentContents !== null ? (O(), oe(x, {
-          key: 1,
-          class: "b-structured-list__icon",
-          text: r.currentContents
-        }, null, 8, ["text"])) : F("", !0),
-        r.expandable ? (O(), oe(C, {
-          key: 2,
-          variant: "tertiary",
-          condensed: "",
-          "aria-label": r.t("expand"),
-          onClick: e[1] || (e[1] = (N) => r.showModal = !0)
-        }, {
-          iconLeft: he(() => [
-            me(w)
-          ]),
-          _: 1
-        }, 8, ["aria-label"])) : F("", !0),
-        r.actionable ? (O(), oe(C, {
-          key: 3,
-          variant: "primary",
-          tertiary: "",
-          condensed: "",
-          onClick: r.onActionClicked
-        }, {
-          iconLeft: he(() => [
-            me(u, {
-              el: "span",
-              class: "b-code-snippet__action-button"
-            }, {
-              default: he(() => [
-                Ve(Ae(r.runText), 1)
-              ]),
-              _: 1
-            })
-          ]),
-          _: 1
-        }, 8, ["onClick"])) : F("", !0)
-      ])
-    ])),
-    r.content || r.editable ? (O(), le("code", un, [
-      ae("div", {
-        ref: "container",
-        class: $e(["b-code-snippet__code-area-content", r.codeAreaContentConditionalClasses])
-      }, null, 2)
-    ])) : (O(), le("section", hn, [
-      rt(r.$slots, "empty-state", {}, () => [
-        fn
-      ], !0)
-    ])),
-    r.expandable ? (O(), oe(B, {
-      key: 3,
-      class: "b-code-snippet__modal",
-      "hide-close-button": !0,
-      "custom-padding": "0px",
-      "is-dismissible": !0,
-      "is-open": r.showModal,
-      size: "large",
-      onCloseModal: e[2] || (e[2] = (N) => r.showModal = !1)
-    }, {
-      content: he(() => [
-        me(A, it(st({ ...r.$props, expandable: !1 })), null, 16)
-      ]),
-      _: 1
-    }, 8, ["is-open"])) : F("", !0)
-  ], 2);
-}
-const En = /* @__PURE__ */ qe(rn, [["render", cn], ["__scopeId", "data-v-5eb6a936"]]);
+import { c as n, b as o, a as p, B as a } from "./chunks/code-snippet.e8bxDBCO.js";
 export {
-  En as BentoCodeSnippet,
-  ce as BentoCodeSnippetEvent,
-  re as BentoCodeSnippetSupportedLanguage,
-  ve as BentoCodeSnippetVariant
+  n as BentoCodeSnippet,
+  o as BentoCodeSnippetEvent,
+  p as BentoCodeSnippetSupportedLanguage,
+  a as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map