@adyen/bento-vue3 1.3.0 → 1.4.0

package/dist/code-snippet.js

@@ -1,28 +1,30 @@
-import { defineComponent as Fe, ref as ye, computed as xe, shallowRef as Te, onMounted as Xe, watch as Ye, resolveComponent as ae, openBlock as ne, createElementBlock as he, normalizeClass as Qe, createElementVNode as pe, createBlock as Pe, mergeProps as Ze, createCommentVNode as ke, createVNode as ve, withCtx as we, createTextVNode as je, toDisplayString as Me, renderSlot as et, pushScopeId as tt, popScopeId as nt } from "vue";
-import { highlightActiveLine as rt, keymap as it, EditorView as Ve, lineNumbers as st } from "@codemirror/view";
-import { Compartment as Ce, EditorState as Re } from "@codemirror/state";
-import { indentWithTab as ot, history as lt } from "@codemirror/commands";
-import { syntaxHighlighting as at, HighlightStyle as ht } from "@codemirror/language";
-import { json as ut } from "@codemirror/lang-json";
-import { xml as ft } from "@codemirror/lang-xml";
-import { javascript as ct } from "@codemirror/lang-javascript";
-import { java as dt } from "@codemirror/lang-java";
-import { B as pt } from "./chunks/dropdown.8b415aac.js";
-import { B as gt, a as mt } from "./chunks/button.e1c39f66.js";
-import { B as bt, a as yt } from "./chunks/index.222d29b0.js";
-import { b as xt } from "./chunks/tooltip.835d9b52.js";
-import { u as kt } from "./chunks/i18n.6c402773.js";
-import { C as vt } from "./chunks/copy.2cf5e6c3.js";
-import { _ as wt } from "./chunks/_plugin-vue_export-helper.dad06003.js";
+import { openBlock as E, createElementBlock as oe, mergeProps as qe, toDisplayString as Ae, createCommentVNode as ne, pushScopeId as Fe, popScopeId as Xe, createElementVNode as le, defineComponent as nt, ref as me, computed as ae, shallowRef as $e, onMounted as rt, watch as it, watchEffect as st, resolveComponent as K, normalizeClass as Te, createBlock as ue, createVNode as he, withCtx as fe, createTextVNode as je, renderSlot as ot, normalizeProps as lt, guardReactiveProps as at } from "vue";
+import { highlightActiveLine as ut, keymap as ht, EditorView as He, lineNumbers as ft } 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.b798a82e.js";
+import { f as Ct } from "./chunks/base-modal.3ccb9eb5.js";
+import { a as _t } from "./chunks/button.a8462029.js";
+import { B as vt } from "./chunks/index.89b00b94.js";
+import { b as wt } from "./chunks/tooltip.e4e34b86.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.1d14b783.js";
 import "./assets/index9.css";
