@adyen/bento-vue3 1.4.1 → 1.5.0

package/dist/code-snippet.js

@@ -1,5 +1,5 @@
-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 { openBlock as z, createElementBlock as le, mergeProps as qe, toDisplayString as Ae, createCommentVNode as q, pushScopeId as Fe, popScopeId as Xe, createElementVNode as ae, defineComponent as nt, ref as ge, computed as ue, shallowRef as $e, onMounted as rt, watch as it, watchEffect as st, resolveComponent as K, normalizeClass as Te, createBlock as oe, createVNode as me, withCtx as fe, createTextVNode as je, renderSlot as ot, normalizeProps as lt, guardReactiveProps as at } from "vue";
+import { highlightActiveLine as ut, keymap as ft, EditorView as He, lineNumbers as ht } from "@codemirror/view";
 import { Compartment as Ne, EditorState as Ve } from "@codemirror/state";
 import { indentWithTab as dt, history as ct } from "@codemirror/commands";
 import { syntaxHighlighting as pt, HighlightStyle as gt } from "@codemirror/language";
@@ -7,19 +7,19 @@ 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.ff4f94a8.js";
-import { f as Ct } from "./chunks/base-modal.db7a9829.js";
-import { a as _t } from "./chunks/button.7d09c245.js";
-import { B as vt } from "./chunks/index.77c651df.js";
-import { b as wt } from "./chunks/tooltip.973c86d3.js";
+import { B as kt } from "./chunks/dropdown.22e51667.js";
+import { f as Ct } from "./chunks/base-modal.be77971f.js";
+import { a as vt } from "./chunks/button.7072457f.js";
+import { B as _t } from "./chunks/index.32ed68b7.js";
+import { b as wt } from "./chunks/tooltip.c8350cd0.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.c9a29be0.js";
-import "./assets/index.css";
+import { C as At } from "./chunks/copy.527c3d76.js";
+import "./assets/index17.css";
 const It = 1024;
 let Bt = 0;
