@adyen/bento-vue2 1.3.0 → 1.4.0

package/dist/code-snippet.js

@@ -1,28 +1,30 @@
-import { defineComponent as Re, ref as pe, computed as ge, shallowRef as Ae, onMounted as He, watch as De } from "vue";
-import { highlightActiveLine as Je, keymap as Ue, EditorView as Ie, lineNumbers as Ve } from "@codemirror/view";
-import { Compartment as me, EditorState as Be } from "@codemirror/state";
-import { indentWithTab as We, history as Ke } from "@codemirror/commands";
-import { syntaxHighlighting as Fe, HighlightStyle as Ge } from "@codemirror/language";
-import { json as qe } from "@codemirror/lang-json";
-import { xml as Xe } from "@codemirror/lang-xml";
-import { javascript as $e } from "@codemirror/lang-javascript";
-import { java as Ye } from "@codemirror/lang-java";
-import { B as Qe } from "./chunks/dropdown.c05678d0.js";
-import { B as Ze, a as et } from "./chunks/button.d0c9527d.js";
-import { B as tt, a as nt } from "./chunks/index.56858f4e.js";
-import { u as rt } from "./chunks/i18n.155748d6.js";
-import { C as it } from "./chunks/copy.5a4cbd4d.js";
-import { b as st } from "./chunks/tooltip.2aff4fa6.js";
-import { n as lt } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
-import "./assets/index5.css";
-const ot = 1024;
-let at = 0;
-class _ {
+import { defineComponent as Ve, ref as ae, computed as re, shallowRef as Ae, onMounted as $e, watch as De, watchEffect as Je } from "vue";
+import { highlightActiveLine as Ue, keymap as We, EditorView as Ie, lineNumbers as Ge } from "@codemirror/view";
+import { Compartment as be, EditorState as Le } from "@codemirror/state";
+import { indentWithTab as Ke, history as Fe } from "@codemirror/commands";
+import { syntaxHighlighting as qe, HighlightStyle as Xe } from "@codemirror/language";
+import { json as Ze } from "@codemirror/lang-json";
+import { xml as Qe } from "@codemirror/lang-xml";
+import { javascript as Ye } from "@codemirror/lang-javascript";
+import { java as et } from "@codemirror/lang-java";
+import { B as tt } from "./chunks/dropdown.fd93f0ce.js";
+import { f as nt } from "./chunks/base-modal.a365f260.js";
+import { a as rt } from "./chunks/button.fb307df3.js";
+import { B as it } from "./chunks/index.45295dd3.js";
+import { BentoLoadingIndicator as st } from "./loading-indicator.js";
+import { u as lt } from "./chunks/i18n.155748d6.js";
+import { n as Te } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
+import { C as ot } from "./chunks/copy.ac796536.js";
+import { b as at } from "./chunks/tooltip.a47ace87.js";
+import "./assets/index10.css";
+const ft = 1024;
+let ut = 0;
+class v {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = at++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = ut++, 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 _ {
   add(e) {
     if (this.perNode)
       throw new RangeError("Can't add per-node props to node types");
-    return typeof e != "function" && (e = V.match(e)), (t) => {
+    return typeof e != "function" && (e = W.match(e)), (t) => {
       let n = e(t);
       return n === void 0 ? null : [this, n];
     };
   }
 }
-_.closedBy = new _({ deserialize: (i) => i.split(" ") });
-_.openedBy = new _({ deserialize: (i) => i.split(" ") });
-_.group = new _({ deserialize: (i) => i.split(" ") });
-_.isolate = new _({ deserialize: (i) => {
+v.closedBy = new v({ deserialize: (i) => i.split(" ") });
+v.openedBy = new v({ deserialize: (i) => i.split(" ") });
+v.group = new v({ deserialize: (i) => i.split(" ") });
+v.isolate = new v({ deserialize: (i) => {
   if (i && i != "rtl" && i != "ltr" && i != "auto")
     throw new RangeError("Invalid value for isolate: " + i);
   return i || "auto";
 } });
-_.contextHash = new _({ perNode: !0 });
-_.lookAhead = new _({ perNode: !0 });
-_.mounted = new _({ perNode: !0 });
-class ce {
+v.contextHash = new v({ perNode: !0 });
+v.lookAhead = new v({ perNode: !0 });
+v.mounted = new v({ perNode: !0 });
+class ge {
   constructor(e, t, n) {
     this.tree = e, this.overlay = t, this.parser = n;
   }
@@ -63,11 +65,11 @@ class ce {
   @internal
   */
   static get(e) {
-    return e && e.props && e.props[_.mounted.id];
+    return e && e.props && e.props[v.mounted.id];
   }
 }
 const ht = /* @__PURE__ */ Object.create(null);
-class V {
+class W {
   /**
   @internal
   */
@@ -78,7 +80,7 @@ class V {
   Define a node type.
   */
   static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : ht, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new V(e.name || "", t, e.id, n);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : ht, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new W(e.name || "", t, e.id, n);
     if (e.props) {
       for (let s of e.props)
         if (Array.isArray(s) || (s = s(r)), s) {
@@ -129,7 +131,7 @@ class V {
     if (typeof e == "string") {
       if (this.name == e)
         return !0;
-      let t = this.prop(_.group);
+      let t = this.prop(v.group);
       return t ? t.indexOf(e) > -1 : !1;
     }
     return this.id == e;
@@ -148,7 +150,7 @@ class V {
       for (let r of n.split(" "))
         t[r] = e[n];
     return (n) => {
-      for (let r = n.prop(_.group), s = -1; s < (r ? r.length : 0); s++) {
+      for (let r = n.prop(v.group), s = -1; s < (r ? r.length : 0); s++) {
         let l = t[s < 0 ? n.name : r[s]];
         if (l)
           return l;
@@ -156,34 +158,34 @@ class V {
     };
   }
 }
-V.none = new V(
+W.none = new W(
   "",
   /* @__PURE__ */ Object.create(null),
   0,
   8
   /* NodeFlag.Anonymous */
 );
-const oe = /* @__PURE__ */ new WeakMap(), Le = /* @__PURE__ */ new WeakMap();
+const fe = /* @__PURE__ */ new WeakMap(), Be = /* @__PURE__ */ new WeakMap();
 var S;
 (function(i) {
   i[i.ExcludeBuffers = 1] = "ExcludeBuffers", i[i.IncludeAnonymous = 2] = "IncludeAnonymous", i[i.IgnoreMounts = 4] = "IgnoreMounts", i[i.IgnoreOverlays = 8] = "IgnoreOverlays";
 })(S || (S = {}));
-class J {
+class R {
   /**
   Construct a new tree. See also [`Tree.build`](#common.Tree^build).
   */
   constructor(e, t, n, r, s) {
     if (this.type = e, this.children = t, this.positions = n, this.length = r, this.props = null, s && s.length) {
       this.props = /* @__PURE__ */ Object.create(null);
-      for (let [l, h] of s)
-        this.props[typeof l == "number" ? l : l.id] = h;
+      for (let [l, f] of s)
+        this.props[typeof l == "number" ? l : l.id] = f;
     }
   }
   /**
   @internal
   */
   toString() {
-    let e = ce.get(this);
+    let e = ge.get(this);
     if (e && !e.overlay)
       return e.tree.toString();
     let t = "";
@@ -199,7 +201,7 @@ class J {
   nodes the cursor visits.
   */
   cursor(e = 0) {
-    return new xe(this.topNode, e);
+    return new _e(this.topNode, e);
   }
   /**
   Get a [tree cursor](#common.TreeCursor) pointing into this tree
@@ -207,15 +209,15 @@ class J {
   [`moveTo`](#common.TreeCursor.moveTo).
   */
   cursorAt(e, t = 0, n = 0) {
-    let r = oe.get(this) || this.topNode, s = new xe(r);
-    return s.moveTo(e, t), oe.set(this, s._tree), s;
+    let r = fe.get(this) || this.topNode, s = new _e(r);
+    return s.moveTo(e, t), fe.set(this, s._tree), s;
   }
   /**
   Get a [syntax node](#common.SyntaxNode) object for the top of the
   tree.
   */
   get topNode() {
-    return new z(this, 0, 0, null);
+    return new O(this, 0, 0, null);
   }
   /**
   Get the [syntax node](#common.SyntaxNode) at the given position.
@@ -229,8 +231,8 @@ class J {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let n = se(oe.get(this) || this.topNode, e, t, !1);
-    return oe.set(this, n), n;
+    let n = le(fe.get(this) || this.topNode, e, t, !1);
+    return fe.set(this, n), n;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -240,8 +242,8 @@ class J {
   the host trees).
   */
   resolveInner(e, t = 0) {
-    let n = se(Le.get(this) || this.topNode, e, t, !0);
-    return Le.set(this, n), n;
+    let n = le(Be.get(this) || this.topNode, e, t, !0);
+    return Be.set(this, n), n;
   }
   /**
   In some situations, it can be useful to iterate through all
@@ -251,7 +253,7 @@ class J {
   position.
   */
   resolveStack(e, t = 0) {
-    return ct(this, e, t);
+    return pt(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -261,18 +263,18 @@ class J {
   not have its children iterated over (or `leave` called).
   */
   iterate(e) {
-    let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, l = e.mode || 0, h = (l & S.IncludeAnonymous) > 0;
-    for (let f = this.cursor(l | S.IncludeAnonymous); ; ) {
-      let x = !1;
-      if (f.from <= s && f.to >= r && (!h && f.type.isAnonymous || t(f) !== !1)) {
-        if (f.firstChild())
+    let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, l = e.mode || 0, f = (l & S.IncludeAnonymous) > 0;
+    for (let h = this.cursor(l | S.IncludeAnonymous); ; ) {
+      let C = !1;
+      if (h.from <= s && h.to >= r && (!f && h.type.isAnonymous || t(h) !== !1)) {
+        if (h.firstChild())
           continue;
-        x = !0;
+        C = !0;
       }
-      for (; x && n && (h || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
-        if (!f.parent())
+      for (; C && n && (f || !h.type.isAnonymous) && n(h), !h.nextSibling(); ) {
+        if (!h.parent())
           return;
-        x = !0;
+        C = !0;
       }
     }
   }
@@ -301,18 +303,18 @@ class J {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : we(V.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, r) => new J(this.type, t, n, r, this.propValues), e.makeTree || ((t, n, r) => new J(V.none, t, n, r)));
+    return this.children.length <= 8 ? this : we(W.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, r) => new R(this.type, t, n, r, this.propValues), e.makeTree || ((t, n, r) => new R(W.none, t, n, r)));
   }
   /**
   Build a tree from a postfix-ordered buffer of node information,
   or a cursor over such a buffer.
   */
   static build(e) {
-    return dt(e);
+    return gt(e);
   }
 }
-J.empty = new J(V.none, [], [], 0);
-class _e {
+R.empty = new R(W.none, [], [], 0);
+class Ce {
   constructor(e, t) {
     this.buffer = e, this.index = t;
   }
@@ -335,10 +337,10 @@ class _e {
     this.index -= 4;
   }
   fork() {
-    return new _e(this.buffer, this.index);
+    return new Ce(this.buffer, this.index);
   }
 }
-class G {
+class q {
   /**
   Create a tree buffer.
   */
@@ -349,7 +351,7 @@ class G {
   @internal
   */
   get type() {
-    return V.none;
+    return W.none;
   }
   /**
   @internal
@@ -376,25 +378,25 @@ class G {
   @internal
   */
   findChild(e, t, n, r, s) {
-    let { buffer: l } = this, h = -1;
-    for (let f = e; f != t && !(Te(s, r, l[f + 1], l[f + 2]) && (h = f, n > 0)); f = l[f + 3])
+    let { buffer: l } = this, f = -1;
+    for (let h = e; h != t && !(je(s, r, l[h + 1], l[h + 2]) && (f = h, n > 0)); h = l[h + 3])
       ;
-    return h;
+    return f;
   }
   /**
   @internal
   */
   slice(e, t, n) {
     let r = this.buffer, s = new Uint16Array(t - e), l = 0;
-    for (let h = e, f = 0; h < t; ) {
-      s[f++] = r[h++], s[f++] = r[h++] - n;
-      let x = s[f++] = r[h++] - n;
-      s[f++] = r[h++] - e, l = Math.max(l, x);
+    for (let f = e, h = 0; f < t; ) {
+      s[h++] = r[f++], s[h++] = r[f++] - n;
+      let C = s[h++] = r[f++] - n;
+      s[h++] = r[f++] - e, l = Math.max(l, C);
     }
-    return new G(s, l, this.set);
+    return new q(s, l, this.set);
   }
 }
-function Te(i, e, t, n) {
+function je(i, e, t, n) {
   switch (i) {
     case -2:
       return t < e;
@@ -410,17 +412,17 @@ function Te(i, e, t, n) {
       return !0;
   }
 }
-function se(i, e, t, n) {
+function le(i, e, t, n) {
   for (var r; i.from == i.to || (t < 1 ? i.from >= e : i.from > e) || (t > -1 ? i.to <= e : i.to < e); ) {
-    let l = !n && i instanceof z && i.index < 0 ? null : i.parent;
+    let l = !n && i instanceof O && i.index < 0 ? null : i.parent;
     if (!l)
       return i;
     i = l;
   }
   let s = n ? 0 : S.IgnoreOverlays;
   if (n)
-    for (let l = i, h = l.parent; h; l = h, h = l.parent)
-      l instanceof z && l.index < 0 && ((r = h.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = h);
+    for (let l = i, f = l.parent; f; l = f, f = l.parent)
+      l instanceof O && l.index < 0 && ((r = f.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = f);
   for (; ; ) {
     let l = i.enter(e, t, s);
     if (!l)
@@ -428,9 +430,9 @@ function se(i, e, t, n) {
     i = l;
   }
 }
-class je {
+class He {
   cursor(e = 0) {
-    return new xe(this, e);
+    return new _e(this, e);
   }
   getChild(e, t = null, n = null) {
     let r = Oe(this, e, t, n);
@@ -440,13 +442,13 @@ class je {
     return Oe(this, e, t, n);
   }
   resolve(e, t = 0) {
-    return se(this, e, t, !1);
+    return le(this, e, t, !1);
   }
   resolveInner(e, t = 0) {
-    return se(this, e, t, !0);
+    return le(this, e, t, !0);
   }
   matchContext(e) {
-    return ye(this, e);
+    return xe(this, e);
   }
   enterUnfinishedNodesBefore(e) {
     let t = this.childBefore(e), n = this;
@@ -465,7 +467,7 @@ class je {
     return this.parent;
   }
 }
-class z extends je {
+class O extends He {
   constructor(e, t, n, r) {
     super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
   }
@@ -480,21 +482,21 @@ class z extends je {
   }
   nextChild(e, t, n, r, s = 0) {
     for (let l = this; ; ) {
-      for (let { children: h, positions: f } = l._tree, x = t > 0 ? h.length : -1; e != x; e += t) {
-        let C = h[e], A = f[e] + l.from;
-        if (Te(r, n, A, A + C.length)) {
-          if (C instanceof G) {
+      for (let { children: f, positions: h } = l._tree, C = t > 0 ? f.length : -1; e != C; e += t) {
+        let k = f[e], N = h[e] + l.from;
+        if (je(r, n, N, N + k.length)) {
+          if (k instanceof q) {
             if (s & S.ExcludeBuffers)
               continue;
-            let B = C.findChild(0, C.buffer.length, t, n - A, r);
-            if (B > -1)
-              return new F(new ut(l, C, e, A), null, B);
-          } else if (s & S.IncludeAnonymous || !C.type.isAnonymous || Ce(C)) {
-            let B;
-            if (!(s & S.IgnoreMounts) && (B = ce.get(C)) && !B.overlay)
-              return new z(B.tree, A, e, l);
-            let P = new z(C, A, e, l);
-            return s & S.IncludeAnonymous || !P.type.isAnonymous ? P : P.nextChild(t < 0 ? C.children.length - 1 : 0, t, n, r);
+            let A = k.findChild(0, k.buffer.length, t, n - N, r);
+            if (A > -1)
+              return new F(new ct(l, k, e, N), null, A);
+          } else if (s & S.IncludeAnonymous || !k.type.isAnonymous || ke(k)) {
+            let A;
+            if (!(s & S.IgnoreMounts) && (A = ge.get(k)) && !A.overlay)
+              return new O(A.tree, N, e, l);
+            let z = new O(k, N, e, l);
+            return s & S.IncludeAnonymous || !z.type.isAnonymous ? z : z.nextChild(t < 0 ? k.children.length - 1 : 0, t, n, r);
           }
         }
       }
@@ -540,11 +542,11 @@ class z extends je {
   }
   enter(e, t, n = 0) {
     let r;
-    if (!(n & S.IgnoreOverlays) && (r = ce.get(this._tree)) && r.overlay) {
+    if (!(n & S.IgnoreOverlays) && (r = ge.get(this._tree)) && r.overlay) {
       let s = e - this.from;
-      for (let { from: l, to: h } of r.overlay)
-        if ((t > 0 ? l <= s : l < s) && (t < 0 ? h >= s : h > s))
-          return new z(r.tree, r.overlay[0].from + this.from, -1, this);
+      for (let { from: l, to: f } of r.overlay)
+        if ((t > 0 ? l <= s : l < s) && (t < 0 ? f >= s : f > s))
+          return new O(r.tree, r.overlay[0].from + this.from, -1, this);
     }
     return this.nextChild(0, 1, e, t, n);
   }
@@ -604,7 +606,7 @@ function Oe(i, e, t, n) {
       return n == null ? s : [];
   }
 }
-function ye(i, e, t = e.length - 1) {
+function xe(i, e, t = e.length - 1) {
   for (let n = i.parent; t >= 0; n = n.parent) {
     if (!n)
       return !1;
@@ -616,12 +618,12 @@ function ye(i, e, t = e.length - 1) {
   }
   return !0;
 }
-class ut {
+class ct {
   constructor(e, t, n, r) {
     this.parent = e, this.buffer = t, this.index = n, this.start = r;
   }
 }
-class F extends je {
+class F extends He {
   get name() {
     return this.type.name;
   }
@@ -712,7 +714,7 @@ class F extends je {
       let l = n.buffer[this.index + 1];
       e.push(n.slice(r, s, l)), t.push(0);
     }
-    return new J(this.type, e, t, this.to - this.from);
+    return new R(this.type, e, t, this.to - this.from);
   }
   /**
   @internal
@@ -721,7 +723,7 @@ class F extends je {
     return this.context.buffer.childString(this.index);
   }
 }
-function Me(i) {
+function Re(i) {
   if (!i.length)
     return null;
   let e = 0, t = i[0];
@@ -729,33 +731,33 @@ function Me(i) {
     let l = i[s];
     (l.from > t.from || l.to < t.to) && (t = l, e = s);
   }
-  let n = t instanceof z && t.index < 0 ? null : t.parent, r = i.slice();
-  return n ? r[e] = n : r.splice(e, 1), new ft(r, t);
+  let n = t instanceof O && t.index < 0 ? null : t.parent, r = i.slice();
+  return n ? r[e] = n : r.splice(e, 1), new dt(r, t);
 }
-class ft {
+class dt {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
   get next() {
-    return Me(this.heads);
+    return Re(this.heads);
   }
 }
-function ct(i, e, t) {
+function pt(i, e, t) {
   let n = i.resolveInner(e, t), r = null;
-  for (let s = n instanceof z ? n : n.context.parent; s; s = s.parent)
+  for (let s = n instanceof O ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
       let l = s.parent;
       (r || (r = [n])).push(l.resolve(e, t)), s = l;
     } else {
-      let l = ce.get(s.tree);
+      let l = ge.get(s.tree);
       if (l && l.overlay && l.overlay[0].from <= e && l.overlay[l.overlay.length - 1].to >= e) {
-        let h = new z(l.tree, l.overlay[0].from + s.from, -1, s);
-        (r || (r = [n])).push(se(h, e, t, !1));
+        let f = new O(l.tree, l.overlay[0].from + s.from, -1, s);
+        (r || (r = [n])).push(le(f, e, t, !1));
       }
     }
-  return r ? Me(r) : n;
+  return r ? Re(r) : n;
 }
-class xe {
+class _e {
   /**
   Shorthand for `.type.name`.
   */
@@ -766,7 +768,7 @@ class xe {
   @internal
   */
   constructor(e, t = 0) {
-    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof z)
+    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof O)
       this.yieldNode(e);
     else {
       this._tree = e.context.parent, this.buffer = e.context;
@@ -787,7 +789,7 @@ class xe {
   @internal
   */
   yield(e) {
-    return e ? e instanceof z ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
+    return e ? e instanceof O ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
   }
   /**
   @internal
@@ -923,8 +925,8 @@ class xe {
     for (; n; { index: t, _parent: n } = n)
       if (t > -1)
         for (let s = t + e, l = e < 0 ? -1 : n._tree.children.length; s != l; s += e) {
-          let h = n._tree.children[s];
-          if (this.mode & S.IncludeAnonymous || h instanceof G || !h.type.isAnonymous || Ce(h))
+          let f = n._tree.children[s];
+          if (this.mode & S.IncludeAnonymous || f instanceof q || !f.type.isAnonymous || ke(f))
             return !1;
         }
     return !0;
@@ -1037,11 +1039,11 @@ class xe {
   */
   matchContext(e) {
     if (!this.buffer)
-      return ye(this.node, e);
+      return xe(this.node, e);
     let { buffer: t } = this.buffer, { types: n } = t.set;
     for (let r = e.length - 1, s = this.stack.length - 1; r >= 0; s--) {
       if (s < 0)
-        return ye(this.node, e, r);
+        return xe(this.node, e, r);
       let l = n[t.buffer[this.stack[s]]];
       if (!l.isAnonymous) {
         if (e[r] && e[r] != l.name)
@@ -1052,200 +1054,200 @@ class xe {
     return !0;
   }
 }
-function Ce(i) {
-  return i.children.some((e) => e instanceof G || !e.type.isAnonymous || Ce(e));
+function ke(i) {
+  return i.children.some((e) => e instanceof q || !e.type.isAnonymous || ke(e));
 }
-function dt(i) {
+function gt(i) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = ot, reused: s = [], minRepeatType: l = n.types.length } = i, h = Array.isArray(t) ? new _e(t, t.length) : t, f = n.types, x = 0, C = 0;
-  function A(m, p, u, k, b, g) {
-    let { id: c, start: d, end: v, size: y } = h, I = C;
-    for (; y < 0; )
-      if (h.next(), y == -1) {
+  let { buffer: t, nodeSet: n, maxBufferLength: r = ft, reused: s = [], minRepeatType: l = n.types.length } = i, f = Array.isArray(t) ? new Ce(t, t.length) : t, h = n.types, C = 0, k = 0;
+  function N(g, b, u, y, p, m) {
+    let { id: c, start: d, end: _, size: x } = f, L = k;
+    for (; x < 0; )
+      if (f.next(), x == -1) {
         let U = s[c];
-        u.push(U), k.push(d - m);
-        return;
-      } else if (y == -3) {
-        x = c;
+        u.push(U), y.push(d - g);
         return;
-      } else if (y == -4) {
+      } else if (x == -3) {
         C = c;
         return;
+      } else if (x == -4) {
+        k = c;
+        return;
       } else
-        throw new RangeError(`Unrecognized record size: ${y}`);
-    let q = f[c], ee, X, Ne = d - m;
-    if (v - d <= r && (X = re(h.pos - p, b))) {
-      let U = new Uint16Array(X.size - X.skip), O = h.pos - X.size, j = U.length;
-      for (; h.pos > O; )
-        j = Z(X.start, U, j);
-      ee = new G(U, v - X.start, n), Ne = X.start - m;
+        throw new RangeError(`Unrecognized record size: ${x}`);
+    let X = h[c], te, Z, Ne = d - g;
+    if (_ - d <= r && (Z = V(f.pos - b, p))) {
+      let U = new Uint16Array(Z.size - Z.skip), B = f.pos - Z.size, M = U.length;
+      for (; f.pos > B; )
+        M = $(Z.start, U, M);
+      te = new q(U, _ - Z.start, n), Ne = Z.start - g;
     } else {
-      let U = h.pos - y;
-      h.next();
-      let O = [], j = [], $ = c >= l ? c : -1, te = 0, le = v;
-      for (; h.pos > U; )
-        $ >= 0 && h.id == $ && h.size >= 0 ? (h.end <= le - r && (w(O, j, d, te, h.end, le, $, I), te = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, j) : A(d, U, O, j, $, g + 1);
-      if ($ >= 0 && te > 0 && te < O.length && w(O, j, d, te, d, le, $, I), O.reverse(), j.reverse(), $ > -1 && te > 0) {
-        let Se = P(q);
-        ee = we(q, O, j, 0, O.length, 0, v - d, Se, Se);
+      let U = f.pos - x;
+      f.next();
+      let B = [], M = [], Q = c >= l ? c : -1, ne = 0, oe = _;
+      for (; f.pos > U; )
+        Q >= 0 && f.id == Q && f.size >= 0 ? (f.end <= oe - r && (I(B, M, d, ne, f.end, oe, Q, L), ne = B.length, oe = f.end), f.next()) : m > 2500 ? A(d, U, B, M) : N(d, U, B, M, Q, m + 1);
+      if (Q >= 0 && ne > 0 && ne < B.length && I(B, M, d, ne, d, oe, Q, L), B.reverse(), M.reverse(), Q > -1 && ne > 0) {
+        let Se = z(X);
+        te = we(X, B, M, 0, B.length, 0, _ - d, Se, Se);
       } else
-        ee = L(q, O, j, v - d, I - v);
+        te = E(X, B, M, _ - d, L - _);
     }
-    u.push(ee), k.push(Ne);
-  }
-  function B(m, p, u, k) {
-    let b = [], g = 0, c = -1;
-    for (; h.pos > p; ) {
-      let { id: d, start: v, end: y, size: I } = h;
-      if (I > 4)
-        h.next();
+    u.push(te), y.push(Ne);
+  }
+  function A(g, b, u, y) {
+    let p = [], m = 0, c = -1;
+    for (; f.pos > b; ) {
+      let { id: d, start: _, end: x, size: L } = f;
+      if (L > 4)
+        f.next();
       else {
-        if (c > -1 && v < c)
+        if (c > -1 && _ < c)
           break;
-        c < 0 && (c = y - r), b.push(d, v, y), g++, h.next();
+        c < 0 && (c = x - r), p.push(d, _, x), m++, f.next();
       }
     }
-    if (g) {
-      let d = new Uint16Array(g * 4), v = b[b.length - 2];
-      for (let y = b.length - 3, I = 0; y >= 0; y -= 3)
-        d[I++] = b[y], d[I++] = b[y + 1] - v, d[I++] = b[y + 2] - v, d[I++] = I;
-      u.push(new G(d, b[2] - v, n)), k.push(v - m);
+    if (m) {
+      let d = new Uint16Array(m * 4), _ = p[p.length - 2];
+      for (let x = p.length - 3, L = 0; x >= 0; x -= 3)
+        d[L++] = p[x], d[L++] = p[x + 1] - _, d[L++] = p[x + 2] - _, d[L++] = L;
+      u.push(new q(d, p[2] - _, n)), y.push(_ - g);
     }
   }
-  function P(m) {
-    return (p, u, k) => {
-      let b = 0, g = p.length - 1, c, d;
-      if (g >= 0 && (c = p[g]) instanceof J) {
-        if (!g && c.type == m && c.length == k)
+  function z(g) {
+    return (b, u, y) => {
+      let p = 0, m = b.length - 1, c, d;
+      if (m >= 0 && (c = b[m]) instanceof R) {
+        if (!m && c.type == g && c.length == y)
           return c;
-        (d = c.prop(_.lookAhead)) && (b = u[g] + c.length + d);
+        (d = c.prop(v.lookAhead)) && (p = u[m] + c.length + d);
       }
-      return L(m, p, u, k, b);
+      return E(g, b, u, y, p);
     };
   }
-  function w(m, p, u, k, b, g, c, d) {
-    let v = [], y = [];
-    for (; m.length > k; )
-      v.push(m.pop()), y.push(p.pop() + u - b);
-    m.push(L(n.types[c], v, y, g - b, d - g)), p.push(b - u);
+  function I(g, b, u, y, p, m, c, d) {
+    let _ = [], x = [];
+    for (; g.length > y; )
+      _.push(g.pop()), x.push(b.pop() + u - p);
+    g.push(E(n.types[c], _, x, m - p, d - m)), b.push(p - u);
   }
-  function L(m, p, u, k, b = 0, g) {
-    if (x) {
-      let c = [_.contextHash, x];
-      g = g ? [c].concat(g) : [c];
+  function E(g, b, u, y, p = 0, m) {
+    if (C) {
+      let c = [v.contextHash, C];
+      m = m ? [c].concat(m) : [c];
     }
-    if (b > 25) {
-      let c = [_.lookAhead, b];
-      g = g ? [c].concat(g) : [c];
+    if (p > 25) {
+      let c = [v.lookAhead, p];
+      m = m ? [c].concat(m) : [c];
     }
-    return new J(m, p, u, k, g);
+    return new R(g, b, u, y, m);
   }
-  function re(m, p) {
-    let u = h.fork(), k = 0, b = 0, g = 0, c = u.end - r, d = { size: 0, start: 0, skip: 0 };
+  function V(g, b) {
+    let u = f.fork(), y = 0, p = 0, m = 0, c = u.end - r, d = { size: 0, start: 0, skip: 0 };
     e:
-      for (let v = u.pos - m; u.pos > v; ) {
-        let y = u.size;
-        if (u.id == p && y >= 0) {
-          d.size = k, d.start = b, d.skip = g, g += 4, k += 4, u.next();
+      for (let _ = u.pos - g; u.pos > _; ) {
+        let x = u.size;
+        if (u.id == b && x >= 0) {
+          d.size = y, d.start = p, d.skip = m, m += 4, y += 4, u.next();
           continue;
         }
-        let I = u.pos - y;
-        if (y < 0 || I < v || u.start < c)
+        let L = u.pos - x;
+        if (x < 0 || L < _ || u.start < c)
           break;
-        let q = u.id >= l ? 4 : 0, ee = u.start;
-        for (u.next(); u.pos > I; ) {
+        let X = u.id >= l ? 4 : 0, te = u.start;
+        for (u.next(); u.pos > L; ) {
           if (u.size < 0)
             if (u.size == -3)
-              q += 4;
+              X += 4;
             else
               break e;
           else
-            u.id >= l && (q += 4);
+            u.id >= l && (X += 4);
           u.next();
         }
-        b = ee, k += y, g += q;
+        p = te, y += x, m += X;
       }
-    return (p < 0 || k == m) && (d.size = k, d.start = b, d.skip = g), d.size > 4 ? d : void 0;
+    return (b < 0 || y == g) && (d.size = y, d.start = p, d.skip = m), d.size > 4 ? d : void 0;
   }
-  function Z(m, p, u) {
-    let { id: k, start: b, end: g, size: c } = h;
-    if (h.next(), c >= 0 && k < l) {
+  function $(g, b, u) {
+    let { id: y, start: p, end: m, size: c } = f;
+    if (f.next(), c >= 0 && y < l) {
       let d = u;
       if (c > 4) {
-        let v = h.pos - (c - 4);
-        for (; h.pos > v; )
-          u = Z(m, p, u);
+        let _ = f.pos - (c - 4);
+        for (; f.pos > _; )
+          u = $(g, b, u);
       }
-      p[--u] = d, p[--u] = g - m, p[--u] = b - m, p[--u] = k;
+      b[--u] = d, b[--u] = m - g, b[--u] = p - g, b[--u] = y;
     } else
-      c == -3 ? x = k : c == -4 && (C = k);
+      c == -3 ? C = y : c == -4 && (k = y);
     return u;
   }
-  let E = [], N = [];
-  for (; h.pos > 0; )
-    A(i.start || 0, i.bufferStart || 0, E, N, -1, 0);
-  let T = (e = i.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
-  return new J(f[i.topID], E.reverse(), N.reverse(), T);
+  let D = [], w = [];
+  for (; f.pos > 0; )
+    N(i.start || 0, i.bufferStart || 0, D, w, -1, 0);
+  let J = (e = i.length) !== null && e !== void 0 ? e : D.length ? w[0] + D[0].length : 0;
+  return new R(h[i.topID], D.reverse(), w.reverse(), J);
 }
 const ze = /* @__PURE__ */ new WeakMap();
-function fe(i, e) {
-  if (!i.isAnonymous || e instanceof G || e.type != i)
+function de(i, e) {
+  if (!i.isAnonymous || e instanceof q || e.type != i)
     return 1;
   let t = ze.get(e);
   if (t == null) {
     t = 1;
     for (let n of e.children) {
-      if (n.type != i || !(n instanceof J)) {
+      if (n.type != i || !(n instanceof R)) {
         t = 1;
         break;
       }
-      t += fe(i, n);
+      t += de(i, n);
     }
     ze.set(e, t);
   }
   return t;
 }
-function we(i, e, t, n, r, s, l, h, f) {
-  let x = 0;
-  for (let w = n; w < r; w++)
-    x += fe(i, e[w]);
-  let C = Math.ceil(
-    x * 1.5 / 8
+function we(i, e, t, n, r, s, l, f, h) {
+  let C = 0;
+  for (let I = n; I < r; I++)
+    C += de(i, e[I]);
+  let k = Math.ceil(
+    C * 1.5 / 8
     /* Balance.BranchFactor */
-  ), A = [], B = [];
-  function P(w, L, re, Z, E) {
-    for (let N = re; N < Z; ) {
-      let T = N, m = L[N], p = fe(i, w[N]);
-      for (N++; N < Z; N++) {
-        let u = fe(i, w[N]);
-        if (p + u >= C)
+  ), N = [], A = [];
+  function z(I, E, V, $, D) {
+    for (let w = V; w < $; ) {
+      let J = w, g = E[w], b = de(i, I[w]);
+      for (w++; w < $; w++) {
+        let u = de(i, I[w]);
+        if (b + u >= k)
           break;
-        p += u;
+        b += u;
       }
-      if (N == T + 1) {
-        if (p > C) {
-          let u = w[T];
-          P(u.children, u.positions, 0, u.children.length, L[T] + E);
+      if (w == J + 1) {
+        if (b > k) {
+          let u = I[J];
+          z(u.children, u.positions, 0, u.children.length, E[J] + D);
           continue;
         }
-        A.push(w[T]);
+        N.push(I[J]);
       } else {
-        let u = L[N - 1] + w[N - 1].length - m;
-        A.push(we(i, w, L, T, N, m, u, null, f));
+        let u = E[w - 1] + I[w - 1].length - g;
+        N.push(we(i, I, E, J, w, g, u, null, h));
       }
-      B.push(m + E - s);
+      A.push(g + D - s);
     }
   }
-  return P(e, t, n, r, 0), (h || f)(A, B, l);
+  return z(e, t, n, r, 0), (f || h)(N, A, l);
 }
-new _({ perNode: !0 });
-let pt = 0;
-class D {
+new v({ perNode: !0 });
+let mt = 0;
+class H {
   /**
   @internal
   */
   constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = pt++;
+    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
@@ -1257,7 +1259,7 @@ class D {
   static define(e) {
     if (e != null && e.base)
       throw new Error("Can not derive from a modified tag");
-    let t = new D([], null, []);
+    let t = new H([], null, []);
     if (t.set.push(t), e)
       for (let n of e.set)
         t.set.push(n);
@@ -1276,44 +1278,44 @@ class D {
   `m1(m3(t1)`, and so on.
   */
   static defineModifier() {
-    let e = new de();
-    return (t) => t.modified.indexOf(e) > -1 ? t : de.get(t.base || t, t.modified.concat(e).sort((n, r) => n.id - r.id));
+    let e = new me();
+    return (t) => t.modified.indexOf(e) > -1 ? t : me.get(t.base || t, t.modified.concat(e).sort((n, r) => n.id - r.id));
   }
 }
-let gt = 0;
-class de {
+let bt = 0;
+class me {
   constructor() {
-    this.instances = [], this.id = gt++;
+    this.instances = [], this.id = bt++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((h) => h.base == e && mt(t, h.modified));
+    let n = t[0].instances.find((f) => f.base == e && yt(t, f.modified));
     if (n)
       return n;
-    let r = [], s = new D(r, e, t);
-    for (let h of t)
-      h.instances.push(s);
-    let l = bt(t);
-    for (let h of e.set)
-      if (!h.modified.length)
-        for (let f of l)
-          r.push(de.get(h, f));
+    let r = [], s = new H(r, e, t);
+    for (let f of t)
+      f.instances.push(s);
+    let l = xt(t);
+    for (let f of e.set)
+      if (!f.modified.length)
+        for (let h of l)
+          r.push(me.get(f, h));
     return s;
   }
 }
-function mt(i, e) {
+function yt(i, e) {
   return i.length == e.length && i.every((t, n) => t == e[n]);
 }
-function bt(i) {
+function xt(i) {
   let e = [[]];
   for (let t = 0; t < i.length; t++)
     for (let n = 0, r = e.length; n < r; n++)
       e.push(e[n].concat(i[t]));
   return e.sort((t, n) => n.length - t.length);
 }
-new _();
-function yt(i, e) {
+new v();
+function _t(i, e) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let s of i)
     if (!Array.isArray(s.tag))
@@ -1325,11 +1327,11 @@ function yt(i, e) {
   return {
     style: (s) => {
       let l = r;
-      for (let h of s)
-        for (let f of h.set) {
-          let x = t[f.id];
-          if (x) {
-            l = l ? l + " " + x : x;
+      for (let f of s)
+        for (let h of f.set) {
+          let C = t[h.id];
+          if (C) {
+            l = l ? l + " " + C : C;
             break;
           }
         }
@@ -1338,31 +1340,31 @@ function yt(i, e) {
     scope: n
   };
 }
-const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K), be = a(K), H = a(), Y = a(H), M = a(), R = a(), ke = a(), ie = a(ke), ue = a(), o = {
+const a = H.define, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K), ye = a(K), j = a(), Y = a(j), P = a(), T = a(), ve = a(), ie = a(ve), ce = a(), o = {
   /**
   A comment.
   */
-  comment: ae,
+  comment: ue,
   /**
   A line [comment](#highlight.tags.comment).
   */
-  lineComment: a(ae),
+  lineComment: a(ue),
   /**
   A block [comment](#highlight.tags.comment).
   */
-  blockComment: a(ae),
+  blockComment: a(ue),
   /**
   A documentation [comment](#highlight.tags.comment).
   */
-  docComment: a(ae),
+  docComment: a(ue),
   /**
   Any kind of identifier.
   */
-  name: W,
+  name: G,
   /**
   The [name](#highlight.tags.name) of a variable.
   */
-  variableName: a(W),
+  variableName: a(G),
   /**
   A type [name](#highlight.tags.name).
   */
@@ -1374,27 +1376,27 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   A property or field [name](#highlight.tags.name).
   */
-  propertyName: Pe,
+  propertyName: Me,
   /**
   An attribute name (subtag of [`propertyName`](#highlight.tags.propertyName)).
   */
-  attributeName: a(Pe),
+  attributeName: a(Me),
   /**
   The [name](#highlight.tags.name) of a class.
   */
-  className: a(W),
+  className: a(G),
   /**
   A label [name](#highlight.tags.name).
   */
-  labelName: a(W),
+  labelName: a(G),
   /**
   A namespace [name](#highlight.tags.name).
   */
-  namespace: a(W),
+  namespace: a(G),
   /**
   The [name](#highlight.tags.name) of a macro.
   */
-  macroName: a(W),
+  macroName: a(G),
   /**
   A literal value.
   */
@@ -1418,15 +1420,15 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   A number [literal](#highlight.tags.literal).
   */
-  number: be,
+  number: ye,
   /**
   An integer [number](#highlight.tags.number) literal.
   */
-  integer: a(be),
+  integer: a(ye),
   /**
   A floating-point [number](#highlight.tags.number) literal.
   */
-  float: a(be),
+  float: a(ye),
   /**
   A boolean [literal](#highlight.tags.literal).
   */
@@ -1451,94 +1453,94 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   A language keyword.
   */
-  keyword: M,
+  keyword: P,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(M),
+  self: a(P),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(M),
+  null: a(P),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(M),
+  atom: a(P),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(M),
+  unit: a(P),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(M),
+  modifier: a(P),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(M),
+  operatorKeyword: a(P),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(M),
+  controlKeyword: a(P),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(M),
+  definitionKeyword: a(P),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(M),
+  moduleKeyword: a(P),
   /**
   An operator.
   */
-  operator: R,
+  operator: T,
   /**
   An [operator](#highlight.tags.operator) that dereferences something.
   */
-  derefOperator: a(R),
+  derefOperator: a(T),
   /**
   Arithmetic-related [operator](#highlight.tags.operator).
   */
-  arithmeticOperator: a(R),
+  arithmeticOperator: a(T),
   /**
   Logical [operator](#highlight.tags.operator).
   */
-  logicOperator: a(R),
+  logicOperator: a(T),
   /**
   Bit [operator](#highlight.tags.operator).
   */
-  bitwiseOperator: a(R),
+  bitwiseOperator: a(T),
   /**
   Comparison [operator](#highlight.tags.operator).
   */
-  compareOperator: a(R),
+  compareOperator: a(T),
   /**
   [Operator](#highlight.tags.operator) that updates its operand.
   */
-  updateOperator: a(R),
+  updateOperator: a(T),
   /**
   [Operator](#highlight.tags.operator) that defines something.
   */
-  definitionOperator: a(R),
+  definitionOperator: a(T),
   /**
   Type-related [operator](#highlight.tags.operator).
   */
-  typeOperator: a(R),
+  typeOperator: a(T),
   /**
   Control-flow [operator](#highlight.tags.operator).
   */
-  controlOperator: a(R),
+  controlOperator: a(T),
   /**
   Program or markup punctuation.
   */
-  punctuation: ke,
+  punctuation: ve,
   /**
   [Punctuation](#highlight.tags.punctuation) that separates
   things.
   */
-  separator: a(ke),
+  separator: a(ve),
   /**
   Bracket-style [punctuation](#highlight.tags.punctuation).
   */
@@ -1566,7 +1568,7 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   Content, for example plain text in XML or markup documents.
   */
-  content: H,
+  content: j,
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
@@ -1598,37 +1600,37 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   A prose separator (such as a horizontal rule).
   */
-  contentSeparator: a(H),
+  contentSeparator: a(j),
   /**
   [Content](#highlight.tags.content) that represents a list.
   */
-  list: a(H),
+  list: a(j),
   /**
   [Content](#highlight.tags.content) that represents a quote.
   */
-  quote: a(H),
+  quote: a(j),
   /**
   [Content](#highlight.tags.content) that is emphasized.
   */
-  emphasis: a(H),
+  emphasis: a(j),
   /**
   [Content](#highlight.tags.content) that is styled strong.
   */
-  strong: a(H),
+  strong: a(j),
   /**
   [Content](#highlight.tags.content) that is part of a link.
   */
-  link: a(H),
+  link: a(j),
   /**
   [Content](#highlight.tags.content) that is styled as code or
   monospace.
   */
-  monospace: a(H),
+  monospace: a(j),
   /**
   [Content](#highlight.tags.content) that has a strike-through
   style.
   */
-  strikethrough: a(H),
+  strikethrough: a(j),
   /**
   Inserted text in a change-tracking format.
   */
@@ -1648,52 +1650,52 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   Metadata or meta-instruction.
   */
-  meta: ue,
+  meta: ce,
   /**
   [Metadata](#highlight.tags.meta) that applies to the entire
   document.
   */
-  documentMeta: a(ue),
+  documentMeta: a(ce),
   /**
   [Metadata](#highlight.tags.meta) that annotates or adds
   attributes to a given syntactic element.
   */
-  annotation: a(ue),
+  annotation: a(ce),
   /**
   Processing instruction or preprocessor directive. Subtag of
   [meta](#highlight.tags.meta).
   */
-  processingInstruction: a(ue),
+  processingInstruction: a(ce),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that a
   given element is being defined. Expected to be used with the
   various [name](#highlight.tags.name) tags.
   */
-  definition: D.defineModifier(),
+  definition: H.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that
   something is constant. Mostly expected to be used with
   [variable names](#highlight.tags.variableName).
   */
-  constant: D.defineModifier(),
+  constant: H.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: D.defineModifier(),
+  function: H.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: D.defineModifier(),
+  standard: H.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates a given
   [names](#highlight.tags.name) is local to some scope.
   */
-  local: D.defineModifier(),
+  local: H.defineModifier(),
   /**
   A generic variant [modifier](#highlight.Tag^defineModifier) that
   can be used to tag language-specific alternative variants of
@@ -1702,9 +1704,9 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   [variable name](#highlight.tags.variableName) tags, since those
   come up a lot.
   */
-  special: D.defineModifier()
+  special: H.defineModifier()
 };
-yt([
+_t([
   { tag: o.link, class: "tok-link" },
   { tag: o.heading, class: "tok-heading" },
   { tag: o.emphasis, class: "tok-emphasis" },
@@ -1736,13 +1738,13 @@ yt([
   { tag: o.invalid, class: "tok-invalid" },
   { tag: o.punctuation, class: "tok-punctuation" }
 ]);
-const xt = "#c72727", kt = "#9b5700", vt = "#067934", _t = "#0063d7", Ct = {
-  red: xt,
-  orange: kt,
-  green: vt,
-  blue: _t,
+const vt = "#c72727", Ct = "#9b5700", kt = "#067934", wt = "#0063d7", Nt = {
+  red: vt,
+  orange: Ct,
+  green: kt,
+  blue: wt,
   invalid: "#ffffff"
-}, wt = (i) => Ge.define([
+}, St = (i) => Xe.define([
   {
     tag: o.keyword,
     color: i.red
@@ -1809,45 +1811,69 @@ const xt = "#c72727", kt = "#9b5700", vt = "#067934", _t = "#0063d7", Ct = {
     tag: o.invalid,
     color: i.invalid
   }
-]), Nt = Fe(wt(Ct));
-var ne = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(ne || {}), Q = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(Q || {}), ve = /* @__PURE__ */ ((i) => (i.ACTION = "action", i))(ve || {});
-const St = {
-  [Q.JSON]: qe,
-  [Q.XML]: Xe,
-  [Q.JAVASCRIPT]: $e,
-  [Q.JAVA]: Ye
-}, At = (i) => ({
-  loadLang: async () => St[i]
-}), It = {
+]), At = qe(St(Nt));
+var pe = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(pe || {}), ee = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(ee || {}), se = /* @__PURE__ */ ((i) => (i.ACTION = "action", i.CHANGE = "change", i))(se || {});
+const It = {
+  [ee.JSON]: Ze,
+  [ee.XML]: Qe,
+  [ee.JAVASCRIPT]: Ye,
+  [ee.JAVA]: et
+}, Lt = (i) => ({
+  loadLang: async () => It[i]
+});
+let Pe = 0;
+const Bt = {
+  beforeCreate() {
+    this.uuid = Pe.toString(), Pe += 1;
+  }
+};
+var Ot = function() {
+  var e = this, t = e._self._c;
+  return t("svg", e._b({ attrs: { role: "img", xmlns: "http://www.w3.org/2000/svg", width: "16", height: "16", fill: "none" } }, "svg", e.$attrs, !1), [e.$attrs["svg-title"] ? t("title", [e._v(e._s(e.$attrs["svg-title"]))]) : e._e(), t("path", { attrs: { 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" } }), t("path", { attrs: { 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" } })]);
+}, zt = [], Et = /* @__PURE__ */ Te(
+  Bt,
+  Ot,
+  zt,
+  !1,
+  null,
+  "012ee7f3",
+  null,
+  null
+);
+const Mt = Et.exports, Pt = {
   "en-US": {
-    run: "Run"
+    run: "Run",
+    expand: "Expand"
   }
-}, Bt = Re({
-  i18n: { messages: It },
+}, Tt = Ve({
+  i18n: { messages: Pt },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: tt,
-    BentoButton: Ze,
-    BentoDropdown: Qe,
-    Copy: it
+    BentoTypography: it,
+    BentoButton: rt,
+    BentoDropdown: tt,
+    Copy: ot,
+    BaseModal: nt,
+    BentoLoadingIndicator: st,
+    ExpandIcon: Mt
   },
-  directives: { BentoTooltipDirective: st },
+  directives: { BentoTooltipDirective: at },
   props: {
     /**
      * Defines the variant of code-snippet
      */
     variant: {
       type: String,
-      default: ne.MULTILINE,
-      validator: (i) => Object.values(ne).includes(i)
+      default: pe.MULTILINE,
+      validator: (i) => Object.values(pe).includes(i)
     },
     /**
      * Language name for syntax highlighting rules
      */
     lang: {
       type: String,
-      default: Q.JSON,
-      validator: (i) => Object.values(Q).includes(i)
+      default: ee.JSON,
+      validator: (i) => Object.values(ee).includes(i)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1878,6 +1904,14 @@ const St = {
       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,97 +1919,119 @@ const St = {
     actionableText: {
       type: String,
       default: "run"
+    },
+    /**
+     * Toggles the loading indicator within the action bar
+     */
+    loading: {
+      type: Boolean,
+      default: !1
     }
   },
-  emits: [ve.ACTION],
+  emits: [se.ACTION, se.CHANGE],
   setup(i, { emit: e }) {
-    const { t } = rt(), n = pe(null), r = [], s = () => {
-    }, l = ge(() => i.langLabel ?? i.lang.toUpperCase()), h = ge(() => ({
-      "b-code-snippet--inline": i.variant === ne.INLINE,
-      "b-code-snippet--scrollable": i.variant !== ne.INLINE
-    })), { loadLang: f } = At(i.lang), x = Ae(), C = Ae(), A = new me(), B = new me(), P = new me(), w = pe(""), L = pe(0);
-    He(async () => {
-      const E = await f();
-      w.value = i.content;
-      const N = ({ state: p }) => {
-        w.value = p.doc.toString();
-      }, T = [
-        Je(),
-        Ue.of([We]),
-        A.of(E()),
-        B.of(Nt),
-        P.of(Be.readOnly.of(!i.editable)),
-        Ie.updateListener.of((p) => N(p))
+    const { t } = lt(), n = ae(null), r = [], s = () => {
+    }, l = re(() => i.langLabel ?? i.lang.toUpperCase()), f = re(() => i.variant === pe.INLINE), h = re(() => ({
+      "b-code-snippet--inline": f.value,
+      "b-code-snippet--scrollable": !f.value
+    })), C = re(() => ({
+      "b-code-snippet__code-area-content--editable": i.editable
+    })), { loadLang: k } = Lt(i.lang), N = Ae(), A = Ae(), z = new be(), I = new be(), E = new be(), V = ae(""), $ = ae(0);
+    $e(async () => {
+      const g = await k();
+      V.value = i.content;
+      const b = ({ state: p }) => {
+        V.value = p.doc.toString();
+      }, u = [
+        Ue(),
+        We.of([Ke]),
+        z.of(g()),
+        I.of(At),
+        E.of(Le.readOnly.of(!i.editable)),
+        Ie.updateListener.of((p) => b(p))
       ];
-      i.variant === "multiline" && T.push([Ve(), Ke()]);
-      const m = Be.create({
+      i.variant === "multiline" && u.push([Ge(), Fe()]);
+      const y = Le.create({
         doc: i.content,
-        extensions: [...T]
+        extensions: [...u]
       });
-      L.value = m.doc.length, C.value = new Ie({
-        state: m,
-        parent: x.value
+      $.value = y.doc.length, A.value = new Ie({
+        state: y,
+        parent: N.value
       });
     }), De(
       () => i.content,
       () => {
-        const E = i.content.length;
-        C.value.dispatch({
+        const g = i.content.length;
+        A.value.dispatch({
           changes: {
             from: 0,
-            to: L.value,
+            to: $.value,
             insert: i.content
           }
-        }), L.value = E;
+        }), $.value = g;
       }
     );
-    const re = ge(() => t(i.actionableText));
+    const D = re(() => t(i.actionableText)), w = () => {
+      e(se.ACTION, V.value);
+    };
+    Je(() => {
+      e(se.CHANGE, V.value);
+    });
+    const J = ae(!1);
     return {
-      // Enums
-      BentoTypographyElement: nt,
-      BentoButtonVariant: et,
-      BentoCodeSnippetVariant: ne,
       // Values
-      container: x,
-      editor: C,
-      currentContents: w,
-      conditionalClasses: h,
       availableLanguages: r,
+      codeAreaContentConditionalClasses: C,
+      conditionalClasses: h,
+      container: N,
+      currentContents: V,
       displayedLang: l,
+      editor: A,
       selectedLanguage: n,
+      showModal: J,
+      isInlineVariant: f,
       // Methods
       handleChangeLanguage: s,
-      runText: re,
-      onActionClicked: () => {
-        e(ve.ACTION, w);
-      }
+      onActionClicked: w,
+      runText: D,
+      // Translations
+      t
     };
   }
 });
-var Lt = function() {
+var jt = function() {
   var e = this, t = e._self._c;
-  return e._self._setupProxy, t("div", { staticClass: "b-code-snippet", class: e.conditionalClasses }, [e.variant !== e.BentoCodeSnippetVariant.INLINE ? t("section", { staticClass: "b-code-snippet__action-bar" }, [t("div", { staticClass: "b-code-snippet__action-bar--start" }, [e.availableLanguages.length > 0 ? t("bento-dropdown", e._b({ staticClass: "b-code-snippet__language-picker", attrs: { disabled: e.availableLanguages.length === 1, items: e.availableLanguages }, on: { input: e.handleChangeLanguage }, model: { value: e.selectedLanguage, callback: function(n) {
+  return e._self._setupProxy, t("div", { staticClass: "b-code-snippet", class: e.conditionalClasses }, [e.isInlineVariant ? e._e() : t("section", { staticClass: "b-code-snippet__action-bar" }, [t("div", { staticClass: "b-code-snippet__action-bar--start" }, [e.availableLanguages.length > 0 ? t("bento-dropdown", e._b({ staticClass: "b-code-snippet__language-picker", attrs: { disabled: e.availableLanguages.length === 1, items: e.availableLanguages }, on: { input: e.handleChangeLanguage }, model: { value: e.selectedLanguage, callback: function(n) {
     e.selectedLanguage = n;
-  }, expression: "selectedLanguage" } }, "bento-dropdown", e.$props, !1)) : e._e(), t("bento-typography", { attrs: { el: e.BentoTypographyElement.SPAN, stronger: "" } }, [e._v(" " + e._s(e.displayedLang) + " ")])], 1), t("div", { staticClass: "b-code-snippet__action-bar--end" }, [t("copy", { staticClass: "b-structured-list__icon", attrs: { text: e.currentContents } }), e.actionable ? t("bento-button", { attrs: { variant: e.BentoButtonVariant.PRIMARY, tertiary: "", condensed: "" }, on: { click: e.onActionClicked }, scopedSlots: e._u([{ key: "iconLeft", fn: function() {
-    return [t("bento-typography", { staticClass: "b-code-snippet__action-button", attrs: { el: e.BentoTypographyElement.SPAN } }, [e._v(" " + e._s(e.runText) + " ")])];
-  }, proxy: !0 }], null, !1, 1705937272) }) : e._e()], 1)]) : e._e(), e.content ? t("code", { staticClass: "b-code-snippet__code-area" }, [t("div", { ref: "container", staticClass: "b-code-snippet__code-area-content" })]) : t("section", [e._t("empty-state", function() {
+  }, expression: "selectedLanguage" } }, "bento-dropdown", e.$props, !1)) : e._e(), t("bento-typography", { attrs: { el: "span", stronger: "" } }, [e._v(" " + e._s(e.displayedLang) + " ")])], 1), t("div", { staticClass: "b-code-snippet__action-bar--end" }, [e.loading ? t("bento-loading-indicator") : e._e(), t("copy", { staticClass: "b-structured-list__icon", attrs: { text: e.currentContents } }), e.expandable ? t("bento-button", { attrs: { variant: "tertiary", condensed: "", "aria-label": e.t("expand") }, on: { click: function(n) {
+    e.showModal = !0;
+  } }, scopedSlots: e._u([{ key: "iconLeft", fn: function() {
+    return [t("expand-icon")];
+  }, proxy: !0 }], null, !1, 3789760120) }) : e._e(), e.actionable ? t("bento-button", { attrs: { variant: "primary", tertiary: "", condensed: "" }, on: { click: e.onActionClicked }, scopedSlots: e._u([{ key: "iconLeft", fn: function() {
+    return [t("bento-typography", { staticClass: "b-code-snippet__action-button", attrs: { el: "span" } }, [e._v(" " + e._s(e.runText) + " ")])];
+  }, proxy: !0 }], null, !1, 4293069853) }) : e._e()], 1)]), e.content ? t("code", { staticClass: "b-code-snippet__code-area" }, [t("div", { ref: "container", staticClass: "b-code-snippet__code-area-content", class: e.codeAreaContentConditionalClasses })]) : t("section", [e._t("empty-state", function() {
     return [t("div", { staticClass: "b-code-snippet__empty-state" }, [e._v("Nothing to show")])];
-  })], 2)]);
-}, Ot = [], zt = /* @__PURE__ */ lt(
-  Bt,
-  Lt,
-  Ot,
+  })], 2), e.expandable ? t("base-modal", { staticClass: "b-code-snippet__modal", attrs: { "hide-close-button": !0, "custom-padding": "0px", "is-dismissible": !0, "is-open": e.showModal, size: "large" }, on: { "close-modal": function(n) {
+    e.showModal = !1;
+  } }, scopedSlots: e._u([{ key: "content", fn: function() {
+    return [t("bento-code-snippet", e._b({}, "bento-code-snippet", { ...e.$props, expandable: !1 }, !1))];
+  }, proxy: !0 }], null, !1, 3343589027) }) : e._e()], 1);
+}, Ht = [], Rt = /* @__PURE__ */ Te(
+  Tt,
+  jt,
+  Ht,
   !1,
   null,
-  "5b8e340a",
+  "837f5e08",
   null,
   null
 );
-const Xt = zt.exports;
+const sn = Rt.exports;
 export {
-  Xt as BentoCodeSnippet,
-  ve as BentoCodeSnippetEvent,
-  Q as BentoCodeSnippetSupportedLanguage,
-  ne as BentoCodeSnippetVariant
+  sn as BentoCodeSnippet,
+  se as BentoCodeSnippetEvent,
+  ee as BentoCodeSnippetSupportedLanguage,
+  pe as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map