@adyen/bento-vue2 1.26.0 → 1.27.0

package/dist/code-snippet.js

@@ -1,30 +1,31 @@
-import { defineComponent as Ve, ref as ae, computed as re, shallowRef as Ae, onMounted as $e, watch as De, watchEffect as Je } from "vue";
+import { defineComponent as Ve, ref as ae, computed as re, shallowRef as Se, onMounted as $e, watch as De, watchEffect as Je } from "vue";
 import { highlightActiveLine as Ue, keymap as We, EditorView as Ie, lineNumbers as Ge } from "@codemirror/view";
 import { EditorSelection as Fe, Compartment as be, EditorState as Le } from "@codemirror/state";
 import { indentWithTab as Ke, history as qe } from "@codemirror/commands";
-import { syntaxHighlighting as Xe, HighlightStyle as Ze } from "@codemirror/language";
-import { B as Qe } from "./chunks/dropdown.10c034aa.js";
-import { a as Ye } from "./chunks/button.9d6435ae.js";
-import { B as et } from "./chunks/index.dd30e538.js";
+import { syntaxHighlighting as Xe, HighlightStyle as Ye } from "@codemirror/language";
+import { B as Ze } from "./chunks/dropdown.a8037bca.js";
+import { a as Qe } from "./chunks/button.cb90b55c.js";
+import { B as et } from "./chunks/index.e29a6907.js";
 import { BentoLoadingIndicator as tt } from "./loading-indicator.js";
 import { u as nt } from "./chunks/i18n.eb5b985b.js";
 import { n as He } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
-import { h as rt } from "./chunks/base-modal.1fff7abe.js";
-import { C as it } from "./chunks/copy.f85700c6.js";
+import { h as rt } from "./chunks/base-modal.4fb7528b.js";
+import { C as it } from "./chunks/copy.6808b2dc.js";
 import { json as st } from "@codemirror/lang-json";
 import { xml as lt } from "@codemirror/lang-xml";
 import { javascript as ot } from "@codemirror/lang-javascript";
 import { java as at } from "@codemirror/lang-java";
-import { b as ut } from "./chunks/tooltip.58ef3f4a.js";
-import "./assets/index9.css";
-const ft = 1024;
-let ht = 0;
+import { python as ut } from "@codemirror/lang-python";
+import { b as ft } from "./chunks/tooltip.efddb5f3.js";
+import "./assets/index10.css";
+const ht = 1024;
+let ct = 0;
 class v {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = ht++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = ct++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -68,7 +69,7 @@ class ge {
     return e && e.props && e.props[v.mounted.id];
   }
 }
