@adyen/bento-vue3 1.0.0 → 1.1.0

package/dist/code-snippet.js

@@ -7,14 +7,14 @@ import { json as ut } from "@codemirror/lang-json";
 import { xml as ft } from "@codemirror/lang-xml";
 import { javascript as ct } from "@codemirror/lang-javascript";
 import { java as dt } from "@codemirror/lang-java";
-import { B as pt } from "./chunks/dropdown.751d23b5.js";
-import { B as gt, a as mt } from "./chunks/button.51be5335.js";
-import { B as bt, c as yt } from "./chunks/index.1d501e31.js";
-import { u as xt } from "./chunks/i18n.3619d46c.js";
-import { C as kt } from "./chunks/copy.92d2d21c.js";
-import { b as vt } from "./chunks/tooltip.68fc3821.js";
+import { B as pt } from "./chunks/dropdown.374481a8.js";
+import { B as gt, a as mt } from "./chunks/button.4ccc3a72.js";
+import { B as bt, a as yt } from "./chunks/index.92f7d550.js";
+import { b as xt } from "./chunks/tooltip.ca53a83a.js";
+import { u as kt } from "./chunks/i18n.6c402773.js";
+import { C as vt } from "./chunks/copy.012e43f2.js";
 import { _ as wt } from "./chunks/_plugin-vue_export-helper.dad06003.js";
