@adyen/bento-vue2 1.19.0 → 1.20.0

package/dist/code-snippet.js

@@ -1,30 +1,30 @@
 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 { highlightActiveLine as Ue, keymap as We, EditorView as Ie, lineNumbers as Ge } from "@codemirror/view";
-import { Compartment as be, EditorState as Le } from "@codemirror/state";
-import { indentWithTab as Ke, history as Fe } from "@codemirror/commands";
-import { syntaxHighlighting as qe, HighlightStyle as Xe } from "@codemirror/language";
-import { json as Ze } from "@codemirror/lang-json";
-import { xml as Qe } from "@codemirror/lang-xml";
-import { javascript as Ye } from "@codemirror/lang-javascript";
-import { java as et } from "@codemirror/lang-java";
-import { B as tt } from "./chunks/dropdown.0574f613.js";
-import { g as nt } from "./chunks/base-modal.27c6f2db.js";
-import { a as rt } from "./chunks/button.0b6cda85.js";
-import { B as it } from "./chunks/index.de687404.js";
-import { BentoLoadingIndicator as st } from "./loading-indicator.js";
-import { u as lt } from "./chunks/i18n.eb5b985b.js";
-import { n as Pe } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
-import { C as ot } from "./chunks/copy.647aae54.js";
-import { B as at } from "./chunks/tooltip.6748027a.js";
-import "./assets/index10.css";
-const ut = 1024;
-let ft = 0;
+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.7ad3a860.js";
+import { g as Ye } from "./chunks/base-modal.9d4f6201.js";
+import { a as et } from "./chunks/button.8738aa07.js";
+import { B as tt } from "./chunks/index.f64eee15.js";
+import { BentoLoadingIndicator as nt } from "./loading-indicator.js";
+import { u as rt } from "./chunks/i18n.eb5b985b.js";
+import { n as He } from "./chunks/_plugin-vue2_normalizer.71e2aa87.js";
+import { C as it } from "./chunks/copy.2aca9aaf.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.a76de645.js";
+import "./assets/index22.css";
+const ft = 1024;
+let ht = 0;
 class v {
   /**
   Create a new node prop type.
   */
   constructor(e = {}) {
-    this.id = ft++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+    this.id = ht++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
       throw new Error("This node type doesn't define a deserialize function");
     });
   }
@@ -68,7 +68,7 @@ class ge {
     return e && e.props && e.props[v.mounted.id];
   }
 }