-const ct = /* @__PURE__ */ Object.create(null);
+const dt = /* @__PURE__ */ Object.create(null);
 class W {
   /**
   @internal
@@ -80,7 +81,7 @@ class W {
   Define a node type.
   */
   static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : ct, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new W(e.name || "", t, e.id, n);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : dt, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new W(e.name || "", t, e.id, n);
     if (e.props) {
       for (let s of e.props)
         if (Array.isArray(s) || (s = s(r)), s) {
@@ -166,10 +167,10 @@ W.none = new W(
   /* NodeFlag.Anonymous */
 );
 const ue = /* @__PURE__ */ new WeakMap(), Be = /* @__PURE__ */ new WeakMap();
-var S;
+var A;
 (function(i) {
   i[i.ExcludeBuffers = 1] = "ExcludeBuffers", i[i.IncludeAnonymous = 2] = "IncludeAnonymous", i[i.IgnoreMounts = 4] = "IgnoreMounts", i[i.IgnoreOverlays = 8] = "IgnoreOverlays";
-})(S || (S = {}));
+})(A || (A = {}));
 class V {
   /**
   Construct a new tree. See also [`Tree.build`](#common.Tree^build).
@@ -253,7 +254,7 @@ class V {
   position.
   */
   resolveStack(e, t = 0) {
-    return gt(this, e, t);
+    return mt(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -263,8 +264,8 @@ class V {
   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, u = (l & S.IncludeAnonymous) > 0;
-    for (let h = this.cursor(l | S.IncludeAnonymous); ; ) {
+    let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, l = e.mode || 0, u = (l & A.IncludeAnonymous) > 0;
+    for (let h = this.cursor(l | A.IncludeAnonymous); ; ) {
       let k = !1;
       if (h.from <= s && h.to >= r && (!u && h.type.isAnonymous || t(h) !== !1)) {
         if (h.firstChild())
@@ -310,7 +311,7 @@ class V {
   or a cursor over such a buffer.
   */
   static build(e) {
-    return mt(e);
+    return bt(e);
   }
 }
 V.empty = new V(W.none, [], [], 0);
@@ -340,7 +341,7 @@ class ke {
     return new ke(this.buffer, this.index);
   }
 }
-class q {
+class X {
   /**
   Create a tree buffer.
   */
@@ -393,7 +394,7 @@ class q {
       let k = s[h++] = r[u++] - n;
       s[h++] = r[u++] - e, l = Math.max(l, k);
     }
-    return new q(s, l, this.set);
+    return new X(s, l, this.set);
   }
 }
 function Pe(i, e, t, n) {
@@ -419,7 +420,7 @@ function le(i, e, t, n) {
       return i;
     i = l;
   }
-  let s = n ? 0 : S.IgnoreOverlays;
+  let s = n ? 0 : A.IgnoreOverlays;
   if (n)
     for (let l = i, u = l.parent; u; l = u, u = l.parent)
       l instanceof E && l.index < 0 && ((r = u.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = u);
@@ -485,22 +486,22 @@ class E extends je {
       for (let { children: u, positions: h } = l._tree, k = t > 0 ? u.length : -1; e != k; e += t) {
         let C = u[e], N = h[e] + l.from;
         if (Pe(r, n, N, N + C.length)) {
-          if (C instanceof q) {
-            if (s & S.ExcludeBuffers)
+          if (C instanceof X) {
+            if (s & A.ExcludeBuffers)
               continue;
-            let A = C.findChild(0, C.buffer.length, t, n - N, r);
-            if (A > -1)
-              return new K(new dt(l, C, e, N), null, A);
-          } else if (s & S.IncludeAnonymous || !C.type.isAnonymous || Ce(C)) {
-            let A;
-            if (!(s & S.IgnoreMounts) && (A = ge.get(C)) && !A.overlay)
-              return new E(A.tree, N, e, l);
+            let S = C.findChild(0, C.buffer.length, t, n - N, r);
+            if (S > -1)
+              return new q(new pt(l, C, e, N), null, S);
+          } else if (s & A.IncludeAnonymous || !C.type.isAnonymous || Ce(C)) {
+            let S;
+            if (!(s & A.IgnoreMounts) && (S = ge.get(C)) && !S.overlay)
+              return new E(S.tree, N, e, l);
             let z = new E(C, N, e, l);
-            return s & S.IncludeAnonymous || !z.type.isAnonymous ? z : z.nextChild(t < 0 ? C.children.length - 1 : 0, t, n, r);
+            return s & A.IncludeAnonymous || !z.type.isAnonymous ? z : z.nextChild(t < 0 ? C.children.length - 1 : 0, t, n, r);
           }
         }
       }
-      if (s & S.IncludeAnonymous || !l.type.isAnonymous || (l.index >= 0 ? e = l.index + t : e = t < 0 ? -1 : l._parent._tree.children.length, l = l._parent, !l))
+      if (s & A.IncludeAnonymous || !l.type.isAnonymous || (l.index >= 0 ? e = l.index + t : e = t < 0 ? -1 : l._parent._tree.children.length, l = l._parent, !l))
         return null;
     }
   }
@@ -542,7 +543,7 @@ class E extends je {
   }
   enter(e, t, n = 0) {
     let r;
-    if (!(n & S.IgnoreOverlays) && (r = ge.get(this._tree)) && r.overlay) {
+    if (!(n & A.IgnoreOverlays) && (r = ge.get(this._tree)) && r.overlay) {
       let s = e - this.from;
       for (let { from: l, to: u } of r.overlay)
         if ((t > 0 ? l <= s : l < s) && (t < 0 ? u >= s : u > s))
@@ -618,12 +619,12 @@ function xe(i, e, t = e.length - 1) {
   }
   return !0;
 }
-class dt {
+class pt {
   constructor(e, t, n, r) {
     this.parent = e, this.buffer = t, this.index = n, this.start = r;
   }
 }
-class K extends je {
+class q extends je {
   get name() {
     return this.type.name;
   }
@@ -638,7 +639,7 @@ class K extends je {
   }
   child(e, t, n) {
     let { buffer: r } = this.context, s = r.findChild(this.index + 4, r.buffer[this.index + 3], e, t - this.context.start, n);
-    return s < 0 ? null : new K(this.context, this, s);
+    return s < 0 ? null : new q(this.context, this, s);
   }
   get firstChild() {
     return this.child(
@@ -673,10 +674,10 @@ class K extends je {
     );
   }
   enter(e, t, n = 0) {
-    if (n & S.ExcludeBuffers)
+    if (n & A.ExcludeBuffers)
       return null;
     let { buffer: r } = this.context, s = r.findChild(this.index + 4, r.buffer[this.index + 3], t > 0 ? 1 : -1, e - this.context.start, t);
-    return s < 0 ? null : new K(this.context, this, s);
+    return s < 0 ? null : new q(this.context, this, s);
   }
   get parent() {
     return this._parent || this.context.parent.nextSignificantParent();
@@ -692,11 +693,11 @@ class K extends je {
   }
   get nextSibling() {
     let { buffer: e } = this.context, t = e.buffer[this.index + 3];
-    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new K(this.context, this._parent, t) : this.externalSibling(1);
+    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new q(this.context, this._parent, t) : this.externalSibling(1);
   }
   get prevSibling() {
     let { buffer: e } = this.context, t = this._parent ? this._parent.index + 4 : 0;
-    return this.index == t ? this.externalSibling(-1) : new K(this.context, this._parent, e.findChild(
+    return this.index == t ? this.externalSibling(-1) : new q(this.context, this._parent, e.findChild(
       t,
       this.index,
       -1,
@@ -732,9 +733,9 @@ function Re(i) {
     (l.from > t.from || l.to < t.to) && (t = l, e = s);
   }
   let n = t instanceof E && t.index < 0 ? null : t.parent, r = i.slice();
-  return n ? r[e] = n : r.splice(e, 1), new pt(r, t);
+  return n ? r[e] = n : r.splice(e, 1), new gt(r, t);
 }
-class pt {
+class gt {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
@@ -742,7 +743,7 @@ class pt {
     return Re(this.heads);
   }
 }
-function gt(i, e, t) {
+function mt(i, e, t) {
   let n = i.resolveInner(e, t), r = null;
   for (let s = n instanceof E ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
@@ -859,17 +860,17 @@ class _e {
   set to false.
   */
   enter(e, t, n = this.mode) {
-    return this.buffer ? n & S.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+    return this.buffer ? n & A.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
   }
   /**
   Move to the node's parent node, if this isn't the top node.
   */
   parent() {
     if (!this.buffer)
-      return this.yieldNode(this.mode & S.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+      return this.yieldNode(this.mode & A.IncludeAnonymous ? this._tree._parent : this._tree.parent);
     if (this.stack.length)
       return this.yieldBuf(this.stack.pop());
-    let e = this.mode & S.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    let e = this.mode & A.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
     return this.buffer = null, this.yieldNode(e);
   }
   /**
@@ -926,7 +927,7 @@ class _e {
       if (t > -1)
         for (let s = t + e, l = e < 0 ? -1 : n._tree.children.length; s != l; s += e) {
           let u = n._tree.children[s];
-          if (this.mode & S.IncludeAnonymous || u instanceof q || !u.type.isAnonymous || Ce(u))
+          if (this.mode & A.IncludeAnonymous || u instanceof X || !u.type.isAnonymous || Ce(u))
             return !1;
         }
     return !0;
@@ -998,8 +999,8 @@ class _e {
           r = this.stack[--s];
         }
     for (let r = n; r < this.stack.length; r++)
-      t = new K(this.buffer, t, this.stack[r]);
-    return this.bufferNode = new K(this.buffer, t, this.index);
+      t = new q(this.buffer, t, this.stack[r]);
+    return this.bufferNode = new q(this.buffer, t, this.index);
   }
   /**
   Get the [tree](#common.Tree) that represents the current node, if
@@ -1055,11 +1056,11 @@ class _e {
   }
 }
 function Ce(i) {
-  return i.children.some((e) => e instanceof q || !e.type.isAnonymous || Ce(e));
+  return i.children.some((e) => e instanceof X || !e.type.isAnonymous || Ce(e));
 }
-function mt(i) {
+function bt(i) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = ft, reused: s = [], minRepeatType: l = n.types.length } = i, u = Array.isArray(t) ? new ke(t, t.length) : t, h = n.types, k = 0, C = 0;
+  let { buffer: t, nodeSet: n, maxBufferLength: r = ht, reused: s = [], minRepeatType: l = n.types.length } = i, u = Array.isArray(t) ? new ke(t, t.length) : t, h = n.types, k = 0, C = 0;
   function N(g, b, f, y, p, m) {
     let { id: c, start: d, end: _, size: x } = u, L = C;
     for (; x < 0; )
@@ -1075,27 +1076,27 @@ function mt(i) {
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${x}`);
-    let X = h[c], te, Z, Ne = d - g;
+    let Y = h[c], te, Z, Ne = d - g;
     if (_ - d <= r && (Z = O(u.pos - b, p))) {
       let U = new Uint16Array(Z.size - Z.skip), B = u.pos - Z.size, T = U.length;
       for (; u.pos > B; )
         T = $(Z.start, U, T);
-      te = new q(U, _ - Z.start, n), Ne = Z.start - g;
+      te = new X(U, _ - Z.start, n), Ne = Z.start - g;
     } else {
       let U = u.pos - x;
       u.next();
       let B = [], T = [], 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, T, d, ne, u.end, oe, Q, L), ne = B.length, oe = u.end), u.next()) : m > 2500 ? A(d, U, B, T) : N(d, U, B, T, Q, m + 1);
+        Q >= 0 && u.id == Q && u.size >= 0 ? (u.end <= oe - r && (I(B, T, d, ne, u.end, oe, Q, L), ne = B.length, oe = u.end), u.next()) : m > 2500 ? S(d, U, B, T) : N(d, U, B, T, Q, m + 1);
       if (Q >= 0 && ne > 0 && ne < B.length && I(B, T, d, ne, d, oe, Q, L), B.reverse(), T.reverse(), Q > -1 && ne > 0) {
-        let Se = z(X);
-        te = we(X, B, T, 0, B.length, 0, _ - d, Se, Se);
+        let Ae = z(Y);
+        te = we(Y, B, T, 0, B.length, 0, _ - d, Ae, Ae);
       } else
-        te = M(X, B, T, _ - d, L - _);
+        te = M(Y, B, T, _ - d, L - _);
     }
     f.push(te), y.push(Ne);
   }
-  function A(g, b, f, y) {
+  function S(g, b, f, y) {
     let p = [], m = 0, c = -1;
     for (; u.pos > b; ) {
       let { id: d, start: _, end: x, size: L } = u;
@@ -1111,7 +1112,7 @@ function mt(i) {
       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;
-      f.push(new q(d, p[2] - _, n)), y.push(_ - g);
+      f.push(new X(d, p[2] - _, n)), y.push(_ - g);
     }
   }
   function z(g) {
@@ -1154,18 +1155,18 @@ function mt(i) {
         let L = f.pos - x;
         if (x < 0 || L < _ || f.start < c)
           break;
-        let X = f.id >= l ? 4 : 0, te = f.start;
+        let Y = f.id >= l ? 4 : 0, te = f.start;
         for (f.next(); f.pos > L; ) {
           if (f.size < 0)
             if (f.size == -3)
-              X += 4;
+              Y += 4;
             else
               break e;
           else
-            f.id >= l && (X += 4);
+            f.id >= l && (Y += 4);
           f.next();
         }
-        p = te, y += x, m += X;
+        p = te, y += x, m += Y;
       }
     return (b < 0 || y == g) && (d.size = y, d.start = p, d.skip = m), d.size > 4 ? d : void 0;
   }
@@ -1191,7 +1192,7 @@ function mt(i) {
 }
 const Oe = /* @__PURE__ */ new WeakMap();
 function de(i, e) {
-  if (!i.isAnonymous || e instanceof q || e.type != i)
+  if (!i.isAnonymous || e instanceof X || e.type != i)
     return 1;
   let t = Oe.get(e);
   if (t == null) {
@@ -1214,7 +1215,7 @@ function we(i, e, t, n, r, s, l, u, h) {
   let C = Math.ceil(
     k * 1.5 / 8
     /* Balance.BranchFactor */
-  ), N = [], A = [];
+  ), N = [], S = [];
   function z(I, M, O, $, D) {
     for (let w = O; w < $; ) {
       let J = w, g = M[w], b = de(i, I[w]);
@@ -1235,19 +1236,19 @@ function we(i, e, t, n, r, s, l, u, 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);
+      S.push(g + D - s);
     }
   }
-  return z(e, t, n, r, 0), (u || h)(N, A, l);
+  return z(e, t, n, r, 0), (u || h)(N, S, l);
 }
 new v({ perNode: !0 });
-let bt = 0;
+let yt = 0;
 class R {
   /**
   @internal
   */
   constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = bt++;
+    this.set = e, this.base = t, this.modified = n, this.id = yt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1282,21 +1283,21 @@ class R {
     return (t) => t.modified.indexOf(e) > -1 ? t : me.get(t.base || t, t.modified.concat(e).sort((n, r) => n.id - r.id));
   }
 }
-let yt = 0;
+let xt = 0;
 class me {
   constructor() {
-    this.instances = [], this.id = yt++;
+    this.instances = [], this.id = xt++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((u) => u.base == e && xt(t, u.modified));
+    let n = t[0].instances.find((u) => u.base == e && _t(t, u.modified));
     if (n)
       return n;
     let r = [], s = new R(r, e, t);
     for (let u of t)
       u.instances.push(s);
-    let l = _t(t);
+    let l = vt(t);
     for (let u of e.set)
       if (!u.modified.length)
         for (let h of l)
@@ -1304,10 +1305,10 @@ class me {
     return s;
   }
 }
-function xt(i, e) {
+function _t(i, e) {
   return i.length == e.length && i.every((t, n) => t == e[n]);
 }
-function _t(i) {
+function vt(i) {
   let e = [[]];
   for (let t = 0; t < i.length; t++)
     for (let n = 0, r = e.length; n < r; n++)
@@ -1315,7 +1316,7 @@ function _t(i) {
   return e.sort((t, n) => n.length - t.length);
 }
 new v();
-function vt(i, e) {
+function kt(i, e) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let s of i)
     if (!Array.isArray(s.tag))
@@ -1340,7 +1341,7 @@ function vt(i, e) {
     scope: n
   };
 }
-const a = R.define, fe = a(), G = a(), ze = a(G), Me = a(G), F = a(), he = a(F), ye = a(F), j = a(), Y = a(j), H = a(), P = a(), ve = a(), ie = a(ve), ce = a(), o = {
+const a = R.define, fe = a(), G = a(), ze = a(G), Me = a(G), F = a(), he = a(F), ye = a(F), j = a(), ee = a(j), H = a(), P = a(), ve = a(), ie = a(ve), ce = a(), o = {
   /**
   A comment.
   */
@@ -1572,31 +1573,31 @@ const a = R.define, fe = a(), G = a(), ze = a(G), Me = a(G), F = a(), he = a(F),
   /**
   [Content](#highlight.tags.content) that represents a heading.
   */
-  heading: Y,
+  heading: ee,
   /**
   A level 1 [heading](#highlight.tags.heading).
   */
-  heading1: a(Y),
+  heading1: a(ee),
   /**
   A level 2 [heading](#highlight.tags.heading).
   */
-  heading2: a(Y),
+  heading2: a(ee),
   /**
   A level 3 [heading](#highlight.tags.heading).
   */
-  heading3: a(Y),
+  heading3: a(ee),
   /**
   A level 4 [heading](#highlight.tags.heading).
   */
-  heading4: a(Y),
+  heading4: a(ee),
   /**
   A level 5 [heading](#highlight.tags.heading).
   */
-  heading5: a(Y),
+  heading5: a(ee),
   /**
   A level 6 [heading](#highlight.tags.heading).
   */
-  heading6: a(Y),
+  heading6: a(ee),
   /**
   A prose separator (such as a horizontal rule).
   */
@@ -1706,7 +1707,7 @@ const a = R.define, fe = a(), G = a(), ze = a(G), Me = a(G), F = a(), he = a(F),
   */
   special: R.defineModifier()
 };
-vt([
+kt([
   { tag: o.link, class: "tok-link" },
   { tag: o.heading, class: "tok-heading" },
   { tag: o.emphasis, class: "tok-emphasis" },
@@ -1738,13 +1739,13 @@ vt([
   { tag: o.invalid, class: "tok-invalid" },
   { tag: o.punctuation, class: "tok-punctuation" }
 ]);
-const kt = "#c72727", Ct = "#9b5700", wt = "#067934", Nt = "#0063d7", St = {
-  red: kt,
-  orange: Ct,
-  green: wt,
-  blue: Nt,
+const Ct = "#c72727", wt = "#9b5700", Nt = "#067934", At = "#0063d7", St = {
+  red: Ct,
+  orange: wt,
+  green: Nt,
+  blue: At,
   invalid: "#ffffff"
-}, At = (i) => Ze.define([
+}, It = (i) => Ye.define([
   {
     tag: o.keyword,
     color: i.red
@@ -1811,22 +1812,23 @@ const kt = "#c72727", Ct = "#9b5700", wt = "#067934", Nt = "#0063d7", St = {
     tag: o.invalid,
     color: i.invalid
   }
-]), It = Xe(At(St));
-var pe = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(pe || {}), ee = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(ee || {}), se = /* @__PURE__ */ ((i) => (i.ACTION = "action", i.CHANGE = "change", i))(se || {});
-const Lt = {
-  [ee.JSON]: st,
-  [ee.XML]: lt,
-  [ee.JAVASCRIPT]: ot,
-  [ee.JAVA]: at
-}, Bt = (i) => async () => Lt[i], Et = (i, e) => {
+]), Lt = Xe(It(St));
+var pe = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(pe || {}), K = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i.PYTHON = "python", i))(K || {}), se = /* @__PURE__ */ ((i) => (i.ACTION = "action", i.CHANGE = "change", i))(se || {});
+const Bt = {
+  [K.JSON]: st,
+  [K.XML]: lt,
+  [K.JAVASCRIPT]: ot,
+  [K.JAVA]: at,
+  [K.PYTHON]: ut
+}, Et = (i) => async () => Bt[i], Ot = (i, e) => {
   const t = i.doc.lineAt(e.from), n = /^\s*/.exec(t.text);
   return n ? n[0] : "";
-}, Ot = {
+}, zt = {
   key: "Enter",
   run: ({ state: i, dispatch: e }) => {
     const t = i.changeByRange((n) => {
       const s = `
-${Et(i, n)}`;
+${Ot(i, n)}`;
       return {
         changes: { from: n.from, to: n.to, insert: s },
         range: Fe.cursor(n.from + s.length)
@@ -1836,42 +1838,42 @@ ${Et(i, n)}`;
   }
 };
 let Te = 0;
-const zt = {
+const Mt = {
   beforeCreate() {
     this.uuid = Te.toString(), Te += 1;
   }
 };
-var Mt = function() {
+var Tt = function() {
   var e = this, t = e._self._c;
   return t("svg", e._b({ staticClass: "ui-assets-icons-16", attrs: { role: "img", xmlns: "http://www.w3.org/2000/svg", width: "16", height: "16", fill: "none" } }, "svg", e.$attrs, !1), [e.$attrs["svg-title"] ? t("title", [e._v(e._s(e.$attrs["svg-title"]))]) : e._e(), t("path", { attrs: { fill: "#00112C", d: "M14.75 1.25V6.75H13.25V3.81083L10.0001 7.06072L8.93945 6.00006L12.1895 2.75H9.25V1.25H14.75Z" } }), t("path", { attrs: { fill: "#00112C", d: "M2.75 12.1895V9.25H1.25V14.75H6.75V13.25H3.81083L7.06072 10.0001L6.00006 8.93945L2.75 12.1895Z" } })]);
-}, Tt = [], Ht = /* @__PURE__ */ He(
-  zt,
+}, Ht = [], Pt = /* @__PURE__ */ He(
   Mt,
   Tt,
+  Ht,
   !1,
   null,
   null,
   null,
   null
 );
-const Pt = Ht.exports, jt = {
+const jt = Pt.exports, Rt = {
   "en-US": {
     run: "Run",
     expand: "Expand"
   }
-}, Rt = Ve({
-  i18n: { messages: jt },
+}, Vt = Ve({
+  i18n: { messages: Rt },
   name: "bento-code-snippet",
   components: {
     BentoTypography: et,
-    BentoButton: Ye,
-    BentoDropdown: Qe,
+    BentoButton: Qe,
+    BentoDropdown: Ze,
     Copy: it,
     BaseModal: rt,
     BentoLoadingIndicator: tt,
-    ExpandIcon: Pt
+    ExpandIcon: jt
   },
-  directives: { BentoTooltipDirective: ut },
+  directives: { BentoTooltipDirective: ft },
   props: {
     /**
      * Defines the variant of code-snippet
@@ -1886,8 +1888,8 @@ const Pt = Ht.exports, jt = {
      */
     lang: {
       type: String,
-      default: ee.JSON,
-      validator: (i) => Object.values(ee).includes(i)
+      default: K.JSON,
+      validator: (i) => Object.values(K).includes(i)
     },
     /**
      * Label to show in the action-bar, describing the language
@@ -1950,7 +1952,7 @@ const Pt = Ht.exports, jt = {
       "b-code-snippet--scrollable": !u.value
     })), k = re(() => ({
       "b-code-snippet__code-area-content--editable": i.editable
-    })), C = Bt(i.lang), N = Ae(), A = Ae(), z = new be(), I = new be(), M = new be(), O = ae(null), $ = ae(0);
+    })), C = Et(i.lang), N = Se(), S = Se(), z = new be(), I = new be(), M = new be(), O = ae(null), $ = ae(0);
     $e(async () => {
       const g = await C();
       O.value = i.content;
@@ -1958,9 +1960,9 @@ const Pt = Ht.exports, jt = {
         O.value = p.doc.toString();
       }, f = [
         Ue(),
-        We.of([Ke, Ot]),
+        We.of([Ke, zt]),
         z.of(g()),
-        I.of(It),
+        I.of(Lt),
         M.of(Le.readOnly.of(!i.editable)),
         Ie.updateListener.of((p) => b(p))
       ];
@@ -1969,7 +1971,7 @@ const Pt = Ht.exports, jt = {
         doc: i.content,
         extensions: [...f]
       });
-      $.value = y.doc.length, A.value = new Ie({
+      $.value = y.doc.length, S.value = new Ie({
         state: y,
         parent: N.value
       });
@@ -1978,7 +1980,7 @@ const Pt = Ht.exports, jt = {
       () => {
         if (i.content !== O.value) {
           const g = i.content.length;
-          A.value.dispatch({
+          S.value.dispatch({
             changes: {
               from: 0,
               to: $.value,
@@ -2003,7 +2005,7 @@ const Pt = Ht.exports, jt = {
       container: N,
       currentContents: O,
       displayedLang: l,
-      editor: A,
+      editor: S,
       selectedLanguage: n,
       showModal: J,
       isInlineVariant: u,
@@ -2016,7 +2018,7 @@ const Pt = Ht.exports, jt = {
     };
   }
 });
-var Vt = function() {
+var $t = 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;
@@ -2033,21 +2035,21 @@ var Vt = function() {
   } }, scopedSlots: e._u([{ key: "content", fn: function() {
     return [t("bento-code-snippet", e._b({}, "bento-code-snippet", { ...e.$props, expandable: !1 }, !1))];
   }, proxy: !0 }], null, !1, 3343589027) }) : e._e()], 1);
-}, $t = [], Dt = /* @__PURE__ */ He(
-  Rt,
+}, Dt = [], Jt = /* @__PURE__ */ He(
   Vt,
   $t,
+  Dt,
   !1,
   null,
   "befa6cc9",
   null,
   null
 );
-const an = Dt.exports;
+const fn = Jt.exports;
 export {
-  an as BentoCodeSnippet,
+  fn as BentoCodeSnippet,
   se as BentoCodeSnippetEvent,
-  ee as BentoCodeSnippetSupportedLanguage,
+  K as BentoCodeSnippetSupportedLanguage,
   pe as BentoCodeSnippetVariant
 };
 //# sourceMappingURL=code-snippet.js.map