@adyen/bento-vue2 1.1.0 → 1.2.0

package/dist/code-snippet.js

@@ -7,14 +7,14 @@ import { json as qe } from "@codemirror/lang-json";
 import { xml as Xe } from "@codemirror/lang-xml";
 import { javascript as $e } from "@codemirror/lang-javascript";
 import { java as Ye } from "@codemirror/lang-java";
-import { B as Qe } from "./chunks/dropdown.e298bb6c.js";
-import { B as Ze, a as et } from "./chunks/button.f64585fc.js";
-import { B as tt, a as nt } from "./chunks/index.e1fcc9e0.js";
+import { B as Qe } from "./chunks/dropdown.368486b1.js";
+import { B as Ze, a as et } from "./chunks/button.c27a7ce2.js";
+import { B as tt, a as nt } from "./chunks/index.175f9e2d.js";
 import { u as rt } from "./chunks/i18n.155748d6.js";
-import { C as it } from "./chunks/copy.888486ff.js";
-import { b as st } from "./chunks/tooltip.1e7cda50.js";
+import { C as it } from "./chunks/copy.b62beae5.js";
+import { b as st } from "./chunks/tooltip.9af34fba.js";
 import { n as lt } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
-import "./assets/index23.css";
+import "./assets/index14.css";
 const ot = 1024;
 let at = 0;
 class _ {
@@ -262,15 +262,15 @@ class J {
   */
   iterate(e) {
     let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, l = e.mode || 0, h = (l & S.IncludeAnonymous) > 0;
-    for (let u = this.cursor(l | S.IncludeAnonymous); ; ) {
+    for (let f = this.cursor(l | S.IncludeAnonymous); ; ) {
       let x = !1;
-      if (u.from <= s && u.to >= r && (!h && u.type.isAnonymous || t(u) !== !1)) {
-        if (u.firstChild())
+      if (f.from <= s && f.to >= r && (!h && f.type.isAnonymous || t(f) !== !1)) {
+        if (f.firstChild())
           continue;
         x = !0;
       }
-      for (; x && n && (h || !u.type.isAnonymous) && n(u), !u.nextSibling(); ) {
-        if (!u.parent())
+      for (; x && n && (h || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
+        if (!f.parent())
           return;
         x = !0;
       }
@@ -377,7 +377,7 @@ class G {
   */
   findChild(e, t, n, r, s) {
     let { buffer: l } = this, h = -1;
-    for (let u = e; u != t && !(Te(s, r, l[u + 1], l[u + 2]) && (h = u, n > 0)); u = l[u + 3])
+    for (let f = e; f != t && !(Te(s, r, l[f + 1], l[f + 2]) && (h = f, n > 0)); f = l[f + 3])
       ;
     return h;
   }
@@ -386,10 +386,10 @@ class G {
   */
   slice(e, t, n) {
     let r = this.buffer, s = new Uint16Array(t - e), l = 0;
-    for (let h = e, u = 0; h < t; ) {
-      s[u++] = r[h++], s[u++] = r[h++] - n;
-      let x = s[u++] = r[h++] - n;
-      s[u++] = r[h++] - e, l = Math.max(l, x);
+    for (let h = e, f = 0; h < t; ) {
+      s[f++] = r[h++], s[f++] = r[h++] - n;
+      let x = s[f++] = r[h++] - n;
+      s[f++] = r[h++] - e, l = Math.max(l, x);
     }
     return new G(s, l, this.set);
   }
@@ -428,7 +428,7 @@ function se(i, e, t, n) {
     i = l;
   }
 }
-class Me {
+class je {
   cursor(e = 0) {
     return new xe(this, e);
   }
@@ -465,7 +465,7 @@ class Me {
     return this.parent;
   }
 }
-class z extends Me {
+class z extends je {
   constructor(e, t, n, r) {
     super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
   }
@@ -480,15 +480,15 @@ class z extends Me {
   }
   nextChild(e, t, n, r, s = 0) {
     for (let l = this; ; ) {
-      for (let { children: h, positions: u } = l._tree, x = t > 0 ? h.length : -1; e != x; e += t) {
-        let C = h[e], A = u[e] + l.from;
+      for (let { children: h, positions: f } = l._tree, x = t > 0 ? h.length : -1; e != x; e += t) {
+        let C = h[e], A = f[e] + l.from;
         if (Te(r, n, A, A + C.length)) {
           if (C instanceof G) {
             if (s & S.ExcludeBuffers)
               continue;
             let B = C.findChild(0, C.buffer.length, t, n - A, r);
             if (B > -1)
-              return new F(new ft(l, C, e, A), null, B);
+              return new F(new ut(l, C, e, A), null, B);
           } else if (s & S.IncludeAnonymous || !C.type.isAnonymous || Ce(C)) {
             let B;
             if (!(s & S.IgnoreMounts) && (B = ce.get(C)) && !B.overlay)
@@ -616,12 +616,12 @@ function ye(i, e, t = e.length - 1) {
   }
   return !0;
 }
-class ft {
+class ut {
   constructor(e, t, n, r) {
     this.parent = e, this.buffer = t, this.index = n, this.start = r;
   }
 }
-class F extends Me {
+class F extends je {
   get name() {
     return this.type.name;
   }
@@ -721,7 +721,7 @@ class F extends Me {
     return this.context.buffer.childString(this.index);
   }
 }
-function je(i) {
+function Me(i) {
   if (!i.length)
     return null;
   let e = 0, t = i[0];
@@ -730,14 +730,14 @@ function je(i) {
     (l.from > t.from || l.to < t.to) && (t = l, e = s);
   }
   let n = t instanceof z && t.index < 0 ? null : t.parent, r = i.slice();
-  return n ? r[e] = n : r.splice(e, 1), new ut(r, t);
+  return n ? r[e] = n : r.splice(e, 1), new ft(r, t);
 }
-class ut {
+class ft {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
   get next() {
-    return je(this.heads);
+    return Me(this.heads);
   }
 }
 function ct(i, e, t) {
@@ -753,7 +753,7 @@ function ct(i, e, t) {
         (r || (r = [n])).push(se(h, e, t, !1));
       }
     }
-  return r ? je(r) : n;
+  return r ? Me(r) : n;
 }
 class xe {
   /**
@@ -1057,13 +1057,13 @@ function Ce(i) {
 }
 function dt(i) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = ot, reused: s = [], minRepeatType: l = n.types.length } = i, h = Array.isArray(t) ? new _e(t, t.length) : t, u = n.types, x = 0, C = 0;
-  function A(m, p, f, k, b, g) {
+  let { buffer: t, nodeSet: n, maxBufferLength: r = ot, reused: s = [], minRepeatType: l = n.types.length } = i, h = Array.isArray(t) ? new _e(t, t.length) : t, f = n.types, x = 0, C = 0;
+  function A(m, p, u, k, b, g) {
     let { id: c, start: d, end: v, size: y } = h, I = C;
     for (; y < 0; )
       if (h.next(), y == -1) {
         let U = s[c];
-        f.push(U), k.push(d - m);
+        u.push(U), k.push(d - m);
         return;
       } else if (y == -3) {
         x = c;
@@ -1073,27 +1073,27 @@ function dt(i) {
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${y}`);
-    let q = u[c], Z, X, Ne = d - m;
-    if (v - d <= r && (X = ne(h.pos - p, b))) {
-      let U = new Uint16Array(X.size - X.skip), O = h.pos - X.size, M = U.length;
+    let q = f[c], ee, X, Ne = d - m;
+    if (v - d <= r && (X = re(h.pos - p, b))) {
+      let U = new Uint16Array(X.size - X.skip), O = h.pos - X.size, j = U.length;
       for (; h.pos > O; )
-        M = Q(X.start, U, M);
-      Z = new G(U, v - X.start, n), Ne = X.start - m;
+        j = Z(X.start, U, j);
+      ee = new G(U, v - X.start, n), Ne = X.start - m;
     } else {
       let U = h.pos - y;
       h.next();
-      let O = [], M = [], $ = c >= l ? c : -1, ee = 0, le = v;
+      let O = [], j = [], $ = c >= l ? c : -1, te = 0, le = v;
       for (; h.pos > U; )
-        $ >= 0 && h.id == $ && h.size >= 0 ? (h.end <= le - r && (w(O, M, d, ee, h.end, le, $, I), ee = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, M) : A(d, U, O, M, $, g + 1);
-      if ($ >= 0 && ee > 0 && ee < O.length && w(O, M, d, ee, d, le, $, I), O.reverse(), M.reverse(), $ > -1 && ee > 0) {
+        $ >= 0 && h.id == $ && h.size >= 0 ? (h.end <= le - r && (w(O, j, d, te, h.end, le, $, I), te = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, j) : A(d, U, O, j, $, g + 1);
+      if ($ >= 0 && te > 0 && te < O.length && w(O, j, d, te, d, le, $, I), O.reverse(), j.reverse(), $ > -1 && te > 0) {
         let Se = P(q);
-        Z = we(q, O, M, 0, O.length, 0, v - d, Se, Se);
+        ee = we(q, O, j, 0, O.length, 0, v - d, Se, Se);
       } else
-        Z = L(q, O, M, v - d, I - v);
+        ee = L(q, O, j, v - d, I - v);
     }
-    f.push(Z), k.push(Ne);
+    u.push(ee), k.push(Ne);
   }
-  function B(m, p, f, k) {
+  function B(m, p, u, k) {
     let b = [], g = 0, c = -1;
     for (; h.pos > p; ) {
       let { id: d, start: v, end: y, size: I } = h;
@@ -1109,27 +1109,27 @@ function dt(i) {
       let d = new Uint16Array(g * 4), v = b[b.length - 2];
       for (let y = b.length - 3, I = 0; y >= 0; y -= 3)
         d[I++] = b[y], d[I++] = b[y + 1] - v, d[I++] = b[y + 2] - v, d[I++] = I;
-      f.push(new G(d, b[2] - v, n)), k.push(v - m);
+      u.push(new G(d, b[2] - v, n)), k.push(v - m);
     }
   }
   function P(m) {
-    return (p, f, k) => {
+    return (p, u, k) => {
       let b = 0, g = p.length - 1, c, d;
       if (g >= 0 && (c = p[g]) instanceof J) {
         if (!g && c.type == m && c.length == k)
           return c;
-        (d = c.prop(_.lookAhead)) && (b = f[g] + c.length + d);
+        (d = c.prop(_.lookAhead)) && (b = u[g] + c.length + d);
       }
-      return L(m, p, f, k, b);
+      return L(m, p, u, k, b);
     };
   }
-  function w(m, p, f, k, b, g, c, d) {
+  function w(m, p, u, k, b, g, c, d) {
     let v = [], y = [];
     for (; m.length > k; )
-      v.push(m.pop()), y.push(p.pop() + f - b);
-    m.push(L(n.types[c], v, y, g - b, d - g)), p.push(b - f);
+      v.push(m.pop()), y.push(p.pop() + u - b);
+    m.push(L(n.types[c], v, y, g - b, d - g)), p.push(b - u);
   }
-  function L(m, p, f, k, b = 0, g) {
+  function L(m, p, u, k, b = 0, g) {
     if (x) {
       let c = [_.contextHash, x];
       g = g ? [c].concat(g) : [c];
@@ -1138,57 +1138,57 @@ function dt(i) {
       let c = [_.lookAhead, b];
       g = g ? [c].concat(g) : [c];
     }
-    return new J(m, p, f, k, g);
+    return new J(m, p, u, k, g);
   }
-  function ne(m, p) {
-    let f = h.fork(), k = 0, b = 0, g = 0, c = f.end - r, d = { size: 0, start: 0, skip: 0 };
+  function re(m, p) {
+    let u = h.fork(), k = 0, b = 0, g = 0, c = u.end - r, d = { size: 0, start: 0, skip: 0 };
     e:
-      for (let v = f.pos - m; f.pos > v; ) {
-        let y = f.size;
-        if (f.id == p && y >= 0) {
-          d.size = k, d.start = b, d.skip = g, g += 4, k += 4, f.next();
+      for (let v = u.pos - m; u.pos > v; ) {
+        let y = u.size;
+        if (u.id == p && y >= 0) {
+          d.size = k, d.start = b, d.skip = g, g += 4, k += 4, u.next();
           continue;
         }
-        let I = f.pos - y;
-        if (y < 0 || I < v || f.start < c)
+        let I = u.pos - y;
+        if (y < 0 || I < v || u.start < c)
           break;
-        let q = f.id >= l ? 4 : 0, Z = f.start;
-        for (f.next(); f.pos > I; ) {
-          if (f.size < 0)
-            if (f.size == -3)
+        let q = u.id >= l ? 4 : 0, ee = u.start;
+        for (u.next(); u.pos > I; ) {
+          if (u.size < 0)
+            if (u.size == -3)
               q += 4;
             else
               break e;
           else
-            f.id >= l && (q += 4);
-          f.next();
+            u.id >= l && (q += 4);
+          u.next();
         }
-        b = Z, k += y, g += q;
+        b = ee, k += y, g += q;
       }
     return (p < 0 || k == m) && (d.size = k, d.start = b, d.skip = g), d.size > 4 ? d : void 0;
   }
-  function Q(m, p, f) {
+  function Z(m, p, u) {
     let { id: k, start: b, end: g, size: c } = h;
     if (h.next(), c >= 0 && k < l) {
-      let d = f;
+      let d = u;
       if (c > 4) {
         let v = h.pos - (c - 4);
         for (; h.pos > v; )
-          f = Q(m, p, f);
+          u = Z(m, p, u);
       }
-      p[--f] = d, p[--f] = g - m, p[--f] = b - m, p[--f] = k;
+      p[--u] = d, p[--u] = g - m, p[--u] = b - m, p[--u] = k;
     } else
       c == -3 ? x = k : c == -4 && (C = k);
-    return f;
+    return u;
   }
   let E = [], N = [];
   for (; h.pos > 0; )
     A(i.start || 0, i.bufferStart || 0, E, N, -1, 0);
   let T = (e = i.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
-  return new J(u[i.topID], E.reverse(), N.reverse(), T);
+  return new J(f[i.topID], E.reverse(), N.reverse(), T);
 }
 const ze = /* @__PURE__ */ new WeakMap();
-function ue(i, e) {
+function fe(i, e) {
   if (!i.isAnonymous || e instanceof G || e.type != i)
     return 1;
   let t = ze.get(e);
@@ -1199,44 +1199,44 @@ function ue(i, e) {
         t = 1;
         break;
       }
-      t += ue(i, n);
+      t += fe(i, n);
     }
     ze.set(e, t);
   }
   return t;
 }
-function we(i, e, t, n, r, s, l, h, u) {
+function we(i, e, t, n, r, s, l, h, f) {
   let x = 0;
   for (let w = n; w < r; w++)
-    x += ue(i, e[w]);
+    x += fe(i, e[w]);
   let C = Math.ceil(
     x * 1.5 / 8
     /* Balance.BranchFactor */
   ), A = [], B = [];
-  function P(w, L, ne, Q, E) {
-    for (let N = ne; N < Q; ) {
-      let T = N, m = L[N], p = ue(i, w[N]);
-      for (N++; N < Q; N++) {
-        let f = ue(i, w[N]);
-        if (p + f >= C)
+  function P(w, L, re, Z, E) {
+    for (let N = re; N < Z; ) {
+      let T = N, m = L[N], p = fe(i, w[N]);
+      for (N++; N < Z; N++) {
+        let u = fe(i, w[N]);
+        if (p + u >= C)
           break;
-        p += f;
+        p += u;
       }
       if (N == T + 1) {
         if (p > C) {
-          let f = w[T];
-          P(f.children, f.positions, 0, f.children.length, L[T] + E);
+          let u = w[T];
+          P(u.children, u.positions, 0, u.children.length, L[T] + E);
           continue;
         }
         A.push(w[T]);
       } else {
-        let f = L[N - 1] + w[N - 1].length - m;
-        A.push(we(i, w, L, T, N, m, f, null, u));
+        let u = L[N - 1] + w[N - 1].length - m;
+        A.push(we(i, w, L, T, N, m, u, null, f));
       }
       B.push(m + E - s);
     }
   }
-  return P(e, t, n, r, 0), (h || u)(A, B, l);
+  return P(e, t, n, r, 0), (h || f)(A, B, l);
 }
 new _({ perNode: !0 });
 let pt = 0;
@@ -1297,8 +1297,8 @@ class de {
     let l = bt(t);
     for (let h of e.set)
       if (!h.modified.length)
-        for (let u of l)
-          r.push(de.get(h, u));
+        for (let f of l)
+          r.push(de.get(h, f));
     return s;
   }
 }
@@ -1326,8 +1326,8 @@ function yt(i, e) {
     style: (s) => {
       let l = r;
       for (let h of s)
-        for (let u of h.set) {
-          let x = t[u.id];
+        for (let f of h.set) {
+          let x = t[f.id];
           if (x) {
             l = l ? l + " " + x : x;
             break;
@@ -1338,7 +1338,7 @@ function yt(i, e) {
     scope: n
   };
 }
-const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K), be = a(K), H = a(), Y = a(H), j = a(), R = a(), ke = a(), re = a(ke), fe = a(), o = {
+const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K), be = a(K), H = a(), Y = a(H), M = a(), R = a(), ke = a(), ie = a(ke), ue = a(), o = {
   /**
   A comment.
   */
@@ -1451,45 +1451,45 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   A language keyword.
   */
-  keyword: j,
+  keyword: M,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(j),
+  self: a(M),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(j),
+  null: a(M),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(j),
+  atom: a(M),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(j),
+  unit: a(M),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(j),
+  modifier: a(M),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(j),
+  operatorKeyword: a(M),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(j),
+  controlKeyword: a(M),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(j),
+  definitionKeyword: a(M),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(j),
+  moduleKeyword: a(M),
   /**
   An operator.
   */
@@ -1542,27 +1542,27 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   Bracket-style [punctuation](#highlight.tags.punctuation).
   */
-  bracket: re,
+  bracket: ie,
   /**
   Angle [brackets](#highlight.tags.bracket) (usually `<` and `>`
   tokens).
   */
-  angleBracket: a(re),
+  angleBracket: a(ie),
   /**
   Square [brackets](#highlight.tags.bracket) (usually `[` and `]`
   tokens).
   */
-  squareBracket: a(re),
+  squareBracket: a(ie),
   /**
   Parentheses (usually `(` and `)` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  paren: a(re),
+  paren: a(ie),
   /**
   Braces (usually `{` and `}` tokens). Subtag of
   [bracket](#highlight.tags.bracket).
   */
-  brace: a(re),
+  brace: a(ie),
   /**
   Content, for example plain text in XML or markup documents.
   */
@@ -1648,22 +1648,22 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   /**
   Metadata or meta-instruction.
   */
-  meta: fe,
+  meta: ue,
   /**
   [Metadata](#highlight.tags.meta) that applies to the entire
   document.
   */
-  documentMeta: a(fe),
+  documentMeta: a(ue),
   /**
   [Metadata](#highlight.tags.meta) that annotates or adds
   attributes to a given syntactic element.
   */
-  annotation: a(fe),
+  annotation: a(ue),
   /**
   Processing instruction or preprocessor directive. Subtag of
   [meta](#highlight.tags.meta).
   */
-  processingInstruction: a(fe),
+  processingInstruction: a(ue),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that a
   given element is being defined. Expected to be used with the
@@ -1810,12 +1810,12 @@ const xt = "#c72727", kt = "#9b5700", vt = "#067934", _t = "#0063d7", Ct = {
     color: i.invalid
   }
 ]), Nt = Fe(wt(Ct));
-var ie = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(ie || {}), te = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(te || {}), ve = /* @__PURE__ */ ((i) => (i.ACTION = "action", i))(ve || {});
+var ne = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(ne || {}), Q = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(Q || {}), ve = /* @__PURE__ */ ((i) => (i.ACTION = "action", i))(ve || {});
 const St = {
-  [te.JSON]: qe,
-  [te.XML]: Xe,
-  [te.JAVASCRIPT]: $e,
-  [te.JAVA]: Ye
+  [Q.JSON]: qe,
+  [Q.XML]: Xe,
+  [Q.JAVASCRIPT]: $e,
+  [Q.JAVA]: Ye
 }, At = (i) => ({
   loadLang: async () => St[i]
 }), It = {
@@ -1838,14 +1838,16 @@ const St = {
      */
     variant: {
       type: String,
-      default: ie.MULTILINE
+      default: ne.MULTILINE,
+      validator: (i) => Object.values(ne).includes(i)
     },
     /**
      * Language name for syntax highlighting rules
      */
     lang: {
       type: String,
-      default: te.JSON
+      default: Q.JSON,
+      validator: (i) => Object.values(Q).includes(i)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1889,11 +1891,11 @@ const St = {
   setup(i, { emit: e }) {
     const { t } = rt(), n = pe(null), r = [], s = () => {
     }, l = ge(() => i.langLabel ?? i.lang.toUpperCase()), h = ge(() => ({
-      "b-code-snippet--inline": i.variant === ie.INLINE,
-      "b-code-snippet--scrollable": i.variant !== ie.INLINE
-    })), { loadLang: u } = At(i.lang), x = Ae(), C = Ae(), A = new me(), B = new me(), P = new me(), w = pe(""), L = pe(0);
+      "b-code-snippet--inline": i.variant === ne.INLINE,
+      "b-code-snippet--scrollable": i.variant !== ne.INLINE
+    })), { loadLang: f } = At(i.lang), x = Ae(), C = Ae(), A = new me(), B = new me(), P = new me(), w = pe(""), L = pe(0);
     He(async () => {
-      const E = await u();
+      const E = await f();
       w.value = i.content;
       const N = ({ state: p }) => {
         w.value = p.doc.toString();
@@ -1927,12 +1929,12 @@ const St = {
         }), L.value = E;
       }
     );
-    const ne = ge(() => t(i.actionableText));
+    const re = ge(() => t(i.actionableText));
     return {
       // Enums
       BentoTypographyElement: nt,
       BentoButtonVariant: et,
-      BentoCodeSnippetVariant: ie,
+      BentoCodeSnippetVariant: ne,
       // Values
       container: x,
       editor: C,
@@ -1943,7 +1945,7 @@ const St = {
       selectedLanguage: n,
       // Methods
       handleChangeLanguage: s,
-      runText: ne,
+      runText: re,
       onActionClicked: () => {
         e(ve.ACTION, w);
       }
@@ -1965,7 +1967,7 @@ var Lt = function() {
   Ot,
   !1,
   null,
-  "5cbac57a",
+  "5b8e340a",
   null,
   null
 );
@@ -1973,7 +1975,7 @@ const Xt = zt.exports;
 export {
   Xt as BentoCodeSnippet,
   ve as BentoCodeSnippetEvent,
-  te as BentoCodeSnippetSupportedLanguage,
-  ie as BentoCodeSnippetVariant
+  Q as BentoCodeSnippetSupportedLanguage,
+  ne as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map