@adyen/bento-vue2 1.4.1 → 1.5.0

package/dist/code-snippet.js

@@ -7,24 +7,24 @@ 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.15cc1c45.js";
-import { f as nt } from "./chunks/base-modal.a51d2395.js";
+import { B as tt } from "./chunks/dropdown.10ea8304.js";
+import { f as nt } from "./chunks/base-modal.6eaa7e53.js";
 import { a as rt } from "./chunks/button.66df5734.js";
 import { B as it } from "./chunks/index.1645ffcb.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.982e1b19.js";
-import { b as at } from "./chunks/tooltip.0297fd5d.js";
-import "./assets/index10.css";
-const ft = 1024;
-let ut = 0;
+import { C as ot } from "./chunks/copy.57f969d4.js";
+import { b as at } from "./chunks/tooltip.f89cb0cd.js";
+import "./assets/index16.css";
+const ut = 1024;
+let ft = 0;
 class v {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = ut++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = ft++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -165,20 +165,20 @@ W.none = new W(
   8
   /* NodeFlag.Anonymous */
 );
-const fe = /* @__PURE__ */ new WeakMap(), Be = /* @__PURE__ */ new WeakMap();
+const ue = /* @__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 R {
+class V {
   /**
   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, f] of s)
-        this.props[typeof l == "number" ? l : l.id] = f;
+      for (let [l, u] of s)
+        this.props[typeof l == "number" ? l : l.id] = u;
     }
   }
   /**
@@ -209,8 +209,8 @@ class R {
   [`moveTo`](#common.TreeCursor.moveTo).
   */
   cursorAt(e, t = 0, n = 0) {
-    let r = fe.get(this) || this.topNode, s = new _e(r);
-    return s.moveTo(e, t), fe.set(this, s._tree), s;
+    let r = ue.get(this) || this.topNode, s = new _e(r);
+    return s.moveTo(e, t), ue.set(this, s._tree), s;
   }
   /**
   Get a [syntax node](#common.SyntaxNode) object for the top of the
@@ -231,8 +231,8 @@ class R {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let n = le(fe.get(this) || this.topNode, e, t, !1);
-    return fe.set(this, n), n;
+    let n = le(ue.get(this) || this.topNode, e, t, !1);
+    return ue.set(this, n), n;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -263,15 +263,15 @@ class R {
   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, f = (l & S.IncludeAnonymous) > 0;
+    let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, l = e.mode || 0, u = (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.from <= s && h.to >= r && (!u && h.type.isAnonymous || t(h) !== !1)) {
         if (h.firstChild())
           continue;
         C = !0;
       }
-      for (; C && n && (f || !h.type.isAnonymous) && n(h), !h.nextSibling(); ) {
+      for (; C && n && (u || !h.type.isAnonymous) && n(h), !h.nextSibling(); ) {
         if (!h.parent())
           return;
         C = !0;
@@ -303,7 +303,7 @@ class R {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    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)));
+    return this.children.length <= 8 ? this : we(W.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, r) => new V(this.type, t, n, r, this.propValues), e.makeTree || ((t, n, r) => new V(W.none, t, n, r)));
   }
   /**
   Build a tree from a postfix-ordered buffer of node information,
@@ -313,7 +313,7 @@ class R {
     return gt(e);
   }
 }
-R.empty = new R(W.none, [], [], 0);
+V.empty = new V(W.none, [], [], 0);
 class Ce {
   constructor(e, t) {
     this.buffer = e, this.index = t;
@@ -378,20 +378,20 @@ class q {
   @internal
   */
   findChild(e, t, n, r, s) {
-    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])
+    let { buffer: l } = this, u = -1;
+    for (let h = e; h != t && !(je(s, r, l[h + 1], l[h + 2]) && (u = h, n > 0)); h = l[h + 3])
       ;
-    return f;
+    return u;
   }
   /**
   @internal
   */
   slice(e, t, n) {
     let r = this.buffer, s = new Uint16Array(t - e), l = 0;
-    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);
+    for (let u = e, h = 0; u < t; ) {
+      s[h++] = r[u++], s[h++] = r[u++] - n;
+      let C = s[h++] = r[u++] - n;
+      s[h++] = r[u++] - e, l = Math.max(l, C);
     }
     return new q(s, l, this.set);
   }
@@ -421,8 +421,8 @@ function le(i, e, t, n) {
   }
   let s = n ? 0 : S.IgnoreOverlays;
   if (n)