-const Ct = 1024;
-let _t = 0;
-class C {
+const It = 1024;
+let Bt = 0;
+class _ {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = _t++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = Bt++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -38,24 +40,24 @@ class C {
   add(e) {
     if (this.perNode)
       throw new RangeError("Can't add per-node props to node types");
-    return typeof e != "function" && (e = J.match(e)), (t) => {
+    return typeof e != "function" && (e = G.match(e)), (t) => {
       let n = e(t);
       return n === void 0 ? null : [this, n];
     };
   }
 }
-C.closedBy = new C({ deserialize: (r) => r.split(" ") });
-C.openedBy = new C({ deserialize: (r) => r.split(" ") });
-C.group = new C({ deserialize: (r) => r.split(" ") });
-C.isolate = new C({ deserialize: (r) => {
+_.closedBy = new _({ deserialize: (r) => r.split(" ") });
+_.openedBy = new _({ deserialize: (r) => r.split(" ") });
+_.group = new _({ deserialize: (r) => r.split(" ") });
+_.isolate = new _({ deserialize: (r) => {
   if (r && r != "rtl" && r != "ltr" && r != "auto")
     throw new RangeError("Invalid value for isolate: " + r);
   return r || "auto";
 } });
-C.contextHash = new C({ perNode: !0 });
-C.lookAhead = new C({ perNode: !0 });
-C.mounted = new C({ perNode: !0 });
-class me {
+_.contextHash = new _({ perNode: !0 });
+_.lookAhead = new _({ perNode: !0 });
+_.mounted = new _({ perNode: !0 });
+class ve {
   constructor(e, t, n) {
     this.tree = e, this.overlay = t, this.parser = n;
   }
@@ -63,11 +65,11 @@ class me {
   @internal
   */
   static get(e) {
-    return e && e.props && e.props[C.mounted.id];
+    return e && e.props && e.props[_.mounted.id];
   }
 }
-const Nt = /* @__PURE__ */ Object.create(null);
-class J {
+const Lt = /* @__PURE__ */ Object.create(null);
+class G {
   /**
   @internal
   */
@@ -78,7 +80,7 @@ class J {
   Define a node type.
   */
   static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Nt, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), i = new J(e.name || "", t, e.id, n);
+    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) {
@@ -129,7 +131,7 @@ class J {
     if (typeof e == "string") {
       if (this.name == e)
         return !0;
-      let t = this.prop(C.group);
+      let t = this.prop(_.group);
       return t ? t.indexOf(e) > -1 : !1;
     }
     return this.id == e;
@@ -148,7 +150,7 @@ class J {
       for (let i of n.split(" "))
         t[i] = e[n];
     return (n) => {
-      for (let i = n.prop(C.group), s = -1; s < (i ? i.length : 0); s++) {
+      for (let i = n.prop(_.group), s = -1; s < (i ? i.length : 0); s++) {
         let o = t[s < 0 ? n.name : i[s]];
         if (o)
           return o;
@@ -156,34 +158,34 @@ class J {
     };
   }
 }
-J.none = new J(
+G.none = new G(
   "",
   /* @__PURE__ */ Object.create(null),
   0,
   8
   /* NodeFlag.Anonymous */
 );
-const ue = /* @__PURE__ */ new WeakMap(), He = /* @__PURE__ */ new WeakMap();
-var S;
+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";
-})(S || (S = {}));
-class D {
+})(I || (I = {}));
+class V {
   /**
   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, h] of s)
-        this.props[typeof o == "number" ? o : o.id] = h;
+      for (let [o, u] of s)
+        this.props[typeof o == "number" ? o : o.id] = u;
     }
   }
   /**
   @internal
   */
   toString() {
-    let e = me.get(this);
+    let e = ve.get(this);
     if (e && !e.overlay)
       return e.tree.toString();
     let t = "";
@@ -199,7 +201,7 @@ class D {
   nodes the cursor visits.
   */
   cursor(e = 0) {
-    return new Se(this.topNode, e);
+    return new Be(this.topNode, e);
   }
   /**
   Get a [tree cursor](#common.TreeCursor) pointing into this tree
@@ -207,8 +209,8 @@ class D {
   [`moveTo`](#common.TreeCursor.moveTo).
   */
   cursorAt(e, t = 0, n = 0) {
-    let i = ue.get(this) || this.topNode, s = new Se(i);
-    return s.moveTo(e, t), ue.set(this, s._tree), s;
+    let i = be.get(this) || this.topNode, s = new Be(i);
+    return s.moveTo(e, t), be.set(this, s._tree), s;
   }
   /**
   Get a [syntax node](#common.SyntaxNode) object for the top of the
@@ -229,8 +231,8 @@ class D {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let n = oe(ue.get(this) || this.topNode, e, t, !1);
-    return ue.set(this, n), n;
+    let n = pe(be.get(this) || this.topNode, e, t, !1);
+    return be.set(this, n), n;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -240,8 +242,8 @@ class D {
   the host trees).
   */
   resolveInner(e, t = 0) {
-    let n = oe(He.get(this) || this.topNode, e, t, !0);
-    return He.set(this, n), n;
+    let n = pe(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
@@ -251,7 +253,7 @@ class D {
   position.
   */
   resolveStack(e, t = 0) {
-    return It(this, e, t);
+    return Et(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -261,18 +263,18 @@ class D {
   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, h = (o & S.IncludeAnonymous) > 0;
-    for (let f = this.cursor(o | S.IncludeAnonymous); ; ) {
-      let y = !1;
-      if (f.from <= s && f.to >= i && (!h && f.type.isAnonymous || t(f) !== !1)) {
+    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;
-        y = !0;
+        x = !0;
       }
-      for (; y && n && (h || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
+      for (; x && n && (u || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
         if (!f.parent())
           return;
-        y = !0;
+        x = !0;
       }
     }
   }
@@ -301,18 +303,18 @@ class D {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : Oe(J.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, i) => new D(this.type, t, n, i, this.propValues), e.makeTree || ((t, n, i) => new D(J.none, t, n, 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 V(this.type, t, n, i, this.propValues), e.makeTree || ((t, n, i) => new V(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 Bt(e);
+    return Mt(e);
   }
 }
-D.empty = new D(J.none, [], [], 0);
-class Be {
+V.empty = new V(G.none, [], [], 0);
+class Oe {
   constructor(e, t) {
     this.buffer = e, this.index = t;
   }
@@ -335,10 +337,10 @@ class Be {
     this.index -= 4;
   }
   fork() {
-    return new Be(this.buffer, this.index);
+    return new Oe(this.buffer, this.index);
   }
 }
-class G {
+class Z {
   /**
   Create a tree buffer.
   */
@@ -349,7 +351,7 @@ class G {
   @internal
   */
   get type() {
-    return J.none;
+    return G.none;
   }
   /**
   @internal
@@ -376,25 +378,25 @@ class G {
   @internal
   */
   findChild(e, t, n, i, s) {
-    let { buffer: o } = this, h = -1;
-    for (let f = e; f != t && !(Ke(s, i, o[f + 1], o[f + 2]) && (h = f, n > 0)); f = o[f + 3])
+    let { buffer: o } = this, u = -1;
+    for (let f = e; f != t && !(Qe(s, i, o[f + 1], o[f + 2]) && (u = f, n > 0)); f = o[f + 3])
       ;
-    return h;
+    return u;
   }
   /**
   @internal
   */
   slice(e, t, n) {
     let i = this.buffer, s = new Uint16Array(t - e), o = 0;
-    for (let h = e, f = 0; h < t; ) {
-      s[f++] = i[h++], s[f++] = i[h++] - n;
-      let y = s[f++] = i[h++] - n;
-      s[f++] = i[h++] - e, o = Math.max(o, y);
+    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 G(s, o, this.set);
+    return new Z(s, o, this.set);
   }
 }
-function Ke(r, e, t, n) {
+function Qe(r, e, t, n) {
   switch (r) {
     case -2:
       return t < e;
@@ -410,17 +412,17 @@ function Ke(r, e, t, n) {
       return !0;
   }
 }
-function oe(r, e, t, n) {
+function pe(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 : S.IgnoreOverlays;
+  let s = n ? 0 : I.IgnoreOverlays;
   if (n)
-    for (let o = r, h = o.parent; h; o = h, h = o.parent)
-      o instanceof z && o.index < 0 && ((i = h.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (r = h);
+    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)
@@ -428,9 +430,9 @@ function oe(r, e, t, n) {
     r = o;
   }
 }
-class Ge {
+class Ye {
   cursor(e = 0) {
-    return new Se(this, e);
+    return new Be(this, e);
   }
   getChild(e, t = null, n = null) {
     let i = De(this, e, t, n);
@@ -440,13 +442,13 @@ class Ge {
     return De(this, e, t, n);
   }
   resolve(e, t = 0) {
-    return oe(this, e, t, !1);
+    return pe(this, e, t, !1);
   }
   resolveInner(e, t = 0) {
-    return oe(this, e, t, !0);
+    return pe(this, e, t, !0);
   }
   matchContext(e) {
-    return Ne(this, e);
+    return Ie(this, e);
   }
   enterUnfinishedNodesBefore(e) {
     let t = this.childBefore(e), n = this;
@@ -465,7 +467,7 @@ class Ge {
     return this.parent;
   }
 }
-class z extends Ge {
+class z extends Ye {
   constructor(e, t, n, i) {
     super(), this._tree = e, this.from = t, this.index = n, this._parent = i;
   }
@@ -480,25 +482,25 @@ class z extends Ge {
   }
   nextChild(e, t, n, i, s = 0) {
     for (let o = this; ; ) {
-      for (let { children: h, positions: f } = o._tree, y = t > 0 ? h.length : -1; e != y; e += t) {
-        let x = h[e], A = f[e] + o.from;
-        if (Ke(i, n, A, A + x.length)) {
-          if (x instanceof G) {
-            if (s & S.ExcludeBuffers)
+      for (let { children: u, positions: f } = o._tree, x = t > 0 ? u.length : -1; e != x; e += t) {
+        let v = u[e], w = f[e] + o.from;
+        if (Qe(i, n, w, w + v.length)) {
+          if (v instanceof Z) {
+            if (s & I.ExcludeBuffers)
               continue;
-            let B = x.findChild(0, x.buffer.length, t, n - A, i);
-            if (B > -1)
-              return new K(new St(o, x, e, A), null, B);
-          } else if (s & S.IncludeAnonymous || !x.type.isAnonymous || Le(x)) {
-            let B;
-            if (!(s & S.IgnoreMounts) && (B = me.get(x)) && !B.overlay)
-              return new z(B.tree, A, e, o);
-            let T = new z(x, A, e, o);
-            return s & S.IncludeAnonymous || !T.type.isAnonymous ? T : T.nextChild(t < 0 ? x.children.length - 1 : 0, t, n, i);
+            let A = v.findChild(0, v.buffer.length, t, n - w, i);
+            if (A > -1)
+              return new X(new Ot(o, v, e, w), null, A);
+          } else if (s & I.IncludeAnonymous || !v.type.isAnonymous || ze(v)) {
+            let A;
+            if (!(s & I.IgnoreMounts) && (A = ve.get(v)) && !A.overlay)
+              return new z(A.tree, w, e, o);
+            let L = new z(v, w, e, o);
+            return s & I.IncludeAnonymous || !L.type.isAnonymous ? L : L.nextChild(t < 0 ? v.children.length - 1 : 0, t, n, i);
           }
         }
       }
-      if (s & S.IncludeAnonymous || !o.type.isAnonymous || (o.index >= 0 ? e = o.index + t : e = t < 0 ? -1 : o._parent._tree.children.length, o = o._parent, !o))
+      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;
     }
   }
@@ -540,10 +542,10 @@ class z extends Ge {
   }
   enter(e, t, n = 0) {
     let i;
-    if (!(n & S.IgnoreOverlays) && (i = me.get(this._tree)) && i.overlay) {
+    if (!(n & I.IgnoreOverlays) && (i = ve.get(this._tree)) && i.overlay) {
       let s = e - this.from;
-      for (let { from: o, to: h } of i.overlay)
-        if ((t > 0 ? o <= s : o < s) && (t < 0 ? h >= s : h > s))
+      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);
@@ -604,7 +606,7 @@ function De(r, e, t, n) {
       return n == null ? s : [];
   }
 }
-function Ne(r, e, t = e.length - 1) {
+function Ie(r, e, t = e.length - 1) {
   for (let n = r.parent; t >= 0; n = n.parent) {
     if (!n)
       return !1;
@@ -616,12 +618,12 @@ function Ne(r, e, t = e.length - 1) {
   }
   return !0;
 }
-class St {
+class Ot {
   constructor(e, t, n, i) {
     this.parent = e, this.buffer = t, this.index = n, this.start = i;
   }
 }
-class K extends Ge {
+class X extends Ye {
   get name() {
     return this.type.name;
   }
@@ -636,7 +638,7 @@ class K extends Ge {
   }
   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 K(this.context, this, s);
+    return s < 0 ? null : new X(this.context, this, s);
   }
   get firstChild() {
     return this.child(
@@ -671,10 +673,10 @@ class K extends Ge {
     );
   }
   enter(e, t, n = 0) {
-    if (n & S.ExcludeBuffers)
+    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 K(this.context, this, s);
+    return s < 0 ? null : new X(this.context, this, s);
   }
   get parent() {
     return this._parent || this.context.parent.nextSignificantParent();
@@ -690,11 +692,11 @@ class K extends Ge {
   }
   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 K(this.context, this._parent, t) : this.externalSibling(1);
+    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new X(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 K(this.context, this._parent, e.findChild(
+    return this.index == t ? this.externalSibling(-1) : new X(this.context, this._parent, e.findChild(
       t,
       this.index,
       -1,
@@ -712,7 +714,7 @@ class K extends Ge {
       let o = n.buffer[this.index + 1];
       e.push(n.slice(i, s, o)), t.push(0);
     }
-    return new D(this.type, e, t, this.to - this.from);
+    return new V(this.type, e, t, this.to - this.from);
   }
   /**
   @internal
@@ -721,7 +723,7 @@ class K extends Ge {
     return this.context.buffer.childString(this.index);
   }
 }
-function qe(r) {
+function et(r) {
   if (!r.length)
     return null;
   let e = 0, t = r[0];
@@ -730,32 +732,32 @@ function qe(r) {
     (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 At(i, t);
+  return n ? i[e] = n : i.splice(e, 1), new zt(i, t);
 }
-class At {
+class zt {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
   get next() {
-    return qe(this.heads);
+    return et(this.heads);
   }
 }
-function It(r, e, t) {
+function Et(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 = me.get(s.tree);
+      let o = ve.get(s.tree);
       if (o && o.overlay && o.overlay[0].from <= e && o.overlay[o.overlay.length - 1].to >= e) {
-        let h = new z(o.tree, o.overlay[0].from + s.from, -1, s);
-        (i || (i = [n])).push(oe(h, e, t, !1));
+        let u = new z(o.tree, o.overlay[0].from + s.from, -1, s);
+        (i || (i = [n])).push(pe(u, e, t, !1));
       }
     }
-  return i ? qe(i) : n;
+  return i ? et(i) : n;
 }
-class Se {
+class Be {
   /**
   Shorthand for `.type.name`.
   */
@@ -857,17 +859,17 @@ class Se {
   set to false.
   */
   enter(e, t, n = this.mode) {
-    return this.buffer ? n & S.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+    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 & S.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+      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 & S.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    let e = this.mode & I.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
     return this.buffer = null, this.yieldNode(e);
   }
   /**
@@ -923,8 +925,8 @@ class Se {
     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 h = n._tree.children[s];
-          if (this.mode & S.IncludeAnonymous || h instanceof G || !h.type.isAnonymous || Le(h))
+          let u = n._tree.children[s];
+          if (this.mode & I.IncludeAnonymous || u instanceof Z || !u.type.isAnonymous || ze(u))
             return !1;
         }
     return !0;
@@ -996,8 +998,8 @@ class Se {
           i = this.stack[--s];
         }
     for (let i = n; i < this.stack.length; i++)
-      t = new K(this.buffer, t, this.stack[i]);
-    return this.bufferNode = new K(this.buffer, t, this.index);
+      t = new X(this.buffer, t, this.stack[i]);
+    return this.bufferNode = new X(this.buffer, t, this.index);
   }
   /**
   Get the [tree](#common.Tree) that represents the current node, if
@@ -1037,11 +1039,11 @@ class Se {
   */
   matchContext(e) {
     if (!this.buffer)
-      return Ne(this.node, e);
+      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 Ne(this.node, e, i);
+        return Ie(this.node, e, i);
       let o = n[t.buffer[this.stack[s]]];
       if (!o.isAnonymous) {
         if (e[i] && e[i] != o.name)
@@ -1052,200 +1054,200 @@ class Se {
     return !0;
   }
 }
-function Le(r) {
-  return r.children.some((e) => e instanceof G || !e.type.isAnonymous || Le(e));
+function ze(r) {
+  return r.children.some((e) => e instanceof Z || !e.type.isAnonymous || ze(e));
 }
-function Bt(r) {
+function Mt(r) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: i = Ct, reused: s = [], minRepeatType: o = n.types.length } = r, h = Array.isArray(t) ? new Be(t, t.length) : t, f = n.types, y = 0, x = 0;
-  function A(m, p, u, v, b, g) {
-    let { id: c, start: d, end: w, size: k } = h, I = x;
+  let { buffer: t, nodeSet: n, maxBufferLength: i = It, reused: s = [], minRepeatType: o = n.types.length } = r, u = Array.isArray(t) ? new Oe(t, t.length) : t, f = n.types, x = 0, v = 0;
+  function w(g, b, h, y, p, m) {
+    let { id: d, start: c, end: C, size: k } = u, B = v;
     for (; k < 0; )
-      if (h.next(), k == -1) {
-        let U = s[c];
-        u.push(U), v.push(d - m);
+      if (u.next(), k == -1) {
+        let W = s[d];
+        h.push(W), y.push(c - g);
         return;
       } else if (k == -3) {
-        y = c;
+        x = d;
         return;
       } else if (k == -4) {
-        x = c;
+        v = d;
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${k}`);
-    let q = f[c], ee, F, ze = d - m;
-    if (w - d <= i && (F = ie(h.pos - p, b))) {
-      let U = new Uint16Array(F.size - F.skip), O = h.pos - F.size, j = U.length;
-      for (; h.pos > O; )
-        j = Z(F.start, U, j);
-      ee = new G(U, w - F.start, n), ze = F.start - m;
+    let Q = f[d], ie, Y, Me = c - g;
+    if (C - c <= i && (Y = R(u.pos - b, p))) {
+      let W = new Uint16Array(Y.size - Y.skip), O = u.pos - Y.size, P = W.length;
+      for (; u.pos > O; )
+        P = D(Y.start, W, P);
+      ie = new Z(W, C - Y.start, n), Me = Y.start - g;
     } else {
-      let U = h.pos - k;
-      h.next();
-      let O = [], j = [], X = c >= o ? c : -1, te = 0, le = w;
-      for (; h.pos > U; )
-        X >= 0 && h.id == X && h.size >= 0 ? (h.end <= le - i && (_(O, j, d, te, h.end, le, X, I), te = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, j) : A(d, U, O, j, X, g + 1);
-      if (X >= 0 && te > 0 && te < O.length && _(O, j, d, te, d, le, X, I), O.reverse(), j.reverse(), X > -1 && te > 0) {
-        let Ee = T(q);
-        ee = Oe(q, O, j, 0, O.length, 0, w - d, Ee, Ee);
+      let W = u.pos - k;
+      u.next();
+      let O = [], P = [], ee = d >= o ? d : -1, se = 0, ge = C;
+      for (; u.pos > W; )
+        ee >= 0 && u.id == ee && u.size >= 0 ? (u.end <= ge - i && (N(O, P, c, se, u.end, ge, ee, B), se = O.length, ge = u.end), u.next()) : m > 2500 ? A(c, W, O, P) : w(c, W, O, P, ee, m + 1);
+      if (ee >= 0 && se > 0 && se < O.length && N(O, P, c, se, c, ge, ee, B), O.reverse(), P.reverse(), ee > -1 && se > 0) {
+        let Pe = L(Q);
+        ie = Ee(Q, O, P, 0, O.length, 0, C - c, Pe, Pe);
       } else
-        ee = L(q, O, j, w - d, I - w);
+        ie = M(Q, O, P, C - c, B - C);
     }
-    u.push(ee), v.push(ze);
-  }
-  function B(m, p, u, v) {
-    let b = [], g = 0, c = -1;
-    for (; h.pos > p; ) {
-      let { id: d, start: w, end: k, size: I } = h;
-      if (I > 4)
-        h.next();
+    h.push(ie), y.push(Me);
+  }
+  function A(g, b, h, y) {
+    let p = [], m = 0, d = -1;
+    for (; u.pos > b; ) {
+      let { id: c, start: C, end: k, size: B } = u;
+      if (B > 4)
+        u.next();
       else {
-        if (c > -1 && w < c)
+        if (d > -1 && C < d)
           break;
-        c < 0 && (c = k - i), b.push(d, w, k), g++, h.next();
+        d < 0 && (d = k - i), p.push(c, C, k), m++, u.next();
       }
     }
-    if (g) {
-      let d = new Uint16Array(g * 4), w = b[b.length - 2];
-      for (let k = b.length - 3, I = 0; k >= 0; k -= 3)
-        d[I++] = b[k], d[I++] = b[k + 1] - w, d[I++] = b[k + 2] - w, d[I++] = I;
-      u.push(new G(d, b[2] - w, n)), v.push(w - m);
+    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;
+      h.push(new Z(c, p[2] - C, n)), y.push(C - g);
     }
   }
-  function T(m) {
-    return (p, u, v) => {
-      let b = 0, g = p.length - 1, c, d;
-      if (g >= 0 && (c = p[g]) instanceof D) {
-        if (!g && c.type == m && c.length == v)
-          return c;
-        (d = c.prop(C.lookAhead)) && (b = u[g] + c.length + d);
+  function L(g) {
+    return (b, h, y) => {
+      let p = 0, m = b.length - 1, d, c;
+      if (m >= 0 && (d = b[m]) instanceof V) {
+        if (!m && d.type == g && d.length == y)
+          return d;
+        (c = d.prop(_.lookAhead)) && (p = h[m] + d.length + c);
       }
-      return L(m, p, u, v, b);
+      return M(g, b, h, y, p);
     };
   }
-  function _(m, p, u, v, b, g, c, d) {
-    let w = [], k = [];
-    for (; m.length > v; )
-      w.push(m.pop()), k.push(p.pop() + u - b);
-    m.push(L(n.types[c], w, k, g - b, d - g)), p.push(b - u);
+  function N(g, b, h, y, p, m, d, c) {
+    let C = [], k = [];
+    for (; g.length > y; )
+      C.push(g.pop()), k.push(b.pop() + h - p);
+    g.push(M(n.types[d], C, k, m - p, c - m)), b.push(p - h);
   }
-  function L(m, p, u, v, b = 0, g) {
-    if (y) {
-      let c = [C.contextHash, y];
-      g = g ? [c].concat(g) : [c];
+  function M(g, b, h, y, p = 0, m) {
+    if (x) {
+      let d = [_.contextHash, x];
+      m = m ? [d].concat(m) : [d];
     }
-    if (b > 25) {
-      let c = [C.lookAhead, b];
-      g = g ? [c].concat(g) : [c];
+    if (p > 25) {
+      let d = [_.lookAhead, p];
+      m = m ? [d].concat(m) : [d];
     }
-    return new D(m, p, u, v, g);
+    return new V(g, b, h, y, m);
   }
-  function ie(m, p) {
-    let u = h.fork(), v = 0, b = 0, g = 0, c = u.end - i, d = { size: 0, start: 0, skip: 0 };
+  function R(g, b) {
+    let h = u.fork(), y = 0, p = 0, m = 0, d = h.end - i, c = { size: 0, start: 0, skip: 0 };
     e:
-      for (let w = u.pos - m; u.pos > w; ) {
-        let k = u.size;
-        if (u.id == p && k >= 0) {
-          d.size = v, d.start = b, d.skip = g, g += 4, v += 4, u.next();
+      for (let C = h.pos - g; h.pos > C; ) {
+        let k = h.size;
+        if (h.id == b && k >= 0) {
+          c.size = y, c.start = p, c.skip = m, m += 4, y += 4, h.next();
           continue;
         }
-        let I = u.pos - k;
-        if (k < 0 || I < w || u.start < c)
+        let B = h.pos - k;
+        if (k < 0 || B < C || h.start < d)
           break;
-        let q = u.id >= o ? 4 : 0, ee = u.start;
-        for (u.next(); u.pos > I; ) {
-          if (u.size < 0)
-            if (u.size == -3)
-              q += 4;
+        let Q = h.id >= o ? 4 : 0, ie = h.start;
+        for (h.next(); h.pos > B; ) {
+          if (h.size < 0)
+            if (h.size == -3)
+              Q += 4;
             else
               break e;
           else
-            u.id >= o && (q += 4);
-          u.next();
+            h.id >= o && (Q += 4);
+          h.next();
         }
-        b = ee, v += k, g += q;
+        p = ie, y += k, m += Q;
       }
-    return (p < 0 || v == m) && (d.size = v, d.start = b, d.skip = g), d.size > 4 ? d : void 0;
-  }
-  function Z(m, p, u) {
-    let { id: v, start: b, end: g, size: c } = h;
-    if (h.next(), c >= 0 && v < o) {
-      let d = u;
-      if (c > 4) {
-        let w = h.pos - (c - 4);
-        for (; h.pos > w; )
-          u = Z(m, p, u);
+    return (b < 0 || y == g) && (c.size = y, c.start = p, c.skip = m), c.size > 4 ? c : void 0;
+  }
+  function D(g, b, h) {
+    let { id: y, start: p, end: m, size: d } = u;
+    if (u.next(), d >= 0 && y < o) {
+      let c = h;
+      if (d > 4) {
+        let C = u.pos - (d - 4);
+        for (; u.pos > C; )
+          h = D(g, b, h);
       }
-      p[--u] = d, p[--u] = g - m, p[--u] = b - m, p[--u] = v;
+      b[--h] = c, b[--h] = m - g, b[--h] = p - g, b[--h] = y;
     } else
-      c == -3 ? y = v : c == -4 && (x = v);
-    return u;
+      d == -3 ? x = y : d == -4 && (v = y);
+    return h;
   }
-  let E = [], N = [];
-  for (; h.pos > 0; )
-    A(r.start || 0, r.bufferStart || 0, E, N, -1, 0);
-  let P = (e = r.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
-  return new D(f[r.topID], E.reverse(), N.reverse(), P);
+  let U = [], S = [];
+  for (; u.pos > 0; )
+    w(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 V(f[r.topID], U.reverse(), S.reverse(), J);
 }
 const Ue = /* @__PURE__ */ new WeakMap();
-function ge(r, e) {
-  if (!r.isAnonymous || e instanceof G || e.type != r)
+function Ce(r, e) {
+  if (!r.isAnonymous || e instanceof Z || 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 D)) {
+      if (n.type != r || !(n instanceof V)) {
         t = 1;
         break;
       }
-      t += ge(r, n);
+      t += Ce(r, n);
     }
     Ue.set(e, t);
   }
   return t;
 }
-function Oe(r, e, t, n, i, s, o, h, f) {
-  let y = 0;
-  for (let _ = n; _ < i; _++)
-    y += ge(r, e[_]);
-  let x = Math.ceil(
-    y * 1.5 / 8
+function Ee(r, e, t, n, i, s, o, u, f) {
+  let x = 0;
+  for (let N = n; N < i; N++)
+    x += Ce(r, e[N]);
+  let v = Math.ceil(
+    x * 1.5 / 8
     /* Balance.BranchFactor */
-  ), A = [], B = [];
-  function T(_, L, ie, Z, E) {
-    for (let N = ie; N < Z; ) {
-      let P = N, m = L[N], p = ge(r, _[N]);
-      for (N++; N < Z; N++) {
-        let u = ge(r, _[N]);
-        if (p + u >= x)
+  ), w = [], A = [];
+  function L(N, M, R, D, U) {
+    for (let S = R; S < D; ) {
+      let J = S, g = M[S], b = Ce(r, N[S]);
+      for (S++; S < D; S++) {
+        let h = Ce(r, N[S]);
+        if (b + h >= v)
           break;
-        p += u;
+        b += h;
       }
-      if (N == P + 1) {
-        if (p > x) {
-          let u = _[P];
-          T(u.children, u.positions, 0, u.children.length, L[P] + E);
+      if (S == J + 1) {
+        if (b > v) {
+          let h = N[J];
+          L(h.children, h.positions, 0, h.children.length, M[J] + U);
           continue;
         }
-        A.push(_[P]);
+        w.push(N[J]);
       } else {
-        let u = L[N - 1] + _[N - 1].length - m;
-        A.push(Oe(r, _, L, P, N, m, u, null, f));
+        let h = M[S - 1] + N[S - 1].length - g;
+        w.push(Ee(r, N, M, J, S, g, h, null, f));
       }
-      B.push(m + E - s);
+      A.push(g + U - s);
     }
   }
-  return T(e, t, n, i, 0), (h || f)(A, B, o);
+  return L(e, t, n, i, 0), (u || f)(w, A, o);
 }
-new C({ perNode: !0 });
-let Lt = 0;
+new _({ perNode: !0 });
+let Pt = 0;
 class H {
   /**
   @internal
   */
   constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = Lt++;
+    this.set = e, this.base = t, this.modified = n, this.id = Pt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1276,44 +1278,44 @@ class H {
   `m1(m3(t1)`, and so on.
   */
   static defineModifier() {
-    let e = new be();
-    return (t) => t.modified.indexOf(e) > -1 ? t : be.get(t.base || t, t.modified.concat(e).sort((n, i) => n.id - i.id));
+    let e = new we();
+    return (t) => t.modified.indexOf(e) > -1 ? t : we.get(t.base || t, t.modified.concat(e).sort((n, i) => n.id - i.id));
   }
 }
-let Ot = 0;
-class be {
+let $t = 0;
+class we {
   constructor() {
-    this.instances = [], this.id = Ot++;
+    this.instances = [], this.id = $t++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((h) => h.base == e && zt(t, h.modified));
+    let n = t[0].instances.find((u) => u.base == e && Tt(t, u.modified));
     if (n)
       return n;
     let i = [], s = new H(i, e, t);
-    for (let h of t)
-      h.instances.push(s);
-    let o = Et(t);
-    for (let h of e.set)
-      if (!h.modified.length)
+    for (let u of t)
+      u.instances.push(s);
+    let o = jt(t);
+    for (let u of e.set)
+      if (!u.modified.length)
         for (let f of o)
-          i.push(be.get(h, f));
+          i.push(we.get(u, f));
     return s;
   }
 }
-function zt(r, e) {
+function Tt(r, e) {
   return r.length == e.length && r.every((t, n) => t == e[n]);
 }
-function Et(r) {
+function jt(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 C();
-function Tt(r, e) {
+new _();
+function Ht(r, e) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let s of r)
     if (!Array.isArray(s.tag))
@@ -1325,11 +1327,11 @@ function Tt(r, e) {
   return {
     style: (s) => {
       let o = i;
-      for (let h of s)
-        for (let f of h.set) {
-          let y = t[f.id];
-          if (y) {
-            o = o ? o + " " + y : y;
+      for (let u of s)
+        for (let f of u.set) {
+          let x = t[f.id];
+          if (x) {
+            o = o ? o + " " + x : x;
             break;
           }
         }
@@ -1338,31 +1340,31 @@ function Tt(r, e) {
     scope: n
   };
 }
-const a = H.define, fe = a(), W = a(), Je = a(W), We = a(W), $ = a(), ce = a($), _e = a($), R = a(), Y = a(R), M = a(), V = a(), Ae = a(), se = a(Ae), de = a(), l = {
+const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F), Se = a(F), j = a(), te = a(j), $ = a(), T = a(), Le = a(), de = a(Le), ke = a(), l = {
   /**
   A comment.
   */
-  comment: fe,
+  comment: ye,
   /**
   A line [comment](#highlight.tags.comment).
   */
-  lineComment: a(fe),
+  lineComment: a(ye),
   /**
   A block [comment](#highlight.tags.comment).
   */
-  blockComment: a(fe),
+  blockComment: a(ye),
   /**
   A documentation [comment](#highlight.tags.comment).
   */
-  docComment: a(fe),
+  docComment: a(ye),
   /**
   Any kind of identifier.
   */
-  name: W,
+  name: q,
   /**
   The [name](#highlight.tags.name) of a variable.
   */
-  variableName: a(W),
+  variableName: a(q),
   /**
   A type [name](#highlight.tags.name).
   */
@@ -1382,253 +1384,253 @@ const a = H.define, fe = a(), W = a(), Je = a(W), We = a(W), $ = a(), ce = a($),
   /**
   The [name](#highlight.tags.name) of a class.
   */
-  className: a(W),
+  className: a(q),
   /**
   A label [name](#highlight.tags.name).
   */
-  labelName: a(W),
+  labelName: a(q),
   /**
   A namespace [name](#highlight.tags.name).
   */
-  namespace: a(W),
+  namespace: a(q),
   /**
   The [name](#highlight.tags.name) of a macro.
   */
-  macroName: a(W),
+  macroName: a(q),
   /**
   A literal value.
   */
-  literal: $,
+  literal: F,
   /**
   A string [literal](#highlight.tags.literal).
   */
-  string: ce,
+  string: xe,
   /**
   A documentation [string](#highlight.tags.string).
   */
-  docString: a(ce),
+  docString: a(xe),
   /**
   A character literal (subtag of [string](#highlight.tags.string)).
   */
-  character: a(ce),
+  character: a(xe),
   /**
   An attribute value (subtag of [string](#highlight.tags.string)).
   */
-  attributeValue: a(ce),
+  attributeValue: a(xe),
   /**
   A number [literal](#highlight.tags.literal).
   */
-  number: _e,
+  number: Se,
   /**
   An integer [number](#highlight.tags.number) literal.
   */
-  integer: a(_e),
+  integer: a(Se),
   /**
   A floating-point [number](#highlight.tags.number) literal.
   */
-  float: a(_e),
+  float: a(Se),
   /**
   A boolean [literal](#highlight.tags.literal).
   */
-  bool: a($),
+  bool: a(F),
   /**
   Regular expression [literal](#highlight.tags.literal).
   */
-  regexp: a($),
+  regexp: a(F),
   /**
   An escape [literal](#highlight.tags.literal), for example a
   backslash escape in a string.
   */
-  escape: a($),
+  escape: a(F),
   /**
   A color [literal](#highlight.tags.literal).
   */
-  color: a($),
+  color: a(F),
   /**
   A URL [literal](#highlight.tags.literal).
   */
-  url: a($),
+  url: a(F),
   /**
   A language keyword.
   */
-  keyword: M,
+  keyword: $,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(M),
+  self: a($),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(M),
+  null: a($),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(M),
+  atom: a($),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(M),
+  unit: a($),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(M),
+  modifier: a($),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(M),
+  operatorKeyword: a($),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(M),
+  controlKeyword: a($),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(M),
+  definitionKeyword: a($),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(M),
+  moduleKeyword: a($),
   /**
   An operator.
   */
-  operator: V,
+  operator: T,
   /**
   An [operator](#highlight.tags.operator) that dereferences something.
   */
-  derefOperator: a(V),
+  derefOperator: a(T),
   /**
   Arithmetic-related [operator](#highlight.tags.operator).
   */
-  arithmeticOperator: a(V),
+  arithmeticOperator: a(T),
   /**
   Logical [operator](#highlight.tags.operator).
   */
-  logicOperator: a(V),
+  logicOperator: a(T),
   /**
   Bit [operator](#highlight.tags.operator).
   */
-  bitwiseOperator: a(V),
+  bitwiseOperator: a(T),
   /**
   Comparison [operator](#highlight.tags.operator).
   */
-  compareOperator: a(V),
+  compareOperator: a(T),
   /**
   [Operator](#highlight.tags.operator) that updates its operand.
   */
-  updateOperator: a(V),
+  updateOperator: a(T),
   /**
   [Operator](#highlight.tags.operator) that defines something.
   */
-  definitionOperator: a(V),
+  definitionOperator: a(T),
   /**
   Type-related [operator](#highlight.tags.operator).
   */
-  typeOperator: a(V),
+  typeOperator: a(T),
   /**
   Control-flow [operator](#highlight.tags.operator).
   */
-  controlOperator: a(V),
+  controlOperator: a(T),
   /**
   Program or markup punctuation.
   */
-  punctuation: Ae,
+  punctuation: Le,
   /**
   [Punctuation](#highlight.tags.punctuation) that separates
   things.
   */
-  separator: a(Ae),
+  separator: a(Le),
   /**
   Bracket-style [punctuation](#highlight.tags.punctuation).
   */
-  bracket: se,
+  bracket: de,
   /**
   Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
   tokens).
   */
-  angleBracket: a(se),
+  angleBracket: a(de),
   /**
   Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
   tokens).
   */
-  squareBracket: a(se),
+  squareBracket: a(de),
   /**
   Parentheses (usually `(` and `)` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  paren: a(se),
+  paren: a(de),
   /**
   Braces (usually `{` and `}` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  brace: a(se),
+  brace: a(de),
   /**
   Content, for example plain text in XML or markup documents.
   */
-  content: R,
+  content: j,
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
-  heading: Y,
+  heading: te,
   /**
   A level 1 [heading](#highlight.tags.heading).
   */
-  heading1: a(Y),
+  heading1: a(te),
   /**
   A level 2 [heading](#highlight.tags.heading).
   */
-  heading2: a(Y),
+  heading2: a(te),
   /**
   A level 3 [heading](#highlight.tags.heading).
   */
-  heading3: a(Y),
+  heading3: a(te),
   /**
   A level 4 [heading](#highlight.tags.heading).
   */
-  heading4: a(Y),
+  heading4: a(te),
   /**
   A level 5 [heading](#highlight.tags.heading).
   */
-  heading5: a(Y),
+  heading5: a(te),
   /**
   A level 6 [heading](#highlight.tags.heading).
   */
-  heading6: a(Y),
+  heading6: a(te),
   /**
   A prose separator (such as a horizontal rule).
   */
-  contentSeparator: a(R),
+  contentSeparator: a(j),
   /**
   [Content](#highlight.tags.content) that represents a list.
   */
-  list: a(R),
+  list: a(j),
   /**
   [Content](#highlight.tags.content) that represents a quote.
   */
-  quote: a(R),
+  quote: a(j),
   /**
   [Content](#highlight.tags.content) that is emphasized.
   */
-  emphasis: a(R),
+  emphasis: a(j),
   /**
   [Content](#highlight.tags.content) that is styled strong.
   */
-  strong: a(R),
+  strong: a(j),
   /**
   [Content](#highlight.tags.content) that is part of a link.
   */
-  link: a(R),
+  link: a(j),
   /**
   [Content](#highlight.tags.content) that is styled as code or
   monospace.
   */
-  monospace: a(R),
+  monospace: a(j),
   /**
   [Content](#highlight.tags.content) that has a strike-through
   style.
   */
-  strikethrough: a(R),
+  strikethrough: a(j),
   /**
   Inserted text in a change-tracking format.
   */
@@ -1648,22 +1650,22 @@ const a = H.define, fe = a(), W = a(), Je = a(W), We = a(W), $ = a(), ce = a($),
   /**
   Metadata or meta-instruction.
   */
-  meta: de,
+  meta: ke,
   /**
   [Metadata](#highlight.tags.meta) that applies to the entire
   document.
   */
-  documentMeta: a(de),
+  documentMeta: a(ke),
   /**
   [Metadata](#highlight.tags.meta) that annotates or adds
   attributes to a given syntactic element.
   */
-  annotation: a(de),
+  annotation: a(ke),
   /**
   Processing instruction or preprocessor directive. Subtag of
   [meta](#highlight.tags.meta).
   */
-  processingInstruction: a(de),
+  processingInstruction: a(ke),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that a
   given element is being defined. Expected to be used with the
@@ -1704,7 +1706,7 @@ const a = H.define, fe = a(), W = a(), Je = a(W), We = a(W), $ = a(), ce = a($),
   */
   special: H.defineModifier()
 };
-Tt([
+Ht([
   { tag: l.link, class: "tok-link" },
   { tag: l.heading, class: "tok-heading" },
   { tag: l.emphasis, class: "tok-emphasis" },
@@ -1736,13 +1738,13 @@ Tt([
   { tag: l.invalid, class: "tok-invalid" },
   { tag: l.punctuation, class: "tok-punctuation" }
 ]);
-const Pt = "#c72727", jt = "#9b5700", Mt = "#067934", Vt = "#0063d7", Rt = {
-  red: Pt,
-  orange: jt,
-  green: Mt,
-  blue: Vt,
+const Vt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
+  red: Vt,
+  orange: Rt,
+  green: Dt,
+  blue: Ut,
   invalid: "#ffffff"
-}, Ht = (r) => ht.define([
+}, Wt = (r) => gt.define([
   {
     tag: l.keyword,
     color: r.red
@@ -1809,45 +1811,78 @@ const Pt = "#c72727", jt = "#9b5700", Mt = "#067934", Vt = "#0063d7", Rt = {
     tag: l.invalid,
     color: r.invalid
   }
-]), Dt = at(Ht(Rt));
-var re = /* @__PURE__ */ ((r) => (r.INLINE = "inline", r.SINGLELINE = "singleline", r.MULTILINE = "multiline", r))(re || {}), Q = /* @__PURE__ */ ((r) => (r.JSON = "json", r.XML = "xml", r.JAVA = "java", r.JAVASCRIPT = "javascript", r))(Q || {}), Ie = /* @__PURE__ */ ((r) => (r.ACTION = "action", r))(Ie || {});
-const Ut = {
-  [Q.JSON]: ut,
-  [Q.XML]: ft,
-  [Q.JAVASCRIPT]: ct,
-  [Q.JAVA]: dt
-}, Jt = (r) => ({
-  loadLang: async () => Ut[r]
-}), $e = {
+]), Gt = pt(Wt(Jt));
+var _e = /* @__PURE__ */ ((r) => (r.INLINE = "inline", r.SINGLELINE = "singleline", r.MULTILINE = "multiline", r))(_e || {}), 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]: mt,
+  [re.XML]: bt,
+  [re.JAVASCRIPT]: yt,
+  [re.JAVA]: xt
+}, qt = (r) => ({
+  loadLang: async () => Kt[r]
+});
+let Ge = 0;
+const Ft = {
+  beforeCreate() {
+    this.uuid = Ge.toString(), Ge += 1;
+  }
+}, tt = (r) => (Fe("data-v-012ee7f3"), r = r(), Xe(), r), Xt = { key: 0 }, Zt = /* @__PURE__ */ tt(() => /* @__PURE__ */ le("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__ */ le("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(r, e, t, n, i, s) {
+  return E(), oe("svg", qe({ role: "img" }, r.$attrs, {
+    xmlns: "http://www.w3.org/2000/svg",
+    width: "16",
+    height: "16",
+    fill: "none"
+  }), [
+    r.$attrs["svg-title"] ? (E(), oe("title", Xt, Ae(r.$attrs["svg-title"]), 1)) : ne("", !0),
+    Zt,
+    Qt
+  ], 16);
+}
+const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f3"]]), Ke = {
   "en-US": {
-    run: "Run"
+    run: "Run",
+    expand: "Expand"
   }
-}, Wt = Fe({
-  i18n: { messages: $e },
+}, tn = nt({
+  i18n: { messages: Ke },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: bt,
-    BentoButton: gt,
-    BentoDropdown: pt,
-    Copy: vt
+    BentoTypography: vt,
+    BentoButton: _t,
+    BentoDropdown: kt,
+    Copy: At,
+    BaseModal: Ct,
+    BentoLoadingIndicator: Nt,
+    ExpandIcon: en
   },
-  directives: { BentoTooltipDirective: xt },
+  directives: { BentoTooltipDirective: wt },
   props: {
     /**
      * Defines the variant of code-snippet
      */
     variant: {
       type: String,
-      default: re.MULTILINE,
-      validator: (r) => Object.values(re).includes(r)
+      default: _e.MULTILINE,
+      validator: (r) => Object.values(_e).includes(r)
     },
     /**
      * Language name for syntax highlighting rules
      */
     lang: {
       type: String,
-      default: Q.JSON,
-      validator: (r) => Object.values(Q).includes(r)
+      default: re.JSON,
+      validator: (r) => Object.values(re).includes(r)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1878,6 +1913,14 @@ const Ut = {
       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
@@ -1885,151 +1928,193 @@ const Ut = {
     actionableText: {
       type: String,
       default: "run"
+    },
+    /**
+     * Toggles the loading indicator within the action bar
+     */
+    loading: {
+      type: Boolean,
+      default: !1
     }
   },
-  emits: [Ie.ACTION],
+  emits: [ce.ACTION, ce.CHANGE],
   setup(r, { emit: e }) {
-    const { t } = kt({ messages: $e }), n = ye(null), i = [], s = () => {
-    }, o = xe(() => r.langLabel ?? r.lang.toUpperCase()), h = xe(() => ({
-      "b-code-snippet--inline": r.variant === re.INLINE,
-      "b-code-snippet--scrollable": r.variant !== re.INLINE
-    })), { loadLang: f } = Jt(r.lang), y = Te(), x = Te(), A = new Ce(), B = new Ce(), T = new Ce(), _ = ye(""), L = ye(0);
-    Xe(async () => {
-      const E = await f();
-      _.value = r.content;
-      const N = ({ state: p }) => {
-        _.value = p.doc.toString();
-      }, P = [
-        rt(),
-        it.of([ot]),
-        A.of(E()),
-        B.of(Dt),
-        T.of(Re.readOnly.of(!r.editable)),
-        Ve.updateListener.of((p) => N(p))
+    const { t } = St({ messages: Ke }), n = me(null), i = [], s = () => {
+    }, o = ae(() => r.langLabel ?? r.lang.toUpperCase()), u = ae(() => r.variant === _e.INLINE), f = ae(() => ({
+      "b-code-snippet--inline": u.value,
+      "b-code-snippet--scrollable": !u.value
+    })), x = ae(() => ({
+      "b-code-snippet__code-area-content--editable": r.editable
+    })), { loadLang: v } = qt(r.lang), w = $e(), A = $e(), L = new Ne(), N = new Ne(), M = new Ne(), R = me(""), D = me(0);
+    rt(async () => {
+      const g = await v();
+      R.value = r.content;
+      const b = ({ state: p }) => {
+        R.value = p.doc.toString();
+      }, h = [
+        ut(),
+        ht.of([dt]),
+        L.of(g()),
+        N.of(Gt),
+        M.of(Ve.readOnly.of(!r.editable)),
+        He.updateListener.of((p) => b(p))
       ];
-      r.variant === "multiline" && P.push([st(), lt()]);
-      const m = Re.create({
+      r.variant === "multiline" && h.push([ft(), ct()]);
+      const y = Ve.create({
         doc: r.content,
-        extensions: [...P]
+        extensions: [...h]
       });
-      L.value = m.doc.length, x.value = new Ve({
-        state: m,
-        parent: y.value
+      D.value = y.doc.length, A.value = new He({
+        state: y,
+        parent: w.value
       });
-    }), Ye(
+    }), it(
       () => r.content,
       () => {
-        const E = r.content.length;
-        x.value.dispatch({
+        const g = r.content.length;
+        A.value.dispatch({
           changes: {
             from: 0,
-            to: L.value,
+            to: D.value,
             insert: r.content
           }
-        }), L.value = E;
+        }), D.value = g;
       }
     );
-    const ie = xe(() => t(r.actionableText));
+    const U = ae(() => t(r.actionableText)), S = () => {
+      e(ce.ACTION, R.value);
+    };
+    st(() => {
+      e(ce.CHANGE, R.value);
+    });
+    const J = me(!1);
     return {
-      // Enums
-      BentoTypographyElement: yt,
-      BentoButtonVariant: mt,
-      BentoCodeSnippetVariant: re,
       // Values
-      container: y,
-      editor: x,
-      currentContents: _,
-      conditionalClasses: h,
       availableLanguages: i,
+      codeAreaContentConditionalClasses: x,
+      conditionalClasses: f,
+      container: w,
+      currentContents: R,
       displayedLang: o,
+      editor: A,
       selectedLanguage: n,
+      showModal: J,
+      isInlineVariant: u,
       // Methods
       handleChangeLanguage: s,
-      runText: ie,
-      onActionClicked: () => {
-        e(Ie.ACTION, _);
-      }
+      onActionClicked: S,
+      runText: U,
+      // Translations
+      t
     };
   }
 });
-const $t = (r) => (tt("data-v-170f3059"), r = r(), nt(), r), Kt = {
+const nn = (r) => (Fe("data-v-c3034448"), r = r(), Xe(), r), rn = {
   key: 0,
   class: "b-code-snippet__action-bar"
-}, Gt = { class: "b-code-snippet__action-bar--start" }, qt = { class: "b-code-snippet__action-bar--end" }, Ft = {
+}, sn = { class: "b-code-snippet__action-bar--start" }, on = { class: "b-code-snippet__action-bar--end" }, ln = {
   key: 1,
   class: "b-code-snippet__code-area"
-}, Xt = {
-  ref: "container",
-  class: "b-code-snippet__code-area-content"
-}, Yt = { key: 2 }, Qt = /* @__PURE__ */ $t(() => /* @__PURE__ */ pe("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
-function Zt(r, e, t, n, i, s) {
-  const o = ae("bento-dropdown"), h = ae("bento-typography"), f = ae("copy"), y = ae("bento-button");
-  return ne(), he("div", {
-    class: Qe(["b-code-snippet", r.conditionalClasses])
+}, an = { key: 2 }, un = /* @__PURE__ */ nn(() => /* @__PURE__ */ le("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
+function hn(r, e, t, n, i, s) {
+  const o = K("bento-dropdown"), u = K("bento-typography"), f = K("bento-loading-indicator"), x = K("copy"), v = K("expand-icon"), w = K("bento-button"), A = K("bento-code-snippet"), L = K("base-modal");
+  return E(), oe("div", {
+    class: Te(["b-code-snippet", r.conditionalClasses])
   }, [
-    r.variant !== r.BentoCodeSnippetVariant.INLINE ? (ne(), he("section", Kt, [
-      pe("div", Gt, [
-        r.availableLanguages.length > 0 ? (ne(), Pe(o, Ze({
+    r.isInlineVariant ? ne("", !0) : (E(), oe("section", rn, [
+      le("div", sn, [
+        r.availableLanguages.length > 0 ? (E(), ue(o, qe({
           key: 0,
           modelValue: r.selectedLanguage,
-          "onUpdate:modelValue": e[0] || (e[0] = (x) => r.selectedLanguage = x)
+          "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"])) : ke("", !0),
-        ve(h, {
-          el: r.BentoTypographyElement.SPAN,
+        }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : ne("", !0),
+        he(u, {
+          el: "span",
           stronger: ""
         }, {
-          default: we(() => [
-            je(Me(r.displayedLang), 1)
+          default: fe(() => [
+            je(Ae(r.displayedLang), 1)
           ]),
           _: 1
-        }, 8, ["el"])
+        })
       ]),
-      pe("div", qt, [
-        ve(f, {
+      le("div", on, [
+        r.loading ? (E(), ue(f, { key: 0 })) : ne("", !0),
+        he(x, {
           class: "b-structured-list__icon",
           text: r.currentContents
         }, null, 8, ["text"]),
-        r.actionable ? (ne(), Pe(y, {
-          key: 0,
-          variant: r.BentoButtonVariant.PRIMARY,
+        r.expandable ? (E(), ue(w, {
+          key: 1,
+          variant: "tertiary",
+          condensed: "",
+          "aria-label": r.t("expand"),
+          onClick: e[1] || (e[1] = (N) => r.showModal = !0)
+        }, {
+          iconLeft: fe(() => [
+            he(v)
+          ]),
+          _: 1
+        }, 8, ["aria-label"])) : ne("", !0),
+        r.actionable ? (E(), ue(w, {
+          key: 2,
+          variant: "primary",
           tertiary: "",
           condensed: "",
           onClick: r.onActionClicked
         }, {
-          iconLeft: we(() => [
-            ve(h, {
-              el: r.BentoTypographyElement.SPAN,
+          iconLeft: fe(() => [
+            he(u, {
+              el: "span",
               class: "b-code-snippet__action-button"
             }, {
-              default: we(() => [
-                je(Me(r.runText), 1)
+              default: fe(() => [
+                je(Ae(r.runText), 1)
               ]),
               _: 1
-            }, 8, ["el"])
+            })
           ]),
           _: 1
-        }, 8, ["variant", "onClick"])) : ke("", !0)
+        }, 8, ["onClick"])) : ne("", !0)
       ])
-    ])) : ke("", !0),
-    r.content ? (ne(), he("code", Ft, [
-      pe("div", Xt, null, 512)
-    ])) : (ne(), he("section", Yt, [
-      et(r.$slots, "empty-state", {}, () => [
-        Qt
+    ])),
+    r.content ? (E(), oe("code", ln, [
+      le("div", {
+        ref: "container",
+        class: Te(["b-code-snippet__code-area-content", r.codeAreaContentConditionalClasses])
+      }, null, 2)
+    ])) : (E(), oe("section", an, [
+      ot(r.$slots, "empty-state", {}, () => [
+        un
       ], !0)
-    ]))
+    ])),
+    r.expandable ? (E(), ue(L, {
+      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: fe(() => [
+        he(A, lt(at({ ...r.$props, expandable: !1 })), null, 16)
+      ]),
+      _: 1
+    }, 8, ["is-open"])) : ne("", !0)
   ], 2);
 }
-const bn = /* @__PURE__ */ wt(Wt, [["render", Zt], ["__scopeId", "data-v-170f3059"]]);
+const Bn = /* @__PURE__ */ Ze(tn, [["render", hn], ["__scopeId", "data-v-c3034448"]]);
 export {
-  bn as BentoCodeSnippet,
-  Ie as BentoCodeSnippetEvent,
-  Q as BentoCodeSnippetSupportedLanguage,
-  re as BentoCodeSnippetVariant
+  Bn as BentoCodeSnippet,
+  ce as BentoCodeSnippetEvent,
+  re as BentoCodeSnippetSupportedLanguage,
+  _e as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map