@adyen/bento-vue2 1.0.0 → 1.1.0

package/dist/code-snippet.js

@@ -1,28 +1,28 @@
-import { defineComponent as He, ref as pe, computed as ge, shallowRef as Ae, onMounted as De, watch as Je } from "vue";
-import { highlightActiveLine as Ue, keymap as Ve, EditorView as Ie, lineNumbers as We } from "@codemirror/view";
+import { defineComponent as Re, ref as pe, computed as ge, shallowRef as Ae, onMounted as He, watch as De } from "vue";
+import { highlightActiveLine as Je, keymap as Ue, EditorView as Ie, lineNumbers as Ve } from "@codemirror/view";
 import { Compartment as me, EditorState as Be } from "@codemirror/state";
-import { indentWithTab as Ke, history as Fe } from "@codemirror/commands";
-import { syntaxHighlighting as Ge, HighlightStyle as qe } from "@codemirror/language";
-import { json as Xe } from "@codemirror/lang-json";
-import { xml as $e } from "@codemirror/lang-xml";
-import { javascript as Ye } from "@codemirror/lang-javascript";
-import { java as Qe } from "@codemirror/lang-java";
-import { B as Ze } from "./chunks/dropdown.45f3fad6.js";
-import { B as et, a as tt } from "./chunks/button.98f2271d.js";
-import { B as nt, c as rt } from "./chunks/index.3aedb3dd.js";
-import { u as it } from "./chunks/i18n.36074534.js";
-import { C as st } from "./chunks/copy.f260d8fc.js";
-import { b as lt } from "./chunks/tooltip.51be6248.js";
-import { n as ot } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
-import "./assets/index35.css";
-const at = 1024;
-let ht = 0;
-class C {
+import { indentWithTab as We, history as Ke } from "@codemirror/commands";
+import { syntaxHighlighting as Fe, HighlightStyle as Ge } from "@codemirror/language";
+import { json as qe } from "@codemirror/lang-json";
+import { xml as Xe } from "@codemirror/lang-xml";
+import { javascript as $e } from "@codemirror/lang-javascript";
+import { java as Ye } from "@codemirror/lang-java";
+import { B as Qe } from "./chunks/dropdown.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 { 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 { n as lt } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
+import "./assets/index23.css";
+const ot = 1024;
+let at = 0;
+class _ {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = ht++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = at++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -44,12 +44,17 @@ class C {
     };
   }
 }