-class _ {
+class v {
   /**
   Create a new node prop type.
   */
@@ -41,31 +41,31 @@ class _ {
     if (this.perNode)
       throw new RangeError("Can't add per-node props to node types");
     return typeof e != "function" && (e = G.match(e)), (t) => {
-      let n = e(t);
-      return n === void 0 ? null : [this, n];
+      let r = e(t);
+      return r === void 0 ? null : [this, 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";
+v.closedBy = new v({ deserialize: (n) => n.split(" ") });
+v.openedBy = new v({ deserialize: (n) => n.split(" ") });
+v.group = new v({ deserialize: (n) => n.split(" ") });
+v.isolate = new v({ deserialize: (n) => {
+  if (n && n != "rtl" && n != "ltr" && n != "auto")
+    throw new RangeError("Invalid value for isolate: " + n);
+  return n || "auto";
 } });
-_.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;
+v.contextHash = new v({ perNode: !0 });
+v.lookAhead = new v({ perNode: !0 });
+v.mounted = new v({ perNode: !0 });
+class _e {
+  constructor(e, t, r) {
+    this.tree = e, this.overlay = t, this.parser = r;
   }
   /**
   @internal
   */
   static get(e) {
-    return e && e.props && e.props[_.mounted.id];
+    return e && e.props && e.props[v.mounted.id];
   }
 }
 const Lt = /* @__PURE__ */ Object.create(null);
@@ -73,14 +73,14 @@ class G {
   /**
   @internal
   */
-  constructor(e, t, n, i = 0) {
-    this.name = e, this.props = t, this.id = n, this.flags = i;
+  constructor(e, t, r, i = 0) {
+    this.name = e, this.props = t, this.id = r, this.flags = i;
   }
   /**
   Define a node type.
   */
   static define(e) {
-    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);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Lt, r = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), i = new G(e.name || "", t, e.id, r);
     if (e.props) {
       for (let s of e.props)
         if (Array.isArray(s) || (s = s(i)), s) {
@@ -131,7 +131,7 @@ class G {
     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;
@@ -146,12 +146,12 @@ class G {
   */
   static match(e) {
     let t = /* @__PURE__ */ Object.create(null);
-    for (let n in e)
-      for (let i of n.split(" "))
-        t[i] = e[n];
-    return (n) => {
-      for (let i = n.prop(_.group), s = -1; s < (i ? i.length : 0); s++) {
-        let o = t[s < 0 ? n.name : i[s]];
+    for (let r in e)
+      for (let i of r.split(" "))
+        t[i] = e[r];
+    return (r) => {
+      for (let i = r.prop(v.group), s = -1; s < (i ? i.length : 0); s++) {
+        let o = t[s < 0 ? r.name : i[s]];
         if (o)
           return o;
       }
@@ -167,15 +167,15 @@ G.none = new G(
 );
 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";
+(function(n) {
+  n[n.ExcludeBuffers = 1] = "ExcludeBuffers", n[n.IncludeAnonymous = 2] = "IncludeAnonymous", n[n.IgnoreMounts = 4] = "IgnoreMounts", n[n.IgnoreOverlays = 8] = "IgnoreOverlays";
 })(I || (I = {}));
-class V {
+class R {
   /**
   Construct a new tree. See also [`Tree.build`](#common.Tree^build).
   */
-  constructor(e, t, n, i, s) {
-    if (this.type = e, this.children = t, this.positions = n, this.length = i, this.props = null, s && s.length) {
+  constructor(e, t, r, i, s) {
+    if (this.type = e, this.children = t, this.positions = r, this.length = i, this.props = null, s && s.length) {
       this.props = /* @__PURE__ */ Object.create(null);
       for (let [o, u] of s)
         this.props[typeof o == "number" ? o : o.id] = u;
@@ -185,12 +185,12 @@ class V {
   @internal
   */
   toString() {
-    let e = ve.get(this);
+    let e = _e.get(this);
     if (e && !e.overlay)
       return e.tree.toString();
     let t = "";
-    for (let n of this.children) {
-      let i = n.toString();
+    for (let r of this.children) {
+      let i = r.toString();
       i && (t && (t += ","), t += i);
     }
     return this.type.name ? (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (t.length ? "(" + t + ")" : "") : t;
@@ -208,7 +208,7 @@ class V {
   at the given position and side (see
   [`moveTo`](#common.TreeCursor.moveTo).
   */
-  cursorAt(e, t = 0, n = 0) {
+  cursorAt(e, t = 0, r = 0) {
     let i = be.get(this) || this.topNode, s = new Be(i);
     return s.moveTo(e, t), be.set(this, s._tree), s;
   }
@@ -217,7 +217,7 @@ class V {
   tree.
   */
   get topNode() {
-    return new z(this, 0, 0, null);
+    return new E(this, 0, 0, null);
   }
   /**
   Get the [syntax node](#common.SyntaxNode) at the given position.
@@ -231,8 +231,8 @@ class V {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let n = pe(be.get(this) || this.topNode, e, t, !1);
-    return be.set(this, n), n;
+    let r = ce(be.get(this) || this.topNode, e, t, !1);
+    return be.set(this, r), r;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -242,8 +242,8 @@ class V {
   the host trees).
   */
   resolveInner(e, t = 0) {
-    let n = pe(Re.get(this) || this.topNode, e, t, !0);
-    return Re.set(this, n), n;
+    let r = ce(Re.get(this) || this.topNode, e, t, !0);
+    return Re.set(this, r), r;
   }
   /**
   In some situations, it can be useful to iterate through all
@@ -263,16 +263,16 @@ class V {
   not have its children iterated over (or `leave` called).
   */
   iterate(e) {
-    let { enter: t, leave: n, from: i = 0, to: s = this.length } = e, o = e.mode || 0, u = (o & I.IncludeAnonymous) > 0;
-    for (let f = this.cursor(o | I.IncludeAnonymous); ; ) {
+    let { enter: t, leave: r, from: i = 0, to: s = this.length } = e, o = e.mode || 0, u = (o & I.IncludeAnonymous) > 0;
+    for (let h = this.cursor(o | I.IncludeAnonymous); ; ) {
       let x = !1;
-      if (f.from <= s && f.to >= i && (!u && f.type.isAnonymous || t(f) !== !1)) {
-        if (f.firstChild())
+      if (h.from <= s && h.to >= i && (!u && h.type.isAnonymous || t(h) !== !1)) {
+        if (h.firstChild())
           continue;
         x = !0;
       }
-      for (; x && n && (u || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
-        if (!f.parent())
+      for (; x && r && (u || !h.type.isAnonymous) && r(h), !h.nextSibling(); ) {
+        if (!h.parent())
           return;
         x = !0;
       }
@@ -303,7 +303,7 @@ class V {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : Ee(G.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, i) => new V(this.type, t, n, i, this.propValues), e.makeTree || ((t, n, i) => new V(G.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, r, i) => new R(this.type, t, r, i, this.propValues), e.makeTree || ((t, r, i) => new R(G.none, t, r, i)));
   }
   /**
   Build a tree from a postfix-ordered buffer of node information,
@@ -313,7 +313,7 @@ class V {
     return Mt(e);
   }
 }
-V.empty = new V(G.none, [], [], 0);
+R.empty = new R(G.none, [], [], 0);
 class Oe {
   constructor(e, t) {
     this.buffer = e, this.index = t;
@@ -340,12 +340,12 @@ class Oe {
     return new Oe(this.buffer, this.index);
   }
 }
-class Z {
+class Q {
   /**
   Create a tree buffer.
   */
-  constructor(e, t, n) {
-    this.buffer = e, this.length = t, this.set = n;
+  constructor(e, t, r) {
+    this.buffer = e, this.length = t, this.set = r;
   }
   /**
   @internal
@@ -366,99 +366,99 @@ class Z {
   @internal
   */
   childString(e) {
-    let t = this.buffer[e], n = this.buffer[e + 3], i = this.set.types[t], s = i.name;
-    if (/\W/.test(s) && !i.isError && (s = JSON.stringify(s)), e += 4, n == e)
+    let t = this.buffer[e], r = this.buffer[e + 3], i = this.set.types[t], s = i.name;
+    if (/\W/.test(s) && !i.isError && (s = JSON.stringify(s)), e += 4, r == e)
       return s;
     let o = [];
-    for (; e < n; )
+    for (; e < r; )
       o.push(this.childString(e)), e = this.buffer[e + 3];
     return s + "(" + o.join(",") + ")";
   }
   /**
   @internal
   */
-  findChild(e, t, n, i, s) {
+  findChild(e, t, r, i, s) {
     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])
+    for (let h = e; h != t && !(Qe(s, i, o[h + 1], o[h + 2]) && (u = h, r > 0)); h = o[h + 3])
       ;
     return u;
   }
   /**
   @internal
   */
-  slice(e, t, n) {
+  slice(e, t, r) {
     let i = this.buffer, s = new Uint16Array(t - e), o = 0;
-    for (let u = e, f = 0; u < t; ) {
-      s[f++] = i[u++], s[f++] = i[u++] - n;
-      let x = s[f++] = i[u++] - n;
-      s[f++] = i[u++] - e, o = Math.max(o, x);
+    for (let u = e, h = 0; u < t; ) {
+      s[h++] = i[u++], s[h++] = i[u++] - r;
+      let x = s[h++] = i[u++] - r;
+      s[h++] = i[u++] - e, o = Math.max(o, x);
     }
-    return new Z(s, o, this.set);
+    return new Q(s, o, this.set);
   }
 }
-function Qe(r, e, t, n) {
-  switch (r) {
+function Qe(n, e, t, r) {
+  switch (n) {
     case -2:
       return t < e;
     case -1:
-      return n >= e && t < e;
+      return r >= e && t < e;
     case 0:
-      return t < e && n > e;
+      return t < e && r > e;
     case 1:
-      return t <= e && n > e;
+      return t <= e && r > e;
     case 2:
-      return n > e;
+      return r > e;
     case 4:
       return !0;
   }
 }
-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;
+function ce(n, e, t, r) {
+  for (var i; n.from == n.to || (t < 1 ? n.from >= e : n.from > e) || (t > -1 ? n.to <= e : n.to < e); ) {
+    let o = !r && n instanceof E && n.index < 0 ? null : n.parent;
     if (!o)
-      return r;
-    r = o;
+      return n;
+    n = o;
   }
-  let s = n ? 0 : I.IgnoreOverlays;
-  if (n)
-    for (let o = r, u = o.parent; u; o = u, u = o.parent)
-      o instanceof z && o.index < 0 && ((i = u.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (r = u);
+  let s = r ? 0 : I.IgnoreOverlays;
+  if (r)
+    for (let o = n, u = o.parent; u; o = u, u = o.parent)
+      o instanceof E && o.index < 0 && ((i = u.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (n = u);
   for (; ; ) {
-    let o = r.enter(e, t, s);
+    let o = n.enter(e, t, s);
     if (!o)
-      return r;
-    r = o;
+      return n;
+    n = o;
   }
 }
 class Ye {
   cursor(e = 0) {
     return new Be(this, e);
   }
-  getChild(e, t = null, n = null) {
-    let i = De(this, e, t, n);
+  getChild(e, t = null, r = null) {
+    let i = De(this, e, t, r);
     return i.length ? i[0] : null;
   }
-  getChildren(e, t = null, n = null) {
-    return De(this, e, t, n);
+  getChildren(e, t = null, r = null) {
+    return De(this, e, t, r);
   }
   resolve(e, t = 0) {
-    return pe(this, e, t, !1);
+    return ce(this, e, t, !1);
   }
   resolveInner(e, t = 0) {
-    return pe(this, e, t, !0);
+    return ce(this, e, t, !0);
   }
   matchContext(e) {
     return Ie(this, e);
   }
   enterUnfinishedNodesBefore(e) {
-    let t = this.childBefore(e), n = this;
+    let t = this.childBefore(e), r = this;
     for (; t; ) {
       let i = t.lastChild;
       if (!i || i.to != t.to)
         break;
-      i.type.isError && i.from == i.to ? (n = t, t = i.prevSibling) : t = i;
+      i.type.isError && i.from == i.to ? (r = t, t = i.prevSibling) : t = i;
     }
-    return n;
+    return r;
   }
   get node() {
     return this;
@@ -467,9 +467,9 @@ class Ye {
     return this.parent;
   }
 }
-class z extends Ye {
-  constructor(e, t, n, i) {
-    super(), this._tree = e, this.from = t, this.index = n, this._parent = i;
+class E extends Ye {
+  constructor(e, t, r, i) {
+    super(), this._tree = e, this.from = t, this.index = r, this._parent = i;
   }
   get type() {
     return this._tree.type;
@@ -480,23 +480,23 @@ class z extends Ye {
   get to() {
     return this.from + this._tree.length;
   }
-  nextChild(e, t, n, i, s = 0) {
+  nextChild(e, t, r, i, s = 0) {
     for (let o = this; ; ) {
-      for (let { children: u, positions: f } = o._tree, x = t > 0 ? u.length : -1; e != x; e += t) {
-        let v = u[e], w = f[e] + o.from;
-        if (Qe(i, n, w, w + v.length)) {
-          if (v instanceof Z) {
+      for (let { children: u, positions: h } = o._tree, x = t > 0 ? u.length : -1; e != x; e += t) {
+        let _ = u[e], w = h[e] + o.from;
+        if (Qe(i, r, w, w + _.length)) {
+          if (_ instanceof Q) {
             if (s & I.ExcludeBuffers)
               continue;
-            let A = v.findChild(0, v.buffer.length, t, n - w, i);
+            let A = _.findChild(0, _.buffer.length, t, r - 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)) {
+              return new Z(new Ot(o, _, e, w), null, A);
+          } else if (s & I.IncludeAnonymous || !_.type.isAnonymous || ze(_)) {
             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 & I.IgnoreMounts) && (A = _e.get(_)) && !A.overlay)
+              return new E(A.tree, w, e, o);
+            let L = new E(_, w, e, o);
+            return s & I.IncludeAnonymous || !L.type.isAnonymous ? L : L.nextChild(t < 0 ? _.children.length - 1 : 0, t, r, i);
           }
         }
       }
@@ -540,15 +540,15 @@ class z extends Ye {
       /* Side.Before */
     );
   }
-  enter(e, t, n = 0) {
+  enter(e, t, r = 0) {
     let i;
-    if (!(n & I.IgnoreOverlays) && (i = ve.get(this._tree)) && i.overlay) {
+    if (!(r & I.IgnoreOverlays) && (i = _e.get(this._tree)) && i.overlay) {
       let s = e - this.from;
       for (let { from: o, to: u } of i.overlay)
         if ((t > 0 ? o <= s : o < s) && (t < 0 ? u >= s : u > s))
-          return new z(i.tree, i.overlay[0].from + this.from, -1, this);
+          return new E(i.tree, i.overlay[0].from + this.from, -1, this);
     }
-    return this.nextChild(0, 1, e, t, n);
+    return this.nextChild(0, 1, e, t, r);
   }
   nextSignificantParent() {
     let e = this;
@@ -590,8 +590,8 @@ class z extends Ye {
     return this._tree.toString();
   }
 }
-function De(r, e, t, n) {
-  let i = r.cursor(), s = [];
+function De(n, e, t, r) {
+  let i = n.cursor(), s = [];
   if (!i.firstChild())
     return s;
   if (t != null) {
@@ -600,18 +600,18 @@ function De(r, e, t, n) {
         return s;
   }
   for (; ; ) {
-    if (n != null && i.type.is(n))
+    if (r != null && i.type.is(r))
       return s;
     if (i.type.is(e) && s.push(i.node), !i.nextSibling())
-      return n == null ? s : [];
+      return r == null ? s : [];
   }
 }
-function Ie(r, e, t = e.length - 1) {
-  for (let n = r.parent; t >= 0; n = n.parent) {
-    if (!n)
+function Ie(n, e, t = e.length - 1) {
+  for (let r = n.parent; t >= 0; r = r.parent) {
+    if (!r)
       return !1;
-    if (!n.type.isAnonymous) {
-      if (e[t] && e[t] != n.name)
+    if (!r.type.isAnonymous) {
+      if (e[t] && e[t] != r.name)
         return !1;
       t--;
     }
@@ -619,11 +619,11 @@ function Ie(r, e, t = e.length - 1) {
   return !0;
 }
 class Ot {
-  constructor(e, t, n, i) {
-    this.parent = e, this.buffer = t, this.index = n, this.start = i;
+  constructor(e, t, r, i) {
+    this.parent = e, this.buffer = t, this.index = r, this.start = i;
   }
 }
-class X extends Ye {
+class Z extends Ye {
   get name() {
     return this.type.name;
   }
@@ -633,12 +633,12 @@ class X extends Ye {
   get to() {
     return this.context.start + this.context.buffer.buffer[this.index + 2];
   }
-  constructor(e, t, n) {
-    super(), this.context = e, this._parent = t, this.index = n, this.type = e.buffer.set.types[e.buffer.buffer[n]];
+  constructor(e, t, r) {
+    super(), this.context = e, this._parent = t, this.index = r, this.type = e.buffer.set.types[e.buffer.buffer[r]];
   }
-  child(e, t, n) {
-    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, n);
-    return s < 0 ? null : new X(this.context, this, s);
+  child(e, t, r) {
+    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, r);
+    return s < 0 ? null : new Z(this.context, this, s);
   }
   get firstChild() {
     return this.child(
@@ -672,11 +672,11 @@ class X extends Ye {
       /* Side.Before */
     );
   }
-  enter(e, t, n = 0) {
-    if (n & I.ExcludeBuffers)
+  enter(e, t, r = 0) {
+    if (r & 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 X(this.context, this, s);
+    return s < 0 ? null : new Z(this.context, this, s);
   }
   get parent() {
     return this._parent || this.context.parent.nextSignificantParent();
@@ -692,11 +692,11 @@ class X extends Ye {
   }
   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 X(this.context, this._parent, t) : this.externalSibling(1);
+    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new Z(this.context, this._parent, t) : this.externalSibling(1);
   }
   get prevSibling() {
     let { buffer: e } = this.context, t = this._parent ? this._parent.index + 4 : 0;
-    return this.index == t ? this.externalSibling(-1) : new X(this.context, this._parent, e.findChild(
+    return this.index == t ? this.externalSibling(-1) : new Z(this.context, this._parent, e.findChild(
       t,
       this.index,
       -1,
@@ -709,12 +709,12 @@ class X extends Ye {
     return null;
   }
   toTree() {
-    let e = [], t = [], { buffer: n } = this.context, i = this.index + 4, s = n.buffer[this.index + 3];
+    let e = [], t = [], { buffer: r } = this.context, i = this.index + 4, s = r.buffer[this.index + 3];
     if (s > i) {
-      let o = n.buffer[this.index + 1];
-      e.push(n.slice(i, s, o)), t.push(0);
+      let o = r.buffer[this.index + 1];
+      e.push(r.slice(i, s, o)), t.push(0);
     }
-    return new V(this.type, e, t, this.to - this.from);
+    return new R(this.type, e, t, this.to - this.from);
   }
   /**
   @internal
@@ -723,16 +723,16 @@ class X extends Ye {
     return this.context.buffer.childString(this.index);
   }
 }
-function et(r) {
-  if (!r.length)
+function et(n) {
+  if (!n.length)
     return null;
-  let e = 0, t = r[0];
-  for (let s = 1; s < r.length; s++) {
-    let o = r[s];
+  let e = 0, t = n[0];
+  for (let s = 1; s < n.length; s++) {
+    let o = n[s];
     (o.from > t.from || o.to < t.to) && (t = o, e = s);
   }
-  let n = t instanceof z && t.index < 0 ? null : t.parent, i = r.slice();
-  return n ? i[e] = n : i.splice(e, 1), new zt(i, t);
+  let r = t instanceof E && t.index < 0 ? null : t.parent, i = n.slice();
+  return r ? i[e] = r : i.splice(e, 1), new zt(i, t);
 }
 class zt {
   constructor(e, t) {
@@ -742,20 +742,20 @@ class zt {
     return et(this.heads);
   }
 }
-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)
+function Et(n, e, t) {
+  let r = n.resolveInner(e, t), i = null;
+  for (let s = r instanceof E ? r : r.context.parent; s; s = s.parent)
     if (s.index < 0) {
       let o = s.parent;
-      (i || (i = [n])).push(o.resolve(e, t)), s = o;
+      (i || (i = [r])).push(o.resolve(e, t)), s = o;
     } else {
-      let o = ve.get(s.tree);
+      let o = _e.get(s.tree);
       if (o && o.overlay && o.overlay[0].from <= e && o.overlay[o.overlay.length - 1].to >= e) {
-        let u = new z(o.tree, o.overlay[0].from + s.from, -1, s);
-        (i || (i = [n])).push(pe(u, e, t, !1));
+        let u = new E(o.tree, o.overlay[0].from + s.from, -1, s);
+        (i || (i = [r])).push(ce(u, e, t, !1));
       }
     }
-  return i ? et(i) : n;
+  return i ? et(i) : r;
 }
 class Be {
   /**
@@ -768,12 +768,12 @@ class Be {
   @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 E)
       this.yieldNode(e);
     else {
       this._tree = e.context.parent, this.buffer = e.context;
-      for (let n = e._parent; n; n = n._parent)
-        this.stack.unshift(n.index);
+      for (let r = e._parent; r; r = r._parent)
+        this.stack.unshift(r.index);
       this.bufferNode = e, this.yieldBuf(e.index);
     }
   }
@@ -782,14 +782,14 @@ class Be {
   }
   yieldBuf(e, t) {
     this.index = e;
-    let { start: n, buffer: i } = this.buffer;
-    return this.type = t || i.set.types[i.buffer[e]], this.from = n + i.buffer[e + 1], this.to = n + i.buffer[e + 2], !0;
+    let { start: r, buffer: i } = this.buffer;
+    return this.type = t || i.set.types[i.buffer[e]], this.from = r + i.buffer[e + 1], this.to = r + i.buffer[e + 2], !0;
   }
   /**
   @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 E ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
   }
   /**
   @internal
@@ -800,10 +800,10 @@ class Be {
   /**
   @internal
   */
-  enterChild(e, t, n) {
+  enterChild(e, t, r) {
     if (!this.buffer)
-      return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, n, this.mode));
-    let { buffer: i } = this.buffer, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.buffer.start, n);
+      return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, r, this.mode));
+    let { buffer: i } = this.buffer, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.buffer.start, r);
     return s < 0 ? !1 : (this.stack.push(this.index), this.yieldBuf(s));
   }
   /**
@@ -858,8 +858,8 @@ class Be {
   [mounted](#common.NodeProp^mounted) trees unless `overlays` is
   set to false.
   */
-  enter(e, t, n = this.mode) {
-    return this.buffer ? n & I.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+  enter(e, t, r = this.mode) {
+    return this.buffer ? r & I.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, r));
   }
   /**
   Move to the node's parent node, if this isn't the top node.
@@ -878,9 +878,9 @@ class Be {
   sibling(e) {
     if (!this.buffer)
       return this._tree._parent ? this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + e, e, 0, 4, this.mode)) : !1;
-    let { buffer: t } = this.buffer, n = this.stack.length - 1;
+    let { buffer: t } = this.buffer, r = this.stack.length - 1;
     if (e < 0) {
-      let i = n < 0 ? 0 : this.stack[n] + 4;
+      let i = r < 0 ? 0 : this.stack[r] + 4;
       if (this.index != i)
         return this.yieldBuf(t.findChild(
           i,
@@ -892,10 +892,10 @@ class Be {
         ));
     } else {
       let i = t.buffer[this.index + 3];
-      if (i < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3]))
+      if (i < (r < 0 ? t.buffer.length : t.buffer[this.stack[r] + 3]))
         return this.yieldBuf(i);
     }
-    return n < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
+    return r < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
   }
   /**
   Move to this node's next sibling, if any.
@@ -910,7 +910,7 @@ class Be {
     return this.sibling(-1);
   }
   atLastNode(e) {
-    let t, n, { buffer: i } = this;
+    let t, r, { buffer: i } = this;
     if (i) {
       if (e > 0) {
         if (this.index < i.buffer.buffer.length)
@@ -919,14 +919,14 @@ class Be {
         for (let s = 0; s < this.index; s++)
           if (i.buffer.buffer[s + 3] < this.index)
             return !1;
-      ({ index: t, parent: n } = i);
+      ({ index: t, parent: r } = i);
     } else
-      ({ index: t, _parent: n } = this._tree);
-    for (; n; { index: t, _parent: n } = n)
+      ({ index: t, _parent: r } = this._tree);
+    for (; r; { index: t, _parent: r } = r)
       if (t > -1)
-        for (let s = t + e, o = e < 0 ? -1 : n._tree.children.length; s != o; s += e) {
-          let u = n._tree.children[s];
-          if (this.mode & I.IncludeAnonymous || u instanceof Z || !u.type.isAnonymous || ze(u))
+        for (let s = t + e, o = e < 0 ? -1 : r._tree.children.length; s != o; s += e) {
+          let u = r._tree.children[s];
+          if (this.mode & I.IncludeAnonymous || u instanceof Q || !u.type.isAnonymous || ze(u))
             return !1;
         }
     return !0;
@@ -984,7 +984,7 @@ class Be {
   get node() {
     if (!this.buffer)
       return this._tree;
-    let e = this.bufferNode, t = null, n = 0;
+    let e = this.bufferNode, t = null, r = 0;
     if (e && e.context == this.buffer)
       e:
         for (let i = this.index, s = this.stack.length; s >= 0; ) {
@@ -992,14 +992,14 @@ class Be {
             if (o.index == i) {
               if (i == this.index)
                 return o;
-              t = o, n = s + 1;
+              t = o, r = s + 1;
               break e;
             }
           i = this.stack[--s];
         }
-    for (let i = n; i < this.stack.length; i++)
-      t = new X(this.buffer, t, this.stack[i]);
-    return this.bufferNode = new X(this.buffer, t, this.index);
+    for (let i = r; i < this.stack.length; i++)
+      t = new Z(this.buffer, t, this.stack[i]);
+    return this.bufferNode = new Z(this.buffer, t, this.index);
   }
   /**
   Get the [tree](#common.Tree) that represents the current node, if
@@ -1016,19 +1016,19 @@ class Be {
   skipped, and `leave` isn't called for it.
   */
   iterate(e, t) {
-    for (let n = 0; ; ) {
+    for (let r = 0; ; ) {
       let i = !1;
       if (this.type.isAnonymous || e(this) !== !1) {
         if (this.firstChild()) {
-          n++;
+          r++;
           continue;
         }
         this.type.isAnonymous || (i = !0);
       }
       for (; i && t && t(this), i = this.type.isAnonymous, !this.nextSibling(); ) {
-        if (!n)
+        if (!r)
           return;
-        this.parent(), n--, i = !0;
+        this.parent(), r--, i = !0;
       }
     }
   }
@@ -1040,11 +1040,11 @@ class Be {
   matchContext(e) {
     if (!this.buffer)
       return Ie(this.node, e);
-    let { buffer: t } = this.buffer, { types: n } = t.set;
+    let { buffer: t } = this.buffer, { types: r } = t.set;
     for (let i = e.length - 1, s = this.stack.length - 1; i >= 0; s--) {
       if (s < 0)
         return Ie(this.node, e, i);
-      let o = n[t.buffer[this.stack[s]]];
+      let o = r[t.buffer[this.stack[s]]];
       if (!o.isAnonymous) {
         if (e[i] && e[i] != o.name)
           return !1;
@@ -1054,48 +1054,48 @@ class Be {
     return !0;
   }
 }
-function ze(r) {
-  return r.children.some((e) => e instanceof Z || !e.type.isAnonymous || ze(e));
+function ze(n) {
+  return n.children.some((e) => e instanceof Q || !e.type.isAnonymous || ze(e));
 }
-function Mt(r) {
+function Mt(n) {
   var e;
-  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;
+  let { buffer: t, nodeSet: r, maxBufferLength: i = It, reused: s = [], minRepeatType: o = r.types.length } = n, u = Array.isArray(t) ? new Oe(t, t.length) : t, h = r.types, x = 0, _ = 0;
+  function w(g, b, f, y, p, m) {
+    let { id: d, start: c, end: C, size: k } = u, B = _;
     for (; k < 0; )
       if (u.next(), k == -1) {
         let W = s[d];
-        h.push(W), y.push(c - g);
+        f.push(W), y.push(c - g);
         return;
       } else if (k == -3) {
         x = d;
         return;
       } else if (k == -4) {
-        v = d;
+        _ = d;
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${k}`);
-    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;
+    let Y = h[d], ie, ee, Me = c - g;
+    if (C - c <= i && (ee = M(u.pos - b, p))) {
+      let W = new Uint16Array(ee.size - ee.skip), O = u.pos - ee.size, $ = W.length;
       for (; u.pos > O; )
-        P = D(Y.start, W, P);
-      ie = new Z(W, C - Y.start, n), Me = Y.start - g;
+        $ = D(ee.start, W, $);
+      ie = new Q(W, C - ee.start, r), Me = ee.start - g;
     } else {
       let W = u.pos - k;
       u.next();
-      let O = [], P = [], ee = d >= o ? d : -1, se = 0, ge = C;
+      let O = [], $ = [], te = d >= o ? d : -1, se = 0, pe = 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);
+        te >= 0 && u.id == te && u.size >= 0 ? (u.end <= pe - i && (N(O, $, c, se, u.end, pe, te, B), se = O.length, pe = u.end), u.next()) : m > 2500 ? A(c, W, O, $) : w(c, W, O, $, te, m + 1);
+      if (te >= 0 && se > 0 && se < O.length && N(O, $, c, se, c, pe, te, B), O.reverse(), $.reverse(), te > -1 && se > 0) {
+        let Pe = L(Y);
+        ie = Ee(Y, O, $, 0, O.length, 0, C - c, Pe, Pe);
       } else
-        ie = M(Q, O, P, C - c, B - C);
+        ie = P(Y, O, $, C - c, B - C);
     }
-    h.push(ie), y.push(Me);
+    f.push(ie), y.push(Me);
   }
-  function A(g, b, h, y) {
+  function A(g, b, f, y) {
     let p = [], m = 0, d = -1;
     for (; u.pos > b; ) {
       let { id: c, start: C, end: k, size: B } = u;
@@ -1111,143 +1111,143 @@ function Mt(r) {
       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);
+      f.push(new Q(c, p[2] - C, r)), y.push(C - g);
     }
   }
   function L(g) {
-    return (b, h, y) => {
+    return (b, f, y) => {
       let p = 0, m = b.length - 1, d, c;
-      if (m >= 0 && (d = b[m]) instanceof V) {
+      if (m >= 0 && (d = b[m]) instanceof R) {
         if (!m && d.type == g && d.length == y)
           return d;
-        (c = d.prop(_.lookAhead)) && (p = h[m] + d.length + c);
+        (c = d.prop(v.lookAhead)) && (p = f[m] + d.length + c);
       }
-      return M(g, b, h, y, p);
+      return P(g, b, f, y, p);
     };
   }
-  function N(g, b, h, y, p, m, d, c) {
+  function N(g, b, f, 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);
+      C.push(g.pop()), k.push(b.pop() + f - p);
+    g.push(P(r.types[d], C, k, m - p, c - m)), b.push(p - f);
   }
-  function M(g, b, h, y, p = 0, m) {
+  function P(g, b, f, y, p = 0, m) {
     if (x) {
-      let d = [_.contextHash, x];
+      let d = [v.contextHash, x];
       m = m ? [d].concat(m) : [d];
     }
     if (p > 25) {
-      let d = [_.lookAhead, p];
+      let d = [v.lookAhead, p];
       m = m ? [d].concat(m) : [d];
     }
-    return new V(g, b, h, y, m);
+    return new R(g, b, f, y, m);
   }
-  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 };
+  function M(g, b) {
+    let f = u.fork(), y = 0, p = 0, m = 0, d = f.end - i, c = { size: 0, start: 0, skip: 0 };
     e:
-      for (let C = 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();
+      for (let C = f.pos - g; f.pos > C; ) {
+        let k = f.size;
+        if (f.id == b && k >= 0) {
+          c.size = y, c.start = p, c.skip = m, m += 4, y += 4, f.next();
           continue;
         }
-        let B = h.pos - k;
-        if (k < 0 || B < C || h.start < d)
+        let B = f.pos - k;
+        if (k < 0 || B < C || f.start < d)
           break;
-        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;
+        let Y = f.id >= o ? 4 : 0, ie = f.start;
+        for (f.next(); f.pos > B; ) {
+          if (f.size < 0)
+            if (f.size == -3)
+              Y += 4;
             else
               break e;
           else
-            h.id >= o && (Q += 4);
-          h.next();
+            f.id >= o && (Y += 4);
+          f.next();
         }
-        p = ie, y += k, m += Q;
+        p = ie, y += k, m += Y;
       }
     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) {
+  function D(g, b, f) {
     let { id: y, start: p, end: m, size: d } = u;
     if (u.next(), d >= 0 && y < o) {
-      let c = h;
+      let c = f;
       if (d > 4) {
         let C = u.pos - (d - 4);
         for (; u.pos > C; )
-          h = D(g, b, h);
+          f = D(g, b, f);
       }
-      b[--h] = c, b[--h] = m - g, b[--h] = p - g, b[--h] = y;
+      b[--f] = c, b[--f] = m - g, b[--f] = p - g, b[--f] = y;
     } else
-      d == -3 ? x = y : d == -4 && (v = y);
-    return h;
+      d == -3 ? x = y : d == -4 && (_ = y);
+    return f;
   }
   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);
+    w(n.start || 0, n.bufferStart || 0, U, S, -1, 0);
+  let J = (e = n.length) !== null && e !== void 0 ? e : U.length ? S[0] + U[0].length : 0;
+  return new R(h[n.topID], U.reverse(), S.reverse(), J);
 }
 const Ue = /* @__PURE__ */ new WeakMap();
-function Ce(r, e) {
-  if (!r.isAnonymous || e instanceof Z || e.type != r)
+function Ce(n, e) {
+  if (!n.isAnonymous || e instanceof Q || e.type != n)
     return 1;
   let t = Ue.get(e);
   if (t == null) {
     t = 1;
-    for (let n of e.children) {
-      if (n.type != r || !(n instanceof V)) {
+    for (let r of e.children) {
+      if (r.type != n || !(r instanceof R)) {
         t = 1;
         break;
       }
-      t += Ce(r, n);
+      t += Ce(n, r);
     }
     Ue.set(e, t);
   }
   return t;
 }
-function Ee(r, e, t, n, i, s, o, u, f) {
+function Ee(n, e, t, r, i, s, o, u, h) {
   let x = 0;
-  for (let N = n; N < i; N++)
-    x += Ce(r, e[N]);
-  let v = Math.ceil(
+  for (let N = r; N < i; N++)
+    x += Ce(n, e[N]);
+  let _ = Math.ceil(
     x * 1.5 / 8
     /* Balance.BranchFactor */
   ), 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]);
+  function L(N, P, M, D, U) {
+    for (let S = M; S < D; ) {
+      let J = S, g = P[S], b = Ce(n, N[S]);
       for (S++; S < D; S++) {
-        let h = Ce(r, N[S]);
-        if (b + h >= v)
+        let f = Ce(n, N[S]);
+        if (b + f >= _)
           break;
-        b += h;
+        b += f;
       }
       if (S == J + 1) {
-        if (b > v) {
-          let h = N[J];
-          L(h.children, h.positions, 0, h.children.length, M[J] + U);
+        if (b > _) {
+          let f = N[J];
+          L(f.children, f.positions, 0, f.children.length, P[J] + U);
           continue;
         }
         w.push(N[J]);
       } else {
-        let h = M[S - 1] + N[S - 1].length - g;
-        w.push(Ee(r, N, M, J, S, g, h, null, f));
+        let f = P[S - 1] + N[S - 1].length - g;
+        w.push(Ee(n, N, P, J, S, g, f, null, h));
       }
       A.push(g + U - s);
     }
   }
-  return L(e, t, n, i, 0), (u || f)(w, A, o);
+  return L(e, t, r, i, 0), (u || h)(w, A, o);
 }
-new _({ perNode: !0 });
+new v({ perNode: !0 });
 let Pt = 0;
-class H {
+class V {
   /**
   @internal
   */
-  constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = Pt++;
+  constructor(e, t, r) {
+    this.set = e, this.base = t, this.modified = r, this.id = Pt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1259,10 +1259,10 @@ class H {
   static define(e) {
     if (e != null && e.base)
       throw new Error("Can not derive from a modified tag");
-    let t = new H([], null, []);
+    let t = new V([], null, []);
     if (t.set.push(t), e)
-      for (let n of e.set)
-        t.set.push(n);
+      for (let r of e.set)
+        t.set.push(r);
     return t;
   }
   /**
@@ -1279,7 +1279,7 @@ class H {
   */
   static defineModifier() {
     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));
+    return (t) => t.modified.indexOf(e) > -1 ? t : we.get(t.base || t, t.modified.concat(e).sort((r, i) => r.id - i.id));
   }
 }
 let $t = 0;
@@ -1290,46 +1290,46 @@ class we {
   static get(e, t) {
     if (!t.length)
       return e;
-    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);
+    let r = t[0].instances.find((u) => u.base == e && Tt(t, u.modified));
+    if (r)
+      return r;
+    let i = [], s = new V(i, e, t);
     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(we.get(u, f));
+        for (let h of o)
+          i.push(we.get(u, h));
     return s;
   }
 }
-function Tt(r, e) {
-  return r.length == e.length && r.every((t, n) => t == e[n]);
+function Tt(n, e) {
+  return n.length == e.length && n.every((t, r) => t == e[r]);
 }
-function jt(r) {
+function jt(n) {
   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);
+  for (let t = 0; t < n.length; t++)
+    for (let r = 0, i = e.length; r < i; r++)
+      e.push(e[r].concat(n[t]));
+  return e.sort((t, r) => r.length - t.length);
 }
-new _();
-function Ht(r, e) {
+new v();
+function Ht(n, e) {
   let t = /* @__PURE__ */ Object.create(null);
-  for (let s of r)
+  for (let s of n)
     if (!Array.isArray(s.tag))
       t[s.tag.id] = s.class;
     else
       for (let o of s.tag)
         t[o.id] = s.class;
-  let { scope: n, all: i = null } = e || {};
+  let { scope: r, all: i = null } = e || {};
   return {
     style: (s) => {
       let o = i;
       for (let u of s)
-        for (let f of u.set) {
-          let x = t[f.id];
+        for (let h of u.set) {
+          let x = t[h.id];
           if (x) {
             o = o ? o + " " + x : x;
             break;
@@ -1337,10 +1337,10 @@ function Ht(r, e) {
         }
       return o;
     },
-    scope: n
+    scope: r
   };
 }
-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 = {
+const a = V.define, ye = a(), F = a(), Je = a(F), We = a(F), X = a(), xe = a(X), Se = a(X), H = a(), ne = a(H), T = a(), j = a(), Le = a(), he = a(Le), ke = a(), l = {
   /**
   A comment.
   */
@@ -1360,11 +1360,11 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   /**
   Any kind of identifier.
   */
-  name: q,
+  name: F,
   /**
   The [name](#highlight.tags.name) of a variable.
   */
-  variableName: a(q),
+  variableName: a(F),
   /**
   A type [name](#highlight.tags.name).
   */
@@ -1384,23 +1384,23 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   /**
   The [name](#highlight.tags.name) of a class.
   */
-  className: a(q),
+  className: a(F),
   /**
   A label [name](#highlight.tags.name).
   */
-  labelName: a(q),
+  labelName: a(F),
   /**
   A namespace [name](#highlight.tags.name).
   */
-  namespace: a(q),
+  namespace: a(F),
   /**
   The [name](#highlight.tags.name) of a macro.
   */
-  macroName: a(q),
+  macroName: a(F),
   /**
   A literal value.
   */
-  literal: F,
+  literal: X,
   /**
   A string [literal](#highlight.tags.literal).
   */
@@ -1432,106 +1432,106 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   /**
   A boolean [literal](#highlight.tags.literal).
   */
-  bool: a(F),
+  bool: a(X),
   /**
   Regular expression [literal](#highlight.tags.literal).
   */
-  regexp: a(F),
+  regexp: a(X),
   /**
   An escape [literal](#highlight.tags.literal), for example a
   backslash escape in a string.
   */
-  escape: a(F),
+  escape: a(X),
   /**
   A color [literal](#highlight.tags.literal).
   */
-  color: a(F),
+  color: a(X),
   /**
   A URL [literal](#highlight.tags.literal).
   */
-  url: a(F),
+  url: a(X),
   /**
   A language keyword.
   */
-  keyword: $,
+  keyword: T,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a($),
+  self: a(T),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a($),
+  null: a(T),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a($),
+  atom: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a($),
+  unit: a(T),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a($),
+  modifier: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a($),
+  operatorKeyword: a(T),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a($),
+  controlKeyword: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a($),
+  definitionKeyword: a(T),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a($),
+  moduleKeyword: a(T),
   /**
   An operator.
   */
-  operator: T,
+  operator: j,
   /**
   An [operator](#highlight.tags.operator) that dereferences something.
   */
-  derefOperator: a(T),
+  derefOperator: a(j),
   /**
   Arithmetic-related [operator](#highlight.tags.operator).
   */
-  arithmeticOperator: a(T),
+  arithmeticOperator: a(j),
   /**
   Logical [operator](#highlight.tags.operator).
   */
-  logicOperator: a(T),
+  logicOperator: a(j),
   /**
   Bit [operator](#highlight.tags.operator).
   */
-  bitwiseOperator: a(T),
+  bitwiseOperator: a(j),
   /**
   Comparison [operator](#highlight.tags.operator).
   */
-  compareOperator: a(T),
+  compareOperator: a(j),
   /**
   [Operator](#highlight.tags.operator) that updates its operand.
   */
-  updateOperator: a(T),
+  updateOperator: a(j),
   /**
   [Operator](#highlight.tags.operator) that defines something.
   */
-  definitionOperator: a(T),
+  definitionOperator: a(j),
   /**
   Type-related [operator](#highlight.tags.operator).
   */
-  typeOperator: a(T),
+  typeOperator: a(j),
   /**
   Control-flow [operator](#highlight.tags.operator).
   */
-  controlOperator: a(T),
+  controlOperator: a(j),
   /**
   Program or markup punctuation.
   */
@@ -1544,93 +1544,93 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   /**
   Bracket-style [punctuation](#highlight.tags.punctuation).
   */
-  bracket: de,
+  bracket: he,
   /**
   Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
   tokens).
   */
-  angleBracket: a(de),
+  angleBracket: a(he),
   /**
   Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
   tokens).
   */
-  squareBracket: a(de),
+  squareBracket: a(he),
   /**
   Parentheses (usually `(` and `)` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  paren: a(de),
+  paren: a(he),
   /**
   Braces (usually `{` and `}` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  brace: a(de),
+  brace: a(he),
   /**
   Content, for example plain text in XML or markup documents.
   */
-  content: j,
+  content: H,
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
-  heading: te,
+  heading: ne,
   /**
   A level 1 [heading](#highlight.tags.heading).
   */
-  heading1: a(te),
+  heading1: a(ne),
   /**
   A level 2 [heading](#highlight.tags.heading).
   */
-  heading2: a(te),
+  heading2: a(ne),
   /**
   A level 3 [heading](#highlight.tags.heading).
   */
-  heading3: a(te),
+  heading3: a(ne),
   /**
   A level 4 [heading](#highlight.tags.heading).
   */
-  heading4: a(te),
+  heading4: a(ne),
   /**
   A level 5 [heading](#highlight.tags.heading).
   */
-  heading5: a(te),
+  heading5: a(ne),
   /**
   A level 6 [heading](#highlight.tags.heading).
   */
-  heading6: a(te),
+  heading6: a(ne),
   /**
   A prose separator (such as a horizontal rule).
   */
-  contentSeparator: a(j),
+  contentSeparator: a(H),
   /**
   [Content](#highlight.tags.content) that represents a list.
   */
-  list: a(j),
+  list: a(H),
   /**
   [Content](#highlight.tags.content) that represents a quote.
   */
-  quote: a(j),
+  quote: a(H),
   /**
   [Content](#highlight.tags.content) that is emphasized.
   */
-  emphasis: a(j),
+  emphasis: a(H),
   /**
   [Content](#highlight.tags.content) that is styled strong.
   */
-  strong: a(j),
+  strong: a(H),
   /**
   [Content](#highlight.tags.content) that is part of a link.
   */
-  link: a(j),
+  link: a(H),
   /**
   [Content](#highlight.tags.content) that is styled as code or
   monospace.
   */
-  monospace: a(j),
+  monospace: a(H),
   /**
   [Content](#highlight.tags.content) that has a strike-through
   style.
   */
-  strikethrough: a(j),
+  strikethrough: a(H),
   /**
   Inserted text in a change-tracking format.
   */
@@ -1671,31 +1671,31 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   given element is being defined. Expected to be used with the
   various [name](#highlight.tags.name) tags.
   */
-  definition: H.defineModifier(),
+  definition: V.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that
   something is constant. Mostly expected to be used with
   [variable names](#highlight.tags.variableName).
   */
-  constant: H.defineModifier(),
+  constant: V.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: H.defineModifier(),
+  function: V.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: H.defineModifier(),
+  standard: V.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates a given
   [names](#highlight.tags.name) is local to some scope.
   */
-  local: H.defineModifier(),
+  local: V.defineModifier(),
   /**
   A generic variant [modifier](#highlight.Tag^defineModifier) that
   can be used to tag language-specific alternative variants of
@@ -1704,7 +1704,7 @@ const a = H.define, ye = a(), q = a(), Je = a(q), We = a(q), F = a(), xe = a(F),
   [variable name](#highlight.tags.variableName) tags, since those
   come up a lot.
   */
-  special: H.defineModifier()
+  special: V.defineModifier()
 };
 Ht([
   { tag: l.link, class: "tok-link" },
@@ -1744,38 +1744,38 @@ const Vt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
   green: Dt,
   blue: Ut,
   invalid: "#ffffff"
-}, Wt = (r) => gt.define([
+}, Wt = (n) => gt.define([
   {
     tag: l.keyword,
-    color: r.red
+    color: n.red
   },
   {
     tag: [l.name, l.deleted, l.character, l.propertyName, l.macroName],
-    color: r.green
+    color: n.green
   },
   {
     tag: [l.function(l.variableName), l.labelName],
-    color: r.blue
+    color: n.blue
   },
   {
     tag: [l.color, l.constant(l.name), l.standard(l.name)],
-    color: r.red
+    color: n.red
   },
   {
     tag: [l.definition(l.name), l.separator],
-    color: r.red
+    color: n.red
   },
   {
     tag: [l.typeName, l.className, l.number, l.changed, l.annotation, l.modifier, l.self, l.namespace],
-    color: r.orange
+    color: n.orange
   },
   {
     tag: [l.operator, l.operatorKeyword, l.url, l.escape, l.regexp, l.link, l.special(l.string)],
-    color: r.blue
+    color: n.blue
   },
   {
     tag: [l.meta, l.comment],
-    color: r.orange
+    color: n.orange
   },
   {
     tag: l.strong,
@@ -1791,60 +1791,60 @@ const Vt = "#c72727", Rt = "#9b5700", Dt = "#067934", Ut = "#0063d7", Jt = {
   },
   {
     tag: l.link,
-    color: r.orange,
+    color: n.orange,
     textDecoration: "underline"
   },
   {
     tag: l.heading,
     fontWeight: "bold",
-    color: r.blue
+    color: n.blue
   },
   {
     tag: [l.atom, l.bool, l.special(l.variableName)],
-    color: r.red
+    color: n.red
   },
   {
     tag: [l.processingInstruction, l.string, l.inserted],
-    color: r.blue
+    color: n.blue
   },
   {
     tag: l.invalid,
-    color: r.invalid
+    color: n.invalid
   }
 ]), 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 || {});
+var ve = /* @__PURE__ */ ((n) => (n.INLINE = "inline", n.SINGLELINE = "singleline", n.MULTILINE = "multiline", n))(ve || {}), re = /* @__PURE__ */ ((n) => (n.JSON = "json", n.XML = "xml", n.JAVA = "java", n.JAVASCRIPT = "javascript", n))(re || {}), de = /* @__PURE__ */ ((n) => (n.ACTION = "action", n.CHANGE = "change", n))(de || {});
 const Kt = {
   [re.JSON]: mt,
   [re.XML]: bt,
   [re.JAVASCRIPT]: yt,
   [re.JAVA]: xt
-}, qt = (r) => ({
-  loadLang: async () => Kt[r]
+}, qt = (n) => ({
+  loadLang: async () => Kt[n]
 });
 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", {
+}, tt = (n) => (Fe("data-v-012ee7f3"), n = n(), Xe(), n), Xt = { key: 0 }, Zt = /* @__PURE__ */ tt(() => /* @__PURE__ */ ae("path", {
   fill: "#00112C",
   "fill-rule": "evenodd",
   d: "M14 1.25H10C9.58579 1.25 9.25 1.58579 9.25 2C9.25 2.41421 9.58579 2.75 10 2.75H12.1893L9.46967 5.46967C9.17678 5.76256 9.17678 6.23744 9.46967 6.53033C9.76256 6.82322 10.2374 6.82322 10.5303 6.53033L13.25 3.81066V6C13.25 6.41421 13.5858 6.75 14 6.75C14.4142 6.75 14.75 6.41421 14.75 6V2C14.75 1.80806 14.6768 1.61612 14.5303 1.46967C14.4584 1.39776 14.3755 1.34351 14.2871 1.30691C14.1987 1.27024 14.1017 1.25 14 1.25Z",
   "clip-rule": "evenodd"
-}, null, -1)), Qt = /* @__PURE__ */ tt(() => /* @__PURE__ */ le("path", {
+}, null, -1)), Qt = /* @__PURE__ */ tt(() => /* @__PURE__ */ ae("path", {
   fill: "#00112C",
   "fill-rule": "evenodd",
   d: "M1.25 10C1.25 9.58579 1.58579 9.25 2 9.25C2.41421 9.25 2.75 9.58579 2.75 10V12.1893L5.46967 9.46967C5.76256 9.17678 6.23744 9.17678 6.53033 9.46967C6.82322 9.76256 6.82322 10.2374 6.53033 10.5303L3.81066 13.25H6C6.41421 13.25 6.75 13.5858 6.75 14C6.75 14.4142 6.41421 14.75 6 14.75H2C1.80806 14.75 1.61612 14.6768 1.46967 14.5303C1.39776 14.4584 1.34351 14.3755 1.30691 14.2871C1.27024 14.1987 1.25 14.1017 1.25 14V10Z",
   "clip-rule": "evenodd"
 }, null, -1));
-function Yt(r, e, t, n, i, s) {
-  return E(), oe("svg", qe({ role: "img" }, r.$attrs, {
+function Yt(n, e, t, r, i, s) {
+  return z(), le("svg", qe({ role: "img" }, n.$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),
+    n.$attrs["svg-title"] ? (z(), le("title", Xt, Ae(n.$attrs["svg-title"]), 1)) : q("", !0),
     Zt,
     Qt
   ], 16);
@@ -1858,8 +1858,8 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
   i18n: { messages: Ke },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: vt,
-    BentoButton: _t,
+    BentoTypography: _t,
+    BentoButton: vt,
     BentoDropdown: kt,
     Copy: At,
     BaseModal: Ct,
@@ -1873,8 +1873,8 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
      */
     variant: {
       type: String,
-      default: _e.MULTILINE,
-      validator: (r) => Object.values(_e).includes(r)
+      default: ve.MULTILINE,
+      validator: (n) => Object.values(ve).includes(n)
     },
     /**
      * Language name for syntax highlighting rules
@@ -1882,7 +1882,7 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     lang: {
       type: String,
       default: re.JSON,
-      validator: (r) => Object.values(re).includes(r)
+      validator: (n) => Object.values(re).includes(n)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1937,67 +1937,69 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
       default: !1
     }
   },
-  emits: [ce.ACTION, ce.CHANGE],
-  setup(r, { emit: e }) {
-    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(() => ({
+  emits: [de.ACTION, de.CHANGE],
+  setup(n, { emit: e }) {
+    const { t } = St({ messages: Ke }), r = ge(null), i = [], s = () => {
+    }, o = ue(() => n.langLabel ?? n.lang.toUpperCase()), u = ue(() => n.variant === ve.INLINE), h = ue(() => ({
       "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);
+    })), x = ue(() => ({
+      "b-code-snippet__code-area-content--editable": n.editable
+    })), { loadLang: _ } = qt(n.lang), w = $e(), A = $e(), L = new Ne(), N = new Ne(), P = new Ne(), M = ge(null), D = ge(0);
     rt(async () => {
-      const g = await v();
-      R.value = r.content;
+      const g = await _();
+      M.value = n.content;
       const b = ({ state: p }) => {
-        R.value = p.doc.toString();
-      }, h = [
+        M.value = p.doc.toString();
+      }, f = [
         ut(),
-        ht.of([dt]),
+        ft.of([dt]),
         L.of(g()),
         N.of(Gt),
-        M.of(Ve.readOnly.of(!r.editable)),
+        P.of(Ve.readOnly.of(!n.editable)),
         He.updateListener.of((p) => b(p))
       ];
-      r.variant === "multiline" && h.push([ft(), ct()]);
+      n.variant === "multiline" && f.push([ht(), ct()]);
       const y = Ve.create({
-        doc: r.content,
-        extensions: [...h]
+        doc: n.content,
+        extensions: [...f]
       });
       D.value = y.doc.length, A.value = new He({
         state: y,
         parent: w.value
       });
     }), it(
-      () => r.content,
+      () => n.content,
       () => {
-        const g = r.content.length;
-        A.value.dispatch({
-          changes: {
-            from: 0,
-            to: D.value,
-            insert: r.content
-          }
-        }), D.value = g;
+        if (n.content !== M.value) {
+          const g = n.content.length;
+          A.value.dispatch({
+            changes: {
+              from: 0,
+              to: D.value,
+              insert: n.content
+            }
+          }), D.value = g;
+        }
       }
     );
-    const U = ae(() => t(r.actionableText)), S = () => {
-      e(ce.ACTION, R.value);
+    const U = ue(() => t(n.actionableText)), S = () => {
+      e(de.ACTION, M.value);
     };
     st(() => {
-      e(ce.CHANGE, R.value);
+      M.value !== null && e(de.CHANGE, M.value);
     });
-    const J = me(!1);
+    const J = ge(!1);
     return {
       // Values
       availableLanguages: i,
       codeAreaContentConditionalClasses: x,
-      conditionalClasses: f,
+      conditionalClasses: h,
       container: w,
-      currentContents: R,
+      currentContents: M,
       displayedLang: o,
       editor: A,
-      selectedLanguage: n,
+      selectedLanguage: r,
       showModal: J,
       isInlineVariant: u,
       // Methods
@@ -2009,112 +2011,113 @@ const en = /* @__PURE__ */ Ze(Ft, [["render", Yt], ["__scopeId", "data-v-012ee7f
     };
   }
 });
-const nn = (r) => (Fe("data-v-c3034448"), r = r(), Xe(), r), rn = {
+const nn = (n) => (Fe("data-v-fdff494b"), n = n(), Xe(), n), rn = {
   key: 0,
   class: "b-code-snippet__action-bar"
 }, sn = { class: "b-code-snippet__action-bar--start" }, on = { class: "b-code-snippet__action-bar--end" }, ln = {
   key: 1,
   class: "b-code-snippet__code-area"
-}, 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])
+}, an = { key: 2 }, un = /* @__PURE__ */ nn(() => /* @__PURE__ */ ae("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
+function fn(n, e, t, r, i, s) {
+  const o = K("bento-dropdown"), u = K("bento-typography"), h = K("bento-loading-indicator"), x = K("copy"), _ = K("expand-icon"), w = K("bento-button"), A = K("bento-code-snippet"), L = K("base-modal");
+  return z(), le("div", {
+    class: Te(["b-code-snippet", n.conditionalClasses])
   }, [
-    r.isInlineVariant ? ne("", !0) : (E(), oe("section", rn, [
-      le("div", sn, [
-        r.availableLanguages.length > 0 ? (E(), ue(o, qe({
+    n.isInlineVariant ? q("", !0) : (z(), le("section", rn, [
+      ae("div", sn, [
+        n.availableLanguages.length > 0 ? (z(), oe(o, qe({
           key: 0,
-          modelValue: r.selectedLanguage,
-          "onUpdate:modelValue": e[0] || (e[0] = (N) => r.selectedLanguage = N)
-        }, r.$props, {
-          disabled: r.availableLanguages.length === 1,
-          items: r.availableLanguages,
+          modelValue: n.selectedLanguage,
+          "onUpdate:modelValue": e[0] || (e[0] = (N) => n.selectedLanguage = N)
+        }, n.$props, {
+          disabled: n.availableLanguages.length === 1,
+          items: n.availableLanguages,
           class: "b-code-snippet__language-picker",
-          onInput: r.handleChangeLanguage
-        }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : ne("", !0),
-        he(u, {
+          onInput: n.handleChangeLanguage
+        }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : q("", !0),
+        me(u, {
           el: "span",
           stronger: ""
         }, {
           default: fe(() => [
-            je(Ae(r.displayedLang), 1)
+            je(Ae(n.displayedLang), 1)
           ]),
           _: 1
         })
       ]),
-      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.expandable ? (E(), ue(w, {
+      ae("div", on, [
+        n.loading ? (z(), oe(h, { key: 0 })) : q("", !0),
+        n.currentContents !== null ? (z(), oe(x, {
           key: 1,
+          class: "b-structured-list__icon",
+          text: n.currentContents
+        }, null, 8, ["text"])) : q("", !0),
+        n.expandable ? (z(), oe(w, {
+          key: 2,
           variant: "tertiary",
           condensed: "",
-          "aria-label": r.t("expand"),
-          onClick: e[1] || (e[1] = (N) => r.showModal = !0)
+          "aria-label": n.t("expand"),
+          onClick: e[1] || (e[1] = (N) => n.showModal = !0)
         }, {
           iconLeft: fe(() => [
-            he(v)
+            me(_)
           ]),
           _: 1
-        }, 8, ["aria-label"])) : ne("", !0),
-        r.actionable ? (E(), ue(w, {
-          key: 2,
+        }, 8, ["aria-label"])) : q("", !0),
+        n.actionable ? (z(), oe(w, {
+          key: 3,
           variant: "primary",
           tertiary: "",
           condensed: "",
-          onClick: r.onActionClicked
+          onClick: n.onActionClicked
         }, {
           iconLeft: fe(() => [
-            he(u, {
+            me(u, {
               el: "span",
               class: "b-code-snippet__action-button"
             }, {
               default: fe(() => [
-                je(Ae(r.runText), 1)
+                je(Ae(n.runText), 1)
               ]),
               _: 1
             })
           ]),
           _: 1
-        }, 8, ["onClick"])) : ne("", !0)
+        }, 8, ["onClick"])) : q("", !0)
       ])
     ])),
-    r.content ? (E(), oe("code", ln, [
-      le("div", {
+    n.content || n.editable ? (z(), le("code", ln, [
+      ae("div", {
         ref: "container",
-        class: Te(["b-code-snippet__code-area-content", r.codeAreaContentConditionalClasses])
+        class: Te(["b-code-snippet__code-area-content", n.codeAreaContentConditionalClasses])
       }, null, 2)
-    ])) : (E(), oe("section", an, [
-      ot(r.$slots, "empty-state", {}, () => [
+    ])) : (z(), le("section", an, [
+      ot(n.$slots, "empty-state", {}, () => [
         un
       ], !0)
     ])),
-    r.expandable ? (E(), ue(L, {
+    n.expandable ? (z(), oe(L, {
       key: 3,
       class: "b-code-snippet__modal",
       "hide-close-button": !0,
       "custom-padding": "0px",
       "is-dismissible": !0,
-      "is-open": r.showModal,
+      "is-open": n.showModal,
       size: "large",
-      onCloseModal: e[2] || (e[2] = (N) => r.showModal = !1)
+      onCloseModal: e[2] || (e[2] = (N) => n.showModal = !1)
     }, {
       content: fe(() => [
-        he(A, lt(at({ ...r.$props, expandable: !1 })), null, 16)
+        me(A, lt(at({ ...n.$props, expandable: !1 })), null, 16)
       ]),
       _: 1
-    }, 8, ["is-open"])) : ne("", !0)
+    }, 8, ["is-open"])) : q("", !0)
   ], 2);
 }
-const Bn = /* @__PURE__ */ Ze(tn, [["render", hn], ["__scopeId", "data-v-c3034448"]]);
+const Bn = /* @__PURE__ */ Ze(tn, [["render", fn], ["__scopeId", "data-v-fdff494b"]]);
 export {
   Bn as BentoCodeSnippet,
-  ce as BentoCodeSnippetEvent,
+  de as BentoCodeSnippetEvent,
   re as BentoCodeSnippetSupportedLanguage,
-  _e as BentoCodeSnippetVariant
+  ve as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map