-    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, u = l.parent; u; l = u, u = l.parent)
+      l instanceof O && l.index < 0 && ((r = u.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = u);
   for (; ; ) {
     let l = i.enter(e, t, s);
     if (!l)
@@ -482,8 +482,8 @@ class O extends He {
   }
   nextChild(e, t, n, r, s = 0) {
     for (let l = this; ; ) {
-      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;
+      for (let { children: u, positions: h } = l._tree, C = t > 0 ? u.length : -1; e != C; e += t) {
+        let k = u[e], N = h[e] + l.from;
         if (je(r, n, N, N + k.length)) {
           if (k instanceof q) {
             if (s & S.ExcludeBuffers)
@@ -495,8 +495,8 @@ class O extends He {
             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);
+            let E = new O(k, N, e, l);
+            return s & S.IncludeAnonymous || !E.type.isAnonymous ? E : E.nextChild(t < 0 ? k.children.length - 1 : 0, t, n, r);
           }
         }
       }
@@ -544,8 +544,8 @@ class O extends He {
     let r;
     if (!(n & S.IgnoreOverlays) && (r = ge.get(this._tree)) && r.overlay) {
       let s = e - this.from;
-      for (let { from: l, to: f } of r.overlay)
-        if ((t > 0 ? l <= s : l < s) && (t < 0 ? f >= s : f > s))
+      for (let { from: l, to: u } of r.overlay)
+        if ((t > 0 ? l <= s : l < s) && (t < 0 ? u >= s : u > s))
           return new O(r.tree, r.overlay[0].from + this.from, -1, this);
     }
     return this.nextChild(0, 1, e, t, n);
@@ -714,7 +714,7 @@ class F extends He {
       let l = n.buffer[this.index + 1];
       e.push(n.slice(r, s, l)), t.push(0);
     }
-    return new R(this.type, e, t, this.to - this.from);
+    return new V(this.type, e, t, this.to - this.from);
   }
   /**
   @internal
@@ -751,8 +751,8 @@ function pt(i, e, t) {
     } else {
       let l = ge.get(s.tree);
       if (l && l.overlay && l.overlay[0].from <= e && l.overlay[l.overlay.length - 1].to >= e) {
-        let f = new O(l.tree, l.overlay[0].from + s.from, -1, s);
-        (r || (r = [n])).push(le(f, e, t, !1));
+        let u = new O(l.tree, l.overlay[0].from + s.from, -1, s);
+        (r || (r = [n])).push(le(u, e, t, !1));
       }
     }
   return r ? Re(r) : n;
@@ -925,8 +925,8 @@ class _e {
     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 f = n._tree.children[s];
-          if (this.mode & S.IncludeAnonymous || f instanceof q || !f.type.isAnonymous || ke(f))
+          let u = n._tree.children[s];
+          if (this.mode & S.IncludeAnonymous || u instanceof q || !u.type.isAnonymous || ke(u))
             return !1;
         }
     return !0;
@@ -1059,13 +1059,13 @@ function ke(i) {
 }
 function gt(i) {
   var e;
-  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;
+  let { buffer: t, nodeSet: n, maxBufferLength: r = ut, reused: s = [], minRepeatType: l = n.types.length } = i, u = Array.isArray(t) ? new Ce(t, t.length) : t, h = n.types, C = 0, k = 0;
+  function N(g, b, f, y, p, m) {
+    let { id: c, start: d, end: _, size: x } = u, L = k;
     for (; x < 0; )
-      if (f.next(), x == -1) {
+      if (u.next(), x == -1) {
         let U = s[c];
-        u.push(U), y.push(d - g);
+        f.push(U), y.push(d - g);
         return;
       } else if (x == -3) {
         C = c;
@@ -1076,62 +1076,62 @@ function gt(i) {
       } else
         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);
+    if (_ - d <= r && (Z = z(u.pos - b, p))) {
+      let U = new Uint16Array(Z.size - Z.skip), B = u.pos - Z.size, P = U.length;
+      for (; u.pos > B; )
+        P = $(Z.start, U, P);
       te = new q(U, _ - Z.start, n), Ne = Z.start - g;
     } else {
-      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);
+      let U = u.pos - x;
+      u.next();
+      let B = [], P = [], Q = c >= l ? c : -1, ne = 0, oe = _;
+      for (; u.pos > U; )
+        Q >= 0 && u.id == Q && u.size >= 0 ? (u.end <= oe - r && (I(B, P, d, ne, u.end, oe, Q, L), ne = B.length, oe = u.end), u.next()) : m > 2500 ? A(d, U, B, P) : N(d, U, B, P, Q, m + 1);
+      if (Q >= 0 && ne > 0 && ne < B.length && I(B, P, d, ne, d, oe, Q, L), B.reverse(), P.reverse(), Q > -1 && ne > 0) {
+        let Se = E(X);
+        te = we(X, B, P, 0, B.length, 0, _ - d, Se, Se);
       } else
-        te = E(X, B, M, _ - d, L - _);
+        te = M(X, B, P, _ - d, L - _);
     }
-    u.push(te), y.push(Ne);
+    f.push(te), y.push(Ne);
   }
-  function A(g, b, u, y) {
+  function A(g, b, f, y) {
     let p = [], m = 0, c = -1;
-    for (; f.pos > b; ) {
-      let { id: d, start: _, end: x, size: L } = f;
+    for (; u.pos > b; ) {
+      let { id: d, start: _, end: x, size: L } = u;
       if (L > 4)
-        f.next();
+        u.next();
       else {
         if (c > -1 && _ < c)
           break;
-        c < 0 && (c = x - r), p.push(d, _, x), m++, f.next();
+        c < 0 && (c = x - r), p.push(d, _, x), m++, u.next();
       }
     }
     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);
+      f.push(new q(d, p[2] - _, n)), y.push(_ - g);
     }
   }
-  function z(g) {
-    return (b, u, y) => {
+  function E(g) {
+    return (b, f, y) => {
       let p = 0, m = b.length - 1, c, d;
-      if (m >= 0 && (c = b[m]) instanceof R) {
+      if (m >= 0 && (c = b[m]) instanceof V) {
         if (!m && c.type == g && c.length == y)
           return c;
-        (d = c.prop(v.lookAhead)) && (p = u[m] + c.length + d);
+        (d = c.prop(v.lookAhead)) && (p = f[m] + c.length + d);
       }
-      return E(g, b, u, y, p);
+      return M(g, b, f, y, p);
     };
   }
-  function I(g, b, u, y, p, m, c, d) {
+  function I(g, b, f, 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);
+      _.push(g.pop()), x.push(b.pop() + f - p);
+    g.push(M(n.types[c], _, x, m - p, d - m)), b.push(p - f);
   }
-  function E(g, b, u, y, p = 0, m) {
+  function M(g, b, f, y, p = 0, m) {
     if (C) {
       let c = [v.contextHash, C];
       m = m ? [c].concat(m) : [c];
@@ -1140,54 +1140,54 @@ function gt(i) {
       let c = [v.lookAhead, p];
       m = m ? [c].concat(m) : [c];
     }
-    return new R(g, b, u, y, m);
+    return new V(g, b, f, y, m);
   }
-  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 };
+  function z(g, b) {
+    let f = u.fork(), y = 0, p = 0, m = 0, c = f.end - r, d = { size: 0, start: 0, skip: 0 };
     e:
-      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();
+      for (let _ = f.pos - g; f.pos > _; ) {
+        let x = f.size;
+        if (f.id == b && x >= 0) {
+          d.size = y, d.start = p, d.skip = m, m += 4, y += 4, f.next();
           continue;
         }
-        let L = u.pos - x;
-        if (x < 0 || L < _ || u.start < c)
+        let L = f.pos - x;
+        if (x < 0 || L < _ || f.start < c)
           break;
-        let X = u.id >= l ? 4 : 0, te = u.start;
-        for (u.next(); u.pos > L; ) {
-          if (u.size < 0)
-            if (u.size == -3)
+        let X = f.id >= l ? 4 : 0, te = f.start;
+        for (f.next(); f.pos > L; ) {
+          if (f.size < 0)
+            if (f.size == -3)
               X += 4;
             else
               break e;
           else
-            u.id >= l && (X += 4);
-          u.next();
+            f.id >= l && (X += 4);
+          f.next();
         }
         p = te, y += x, m += X;
       }
     return (b < 0 || y == g) && (d.size = y, d.start = p, d.skip = m), d.size > 4 ? d : void 0;
   }
-  function $(g, b, u) {
-    let { id: y, start: p, end: m, size: c } = f;
-    if (f.next(), c >= 0 && y < l) {
-      let d = u;
+  function $(g, b, f) {
+    let { id: y, start: p, end: m, size: c } = u;
+    if (u.next(), c >= 0 && y < l) {
+      let d = f;
       if (c > 4) {
-        let _ = f.pos - (c - 4);
-        for (; f.pos > _; )
-          u = $(g, b, u);
+        let _ = u.pos - (c - 4);
+        for (; u.pos > _; )
+          f = $(g, b, f);
       }
-      b[--u] = d, b[--u] = m - g, b[--u] = p - g, b[--u] = y;
+      b[--f] = d, b[--f] = m - g, b[--f] = p - g, b[--f] = y;
     } else
       c == -3 ? C = y : c == -4 && (k = y);
-    return u;
+    return f;
   }
   let D = [], w = [];
-  for (; f.pos > 0; )
+  for (; u.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);
+  return new V(h[i.topID], D.reverse(), w.reverse(), J);
 }
 const ze = /* @__PURE__ */ new WeakMap();
 function de(i, e) {
@@ -1197,7 +1197,7 @@ function de(i, e) {
   if (t == null) {
     t = 1;
     for (let n of e.children) {
-      if (n.type != i || !(n instanceof R)) {
+      if (n.type != i || !(n instanceof V)) {
         t = 1;
         break;
       }
@@ -1207,7 +1207,7 @@ function de(i, e) {
   }
   return t;
 }
-function we(i, e, t, n, r, s, l, f, h) {
+function we(i, e, t, n, r, s, l, u, h) {
   let C = 0;
   for (let I = n; I < r; I++)
     C += de(i, e[I]);
@@ -1215,34 +1215,34 @@ function we(i, e, t, n, r, s, l, f, h) {
     C * 1.5 / 8
     /* Balance.BranchFactor */
   ), N = [], A = [];
-  function z(I, E, V, $, D) {
-    for (let w = V; w < $; ) {
-      let J = w, g = E[w], b = de(i, I[w]);
+  function E(I, M, z, $, D) {
+    for (let w = z; w < $; ) {
+      let J = w, g = M[w], b = de(i, I[w]);
       for (w++; w < $; w++) {
-        let u = de(i, I[w]);
-        if (b + u >= k)
+        let f = de(i, I[w]);
+        if (b + f >= k)
           break;
-        b += u;
+        b += f;
       }
       if (w == J + 1) {
         if (b > k) {
-          let u = I[J];
-          z(u.children, u.positions, 0, u.children.length, E[J] + D);
+          let f = I[J];
+          E(f.children, f.positions, 0, f.children.length, M[J] + D);
           continue;
         }
         N.push(I[J]);
       } else {
-        let u = E[w - 1] + I[w - 1].length - g;
-        N.push(we(i, I, E, J, w, g, u, null, h));
+        let f = M[w - 1] + I[w - 1].length - g;
+        N.push(we(i, I, M, J, w, g, f, null, h));
       }
       A.push(g + D - s);
     }
   }
-  return z(e, t, n, r, 0), (f || h)(N, A, l);
+  return E(e, t, n, r, 0), (u || h)(N, A, l);
 }
 new v({ perNode: !0 });
 let mt = 0;
-class H {
+class R {
   /**
   @internal
   */
@@ -1259,7 +1259,7 @@ 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 R([], null, []);
     if (t.set.push(t), e)
       for (let n of e.set)
         t.set.push(n);
@@ -1290,17 +1290,17 @@ class me {
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((f) => f.base == e && yt(t, f.modified));
+    let n = t[0].instances.find((u) => u.base == e && yt(t, u.modified));
     if (n)
       return n;
-    let r = [], s = new H(r, e, t);
-    for (let f of t)
-      f.instances.push(s);
+    let r = [], s = new R(r, e, t);
+    for (let u of t)
+      u.instances.push(s);
     let l = xt(t);
-    for (let f of e.set)
-      if (!f.modified.length)
+    for (let u of e.set)
+      if (!u.modified.length)
         for (let h of l)
-          r.push(me.get(f, h));
+          r.push(me.get(u, h));
     return s;
   }
 }
@@ -1327,8 +1327,8 @@ function _t(i, e) {
   return {
     style: (s) => {
       let l = r;
-      for (let f of s)
-        for (let h of f.set) {
+      for (let u of s)
+        for (let h of u.set) {
           let C = t[h.id];
           if (C) {
             l = l ? l + " " + C : C;
@@ -1340,23 +1340,23 @@ function _t(i, e) {
     scope: n
   };
 }
-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 = {
+const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K), ye = a(K), H = a(), Y = a(H), T = a(), j = a(), ve = a(), ie = a(ve), ce = a(), o = {
   /**
   A comment.
   */
-  comment: ue,
+  comment: fe,
   /**
   A line [comment](#highlight.tags.comment).
   */
-  lineComment: a(ue),
+  lineComment: a(fe),
   /**
   A block [comment](#highlight.tags.comment).
   */
-  blockComment: a(ue),
+  blockComment: a(fe),
   /**
   A documentation [comment](#highlight.tags.comment).
   */
-  docComment: a(ue),
+  docComment: a(fe),
   /**
   Any kind of identifier.
   */
@@ -1453,85 +1453,85 @@ const a = H.define, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   A language keyword.
   */
-  keyword: P,
+  keyword: T,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(P),
+  self: a(T),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(P),
+  null: a(T),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(P),
+  atom: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(P),
+  unit: a(T),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(P),
+  modifier: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(P),
+  operatorKeyword: a(T),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(P),
+  controlKeyword: a(T),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(P),
+  definitionKeyword: a(T),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(P),
+  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.
   */
@@ -1568,7 +1568,7 @@ const a = H.define, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   Content, for example plain text in XML or markup documents.
   */
-  content: j,
+  content: H,
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
@@ -1600,37 +1600,37 @@ const a = H.define, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   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, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   given element is being defined. Expected to be used with the
   various [name](#highlight.tags.name) tags.
   */
-  definition: H.defineModifier(),
+  definition: R.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: R.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: R.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: R.defineModifier(),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates a given
   [names](#highlight.tags.name) is local to some scope.
   */
-  local: H.defineModifier(),
+  local: R.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, ue = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   [variable name](#highlight.tags.variableName) tags, since those
   come up a lot.
   */
-  special: H.defineModifier()
+  special: R.defineModifier()
 };
 _t([
   { tag: o.link, class: "tok-link" },
@@ -1931,29 +1931,29 @@ const Mt = Et.exports, Pt = {
   emits: [se.ACTION, se.CHANGE],
   setup(i, { emit: e }) {
     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
+    }, l = re(() => i.langLabel ?? i.lang.toUpperCase()), u = re(() => i.variant === pe.INLINE), h = re(() => ({
+      "b-code-snippet--inline": u.value,
+      "b-code-snippet--scrollable": !u.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);
+    })), { loadLang: k } = Lt(i.lang), N = Ae(), A = Ae(), E = new be(), I = new be(), M = new be(), z = ae(null), $ = ae(0);
     $e(async () => {
       const g = await k();
-      V.value = i.content;
+      z.value = i.content;
       const b = ({ state: p }) => {
-        V.value = p.doc.toString();
-      }, u = [
+        z.value = p.doc.toString();
+      }, f = [
         Ue(),
         We.of([Ke]),
-        z.of(g()),
+        E.of(g()),
         I.of(At),
-        E.of(Le.readOnly.of(!i.editable)),
+        M.of(Le.readOnly.of(!i.editable)),
         Ie.updateListener.of((p) => b(p))
       ];
-      i.variant === "multiline" && u.push([Ge(), Fe()]);
+      i.variant === "multiline" && f.push([Ge(), Fe()]);
       const y = Le.create({
         doc: i.content,
-        extensions: [...u]
+        extensions: [...f]
       });
       $.value = y.doc.length, A.value = new Ie({
         state: y,
@@ -1962,21 +1962,23 @@ const Mt = Et.exports, Pt = {
     }), De(
       () => i.content,
       () => {
-        const g = i.content.length;
-        A.value.dispatch({
-          changes: {
-            from: 0,
-            to: $.value,
-            insert: i.content
-          }
-        }), $.value = g;
+        if (i.content !== z.value) {
+          const g = i.content.length;
+          A.value.dispatch({
+            changes: {
+              from: 0,
+              to: $.value,
+              insert: i.content
+            }
+          }), $.value = g;
+        }
       }
     );
     const D = re(() => t(i.actionableText)), w = () => {
-      e(se.ACTION, V.value);
+      e(se.ACTION, z.value);
     };
     Je(() => {
-      e(se.CHANGE, V.value);
+      z.value !== null && e(se.CHANGE, z.value);
     });
     const J = ae(!1);
     return {
@@ -1985,12 +1987,12 @@ const Mt = Et.exports, Pt = {
       codeAreaContentConditionalClasses: C,
       conditionalClasses: h,
       container: N,
-      currentContents: V,
+      currentContents: z,
       displayedLang: l,
       editor: A,
       selectedLanguage: n,
       showModal: J,
-      isInlineVariant: f,
+      isInlineVariant: u,
       // Methods
       handleChangeLanguage: s,
       onActionClicked: w,
@@ -2004,13 +2006,13 @@ var jt = function() {
   var e = this, t = e._self._c;
   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: "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) {
+  }, 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(), e.currentContents !== null ? t("copy", { staticClass: "b-structured-list__icon", attrs: { text: e.currentContents } }) : e._e(), 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() {
+  }, proxy: !0 }], null, !1, 4293069853) }) : e._e()], 1)]), e.content || e.editable ? 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), 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;
@@ -2023,7 +2025,7 @@ var jt = function() {
   Ht,
   !1,
   null,
-  "837f5e08",
+  "24e59c4c",
   null,
   null
 );