@adyen/bento-vue3 1.8.0 → 1.9.0

package/dist/code-snippet.js

@@ -1,30 +1,30 @@
-import { openBlock as z, createElementBlock as le, mergeProps as qe, toDisplayString as Ae, createCommentVNode as q, pushScopeId as Fe, popScopeId as Xe, createElementVNode as ae, defineComponent as nt, ref as ge, computed as ue, shallowRef as $e, onMounted as rt, watch as it, watchEffect as st, resolveComponent as K, normalizeClass as Te, createBlock as oe, createVNode as me, withCtx as fe, createTextVNode as je, renderSlot as ot, normalizeProps as lt, guardReactiveProps as at } from "vue";
-import { highlightActiveLine as ut, keymap as ft, EditorView as He, lineNumbers as ht } from "@codemirror/view";
-import { Compartment as Ne, EditorState as Ve } from "@codemirror/state";
-import { indentWithTab as dt, history as ct } from "@codemirror/commands";
-import { syntaxHighlighting as pt, HighlightStyle as gt } from "@codemirror/language";
-import { json as mt } from "@codemirror/lang-json";
-import { xml as bt } from "@codemirror/lang-xml";
-import { javascript as yt } from "@codemirror/lang-javascript";
-import { java as xt } from "@codemirror/lang-java";
-import { B as kt } from "./chunks/dropdown.502e1f5c.js";
-import { f as Ct } from "./chunks/base-modal.3dcf8376.js";
-import { a as vt } from "./chunks/button.82ed953e.js";
-import { B as _t } from "./chunks/index.75f3672e.js";
-import { b as wt } from "./chunks/tooltip.054d2eb6.js";
-import { BentoLoadingIndicator as Nt } from "./loading-indicator.js";
-import { u as St } from "./chunks/i18n.6c402773.js";
-import { _ as Ze } from "./chunks/_plugin-vue_export-helper.dad06003.js";
-import { C as At } from "./chunks/copy.28bd4298.js";
-import "./assets/index4.css";
-const It = 1024;
-let Bt = 0;
+import { openBlock as z, createElementBlock as le, mergeProps as qe, toDisplayString as Ae, createCommentVNode as q, createElementVNode as ae, defineComponent as Ye, ref as ge, computed as ue, shallowRef as Te, onMounted as et, watch as tt, watchEffect as nt, resolveComponent as K, normalizeClass as $e, createBlock as oe, createVNode as me, withCtx as fe, createTextVNode as He, 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 Ve, lineNumbers as ft } from "@codemirror/view";
+import { Compartment as Ne, EditorState as je } from "@codemirror/state";
+import { indentWithTab as ht, history as dt } from "@codemirror/commands";
+import { syntaxHighlighting as ct, HighlightStyle as pt } from "@codemirror/language";
+import { json as gt } from "@codemirror/lang-json";
+import { xml as mt } from "@codemirror/lang-xml";
+import { javascript as bt } from "@codemirror/lang-javascript";
+import { java as yt } from "@codemirror/lang-java";
+import { B as xt } from "./chunks/dropdown.63de9aac.js";
+import { f as kt } from "./chunks/base-modal.a629cb32.js";
+import { a as _t } from "./chunks/button.82ed953e.js";
+import { B as vt } from "./chunks/index.75f3672e.js";
+import { b as wt } from "./chunks/tooltip.27c32d36.js";
+import { BentoLoadingIndicator as Ct } from "./loading-indicator.js";
+import { u as Nt } from "./chunks/i18n.6c402773.js";
+import { _ as Fe } from "./chunks/_plugin-vue_export-helper.dad06003.js";
+import { C as St } from "./chunks/copy.330d594e.js";
+import "./assets/index10.css";
+const At = 1024;
+let It = 0;
 class v {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = Bt++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = It++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -41,25 +41,25 @@ class v {
     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 r = e(t);
-      return r === void 0 ? null : [this, r];
+      let n = e(t);
+      return n === void 0 ? null : [this, n];
     };
   }
 }