-C.closedBy = new C({ deserialize: (i) => i.split(" ") });
-C.openedBy = new C({ deserialize: (i) => i.split(" ") });
-C.group = new C({ deserialize: (i) => i.split(" ") });
-C.contextHash = new C({ perNode: !0 });
-C.lookAhead = new C({ perNode: !0 });
-C.mounted = new C({ perNode: !0 });
+_.closedBy = new _({ deserialize: (i) => i.split(" ") });
+_.openedBy = new _({ deserialize: (i) => i.split(" ") });
+_.group = new _({ deserialize: (i) => i.split(" ") });
+_.isolate = new _({ deserialize: (i) => {
+  if (i && i != "rtl" && i != "ltr" && i != "auto")
+    throw new RangeError("Invalid value for isolate: " + i);
+  return i || "auto";
+} });
+_.contextHash = new _({ perNode: !0 });
+_.lookAhead = new _({ perNode: !0 });
+_.mounted = new _({ perNode: !0 });
 class ce {
   constructor(e, t, n) {
     this.tree = e, this.overlay = t, this.parser = n;
@@ -58,10 +63,10 @@ class ce {
   @internal
   */
   static get(e) {
-    return e && e.props && e.props[C.mounted.id];
+    return e && e.props && e.props[_.mounted.id];
   }
 }
-const ut = /* @__PURE__ */ Object.create(null);
+const ht = /* @__PURE__ */ Object.create(null);
 class V {
   /**
   @internal
@@ -73,7 +78,7 @@ class V {
   Define a node type.
   */
   static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : ut, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new V(e.name || "", t, e.id, n);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : ht, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new V(e.name || "", t, e.id, n);
     if (e.props) {
       for (let s of e.props)
         if (Array.isArray(s) || (s = s(r)), s) {
@@ -124,7 +129,7 @@ class V {
     if (typeof e == "string") {
       if (this.name == e)
         return !0;
-      let t = this.prop(C.group);
+      let t = this.prop(_.group);
       return t ? t.indexOf(e) > -1 : !1;
     }
     return this.id == e;
@@ -143,7 +148,7 @@ class V {
       for (let r of n.split(" "))
         t[r] = e[n];
     return (n) => {
-      for (let r = n.prop(C.group), s = -1; s < (r ? r.length : 0); s++) {
+      for (let r = n.prop(_.group), s = -1; s < (r ? r.length : 0); s++) {
         let l = t[s < 0 ? n.name : r[s]];
         if (l)
           return l;
@@ -246,7 +251,7 @@ class J {
   position.
   */
   resolveStack(e, t = 0) {
-    return dt(this, e, t);
+    return ct(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -257,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 f = this.cursor(l | S.IncludeAnonymous); ; ) {
+    for (let u = this.cursor(l | S.IncludeAnonymous); ; ) {
       let x = !1;
-      if (f.from <= s && f.to >= r && (!h && f.type.isAnonymous || t(f) !== !1)) {
-        if (f.firstChild())
+      if (u.from <= s && u.to >= r && (!h && u.type.isAnonymous || t(u) !== !1)) {
+        if (u.firstChild())
           continue;
         x = !0;
       }
-      for (; x && n && (h || !f.type.isAnonymous) && n(f), !f.nextSibling(); ) {
-        if (!f.parent())
+      for (; x && n && (h || !u.type.isAnonymous) && n(u), !u.nextSibling(); ) {
+        if (!u.parent())
           return;
         x = !0;
       }
@@ -303,7 +308,7 @@ class J {
   or a cursor over such a buffer.
   */
   static build(e) {
-    return pt(e);
+    return dt(e);
   }
 }
 J.empty = new J(V.none, [], [], 0);
@@ -372,7 +377,7 @@ class G {
   */
   findChild(e, t, n, r, s) {
     let { buffer: l } = this, h = -1;
-    for (let f = e; f != t && !(Me(s, r, l[f + 1], l[f + 2]) && (h = f, n > 0)); f = l[f + 3])
+    for (let u = e; u != t && !(Te(s, r, l[u + 1], l[u + 2]) && (h = u, n > 0)); u = l[u + 3])
       ;
     return h;
   }
@@ -381,15 +386,15 @@ class G {
   */
   slice(e, t, n) {
     let r = this.buffer, s = new Uint16Array(t - e), l = 0;
-    for (let h = e, f = 0; h < t; ) {
-      s[f++] = r[h++], s[f++] = r[h++] - n;
-      let x = s[f++] = r[h++] - n;
-      s[f++] = r[h++] - e, l = Math.max(l, x);
+    for (let 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);
     }
     return new G(s, l, this.set);
   }
 }
-function Me(i, e, t, n) {
+function Te(i, e, t, n) {
   switch (i) {
     case -2:
       return t < e;
@@ -423,7 +428,7 @@ function se(i, e, t, n) {
     i = l;
   }
 }
-class je {
+class Me {
   cursor(e = 0) {
     return new xe(this, e);
   }
@@ -460,7 +465,7 @@ class je {
     return this.parent;
   }
 }
-class z extends je {
+class z extends Me {
   constructor(e, t, n, r) {
     super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
   }
@@ -475,21 +480,21 @@ class z extends je {
   }
   nextChild(e, t, n, r, s = 0) {
     for (let l = this; ; ) {
-      for (let { children: h, positions: f } = l._tree, x = t > 0 ? h.length : -1; e != x; e += t) {
-        let _ = h[e], A = f[e] + l.from;
-        if (Me(r, n, A, A + _.length)) {
-          if (_ instanceof G) {
+      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;
+        if (Te(r, n, A, A + C.length)) {
+          if (C instanceof G) {
             if (s & S.ExcludeBuffers)
               continue;
-            let B = _.findChild(0, _.buffer.length, t, n - A, r);
+            let B = C.findChild(0, C.buffer.length, t, n - A, r);
             if (B > -1)
-              return new F(new ft(l, _, e, A), null, B);
-          } else if (s & S.IncludeAnonymous || !_.type.isAnonymous || Ce(_)) {
+              return new F(new ft(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(_)) && !B.overlay)
+            if (!(s & S.IgnoreMounts) && (B = ce.get(C)) && !B.overlay)
               return new z(B.tree, A, e, l);
-            let P = new z(_, A, e, l);
-            return s & S.IncludeAnonymous || !P.type.isAnonymous ? P : P.nextChild(t < 0 ? _.children.length - 1 : 0, t, n, r);
+            let P = new z(C, A, e, l);
+            return s & S.IncludeAnonymous || !P.type.isAnonymous ? P : P.nextChild(t < 0 ? C.children.length - 1 : 0, t, n, r);
           }
         }
       }
@@ -588,8 +593,8 @@ function Oe(i, e, t, n) {
   if (!r.firstChild())
     return s;
   if (t != null) {
-    for (; !r.type.is(t); )
-      if (!r.nextSibling())
+    for (let l = !1; !l; )
+      if (l = r.type.is(t), !r.nextSibling())
         return s;
   }
   for (; ; ) {
@@ -616,7 +621,7 @@ class ft {
     this.parent = e, this.buffer = t, this.index = n, this.start = r;
   }
 }
-class F extends je {
+class F extends Me {
   get name() {
     return this.type.name;
   }
@@ -716,7 +721,7 @@ class F extends je {
     return this.context.buffer.childString(this.index);
   }
 }
-function Re(i) {
+function je(i) {
   if (!i.length)
     return null;
   let e = 0, t = i[0];
@@ -725,17 +730,17 @@ function Re(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 ct(r, t);
+  return n ? r[e] = n : r.splice(e, 1), new ut(r, t);
 }
-class ct {
+class ut {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
   get next() {
-    return Re(this.heads);
+    return je(this.heads);
   }
 }
-function dt(i, e, t) {
+function ct(i, e, t) {
   let n = i.resolveInner(e, t), r = null;
   for (let s = n instanceof z ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
@@ -748,7 +753,7 @@ function dt(i, e, t) {
         (r || (r = [n])).push(se(h, e, t, !1));
       }
     }
-  return r ? Re(r) : n;
+  return r ? je(r) : n;
 }
 class xe {
   /**
@@ -1050,25 +1055,25 @@ class xe {
 function Ce(i) {
   return i.children.some((e) => e instanceof G || !e.type.isAnonymous || Ce(e));
 }
-function pt(i) {
+function dt(i) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = at, reused: s = [], minRepeatType: l = n.types.length } = i, h = Array.isArray(t) ? new _e(t, t.length) : t, f = n.types, x = 0, _ = 0;
-  function A(m, p, u, k, b, g) {
-    let { id: c, start: d, end: v, size: y } = h, I = _;
+  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 { id: c, start: d, end: v, size: y } = h, I = C;
     for (; y < 0; )
       if (h.next(), y == -1) {
         let U = s[c];
-        u.push(U), k.push(d - m);
+        f.push(U), k.push(d - m);
         return;
       } else if (y == -3) {
         x = c;
         return;
       } else if (y == -4) {
-        _ = c;
+        C = c;
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${y}`);
-    let q = f[c], Z, X, Ne = d - m;
+    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;
       for (; h.pos > O; )
@@ -1086,9 +1091,9 @@ function pt(i) {
       } else
         Z = L(q, O, M, v - d, I - v);
     }
-    u.push(Z), k.push(Ne);
+    f.push(Z), k.push(Ne);
   }
-  function B(m, p, u, k) {
+  function B(m, p, f, k) {
     let b = [], g = 0, c = -1;
     for (; h.pos > p; ) {
       let { id: d, start: v, end: y, size: I } = h;
@@ -1104,86 +1109,86 @@ function pt(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;
-      u.push(new G(d, b[2] - v, n)), k.push(v - m);
+      f.push(new G(d, b[2] - v, n)), k.push(v - m);
     }
   }
   function P(m) {
-    return (p, u, k) => {
+    return (p, f, 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(C.lookAhead)) && (b = u[g] + c.length + d);
+        (d = c.prop(_.lookAhead)) && (b = f[g] + c.length + d);
       }
-      return L(m, p, u, k, b);
+      return L(m, p, f, k, b);
     };
   }
-  function w(m, p, u, k, b, g, c, d) {
+  function w(m, p, f, k, b, g, c, d) {
     let v = [], y = [];
     for (; m.length > k; )
-      v.push(m.pop()), y.push(p.pop() + u - b);
-    m.push(L(n.types[c], v, y, g - b, d - g)), p.push(b - u);
+      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);
   }
-  function L(m, p, u, k, b = 0, g) {
+  function L(m, p, f, k, b = 0, g) {
     if (x) {
-      let c = [C.contextHash, x];
+      let c = [_.contextHash, x];
       g = g ? [c].concat(g) : [c];
     }
     if (b > 25) {
-      let c = [C.lookAhead, b];
+      let c = [_.lookAhead, b];
       g = g ? [c].concat(g) : [c];
     }
-    return new J(m, p, u, k, g);
+    return new J(m, p, f, k, g);
   }
   function ne(m, p) {
-    let u = h.fork(), k = 0, b = 0, g = 0, c = u.end - r, d = { size: 0, start: 0, skip: 0 };
+    let f = h.fork(), k = 0, b = 0, g = 0, c = f.end - r, d = { size: 0, start: 0, skip: 0 };
     e:
-      for (let v = u.pos - m; u.pos > v; ) {
-        let y = u.size;
-        if (u.id == p && y >= 0) {
-          d.size = k, d.start = b, d.skip = g, g += 4, k += 4, u.next();
+      for (let 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();
           continue;
         }
-        let I = u.pos - y;
-        if (y < 0 || I < v || u.start < c)
+        let I = f.pos - y;
+        if (y < 0 || I < v || f.start < c)
           break;
-        let q = u.id >= l ? 4 : 0, Z = u.start;
-        for (u.next(); u.pos > I; ) {
-          if (u.size < 0)
-            if (u.size == -3)
+        let q = f.id >= l ? 4 : 0, Z = f.start;
+        for (f.next(); f.pos > I; ) {
+          if (f.size < 0)
+            if (f.size == -3)
               q += 4;
             else
               break e;
           else
-            u.id >= l && (q += 4);
-          u.next();
+            f.id >= l && (q += 4);
+          f.next();
         }
         b = Z, 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, u) {
+  function Q(m, p, f) {
     let { id: k, start: b, end: g, size: c } = h;
     if (h.next(), c >= 0 && k < l) {
-      let d = u;
+      let d = f;
       if (c > 4) {
         let v = h.pos - (c - 4);
         for (; h.pos > v; )
-          u = Q(m, p, u);
+          f = Q(m, p, f);
       }
-      p[--u] = d, p[--u] = g - m, p[--u] = b - m, p[--u] = k;
+      p[--f] = d, p[--f] = g - m, p[--f] = b - m, p[--f] = k;
     } else
-      c == -3 ? x = k : c == -4 && (_ = k);
-    return u;
+      c == -3 ? x = k : c == -4 && (C = k);
+    return f;
   }
   let E = [], N = [];
   for (; h.pos > 0; )
     A(i.start || 0, i.bufferStart || 0, E, N, -1, 0);
   let T = (e = i.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
-  return new J(f[i.topID], E.reverse(), N.reverse(), T);
+  return new J(u[i.topID], E.reverse(), N.reverse(), T);
 }
 const ze = /* @__PURE__ */ new WeakMap();
-function fe(i, e) {
+function ue(i, e) {
   if (!i.isAnonymous || e instanceof G || e.type != i)
     return 1;
   let t = ze.get(e);
@@ -1194,53 +1199,53 @@ function fe(i, e) {
         t = 1;
         break;
       }
-      t += fe(i, n);
+      t += ue(i, n);
     }
     ze.set(e, t);
   }
   return t;
 }
-function we(i, e, t, n, r, s, l, h, f) {
+function we(i, e, t, n, r, s, l, h, u) {
   let x = 0;
   for (let w = n; w < r; w++)
-    x += fe(i, e[w]);
-  let _ = Math.ceil(
+    x += ue(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 = fe(i, w[N]);
+      let T = N, m = L[N], p = ue(i, w[N]);
       for (N++; N < Q; N++) {
-        let u = fe(i, w[N]);
-        if (p + u >= _)
+        let f = ue(i, w[N]);
+        if (p + f >= C)
           break;
-        p += u;
+        p += f;
       }
       if (N == T + 1) {
-        if (p > _) {
-          let u = w[T];
-          P(u.children, u.positions, 0, u.children.length, L[T] + E);
+        if (p > C) {
+          let f = w[T];
+          P(f.children, f.positions, 0, f.children.length, L[T] + E);
           continue;
         }
         A.push(w[T]);
       } else {
-        let u = L[N - 1] + w[N - 1].length - m;
-        A.push(we(i, w, L, T, N, m, u, null, f));
+        let f = L[N - 1] + w[N - 1].length - m;
+        A.push(we(i, w, L, T, N, m, f, null, u));
       }
       B.push(m + E - s);
     }
   }
-  return P(e, t, n, r, 0), (h || f)(A, B, l);
+  return P(e, t, n, r, 0), (h || u)(A, B, l);
 }
-new C({ perNode: !0 });
-let gt = 0;
+new _({ perNode: !0 });
+let pt = 0;
 class D {
   /**
   @internal
   */
   constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = gt++;
+    this.set = e, this.base = t, this.modified = n, this.id = pt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1275,40 +1280,40 @@ class D {
     return (t) => t.modified.indexOf(e) > -1 ? t : de.get(t.base || t, t.modified.concat(e).sort((n, r) => n.id - r.id));
   }
 }
-let mt = 0;
+let gt = 0;
 class de {
   constructor() {
-    this.instances = [], this.id = mt++;
+    this.instances = [], this.id = gt++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((h) => h.base == e && bt(t, h.modified));
+    let n = t[0].instances.find((h) => h.base == e && mt(t, h.modified));
     if (n)
       return n;
     let r = [], s = new D(r, e, t);
     for (let h of t)
       h.instances.push(s);
-    let l = yt(t);
+    let l = bt(t);
     for (let h of e.set)
       if (!h.modified.length)
-        for (let f of l)
-          r.push(de.get(h, f));
+        for (let u of l)
+          r.push(de.get(h, u));
     return s;
   }
 }
-function bt(i, e) {
+function mt(i, e) {
   return i.length == e.length && i.every((t, n) => t == e[n]);
 }
-function yt(i) {
+function bt(i) {
   let e = [[]];
   for (let t = 0; t < i.length; t++)
     for (let n = 0, r = e.length; n < r; n++)
       e.push(e[n].concat(i[t]));
   return e.sort((t, n) => n.length - t.length);
 }
-new C();
-function xt(i, e) {
+new _();
+function yt(i, e) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let s of i)
     if (!Array.isArray(s.tag))
@@ -1321,8 +1326,8 @@ function xt(i, e) {
     style: (s) => {
       let l = r;
       for (let h of s)
-        for (let f of h.set) {
-          let x = t[f.id];
+        for (let u of h.set) {
+          let x = t[u.id];
           if (x) {
             l = l ? l + " " + x : x;
             break;
@@ -1333,7 +1338,7 @@ function xt(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), ue = 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), j = a(), R = a(), ke = a(), re = a(ke), fe = a(), o = {
   /**
   A comment.
   */
@@ -1643,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: ue,
+  meta: fe,
   /**
   [Metadata](#highlight.tags.meta) that applies to the entire
   document.
   */
-  documentMeta: a(ue),
+  documentMeta: a(fe),
   /**
   [Metadata](#highlight.tags.meta) that annotates or adds
   attributes to a given syntactic element.
   */
-  annotation: a(ue),
+  annotation: a(fe),
   /**
   Processing instruction or preprocessor directive. Subtag of
   [meta](#highlight.tags.meta).
   */
-  processingInstruction: a(ue),
+  processingInstruction: a(fe),
   /**
   [Modifier](#highlight.Tag^defineModifier) that indicates that a
   given element is being defined. Expected to be used with the
@@ -1699,7 +1704,7 @@ const a = D.define, ae = a(), W = a(), Ee = a(W), Pe = a(W), K = a(), he = a(K),
   */
   special: D.defineModifier()
 };
-xt([
+yt([
   { tag: o.link, class: "tok-link" },
   { tag: o.heading, class: "tok-heading" },
   { tag: o.emphasis, class: "tok-emphasis" },
@@ -1731,13 +1736,13 @@ xt([
   { tag: o.invalid, class: "tok-invalid" },
   { tag: o.punctuation, class: "tok-punctuation" }
 ]);
-const kt = "#c72727", vt = "#9b5700", _t = "#067934", Ct = "#0063d7", wt = {
-  red: kt,
-  orange: vt,
-  green: _t,
-  blue: Ct,
+const xt = "#c72727", kt = "#9b5700", vt = "#067934", _t = "#0063d7", Ct = {
+  red: xt,
+  orange: kt,
+  green: vt,
+  blue: _t,
   invalid: "#ffffff"
-}, Nt = (i) => qe.define([
+}, wt = (i) => Ge.define([
   {
     tag: o.keyword,
     color: i.red
@@ -1804,30 +1809,29 @@ const kt = "#c72727", vt = "#9b5700", _t = "#067934", Ct = "#0063d7", wt = {
     tag: o.invalid,
     color: i.invalid
   }
-]), St = Ge(Nt(wt));
+]), 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 || {});
-const At = {
-  [te.JSON]: Xe,
-  [te.XML]: $e,
-  [te.JAVASCRIPT]: Ye,
-  [te.JAVA]: Qe
-}, It = (i) => ({
-  loadLang: async () => At[i]
-}), Te = {
+const St = {
+  [te.JSON]: qe,
+  [te.XML]: Xe,
+  [te.JAVASCRIPT]: $e,
+  [te.JAVA]: Ye
+}, At = (i) => ({
+  loadLang: async () => St[i]
+}), It = {
   "en-US": {
     run: "Run"
   }
-}, Bt = He({
-  i18n: { messages: Te },
+}, Bt = Re({
+  i18n: { messages: It },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: nt,
-    BentoButton: et,
-    BentoDropdown: Ze,
-    Copy: st
+    BentoTypography: tt,
+    BentoButton: Ze,
+    BentoDropdown: Qe,
+    Copy: it
   },
-  directives: { BentoTooltipDirective: lt },
-  inheritAttrs: !1,
+  directives: { BentoTooltipDirective: st },
   props: {
     /**
      * Defines the variant of code-snippet
@@ -1883,38 +1887,38 @@ const At = {
   },
   emits: [ve.ACTION],
   setup(i, { emit: e }) {
-    const { t } = it({ messages: Te }), n = pe(null), r = [], s = () => {
+    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: f } = It(i.lang), x = Ae(), _ = Ae(), A = new me(), B = new me(), P = new me(), w = pe(""), L = pe(0);
-    De(async () => {
-      const E = await f();
+    })), { loadLang: u } = 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();
       w.value = i.content;
       const N = ({ state: p }) => {
         w.value = p.doc.toString();
       }, T = [
-        Ue(),
-        Ve.of([Ke]),
+        Je(),
+        Ue.of([We]),
         A.of(E()),
-        B.of(St),
+        B.of(Nt),
         P.of(Be.readOnly.of(!i.editable)),
         Ie.updateListener.of((p) => N(p))
       ];
-      i.variant === "multiline" && T.push([We(), Fe()]);
+      i.variant === "multiline" && T.push([Ve(), Ke()]);
       const m = Be.create({
         doc: i.content,
         extensions: [...T]
       });
-      L.value = m.doc.length, _.value = new Ie({
+      L.value = m.doc.length, C.value = new Ie({
         state: m,
         parent: x.value
       });
-    }), Je(
+    }), De(
       () => i.content,
       () => {
         const E = i.content.length;
-        _.value.dispatch({
+        C.value.dispatch({
           changes: {
             from: 0,
             to: L.value,
@@ -1926,12 +1930,12 @@ const At = {
     const ne = ge(() => t(i.actionableText));
     return {
       // Enums
-      BentoTypographyElement: rt,
-      BentoButtonVariant: tt,
+      BentoTypographyElement: nt,
+      BentoButtonVariant: et,
       BentoCodeSnippetVariant: ie,
       // Values
       container: x,
-      editor: _,
+      editor: C,
       currentContents: w,
       conditionalClasses: h,
       availableLanguages: r,
@@ -1955,13 +1959,13 @@ var Lt = function() {
   }, proxy: !0 }], null, !1, 1705937272) }) : e._e()], 1)]) : e._e(), e.content ? t("code", { staticClass: "b-code-snippet__code-area" }, [t("div", { ref: "container", staticClass: "b-code-snippet__code-area-content" })]) : t("section", [e._t("empty-state", function() {
     return [t("div", { staticClass: "b-code-snippet__empty-state" }, [e._v("Nothing to show")])];
   })], 2)]);
-}, Ot = [], zt = /* @__PURE__ */ ot(
+}, Ot = [], zt = /* @__PURE__ */ lt(
   Bt,
   Lt,
   Ot,
   !1,
   null,
-  "6e2b2049",
+  "5cbac57a",
   null,
   null
 );