-const ht = /* @__PURE__ */ Object.create(null);
+const ct = /* @__PURE__ */ Object.create(null);
 class W {
   /**
   @internal
@@ -80,7 +80,7 @@ class W {
   Define a node type.
   */
   static define(e) {
-    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 W(e.name || "", t, e.id, n);
+    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);
     if (e.props) {
       for (let s of e.props)
         if (Array.isArray(s) || (s = s(r)), s) {
@@ -217,7 +217,7 @@ class V {
   tree.
   */
   get topNode() {
-    return new O(this, 0, 0, null);
+    return new E(this, 0, 0, null);
   }
   /**
   Get the [syntax node](#common.SyntaxNode) at the given position.
@@ -253,7 +253,7 @@ class V {
   position.
   */
   resolveStack(e, t = 0) {
-    return pt(this, e, t);
+    return gt(this, e, t);
   }
   /**
   Iterate over the tree and its children, calling `enter` for any
@@ -310,7 +310,7 @@ class V {
   or a cursor over such a buffer.
   */
   static build(e) {
-    return gt(e);
+    return mt(e);
   }
 }
 V.empty = new V(W.none, [], [], 0);
@@ -379,7 +379,7 @@ class q {
   */
   findChild(e, t, n, r, s) {
     let { buffer: l } = this, u = -1;
-    for (let h = e; h != t && !(Te(s, r, l[h + 1], l[h + 2]) && (u = h, n > 0)); h = l[h + 3])
+    for (let h = e; h != t && !(Pe(s, r, l[h + 1], l[h + 2]) && (u = h, n > 0)); h = l[h + 3])
       ;
     return u;
   }
@@ -396,7 +396,7 @@ class q {
     return new q(s, l, this.set);
   }
 }
-function Te(i, e, t, n) {
+function Pe(i, e, t, n) {
   switch (i) {
     case -2:
       return t < e;
@@ -414,7 +414,7 @@ function Te(i, e, t, n) {
 }
 function le(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 l = !n && i instanceof O && i.index < 0 ? null : i.parent;
+    let l = !n && i instanceof E && i.index < 0 ? null : i.parent;
     if (!l)
       return i;
     i = l;
@@ -422,7 +422,7 @@ function le(i, e, t, n) {
   let s = n ? 0 : S.IgnoreOverlays;
   if (n)
     for (let l = i, u = l.parent; u; l = u, u = l.parent)
-      l instanceof O && l.index < 0 && ((r = u.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = u);
+      l instanceof E && l.index < 0 && ((r = u.enter(e, t, s)) === null || r === void 0 ? void 0 : r.from) != l.from && (i = u);
   for (; ; ) {
     let l = i.enter(e, t, s);
     if (!l)
@@ -435,11 +435,11 @@ class je {
     return new _e(this, e);
   }
   getChild(e, t = null, n = null) {
-    let r = Oe(this, e, t, n);
+    let r = Ee(this, e, t, n);
     return r.length ? r[0] : null;
   }
   getChildren(e, t = null, n = null) {
-    return Oe(this, e, t, n);
+    return Ee(this, e, t, n);
   }
   resolve(e, t = 0) {
     return le(this, e, t, !1);
@@ -467,7 +467,7 @@ class je {
     return this.parent;
   }
 }
-class O extends je {
+class E extends je {
   constructor(e, t, n, r) {
     super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
   }
@@ -484,19 +484,19 @@ class O extends je {
     for (let l = this; ; ) {
       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 (Te(r, n, N, N + C.length)) {
+        if (Pe(r, n, N, N + C.length)) {
           if (C instanceof q) {
             if (s & S.ExcludeBuffers)
               continue;
             let A = C.findChild(0, C.buffer.length, t, n - N, r);
             if (A > -1)
-              return new F(new ct(l, C, e, N), null, A);
+              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 O(A.tree, N, e, l);
-            let E = new O(C, N, e, l);
-            return s & S.IncludeAnonymous || !E.type.isAnonymous ? E : E.nextChild(t < 0 ? C.children.length - 1 : 0, t, n, r);
+              return new E(A.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);
           }
         }
       }
@@ -546,7 +546,7 @@ class O extends je {
       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))
-          return new O(r.tree, r.overlay[0].from + this.from, -1, this);
+          return new E(r.tree, r.overlay[0].from + this.from, -1, this);
     }
     return this.nextChild(0, 1, e, t, n);
   }
@@ -590,7 +590,7 @@ class O extends je {
     return this._tree.toString();
   }
 }
-function Oe(i, e, t, n) {
+function Ee(i, e, t, n) {
   let r = i.cursor(), s = [];
   if (!r.firstChild())
     return s;
@@ -618,12 +618,12 @@ function xe(i, e, t = e.length - 1) {
   }
   return !0;
 }
-class ct {
+class dt {
   constructor(e, t, n, r) {
     this.parent = e, this.buffer = t, this.index = n, this.start = r;
   }
 }
-class F extends je {
+class K extends je {
   get name() {
     return this.type.name;
   }
@@ -638,7 +638,7 @@ class F 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 F(this.context, this, s);
+    return s < 0 ? null : new K(this.context, this, s);
   }
   get firstChild() {
     return this.child(
@@ -676,7 +676,7 @@ class F extends je {
     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);
-    return s < 0 ? null : new F(this.context, this, s);
+    return s < 0 ? null : new K(this.context, this, s);
   }
   get parent() {
     return this._parent || this.context.parent.nextSignificantParent();
@@ -692,11 +692,11 @@ class F 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 F(this.context, this._parent, t) : this.externalSibling(1);
+    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new K(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 F(this.context, this._parent, e.findChild(
+    return this.index == t ? this.externalSibling(-1) : new K(this.context, this._parent, e.findChild(
       t,
       this.index,
       -1,
@@ -731,10 +731,10 @@ function Re(i) {
     let l = i[s];
     (l.from > t.from || l.to < t.to) && (t = l, e = s);
   }
-  let n = t instanceof O && t.index < 0 ? null : t.parent, r = i.slice();
-  return n ? r[e] = n : r.splice(e, 1), new dt(r, t);
+  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);
 }
-class dt {
+class pt {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
@@ -742,16 +742,16 @@ class dt {
     return Re(this.heads);
   }
 }
-function pt(i, e, t) {
+function gt(i, e, t) {
   let n = i.resolveInner(e, t), r = null;
-  for (let s = n instanceof O ? n : n.context.parent; s; s = s.parent)
+  for (let s = n instanceof E ? n : n.context.parent; s; s = s.parent)
     if (s.index < 0) {
       let l = s.parent;
       (r || (r = [n])).push(l.resolve(e, t)), s = l;
     } else {
       let l = ge.get(s.tree);
       if (l && l.overlay && l.overlay[0].from <= e && l.overlay[l.overlay.length - 1].to >= e) {
-        let u = new O(l.tree, l.overlay[0].from + s.from, -1, s);
+        let u = new E(l.tree, l.overlay[0].from + s.from, -1, s);
         (r || (r = [n])).push(le(u, e, t, !1));
       }
     }
@@ -768,7 +768,7 @@ class _e {
   @internal
   */
   constructor(e, t = 0) {
-    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof O)
+    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof E)
       this.yieldNode(e);
     else {
       this._tree = e.context.parent, this.buffer = e.context;
@@ -789,7 +789,7 @@ class _e {
   @internal
   */
   yield(e) {
-    return e ? e instanceof O ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
+    return e ? e instanceof E ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
   }
   /**
   @internal
@@ -998,8 +998,8 @@ class _e {
           r = this.stack[--s];
         }
     for (let r = n; r < this.stack.length; r++)
-      t = new F(this.buffer, t, this.stack[r]);
-    return this.bufferNode = new F(this.buffer, t, this.index);
+      t = new K(this.buffer, t, this.stack[r]);
+    return this.bufferNode = new K(this.buffer, t, this.index);
   }
   /**
   Get the [tree](#common.Tree) that represents the current node, if
@@ -1057,9 +1057,9 @@ class _e {
 function Ce(i) {
   return i.children.some((e) => e instanceof q || !e.type.isAnonymous || Ce(e));
 }
-function gt(i) {
+function mt(i) {
   var e;
-  let { buffer: t, nodeSet: n, maxBufferLength: r = ut, 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 = 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;
   function N(g, b, f, y, p, m) {
     let { id: c, start: d, end: _, size: x } = u, L = C;
     for (; x < 0; )
@@ -1076,22 +1076,22 @@ function gt(i) {
       } else
         throw new RangeError(`Unrecognized record size: ${x}`);
     let X = h[c], te, Z, Ne = d - g;
-    if (_ - d <= r && (Z = z(u.pos - b, p))) {
-      let U = new Uint16Array(Z.size - Z.skip), B = u.pos - Z.size, H = U.length;
+    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; )
-        H = $(Z.start, U, H);
+        T = $(Z.start, U, T);
       te = new q(U, _ - Z.start, n), Ne = Z.start - g;
     } else {
       let U = u.pos - x;
       u.next();
-      let B = [], H = [], Q = c >= l ? c : -1, ne = 0, oe = _;
+      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, H, d, ne, u.end, oe, Q, L), ne = B.length, oe = u.end), u.next()) : m > 2500 ? A(d, U, B, H) : N(d, U, B, H, Q, m + 1);
-      if (Q >= 0 && ne > 0 && ne < B.length && I(B, H, d, ne, d, oe, Q, L), B.reverse(), H.reverse(), Q > -1 && ne > 0) {
-        let Se = E(X);
-        te = we(X, B, H, 0, B.length, 0, _ - d, Se, Se);
+        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);
+      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);
       } else
-        te = M(X, B, H, _ - d, L - _);
+        te = M(X, B, T, _ - d, L - _);
     }
     f.push(te), y.push(Ne);
   }
@@ -1114,7 +1114,7 @@ function gt(i) {
       f.push(new q(d, p[2] - _, n)), y.push(_ - g);
     }
   }
-  function E(g) {
+  function z(g) {
     return (b, f, y) => {
       let p = 0, m = b.length - 1, c, d;
       if (m >= 0 && (c = b[m]) instanceof V) {
@@ -1142,7 +1142,7 @@ function gt(i) {
     }
     return new V(g, b, f, y, m);
   }
-  function z(g, b) {
+  function O(g, b) {
     let f = u.fork(), y = 0, p = 0, m = 0, c = f.end - r, d = { size: 0, start: 0, skip: 0 };
     e:
       for (let _ = f.pos - g; f.pos > _; ) {
@@ -1189,11 +1189,11 @@ function gt(i) {
   let J = (e = i.length) !== null && e !== void 0 ? e : D.length ? w[0] + D[0].length : 0;
   return new V(h[i.topID], D.reverse(), w.reverse(), J);
 }
-const ze = /* @__PURE__ */ new WeakMap();
+const Oe = /* @__PURE__ */ new WeakMap();
 function de(i, e) {
   if (!i.isAnonymous || e instanceof q || e.type != i)
     return 1;
-  let t = ze.get(e);
+  let t = Oe.get(e);
   if (t == null) {
     t = 1;
     for (let n of e.children) {
@@ -1203,7 +1203,7 @@ function de(i, e) {
       }
       t += de(i, n);
     }
-    ze.set(e, t);
+    Oe.set(e, t);
   }
   return t;
 }
@@ -1215,8 +1215,8 @@ function we(i, e, t, n, r, s, l, u, h) {
     k * 1.5 / 8
     /* Balance.BranchFactor */
   ), N = [], A = [];
-  function E(I, M, z, $, D) {
-    for (let w = z; w < $; ) {
+  function z(I, M, O, $, D) {
+    for (let w = O; w < $; ) {
       let J = w, g = M[w], b = de(i, I[w]);
       for (w++; w < $; w++) {
         let f = de(i, I[w]);
@@ -1227,7 +1227,7 @@ function we(i, e, t, n, r, s, l, u, h) {
       if (w == J + 1) {
         if (b > C) {
           let f = I[J];
-          E(f.children, f.positions, 0, f.children.length, M[J] + D);
+          z(f.children, f.positions, 0, f.children.length, M[J] + D);
           continue;
         }
         N.push(I[J]);
@@ -1238,16 +1238,16 @@ function we(i, e, t, n, r, s, l, u, h) {
       A.push(g + D - s);
     }
   }
-  return E(e, t, n, r, 0), (u || h)(N, A, l);
+  return z(e, t, n, r, 0), (u || h)(N, A, l);
 }
 new v({ perNode: !0 });
-let mt = 0;
+let bt = 0;
 class R {
   /**
   @internal
   */
   constructor(e, t, n) {
-    this.set = e, this.base = t, this.modified = n, this.id = mt++;
+    this.set = e, this.base = t, this.modified = n, this.id = bt++;
   }
   /**
   Define a new tag. If `parent` is given, the tag is treated as a
@@ -1282,21 +1282,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 bt = 0;
+let yt = 0;
 class me {
   constructor() {
-    this.instances = [], this.id = bt++;
+    this.instances = [], this.id = yt++;
   }
   static get(e, t) {
     if (!t.length)
       return e;
-    let n = t[0].instances.find((u) => u.base == e && yt(t, u.modified));
+    let n = t[0].instances.find((u) => u.base == e && xt(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 = xt(t);
+    let l = _t(t);
     for (let u of e.set)
       if (!u.modified.length)
         for (let h of l)
@@ -1304,10 +1304,10 @@ class me {
     return s;
   }
 }
-function yt(i, e) {
+function xt(i, e) {
   return i.length == e.length && i.every((t, n) => t == e[n]);
 }
-function xt(i) {
+function _t(i) {
   let e = [[]];
   for (let t = 0; t < i.length; t++)
     for (let n = 0, r = e.length; n < r; n++)
@@ -1315,7 +1315,7 @@ function xt(i) {
   return e.sort((t, n) => n.length - t.length);
 }
 new v();
-function _t(i, e) {
+function vt(i, e) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let s of i)
     if (!Array.isArray(s.tag))
@@ -1340,7 +1340,7 @@ function _t(i, e) {
     scope: n
   };
 }
-const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K), ye = a(K), j = a(), Y = a(j), P = a(), T = a(), ve = a(), ie = a(ve), ce = a(), o = {
+const a = R.define, fe = a(), G = a(), 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 = {
   /**
   A comment.
   */
@@ -1368,11 +1368,11 @@ const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   A type [name](#highlight.tags.name).
   */
-  typeName: Ee,
+  typeName: ze,
   /**
   A tag name (subtag of [`typeName`](#highlight.tags.typeName)).
   */
-  tagName: a(Ee),
+  tagName: a(ze),
   /**
   A property or field [name](#highlight.tags.name).
   */
@@ -1400,7 +1400,7 @@ const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   A literal value.
   */
-  literal: K,
+  literal: F,
   /**
   A string [literal](#highlight.tags.literal).
   */
@@ -1432,106 +1432,106 @@ const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   /**
   A boolean [literal](#highlight.tags.literal).
   */
-  bool: a(K),
+  bool: a(F),
   /**
   Regular expression [literal](#highlight.tags.literal).
   */
-  regexp: a(K),
+  regexp: a(F),
   /**
   An escape [literal](#highlight.tags.literal), for example a
   backslash escape in a string.
   */
-  escape: a(K),
+  escape: a(F),
   /**
   A color [literal](#highlight.tags.literal).
   */
-  color: a(K),
+  color: a(F),
   /**
   A URL [literal](#highlight.tags.literal).
   */
-  url: a(K),
+  url: a(F),
   /**
   A language keyword.
   */
-  keyword: P,
+  keyword: H,
   /**
   The [keyword](#highlight.tags.keyword) for the self or this
   object.
   */
-  self: a(P),
+  self: a(H),
   /**
   The [keyword](#highlight.tags.keyword) for null.
   */
-  null: a(P),
+  null: a(H),
   /**
   A [keyword](#highlight.tags.keyword) denoting some atomic value.
   */
-  atom: a(P),
+  atom: a(H),
   /**
   A [keyword](#highlight.tags.keyword) that represents a unit.
   */
-  unit: a(P),
+  unit: a(H),
   /**
   A modifier [keyword](#highlight.tags.keyword).
   */
-  modifier: a(P),
+  modifier: a(H),
   /**
   A [keyword](#highlight.tags.keyword) that acts as an operator.
   */
-  operatorKeyword: a(P),
+  operatorKeyword: a(H),
   /**
   A control-flow related [keyword](#highlight.tags.keyword).
   */
-  controlKeyword: a(P),
+  controlKeyword: a(H),
   /**
   A [keyword](#highlight.tags.keyword) that defines something.
   */
-  definitionKeyword: a(P),
+  definitionKeyword: a(H),
   /**
   A [keyword](#highlight.tags.keyword) related to defining or
   interfacing with modules.
   */
-  moduleKeyword: a(P),
+  moduleKeyword: a(H),
   /**
   An operator.
   */
-  operator: T,
+  operator: P,
   /**
   An [operator](#highlight.tags.operator) that dereferences something.
   */
-  derefOperator: a(T),
+  derefOperator: a(P),
   /**
   Arithmetic-related [operator](#highlight.tags.operator).
   */
-  arithmeticOperator: a(T),
+  arithmeticOperator: a(P),
   /**
   Logical [operator](#highlight.tags.operator).
   */
-  logicOperator: a(T),
+  logicOperator: a(P),
   /**
   Bit [operator](#highlight.tags.operator).
   */
-  bitwiseOperator: a(T),
+  bitwiseOperator: a(P),
   /**
   Comparison [operator](#highlight.tags.operator).
   */
-  compareOperator: a(T),
+  compareOperator: a(P),
   /**
   [Operator](#highlight.tags.operator) that updates its operand.
   */
-  updateOperator: a(T),
+  updateOperator: a(P),
   /**
   [Operator](#highlight.tags.operator) that defines something.
   */
-  definitionOperator: a(T),
+  definitionOperator: a(P),
   /**
   Type-related [operator](#highlight.tags.operator).
   */
-  typeOperator: a(T),
+  typeOperator: a(P),
   /**
   Control-flow [operator](#highlight.tags.operator).
   */
-  controlOperator: a(T),
+  controlOperator: a(P),
   /**
   Program or markup punctuation.
   */
@@ -1706,7 +1706,7 @@ const a = R.define, fe = a(), G = a(), Ee = a(G), Me = a(G), K = a(), he = a(K),
   */
   special: R.defineModifier()
 };
-_t([
+vt([
   { tag: o.link, class: "tok-link" },
   { tag: o.heading, class: "tok-heading" },
   { tag: o.emphasis, class: "tok-emphasis" },
@@ -1738,13 +1738,13 @@ _t([
   { tag: o.invalid, class: "tok-invalid" },
   { tag: o.punctuation, class: "tok-punctuation" }
 ]);
-const vt = "#c72727", kt = "#9b5700", Ct = "#067934", wt = "#0063d7", Nt = {
-  red: vt,
-  orange: kt,
-  green: Ct,
-  blue: wt,
+const kt = "#c72727", Ct = "#9b5700", wt = "#067934", Nt = "#0063d7", St = {
+  red: kt,
+  orange: Ct,
+  green: wt,
+  blue: Nt,
   invalid: "#ffffff"
-}, St = (i) => Xe.define([
+}, At = (i) => Ze.define([
   {
     tag: o.keyword,
     color: i.red
@@ -1811,51 +1811,67 @@ const vt = "#c72727", kt = "#9b5700", Ct = "#067934", wt = "#0063d7", Nt = {
     tag: o.invalid,
     color: i.invalid
   }
-]), At = qe(St(Nt));
+]), 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 It = {
-  [ee.JSON]: Ze,
-  [ee.XML]: Qe,
-  [ee.JAVASCRIPT]: Ye,
-  [ee.JAVA]: et
-}, Lt = (i) => async () => It[i];
-let He = 0;
-const Bt = {
+const Lt = {
+  [ee.JSON]: st,
+  [ee.XML]: lt,
+  [ee.JAVASCRIPT]: ot,
+  [ee.JAVA]: at
+}, Bt = (i) => async () => Lt[i], Et = (i, e) => {
+  const t = i.doc.lineAt(e.from), n = /^\s*/.exec(t.text);
+  return n ? n[0] : "";
+}, Ot = {
+  key: "Enter",
+  run: ({ state: i, dispatch: e }) => {
+    const t = i.changeByRange((n) => {
+      const s = `
+${Et(i, n)}`;
+      return {
+        changes: { from: n.from, to: n.to, insert: s },
+        range: Fe.cursor(n.from + s.length)
+      };
+    });
+    return e(i.update(t, { scrollIntoView: !0, userEvent: "input" })), !0;
+  }
+};
+let Te = 0;
+const zt = {
   beforeCreate() {
-    this.uuid = He.toString(), He += 1;
+    this.uuid = Te.toString(), Te += 1;
   }
 };
-var Ot = function() {
+var Mt = 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" } })]);
-}, zt = [], Et = /* @__PURE__ */ Pe(
-  Bt,
-  Ot,
+}, Tt = [], Ht = /* @__PURE__ */ He(
   zt,
+  Mt,
+  Tt,
   !1,
   null,
   null,
   null,
   null
 );
-const Mt = Et.exports, Ht = {
+const Pt = Ht.exports, jt = {
   "en-US": {
     run: "Run",
     expand: "Expand"
   }
-}, Pt = Ve({
-  i18n: { messages: Ht },
+}, Rt = Ve({
+  i18n: { messages: jt },
   name: "bento-code-snippet",
   components: {
-    BentoTypography: it,
-    BentoButton: rt,
-    BentoDropdown: tt,
-    Copy: ot,
-    BaseModal: nt,
-    BentoLoadingIndicator: st,
-    ExpandIcon: Mt
+    BentoTypography: tt,
+    BentoButton: et,
+    BentoDropdown: Qe,
+    Copy: it,
+    BaseModal: Ye,
+    BentoLoadingIndicator: nt,
+    ExpandIcon: Pt
   },
-  directives: { BentoTooltipDirective: at },
+  directives: { BentoTooltipDirective: ut },
   props: {
     /**
      * Defines the variant of code-snippet
@@ -1928,27 +1944,27 @@ const Mt = Et.exports, Ht = {
   },
   emits: [se.ACTION, se.CHANGE],
   setup(i, { emit: e }) {
-    const { t } = lt(), n = ae(null), r = [], s = () => {
+    const { t } = rt(), n = ae(null), r = [], s = () => {
     }, l = re(() => i.langLabel ?? i.lang.toUpperCase()), u = re(() => i.variant === pe.INLINE), h = re(() => ({
       "b-code-snippet--inline": u.value,
       "b-code-snippet--scrollable": !u.value
     })), k = re(() => ({
       "b-code-snippet__code-area-content--editable": i.editable
-    })), C = Lt(i.lang), N = Ae(), A = Ae(), E = new be(), I = new be(), M = new be(), z = ae(null), $ = ae(0);
+    })), C = Bt(i.lang), N = Ae(), A = Ae(), z = new be(), I = new be(), M = new be(), O = ae(null), $ = ae(0);
     $e(async () => {
       const g = await C();
-      z.value = i.content;
+      O.value = i.content;
       const b = ({ state: p }) => {
-        z.value = p.doc.toString();
+        O.value = p.doc.toString();
       }, f = [
         Ue(),
-        We.of([Ke]),
-        E.of(g()),
-        I.of(At),
+        We.of([Ke, Ot]),
+        z.of(g()),
+        I.of(It),
         M.of(Le.readOnly.of(!i.editable)),
         Ie.updateListener.of((p) => b(p))
       ];
-      i.variant === "multiline" && f.push([Ge(), Fe()]);
+      i.variant === "multiline" && f.push([Ge(), qe()]);
       const y = Le.create({
         doc: i.content,
         extensions: [...f]
@@ -1960,7 +1976,7 @@ const Mt = Et.exports, Ht = {
     }), De(
       () => i.content,
       () => {
-        if (i.content !== z.value) {
+        if (i.content !== O.value) {
           const g = i.content.length;
           A.value.dispatch({
             changes: {
@@ -1973,10 +1989,10 @@ const Mt = Et.exports, Ht = {
       }
     );
     const D = re(() => t(i.actionableText)), w = () => {
-      e(se.ACTION, z.value);
+      e(se.ACTION, O.value);
     };
     Je(() => {
-      z.value !== null && e(se.CHANGE, z.value);
+      O.value !== null && e(se.CHANGE, O.value);
     });
     const J = ae(!1);
     return {
@@ -1985,7 +2001,7 @@ const Mt = Et.exports, Ht = {
       codeAreaContentConditionalClasses: k,
       conditionalClasses: h,
       container: N,
-      currentContents: z,
+      currentContents: O,
       displayedLang: l,
       editor: A,
       selectedLanguage: n,
@@ -2000,7 +2016,7 @@ const Mt = Et.exports, Ht = {
     };
   }
 });
-var Tt = function() {
+var Vt = 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;
@@ -2017,19 +2033,19 @@ var Tt = 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);
-}, jt = [], Rt = /* @__PURE__ */ Pe(
-  Pt,
-  Tt,
-  jt,
+}, $t = [], Dt = /* @__PURE__ */ He(
+  Rt,
+  Vt,
+  $t,
   !1,
   null,
-  "925758bb",
+  "23626e8d",
   null,
   null
 );
-const sn = Rt.exports;
+const an = Dt.exports;
 export {
-  sn as BentoCodeSnippet,
+  an as BentoCodeSnippet,
   se as BentoCodeSnippetEvent,
   ee as BentoCodeSnippetSupportedLanguage,
   pe as BentoCodeSnippetVariant