-import "./assets/index26.css";
+import "./assets/index13.css";
 const Ct = 1024;
 let _t = 0;
 class C {
@@ -44,9 +44,14 @@ 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.closedBy = new C({ deserialize: (r) => r.split(" ") });
+C.openedBy = new C({ deserialize: (r) => r.split(" ") });
+C.group = new C({ deserialize: (r) => r.split(" ") });
+C.isolate = new C({ deserialize: (r) => {
+  if (r && r != "rtl" && r != "ltr" && r != "auto")
+    throw new RangeError("Invalid value for isolate: " + r);
+  return r || "auto";
+} });
 C.contextHash = new C({ perNode: !0 });
 C.lookAhead = new C({ perNode: !0 });
 C.mounted = new C({ perNode: !0 });
@@ -66,23 +71,23 @@ class J {
   /**
   @internal
   */
-  constructor(e, t, n, r = 0) {
-    this.name = e, this.props = t, this.id = n, this.flags = r;
+  constructor(e, t, n, i = 0) {
+    this.name = e, this.props = t, this.id = n, this.flags = i;
   }
   /**
   Define a node type.
   */
   static define(e) {
-    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Nt, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), r = new J(e.name || "", t, e.id, n);
+    let t = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : Nt, n = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), i = new J(e.name || "", t, e.id, n);
     if (e.props) {
       for (let s of e.props)
-        if (Array.isArray(s) || (s = s(r)), s) {
+        if (Array.isArray(s) || (s = s(i)), s) {
           if (s[0].perNode)
             throw new RangeError("Can't store a per-node prop on a node type");
           t[s[0].id] = s[1];
         }
     }
-    return r;
+    return i;
   }
   /**
   Retrieves a node prop for this type. Will return `undefined` if
@@ -140,11 +145,11 @@ class J {
   static match(e) {
     let t = /* @__PURE__ */ Object.create(null);
     for (let n in e)
-      for (let r of n.split(" "))
-        t[r] = e[n];
+      for (let i of n.split(" "))
+        t[i] = e[n];
     return (n) => {
-      for (let r = n.prop(C.group), s = -1; s < (r ? r.length : 0); s++) {
-        let o = t[s < 0 ? n.name : r[s]];
+      for (let i = n.prop(C.group), s = -1; s < (i ? i.length : 0); s++) {
+        let o = t[s < 0 ? n.name : i[s]];
         if (o)
           return o;
       }
@@ -160,15 +165,15 @@ J.none = new J(
 );
 const ue = /* @__PURE__ */ new WeakMap(), He = /* @__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";
+(function(r) {
+  r[r.ExcludeBuffers = 1] = "ExcludeBuffers", r[r.IncludeAnonymous = 2] = "IncludeAnonymous", r[r.IgnoreMounts = 4] = "IgnoreMounts", r[r.IgnoreOverlays = 8] = "IgnoreOverlays";
 })(S || (S = {}));
 class D {
   /**
   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) {
+  constructor(e, t, n, i, s) {
+    if (this.type = e, this.children = t, this.positions = n, this.length = i, this.props = null, s && s.length) {
       this.props = /* @__PURE__ */ Object.create(null);
       for (let [o, h] of s)
         this.props[typeof o == "number" ? o : o.id] = h;
@@ -183,8 +188,8 @@ class D {
       return e.tree.toString();
     let t = "";
     for (let n of this.children) {
-      let r = n.toString();
-      r && (t && (t += ","), t += r);
+      let i = n.toString();
+      i && (t && (t += ","), t += i);
     }
     return this.type.name ? (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (t.length ? "(" + t + ")" : "") : t;
   }
@@ -202,7 +207,7 @@ class D {
   [`moveTo`](#common.TreeCursor.moveTo).
   */
   cursorAt(e, t = 0, n = 0) {
-    let r = ue.get(this) || this.topNode, s = new Se(r);
+    let i = ue.get(this) || this.topNode, s = new Se(i);
     return s.moveTo(e, t), ue.set(this, s._tree), s;
   }
   /**
@@ -256,10 +261,10 @@ class D {
   not have its children iterated over (or `leave` called).
   */
   iterate(e) {
-    let { enter: t, leave: n, from: r = 0, to: s = this.length } = e, o = e.mode || 0, h = (o & S.IncludeAnonymous) > 0;
+    let { enter: t, leave: n, from: i = 0, to: s = this.length } = e, o = e.mode || 0, h = (o & S.IncludeAnonymous) > 0;
     for (let f = this.cursor(o | S.IncludeAnonymous); ; ) {
       let y = !1;
-      if (f.from <= s && f.to >= r && (!h && f.type.isAnonymous || t(f) !== !1)) {
+      if (f.from <= s && f.to >= i && (!h && f.type.isAnonymous || t(f) !== !1)) {
         if (f.firstChild())
           continue;
         y = !0;
@@ -296,7 +301,7 @@ class D {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : Oe(J.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, r) => new D(this.type, t, n, r, this.propValues), e.makeTree || ((t, n, r) => new D(J.none, t, n, r)));
+    return this.children.length <= 8 ? this : Oe(J.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, i) => new D(this.type, t, n, i, this.propValues), e.makeTree || ((t, n, i) => new D(J.none, t, n, i)));
   }
   /**
   Build a tree from a postfix-ordered buffer of node information,
@@ -359,8 +364,8 @@ class G {
   @internal
   */
   childString(e) {
-    let t = this.buffer[e], n = this.buffer[e + 3], r = this.set.types[t], s = r.name;
-    if (/\W/.test(s) && !r.isError && (s = JSON.stringify(s)), e += 4, n == e)
+    let t = this.buffer[e], n = this.buffer[e + 3], i = this.set.types[t], s = i.name;
+    if (/\W/.test(s) && !i.isError && (s = JSON.stringify(s)), e += 4, n == e)
       return s;
     let o = [];
     for (; e < n; )
@@ -370,9 +375,9 @@ class G {
   /**
   @internal
   */
-  findChild(e, t, n, r, s) {
+  findChild(e, t, n, i, s) {
     let { buffer: o } = this, h = -1;
-    for (let f = e; f != t && !(Ke(s, r, o[f + 1], o[f + 2]) && (h = f, n > 0)); f = o[f + 3])
+    for (let f = e; f != t && !(Ke(s, i, o[f + 1], o[f + 2]) && (h = f, n > 0)); f = o[f + 3])
       ;
     return h;
   }
@@ -380,17 +385,17 @@ class G {
   @internal
   */
   slice(e, t, n) {
-    let r = this.buffer, s = new Uint16Array(t - e), o = 0;
+    let i = this.buffer, s = new Uint16Array(t - e), o = 0;
     for (let h = e, f = 0; h < t; ) {
-      s[f++] = r[h++], s[f++] = r[h++] - n;
-      let y = s[f++] = r[h++] - n;
-      s[f++] = r[h++] - e, o = Math.max(o, y);
+      s[f++] = i[h++], s[f++] = i[h++] - n;
+      let y = s[f++] = i[h++] - n;
+      s[f++] = i[h++] - e, o = Math.max(o, y);
     }
     return new G(s, o, this.set);
   }
 }
-function Ke(i, e, t, n) {
-  switch (i) {
+function Ke(r, e, t, n) {
+  switch (r) {
     case -2:
       return t < e;
     case -1:
@@ -405,22 +410,22 @@ function Ke(i, e, t, n) {
       return !0;
   }
 }
-function oe(i, e, t, n) {
-  for (var r; i.from == i.to || (t < 1 ? i.from >= e : i.from > e) || (t > -1 ? i.to <= e : i.to < e); ) {
-    let o = !n && i instanceof z && i.index < 0 ? null : i.parent;
+function oe(r, e, t, n) {
+  for (var i; r.from == r.to || (t < 1 ? r.from >= e : r.from > e) || (t > -1 ? r.to <= e : r.to < e); ) {
+    let o = !n && r instanceof z && r.index < 0 ? null : r.parent;
     if (!o)
-      return i;
-    i = o;
+      return r;
+    r = o;
   }
   let s = n ? 0 : S.IgnoreOverlays;
   if (n)
-    for (let o = i, h = o.parent; h; o = h, h = o.parent)
-      o instanceof z && o.index < 0 && ((r = h.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != o.from && (i = h);
+    for (let o = r, h = o.parent; h; o = h, h = o.parent)
+      o instanceof z && o.index < 0 && ((i = h.enter(e, t, s)) === null || i === void 0 ? void 0 : i.from) != o.from && (r = h);
   for (; ; ) {
-    let o = i.enter(e, t, s);
+    let o = r.enter(e, t, s);
     if (!o)
-      return i;
-    i = o;
+      return r;
+    r = o;
   }
 }
 class Ge {
@@ -428,8 +433,8 @@ class Ge {
     return new Se(this, e);
   }
   getChild(e, t = null, n = null) {
-    let r = De(this, e, t, n);
-    return r.length ? r[0] : null;
+    let i = De(this, e, t, n);
+    return i.length ? i[0] : null;
   }
   getChildren(e, t = null, n = null) {
     return De(this, e, t, n);
@@ -446,10 +451,10 @@ class Ge {
   enterUnfinishedNodesBefore(e) {
     let t = this.childBefore(e), n = this;
     for (; t; ) {
-      let r = t.lastChild;
-      if (!r || r.to != t.to)
+      let i = t.lastChild;
+      if (!i || i.to != t.to)
         break;
-      r.type.isError && r.from == r.to ? (n = t, t = r.prevSibling) : t = r;
+      i.type.isError && i.from == i.to ? (n = t, t = i.prevSibling) : t = i;
     }
     return n;
   }
@@ -461,8 +466,8 @@ class Ge {
   }
 }
 class z extends Ge {
-  constructor(e, t, n, r) {
-    super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
+  constructor(e, t, n, i) {
+    super(), this._tree = e, this.from = t, this.index = n, this._parent = i;
   }
   get type() {
     return this._tree.type;
@@ -473,15 +478,15 @@ class z extends Ge {
   get to() {
     return this.from + this._tree.length;
   }
-  nextChild(e, t, n, r, s = 0) {
+  nextChild(e, t, n, i, s = 0) {
     for (let o = this; ; ) {
       for (let { children: h, positions: f } = o._tree, y = t > 0 ? h.length : -1; e != y; e += t) {
         let x = h[e], A = f[e] + o.from;
-        if (Ke(r, n, A, A + x.length)) {
+        if (Ke(i, n, A, A + x.length)) {
           if (x instanceof G) {
             if (s & S.ExcludeBuffers)
               continue;
-            let B = x.findChild(0, x.buffer.length, t, n - A, r);
+            let B = x.findChild(0, x.buffer.length, t, n - A, i);
             if (B > -1)
               return new K(new St(o, x, e, A), null, B);
           } else if (s & S.IncludeAnonymous || !x.type.isAnonymous || Le(x)) {
@@ -489,7 +494,7 @@ class z extends Ge {
             if (!(s & S.IgnoreMounts) && (B = me.get(x)) && !B.overlay)
               return new z(B.tree, A, e, o);
             let T = new z(x, A, e, o);
-            return s & S.IncludeAnonymous || !T.type.isAnonymous ? T : T.nextChild(t < 0 ? x.children.length - 1 : 0, t, n, r);
+            return s & S.IncludeAnonymous || !T.type.isAnonymous ? T : T.nextChild(t < 0 ? x.children.length - 1 : 0, t, n, i);
           }
         }
       }
@@ -534,12 +539,12 @@ class z extends Ge {
     );
   }
   enter(e, t, n = 0) {
-    let r;
-    if (!(n & S.IgnoreOverlays) && (r = me.get(this._tree)) && r.overlay) {
+    let i;
+    if (!(n & S.IgnoreOverlays) && (i = me.get(this._tree)) && i.overlay) {
       let s = e - this.from;
-      for (let { from: o, to: h } of r.overlay)
+      for (let { from: o, to: h } of i.overlay)
         if ((t > 0 ? o <= s : o < s) && (t < 0 ? h >= s : h > s))
-          return new z(r.tree, r.overlay[0].from + this.from, -1, this);
+          return new z(i.tree, i.overlay[0].from + this.from, -1, this);
     }
     return this.nextChild(0, 1, e, t, n);
   }
@@ -583,24 +588,24 @@ class z extends Ge {
     return this._tree.toString();
   }
 }
-function De(i, e, t, n) {
-  let r = i.cursor(), s = [];
-  if (!r.firstChild())
+function De(r, e, t, n) {
+  let i = r.cursor(), s = [];
+  if (!i.firstChild())
     return s;
   if (t != null) {
-    for (; !r.type.is(t); )
-      if (!r.nextSibling())
+    for (let o = !1; !o; )
+      if (o = i.type.is(t), !i.nextSibling())
         return s;
   }
   for (; ; ) {
-    if (n != null && r.type.is(n))
+    if (n != null && i.type.is(n))
       return s;
-    if (r.type.is(e) && s.push(r.node), !r.nextSibling())
+    if (i.type.is(e) && s.push(i.node), !i.nextSibling())
       return n == null ? s : [];
   }
 }
-function Ne(i, e, t = e.length - 1) {
-  for (let n = i.parent; t >= 0; n = n.parent) {
+function Ne(r, e, t = e.length - 1) {
+  for (let n = r.parent; t >= 0; n = n.parent) {
     if (!n)
       return !1;
     if (!n.type.isAnonymous) {
@@ -612,8 +617,8 @@ function Ne(i, e, t = e.length - 1) {
   return !0;
 }
 class St {
-  constructor(e, t, n, r) {
-    this.parent = e, this.buffer = t, this.index = n, this.start = r;
+  constructor(e, t, n, i) {
+    this.parent = e, this.buffer = t, this.index = n, this.start = i;
   }
 }
 class K extends Ge {
@@ -630,7 +635,7 @@ class K extends Ge {
     super(), this.context = e, this._parent = t, this.index = n, this.type = e.buffer.set.types[e.buffer.buffer[n]];
   }
   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);
+    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, n);
     return s < 0 ? null : new K(this.context, this, s);
   }
   get firstChild() {
@@ -668,7 +673,7 @@ class K extends Ge {
   enter(e, t, n = 0) {
     if (n & S.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);
+    let { buffer: i } = this.context, s = i.findChild(this.index + 4, i.buffer[this.index + 3], t > 0 ? 1 : -1, e - this.context.start, t);
     return s < 0 ? null : new K(this.context, this, s);
   }
   get parent() {
@@ -702,10 +707,10 @@ class K extends Ge {
     return null;
   }
   toTree() {
-    let e = [], t = [], { buffer: n } = this.context, r = this.index + 4, s = n.buffer[this.index + 3];
-    if (s > r) {
+    let e = [], t = [], { buffer: n } = this.context, i = this.index + 4, s = n.buffer[this.index + 3];
+    if (s > i) {
       let o = n.buffer[this.index + 1];
-      e.push(n.slice(r, s, o)), t.push(0);
+      e.push(n.slice(i, s, o)), t.push(0);
     }
     return new D(this.type, e, t, this.to - this.from);
   }
@@ -716,16 +721,16 @@ class K extends Ge {
     return this.context.buffer.childString(this.index);
   }
 }
-function qe(i) {
-  if (!i.length)
+function qe(r) {
+  if (!r.length)
     return null;
-  let e = 0, t = i[0];
-  for (let s = 1; s < i.length; s++) {
-    let o = i[s];
+  let e = 0, t = r[0];
+  for (let s = 1; s < r.length; s++) {
+    let o = r[s];
     (o.from > t.from || o.to < t.to) && (t = o, 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 At(r, t);
+  let n = t instanceof z && t.index < 0 ? null : t.parent, i = r.slice();
+  return n ? i[e] = n : i.splice(e, 1), new At(i, t);
 }
 class At {
   constructor(e, t) {
@@ -735,20 +740,20 @@ class At {
     return qe(this.heads);
   }
 }
-function It(i, e, t) {
-  let n = i.resolveInner(e, t), r = null;
+function It(r, e, t) {
+  let n = r.resolveInner(e, t), i = null;
   for (let s = n instanceof z ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
       let o = s.parent;
-      (r || (r = [n])).push(o.resolve(e, t)), s = o;
+      (i || (i = [n])).push(o.resolve(e, t)), s = o;
     } else {
       let o = me.get(s.tree);
       if (o && o.overlay && o.overlay[0].from <= e && o.overlay[o.overlay.length - 1].to >= e) {
         let h = new z(o.tree, o.overlay[0].from + s.from, -1, s);
-        (r || (r = [n])).push(oe(h, e, t, !1));
+        (i || (i = [n])).push(oe(h, e, t, !1));
       }
     }
-  return r ? qe(r) : n;
+  return i ? qe(i) : n;
 }
 class Se {
   /**
@@ -775,8 +780,8 @@ class Se {
   }
   yieldBuf(e, t) {
     this.index = e;
-    let { start: n, buffer: r } = this.buffer;
-    return this.type = t || r.set.types[r.buffer[e]], this.from = n + r.buffer[e + 1], this.to = n + r.buffer[e + 2], !0;
+    let { start: n, buffer: i } = this.buffer;
+    return this.type = t || i.set.types[i.buffer[e]], this.from = n + i.buffer[e + 1], this.to = n + i.buffer[e + 2], !0;
   }
   /**
   @internal
@@ -796,7 +801,7 @@ class Se {
   enterChild(e, t, n) {
     if (!this.buffer)
       return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, n, this.mode));
-    let { buffer: r } = this.buffer, s = r.findChild(this.index + 4, r.buffer[this.index + 3], e, t - this.buffer.start, n);
+    let { buffer: i } = this.buffer, s = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.buffer.start, n);
     return s < 0 ? !1 : (this.stack.push(this.index), this.yieldBuf(s));
   }
   /**
@@ -873,10 +878,10 @@ class Se {
       return this._tree._parent ? this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + e, e, 0, 4, this.mode)) : !1;
     let { buffer: t } = this.buffer, n = this.stack.length - 1;
     if (e < 0) {
-      let r = n < 0 ? 0 : this.stack[n] + 4;
-      if (this.index != r)
+      let i = n < 0 ? 0 : this.stack[n] + 4;
+      if (this.index != i)
         return this.yieldBuf(t.findChild(
-          r,
+          i,
           this.index,
           -1,
           0,
@@ -884,9 +889,9 @@ class Se {
           /* Side.DontCare */
         ));
     } else {
-      let r = t.buffer[this.index + 3];
-      if (r < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3]))
-        return this.yieldBuf(r);
+      let i = t.buffer[this.index + 3];
+      if (i < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3]))
+        return this.yieldBuf(i);
     }
     return n < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
   }
@@ -903,16 +908,16 @@ class Se {
     return this.sibling(-1);
   }
   atLastNode(e) {
-    let t, n, { buffer: r } = this;
-    if (r) {
+    let t, n, { buffer: i } = this;
+    if (i) {
       if (e > 0) {
-        if (this.index < r.buffer.buffer.length)
+        if (this.index < i.buffer.buffer.length)
           return !1;
       } else
         for (let s = 0; s < this.index; s++)
-          if (r.buffer.buffer[s + 3] < this.index)
+          if (i.buffer.buffer[s + 3] < this.index)
             return !1;
-      ({ index: t, parent: n } = r);
+      ({ index: t, parent: n } = i);
     } else
       ({ index: t, _parent: n } = this._tree);
     for (; n; { index: t, _parent: n } = n)
@@ -980,18 +985,18 @@ class Se {
     let e = this.bufferNode, t = null, n = 0;
     if (e && e.context == this.buffer)
       e:
-        for (let r = this.index, s = this.stack.length; s >= 0; ) {
+        for (let i = this.index, s = this.stack.length; s >= 0; ) {
           for (let o = e; o; o = o._parent)
-            if (o.index == r) {
-              if (r == this.index)
+            if (o.index == i) {
+              if (i == this.index)
                 return o;
               t = o, n = s + 1;
               break e;
             }
-          r = this.stack[--s];
+          i = this.stack[--s];
         }
-    for (let r = n; r < this.stack.length; r++)
-      t = new K(this.buffer, t, this.stack[r]);
+    for (let i = n; i < this.stack.length; i++)
+      t = new K(this.buffer, t, this.stack[i]);
     return this.bufferNode = new K(this.buffer, t, this.index);
   }
   /**
@@ -1010,18 +1015,18 @@ class Se {
   */
   iterate(e, t) {
     for (let n = 0; ; ) {
-      let r = !1;
+      let i = !1;
       if (this.type.isAnonymous || e(this) !== !1) {
         if (this.firstChild()) {
           n++;
           continue;
         }
-        this.type.isAnonymous || (r = !0);
+        this.type.isAnonymous || (i = !0);
       }
-      for (; r && t && t(this), r = this.type.isAnonymous, !this.nextSibling(); ) {
+      for (; i && t && t(this), i = this.type.isAnonymous, !this.nextSibling(); ) {
         if (!n)
           return;
-        this.parent(), n--, r = !0;
+        this.parent(), n--, i = !0;
       }
     }
   }
@@ -1034,25 +1039,25 @@ class Se {
     if (!this.buffer)
       return Ne(this.node, e);
     let { buffer: t } = this.buffer, { types: n } = t.set;
-    for (let r = e.length - 1, s = this.stack.length - 1; r >= 0; s--) {
+    for (let i = e.length - 1, s = this.stack.length - 1; i >= 0; s--) {
       if (s < 0)
-        return Ne(this.node, e, r);
+        return Ne(this.node, e, i);
       let o = n[t.buffer[this.stack[s]]];
       if (!o.isAnonymous) {
-        if (e[r] && e[r] != o.name)
+        if (e[i] && e[i] != o.name)
           return !1;
-        r--;
+        i--;
       }
     }
     return !0;
   }
 }
-function Le(i) {
-  return i.children.some((e) => e instanceof G || !e.type.isAnonymous || Le(e));
+function Le(r) {
+  return r.children.some((e) => e instanceof G || !e.type.isAnonymous || Le(e));
 }
-function Bt(i) {
+function Bt(r) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = Ct, reused: s = [], minRepeatType: o = n.types.length } = i, h = Array.isArray(t) ? new Be(t, t.length) : t, f = n.types, y = 0, x = 0;
+  let { buffer: t, nodeSet: n, maxBufferLength: i = Ct, reused: s = [], minRepeatType: o = n.types.length } = r, h = Array.isArray(t) ? new Be(t, t.length) : t, f = n.types, y = 0, x = 0;
   function A(m, p, u, v, b, g) {
     let { id: c, start: d, end: w, size: k } = h, I = x;
     for (; k < 0; )
@@ -1069,7 +1074,7 @@ function Bt(i) {
       } else
         throw new RangeError(`Unrecognized record size: ${k}`);
     let q = f[c], Z, F, ze = d - m;
-    if (w - d <= r && (F = re(h.pos - p, b))) {
+    if (w - d <= i && (F = re(h.pos - p, b))) {
       let U = new Uint16Array(F.size - F.skip), O = h.pos - F.size, M = U.length;
       for (; h.pos > O; )
         M = Q(F.start, U, M);
@@ -1079,7 +1084,7 @@ function Bt(i) {
       h.next();
       let O = [], M = [], X = c >= o ? c : -1, ee = 0, le = w;
       for (; h.pos > U; )
-        X >= 0 && h.id == X && h.size >= 0 ? (h.end <= le - r && (_(O, M, d, ee, h.end, le, X, I), ee = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, M) : A(d, U, O, M, X, g + 1);
+        X >= 0 && h.id == X && h.size >= 0 ? (h.end <= le - i && (_(O, M, d, ee, h.end, le, X, I), ee = O.length, le = h.end), h.next()) : g > 2500 ? B(d, U, O, M) : A(d, U, O, M, X, g + 1);
       if (X >= 0 && ee > 0 && ee < O.length && _(O, M, d, ee, d, le, X, I), O.reverse(), M.reverse(), X > -1 && ee > 0) {
         let Ee = T(q);
         Z = Oe(q, O, M, 0, O.length, 0, w - d, Ee, Ee);
@@ -1097,7 +1102,7 @@ function Bt(i) {
       else {
         if (c > -1 && w < c)
           break;
-        c < 0 && (c = k - r), b.push(d, w, k), g++, h.next();
+        c < 0 && (c = k - i), b.push(d, w, k), g++, h.next();
       }
     }
     if (g) {
@@ -1136,7 +1141,7 @@ function Bt(i) {
     return new D(m, p, u, v, g);
   }
   function re(m, p) {
-    let u = h.fork(), v = 0, b = 0, g = 0, c = u.end - r, d = { size: 0, start: 0, skip: 0 };
+    let u = h.fork(), v = 0, b = 0, g = 0, c = u.end - i, d = { size: 0, start: 0, skip: 0 };
     e:
       for (let w = u.pos - m; u.pos > w; ) {
         let k = u.size;
@@ -1178,41 +1183,41 @@ function Bt(i) {
   }
   let E = [], N = [];
   for (; h.pos > 0; )
-    A(i.start || 0, i.bufferStart || 0, E, N, -1, 0);
-  let P = (e = i.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
-  return new D(f[i.topID], E.reverse(), N.reverse(), P);
+    A(r.start || 0, r.bufferStart || 0, E, N, -1, 0);
+  let P = (e = r.length) !== null && e !== void 0 ? e : E.length ? N[0] + E[0].length : 0;
+  return new D(f[r.topID], E.reverse(), N.reverse(), P);
 }
 const Ue = /* @__PURE__ */ new WeakMap();
-function ge(i, e) {
-  if (!i.isAnonymous || e instanceof G || e.type != i)
+function ge(r, e) {
+  if (!r.isAnonymous || e instanceof G || e.type != r)
     return 1;
   let t = Ue.get(e);
   if (t == null) {
     t = 1;
     for (let n of e.children) {
-      if (n.type != i || !(n instanceof D)) {
+      if (n.type != r || !(n instanceof D)) {
         t = 1;
         break;
       }
-      t += ge(i, n);
+      t += ge(r, n);
     }
     Ue.set(e, t);
   }
   return t;
 }
-function Oe(i, e, t, n, r, s, o, h, f) {
+function Oe(r, e, t, n, i, s, o, h, f) {
   let y = 0;
-  for (let _ = n; _ < r; _++)
-    y += ge(i, e[_]);
+  for (let _ = n; _ < i; _++)
+    y += ge(r, e[_]);
   let x = Math.ceil(
     y * 1.5 / 8
     /* Balance.BranchFactor */
   ), A = [], B = [];
   function T(_, L, re, Q, E) {
     for (let N = re; N < Q; ) {
-      let P = N, m = L[N], p = ge(i, _[N]);
+      let P = N, m = L[N], p = ge(r, _[N]);
       for (N++; N < Q; N++) {
-        let u = ge(i, _[N]);
+        let u = ge(r, _[N]);
         if (p + u >= x)
           break;
         p += u;
@@ -1226,12 +1231,12 @@ function Oe(i, e, t, n, r, s, o, h, f) {
         A.push(_[P]);
       } else {
         let u = L[N - 1] + _[N - 1].length - m;
-        A.push(Oe(i, _, L, P, N, m, u, null, f));
+        A.push(Oe(r, _, L, P, N, m, u, null, f));
       }
       B.push(m + E - s);
     }
   }
-  return T(e, t, n, r, 0), (h || f)(A, B, o);
+  return T(e, t, n, i, 0), (h || f)(A, B, o);
 }
 new C({ perNode: !0 });
 let Lt = 0;
@@ -1272,7 +1277,7 @@ class H {
   */
   static defineModifier() {
     let e = new be();
-    return (t) => t.modified.indexOf(e) > -1 ? t : be.get(t.base || t, t.modified.concat(e).sort((n, r) => n.id - r.id));
+    return (t) => t.modified.indexOf(e) > -1 ? t : be.get(t.base || t, t.modified.concat(e).sort((n, i) => n.id - i.id));
   }
 }
 let Ot = 0;
@@ -1286,40 +1291,40 @@ class be {
     let n = t[0].instances.find((h) => h.base == e && zt(t, h.modified));
     if (n)
       return n;
-    let r = [], s = new H(r, e, t);
+    let i = [], s = new H(i, e, t);
     for (let h of t)
       h.instances.push(s);
     let o = Et(t);
     for (let h of e.set)
       if (!h.modified.length)
         for (let f of o)
-          r.push(be.get(h, f));
+          i.push(be.get(h, f));
     return s;
   }
 }
-function zt(i, e) {
-  return i.length == e.length && i.every((t, n) => t == e[n]);
+function zt(r, e) {
+  return r.length == e.length && r.every((t, n) => t == e[n]);
 }
-function Et(i) {
+function Et(r) {
   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]));
+  for (let t = 0; t < r.length; t++)
+    for (let n = 0, i = e.length; n < i; n++)
+      e.push(e[n].concat(r[t]));
   return e.sort((t, n) => n.length - t.length);
 }
 new C();
-function Tt(i, e) {
+function Tt(r, e) {
   let t = /* @__PURE__ */ Object.create(null);
-  for (let s of i)
+  for (let s of r)
     if (!Array.isArray(s.tag))
       t[s.tag.id] = s.class;
     else
       for (let o of s.tag)
         t[o.id] = s.class;
-  let { scope: n, all: r = null } = e || {};
+  let { scope: n, all: i = null } = e || {};
   return {
     style: (s) => {
-      let o = r;
+      let o = i;
       for (let h of s)
         for (let f of h.set) {
           let y = t[f.id];
@@ -1737,38 +1742,38 @@ const Pt = "#c72727", Mt = "#9b5700", jt = "#067934", Vt = "#0063d7", Rt = {
   green: jt,
   blue: Vt,
   invalid: "#ffffff"
-}, Ht = (i) => ht.define([
+}, Ht = (r) => ht.define([
   {
     tag: l.keyword,
-    color: i.red
+    color: r.red
   },
   {
     tag: [l.name, l.deleted, l.character, l.propertyName, l.macroName],
-    color: i.green
+    color: r.green
   },
   {
     tag: [l.function(l.variableName), l.labelName],
-    color: i.blue
+    color: r.blue
   },
   {
     tag: [l.color, l.constant(l.name), l.standard(l.name)],
-    color: i.red
+    color: r.red
   },
   {
     tag: [l.definition(l.name), l.separator],
-    color: i.red
+    color: r.red
   },
   {
     tag: [l.typeName, l.className, l.number, l.changed, l.annotation, l.modifier, l.self, l.namespace],
-    color: i.orange
+    color: r.orange
   },
   {
     tag: [l.operator, l.operatorKeyword, l.url, l.escape, l.regexp, l.link, l.special(l.string)],
-    color: i.blue
+    color: r.blue
   },
   {
     tag: [l.meta, l.comment],
-    color: i.orange
+    color: r.orange
   },
   {
     tag: l.strong,
@@ -1784,35 +1789,35 @@ const Pt = "#c72727", Mt = "#9b5700", jt = "#067934", Vt = "#0063d7", Rt = {
   },
   {
     tag: l.link,
-    color: i.orange,
+    color: r.orange,
     textDecoration: "underline"
   },
   {
     tag: l.heading,
     fontWeight: "bold",
-    color: i.blue
+    color: r.blue
   },
   {
     tag: [l.atom, l.bool, l.special(l.variableName)],
-    color: i.red
+    color: r.red
   },
   {
     tag: [l.processingInstruction, l.string, l.inserted],
-    color: i.blue
+    color: r.blue
   },
   {
     tag: l.invalid,
-    color: i.invalid
+    color: r.invalid
   }
 ]), Dt = at(Ht(Rt));
-var se = /* @__PURE__ */ ((i) => (i.INLINE = "inline", i.SINGLELINE = "singleline", i.MULTILINE = "multiline", i))(se || {}), ne = /* @__PURE__ */ ((i) => (i.JSON = "json", i.XML = "xml", i.JAVA = "java", i.JAVASCRIPT = "javascript", i))(ne || {}), Ie = /* @__PURE__ */ ((i) => (i.ACTION = "action", i))(Ie || {});
+var se = /* @__PURE__ */ ((r) => (r.INLINE = "inline", r.SINGLELINE = "singleline", r.MULTILINE = "multiline", r))(se || {}), ne = /* @__PURE__ */ ((r) => (r.JSON = "json", r.XML = "xml", r.JAVA = "java", r.JAVASCRIPT = "javascript", r))(ne || {}), Ie = /* @__PURE__ */ ((r) => (r.ACTION = "action", r))(Ie || {});
 const Ut = {
   [ne.JSON]: ut,
   [ne.XML]: ft,
   [ne.JAVASCRIPT]: ct,
   [ne.JAVA]: dt
-}, Jt = (i) => ({
-  loadLang: async () => Ut[i]
+}, Jt = (r) => ({
+  loadLang: async () => Ut[r]
 }), $e = {
   "en-US": {
     run: "Run"
@@ -1824,10 +1829,9 @@ const Ut = {
     BentoTypography: bt,
     BentoButton: gt,
     BentoDropdown: pt,
-    Copy: kt
+    Copy: vt
   },
-  directives: { BentoTooltipDirective: vt },
-  inheritAttrs: !1,
+  directives: { BentoTooltipDirective: xt },
   props: {
     /**
      * Defines the variant of code-snippet
@@ -1882,15 +1886,15 @@ const Ut = {
     }
   },
   emits: [Ie.ACTION],
-  setup(i, { emit: e }) {
-    const { t } = xt({ messages: $e }), n = ye(null), r = [], s = () => {
-    }, o = xe(() => i.langLabel ?? i.lang.toUpperCase()), h = xe(() => ({
-      "b-code-snippet--inline": i.variant === se.INLINE,
-      "b-code-snippet--scrollable": i.variant !== se.INLINE
-    })), { loadLang: f } = Jt(i.lang), y = Te(), x = Te(), A = new Ce(), B = new Ce(), T = new Ce(), _ = ye(""), L = ye(0);
+  setup(r, { emit: e }) {
+    const { t } = kt({ messages: $e }), n = ye(null), i = [], s = () => {
+    }, o = xe(() => r.langLabel ?? r.lang.toUpperCase()), h = xe(() => ({
+      "b-code-snippet--inline": r.variant === se.INLINE,
+      "b-code-snippet--scrollable": r.variant !== se.INLINE
+    })), { loadLang: f } = Jt(r.lang), y = Te(), x = Te(), A = new Ce(), B = new Ce(), T = new Ce(), _ = ye(""), L = ye(0);
     Xe(async () => {
       const E = await f();
-      _.value = i.content;
+      _.value = r.content;
       const N = ({ state: p }) => {
         _.value = p.doc.toString();
       }, P = [
@@ -1898,12 +1902,12 @@ const Ut = {
         it.of([ot]),
         A.of(E()),
         B.of(Dt),
-        T.of(Re.readOnly.of(!i.editable)),
+        T.of(Re.readOnly.of(!r.editable)),
         Ve.updateListener.of((p) => N(p))
       ];
-      i.variant === "multiline" && P.push([st(), lt()]);
+      r.variant === "multiline" && P.push([st(), lt()]);
       const m = Re.create({
-        doc: i.content,
+        doc: r.content,
         extensions: [...P]
       });
       L.value = m.doc.length, x.value = new Ve({
@@ -1911,19 +1915,19 @@ const Ut = {
         parent: y.value
       });
     }), Ye(
-      () => i.content,
+      () => r.content,
       () => {
-        const E = i.content.length;
+        const E = r.content.length;
         x.value.dispatch({
           changes: {
             from: 0,
             to: L.value,
-            insert: i.content
+            insert: r.content
           }
         }), L.value = E;
       }
     );
-    const re = xe(() => t(i.actionableText));
+    const re = xe(() => t(r.actionableText));
     return {
       // Enums
       BentoTypographyElement: yt,
@@ -1934,7 +1938,7 @@ const Ut = {
       editor: x,
       currentContents: _,
       conditionalClasses: h,
-      availableLanguages: r,
+      availableLanguages: i,
       displayedLang: o,
       selectedLanguage: n,
       // Methods
@@ -1946,7 +1950,7 @@ const Ut = {
     };
   }
 });
-const $t = (i) => (tt("data-v-0d858287"), i = i(), nt(), i), Kt = {
+const $t = (r) => (tt("data-v-6e4b3150"), r = r(), nt(), r), Kt = {
   key: 0,
   class: "b-code-snippet__action-bar"
 }, Gt = { class: "b-code-snippet__action-bar--start" }, qt = { class: "b-code-snippet__action-bar--end" }, Ft = {
@@ -1956,29 +1960,29 @@ const $t = (i) => (tt("data-v-0d858287"), i = i(), nt(), i), Kt = {
   ref: "container",
   class: "b-code-snippet__code-area-content"
 }, Yt = { key: 2 }, Qt = /* @__PURE__ */ $t(() => /* @__PURE__ */ pe("div", { class: "b-code-snippet__empty-state" }, "Nothing to show", -1));
-function Zt(i, e, t, n, r, s) {
+function Zt(r, e, t, n, i, s) {
   const o = ae("bento-dropdown"), h = ae("bento-typography"), f = ae("copy"), y = ae("bento-button");
   return te(), he("div", {
-    class: Qe(["b-code-snippet", i.conditionalClasses])
+    class: Qe(["b-code-snippet", r.conditionalClasses])
   }, [
-    i.variant !== i.BentoCodeSnippetVariant.INLINE ? (te(), he("section", Kt, [
+    r.variant !== r.BentoCodeSnippetVariant.INLINE ? (te(), he("section", Kt, [
       pe("div", Gt, [
-        i.availableLanguages.length > 0 ? (te(), Pe(o, Ze({
+        r.availableLanguages.length > 0 ? (te(), Pe(o, Ze({
           key: 0,
-          modelValue: i.selectedLanguage,
-          "onUpdate:modelValue": e[0] || (e[0] = (x) => i.selectedLanguage = x)
-        }, i.$props, {
-          disabled: i.availableLanguages.length === 1,
-          items: i.availableLanguages,
+          modelValue: r.selectedLanguage,
+          "onUpdate:modelValue": e[0] || (e[0] = (x) => r.selectedLanguage = x)
+        }, r.$props, {
+          disabled: r.availableLanguages.length === 1,
+          items: r.availableLanguages,
           class: "b-code-snippet__language-picker",
-          onInput: i.handleChangeLanguage
+          onInput: r.handleChangeLanguage
         }), null, 16, ["modelValue", "disabled", "items", "onInput"])) : ke("", !0),
         ve(h, {
-          el: i.BentoTypographyElement.SPAN,
+          el: r.BentoTypographyElement.SPAN,
           stronger: ""
         }, {
           default: we(() => [
-            Me(je(i.displayedLang), 1)
+            Me(je(r.displayedLang), 1)
           ]),
           _: 1
         }, 8, ["el"])
@@ -1986,22 +1990,22 @@ function Zt(i, e, t, n, r, s) {
       pe("div", qt, [
         ve(f, {
           class: "b-structured-list__icon",
-          text: i.currentContents
+          text: r.currentContents
         }, null, 8, ["text"]),
-        i.actionable ? (te(), Pe(y, {
+        r.actionable ? (te(), Pe(y, {
           key: 0,
-          variant: i.BentoButtonVariant.PRIMARY,
+          variant: r.BentoButtonVariant.PRIMARY,
           tertiary: "",
           condensed: "",
-          onClick: i.onActionClicked
+          onClick: r.onActionClicked
         }, {
           iconLeft: we(() => [
             ve(h, {
-              el: i.BentoTypographyElement.SPAN,
+              el: r.BentoTypographyElement.SPAN,
               class: "b-code-snippet__action-button"
             }, {
               default: we(() => [
-                Me(je(i.runText), 1)
+                Me(je(r.runText), 1)
               ]),
               _: 1
             }, 8, ["el"])
@@ -2010,16 +2014,16 @@ function Zt(i, e, t, n, r, s) {
         }, 8, ["variant", "onClick"])) : ke("", !0)
       ])
     ])) : ke("", !0),
-    i.content ? (te(), he("code", Ft, [
+    r.content ? (te(), he("code", Ft, [
       pe("div", Xt, null, 512)
     ])) : (te(), he("section", Yt, [
-      et(i.$slots, "empty-state", {}, () => [
+      et(r.$slots, "empty-state", {}, () => [
         Qt
       ], !0)
     ]))
   ], 2);
 }
-const bn = /* @__PURE__ */ wt(Wt, [["render", Zt], ["__scopeId", "data-v-0d858287"]]);
+const bn = /* @__PURE__ */ wt(Wt, [["render", Zt], ["__scopeId", "data-v-6e4b3150"]]);
 export {
   bn as BentoCodeSnippet,
   Ie as BentoCodeSnippetEvent,