-v.closedBy = new v({ deserialize: (n) => n.split(" ") });
-v.openedBy = new v({ deserialize: (n) => n.split(" ") });
-v.group = new v({ deserialize: (n) => n.split(" ") });
-v.isolate = new v({ deserialize: (n) => {
-  if (n && n != "rtl" && n != "ltr" && n != "auto")
-    throw new RangeError("Invalid value for isolate: " + n);
-  return n || "auto";
+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 _e {
-  constructor(e, t, r) {
-    this.tree = e, this.overlay = t, this.parser = r;
+class we {
+  constructor(e, t, n) {
+    this.tree = e, this.overlay = t, this.parser = n;
   }
   /**
   @internal
@@ -73,14 +73,14 @@ class G {
   /**
   @internal
   */
-  constructor(e, t, r, i = 0) {
-    this.name = e, this.props = t, this.id = r, this.flags = i;
+  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) : Lt, r = (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, r);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Lt, 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) {
@@ -146,12 +146,12 @@ class G {
   */
   static match(e) {
     let t = /* @__PURE__ */ Object.create(null);
-    for (let r in e)
-      for (let i of r.split(" "))
-        t[i] = e[r];
-    return (r) => {
-      for (let i = r.prop(v.group), s = -1; s < (i ? i.length : 0); s++) {
-        let o = t[s < 0 ? r.name : i[s]];
+    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;
       }
@@ -167,15 +167,15 @@ G.none = new G(
 );
 const be = /* @__PURE__ */ new WeakMap(), Re = /* @__PURE__ */ new WeakMap();
 var I;
-(function(n) {
-  n[n.ExcludeBuffers = 1] = "ExcludeBuffers", n[n.IncludeAnonymous = 2] = "IncludeAnonymous", n[n.IgnoreMounts = 4] = "IgnoreMounts", n[n.IgnoreOverlays = 8] = "IgnoreOverlays";
+(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, r, i, s) {
-    if (this.type = e, this.children = t, this.positions = r, this.length = i, this.props = null, s && s.length) {
+  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;
@@ -185,12 +185,12 @@ class R {
   @internal
   */
   toString() {
-    let e = _e.get(this);
+    let e = we.get(this);
     if (e && !e.overlay)
       return e.tree.toString();
     let t = "";
-    for (let r of this.children) {
-      let i = r.toString();
+    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;
@@ -201,15 +201,15 @@ class R {
   nodes the cursor visits.
   */
   cursor(e = 0) {
-    return new Be(this.topNode, e);
+    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, r = 0) {
-    let i = be.get(this) || this.topNode, s = new Be(i);
+  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;
   }
   /**
@@ -231,8 +231,8 @@ class R {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let r = ce(be.get(this) || this.topNode, e, t, !1);
-    return be.set(this, r), r;
+    let n = ce(be.get(this) || this.topNode, e, t, !1);
+    return be.set(this, n), n;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -242,8 +242,8 @@ class R {
   the host trees).
   */
   resolveInner(e, t = 0) {
-    let r = ce(Re.get(this) || this.topNode, e, t, !0);
-    return Re.set(this, r), r;
+    let n = ce(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
@@ -253,7 +253,7 @@ class R {
   position.
   */
   resolveStack(e, t = 0) {
-    return Et(this, e, t);
+    return zt(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -263,7 +263,7 @@ class R {
   not have its children iterated over (or `leave` called).
   */
   iterate(e) {
-    let { enter: t, leave: r, from: i = 0, to: s = this.length } = e, o = e.mode || 0, u = (o & I.IncludeAnonymous) > 0;
+    let { enter: t, leave: n, from: i = 0, to: s = this.length } = e, o = e.mode || 0, u = (o & I.IncludeAnonymous) > 0;
     for (let h = this.cursor(o | I.IncludeAnonymous); ; ) {
       let x = !1;
       if (h.from <= s && h.to >= i && (!u && h.type.isAnonymous || t(h) !== !1)) {
@@ -271,7 +271,7 @@ class R {
           continue;
         x = !0;
       }
-      for (; x && r && (u || !h.type.isAnonymous) && r(h), !h.nextSibling(); ) {
+      for (; x && n && (u || !h.type.isAnonymous) && n(h), !h.nextSibling(); ) {
         if (!h.parent())
           return;
         x = !0;
@@ -303,14 +303,14 @@ class R {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : Ee(G.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, r, i) => new R(this.type, t, r, i, this.propValues), e.makeTree || ((t, r, i) => new R(G.none, t, r, i)));
+    return this.children.length <= 8 ? this : Ee(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);
+    return Et(e);
   }
 }
 R.empty = new R(G.none, [], [], 0);
@@ -344,8 +344,8 @@ class Q {
   /**
   Create a tree buffer.
   */
-  constructor(e, t, r) {
-    this.buffer = e, this.length = t, this.set = r;
+  constructor(e, t, n) {
+    this.buffer = e, this.length = t, this.set = n;
   }
   /**
   @internal
@@ -366,80 +366,80 @@ class Q {
   @internal
   */
   childString(e) {
-    let t = this.buffer[e], r = this.buffer[e + 3], i = this.set.types[t], s = i.name;
-    if (/\W/.test(s) && !i.isError && (s = JSON.stringify(s)), e += 4, r == 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 < r; )
+    for (; e < n; )
       o.push(this.childString(e)), e = this.buffer[e + 3];
     return s + "(" + o.join(",") + ")";
   }
   /**
   @internal
   */
-  findChild(e, t, r, i, s) {
+  findChild(e, t, n, i, s) {
     let { buffer: o } = this, u = -1;
-    for (let h = e; h != t && !(Qe(s, i, o[h + 1], o[h + 2]) && (u = h, r > 0)); h = o[h + 3])
+    for (let h = e; h != t && !(Xe(s, i, o[h + 1], o[h + 2]) && (u = h, n > 0)); h = o[h + 3])
       ;
     return u;
   }
   /**
   @internal
   */
-  slice(e, t, r) {
+  slice(e, t, n) {
     let i = this.buffer, s = new Uint16Array(t - e), o = 0;
     for (let u = e, h = 0; u < t; ) {
-      s[h++] = i[u++], s[h++] = i[u++] - r;
-      let x = s[h++] = i[u++] - r;
+      s[h++] = i[u++], s[h++] = i[u++] - n;
+      let x = s[h++] = i[u++] - n;
       s[h++] = i[u++] - e, o = Math.max(o, x);
     }
     return new Q(s, o, this.set);
   }
 }
-function Qe(n, e, t, r) {
-  switch (n) {
+function Xe(r, e, t, n) {
+  switch (r) {
     case -2:
       return t < e;
     case -1:
-      return r >= e && t < e;
+      return n >= e && t < e;
     case 0:
-      return t < e && r > e;
+      return t < e && n > e;
     case 1:
-      return t <= e && r > e;
+      return t <= e && n > e;
     case 2:
-      return r > e;
+      return n > e;
     case 4:
       return !0;
   }
 }
-function ce(n, e, t, r) {
-  for (var i; n.from == n.to || (t < 1 ? n.from >= e : n.from > e) || (t > -1 ? n.to <= e : n.to < e); ) {
-    let o = !r && n instanceof E && n.index < 0 ? null : n.parent;
+function ce(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 E && r.index < 0 ? null : r.parent;
     if (!o)
-      return n;
-    n = o;
+      return r;
+    r = o;
   }
-  let s = r ? 0 : I.IgnoreOverlays;
-  if (r)
-    for (let o = n, u = o.parent; u; o = u, u = o.parent)
-      o instanceof E && o.index < 0 && ((i = u.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (n = u);
+  let s = n ? 0 : I.IgnoreOverlays;
+  if (n)
+    for (let o = r, u = o.parent; u; o = u, u = o.parent)
+      o instanceof E && o.index < 0 && ((i = u.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (r = u);
   for (; ; ) {
-    let o = n.enter(e, t, s);
+    let o = r.enter(e, t, s);
     if (!o)
-      return n;
-    n = o;
+      return r;
+    r = o;
   }
 }
-class Ye {
+class Ze {
   cursor(e = 0) {
-    return new Be(this, e);
+    return new Le(this, e);
   }
-  getChild(e, t = null, r = null) {
-    let i = De(this, e, t, r);
+  getChild(e, t = null, n = null) {
+    let i = De(this, e, t, n);
     return i.length ? i[0] : null;
   }
-  getChildren(e, t = null, r = null) {
-    return De(this, e, t, r);
+  getChildren(e, t = null, n = null) {
+    return De(this, e, t, n);
   }
   resolve(e, t = 0) {
     return ce(this, e, t, !1);
@@ -451,14 +451,14 @@ class Ye {
     return Ie(this, e);
   }
   enterUnfinishedNodesBefore(e) {
-    let t = this.childBefore(e), r = this;
+    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 ? (r = t, t = i.prevSibling) : t = i;
+      i.type.isError && i.from == i.to ? (n = t, t = i.prevSibling) : t = i;
     }
-    return r;
+    return n;
   }
   get node() {
     return this;
@@ -467,9 +467,9 @@ class Ye {
     return this.parent;
   }
 }
-class E extends Ye {
-  constructor(e, t, r, i) {
-    super(), this._tree = e, this.from = t, this.index = r, this._parent = i;
+class E 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;
@@ -480,23 +480,23 @@ class E extends Ye {
   get to() {
     return this.from + this._tree.length;
   }
-  nextChild(e, t, r, i, s = 0) {
+  nextChild(e, t, n, i, s = 0) {
     for (let o = this; ; ) {
       for (let { children: u, positions: h } = o._tree, x = t > 0 ? u.length : -1; e != x; e += t) {
-        let _ = u[e], w = h[e] + o.from;
-        if (Qe(i, r, w, w + _.length)) {
-          if (_ instanceof Q) {
+        let w = u[e], C = h[e] + o.from;
+        if (Xe(i, n, C, C + w.length)) {
+          if (w instanceof Q) {
             if (s & I.ExcludeBuffers)
               continue;
-            let A = _.findChild(0, _.buffer.length, t, r - w, i);
+            let A = w.findChild(0, w.buffer.length, t, n - C, i);
             if (A > -1)
-              return new Z(new Ot(o, _, e, w), null, A);
-          } else if (s & I.IncludeAnonymous || !_.type.isAnonymous || ze(_)) {
+              return new Z(new Bt(o, w, e, C), null, A);
+          } else if (s & I.IncludeAnonymous || !w.type.isAnonymous || ze(w)) {
             let A;
-            if (!(s & I.IgnoreMounts) && (A = _e.get(_)) && !A.overlay)
-              return new E(A.tree, w, e, o);
-            let L = new E(_, w, e, o);
-            return s & I.IncludeAnonymous || !L.type.isAnonymous ? L : L.nextChild(t < 0 ? _.children.length - 1 : 0, t, r, i);
+            if (!(s & I.IgnoreMounts) && (A = we.get(w)) && !A.overlay)
+              return new E(A.tree, C, e, o);
+            let B = new E(w, C, e, o);
+            return s & I.IncludeAnonymous || !B.type.isAnonymous ? B : B.nextChild(t < 0 ? w.children.length - 1 : 0, t, n, i);
           }
         }
       }
@@ -540,15 +540,15 @@ class E extends Ye {
       /* Side.Before */
     );
   }
-  enter(e, t, r = 0) {
+  enter(e, t, n = 0) {
     let i;
-    if (!(r & I.IgnoreOverlays) && (i = _e.get(this._tree)) && i.overlay) {
+    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 E(i.tree, i.overlay[0].from + this.from, -1, this);
     }
-    return this.nextChild(0, 1, e, t, r);
+    return this.nextChild(0, 1, e, t, n);
   }
   nextSignificantParent() {
     let e = this;
@@ -590,8 +590,8 @@ class E extends Ye {
     return this._tree.toString();
   }
 }
-function De(n, e, t, r) {
-  let i = n.cursor(), s = [];
+function De(r, e, t, n) {
+  let i = r.cursor(), s = [];
   if (!i.firstChild())
     return s;
   if (t != null) {
@@ -600,30 +600,30 @@ function De(n, e, t, r) {
         return s;
   }
   for (; ; ) {
-    if (r != null && i.type.is(r))
+    if (n != null && i.type.is(n))
       return s;
     if (i.type.is(e) && s.push(i.node), !i.nextSibling())
-      return r == null ? s : [];
+      return n == null ? s : [];
   }
 }
-function Ie(n, e, t = e.length - 1) {
-  for (let r = n.parent; t >= 0; r = r.parent) {
-    if (!r)
+function Ie(r, e, t = e.length - 1) {
+  for (let n = r.parent; t >= 0; n = n.parent) {
+    if (!n)
       return !1;
-    if (!r.type.isAnonymous) {
-      if (e[t] && e[t] != r.name)
+    if (!n.type.isAnonymous) {
+      if (e[t] && e[t] != n.name)
         return !1;
       t--;
     }
   }
   return !0;
 }
-class Ot {
-  constructor(e, t, r, i) {
-    this.parent = e, this.buffer = t, this.index = r, this.start = i;
+class Bt {
+  constructor(e, t, n, i) {
+    this.parent = e, this.buffer = t, this.index = n, this.start = i;
   }
 }
-class Z extends Ye {
+class Z extends Ze {
   get name() {
     return this.type.name;
   }
@@ -633,11 +633,11 @@ class Z extends Ye {
   get to() {
     return this.context.start + this.context.buffer.buffer[this.index + 2];
   }
-  constructor(e, t, r) {
-    super(), this.context = e, this._parent = t, this.index = r, this.type = e.buffer.set.types[e.buffer.buffer[r]];
+  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, r) {
-    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, r);
+  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() {
@@ -672,8 +672,8 @@ class Z extends Ye {
       /* Side.Before */
     );
   }
-  enter(e, t, r = 0) {
-    if (r & I.ExcludeBuffers)
+  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);
@@ -709,10 +709,10 @@ class Z extends Ye {
     return null;
   }
   toTree() {
-    let e = [], t = [], { buffer: r } = this.context, i = this.index + 4, s = r.buffer[this.index + 3];
+    let e = [], t = [], { buffer: n } = this.context, i = this.index + 4, s = n.buffer[this.index + 3];
     if (s > i) {
-      let o = r.buffer[this.index + 1];
-      e.push(r.slice(i, s, o)), t.push(0);
+      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);
   }
@@ -723,41 +723,41 @@ class Z extends Ye {
     return this.context.buffer.childString(this.index);
   }
 }
-function et(n) {
-  if (!n.length)
+function Qe(r) {
+  if (!r.length)
     return null;
-  let e = 0, t = n[0];
-  for (let s = 1; s < n.length; s++) {
-    let o = n[s];
+  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 r = t instanceof E && t.index < 0 ? null : t.parent, i = n.slice();
-  return r ? i[e] = r : i.splice(e, 1), new zt(i, t);
+  let n = t instanceof E && t.index < 0 ? null : t.parent, i = r.slice();
+  return n ? i[e] = n : i.splice(e, 1), new Ot(i, t);
 }
-class zt {
+class Ot {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
   get next() {
-    return et(this.heads);
+    return Qe(this.heads);
   }
 }
-function Et(n, e, t) {
-  let r = n.resolveInner(e, t), i = null;
-  for (let s = r instanceof E ? r : r.context.parent; s; s = s.parent)
+function zt(r, e, t) {
+  let n = r.resolveInner(e, t), i = null;
+  for (let s = n instanceof E ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
       let o = s.parent;
-      (i || (i = [r])).push(o.resolve(e, t)), s = o;
+      (i || (i = [n])).push(o.resolve(e, t)), s = o;
     } else {
-      let o = _e.get(s.tree);
+      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 E(o.tree, o.overlay[0].from + s.from, -1, s);
-        (i || (i = [r])).push(ce(u, e, t, !1));
+        (i || (i = [n])).push(ce(u, e, t, !1));
       }
     }
-  return i ? et(i) : r;
+  return i ? Qe(i) : n;
 }
-class Be {
+class Le {
   /**
   Shorthand for `.type.name`.
   */
@@ -772,8 +772,8 @@ class Be {
       this.yieldNode(e);
     else {
       this._tree = e.context.parent, this.buffer = e.context;
-      for (let r = e._parent; r; r = r._parent)
-        this.stack.unshift(r.index);
+      for (let n = e._parent; n; n = n._parent)
+        this.stack.unshift(n.index);
       this.bufferNode = e, this.yieldBuf(e.index);
     }
   }
@@ -782,8 +782,8 @@ class Be {
   }
   yieldBuf(e, t) {
     this.index = e;
-    let { start: r, buffer: i } = this.buffer;
-    return this.type = t || i.set.types[i.buffer[e]], this.from = r + i.buffer[e + 1], this.to = r + i.buffer[e + 2], !0;
+    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
@@ -800,10 +800,10 @@ class Be {
   /**
   @internal
   */
-  enterChild(e, t, r) {
+  enterChild(e, t, n) {
     if (!this.buffer)
-      return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, r, this.mode));
-    let { buffer: i } = this.buffer, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.buffer.start, r);
+      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));
   }
   /**
@@ -858,8 +858,8 @@ class Be {
   [mounted](#common.NodeProp^mounted) trees unless `overlays` is
   set to false.
   */
-  enter(e, t, r = this.mode) {
-    return this.buffer ? r & I.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, r));
+  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.
@@ -878,9 +878,9 @@ class Be {
   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, r = this.stack.length - 1;
+    let { buffer: t } = this.buffer, n = this.stack.length - 1;
     if (e < 0) {
-      let i = r < 0 ? 0 : this.stack[r] + 4;
+      let i = n < 0 ? 0 : this.stack[n] + 4;
       if (this.index != i)
         return this.yieldBuf(t.findChild(
           i,
@@ -892,10 +892,10 @@ class Be {
         ));
     } else {
       let i = t.buffer[this.index + 3];
-      if (i < (r < 0 ? t.buffer.length : t.buffer[this.stack[r] + 3]))
+      if (i < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3]))
         return this.yieldBuf(i);
     }
-    return r < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
+    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.
@@ -910,7 +910,7 @@ class Be {
     return this.sibling(-1);
   }
   atLastNode(e) {
-    let t, r, { buffer: i } = this;
+    let t, n, { buffer: i } = this;
     if (i) {
       if (e > 0) {
         if (this.index < i.buffer.buffer.length)
@@ -919,13 +919,13 @@ class Be {
         for (let s = 0; s < this.index; s++)
           if (i.buffer.buffer[s + 3] < this.index)
             return !1;
-      ({ index: t, parent: r } = i);
+      ({ index: t, parent: n } = i);
     } else
-      ({ index: t, _parent: r } = this._tree);
-    for (; r; { index: t, _parent: r } = r)
+      ({ 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 : r._tree.children.length; s != o; s += e) {
-          let u = r._tree.children[s];
+        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 || ze(u))
             return !1;
         }
@@ -984,7 +984,7 @@ class Be {
   get node() {
     if (!this.buffer)
       return this._tree;
-    let e = this.bufferNode, t = null, r = 0;
+    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; ) {
@@ -992,12 +992,12 @@ class Be {
             if (o.index == i) {
               if (i == this.index)
                 return o;
-              t = o, r = s + 1;
+              t = o, n = s + 1;
               break e;
             }
           i = this.stack[--s];
         }
-    for (let i = r; i < this.stack.length; i++)
+    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);
   }
@@ -1016,19 +1016,19 @@ class Be {
   skipped, and `leave` isn't called for it.
   */
   iterate(e, t) {
-    for (let r = 0; ; ) {
+    for (let n = 0; ; ) {
       let i = !1;
       if (this.type.isAnonymous || e(this) !== !1) {
         if (this.firstChild()) {
-          r++;
+          n++;
           continue;
         }
         this.type.isAnonymous || (i = !0);
       }
       for (; i && t && t(this), i = this.type.isAnonymous, !this.nextSibling(); ) {
-        if (!r)
+        if (!n)
           return;
-        this.parent(), r--, i = !0;
+        this.parent(), n--, i = !0;
       }
     }
   }
@@ -1040,11 +1040,11 @@ class Be {
   matchContext(e) {
     if (!this.buffer)
       return Ie(this.node, e);
-    let { buffer: t } = this.buffer, { types: r } = t.set;
+    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 = r[t.buffer[this.stack[s]]];
+      let o = n[t.buffer[this.stack[s]]];
       if (!o.isAnonymous) {
         if (e[i] && e[i] != o.name)
           return !1;
@@ -1054,14 +1054,14 @@ class Be {
     return !0;
   }
 }
-function ze(n) {
-  return n.children.some((e) => e instanceof Q || !e.type.isAnonymous || ze(e));
+function ze(r) {
+  return r.children.some((e) => e instanceof Q || !e.type.isAnonymous || ze(e));
 }
-function Mt(n) {
+function Et(r) {
   var e;
-  let { buffer: t, nodeSet: r, maxBufferLength: i = It, reused: s = [], minRepeatType: o = r.types.length } = n, u = Array.isArray(t) ? new Oe(t, t.length) : t, h = r.types, x = 0, _ = 0;
-  function w(g, b, f, y, p, m) {
-    let { id: d, start: c, end: C, size: k } = u, B = _;
+  let { buffer: t, nodeSet: n, maxBufferLength: i = At, reused: s = [], minRepeatType: o = n.types.length } = r, u = Array.isArray(t) ? new Oe(t, t.length) : t, h = n.types, x = 0, w = 0;
+  function C(g, b, f, y, p, m) {
+    let { id: d, start: c, end: _, size: k } = u, L = w;
     for (; k < 0; )
       if (u.next(), k == -1) {
         let W = s[d];
@@ -1071,50 +1071,50 @@ function Mt(n) {
         x = d;
         return;
       } else if (k == -4) {
-        _ = d;
+        w = d;
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${k}`);
     let Y = h[d], ie, ee, Me = c - g;
-    if (C - c <= i && (ee = M(u.pos - b, p))) {
-      let W = new Uint16Array(ee.size - ee.skip), O = u.pos - ee.size, $ = W.length;
+    if (_ - c <= i && (ee = M(u.pos - b, p))) {
+      let W = new Uint16Array(ee.size - ee.skip), O = u.pos - ee.size, T = W.length;
       for (; u.pos > O; )
-        $ = D(ee.start, W, $);
-      ie = new Q(W, C - ee.start, r), Me = ee.start - g;
+        T = D(ee.start, W, T);
+      ie = new Q(W, _ - ee.start, n), Me = ee.start - g;
     } else {
       let W = u.pos - k;
       u.next();
-      let O = [], $ = [], te = d >= o ? d : -1, se = 0, pe = C;
+      let O = [], T = [], te = d >= o ? d : -1, se = 0, pe = _;
       for (; u.pos > W; )
-        te >= 0 && u.id == te && u.size >= 0 ? (u.end <= pe - i && (N(O, $, c, se, u.end, pe, te, B), se = O.length, pe = u.end), u.next()) : m > 2500 ? A(c, W, O, $) : w(c, W, O, $, te, m + 1);
-      if (te >= 0 && se > 0 && se < O.length && N(O, $, c, se, c, pe, te, B), O.reverse(), $.reverse(), te > -1 && se > 0) {
-        let Pe = L(Y);
-        ie = Ee(Y, O, $, 0, O.length, 0, C - c, Pe, Pe);
+        te >= 0 && u.id == te && u.size >= 0 ? (u.end <= pe - i && (N(O, T, c, se, u.end, pe, te, L), se = O.length, pe = u.end), u.next()) : m > 2500 ? A(c, W, O, T) : C(c, W, O, T, te, m + 1);
+      if (te >= 0 && se > 0 && se < O.length && N(O, T, c, se, c, pe, te, L), O.reverse(), T.reverse(), te > -1 && se > 0) {
+        let Pe = B(Y);
+        ie = Ee(Y, O, T, 0, O.length, 0, _ - c, Pe, Pe);
       } else
-        ie = P(Y, O, $, C - c, B - C);
+        ie = P(Y, O, T, _ - c, L - _);
     }
     f.push(ie), y.push(Me);
   }
   function A(g, b, f, y) {
     let p = [], m = 0, d = -1;
     for (; u.pos > b; ) {
-      let { id: c, start: C, end: k, size: B } = u;
-      if (B > 4)
+      let { id: c, start: _, end: k, size: L } = u;
+      if (L > 4)
         u.next();
       else {
-        if (d > -1 && C < d)
+        if (d > -1 && _ < d)
           break;
-        d < 0 && (d = k - i), p.push(c, C, k), m++, u.next();
+        d < 0 && (d = k - i), p.push(c, _, k), m++, u.next();
       }
     }
     if (m) {
-      let c = new Uint16Array(m * 4), C = p[p.length - 2];
-      for (let k = p.length - 3, B = 0; k >= 0; k -= 3)
-        c[B++] = p[k], c[B++] = p[k + 1] - C, c[B++] = p[k + 2] - C, c[B++] = B;
-      f.push(new Q(c, p[2] - C, r)), y.push(C - g);
+      let c = new Uint16Array(m * 4), _ = p[p.length - 2];
+      for (let k = p.length - 3, L = 0; k >= 0; k -= 3)
+        c[L++] = p[k], c[L++] = p[k + 1] - _, c[L++] = p[k + 2] - _, c[L++] = L;
+      f.push(new Q(c, p[2] - _, n)), y.push(_ - g);
     }
   }
-  function L(g) {
+  function B(g) {
     return (b, f, y) => {
       let p = 0, m = b.length - 1, d, c;
       if (m >= 0 && (d = b[m]) instanceof R) {
@@ -1126,10 +1126,10 @@ function Mt(n) {
     };
   }
   function N(g, b, f, y, p, m, d, c) {
-    let C = [], k = [];
+    let _ = [], k = [];
     for (; g.length > y; )
-      C.push(g.pop()), k.push(b.pop() + f - p);
-    g.push(P(r.types[d], C, k, m - p, c - m)), b.push(p - f);
+      _.push(g.pop()), k.push(b.pop() + f - p);
+    g.push(P(n.types[d], _, k, m - p, c - m)), b.push(p - f);
   }
   function P(g, b, f, y, p = 0, m) {
     if (x) {
@@ -1145,17 +1145,17 @@ function Mt(n) {
   function M(g, b) {
     let f = u.fork(), y = 0, p = 0, m = 0, d = f.end - i, c = { size: 0, start: 0, skip: 0 };
     e:
-      for (let C = f.pos - g; f.pos > C; ) {
+      for (let _ = f.pos - g; f.pos > _; ) {
         let k = f.size;
         if (f.id == b && k >= 0) {
           c.size = y, c.start = p, c.skip = m, m += 4, y += 4, f.next();
           continue;
         }
-        let B = f.pos - k;
-        if (k < 0 || B < C || f.start < d)
+        let L = f.pos - k;
+        if (k < 0 || L < _ || f.start < d)
           break;
         let Y = f.id >= o ? 4 : 0, ie = f.start;
-        for (f.next(); f.pos > B; ) {
+        for (f.next(); f.pos > L; ) {
           if (f.size < 0)
             if (f.size == -3)
               Y += 4;
@@ -1174,80 +1174,80 @@ function Mt(n) {
     if (u.next(), d >= 0 && y < o) {
       let c = f;
       if (d > 4) {
-        let C = u.pos - (d - 4);
-        for (; u.pos > C; )
+        let _ = u.pos - (d - 4);
+        for (; u.pos > _; )
           f = D(g, b, f);
       }
       b[--f] = c, b[--f] = m - g, b[--f] = p - g, b[--f] = y;
     } else
-      d == -3 ? x = y : d == -4 && (_ = y);
+      d == -3 ? x = y : d == -4 && (w = y);
     return f;
   }
   let U = [], S = [];
   for (; u.pos > 0; )
-    w(n.start || 0, n.bufferStart || 0, U, S, -1, 0);
-  let J = (e = n.length) !== null && e !== void 0 ? e : U.length ? S[0] + U[0].length : 0;
-  return new R(h[n.topID], U.reverse(), S.reverse(), J);
+    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(h[r.topID], U.reverse(), S.reverse(), J);
 }
 const Ue = /* @__PURE__ */ new WeakMap();
-function Ce(n, e) {
-  if (!n.isAnonymous || e instanceof Q || e.type != n)
+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 r of e.children) {
-      if (r.type != n || !(r instanceof R)) {
+    for (let n of e.children) {
+      if (n.type != r || !(n instanceof R)) {
         t = 1;
         break;
       }
-      t += Ce(n, r);
+      t += _e(r, n);
     }
     Ue.set(e, t);
   }
   return t;
 }
-function Ee(n, e, t, r, i, s, o, u, h) {
+function Ee(r, e, t, n, i, s, o, u, h) {
   let x = 0;
-  for (let N = r; N < i; N++)
-    x += Ce(n, e[N]);
-  let _ = Math.ceil(
+  for (let N = n; N < i; N++)
+    x += _e(r, e[N]);
+  let w = Math.ceil(
     x * 1.5 / 8
     /* Balance.BranchFactor */
-  ), w = [], A = [];
-  function L(N, P, M, D, U) {
+  ), C = [], A = [];
+  function B(N, P, M, D, U) {
     for (let S = M; S < D; ) {
-      let J = S, g = P[S], b = Ce(n, N[S]);
+      let J = S, g = P[S], b = _e(r, N[S]);
       for (S++; S < D; S++) {
-        let f = Ce(n, N[S]);
-        if (b + f >= _)
+        let f = _e(r, N[S]);
+        if (b + f >= w)
           break;
         b += f;
       }
       if (S == J + 1) {
-        if (b > _) {
+        if (b > w) {
           let f = N[J];
-          L(f.children, f.positions, 0, f.children.length, P[J] + U);
+          B(f.children, f.positions, 0, f.children.length, P[J] + U);
           continue;
         }
-        w.push(N[J]);
+        C.push(N[J]);
       } else {
         let f = P[S - 1] + N[S - 1].length - g;
-        w.push(Ee(n, N, P, J, S, g, f, null, h));
+        C.push(Ee(r, N, P, J, S, g, f, null, h));
       }
       A.push(g + U - s);
     }
   }
-  return L(e, t, r, i, 0), (u || h)(w, A, o);
+  return B(e, t, n, i, 0), (u || h)(C, A, o);
 }
 new v({ perNode: !0 });
-let Pt = 0;
-class V {
+let Mt = 0;
+class j {
   /**
   @internal
   */
-  constructor(e, t, r) {
-    this.set = e, this.base = t, this.modified = r, this.id = Pt++;
+  constructor(e, t, n) {
+    this.set = e, this.base = t, this.modified = n, this.id = Mt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1259,10 +1259,10 @@ class V {
   static define(e) {
     if (e != null && e.base)
       throw new Error("Can not derive from a modified tag");
-    let t = new V([], null, []);
+    let t = new j([], null, []);
     if (t.set.push(t), e)
-      for (let r of e.set)
-        t.set.push(r);
+      for (let n of e.set)
+        t.set.push(n);
     return t;
   }
   /**
@@ -1278,52 +1278,52 @@ class V {
   `m1(m3(t1)`, and so on.
   */
   static defineModifier() {
-    let e = new we();
-    return (t) => t.modified.indexOf(e) > -1 ? t : we.get(t.base || t, t.modified.concat(e).sort((r, i) => r.id - i.id));
+    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 $t = 0;
-class we {
+let Pt = 0;
+class Ce {
   constructor() {
-    this.instances = [], this.id = $t++;
+    this.instances = [], this.id = Pt++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let r = t[0].instances.find((u) => u.base == e && Tt(t, u.modified));
-    if (r)
-      return r;
-    let i = [], s = new V(i, e, t);
+    let n = t[0].instances.find((u) => u.base == e && Tt(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 = jt(t);
+    let o = $t(t);
     for (let u of e.set)
       if (!u.modified.length)
         for (let h of o)
-          i.push(we.get(u, h));
+          i.push(Ce.get(u, h));
     return s;
   }
 }
-function Tt(n, e) {
-  return n.length == e.length && n.every((t, r) => t == e[r]);
+function Tt(r, e) {
+  return r.length == e.length && r.every((t, n) => t == e[n]);
 }
-function jt(n) {
+function $t(r) {
   let e = [[]];
-  for (let t = 0; t < n.length; t++)
-    for (let r = 0, i = e.length; r < i; r++)
-      e.push(e[r].concat(n[t]));
-  return e.sort((t, r) => r.length - t.length);
+  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(n, e) {
+function Ht(r, e) {
   let t = /* @__PURE__ */ Object.create(null);
-  for (let s of n)
+  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: r, all: i = null } = e || {};
+  let { scope: n, all: i = null } = e || {};
   return {
     style: (s) => {
       let o = i;
@@ -1337,10 +1337,10 @@ function Ht(n, e) {
         }
       return o;
     },
-    scope: r
+    scope: n
   };
 }
-const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X), Se = a(X), H = a(), ne = a(H), T = a(), j = a(), Le = a(), he = a(Le), ke = a(), l = {
+const a = j.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X), Se = a(X), V = a(), ne = a(V), $ = a(), H = a(), Be = a(), he = a(Be), ke = a(), l = {
   /**
   A comment.
   */
@@ -1453,94 +1453,94 @@ const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X),
   /**
   A language keyword.
   */
-  keyword: T,
+  keyword: $,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(T),
+  self: a($),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(T),
+  null: a($),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(T),
+  atom: a($),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(T),
+  unit: a($),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(T),
+  modifier: a($),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(T),
+  operatorKeyword: a($),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(T),
+  controlKeyword: a($),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(T),
+  definitionKeyword: a($),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(T),
+  moduleKeyword: a($),
   /**
   An operator.
   */
-  operator: j,
+  operator: H,
   /**
   An [operator](#highlight.tags.operator) that dereferences something.
   */
-  derefOperator: a(j),
+  derefOperator: a(H),
   /**
   Arithmetic-related [operator](#highlight.tags.operator).
   */
-  arithmeticOperator: a(j),
+  arithmeticOperator: a(H),
   /**
   Logical [operator](#highlight.tags.operator).
   */
-  logicOperator: a(j),
+  logicOperator: a(H),
   /**
   Bit [operator](#highlight.tags.operator).
   */
-  bitwiseOperator: a(j),
+  bitwiseOperator: a(H),
   /**
   Comparison [operator](#highlight.tags.operator).
   */
-  compareOperator: a(j),
+  compareOperator: a(H),
   /**
   [Operator](#highlight.tags.operator) that updates its operand.
   */
-  updateOperator: a(j),
+  updateOperator: a(H),
   /**
   [Operator](#highlight.tags.operator) that defines something.
   */
-  definitionOperator: a(j),
+  definitionOperator: a(H),
   /**
   Type-related [operator](#highlight.tags.operator).
   */
-  typeOperator: a(j),
+  typeOperator: a(H),
   /**
   Control-flow [operator](#highlight.tags.operator).
   */
-  controlOperator: a(j),
+  controlOperator: a(H),
   /**
   Program or markup punctuation.
   */
-  punctuation: Le,
+  punctuation: Be,
   /**
   [Punctuation](#highlight.tags.punctuation) that separates
   things.
   */
-  separator: a(Le),
+  separator: a(Be),
   /**
   Bracket-style [punctuation](#highlight.tags.punctuation).
   */
@@ -1568,7 +1568,7 @@ const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X),
   /**
   Content, for example plain text in XML or markup documents.
   */
-  content: H,
+  content: V,
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
@@ -1600,37 +1600,37 @@ const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X),
   /**
   A prose separator (such as a horizontal rule).
   */
-  contentSeparator: a(H),
+  contentSeparator: a(V),
   /**
   [Content](#highlight.tags.content) that represents a list.
   */
-  list: a(H),
+  list: a(V),
   /**
   [Content](#highlight.tags.content) that represents a quote.
   */
-  quote: a(H),
+  quote: a(V),
   /**
   [Content](#highlight.tags.content) that is emphasized.
   */
-  emphasis: a(H),
+  emphasis: a(V),
   /**
   [Content](#highlight.tags.content) that is styled strong.
   */
-  strong: a(H),
+  strong: a(V),
   /**
   [Content](#highlight.tags.content) that is part of a link.
   */
-  link: a(H),
+  link: a(V),
   /**
   [Content](#highlight.tags.content) that is styled as code or
   monospace.
   */
-  monospace: a(H),
+  monospace: a(V),
   /**
   [Content](#highlight.tags.content) that has a strike-through
   style.
   */
-  strikethrough: a(H),
+  strikethrough: a(V),
   /**
   Inserted text in a change-tracking format.
   */
@@ -1671,31 +1671,31 @@ const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X),
   given element is being defined. Expected to be used with the
   various [name](#highlight.tags.name) tags.
   */
-  definition: V.defineModifier(),
+  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: V.defineModifier(),
+  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: V.defineModifier(),
+  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: V.defineModifier(),
+  standard: j.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates a given
   [names](#highlight.tags.name) is local to some scope.
   */
-  local: V.defineModifier(),
+  local: j.defineModifier(),
   /**
   A generic variant [modifier](#highlight.Tag^defineModifier) that
   can be used to tag language-specific alternative variants of
@@ -1704,7 +1704,7 @@ const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X),
   [variable name](#highlight.tags.variableName) tags, since those
   come up a lot.
   */
-  special: V.defineModifier()
+  special: j.defineModifier()
 };
 Ht([
   { tag: l.link, class: "tok-link" },
@@ -1738,44 +1738,44 @@ Ht([
   { tag: l.invalid, class: "tok-invalid" },
   { tag: l.punctuation, class: "tok-punctuation" }
 ]);
-const Vt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
+const Vt = "#c72727", jt = "#9b5700", Rt = "#067934", Dt = "#0063d7", Ut = {
   red: Vt,
-  orange: Rt,
-  green: Dt,
-  blue: Ut,
+  orange: jt,
+  green: Rt,
+  blue: Dt,
   invalid: "#ffffff"
-}, Wt = (n) => gt.define([
+}, Jt = (r) => pt.define([
   {
     tag: l.keyword,
-    color: n.red
+    color: r.red
   },
   {
     tag: [l.name, l.deleted, l.character, l.propertyName, l.macroName],
-    color: n.green
+    color: r.green
   },
   {
     tag: [l.function(l.variableName), l.labelName],
-    color: n.blue
+    color: r.blue
   },
   {
     tag: [l.color, l.constant(l.name), l.standard(l.name)],
-    color: n.red
+    color: r.red
   },
   {
     tag: [l.definition(l.name), l.separator],
-    color: n.red
+    color: r.red
   },
   {
     tag: [l.typeName, l.className, l.number, l.changed, l.annotation, l.modifier, l.self, l.namespace],
-    color: n.orange
+    color: r.orange
   },
   {
     tag: [l.operator, l.operatorKeyword, l.url, l.escape, l.regexp, l.link, l.special(l.string)],
-    color: n.blue
+    color: r.blue
   },
   {
     tag: [l.meta, l.comment],
-    color: n.orange
+    color: r.orange
   },
   {
     tag: l.strong,
@@ -1791,80 +1791,77 @@ const Vt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
   },
   {
     tag: l.link,
-    color: n.orange,
+    color: r.orange,
     textDecoration: "underline"
   },
   {
     tag: l.heading,
     fontWeight: "bold",
-    color: n.blue
+    color: r.blue
   },
   {
     tag: [l.atom, l.bool, l.special(l.variableName)],
-    color: n.red
+    color: r.red
   },
   {
     tag: [l.processingInstruction, l.string, l.inserted],
-    color: n.blue
+    color: r.blue
   },
   {
     tag: l.invalid,
-    color: n.invalid
-  }
-]), Gt = pt(Wt(Jt));
-var ve = /* @__PURE__ */ ((n) => (n.INLINE = "inline", n.SINGLELINE = "singleline", n.MULTILINE = "multiline", n))(ve || {}), re = /* @__PURE__ */ ((n) => (n.JSON = "json", n.XML = "xml", n.JAVA = "java", n.JAVASCRIPT = "javascript", n))(re || {}), de = /* @__PURE__ */ ((n) => (n.ACTION = "action", n.CHANGE = "change", n))(de || {});
-const Kt = {
-  [re.JSON]: mt,
-  [re.XML]: bt,
-  [re.JAVASCRIPT]: yt,
-  [re.JAVA]: xt
-}, qt = (n) => ({
-  loadLang: async () => Kt[n]
+    color: r.invalid
+  }
+]), Wt = ct(Jt(Ut));
+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 || {}), de = /* @__PURE__ */ ((r) => (r.ACTION = "action", r.CHANGE = "change", r))(de || {});
+const Gt = {
+  [re.JSON]: gt,
+  [re.XML]: mt,
+  [re.JAVASCRIPT]: bt,
+  [re.JAVA]: yt
+}, Kt = (r) => ({
+  loadLang: async () => Gt[r]
 });
 let Ge = 0;
-const Ft = {
+const qt = {
   beforeCreate() {
     this.uuid = Ge.toString(), Ge += 1;
   }
-}, tt = (n) => (Fe("data-v-012ee7f3"), n = n(), Xe(), n), Xt = { key: 0 }, Zt = /* @__PURE__ */ tt(() => /* @__PURE__ */ ae("path", {
+}, Ft = { key: 0 }, Xt = /* @__PURE__ */ ae("path", {
   fill: "#00112C",
-  "fill-rule": "evenodd",
-  d: "M14 1.25H10C9.58579 1.25 9.25 1.58579 9.25 2C9.25 2.41421 9.58579 2.75 10 2.75H12.1893L9.46967 5.46967C9.17678 5.76256 9.17678 6.23744 9.46967 6.53033C9.76256 6.82322 10.2374 6.82322 10.5303 6.53033L13.25 3.81066V6C13.25 6.41421 13.5858 6.75 14 6.75C14.4142 6.75 14.75 6.41421 14.75 6V2C14.75 1.80806 14.6768 1.61612 14.5303 1.46967C14.4584 1.39776 14.3755 1.34351 14.2871 1.30691C14.1987 1.27024 14.1017 1.25 14 1.25Z",
-  "clip-rule": "evenodd"
-}, null, -1)), Qt = /* @__PURE__ */ tt(() => /* @__PURE__ */ ae("path", {
+  d: "M14.75 1.25V6.75H13.25V3.81083L10.0001 7.06072L8.93945 6.00006L12.1895 2.75H9.25V1.25H14.75Z"
+}, null, -1), Zt = /* @__PURE__ */ ae("path", {
   fill: "#00112C",
-  "fill-rule": "evenodd",
-  d: "M1.25 10C1.25 9.58579 1.58579 9.25 2 9.25C2.41421 9.25 2.75 9.58579 2.75 10V12.1893L5.46967 9.46967C5.76256 9.17678 6.23744 9.17678 6.53033 9.46967C6.82322 9.76256 6.82322 10.2374 6.53033 10.5303L3.81066 13.25H6C6.41421 13.25 6.75 13.5858 6.75 14C6.75 14.4142 6.41421 14.75 6 14.75H2C1.80806 14.75 1.61612 14.6768 1.46967 14.5303C1.39776 14.4584 1.34351 14.3755 1.30691 14.2871C1.27024 14.1987 1.25 14.1017 1.25 14V10Z",
-  "clip-rule": "evenodd"
-}, null, -1));
-function Yt(n, e, t, r, i, s) {
-  return z(), le("svg", qe({ role: "img" }, n.$attrs, {
+  d: "M2.75 12.1895V9.25H1.25V14.75H6.75V13.25H3.81083L7.06072 10.0001L6.00006 8.93945L2.75 12.1895Z"
+}, null, -1);
+function Qt(r, e, t, n, i, s) {
+  return z(), le("svg", qe({ role: "img" }, r.$attrs, {
+    class: "ui-assets-icons-16",
     xmlns: "http://www.w3.org/2000/svg",
     width: "16",
     height: "16",
     fill: "none"
   }), [
-    n.$attrs["svg-title"] ? (z(), le("title", Xt, Ae(n.$attrs["svg-title"]), 1)) : q("", !0),
-    Zt,
-    Qt
+    r.$attrs["svg-title"] ? (z(), le("title", Ft, Ae(r.$attrs["svg-title"]), 1)) : q("", !0),
+    Xt,
+    Zt
   ], 16);
 }
-const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f3"]]), Ke = {
+const Yt = /* @__PURE__ */ Fe(qt, [["render", Qt]]), Ke = {
   "en-US": {
     run: "Run",
     expand: "Expand"
   }
-}, tn = nt({
+}, en = Ye({
   i18n: { messages: Ke },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: _t,
-    BentoButton: vt,
-    BentoDropdown: kt,
-    Copy: At,
-    BaseModal: Ct,
-    BentoLoadingIndicator: Nt,
-    ExpandIcon: en
+    BentoTypography: vt,
+    BentoButton: _t,
+    BentoDropdown: xt,
+    Copy: St,
+    BaseModal: kt,
+    BentoLoadingIndicator: Ct,
+    ExpandIcon: Yt
   },
   directives: { BentoTooltipDirective: wt },
   props: {
@@ -1874,7 +1871,7 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     variant: {
       type: String,
       default: ve.MULTILINE,
-      validator: (n) => Object.values(ve).includes(n)
+      validator: (r) => Object.values(ve).includes(r)
     },
     /**
      * Language name for syntax highlighting rules
@@ -1882,7 +1879,7 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     lang: {
       type: String,
       default: re.JSON,
-      validator: (n) => Object.values(re).includes(n)
+      validator: (r) => Object.values(re).includes(r)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1938,55 +1935,55 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     }
   },
   emits: [de.ACTION, de.CHANGE],
-  setup(n, { emit: e }) {
-    const { t } = St({ messages: Ke }), r = ge(null), i = [], s = () => {
-    }, o = ue(() => n.langLabel ?? n.lang.toUpperCase()), u = ue(() => n.variant === ve.INLINE), h = ue(() => ({
+  setup(r, { emit: e }) {
+    const { t } = Nt({ messages: Ke }), n = ge(null), i = [], s = () => {
+    }, o = ue(() => r.langLabel ?? r.lang.toUpperCase()), u = ue(() => r.variant === ve.INLINE), h = ue(() => ({
       "b-code-snippet--inline": u.value,
       "b-code-snippet--scrollable": !u.value
     })), x = ue(() => ({
-      "b-code-snippet__code-area-content--editable": n.editable
-    })), { loadLang: _ } = qt(n.lang), w = $e(), A = $e(), L = new Ne(), N = new Ne(), P = new Ne(), M = ge(null), D = ge(0);
-    rt(async () => {
-      const g = await _();
-      M.value = n.content;
+      "b-code-snippet__code-area-content--editable": r.editable
+    })), { loadLang: w } = Kt(r.lang), C = Te(), A = Te(), B = new Ne(), N = new Ne(), P = 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();
       }, f = [
-        ut(),
-        ft.of([dt]),
-        L.of(g()),
-        N.of(Gt),
-        P.of(Ve.readOnly.of(!n.editable)),
-        He.updateListener.of((p) => b(p))
+        at(),
+        ut.of([ht]),
+        B.of(g()),
+        N.of(Wt),
+        P.of(je.readOnly.of(!r.editable)),
+        Ve.updateListener.of((p) => b(p))
       ];
-      n.variant === "multiline" && f.push([ht(), ct()]);
-      const y = Ve.create({
-        doc: n.content,
+      r.variant === "multiline" && f.push([ft(), dt()]);
+      const y = je.create({
+        doc: r.content,
         extensions: [...f]
       });
-      D.value = y.doc.length, A.value = new He({
+      D.value = y.doc.length, A.value = new Ve({
         state: y,
-        parent: w.value
+        parent: C.value
       });
-    }), it(
-      () => n.content,
+    }), tt(
+      () => r.content,
       () => {
-        if (n.content !== M.value) {
-          const g = n.content.length;
+        if (r.content !== M.value) {
+          const g = r.content.length;
           A.value.dispatch({
             changes: {
               from: 0,
               to: D.value,
-              insert: n.content
+              insert: r.content
             }
           }), D.value = g;
         }
       }
     );
-    const U = ue(() => t(n.actionableText)), S = () => {
+    const U = ue(() => t(r.actionableText)), S = () => {
       e(de.ACTION, M.value);
     };
-    st(() => {
+    nt(() => {
       M.value !== null && e(de.CHANGE, M.value);
     });
     const J = ge(!1);
@@ -1995,11 +1992,11 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
       availableLanguages: i,
       codeAreaContentConditionalClasses: x,
       conditionalClasses: h,
-      container: w,
+      container: C,
       currentContents: M,
       displayedLang: o,
       editor: A,
-      selectedLanguage: r,
+      selectedLanguage: n,
       showModal: J,
       isInlineVariant: u,
       // Methods
@@ -2011,65 +2008,65 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     };
   }
 });
-const nn = (n) => (Fe("data-v-fdff494b"), n = n(), Xe(), n), rn = {
+const tn = (r) => (ot("data-v-fdff494b"), r = r(), lt(), r), nn = {
   key: 0,
   class: "b-code-snippet__action-bar"
-}, sn = { class: "b-code-snippet__action-bar--start" }, on = { class: "b-code-snippet__action-bar--end" }, ln = {
+}, rn = { class: "b-code-snippet__action-bar--start" }, sn = { class: "b-code-snippet__action-bar--end" }, on = {
   key: 1,
   class: "b-code-snippet__code-area"
-}, an = { key: 2 }, un = /* @__PURE__ */ nn(() => /* @__PURE__ */ ae("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
-function fn(n, e, t, r, i, s) {
-  const o = K("bento-dropdown"), u = K("bento-typography"), h = K("bento-loading-indicator"), x = K("copy"), _ = K("expand-icon"), w = K("bento-button"), A = K("bento-code-snippet"), L = K("base-modal");
+}, ln = { key: 2 }, an = /* @__PURE__ */ tn(() => /* @__PURE__ */ ae("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
+function un(r, e, t, n, i, s) {
+  const o = K("bento-dropdown"), u = K("bento-typography"), h = 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 z(), le("div", {
-    class: Te(["b-code-snippet", n.conditionalClasses])
+    class: $e(["b-code-snippet", r.conditionalClasses])
   }, [
-    n.isInlineVariant ? q("", !0) : (z(), le("section", rn, [
-      ae("div", sn, [
-        n.availableLanguages.length > 0 ? (z(), oe(o, qe({
+    r.isInlineVariant ? q("", !0) : (z(), le("section", nn, [
+      ae("div", rn, [
+        r.availableLanguages.length > 0 ? (z(), oe(o, qe({
           key: 0,
-          modelValue: n.selectedLanguage,
-          "onUpdate:modelValue": e[0] || (e[0] = (N) => n.selectedLanguage = N)
-        }, n.$props, {
-          disabled: n.availableLanguages.length === 1,
-          items: n.availableLanguages,
+          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: n.handleChangeLanguage
+          onInput: r.handleChangeLanguage
         }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : q("", !0),
         me(u, {
           el: "span",
           stronger: ""
         }, {
           default: fe(() => [
-            je(Ae(n.displayedLang), 1)
+            He(Ae(r.displayedLang), 1)
           ]),
           _: 1
         })
       ]),
-      ae("div", on, [
-        n.loading ? (z(), oe(h, { key: 0 })) : q("", !0),
-        n.currentContents !== null ? (z(), oe(x, {
+      ae("div", sn, [
+        r.loading ? (z(), oe(h, { key: 0 })) : q("", !0),
+        r.currentContents !== null ? (z(), oe(x, {
           key: 1,
           class: "b-structured-list__icon",
-          text: n.currentContents
+          text: r.currentContents
         }, null, 8, ["text"])) : q("", !0),
-        n.expandable ? (z(), oe(w, {
+        r.expandable ? (z(), oe(C, {
           key: 2,
           variant: "tertiary",
           condensed: "",
-          "aria-label": n.t("expand"),
-          onClick: e[1] || (e[1] = (N) => n.showModal = !0)
+          "aria-label": r.t("expand"),
+          onClick: e[1] || (e[1] = (N) => r.showModal = !0)
         }, {
           iconLeft: fe(() => [
-            me(_)
+            me(w)
           ]),
           _: 1
         }, 8, ["aria-label"])) : q("", !0),
-        n.actionable ? (z(), oe(w, {
+        r.actionable ? (z(), oe(C, {
           key: 3,
           variant: "primary",
           tertiary: "",
           condensed: "",
-          onClick: n.onActionClicked
+          onClick: r.onActionClicked
         }, {
           iconLeft: fe(() => [
             me(u, {
@@ -2077,7 +2074,7 @@ function fn(n, e, t, r, i, s) {
               class: "b-code-snippet__action-button"
             }, {
               default: fe(() => [
-                je(Ae(n.runText), 1)
+                He(Ae(r.runText), 1)
               ]),
               _: 1
             })
@@ -2086,36 +2083,36 @@ function fn(n, e, t, r, i, s) {
         }, 8, ["onClick"])) : q("", !0)
       ])
     ])),
-    n.content || n.editable ? (z(), le("code", ln, [
+    r.content || r.editable ? (z(), le("code", on, [
       ae("div", {
         ref: "container",
-        class: Te(["b-code-snippet__code-area-content", n.codeAreaContentConditionalClasses])
+        class: $e(["b-code-snippet__code-area-content", r.codeAreaContentConditionalClasses])
       }, null, 2)
-    ])) : (z(), le("section", an, [
-      ot(n.$slots, "empty-state", {}, () => [
-        un
+    ])) : (z(), le("section", ln, [
+      rt(r.$slots, "empty-state", {}, () => [
+        an
       ], !0)
     ])),
-    n.expandable ? (z(), oe(L, {
+    r.expandable ? (z(), oe(B, {
       key: 3,
       class: "b-code-snippet__modal",
       "hide-close-button": !0,
       "custom-padding": "0px",
       "is-dismissible": !0,
-      "is-open": n.showModal,
+      "is-open": r.showModal,
       size: "large",
-      onCloseModal: e[2] || (e[2] = (N) => n.showModal = !1)
+      onCloseModal: e[2] || (e[2] = (N) => r.showModal = !1)
     }, {
       content: fe(() => [
-        me(A, lt(at({ ...n.$props, expandable: !1 })), null, 16)
+        me(A, it(st({ ...r.$props, expandable: !1 })), null, 16)
       ]),
       _: 1
     }, 8, ["is-open"])) : q("", !0)
   ], 2);
 }
-const Bn = /* @__PURE__ */ Ze(tn, [["render", fn], ["__scopeId", "data-v-fdff494b"]]);
+const In = /* @__PURE__ */ Fe(en, [["render", un], ["__scopeId", "data-v-fdff494b"]]);
 export {
-  Bn as BentoCodeSnippet,
+  In as BentoCodeSnippet,
   de as BentoCodeSnippetEvent,
   re as BentoCodeSnippetSupportedLanguage,
   ve as BentoCodeSnippetVariant