v-code-diff 1.10.0 → 1.11.0

package/dist/v2/index.es.js

@@ -10,12 +10,12 @@ function ne() {
 }
 ne.prototype = {
   diff: function(n, a) {
-    var u = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, h = u.callback;
-    typeof u == "function" && (h = u, u = {}), this.options = u;
+    var u = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, g = u.callback;
+    typeof u == "function" && (g = u, u = {}), this.options = u;
     var t = this;
     function r(p) {
-      return h ? (setTimeout(function() {
-        h(void 0, p);
+      return g ? (setTimeout(function() {
+        g(void 0, p);
       }, 0), !0) : p;
     }
     n = this.castInput(n), a = this.castInput(a), n = this.removeEmpty(this.tokenize(n)), a = this.removeEmpty(this.tokenize(a));
@@ -30,40 +30,40 @@ ne.prototype = {
         value: this.join(a),
         count: a.length
       }]);
-    function g() {
+    function h() {
       for (var p = -1 * o; p <= o; p += 2) {
-        var _ = void 0, E = c[p - 1], b = c[p + 1], y = (b ? b.newPos : 0) - p;
-        E && (c[p - 1] = void 0);
-        var A = E && E.newPos + 1 < i, R = b && 0 <= y && y < s;
-        if (!A && !R) {
+        var _ = void 0, v = c[p - 1], E = c[p + 1], m = (E ? E.newPos : 0) - p;
+        v && (c[p - 1] = void 0);
+        var N = v && v.newPos + 1 < i, D = E && 0 <= m && m < s;
+        if (!N && !D) {
           c[p] = void 0;
           continue;
         }
-        if (!A || R && E.newPos < b.newPos ? (_ = Wn(b), t.pushComponent(_.components, void 0, !0)) : (_ = E, _.newPos++, t.pushComponent(_.components, !0, void 0)), y = t.extractCommon(_, a, n, p), _.newPos + 1 >= i && y + 1 >= s)
+        if (!N || D && v.newPos < E.newPos ? (_ = Wn(E), t.pushComponent(_.components, void 0, !0)) : (_ = v, _.newPos++, t.pushComponent(_.components, !0, void 0)), m = t.extractCommon(_, a, n, p), _.newPos + 1 >= i && m + 1 >= s)
           return r(Kn(t, _.components, a, n, t.useLongestToken));
         c[p] = _;
       }
       o++;
     }
-    if (h)
+    if (g)
       (function p() {
         setTimeout(function() {
           if (o > l)
-            return h();
-          g() || p();
+            return g();
+          h() || p();
         }, 0);
       })();
     else
       for (; o <= l; ) {
-        var d = g();
+        var d = h();
         if (d)
           return d;
       }
   },
   pushComponent: function(n, a, u) {
-    var h = n[n.length - 1];
-    h && h.added === a && h.removed === u ? n[n.length - 1] = {
-      count: h.count + 1,
+    var g = n[n.length - 1];
+    g && g.added === a && g.removed === u ? n[n.length - 1] = {
+      count: g.count + 1,
       added: a,
       removed: u
     } : n.push({
@@ -72,8 +72,8 @@ ne.prototype = {
       removed: u
     });
   },
-  extractCommon: function(n, a, u, h) {
-    for (var t = a.length, r = u.length, i = n.newPos, s = i - h, o = 0; i + 1 < t && s + 1 < r && this.equals(a[i + 1], u[s + 1]); )
+  extractCommon: function(n, a, u, g) {
+    for (var t = a.length, r = u.length, i = n.newPos, s = i - g, o = 0; i + 1 < t && s + 1 < r && this.equals(a[i + 1], u[s + 1]); )
       i++, s++, o++;
     return o && n.components.push({
       count: o
@@ -97,7 +97,7 @@ ne.prototype = {
     return n.join("");
   }
 };
-function Kn(e, n, a, u, h) {
+function Kn(e, n, a, u, g) {
   for (var t = 0, r = n.length, i = 0, s = 0; t < r; t++) {
     var o = n[t];
     if (o.removed) {
@@ -106,11 +106,11 @@ function Kn(e, n, a, u, h) {
         n[t - 1] = n[t], n[t] = c;
       }
     } else {
-      if (!o.added && h) {
+      if (!o.added && g) {
         var l = a.slice(i, i + o.count);
-        l = l.map(function(g, d) {
+        l = l.map(function(h, d) {
           var p = u[s + d];
-          return p.length > g.length ? p : g;
+          return p.length > h.length ? p : h;
         }), o.value = e.join(l);
       } else
         o.value = e.join(a.slice(i, i + o.count));
@@ -126,9 +126,9 @@ function Wn(e) {
     components: e.components.slice(0)
   };
 }
-var Qn = new ne();
-function qn(e, n, a) {
-  return Qn.diff(e, n, a);
+var qn = new ne();
+function Qn(e, n, a) {
+  return qn.diff(e, n, a);
 }
 function Zn(e, n) {
   if (typeof e == "function")
@@ -157,8 +157,8 @@ hn.tokenize = function(e) {
   var n = [], a = e.split(/(\n|\r\n)/);
   a[a.length - 1] || a.pop();
   for (var u = 0; u < a.length; u++) {
-    var h = a[u];
-    u % 2 && !this.options.newlineIsToken ? n[n.length - 1] += h : (this.options.ignoreWhitespace && (h = h.trim()), n.push(h));
+    var g = a[u];
+    u % 2 && !this.options.newlineIsToken ? n[n.length - 1] += g : (this.options.ignoreWhitespace && (g = g.trim()), n.push(g));
   }
   return n;
 };
@@ -182,16 +182,16 @@ var Xn = Object.prototype.toString, he = new ne();
 he.useLongestToken = !0;
 he.tokenize = hn.tokenize;
 he.castInput = function(e) {
-  var n = this.options, a = n.undefinedReplacement, u = n.stringifyReplacer, h = u === void 0 ? function(t, r) {
+  var n = this.options, a = n.undefinedReplacement, u = n.stringifyReplacer, g = u === void 0 ? function(t, r) {
     return typeof r == "undefined" ? a : r;
   } : u;
-  return typeof e == "string" ? e : JSON.stringify(Be(e, null, null, h), h, "  ");
+  return typeof e == "string" ? e : JSON.stringify(Be(e, null, null, g), g, "  ");
 };
 he.equals = function(e, n) {
   return ne.prototype.equals.call(he, e.replace(/,([\r\n])/g, "$1"), n.replace(/,([\r\n])/g, "$1"));
 };
-function Be(e, n, a, u, h) {
-  n = n || [], a = a || [], u && (e = u(h, e));
+function Be(e, n, a, u, g) {
+  n = n || [], a = a || [], u && (e = u(g, e));
   var t;
   for (t = 0; t < n.length; t += 1)
     if (n[t] === e)
@@ -199,7 +199,7 @@ function Be(e, n, a, u, h) {
   var r;
   if (Xn.call(e) === "[object Array]") {
     for (n.push(e), r = new Array(e.length), a.push(r), t = 0; t < e.length; t += 1)
-      r[t] = Be(e[t], n, a, u, h);
+      r[t] = Be(e[t], n, a, u, g);
     return n.pop(), a.pop(), r;
   }
   if (e && e.toJSON && (e = e.toJSON()), Te(e) === "object" && e !== null) {
@@ -228,7 +228,7 @@ var dn = { exports: {} };
 (function(e) {
   var n = function() {
     this.Diff_Timeout = 1, this.Diff_EditCost = 4, this.Match_Threshold = 0.5, this.Match_Distance = 1e3, this.Patch_DeleteThreshold = 0.5, this.Patch_Margin = 4, this.Match_MaxBits = 32;
-  }, a = -1, u = 1, h = 0;
+  }, a = -1, u = 1, g = 0;
   n.Diff = function(t, r) {
     return [t, r];
   }, n.prototype.diff_main = function(t, r, i, s) {
@@ -237,14 +237,14 @@ var dn = { exports: {} };
     if (t == null || r == null)
       throw new Error("Null input. (diff_main)");
     if (t == r)
-      return t ? [new n.Diff(h, t)] : [];
+      return t ? [new n.Diff(g, t)] : [];
     typeof i == "undefined" && (i = !0);
     var l = i, c = this.diff_commonPrefix(t, r), f = t.substring(0, c);
     t = t.substring(c), r = r.substring(c), c = this.diff_commonSuffix(t, r);
-    var g = t.substring(t.length - c);
+    var h = t.substring(t.length - c);
     t = t.substring(0, t.length - c), r = r.substring(0, r.length - c);
     var d = this.diff_compute_(t, r, l, o);
-    return f && d.unshift(new n.Diff(h, f)), g && d.push(new n.Diff(h, g)), this.diff_cleanupMerge(d), d;
+    return f && d.unshift(new n.Diff(g, f)), h && d.push(new n.Diff(g, h)), this.diff_cleanupMerge(d), d;
   }, n.prototype.diff_compute_ = function(t, r, i, s) {
     var o;
     if (!t)
@@ -255,7 +255,7 @@ var dn = { exports: {} };
     if (f != -1)
       return o = [
         new n.Diff(u, l.substring(0, f)),
-        new n.Diff(h, c),
+        new n.Diff(g, c),
         new n.Diff(
           u,
           l.substring(f + c.length)
@@ -266,12 +266,12 @@ var dn = { exports: {} };
         new n.Diff(a, t),
         new n.Diff(u, r)
       ];
-    var g = this.diff_halfMatch_(t, r);
-    if (g) {
-      var d = g[0], p = g[1], _ = g[2], E = g[3], b = g[4], y = this.diff_main(d, _, i, s), A = this.diff_main(p, E, i, s);
-      return y.concat(
-        [new n.Diff(h, b)],
-        A
+    var h = this.diff_halfMatch_(t, r);
+    if (h) {
+      var d = h[0], p = h[1], _ = h[2], v = h[3], E = h[4], m = this.diff_main(d, _, i, s), N = this.diff_main(p, v, i, s);
+      return m.concat(
+        [new n.Diff(g, E)],
+        N
       );
     }
     return i && t.length > 100 && r.length > 100 ? this.diff_lineMode_(t, r, s) : this.diff_bisect_(t, r, s);
@@ -279,69 +279,69 @@ var dn = { exports: {} };
     var s = this.diff_linesToChars_(t, r);
     t = s.chars1, r = s.chars2;
     var o = s.lineArray, l = this.diff_main(t, r, !1, i);
-    this.diff_charsToLines_(l, o), this.diff_cleanupSemantic(l), l.push(new n.Diff(h, ""));
-    for (var c = 0, f = 0, g = 0, d = "", p = ""; c < l.length; ) {
+    this.diff_charsToLines_(l, o), this.diff_cleanupSemantic(l), l.push(new n.Diff(g, ""));
+    for (var c = 0, f = 0, h = 0, d = "", p = ""; c < l.length; ) {
       switch (l[c][0]) {
         case u:
-          g++, p += l[c][1];
+          h++, p += l[c][1];
           break;
         case a:
           f++, d += l[c][1];
           break;
-        case h:
-          if (f >= 1 && g >= 1) {
+        case g:
+          if (f >= 1 && h >= 1) {
             l.splice(
-              c - f - g,
-              f + g
-            ), c = c - f - g;
-            for (var _ = this.diff_main(d, p, !1, i), E = _.length - 1; E >= 0; E--)
-              l.splice(c, 0, _[E]);
+              c - f - h,
+              f + h
+            ), c = c - f - h;
+            for (var _ = this.diff_main(d, p, !1, i), v = _.length - 1; v >= 0; v--)
+              l.splice(c, 0, _[v]);
             c = c + _.length;
           }
-          g = 0, f = 0, d = "", p = "";
+          h = 0, f = 0, d = "", p = "";
           break;
       }
       c++;
     }
     return l.pop(), l;
   }, n.prototype.diff_bisect_ = function(t, r, i) {
-    for (var s = t.length, o = r.length, l = Math.ceil((s + o) / 2), c = l, f = 2 * l, g = new Array(f), d = new Array(f), p = 0; p < f; p++)
-      g[p] = -1, d[p] = -1;
-    g[c + 1] = 0, d[c + 1] = 0;
-    for (var _ = s - o, E = _ % 2 != 0, b = 0, y = 0, A = 0, R = 0, w = 0; w < l && !((/* @__PURE__ */ new Date()).getTime() > i); w++) {
-      for (var D = -w + b; D <= w - y; D += 2) {
-        var C = c + D, T;
-        D == -w || D != w && g[C - 1] < g[C + 1] ? T = g[C + 1] : T = g[C - 1] + 1;
-        for (var $ = T - D; T < s && $ < o && t.charAt(T) == r.charAt($); )
-          T++, $++;
-        if (g[C] = T, T > s)
-          y += 2;
-        else if ($ > o)
-          b += 2;
-        else if (E) {
-          var k = c + _ - D;
-          if (k >= 0 && k < f && d[k] != -1) {
-            var P = s - d[k];
-            if (T >= P)
-              return this.diff_bisectSplit_(t, r, T, $, i);
+    for (var s = t.length, o = r.length, l = Math.ceil((s + o) / 2), c = l, f = 2 * l, h = new Array(f), d = new Array(f), p = 0; p < f; p++)
+      h[p] = -1, d[p] = -1;
+    h[c + 1] = 0, d[c + 1] = 0;
+    for (var _ = s - o, v = _ % 2 != 0, E = 0, m = 0, N = 0, D = 0, S = 0; S < l && !((/* @__PURE__ */ new Date()).getTime() > i); S++) {
+      for (var A = -S + E; A <= S - m; A += 2) {
+        var R = c + A, C;
+        A == -S || A != S && h[R - 1] < h[R + 1] ? C = h[R + 1] : C = h[R - 1] + 1;
+        for (var I = C - A; C < s && I < o && t.charAt(C) == r.charAt(I); )
+          C++, I++;
+        if (h[R] = C, C > s)
+          m += 2;
+        else if (I > o)
+          E += 2;
+        else if (v) {
+          var $ = c + _ - A;
+          if ($ >= 0 && $ < f && d[$] != -1) {
+            var B = s - d[$];
+            if (C >= B)
+              return this.diff_bisectSplit_(t, r, C, I, i);
           }
         }
       }
-      for (var F = -w + A; F <= w - R; F += 2) {
-        var k = c + F, P;
-        F == -w || F != w && d[k - 1] < d[k + 1] ? P = d[k + 1] : P = d[k - 1] + 1;
-        for (var K = P - F; P < s && K < o && t.charAt(s - P - 1) == r.charAt(o - K - 1); )
-          P++, K++;
-        if (d[k] = P, P > s)
-          R += 2;
+      for (var F = -S + N; F <= S - D; F += 2) {
+        var $ = c + F, B;
+        F == -S || F != S && d[$ - 1] < d[$ + 1] ? B = d[$ + 1] : B = d[$ - 1] + 1;
+        for (var K = B - F; B < s && K < o && t.charAt(s - B - 1) == r.charAt(o - K - 1); )
+          B++, K++;
+        if (d[$] = B, B > s)
+          D += 2;
         else if (K > o)
-          A += 2;
-        else if (!E) {
-          var C = c + _ - F;
-          if (C >= 0 && C < f && g[C] != -1) {
-            var T = g[C], $ = c + T - C;
-            if (P = s - P, T >= P)
-              return this.diff_bisectSplit_(t, r, T, $, i);
+          N += 2;
+        else if (!v) {
+          var R = c + _ - F;
+          if (R >= 0 && R < f && h[R] != -1) {
+            var C = h[R], I = c + C - R;
+            if (B = s - B, C >= B)
+              return this.diff_bisectSplit_(t, r, C, I, i);
           }
         }
       }
@@ -351,17 +351,17 @@ var dn = { exports: {} };
       new n.Diff(u, r)
     ];
   }, n.prototype.diff_bisectSplit_ = function(t, r, i, s, o) {
-    var l = t.substring(0, i), c = r.substring(0, s), f = t.substring(i), g = r.substring(s), d = this.diff_main(l, c, !1, o), p = this.diff_main(f, g, !1, o);
+    var l = t.substring(0, i), c = r.substring(0, s), f = t.substring(i), h = r.substring(s), d = this.diff_main(l, c, !1, o), p = this.diff_main(f, h, !1, o);
     return d.concat(p);
   }, n.prototype.diff_linesToChars_ = function(t, r) {
     var i = [], s = {};
     i[0] = "";
-    function o(g) {
-      for (var d = "", p = 0, _ = -1, E = i.length; _ < g.length - 1; ) {
-        _ = g.indexOf(`
-`, p), _ == -1 && (_ = g.length - 1);
-        var b = g.substring(p, _ + 1);
-        (s.hasOwnProperty ? s.hasOwnProperty(b) : s[b] !== void 0) ? d += String.fromCharCode(s[b]) : (E == l && (b = g.substring(p), _ = g.length), d += String.fromCharCode(E), s[b] = E, i[E++] = b), p = _ + 1;
+    function o(h) {
+      for (var d = "", p = 0, _ = -1, v = i.length; _ < h.length - 1; ) {
+        _ = h.indexOf(`
+`, p), _ == -1 && (_ = h.length - 1);
+        var E = h.substring(p, _ + 1);
+        (s.hasOwnProperty ? s.hasOwnProperty(E) : s[E] !== void 0) ? d += String.fromCharCode(s[E]) : (v == l && (E = h.substring(p), _ = h.length), d += String.fromCharCode(v), s[E] = v, i[v++] = E), p = _ + 1;
       }
       return d;
     }
@@ -396,10 +396,10 @@ var dn = { exports: {} };
     if (t == r)
       return o;
     for (var l = 0, c = 1; ; ) {
-      var f = t.substring(o - c), g = r.indexOf(f);
-      if (g == -1)
+      var f = t.substring(o - c), h = r.indexOf(f);
+      if (h == -1)
         return l;
-      c += g, (g == 0 || t.substring(o - c) == r.substring(0, c)) && (l = c, c++);
+      c += h, (h == 0 || t.substring(o - c) == r.substring(0, c)) && (l = c, c++);
     }
   }, n.prototype.diff_halfMatch_ = function(t, r) {
     if (this.Diff_Timeout <= 0)
@@ -408,23 +408,23 @@ var dn = { exports: {} };
     if (i.length < 4 || s.length * 2 < i.length)
       return null;
     var o = this;
-    function l(y, A, R) {
-      for (var w = y.substring(R, R + Math.floor(y.length / 4)), D = -1, C = "", T, $, k, P; (D = A.indexOf(w, D + 1)) != -1; ) {
+    function l(m, N, D) {
+      for (var S = m.substring(D, D + Math.floor(m.length / 4)), A = -1, R = "", C, I, $, B; (A = N.indexOf(S, A + 1)) != -1; ) {
         var F = o.diff_commonPrefix(
-          y.substring(R),
-          A.substring(D)
+          m.substring(D),
+          N.substring(A)
         ), K = o.diff_commonSuffix(
-          y.substring(0, R),
-          A.substring(0, D)
+          m.substring(0, D),
+          N.substring(0, A)
         );
-        C.length < K + F && (C = A.substring(D - K, D) + A.substring(D, D + F), T = y.substring(0, R - K), $ = y.substring(R + F), k = A.substring(0, D - K), P = A.substring(D + F));
+        R.length < K + F && (R = N.substring(A - K, A) + N.substring(A, A + F), C = m.substring(0, D - K), I = m.substring(D + F), $ = N.substring(0, A - K), B = N.substring(A + F));
       }
-      return C.length * 2 >= y.length ? [
-        T,
+      return R.length * 2 >= m.length ? [
+        C,
+        I,
         $,
-        k,
-        P,
-        C
+        B,
+        R
       ] : null;
     }
     var c = l(
@@ -435,70 +435,70 @@ var dn = { exports: {} };
       i,
       s,
       Math.ceil(i.length / 2)
-    ), g;
+    ), h;
     if (!c && !f)
       return null;
-    f ? c ? g = c[4].length > f[4].length ? c : f : g = f : g = c;
-    var d, p, _, E;
-    t.length > r.length ? (d = g[0], p = g[1], _ = g[2], E = g[3]) : (_ = g[0], E = g[1], d = g[2], p = g[3]);
-    var b = g[4];
-    return [d, p, _, E, b];
+    f ? c ? h = c[4].length > f[4].length ? c : f : h = f : h = c;
+    var d, p, _, v;
+    t.length > r.length ? (d = h[0], p = h[1], _ = h[2], v = h[3]) : (_ = h[0], v = h[1], d = h[2], p = h[3]);
+    var E = h[4];
+    return [d, p, _, v, E];
   }, n.prototype.diff_cleanupSemantic = function(t) {
-    for (var r = !1, i = [], s = 0, o = null, l = 0, c = 0, f = 0, g = 0, d = 0; l < t.length; )
-      t[l][0] == h ? (i[s++] = l, c = g, f = d, g = 0, d = 0, o = t[l][1]) : (t[l][0] == u ? g += t[l][1].length : d += t[l][1].length, o && o.length <= Math.max(c, f) && o.length <= Math.max(
-        g,
+    for (var r = !1, i = [], s = 0, o = null, l = 0, c = 0, f = 0, h = 0, d = 0; l < t.length; )
+      t[l][0] == g ? (i[s++] = l, c = h, f = d, h = 0, d = 0, o = t[l][1]) : (t[l][0] == u ? h += t[l][1].length : d += t[l][1].length, o && o.length <= Math.max(c, f) && o.length <= Math.max(
+        h,
         d
       ) && (t.splice(
         i[s - 1],
         0,
         new n.Diff(a, o)
-      ), t[i[s - 1] + 1][0] = u, s--, s--, l = s > 0 ? i[s - 1] : -1, c = 0, f = 0, g = 0, d = 0, o = null, r = !0)), l++;
+      ), t[i[s - 1] + 1][0] = u, s--, s--, l = s > 0 ? i[s - 1] : -1, c = 0, f = 0, h = 0, d = 0, o = null, r = !0)), l++;
     for (r && this.diff_cleanupMerge(t), this.diff_cleanupSemanticLossless(t), l = 1; l < t.length; ) {
       if (t[l - 1][0] == a && t[l][0] == u) {
-        var p = t[l - 1][1], _ = t[l][1], E = this.diff_commonOverlap_(p, _), b = this.diff_commonOverlap_(_, p);
-        E >= b ? (E >= p.length / 2 || E >= _.length / 2) && (t.splice(l, 0, new n.Diff(
-          h,
-          _.substring(0, E)
-        )), t[l - 1][1] = p.substring(0, p.length - E), t[l + 1][1] = _.substring(E), l++) : (b >= p.length / 2 || b >= _.length / 2) && (t.splice(l, 0, new n.Diff(
-          h,
-          p.substring(0, b)
-        )), t[l - 1][0] = u, t[l - 1][1] = _.substring(0, _.length - b), t[l + 1][0] = a, t[l + 1][1] = p.substring(b), l++), l++;
+        var p = t[l - 1][1], _ = t[l][1], v = this.diff_commonOverlap_(p, _), E = this.diff_commonOverlap_(_, p);
+        v >= E ? (v >= p.length / 2 || v >= _.length / 2) && (t.splice(l, 0, new n.Diff(
+          g,
+          _.substring(0, v)
+        )), t[l - 1][1] = p.substring(0, p.length - v), t[l + 1][1] = _.substring(v), l++) : (E >= p.length / 2 || E >= _.length / 2) && (t.splice(l, 0, new n.Diff(
+          g,
+          p.substring(0, E)
+        )), t[l - 1][0] = u, t[l - 1][1] = _.substring(0, _.length - E), t[l + 1][0] = a, t[l + 1][1] = p.substring(E), l++), l++;
       }
       l++;
     }
   }, n.prototype.diff_cleanupSemanticLossless = function(t) {
-    function r(b, y) {
-      if (!b || !y)
+    function r(E, m) {
+      if (!E || !m)
         return 6;
-      var A = b.charAt(b.length - 1), R = y.charAt(0), w = A.match(n.nonAlphaNumericRegex_), D = R.match(n.nonAlphaNumericRegex_), C = w && A.match(n.whitespaceRegex_), T = D && R.match(n.whitespaceRegex_), $ = C && A.match(n.linebreakRegex_), k = T && R.match(n.linebreakRegex_), P = $ && b.match(n.blanklineEndRegex_), F = k && y.match(n.blanklineStartRegex_);
-      return P || F ? 5 : $ || k ? 4 : w && !C && T ? 3 : C || T ? 2 : w || D ? 1 : 0;
+      var N = E.charAt(E.length - 1), D = m.charAt(0), S = N.match(n.nonAlphaNumericRegex_), A = D.match(n.nonAlphaNumericRegex_), R = S && N.match(n.whitespaceRegex_), C = A && D.match(n.whitespaceRegex_), I = R && N.match(n.linebreakRegex_), $ = C && D.match(n.linebreakRegex_), B = I && E.match(n.blanklineEndRegex_), F = $ && m.match(n.blanklineStartRegex_);
+      return B || F ? 5 : I || $ ? 4 : S && !R && C ? 3 : R || C ? 2 : S || A ? 1 : 0;
     }
     for (var i = 1; i < t.length - 1; ) {
-      if (t[i - 1][0] == h && t[i + 1][0] == h) {
+      if (t[i - 1][0] == g && t[i + 1][0] == g) {
         var s = t[i - 1][1], o = t[i][1], l = t[i + 1][1], c = this.diff_commonSuffix(s, o);
         if (c) {
           var f = o.substring(o.length - c);
           s = s.substring(0, s.length - c), o = f + o.substring(0, o.length - c), l = f + l;
         }
-        for (var g = s, d = o, p = l, _ = r(s, o) + r(o, l); o.charAt(0) === l.charAt(0); ) {
+        for (var h = s, d = o, p = l, _ = r(s, o) + r(o, l); o.charAt(0) === l.charAt(0); ) {
           s += o.charAt(0), o = o.substring(1) + l.charAt(0), l = l.substring(1);
-          var E = r(s, o) + r(o, l);
-          E >= _ && (_ = E, g = s, d = o, p = l);
+          var v = r(s, o) + r(o, l);
+          v >= _ && (_ = v, h = s, d = o, p = l);
         }
-        t[i - 1][1] != g && (g ? t[i - 1][1] = g : (t.splice(i - 1, 1), i--), t[i][1] = d, p ? t[i + 1][1] = p : (t.splice(i + 1, 1), i--));
+        t[i - 1][1] != h && (h ? t[i - 1][1] = h : (t.splice(i - 1, 1), i--), t[i][1] = d, p ? t[i + 1][1] = p : (t.splice(i + 1, 1), i--));
       }
       i++;
     }
   }, n.nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/, n.whitespaceRegex_ = /\s/, n.linebreakRegex_ = /[\r\n]/, n.blanklineEndRegex_ = /\n\r?\n$/, n.blanklineStartRegex_ = /^\r?\n\r?\n/, n.prototype.diff_cleanupEfficiency = function(t) {
-    for (var r = !1, i = [], s = 0, o = null, l = 0, c = !1, f = !1, g = !1, d = !1; l < t.length; )
-      t[l][0] == h ? (t[l][1].length < this.Diff_EditCost && (g || d) ? (i[s++] = l, c = g, f = d, o = t[l][1]) : (s = 0, o = null), g = d = !1) : (t[l][0] == a ? d = !0 : g = !0, o && (c && f && g && d || o.length < this.Diff_EditCost / 2 && c + f + g + d == 3) && (t.splice(
+    for (var r = !1, i = [], s = 0, o = null, l = 0, c = !1, f = !1, h = !1, d = !1; l < t.length; )
+      t[l][0] == g ? (t[l][1].length < this.Diff_EditCost && (h || d) ? (i[s++] = l, c = h, f = d, o = t[l][1]) : (s = 0, o = null), h = d = !1) : (t[l][0] == a ? d = !0 : h = !0, o && (c && f && h && d || o.length < this.Diff_EditCost / 2 && c + f + h + d == 3) && (t.splice(
         i[s - 1],
         0,
         new n.Diff(a, o)
-      ), t[i[s - 1] + 1][0] = u, s--, o = null, c && f ? (g = d = !0, s = 0) : (s--, l = s > 0 ? i[s - 1] : -1, g = d = !1), r = !0)), l++;
+      ), t[i[s - 1] + 1][0] = u, s--, o = null, c && f ? (h = d = !0, s = 0) : (s--, l = s > 0 ? i[s - 1] : -1, h = d = !1), r = !0)), l++;
     r && this.diff_cleanupMerge(t);
   }, n.prototype.diff_cleanupMerge = function(t) {
-    t.push(new n.Diff(h, ""));
+    t.push(new n.Diff(g, ""));
     for (var r = 0, i = 0, s = 0, o = "", l = "", c; r < t.length; )
       switch (t[r][0]) {
         case u:
@@ -507,9 +507,9 @@ var dn = { exports: {} };
         case a:
           i++, o += t[r][1], r++;
           break;
-        case h:
-          i + s > 1 ? (i !== 0 && s !== 0 && (c = this.diff_commonPrefix(l, o), c !== 0 && (r - i - s > 0 && t[r - i - s - 1][0] == h ? t[r - i - s - 1][1] += l.substring(0, c) : (t.splice(0, 0, new n.Diff(
-            h,
+        case g:
+          i + s > 1 ? (i !== 0 && s !== 0 && (c = this.diff_commonPrefix(l, o), c !== 0 && (r - i - s > 0 && t[r - i - s - 1][0] == g ? t[r - i - s - 1][1] += l.substring(0, c) : (t.splice(0, 0, new n.Diff(
+            g,
             l.substring(0, c)
           )), r++), l = l.substring(c), o = o.substring(c)), c = this.diff_commonSuffix(l, o), c !== 0 && (t[r][1] = l.substring(l.length - c) + t[r][1], l = l.substring(0, l.length - c), o = o.substring(0, o.length - c))), r -= i + s, t.splice(r, i + s), o.length && (t.splice(
             r,
@@ -519,13 +519,13 @@ var dn = { exports: {} };
             r,
             0,
             new n.Diff(u, l)
-          ), r++), r++) : r !== 0 && t[r - 1][0] == h ? (t[r - 1][1] += t[r][1], t.splice(r, 1)) : r++, s = 0, i = 0, o = "", l = "";
+          ), r++), r++) : r !== 0 && t[r - 1][0] == g ? (t[r - 1][1] += t[r][1], t.splice(r, 1)) : r++, s = 0, i = 0, o = "", l = "";
           break;
       }
     t[t.length - 1][1] === "" && t.pop();
     var f = !1;
     for (r = 1; r < t.length - 1; )
-      t[r - 1][0] == h && t[r + 1][0] == h && (t[r][1].substring(t[r][1].length - t[r - 1][1].length) == t[r - 1][1] ? (t[r][1] = t[r - 1][1] + t[r][1].substring(0, t[r][1].length - t[r - 1][1].length), t[r + 1][1] = t[r - 1][1] + t[r + 1][1], t.splice(r - 1, 1), f = !0) : t[r][1].substring(0, t[r + 1][1].length) == t[r + 1][1] && (t[r - 1][1] += t[r + 1][1], t[r][1] = t[r][1].substring(t[r + 1][1].length) + t[r + 1][1], t.splice(r + 1, 1), f = !0)), r++;
+      t[r - 1][0] == g && t[r + 1][0] == g && (t[r][1].substring(t[r][1].length - t[r - 1][1].length) == t[r - 1][1] ? (t[r][1] = t[r - 1][1] + t[r][1].substring(0, t[r][1].length - t[r - 1][1].length), t[r + 1][1] = t[r - 1][1] + t[r + 1][1], t.splice(r - 1, 1), f = !0) : t[r][1].substring(0, t[r + 1][1].length) == t[r + 1][1] && (t[r - 1][1] += t[r + 1][1], t[r][1] = t[r][1].substring(t[r + 1][1].length) + t[r + 1][1], t.splice(r + 1, 1), f = !0)), r++;
     f && this.diff_cleanupMerge(t);
   }, n.prototype.diff_xIndex = function(t, r) {
     var i = 0, s = 0, o = 0, l = 0, c;
@@ -534,7 +534,7 @@ var dn = { exports: {} };
     return t.length != c && t[c][0] === a ? l : l + (r - o);
   }, n.prototype.diff_prettyHtml = function(t) {
     for (var r = [], i = /&/g, s = /</g, o = />/g, l = /\n/g, c = 0; c < t.length; c++) {
-      var f = t[c][0], g = t[c][1], d = g.replace(i, "&amp;").replace(s, "&lt;").replace(o, "&gt;").replace(l, "&para;<br>");
+      var f = t[c][0], h = t[c][1], d = h.replace(i, "&amp;").replace(s, "&lt;").replace(o, "&gt;").replace(l, "&para;<br>");
       switch (f) {
         case u:
           r[c] = '<ins style="background:#e6ffe6;">' + d + "</ins>";
@@ -542,7 +542,7 @@ var dn = { exports: {} };
         case a:
           r[c] = '<del style="background:#ffe6e6;">' + d + "</del>";
           break;
-        case h:
+        case g:
           r[c] = "<span>" + d + "</span>";
           break;
       }
@@ -566,7 +566,7 @@ var dn = { exports: {} };
         case a:
           s += c.length;
           break;
-        case h:
+        case g:
           r += Math.max(i, s), i = 0, s = 0;
           break;
       }
@@ -581,7 +581,7 @@ var dn = { exports: {} };
         case a:
           r[i] = "-" + t[i][1].length;
           break;
-        case h:
+        case g:
           r[i] = "=" + t[i][1].length;
           break;
       }
@@ -599,11 +599,11 @@ var dn = { exports: {} };
           break;
         case "-":
         case "=":
-          var g = parseInt(f, 10);
-          if (isNaN(g) || g < 0)
+          var h = parseInt(f, 10);
+          if (isNaN(h) || h < 0)
             throw new Error("Invalid number in diff_fromDelta: " + f);
-          var d = t.substring(o, o += g);
-          l[c].charAt(0) == "=" ? i[s++] = new n.Diff(h, d) : i[s++] = new n.Diff(a, d);
+          var d = t.substring(o, o += h);
+          l[c].charAt(0) == "=" ? i[s++] = new n.Diff(g, d) : i[s++] = new n.Diff(a, d);
           break;
         default:
           if (l[c])
@@ -621,34 +621,34 @@ var dn = { exports: {} };
     if (r.length > this.Match_MaxBits)
       throw new Error("Pattern too long for this browser.");
     var s = this.match_alphabet_(r), o = this;
-    function l(T, $) {
-      var k = T / r.length, P = Math.abs(i - $);
-      return o.Match_Distance ? k + P / o.Match_Distance : P ? 1 : k;
+    function l(C, I) {
+      var $ = C / r.length, B = Math.abs(i - I);
+      return o.Match_Distance ? $ + B / o.Match_Distance : B ? 1 : $;
     }
     var c = this.Match_Threshold, f = t.indexOf(r, i);
     f != -1 && (c = Math.min(l(0, f), c), f = t.lastIndexOf(r, i + r.length), f != -1 && (c = Math.min(l(0, f), c)));
-    var g = 1 << r.length - 1;
+    var h = 1 << r.length - 1;
     f = -1;
-    for (var d, p, _ = r.length + t.length, E, b = 0; b < r.length; b++) {
+    for (var d, p, _ = r.length + t.length, v, E = 0; E < r.length; E++) {
       for (d = 0, p = _; d < p; )
-        l(b, i + p) <= c ? d = p : _ = p, p = Math.floor((_ - d) / 2 + d);
+        l(E, i + p) <= c ? d = p : _ = p, p = Math.floor((_ - d) / 2 + d);
       _ = p;
-      var y = Math.max(1, i - p + 1), A = Math.min(i + p, t.length) + r.length, R = Array(A + 2);
-      R[A + 1] = (1 << b) - 1;
-      for (var w = A; w >= y; w--) {
-        var D = s[t.charAt(w - 1)];
-        if (b === 0 ? R[w] = (R[w + 1] << 1 | 1) & D : R[w] = (R[w + 1] << 1 | 1) & D | ((E[w + 1] | E[w]) << 1 | 1) | E[w + 1], R[w] & g) {
-          var C = l(b, w - 1);
-          if (C <= c)
-            if (c = C, f = w - 1, f > i)
-              y = Math.max(1, 2 * i - f);
+      var m = Math.max(1, i - p + 1), N = Math.min(i + p, t.length) + r.length, D = Array(N + 2);
+      D[N + 1] = (1 << E) - 1;
+      for (var S = N; S >= m; S--) {
+        var A = s[t.charAt(S - 1)];
+        if (E === 0 ? D[S] = (D[S + 1] << 1 | 1) & A : D[S] = (D[S + 1] << 1 | 1) & A | ((v[S + 1] | v[S]) << 1 | 1) | v[S + 1], D[S] & h) {
+          var R = l(E, S - 1);
+          if (R <= c)
+            if (c = R, f = S - 1, f > i)
+              m = Math.max(1, 2 * i - f);
             else
               break;
         }
       }
-      if (l(b + 1, i) > c)
+      if (l(E + 1, i) > c)
         break;
-      E = R;
+      v = D;
     }
     return f;
   }, n.prototype.match_alphabet_ = function(t) {
@@ -668,12 +668,12 @@ var dn = { exports: {} };
         );
       s += this.Patch_Margin;
       var o = r.substring(t.start2 - s, t.start2);
-      o && t.diffs.unshift(new n.Diff(h, o));
+      o && t.diffs.unshift(new n.Diff(g, o));
       var l = r.substring(
         t.start2 + t.length1,
         t.start2 + t.length1 + s
       );
-      l && t.diffs.push(new n.Diff(h, l)), t.start1 -= o.length, t.start2 -= o.length, t.length1 += o.length + l.length, t.length2 += o.length + l.length;
+      l && t.diffs.push(new n.Diff(g, l)), t.start1 -= o.length, t.start2 -= o.length, t.length1 += o.length + l.length, t.length2 += o.length + l.length;
     }
   }, n.prototype.patch_make = function(t, r, i) {
     var s, o;
@@ -700,20 +700,20 @@ var dn = { exports: {} };
       throw new Error("Unknown call format to patch_make.");
     if (o.length === 0)
       return [];
-    for (var l = [], c = new n.patch_obj(), f = 0, g = 0, d = 0, p = s, _ = s, E = 0; E < o.length; E++) {
-      var b = o[E][0], y = o[E][1];
-      switch (!f && b !== h && (c.start1 = g, c.start2 = d), b) {
+    for (var l = [], c = new n.patch_obj(), f = 0, h = 0, d = 0, p = s, _ = s, v = 0; v < o.length; v++) {
+      var E = o[v][0], m = o[v][1];
+      switch (!f && E !== g && (c.start1 = h, c.start2 = d), E) {
         case u:
-          c.diffs[f++] = o[E], c.length2 += y.length, _ = _.substring(0, d) + y + _.substring(d);
+          c.diffs[f++] = o[v], c.length2 += m.length, _ = _.substring(0, d) + m + _.substring(d);
           break;
         case a:
-          c.length1 += y.length, c.diffs[f++] = o[E], _ = _.substring(0, d) + _.substring(d + y.length);
+          c.length1 += m.length, c.diffs[f++] = o[v], _ = _.substring(0, d) + _.substring(d + m.length);
           break;
-        case h:
-          y.length <= 2 * this.Patch_Margin && f && o.length != E + 1 ? (c.diffs[f++] = o[E], c.length1 += y.length, c.length2 += y.length) : y.length >= 2 * this.Patch_Margin && f && (this.patch_addContext_(c, p), l.push(c), c = new n.patch_obj(), f = 0, p = _, g = d);
+        case g:
+          m.length <= 2 * this.Patch_Margin && f && o.length != v + 1 ? (c.diffs[f++] = o[v], c.length1 += m.length, c.length2 += m.length) : m.length >= 2 * this.Patch_Margin && f && (this.patch_addContext_(c, p), l.push(c), c = new n.patch_obj(), f = 0, p = _, h = d);
           break;
       }
-      b !== u && (g += y.length), b !== a && (d += y.length);
+      E !== u && (h += m.length), E !== a && (d += m.length);
     }
     return f && (this.patch_addContext_(c, p), l.push(c)), l;
   }, n.prototype.patch_deepCopy = function(t) {
@@ -732,34 +732,34 @@ var dn = { exports: {} };
     var i = this.patch_addPadding(t);
     r = i + r + i, this.patch_splitMax(t);
     for (var s = 0, o = [], l = 0; l < t.length; l++) {
-      var c = t[l].start2 + s, f = this.diff_text1(t[l].diffs), g, d = -1;
-      if (f.length > this.Match_MaxBits ? (g = this.match_main(
+      var c = t[l].start2 + s, f = this.diff_text1(t[l].diffs), h, d = -1;
+      if (f.length > this.Match_MaxBits ? (h = this.match_main(
         r,
         f.substring(0, this.Match_MaxBits),
         c
-      ), g != -1 && (d = this.match_main(
+      ), h != -1 && (d = this.match_main(
         r,
         f.substring(f.length - this.Match_MaxBits),
         c + f.length - this.Match_MaxBits
-      ), (d == -1 || g >= d) && (g = -1))) : g = this.match_main(r, f, c), g == -1)
+      ), (d == -1 || h >= d) && (h = -1))) : h = this.match_main(r, f, c), h == -1)
         o[l] = !1, s -= t[l].length2 - t[l].length1;
       else {
-        o[l] = !0, s = g - c;
+        o[l] = !0, s = h - c;
         var p;
-        if (d == -1 ? p = r.substring(g, g + f.length) : p = r.substring(g, d + this.Match_MaxBits), f == p)
-          r = r.substring(0, g) + this.diff_text2(t[l].diffs) + r.substring(g + f.length);
+        if (d == -1 ? p = r.substring(h, h + f.length) : p = r.substring(h, d + this.Match_MaxBits), f == p)
+          r = r.substring(0, h) + this.diff_text2(t[l].diffs) + r.substring(h + f.length);
         else {
           var _ = this.diff_main(f, p, !1);
           if (f.length > this.Match_MaxBits && this.diff_levenshtein(_) / f.length > this.Patch_DeleteThreshold)
             o[l] = !1;
           else {
             this.diff_cleanupSemanticLossless(_);
-            for (var E = 0, b, y = 0; y < t[l].diffs.length; y++) {
-              var A = t[l].diffs[y];
-              A[0] !== h && (b = this.diff_xIndex(_, E)), A[0] === u ? r = r.substring(0, g + b) + A[1] + r.substring(g + b) : A[0] === a && (r = r.substring(0, g + b) + r.substring(g + this.diff_xIndex(
+            for (var v = 0, E, m = 0; m < t[l].diffs.length; m++) {
+              var N = t[l].diffs[m];
+              N[0] !== g && (E = this.diff_xIndex(_, v)), N[0] === u ? r = r.substring(0, h + E) + N[1] + r.substring(h + E) : N[0] === a && (r = r.substring(0, h + E) + r.substring(h + this.diff_xIndex(
                 _,
-                E + A[1].length
-              ))), A[0] !== a && (E += A[1].length);
+                v + N[1].length
+              ))), N[0] !== a && (v += N[1].length);
             }
           }
         }
@@ -772,14 +772,14 @@ var dn = { exports: {} };
     for (var s = 0; s < t.length; s++)
       t[s].start1 += r, t[s].start2 += r;
     var o = t[0], l = o.diffs;
-    if (l.length == 0 || l[0][0] != h)
-      l.unshift(new n.Diff(h, i)), o.start1 -= r, o.start2 -= r, o.length1 += r, o.length2 += r;
+    if (l.length == 0 || l[0][0] != g)
+      l.unshift(new n.Diff(g, i)), o.start1 -= r, o.start2 -= r, o.length1 += r, o.length2 += r;
     else if (r > l[0][1].length) {
       var c = r - l[0][1].length;
       l[0][1] = i.substring(l[0][1].length) + l[0][1], o.start1 -= c, o.start2 -= c, o.length1 += c, o.length2 += c;
     }
-    if (o = t[t.length - 1], l = o.diffs, l.length == 0 || l[l.length - 1][0] != h)
-      l.push(new n.Diff(h, i)), o.length1 += r, o.length2 += r;
+    if (o = t[t.length - 1], l = o.diffs, l.length == 0 || l[l.length - 1][0] != g)
+      l.push(new n.Diff(g, i)), o.length1 += r, o.length2 += r;
     else if (r > l[l.length - 1][1].length) {
       var c = r - l[l.length - 1][1].length;
       l[l.length - 1][1] += i.substring(0, c), o.length1 += c, o.length2 += c;
@@ -791,17 +791,17 @@ var dn = { exports: {} };
         var s = t[i];
         t.splice(i--, 1);
         for (var o = s.start1, l = s.start2, c = ""; s.diffs.length !== 0; ) {
-          var f = new n.patch_obj(), g = !0;
-          for (f.start1 = o - c.length, f.start2 = l - c.length, c !== "" && (f.length1 = f.length2 = c.length, f.diffs.push(new n.Diff(h, c))); s.diffs.length !== 0 && f.length1 < r - this.Patch_Margin; ) {
+          var f = new n.patch_obj(), h = !0;
+          for (f.start1 = o - c.length, f.start2 = l - c.length, c !== "" && (f.length1 = f.length2 = c.length, f.diffs.push(new n.Diff(g, c))); s.diffs.length !== 0 && f.length1 < r - this.Patch_Margin; ) {
             var d = s.diffs[0][0], p = s.diffs[0][1];
-            d === u ? (f.length2 += p.length, l += p.length, f.diffs.push(s.diffs.shift()), g = !1) : d === a && f.diffs.length == 1 && f.diffs[0][0] == h && p.length > 2 * r ? (f.length1 += p.length, o += p.length, g = !1, f.diffs.push(new n.Diff(d, p)), s.diffs.shift()) : (p = p.substring(
+            d === u ? (f.length2 += p.length, l += p.length, f.diffs.push(s.diffs.shift()), h = !1) : d === a && f.diffs.length == 1 && f.diffs[0][0] == g && p.length > 2 * r ? (f.length1 += p.length, o += p.length, h = !1, f.diffs.push(new n.Diff(d, p)), s.diffs.shift()) : (p = p.substring(
               0,
               r - f.length1 - this.Patch_Margin
-            ), f.length1 += p.length, o += p.length, d === h ? (f.length2 += p.length, l += p.length) : g = !1, f.diffs.push(new n.Diff(d, p)), p == s.diffs[0][1] ? s.diffs.shift() : s.diffs[0][1] = s.diffs[0][1].substring(p.length));
+            ), f.length1 += p.length, o += p.length, d === g ? (f.length2 += p.length, l += p.length) : h = !1, f.diffs.push(new n.Diff(d, p)), p == s.diffs[0][1] ? s.diffs.shift() : s.diffs[0][1] = s.diffs[0][1].substring(p.length));
           }
           c = this.diff_text2(f.diffs), c = c.substring(c.length - this.Patch_Margin);
           var _ = this.diff_text1(s.diffs).substring(0, this.Patch_Margin);
-          _ !== "" && (f.length1 += _.length, f.length2 += _.length, f.diffs.length !== 0 && f.diffs[f.diffs.length - 1][0] === h ? f.diffs[f.diffs.length - 1][1] += _ : f.diffs.push(new n.Diff(h, _))), g || t.splice(++i, 0, f);
+          _ !== "" && (f.length1 += _.length, f.length2 += _.length, f.diffs.length !== 0 && f.diffs[f.diffs.length - 1][0] === g ? f.diffs[f.diffs.length - 1][1] += _ : f.diffs.push(new n.Diff(g, _))), h || t.splice(++i, 0, f);
         }
       }
   }, n.prototype.patch_toText = function(t) {
@@ -821,21 +821,21 @@ var dn = { exports: {} };
       for (r.push(c), c.start1 = parseInt(l[1], 10), l[2] === "" ? (c.start1--, c.length1 = 1) : l[2] == "0" ? c.length1 = 0 : (c.start1--, c.length1 = parseInt(l[2], 10)), c.start2 = parseInt(l[3], 10), l[4] === "" ? (c.start2--, c.length2 = 1) : l[4] == "0" ? c.length2 = 0 : (c.start2--, c.length2 = parseInt(l[4], 10)), s++; s < i.length; ) {
         var f = i[s].charAt(0);
         try {
-          var g = decodeURI(i[s].substring(1));
+          var h = decodeURI(i[s].substring(1));
         } catch (d) {
-          throw new Error("Illegal escape in patch_fromText: " + g);
+          throw new Error("Illegal escape in patch_fromText: " + h);
         }
         if (f == "-")
-          c.diffs.push(new n.Diff(a, g));
+          c.diffs.push(new n.Diff(a, h));
         else if (f == "+")
-          c.diffs.push(new n.Diff(u, g));
+          c.diffs.push(new n.Diff(u, h));
         else if (f == " ")
-          c.diffs.push(new n.Diff(h, g));
+          c.diffs.push(new n.Diff(g, h));
         else {
           if (f == "@")
             break;
           if (f !== "")
-            throw new Error('Invalid patch mode "' + f + '" in: ' + g);
+            throw new Error('Invalid patch mode "' + f + '" in: ' + h);
         }
         s++;
       }
@@ -855,7 +855,7 @@ var dn = { exports: {} };
         case a:
           s = "-";
           break;
-        case h:
+        case g:
           s = " ";
           break;
       }
@@ -863,7 +863,7 @@ var dn = { exports: {} };
 `;
     }
     return i.join("").replace(/%20/g, " ");
-  }, e.exports = n, e.exports.diff_match_patch = n, e.exports.DIFF_DELETE = a, e.exports.DIFF_INSERT = u, e.exports.DIFF_EQUAL = h;
+  }, e.exports = n, e.exports.diff_match_patch = n, e.exports.DIFF_DELETE = a, e.exports.DIFF_INSERT = u, e.exports.DIFF_EQUAL = g;
 })(dn);
 var Ie = dn.exports;
 function pn(e) {
@@ -895,8 +895,8 @@ function re(e, ...n) {
   for (const u in e)
     a[u] = e[u];
   return n.forEach(function(u) {
-    for (const h in u)
-      a[h] = u[h];
+    for (const g in u)
+      a[g] = u[g];
   }), /** @type {T} */
   a;
 }
@@ -907,7 +907,7 @@ const et = "</span>", Je = (e) => !!e.scope, nt = (e, { prefix: n }) => {
     const a = e.split(".");
     return [
       `${n}${a.shift()}`,
-      ...a.map((u, h) => `${u}${"_".repeat(h + 1)}`)
+      ...a.map((u, g) => `${u}${"_".repeat(g + 1)}`)
     ].join(" ");
   }
   return `${n}${e}`;
@@ -1090,7 +1090,7 @@ function Fe(e, { joinWith: n }) {
   let a = 0;
   return e.map((u) => {
     a += 1;
-    const h = a;
+    const g = a;
     let t = de(u), r = "";
     for (; t.length > 0; ) {
       const i = lt.exec(t);
@@ -1098,7 +1098,7 @@ function Fe(e, { joinWith: n }) {
         r += t;
         break;
       }
-      r += t.substring(0, i.index), t = t.substring(i.index + i[0].length), i[0][0] === "\\" && i[1] ? r += "\\" + String(Number(i[1]) + h) : (r += i[0], i[0] === "(" && a++);
+      r += t.substring(0, i.index), t = t.substring(i.index + i[0].length), i[0][0] === "\\" && i[1] ? r += "\\" + String(Number(i[1]) + g) : (r += i[0], i[0] === "(" && a++);
     }
     return r;
   }).map((u) => `(${u})`).join(n);
@@ -1137,7 +1137,7 @@ const ct = /\b\B/, En = "[a-zA-Z]\\w*", ze = "[a-zA-Z_]\\w*", mn = "\\b\\d+(\\.\
   contains: [pe]
 }, dt = {
   begin: /\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\b/
-}, Re = function(e, n, a = {}) {
+}, Ce = function(e, n, a = {}) {
   const u = re(
     {
       scope: "comment",
@@ -1156,7 +1156,7 @@ const ct = /\b\B/, En = "[a-zA-Z]\\w*", ze = "[a-zA-Z_]\\w*", mn = "\\b\\d+(\\.\
     excludeBegin: !0,
     relevance: 0
   });
-  const h = He(
+  const g = He(
     // list of common 1 and 2 letter words in English
     "I",
     "a",
@@ -1196,14 +1196,14 @@ const ct = /\b\B/, En = "[a-zA-Z]\\w*", ze = "[a-zA-Z_]\\w*", mn = "\\b\\d+(\\.\
         /[ ]+/,
         // necessary to prevent us gobbling up doctags like /* @author Bob Mcgill */
         "(",
-        h,
+        g,
         /[.]?[:]?([.][ ]|[ ])/,
         "){3}"
       )
       // look for 3 words in a row
     }
   ), u;
-}, pt = Re("//", "$"), _t = Re("/\\*", "\\*/"), bt = Re("#", "$"), vt = {
+}, pt = Ce("//", "$"), _t = Ce("/\\*", "\\*/"), bt = Ce("#", "$"), vt = {
   scope: "number",
   begin: mn,
   relevance: 0
@@ -1261,7 +1261,7 @@ var Ne = /* @__PURE__ */ Object.freeze({
   BACKSLASH_ESCAPE: pe,
   BINARY_NUMBER_MODE: mt,
   BINARY_NUMBER_RE: wn,
-  COMMENT: Re,
+  COMMENT: Ce,
   C_BLOCK_COMMENT_MODE: _t,
   C_LINE_COMMENT_MODE: pt,
   C_NUMBER_MODE: Et,
@@ -1291,10 +1291,10 @@ function St(e, n) {
 function Dt(e, n) {
   n && e.beginKeywords && (e.begin = "\\b(" + e.beginKeywords.split(" ").join("|") + ")(?!\\.)(?=\\b|\\s)", e.__beforeBegin = Tt, e.keywords = e.keywords || e.beginKeywords, delete e.beginKeywords, e.relevance === void 0 && (e.relevance = 0));
 }
-function Rt(e, n) {
+function Ct(e, n) {
   Array.isArray(e.illegal) && (e.illegal = He(...e.illegal));
 }
-function Ct(e, n) {
+function Rt(e, n) {
   if (e.match) {
     if (e.begin || e.end)
       throw new Error("begin & end are not supported with match");
@@ -1336,13 +1336,13 @@ const Ot = (e, n) => {
 ], kt = "keyword";
 function Nn(e, n, a = kt) {
   const u = /* @__PURE__ */ Object.create(null);
-  return typeof e == "string" ? h(a, e.split(" ")) : Array.isArray(e) ? h(a, e) : Object.keys(e).forEach(function(t) {
+  return typeof e == "string" ? g(a, e.split(" ")) : Array.isArray(e) ? g(a, e) : Object.keys(e).forEach(function(t) {
     Object.assign(
       u,
       Nn(e[t], n, t)
     );
   }), u;
-  function h(t, r) {
+  function g(t, r) {
     n && (r = r.map((i) => i.toLowerCase())), r.forEach(function(i) {
       const s = i.split("|");
       u[s[0]] = [t, Bt(s[0], s[1])];
@@ -1364,9 +1364,9 @@ const nn = {}, se = (e) => {
 }, Se = new Error();
 function An(e, n, { key: a }) {
   let u = 0;
-  const h = e[a], t = {}, r = {};
+  const g = e[a], t = {}, r = {};
   for (let i = 1; i <= n.length; i++)
-    r[i + u] = h[i], t[i + u] = !0, u += vn(n[i - 1]);
+    r[i + u] = g[i], t[i + u] = !0, u += vn(n[i - 1]);
   e[a] = r, e[a]._emit = t, e[a]._multi = !0;
 }
 function Ut(e) {
@@ -1456,7 +1456,7 @@ function Ft(e) {
       return o && (this.regexIndex += o.position + 1, this.regexIndex === this.count && this.considerAll()), o;
     }
   }
-  function h(r) {
+  function g(r) {
     const i = new u();
     return r.contains.forEach((s) => i.addRule(s.begin, { rule: s, type: "begin" })), r.terminatorEnd && i.addRule(r.terminatorEnd, { type: "end" }), r.illegal && i.addRule(r.illegal, { type: "illegal" }), i;
   }
@@ -1471,14 +1471,14 @@ function Ft(e) {
       St,
       // do this early so compiler extensions generally don't have to worry about
       // the distinction between match/begin
-      Ct,
+      Rt,
       Ht,
       Ot
     ].forEach((l) => l(r, i)), e.compilerExtensions.forEach((l) => l(r, i)), r.__beforeBegin = null, [
       Dt,
       // do this later so compiler extensions that come earlier have access to the
       // raw array if they wanted to perhaps manipulate it, etc.
-      Rt,
+      Ct,
       // default to 1 relevance if not specified
       Lt
     ].forEach((l) => l(r, i)), r.isCompiled = !0;
@@ -1494,7 +1494,7 @@ function Ft(e) {
         l,
         s
       );
-    }), r.starts && t(r.starts, i), s.matcher = h(s), s;
+    }), r.starts && t(r.starts, i), s.matcher = g(s), s;
   }
   if (e.compilerExtensions || (e.compilerExtensions = []), e.contains && e.contains.includes("self"))
     throw new Error("ERR: contains `self` is not supported at the top-level of a language.  See documentation.");
@@ -1519,7 +1519,7 @@ class Kt extends Error {
 }
 const ke = _n, rn = re, sn = Symbol("nomatch"), Wt = 7, Tn = function(e) {
   const n = /* @__PURE__ */ Object.create(null), a = /* @__PURE__ */ Object.create(null), u = [];
-  let h = !0;
+  let g = !0;
   const t = "Could not find the language '{}', did you forget to load/include a language module?", r = { disableAutodetect: !0, name: "Plain text", contains: [] };
   let i = {
     ignoreUnescapedHTML: !1,
@@ -1533,393 +1533,393 @@ const ke = _n, rn = re, sn = Symbol("nomatch"), Wt = 7, Tn = function(e) {
     // https://github.com/highlightjs/highlight.js/issues/1086
     __emitter: rt
   };
-  function s(v) {
-    return i.noHighlightRe.test(v);
+  function s(b) {
+    return i.noHighlightRe.test(b);
   }
-  function o(v) {
-    let N = v.className + " ";
-    N += v.parentNode ? v.parentNode.className : "";
-    const O = i.languageDetectRe.exec(N);
-    if (O) {
-      const B = T(O[1]);
-      return B || (tn(t.replace("{}", O[1])), tn("Falling back to no-highlight mode for this block.", v)), B ? O[1] : "no-highlight";
+  function o(b) {
+    let w = b.className + " ";
+    w += b.parentNode ? b.parentNode.className : "";
+    const L = i.languageDetectRe.exec(w);
+    if (L) {
+      const U = C(L[1]);
+      return U || (tn(t.replace("{}", L[1])), tn("Falling back to no-highlight mode for this block.", b)), U ? L[1] : "no-highlight";
     }
-    return N.split(/\s+/).find((B) => s(B) || T(B));
+    return w.split(/\s+/).find((U) => s(U) || C(U));
   }
-  function l(v, N, O) {
-    let B = "", H = "";
-    typeof N == "object" ? (B = v, O = N.ignoreIllegals, H = N.language) : (le("10.7.0", "highlight(lang, code, ...args) has been deprecated."), le("10.7.0", `Please use highlight(code, options) instead.
-https://github.com/highlightjs/highlight.js/issues/2277`), H = v, B = N), O === void 0 && (O = !0);
+  function l(b, w, L) {
+    let U = "", H = "";
+    typeof w == "object" ? (U = b, L = w.ignoreIllegals, H = w.language) : (le("10.7.0", "highlight(lang, code, ...args) has been deprecated."), le("10.7.0", `Please use highlight(code, options) instead.
+https://github.com/highlightjs/highlight.js/issues/2277`), H = b, U = w), L === void 0 && (L = !0);
     const W = {
-      code: B,
+      code: U,
       language: H
     };
     te("before:highlight", W);
-    const Y = W.result ? W.result : c(W.language, W.code, O);
+    const Y = W.result ? W.result : c(W.language, W.code, L);
     return Y.code = W.code, te("after:highlight", Y), Y;
   }
-  function c(v, N, O, B) {
+  function c(b, w, L, U) {
     const H = /* @__PURE__ */ Object.create(null);
-    function W(m, M) {
-      return m.keywords[M];
+    function W(y, M) {
+      return y.keywords[M];
     }
     function Y() {
-      if (!L.keywords) {
+      if (!O.keywords) {
         z.addText(x);
         return;
       }
-      let m = 0;
-      L.keywordPatternRe.lastIndex = 0;
-      let M = L.keywordPatternRe.exec(x), I = "";
+      let y = 0;
+      O.keywordPatternRe.lastIndex = 0;
+      let M = O.keywordPatternRe.exec(x), k = "";
       for (; M; ) {
-        I += x.substring(m, M.index);
-        const U = V.case_insensitive ? M[0].toLowerCase() : M[0], G = W(L, U);
+        k += x.substring(y, M.index);
+        const P = V.case_insensitive ? M[0].toLowerCase() : M[0], G = W(O, P);
         if (G) {
           const [X, Pn] = G;
-          if (z.addText(I), I = "", H[U] = (H[U] || 0) + 1, H[U] <= Wt && (we += Pn), X.startsWith("_"))
-            I += M[0];
+          if (z.addText(k), k = "", H[P] = (H[P] || 0) + 1, H[P] <= Wt && (we += Pn), X.startsWith("_"))
+            k += M[0];
           else {
             const xn = V.classNameAliases[X] || X;
             j(M[0], xn);
           }
         } else
-          I += M[0];
-        m = L.keywordPatternRe.lastIndex, M = L.keywordPatternRe.exec(x);
+          k += M[0];
+        y = O.keywordPatternRe.lastIndex, M = O.keywordPatternRe.exec(x);
       }
-      I += x.substring(m), z.addText(I);
+      k += x.substring(y), z.addText(k);
     }
     function me() {
       if (x === "")
         return;
-      let m = null;
-      if (typeof L.subLanguage == "string") {
-        if (!n[L.subLanguage]) {
+      let y = null;
+      if (typeof O.subLanguage == "string") {
+        if (!n[O.subLanguage]) {
           z.addText(x);
           return;
         }
-        m = c(L.subLanguage, x, !0, Ye[L.subLanguage]), Ye[L.subLanguage] = /** @type {CompiledMode} */
-        m._top;
+        y = c(O.subLanguage, x, !0, Ye[O.subLanguage]), Ye[O.subLanguage] = /** @type {CompiledMode} */
+        y._top;
       } else
-        m = g(x, L.subLanguage.length ? L.subLanguage : null);
-      L.relevance > 0 && (we += m.relevance), z.__addSublanguage(m._emitter, m.language);
+        y = h(x, O.subLanguage.length ? O.subLanguage : null);
+      O.relevance > 0 && (we += y.relevance), z.__addSublanguage(y._emitter, y.language);
     }
-    function Q() {
-      L.subLanguage != null ? me() : Y(), x = "";
+    function q() {
+      O.subLanguage != null ? me() : Y(), x = "";
     }
-    function j(m, M) {
-      m !== "" && (z.startScope(M), z.addText(m), z.endScope());
+    function j(y, M) {
+      y !== "" && (z.startScope(M), z.addText(y), z.endScope());
     }
-    function We(m, M) {
-      let I = 1;
-      const U = M.length - 1;
-      for (; I <= U; ) {
-        if (!m._emit[I]) {
-          I++;
+    function We(y, M) {
+      let k = 1;
+      const P = M.length - 1;
+      for (; k <= P; ) {
+        if (!y._emit[k]) {
+          k++;
           continue;
         }
-        const G = V.classNameAliases[m[I]] || m[I], X = M[I];
-        G ? j(X, G) : (x = X, Y(), x = ""), I++;
+        const G = V.classNameAliases[y[k]] || y[k], X = M[k];
+        G ? j(X, G) : (x = X, Y(), x = ""), k++;
       }
     }
-    function Qe(m, M) {
-      return m.scope && typeof m.scope == "string" && z.openNode(V.classNameAliases[m.scope] || m.scope), m.beginScope && (m.beginScope._wrap ? (j(x, V.classNameAliases[m.beginScope._wrap] || m.beginScope._wrap), x = "") : m.beginScope._multi && (We(m.beginScope, M), x = "")), L = Object.create(m, { parent: { value: L } }), L;
+    function qe(y, M) {
+      return y.scope && typeof y.scope == "string" && z.openNode(V.classNameAliases[y.scope] || y.scope), y.beginScope && (y.beginScope._wrap ? (j(x, V.classNameAliases[y.beginScope._wrap] || y.beginScope._wrap), x = "") : y.beginScope._multi && (We(y.beginScope, M), x = "")), O = Object.create(y, { parent: { value: O } }), O;
     }
-    function qe(m, M, I) {
-      let U = ot(m.endRe, I);
-      if (U) {
-        if (m["on:end"]) {
-          const G = new Xe(m);
-          m["on:end"](M, G), G.isMatchIgnored && (U = !1);
+    function Qe(y, M, k) {
+      let P = ot(y.endRe, k);
+      if (P) {
+        if (y["on:end"]) {
+          const G = new Xe(y);
+          y["on:end"](M, G), G.isMatchIgnored && (P = !1);
         }
-        if (U) {
-          for (; m.endsParent && m.parent; )
-            m = m.parent;
-          return m;
+        if (P) {
+          for (; y.endsParent && y.parent; )
+            y = y.parent;
+          return y;
         }
       }
-      if (m.endsWithParent)
-        return qe(m.parent, M, I);
+      if (y.endsWithParent)
+        return Qe(y.parent, M, k);
     }
-    function In(m) {
-      return L.matcher.regexIndex === 0 ? (x += m[0], 1) : (Oe = !0, 0);
+    function In(y) {
+      return O.matcher.regexIndex === 0 ? (x += y[0], 1) : (Oe = !0, 0);
     }
-    function kn(m) {
-      const M = m[0], I = m.rule, U = new Xe(I), G = [I.__beforeBegin, I["on:begin"]];
+    function kn(y) {
+      const M = y[0], k = y.rule, P = new Xe(k), G = [k.__beforeBegin, k["on:begin"]];
       for (const X of G)
-        if (X && (X(m, U), U.isMatchIgnored))
+        if (X && (X(y, P), P.isMatchIgnored))
           return In(M);
-      return I.skip ? x += M : (I.excludeBegin && (x += M), Q(), !I.returnBegin && !I.excludeBegin && (x = M)), Qe(I, m), I.returnBegin ? 0 : M.length;
+      return k.skip ? x += M : (k.excludeBegin && (x += M), q(), !k.returnBegin && !k.excludeBegin && (x = M)), qe(k, y), k.returnBegin ? 0 : M.length;
     }
-    function Bn(m) {
-      const M = m[0], I = N.substring(m.index), U = qe(L, m, I);
-      if (!U)
+    function Bn(y) {
+      const M = y[0], k = w.substring(y.index), P = Qe(O, y, k);
+      if (!P)
         return sn;
-      const G = L;
-      L.endScope && L.endScope._wrap ? (Q(), j(M, L.endScope._wrap)) : L.endScope && L.endScope._multi ? (Q(), We(L.endScope, m)) : G.skip ? x += M : (G.returnEnd || G.excludeEnd || (x += M), Q(), G.excludeEnd && (x = M));
+      const G = O;
+      O.endScope && O.endScope._wrap ? (q(), j(M, O.endScope._wrap)) : O.endScope && O.endScope._multi ? (q(), We(O.endScope, y)) : G.skip ? x += M : (G.returnEnd || G.excludeEnd || (x += M), q(), G.excludeEnd && (x = M));
       do
-        L.scope && z.closeNode(), !L.skip && !L.subLanguage && (we += L.relevance), L = L.parent;
-      while (L !== U.parent);
-      return U.starts && Qe(U.starts, m), G.returnEnd ? 0 : M.length;
+        O.scope && z.closeNode(), !O.skip && !O.subLanguage && (we += O.relevance), O = O.parent;
+      while (O !== P.parent);
+      return P.starts && qe(P.starts, y), G.returnEnd ? 0 : M.length;
     }
     function $n() {
-      const m = [];
-      for (let M = L; M !== V; M = M.parent)
-        M.scope && m.unshift(M.scope);
-      m.forEach((M) => z.openNode(M));
+      const y = [];
+      for (let M = O; M !== V; M = M.parent)
+        M.scope && y.unshift(M.scope);
+      y.forEach((M) => z.openNode(M));
     }
     let ye = {};
-    function Ze(m, M) {
-      const I = M && M[0];
-      if (x += m, I == null)
-        return Q(), 0;
-      if (ye.type === "begin" && M.type === "end" && ye.index === M.index && I === "") {
-        if (x += N.slice(M.index, M.index + 1), !h) {
-          const U = new Error(`0 width match regex (${v})`);
-          throw U.languageName = v, U.badRule = ye.rule, U;
+    function Ze(y, M) {
+      const k = M && M[0];
+      if (x += y, k == null)
+        return q(), 0;
+      if (ye.type === "begin" && M.type === "end" && ye.index === M.index && k === "") {
+        if (x += w.slice(M.index, M.index + 1), !g) {
+          const P = new Error(`0 width match regex (${b})`);
+          throw P.languageName = b, P.badRule = ye.rule, P;
         }
         return 1;
       }
       if (ye = M, M.type === "begin")
         return kn(M);
-      if (M.type === "illegal" && !O) {
-        const U = new Error('Illegal lexeme "' + I + '" for mode "' + (L.scope || "<unnamed>") + '"');
-        throw U.mode = L, U;
+      if (M.type === "illegal" && !L) {
+        const P = new Error('Illegal lexeme "' + k + '" for mode "' + (O.scope || "<unnamed>") + '"');
+        throw P.mode = O, P;
       } else if (M.type === "end") {
-        const U = Bn(M);
-        if (U !== sn)
-          return U;
+        const P = Bn(M);
+        if (P !== sn)
+          return P;
       }
-      if (M.type === "illegal" && I === "")
+      if (M.type === "illegal" && k === "")
         return 1;
       if (Le > 1e5 && Le > M.index * 3)
         throw new Error("potential infinite loop, way more iterations than matches");
-      return x += I, I.length;
+      return x += k, k.length;
     }
-    const V = T(v);
+    const V = C(b);
     if (!V)
-      throw se(t.replace("{}", v)), new Error('Unknown language: "' + v + '"');
+      throw se(t.replace("{}", b)), new Error('Unknown language: "' + b + '"');
     const Un = Ft(V);
-    let Ce = "", L = B || Un;
+    let Re = "", O = U || Un;
     const Ye = {}, z = new i.__emitter(i);
     $n();
     let x = "", we = 0, ie = 0, Le = 0, Oe = !1;
     try {
       if (V.__emitTokens)
-        V.__emitTokens(N, z);
+        V.__emitTokens(w, z);
       else {
-        for (L.matcher.considerAll(); ; ) {
-          Le++, Oe ? Oe = !1 : L.matcher.considerAll(), L.matcher.lastIndex = ie;
-          const m = L.matcher.exec(N);
-          if (!m)
+        for (O.matcher.considerAll(); ; ) {
+          Le++, Oe ? Oe = !1 : O.matcher.considerAll(), O.matcher.lastIndex = ie;
+          const y = O.matcher.exec(w);
+          if (!y)
             break;
-          const M = N.substring(ie, m.index), I = Ze(M, m);
-          ie = m.index + I;
+          const M = w.substring(ie, y.index), k = Ze(M, y);
+          ie = y.index + k;
         }
-        Ze(N.substring(ie));
+        Ze(w.substring(ie));
       }
-      return z.finalize(), Ce = z.toHTML(), {
-        language: v,
-        value: Ce,
+      return z.finalize(), Re = z.toHTML(), {
+        language: b,
+        value: Re,
         relevance: we,
         illegal: !1,
         _emitter: z,
-        _top: L
+        _top: O
       };
-    } catch (m) {
-      if (m.message && m.message.includes("Illegal"))
+    } catch (y) {
+      if (y.message && y.message.includes("Illegal"))
         return {
-          language: v,
-          value: ke(N),
+          language: b,
+          value: ke(w),
           illegal: !0,
           relevance: 0,
           _illegalBy: {
-            message: m.message,
+            message: y.message,
             index: ie,
-            context: N.slice(ie - 100, ie + 100),
-            mode: m.mode,
-            resultSoFar: Ce
+            context: w.slice(ie - 100, ie + 100),
+            mode: y.mode,
+            resultSoFar: Re
           },
           _emitter: z
         };
-      if (h)
+      if (g)
         return {
-          language: v,
-          value: ke(N),
+          language: b,
+          value: ke(w),
           illegal: !1,
           relevance: 0,
-          errorRaised: m,
+          errorRaised: y,
           _emitter: z,
-          _top: L
+          _top: O
         };
-      throw m;
+      throw y;
     }
   }
-  function f(v) {
-    const N = {
-      value: ke(v),
+  function f(b) {
+    const w = {
+      value: ke(b),
       illegal: !1,
       relevance: 0,
       _top: r,
       _emitter: new i.__emitter(i)
     };
-    return N._emitter.addText(v), N;
+    return w._emitter.addText(b), w;
   }
-  function g(v, N) {
-    N = N || i.languages || Object.keys(n);
-    const O = f(v), B = N.filter(T).filter(k).map(
-      (Q) => c(Q, v, !1)
+  function h(b, w) {
+    w = w || i.languages || Object.keys(n);
+    const L = f(b), U = w.filter(C).filter($).map(
+      (q) => c(q, b, !1)
     );
-    B.unshift(O);
-    const H = B.sort((Q, j) => {
-      if (Q.relevance !== j.relevance)
-        return j.relevance - Q.relevance;
-      if (Q.language && j.language) {
-        if (T(Q.language).supersetOf === j.language)
+    U.unshift(L);
+    const H = U.sort((q, j) => {
+      if (q.relevance !== j.relevance)
+        return j.relevance - q.relevance;
+      if (q.language && j.language) {
+        if (C(q.language).supersetOf === j.language)
           return 1;
-        if (T(j.language).supersetOf === Q.language)
+        if (C(j.language).supersetOf === q.language)
           return -1;
       }
       return 0;
     }), [W, Y] = H, me = W;
     return me.secondBest = Y, me;
   }
-  function d(v, N, O) {
-    const B = N && a[N] || O;
-    v.classList.add("hljs"), v.classList.add(`language-${B}`);
+  function d(b, w, L) {
+    const U = w && a[w] || L;
+    b.classList.add("hljs"), b.classList.add(`language-${U}`);
   }
-  function p(v) {
-    let N = null;
-    const O = o(v);
-    if (s(O))
+  function p(b) {
+    let w = null;
+    const L = o(b);
+    if (s(L))
       return;
     if (te(
       "before:highlightElement",
-      { el: v, language: O }
-    ), v.dataset.highlighted) {
-      console.log("Element previously highlighted. To highlight again, first unset `dataset.highlighted`.", v);
+      { el: b, language: L }
+    ), b.dataset.highlighted) {
+      console.log("Element previously highlighted. To highlight again, first unset `dataset.highlighted`.", b);
       return;
     }
-    if (v.children.length > 0 && (i.ignoreUnescapedHTML || (console.warn("One of your code blocks includes unescaped HTML. This is a potentially serious security risk."), console.warn("https://github.com/highlightjs/highlight.js/wiki/security"), console.warn("The element with unescaped HTML:"), console.warn(v)), i.throwUnescapedHTML))
+    if (b.children.length > 0 && (i.ignoreUnescapedHTML || (console.warn("One of your code blocks includes unescaped HTML. This is a potentially serious security risk."), console.warn("https://github.com/highlightjs/highlight.js/wiki/security"), console.warn("The element with unescaped HTML:"), console.warn(b)), i.throwUnescapedHTML))
       throw new Kt(
         "One of your code blocks includes unescaped HTML.",
-        v.innerHTML
+        b.innerHTML
       );
-    N = v;
-    const B = N.textContent, H = O ? l(B, { language: O, ignoreIllegals: !0 }) : g(B);
-    v.innerHTML = H.value, v.dataset.highlighted = "yes", d(v, O, H.language), v.result = {
+    w = b;
+    const U = w.textContent, H = L ? l(U, { language: L, ignoreIllegals: !0 }) : h(U);
+    b.innerHTML = H.value, b.dataset.highlighted = "yes", d(b, L, H.language), b.result = {
       language: H.language,
       // TODO: remove with version 11.0
       re: H.relevance,
       relevance: H.relevance
-    }, H.secondBest && (v.secondBest = {
+    }, H.secondBest && (b.secondBest = {
       language: H.secondBest.language,
       relevance: H.secondBest.relevance
-    }), te("after:highlightElement", { el: v, result: H, text: B });
+    }), te("after:highlightElement", { el: b, result: H, text: U });
   }
-  function _(v) {
-    i = rn(i, v);
+  function _(b) {
+    i = rn(i, b);
   }
-  const E = () => {
-    A(), le("10.6.0", "initHighlighting() deprecated.  Use highlightAll() now.");
+  const v = () => {
+    N(), le("10.6.0", "initHighlighting() deprecated.  Use highlightAll() now.");
   };
-  function b() {
-    A(), le("10.6.0", "initHighlightingOnLoad() deprecated.  Use highlightAll() now.");
+  function E() {
+    N(), le("10.6.0", "initHighlightingOnLoad() deprecated.  Use highlightAll() now.");
   }
-  let y = !1;
-  function A() {
+  let m = !1;
+  function N() {
     if (document.readyState === "loading") {
-      y = !0;
+      m = !0;
       return;
     }
     document.querySelectorAll(i.cssSelector).forEach(p);
   }
-  function R() {
-    y && A();
+  function D() {
+    m && N();
   }
-  typeof window != "undefined" && window.addEventListener && window.addEventListener("DOMContentLoaded", R, !1);
-  function w(v, N) {
-    let O = null;
+  typeof window != "undefined" && window.addEventListener && window.addEventListener("DOMContentLoaded", D, !1);
+  function S(b, w) {
+    let L = null;
     try {
-      O = N(e);
-    } catch (B) {
-      if (se("Language definition for '{}' could not be registered.".replace("{}", v)), h)
-        se(B);
+      L = w(e);
+    } catch (U) {
+      if (se("Language definition for '{}' could not be registered.".replace("{}", b)), g)
+        se(U);
       else
-        throw B;
-      O = r;
+        throw U;
+      L = r;
     }
-    O.name || (O.name = v), n[v] = O, O.rawDefinition = N.bind(null, e), O.aliases && $(O.aliases, { languageName: v });
+    L.name || (L.name = b), n[b] = L, L.rawDefinition = w.bind(null, e), L.aliases && I(L.aliases, { languageName: b });
   }
-  function D(v) {
-    delete n[v];
-    for (const N of Object.keys(a))
-      a[N] === v && delete a[N];
+  function A(b) {
+    delete n[b];
+    for (const w of Object.keys(a))
+      a[w] === b && delete a[w];
   }
-  function C() {
+  function R() {
     return Object.keys(n);
   }
-  function T(v) {
-    return v = (v || "").toLowerCase(), n[v] || n[a[v]];
+  function C(b) {
+    return b = (b || "").toLowerCase(), n[b] || n[a[b]];
   }
-  function $(v, { languageName: N }) {
-    typeof v == "string" && (v = [v]), v.forEach((O) => {
-      a[O.toLowerCase()] = N;
+  function I(b, { languageName: w }) {
+    typeof b == "string" && (b = [b]), b.forEach((L) => {
+      a[L.toLowerCase()] = w;
     });
   }
-  function k(v) {
-    const N = T(v);
-    return N && !N.disableAutodetect;
+  function $(b) {
+    const w = C(b);
+    return w && !w.disableAutodetect;
   }
-  function P(v) {
-    v["before:highlightBlock"] && !v["before:highlightElement"] && (v["before:highlightElement"] = (N) => {
-      v["before:highlightBlock"](
-        Object.assign({ block: N.el }, N)
+  function B(b) {
+    b["before:highlightBlock"] && !b["before:highlightElement"] && (b["before:highlightElement"] = (w) => {
+      b["before:highlightBlock"](
+        Object.assign({ block: w.el }, w)
       );
-    }), v["after:highlightBlock"] && !v["after:highlightElement"] && (v["after:highlightElement"] = (N) => {
-      v["after:highlightBlock"](
-        Object.assign({ block: N.el }, N)
+    }), b["after:highlightBlock"] && !b["after:highlightElement"] && (b["after:highlightElement"] = (w) => {
+      b["after:highlightBlock"](
+        Object.assign({ block: w.el }, w)
       );
     });
   }
-  function F(v) {
-    P(v), u.push(v);
+  function F(b) {
+    B(b), u.push(b);
   }
-  function K(v) {
-    const N = u.indexOf(v);
-    N !== -1 && u.splice(N, 1);
+  function K(b) {
+    const w = u.indexOf(b);
+    w !== -1 && u.splice(w, 1);
   }
-  function te(v, N) {
-    const O = v;
-    u.forEach(function(B) {
-      B[O] && B[O](N);
+  function te(b, w) {
+    const L = b;
+    u.forEach(function(U) {
+      U[L] && U[L](w);
     });
   }
-  function oe(v) {
-    return le("10.7.0", "highlightBlock will be removed entirely in v12.0"), le("10.7.0", "Please use highlightElement now."), p(v);
+  function oe(b) {
+    return le("10.7.0", "highlightBlock will be removed entirely in v12.0"), le("10.7.0", "Please use highlightElement now."), p(b);
   }
   Object.assign(e, {
     highlight: l,
-    highlightAuto: g,
-    highlightAll: A,
+    highlightAuto: h,
+    highlightAll: N,
     highlightElement: p,
     // TODO: Remove with v12 API
     highlightBlock: oe,
     configure: _,
-    initHighlighting: E,
-    initHighlightingOnLoad: b,
-    registerLanguage: w,
-    unregisterLanguage: D,
-    listLanguages: C,
-    getLanguage: T,
-    registerAliases: $,
-    autoDetection: k,
+    initHighlighting: v,
+    initHighlightingOnLoad: E,
+    registerLanguage: S,
+    unregisterLanguage: A,
+    listLanguages: R,
+    getLanguage: C,
+    registerAliases: I,
+    autoDetection: $,
     inherit: rn,
     addPlugin: F,
     removePlugin: K
   }), e.debugMode = function() {
-    h = !1;
+    g = !1;
   }, e.safeMode = function() {
-    h = !0;
+    g = !0;
   }, e.versionString = Gt, e.regex = {
     concat: ae,
     lookahead: bn,
@@ -1927,17 +1927,17 @@ https://github.com/highlightjs/highlight.js/issues/2277`), H = v, B = N), O ===
     optional: st,
     anyNumberOfTimes: it
   };
-  for (const v in Ne)
-    typeof Ne[v] == "object" && pn(Ne[v]);
+  for (const b in Ne)
+    typeof Ne[b] == "object" && pn(Ne[b]);
   return Object.assign(e, Ne), e;
 }, ue = Tn({});
 ue.newInstance = () => Tn({});
-var Qt = ue;
+var qt = ue;
 ue.HighlightJS = ue;
 ue.default = ue;
-const Z = /* @__PURE__ */ Jn(Qt);
-function qt(e) {
-  const n = e.regex, a = n.concat(/[\p{L}_]/u, n.optional(/[\p{L}0-9_.-]*:/u), /[\p{L}0-9_.-]*/u), u = /[\p{L}0-9._:-]+/u, h = {
+const Z = /* @__PURE__ */ Jn(qt);
+function Qt(e) {
+  const n = e.regex, a = n.concat(/[\p{L}_]/u, n.optional(/[\p{L}0-9_.-]*:/u), /[\p{L}0-9_.-]*/u), u = /[\p{L}0-9._:-]+/u, g = {
     className: "symbol",
     begin: /&[a-z]+;|&#[0-9]+;|&#x[a-f0-9]+;/
   }, t = {
@@ -1973,12 +1973,12 @@ function qt(e) {
               {
                 begin: /"/,
                 end: /"/,
-                contains: [h]
+                contains: [g]
               },
               {
                 begin: /'/,
                 end: /'/,
-                contains: [h]
+                contains: [g]
               },
               { begin: /[^\s"'=<>`]+/ }
             ]
@@ -2043,7 +2043,7 @@ function qt(e) {
         end: /\]\]>/,
         relevance: 10
       },
-      h,
+      g,
       // xml processing instructions
       {
         className: "meta",
@@ -2261,7 +2261,7 @@ const an = "[A-Za-z$_][0-9A-Za-z$_]*", Zt = [
   "SyntaxError",
   "TypeError",
   "URIError"
-], Rn = [
+], Cn = [
   "setInterval",
   "setTimeout",
   "clearInterval",
@@ -2292,15 +2292,15 @@ const an = "[A-Za-z$_][0-9A-Za-z$_]*", Zt = [
   "global"
   // Node.js
 ], Vt = [].concat(
-  Rn,
+  Cn,
   Sn,
   Dn
 );
 function Xt(e) {
-  const n = e.regex, a = (N, { after: O }) => {
-    const B = "</" + N[0].slice(1);
-    return N.input.indexOf(B, O) !== -1;
-  }, u = an, h = {
+  const n = e.regex, a = (w, { after: L }) => {
+    const U = "</" + w[0].slice(1);
+    return w.input.indexOf(U, L) !== -1;
+  }, u = an, g = {
     begin: "<>",
     end: "</>"
   }, t = /<[A-Za-z0-9\\._:-]+\s*\/>/, r = {
@@ -2310,8 +2310,8 @@ function Xt(e) {
      * @param {RegExpMatchArray} match
      * @param {CallbackResponse} response
      */
-    isTrulyOpeningTag: (N, O) => {
-      const B = N[0].length + N.index, H = N.input[B];
+    isTrulyOpeningTag: (w, L) => {
+      const U = w[0].length + w.index, H = w.input[U];
       if (
         // HTML should not include another raw `<` inside a tag
         // nested type?
@@ -2320,18 +2320,18 @@ function Xt(e) {
         // `<T, A extends keyof T, V>`
         H === ","
       ) {
-        O.ignoreMatch();
+        L.ignoreMatch();
         return;
       }
-      H === ">" && (a(N, { after: B }) || O.ignoreMatch());
+      H === ">" && (a(w, { after: U }) || L.ignoreMatch());
       let W;
-      const Y = N.input.substring(B);
+      const Y = w.input.substring(U);
       if (W = Y.match(/^\s*=/)) {
-        O.ignoreMatch();
+        L.ignoreMatch();
         return;
       }
       if ((W = Y.match(/^\s+extends\s+/)) && W.index === 0) {
-        O.ignoreMatch();
+        L.ignoreMatch();
         return;
       }
     }
@@ -2365,7 +2365,7 @@ function Xt(e) {
     keywords: i,
     contains: []
     // defined later
-  }, g = {
+  }, h = {
     begin: "html`",
     end: "",
     starts: {
@@ -2409,7 +2409,7 @@ function Xt(e) {
       e.BACKSLASH_ESCAPE,
       f
     ]
-  }, b = {
+  }, E = {
     className: "comment",
     variants: [
       e.COMMENT(
@@ -2454,10 +2454,10 @@ function Xt(e) {
       e.C_BLOCK_COMMENT_MODE,
       e.C_LINE_COMMENT_MODE
     ]
-  }, y = [
+  }, m = [
     e.APOS_STRING_MODE,
     e.QUOTE_STRING_MODE,
-    g,
+    h,
     d,
     p,
     _,
@@ -2468,7 +2468,7 @@ function Xt(e) {
     // See https://github.com/highlightjs/highlight.js/issues/3288
     // hljs.REGEXP_MODE
   ];
-  f.contains = y.concat({
+  f.contains = m.concat({
     // we need to pair up {} inside our subst to prevent
     // it from ending too early by matching another }
     begin: /\{/,
@@ -2476,25 +2476,25 @@ function Xt(e) {
     keywords: i,
     contains: [
       "self"
-    ].concat(y)
+    ].concat(m)
   });
-  const A = [].concat(b, f.contains), R = A.concat([
+  const N = [].concat(E, f.contains), D = N.concat([
     // eat recursive parens in sub expressions
     {
       begin: /\(/,
       end: /\)/,
       keywords: i,
-      contains: ["self"].concat(A)
+      contains: ["self"].concat(N)
     }
-  ]), w = {
+  ]), S = {
     className: "params",
     begin: /\(/,
     end: /\)/,
     excludeBegin: !0,
     excludeEnd: !0,
     keywords: i,
-    contains: R
-  }, D = {
+    contains: D
+  }, A = {
     variants: [
       // class Car extends vehicle
       {
@@ -2527,7 +2527,7 @@ function Xt(e) {
         }
       }
     ]
-  }, C = {
+  }, R = {
     relevance: 0,
     match: n.either(
       // Hard coded exceptions
@@ -2551,12 +2551,12 @@ function Xt(e) {
         ...Dn
       ]
     }
-  }, T = {
+  }, C = {
     label: "use_strict",
     className: "meta",
     relevance: 10,
     begin: /^\s*['"]use (strict|asm)['"]/
-  }, $ = {
+  }, I = {
     variants: [
       {
         match: [
@@ -2579,21 +2579,21 @@ function Xt(e) {
       3: "title.function"
     },
     label: "func.def",
-    contains: [w],
+    contains: [S],
     illegal: /%/
-  }, k = {
+  }, $ = {
     relevance: 0,
     match: /\b[A-Z][A-Z_0-9]+\b/,
     className: "variable.constant"
   };
-  function P(N) {
-    return n.concat("(?!", N.join("|"), ")");
+  function B(w) {
+    return n.concat("(?!", w.join("|"), ")");
   }
   const F = {
     match: n.concat(
       /\b/,
-      P([
-        ...Rn,
+      B([
+        ...Cn,
         "super",
         "import"
       ]),
@@ -2627,9 +2627,9 @@ function Xt(e) {
         // eat to avoid empty params
         begin: /\(\)/
       },
-      w
+      S
     ]
-  }, oe = "(\\([^()]*(\\([^()]*(\\([^()]*\\)[^()]*)*\\)[^()]*)*\\)|" + e.UNDERSCORE_IDENT_RE + ")\\s*=>", v = {
+  }, oe = "(\\([^()]*(\\([^()]*(\\([^()]*\\)[^()]*)*\\)[^()]*)*\\)|" + e.UNDERSCORE_IDENT_RE + ")\\s*=>", b = {
     match: [
       /const|var|let/,
       /\s+/,
@@ -2646,7 +2646,7 @@ function Xt(e) {
       3: "title.function"
     },
     contains: [
-      w
+      S
     ]
   };
   return {
@@ -2654,7 +2654,7 @@ function Xt(e) {
     aliases: ["js", "jsx", "mjs", "cjs"],
     keywords: i,
     // this will be extended by TypeScript
-    exports: { PARAMS_CONTAINS: R, CLASS_REFERENCE: C },
+    exports: { PARAMS_CONTAINS: D, CLASS_REFERENCE: R },
     illegal: /#(?![$_A-z])/,
     contains: [
       e.SHEBANG({
@@ -2662,31 +2662,31 @@ function Xt(e) {
         binary: "node",
         relevance: 5
       }),
-      T,
+      C,
       e.APOS_STRING_MODE,
       e.QUOTE_STRING_MODE,
-      g,
+      h,
       d,
       p,
       _,
-      b,
+      E,
       // Skip numbers when they are part of a variable name
       { match: /\$\d+/ },
       c,
-      C,
+      R,
       {
         className: "attr",
         begin: u + n.lookahead(":"),
         relevance: 0
       },
-      v,
+      b,
       {
         // "value" container
         begin: "(" + e.RE_STARTERS_RE + "|\\b(case|return|throw)\\b)\\s*",
         keywords: "return throw case",
         relevance: 0,
         contains: [
-          b,
+          E,
           e.REGEXP_MODE,
           {
             className: "function",
@@ -2715,7 +2715,7 @@ function Xt(e) {
                     excludeBegin: !0,
                     excludeEnd: !0,
                     keywords: i,
-                    contains: R
+                    contains: D
                   }
                 ]
               }
@@ -2733,7 +2733,7 @@ function Xt(e) {
           {
             // JSX
             variants: [
-              { begin: h.begin, end: h.end },
+              { begin: g.begin, end: g.end },
               { match: t },
               {
                 begin: r.begin,
@@ -2755,7 +2755,7 @@ function Xt(e) {
           }
         ]
       },
-      $,
+      I,
       {
         // prevent this from getting swallowed up by function
         // since they appear "function like"
@@ -2770,7 +2770,7 @@ function Xt(e) {
         returnBegin: !0,
         label: "func.def",
         contains: [
-          w,
+          S,
           e.inherit(e.TITLE_MODE, { begin: u, className: "title.function" })
         ]
       },
@@ -2790,11 +2790,11 @@ function Xt(e) {
       {
         match: [/\bconstructor(?=\s*\()/],
         className: { 1: "title.function" },
-        contains: [w]
+        contains: [S]
       },
       F,
-      k,
-      D,
+      $,
+      A,
       te,
       {
         match: /\$[(.]/
@@ -2816,7 +2816,7 @@ function Jt(e) {
     "true",
     "false",
     "null"
-  ], h = {
+  ], g = {
     scope: "literal",
     beginKeywords: u.join(" ")
   };
@@ -2829,7 +2829,7 @@ function Jt(e) {
       n,
       a,
       e.QUOTE_STRING_MODE,
-      h,
+      g,
       e.C_NUMBER_MODE,
       e.C_LINE_COMMENT_MODE,
       e.C_BLOCK_COMMENT_MODE
@@ -2851,7 +2851,7 @@ function er(e) {
         begin: "'\\w[\\w :\\/.-]*':(?=[ 	]|$)"
       }
     ]
-  }, h = {
+  }, g = {
     className: "template-variable",
     variants: [
       {
@@ -2881,7 +2881,7 @@ function er(e) {
     ],
     contains: [
       e.BACKSLASH_ESCAPE,
-      h
+      g
     ]
   }, r = e.inherit(t, { variants: [
     {
@@ -2902,7 +2902,7 @@ function er(e) {
     excludeEnd: !0,
     keywords: n,
     relevance: 0
-  }, g = {
+  }, h = {
     begin: /\{/,
     end: /\}/,
     contains: [f],
@@ -2990,7 +2990,7 @@ function er(e) {
       begin: e.C_NUMBER_RE + "\\b",
       relevance: 0
     },
-    g,
+    h,
     d,
     t
   ], _ = [...p];
@@ -3237,7 +3237,7 @@ function tr(e) {
       e.APOS_STRING_MODE,
       e.QUOTE_STRING_MODE
     ]
-  }, f = "[0-9](_?[0-9])*", g = `(\\b(${f}))?\\.(${f})|\\b(${f})\\.`, d = `\\b|${u.join("|")}`, p = {
+  }, f = "[0-9](_?[0-9])*", h = `(\\b(${f}))?\\.(${f})|\\b(${f})\\.`, d = `\\b|${u.join("|")}`, p = {
     className: "number",
     relevance: 0,
     variants: [
@@ -3252,10 +3252,10 @@ function tr(e) {
       // because both MUST contain a decimal point and so cannot be confused with
       // the interior part of an identifier
       {
-        begin: `(\\b(${f})|(${g}))[eE][+-]?(${f})[jJ]?(?=${d})`
+        begin: `(\\b(${f})|(${h}))[eE][+-]?(${f})[jJ]?(?=${d})`
       },
       {
-        begin: `(${g})[jJ]?`
+        begin: `(${h})[jJ]?`
       },
       // decinteger, bininteger, octinteger, hexinteger
       // https://docs.python.org/3.9/reference/lexical_analysis.html#integer-literals
@@ -3298,7 +3298,7 @@ function tr(e) {
         endsWithParent: !0
       }
     ]
-  }, E = {
+  }, v = {
     className: "params",
     variants: [
       // Exclude params in functions without params
@@ -3363,7 +3363,7 @@ function tr(e) {
           1: "keyword",
           3: "title.function"
         },
-        contains: [E]
+        contains: [v]
       },
       {
         variants: [
@@ -3398,7 +3398,7 @@ function tr(e) {
         end: /(?=#)|$/,
         contains: [
           p,
-          E,
+          v,
           c
         ]
       }
@@ -3428,11 +3428,11 @@ var ce = "[0-9](_*[0-9])*", Ae = `\\.(${ce})`, Me = "[0-9a-fA-F](_*[0-9a-fA-F])*
   ],
   relevance: 0
 };
-function Cn(e, n, a) {
-  return a === -1 ? "" : e.replace(n, (u) => Cn(e, n, a - 1));
+function Rn(e, n, a) {
+  return a === -1 ? "" : e.replace(n, (u) => Rn(e, n, a - 1));
 }
 function rr(e) {
-  const n = e.regex, a = "[À-ʸa-zA-Z_$][À-ʸa-zA-Z_$0-9]*", u = a + Cn("(?:<" + a + "~~~(?:\\s*,\\s*" + a + "~~~)*>)?", /~~~/g, 2), s = {
+  const n = e.regex, a = "[À-ʸa-zA-Z_$][À-ʸa-zA-Z_$0-9]*", u = a + Rn("(?:<" + a + "~~~(?:\\s*,\\s*" + a + "~~~)*>)?", /~~~/g, 2), s = {
     keyword: [
       "synchronized",
       "abstract",
@@ -3665,7 +3665,7 @@ function ir(e) {
       u
     ]
   });
-  const h = {
+  const g = {
     className: "subst",
     begin: /\$\(/,
     end: /\)/,
@@ -3686,10 +3686,10 @@ function ir(e) {
     contains: [
       e.BACKSLASH_ESCAPE,
       a,
-      h
+      g
     ]
   };
-  h.contains.push(r);
+  g.contains.push(r);
   const i = {
     match: /\\"/
   }, s = {
@@ -3722,7 +3722,7 @@ function ir(e) {
   ], f = e.SHEBANG({
     binary: `(${c.join("|")})`,
     relevance: 10
-  }), g = {
+  }), h = {
     className: "function",
     begin: /\w[\w\d_]*\s*\(\s*\)\s*\{/,
     returnBegin: !0,
@@ -3747,7 +3747,7 @@ function ir(e) {
   ], p = [
     "true",
     "false"
-  ], _ = { match: /(\/[a-z._-]+)+/ }, E = [
+  ], _ = { match: /(\/[a-z._-]+)+/ }, v = [
     "break",
     "cd",
     "continue",
@@ -3766,7 +3766,7 @@ function ir(e) {
     "trap",
     "umask",
     "unset"
-  ], b = [
+  ], E = [
     "alias",
     "bind",
     "builtin",
@@ -3788,7 +3788,7 @@ function ir(e) {
     "typeset",
     "ulimit",
     "unalias"
-  ], y = [
+  ], m = [
     "autoload",
     "bg",
     "bindkey",
@@ -3857,7 +3857,7 @@ function ir(e) {
     "zsocket",
     "zstyle",
     "ztcp"
-  ], A = [
+  ], N = [
     "chcon",
     "chgrp",
     "chown",
@@ -3970,13 +3970,13 @@ function ir(e) {
       keyword: d,
       literal: p,
       built_in: [
+        ...v,
         ...E,
-        ...b,
         // Shell modifiers
         "set",
         "shopt",
-        ...y,
-        ...A
+        ...m,
+        ...N
       ]
     },
     contains: [
@@ -3984,7 +3984,7 @@ function ir(e) {
       // to catch known shells and boost relevancy
       e.SHEBANG(),
       // to catch unknown shells but still highlight the shebang
-      g,
+      h,
       l,
       e.HASH_COMMENT_MODE,
       t,
@@ -4007,7 +4007,7 @@ function sr(e) {
         contains: [{ begin: /''/ }]
       }
     ]
-  }, h = {
+  }, g = {
     begin: /"/,
     end: /"/,
     contains: [{ begin: /""/ }]
@@ -4546,27 +4546,27 @@ function sr(e) {
     "nulls last",
     "depth first",
     "breadth first"
-  ], g = l, d = [
+  ], h = l, d = [
     ...o,
     ...s
-  ].filter((y) => !l.includes(y)), p = {
+  ].filter((m) => !l.includes(m)), p = {
     className: "variable",
     begin: /@[a-z0-9][a-z0-9_]*/
   }, _ = {
     className: "operator",
     begin: /[-+*/=%^~]|&&?|\|\|?|!=?|<(?:=>?|<|>)?|>[>=]?/,
     relevance: 0
-  }, E = {
-    begin: n.concat(/\b/, n.either(...g), /\s*\(/),
+  }, v = {
+    begin: n.concat(/\b/, n.either(...h), /\s*\(/),
     relevance: 0,
-    keywords: { built_in: g }
+    keywords: { built_in: h }
   };
-  function b(y, {
-    exceptions: A,
-    when: R
+  function E(m, {
+    exceptions: N,
+    when: D
   } = {}) {
-    const w = R;
-    return A = A || [], y.map((D) => D.match(/\|\d+$/) || A.includes(D) ? D : w(D) ? `${D}|0` : D);
+    const S = D;
+    return N = N || [], m.map((A) => A.match(/\|\d+$/) || N.includes(A) ? A : S(A) ? `${A}|0` : A);
   }
   return {
     name: "SQL",
@@ -4575,7 +4575,7 @@ function sr(e) {
     illegal: /[{}]|<\//,
     keywords: {
       $pattern: /\b[\w\.]+/,
-      keyword: b(d, { when: (y) => y.length < 3 }),
+      keyword: E(d, { when: (m) => m.length < 3 }),
       literal: t,
       type: i,
       built_in: c
@@ -4595,10 +4595,10 @@ function sr(e) {
         className: "type",
         begin: n.either(...r)
       },
-      E,
+      v,
       p,
       u,
-      h,
+      g,
       e.C_NUMBER_MODE,
       e.C_BLOCK_COMMENT_MODE,
       a,
@@ -4606,7 +4606,7 @@ function sr(e) {
     ]
   };
 }
-Z.registerLanguage("xml", qt);
+Z.registerLanguage("xml", Qt);
 Z.registerLanguage("javascript", Xt);
 Z.registerLanguage("json", Jt);
 Z.registerLanguage("yaml", er);
@@ -4615,18 +4615,18 @@ Z.registerLanguage("python", tr);
 Z.registerLanguage("java", rr);
 Z.registerLanguage("bash", ir);
 Z.registerLanguage("sql", sr);
-var S = /* @__PURE__ */ ((e) => (e.EQUAL = "equal", e.DELETE = "removed", e.ADD = "added", e.EMPTY = "empty", e))(S || {});
+var T = /* @__PURE__ */ ((e) => (e.EQUAL = "equal", e.DELETE = "removed", e.ADD = "added", e.EMPTY = "empty", e))(T || {});
 const J = "<code-diff-modified>", ee = "</code-diff-modified>", ar = J.replace("<", "&lt;").replace(">", "&gt;"), or = ee.replace("<", "&lt;").replace(">", "&gt;");
 function fe(e) {
-  return e === void 0 ? S.EQUAL : e.added ? S.ADD : e.removed ? S.DELETE : S.EQUAL;
+  return e === void 0 ? T.EQUAL : e.added ? T.ADD : e.removed ? T.DELETE : T.EQUAL;
 }
 function De(e, n, a = "word") {
-  return typeof e == "undefined" ? n : typeof n == "undefined" ? e : (a === "char" ? qn : Yn)(e, n).filter((h) => fe(h) !== S.DELETE).map(
-    (h) => fe(h) === S.ADD ? `${J}${h.value}${ee}` : h.value
+  return typeof e == "undefined" ? n : typeof n == "undefined" ? e : (a === "char" ? Qn : Yn)(e, n).filter((g) => fe(g) !== T.DELETE).map(
+    (g) => fe(g) === T.ADD ? `${J}${g.value}${ee}` : g.value
   ).join("");
 }
 function Ln(e, n) {
-  const a = new Ie.diff_match_patch(), u = a.diff_linesToChars_(e, n), h = u.chars1, t = u.chars2, r = u.lineArray, i = a.diff_main(h, t, !1);
+  const a = new Ie.diff_match_patch(), u = a.diff_linesToChars_(e, n), g = u.chars1, t = u.chars2, r = u.lineArray, i = a.diff_main(g, t, !1);
   return a.diff_charsToLines_(i, r), i.map((s) => {
     const [o, l] = s;
     return {
@@ -4638,12 +4638,12 @@ function Ln(e, n) {
     };
   });
 }
-function q(e, n) {
+function Q(e, n) {
   if (!n.match(new RegExp(`(${J}|${ee})`, "g")))
     return Z.highlight(n, { language: e }).value;
   let u = n;
-  const h = n.replace(new RegExp(`(${J}|${ee})`, "g"), ""), t = document.createElement("div");
-  t.innerHTML = Z.highlight(h, { language: e }).value;
+  const g = n.replace(new RegExp(`(${J}|${ee})`, "g"), ""), t = document.createElement("div");
+  t.innerHTML = Z.highlight(g, { language: e }).value;
   let r = !1;
   const i = (s) => {
     s.childNodes.forEach((o) => {
@@ -4660,7 +4660,7 @@ function q(e, n) {
             u = u.slice(ee.length), c = c + ee, r = !1;
             continue;
           }
-          const f = u.match(new RegExp(`(${J}|${ee})`)), g = f && f.index ? f.index : u.length, d = Math.min(g, l.length);
+          const f = u.match(new RegExp(`(${J}|${ee})`)), h = f && f.index ? f.index : u.length, d = Math.min(h, l.length);
           c = c + u.substring(0, d), u = u.slice(d), l = l.slice(d);
         }
         r && (c = c + ee), o.textContent = c;
@@ -4671,12 +4671,12 @@ function q(e, n) {
 }
 function On(e, n) {
   const a = (s, o) => (s.match(new RegExp(o, "g")) || []).length, u = (s) => s.filter((o) => n == null ? void 0 : n.test(o)).length;
-  let h = 0, t = 0, r = 0, i = 0;
+  let g = 0, t = 0, r = 0, i = 0;
   for (const s of e) {
     if (s.added) {
       const o = u(s.value.trim().split(`
 `));
-      h += a(s.value.trim(), `
+      g += a(s.value.trim(), `
 `) + 1 - o, r += o;
       continue;
     }
@@ -4689,205 +4689,205 @@ function On(e, n) {
     }
   }
   return {
-    additionsNum: h,
+    additionsNum: g,
     deletionsNum: t,
     ignoreAdditionsNum: r,
     ignoreDeletionsNum: i
   };
 }
-function lr(e, n, a = "plaintext", u = "word", h = 10, t) {
-  const r = () => ({ type: S.EMPTY }), i = (E, b, y) => ({ type: E, num: b, code: y }), s = Ln(e, n), o = t ? new RegExp(t) : void 0;
-  let l = 0, c = 0, f = !1;
-  const g = [], d = {
-    changes: g,
+function lr(e, n, a = "plaintext", u = "word", g = !1, t = 10, r) {
+  const i = () => ({ type: T.EMPTY }), s = (E, m, N) => ({ type: E, num: m, code: N }), o = Ln(e, n), l = r ? new RegExp(r) : void 0;
+  let c = 0, f = 0, h = !1;
+  const d = [], p = {
+    changes: d,
     collector: [],
-    stat: On(s, o)
+    stat: On(o, l)
   };
-  for (let E = 0; E < s.length; E++) {
-    if (f) {
-      f = !1;
+  for (let E = 0; E < o.length; E++) {
+    if (h) {
+      h = !1;
       continue;
     }
-    const [b, y] = [s[E], s[E + 1]], [A, R] = [fe(b), fe(y)], w = b.value.replace(/\n$/, "").split(`
+    const [m, N] = [o[E], o[E + 1]], [D, S] = [fe(m), fe(N)], A = m.value.replace(/\n$/, "").split(`
 `);
-    if (y === void 0) {
-      for (const C of w) {
-        let T = r(), $ = r();
-        const k = q(a, C);
-        A === S.EQUAL && (l++, c++, T = i(S.EQUAL, l, k), $ = i(S.EQUAL, c, k)), A === S.DELETE && (l++, T = i(S.DELETE, l, k), $ = r()), A === S.ADD && (c++, T = r(), $ = i(S.ADD, c, k)), g.push({ left: T, right: $ });
+    if (N === void 0) {
+      for (const C of A) {
+        let I = i(), $ = i();
+        const B = Q(a, C);
+        D === T.EQUAL && (c++, f++, I = s(T.EQUAL, c, B), $ = s(T.EQUAL, f, B)), D === T.DELETE && (c++, I = s(T.DELETE, c, B), $ = i()), D === T.ADD && (f++, I = i(), $ = s(T.ADD, f, B)), d.push({ left: I, right: $ });
       }
       break;
     }
-    if (A === S.EQUAL)
-      for (const C of w) {
-        l++, c++;
-        const T = q(a, C);
-        g.push({
-          left: i(S.EQUAL, l, T),
-          right: i(S.EQUAL, c, T)
+    if (D === T.EQUAL)
+      for (const C of A) {
+        c++, f++;
+        const I = Q(a, C);
+        d.push({
+          left: s(T.EQUAL, c, I),
+          right: s(T.EQUAL, f, I)
         });
       }
-    const D = y.value.replace(/\n$/, "").split(`
+    const R = N.value.replace(/\n$/, "").split(`
 `);
-    if (A === S.DELETE) {
-      if (R === S.EQUAL)
-        for (const C of w)
-          l++, g.push({
-            left: i(S.DELETE, l, q(a, C)),
-            right: r()
+    if (D === T.DELETE) {
+      if (S === T.EQUAL)
+        for (const C of A)
+          c++, d.push({
+            left: s(T.DELETE, c, Q(a, C)),
+            right: i()
           });
-      if (R === S.ADD) {
-        f = !0;
-        const C = Math.max(b.count, y.count);
-        for (let T = 0; T < C; T++) {
-          T < b.count && l++, T < y.count && c++;
-          const [$, k] = [w[T], D[T]], P = w.length === D.length ? De(k, $, u) : $, F = w.length === D.length ? De($, k, u) : k, K = o != null && o.test($) ? S.EQUAL : S.DELETE, te = o != null && o.test(k) ? S.EQUAL : S.ADD, oe = T < b.count ? i(K, l, q(a, P)) : r(), v = T < y.count ? i(te, c, q(a, F)) : r();
-          g.push({ left: oe, right: v });
+      if (S === T.ADD) {
+        h = !0;
+        const C = Math.max(m.count, N.count);
+        for (let I = 0; I < C; I++) {
+          I < m.count && c++, I < N.count && f++;
+          const [$, B] = [A[I], R[I]], F = g || A.length === R.length, K = F ? De(B, $, u) : $, te = F ? De($, B, u) : B, oe = l != null && l.test($) ? T.EQUAL : T.DELETE, b = l != null && l.test(B) ? T.EQUAL : T.ADD, w = I < m.count ? s(oe, c, Q(a, K)) : i(), L = I < N.count ? s(b, f, Q(a, te)) : i();
+          d.push({ left: w, right: L });
         }
       }
     }
-    if (A === S.ADD)
-      for (const C of w)
-        c++, g.push({
-          left: r(),
-          right: i(S.ADD, c, q(a, C))
+    if (D === T.ADD)
+      for (const C of A)
+        f++, d.push({
+          left: i(),
+          right: s(T.ADD, f, Q(a, C))
         });
   }
   if (e === n) {
-    for (let E = 0; E < g.length; E++)
-      g[E].fold = !1;
-    return d;
+    for (let E = 0; E < d.length; E++)
+      d[E].fold = !1;
+    return p;
   }
-  for (let E = 0; E < g.length; E++) {
-    const b = g[E];
-    if (b.left.type === S.DELETE || b.right.type === S.ADD) {
-      const [y, A] = [Math.max(E - h, 0), Math.min(E + h + 1, g.length)];
-      for (let R = y; R < A; R++)
-        g[R].fold = !1;
+  for (let E = 0; E < d.length; E++) {
+    const m = d[E];
+    if (m.left.type === T.DELETE || m.right.type === T.ADD) {
+      const [N, D] = [Math.max(E - t, 0), Math.min(E + t + 1, d.length)];
+      for (let S = N; S < D; S++)
+        d[S].fold = !1;
     }
-    b.fold === void 0 && (b.fold = !0);
+    m.fold === void 0 && (m.fold = !0);
   }
-  const p = [];
-  let _ = [];
-  for (let E = 0; E < g.length; E++) {
-    const b = g[E];
-    if (b.fold === !1) {
-      _.length && (_[0].hideIndex = d.collector.length, d.collector.push({
-        lines: _,
+  const _ = [];
+  let v = [];
+  for (let E = 0; E < d.length; E++) {
+    const m = d[E];
+    if (m.fold === !1) {
+      v.length && (v[0].hideIndex = p.collector.length, p.collector.push({
+        lines: v,
         fold: !0
-      }), _ = []), p.push(b);
+      }), v = []), _.push(m);
       continue;
     }
-    b.hide = !0, _.push(b), p.push(b);
+    m.hide = !0, v.push(m), _.push(m);
   }
-  return _.length && (_[0].hideIndex = d.collector.length, d.collector.push({
-    lines: _,
+  return v.length && (v[0].hideIndex = p.collector.length, p.collector.push({
+    lines: v,
     fold: !0
-  }), _ = []), d.changes = p, d;
+  }), v = []), p.changes = _, p;
 }
-function cr(e, n, a = "plaintext", u = "word", h = 10, t) {
-  const r = Ln(e, n), i = t ? new RegExp(t) : void 0;
-  let s = 0, o = 0, l = !1;
-  const c = [], f = {
-    changes: c,
+function cr(e, n, a = "plaintext", u = "word", g = !1, t = 10, r) {
+  const i = Ln(e, n), s = r ? new RegExp(r) : void 0;
+  let o = 0, l = 0, c = !1;
+  const f = [], h = {
+    changes: f,
     collector: [],
-    stat: On(r, i)
+    stat: On(i, s)
   };
-  for (let p = 0; p < r.length; p++) {
-    if (l) {
-      l = !1;
+  for (let _ = 0; _ < i.length; _++) {
+    if (c) {
+      c = !1;
       continue;
     }
-    const [_, E] = [r[p], r[p + 1]], [b, y] = [fe(_), fe(E)], A = _.value.replace(/\n$/, "").split(`
+    const [v, E] = [i[_], i[_ + 1]], [m, N] = [fe(v), fe(E)], D = v.value.replace(/\n$/, "").split(`
 `);
     if (E === void 0) {
-      for (const w of A) {
-        b === S.EQUAL && (s++, o++), b === S.DELETE && s++, b === S.ADD && o++;
-        const D = q(a, w);
-        c.push({
-          type: b,
-          code: D,
-          addNum: b === S.DELETE ? void 0 : o,
-          delNum: b === S.ADD ? void 0 : s
+      for (const A of D) {
+        m === T.EQUAL && (o++, l++), m === T.DELETE && o++, m === T.ADD && l++;
+        const R = Q(a, A);
+        f.push({
+          type: m,
+          code: R,
+          addNum: m === T.DELETE ? void 0 : l,
+          delNum: m === T.ADD ? void 0 : o
         });
       }
       break;
     }
-    if (b === S.EQUAL)
-      for (const w of A) {
-        s++, o++;
-        const D = q(a, w);
-        c.push({ type: S.EQUAL, code: D, delNum: s, addNum: o });
+    if (m === T.EQUAL)
+      for (const A of D) {
+        o++, l++;
+        const R = Q(a, A);
+        f.push({ type: T.EQUAL, code: R, delNum: o, addNum: l });
       }
-    const R = E.value.replace(/\n$/, "").split(`
+    const S = E.value.replace(/\n$/, "").split(`
 `);
-    if (b === S.DELETE)
-      if (y === S.ADD && A.length === R.length) {
-        for (let w = 0; w < A.length; w++) {
-          const D = A[w], C = R[w];
-          s++;
-          const T = q(a, De(C, D, u));
-          c.push({
-            type: i != null && i.test(D) ? S.EQUAL : S.DELETE,
-            code: T,
-            delNum: s
+    if (m === T.DELETE)
+      if (N === T.ADD && (D.length === S.length || g)) {
+        for (let A = 0; A < D.length; A++) {
+          const R = D[A], C = S[A];
+          o++;
+          const I = Q(a, De(C, R, u));
+          f.push({
+            type: s != null && s.test(R) ? T.EQUAL : T.DELETE,
+            code: I,
+            delNum: o
           });
         }
-        for (let w = 0; w < R.length; w++) {
-          const D = A[w], C = R[w];
-          o++;
-          const T = q(a, De(D, C, u));
-          c.push({
-            type: i != null && i.test(C) ? S.EQUAL : S.ADD,
-            code: T,
-            addNum: o
+        for (let A = 0; A < S.length; A++) {
+          const R = D[A], C = S[A];
+          l++;
+          const I = Q(a, De(R, C, u));
+          f.push({
+            type: s != null && s.test(C) ? T.EQUAL : T.ADD,
+            code: I,
+            addNum: l
           });
         }
-        l = !0;
+        c = !0;
       } else
-        for (const w of A) {
-          s++;
-          const D = q(a, w);
-          c.push({ type: S.DELETE, code: D, delNum: s });
+        for (const A of D) {
+          o++;
+          const R = Q(a, A);
+          f.push({ type: T.DELETE, code: R, delNum: o });
         }
-    if (b === S.ADD)
-      for (const w of A) {
-        o++;
-        const D = q(a, w);
-        c.push({ type: S.ADD, code: D, addNum: o });
+    if (m === T.ADD)
+      for (const A of D) {
+        l++;
+        const R = Q(a, A);
+        f.push({ type: T.ADD, code: R, addNum: l });
       }
   }
-  for (let p = 0; p < c.length; p++) {
-    const _ = c[p];
-    if (_.type === S.DELETE || _.type === S.ADD) {
-      const [E, b] = [Math.max(p - h, 0), Math.min(p + h + 1, c.length)];
-      for (let y = E; y < b; y++)
-        c[y].fold = !1;
+  for (let _ = 0; _ < f.length; _++) {
+    const v = f[_];
+    if (v.type === T.DELETE || v.type === T.ADD) {
+      const [E, m] = [Math.max(_ - t, 0), Math.min(_ + t + 1, f.length)];
+      for (let N = E; N < m; N++)
+        f[N].fold = !1;
     }
-    _.fold === void 0 && (_.fold = !0);
+    v.fold === void 0 && (v.fold = !0);
   }
   if (e === n) {
-    for (let p = 0; p < c.length; p++)
-      c[p].fold = !1;
-    return f;
+    for (let _ = 0; _ < f.length; _++)
+      f[_].fold = !1;
+    return h;
   }
-  const g = [];
-  let d = [];
-  for (let p = 0; p < c.length; p++) {
-    const _ = c[p];
-    if (_.fold === !1) {
-      d.length && (d[0].hideIndex = f.collector.length, f.collector.push({
-        lines: d,
+  const d = [];
+  let p = [];
+  for (let _ = 0; _ < f.length; _++) {
+    const v = f[_];
+    if (v.fold === !1) {
+      p.length && (p[0].hideIndex = h.collector.length, h.collector.push({
+        lines: p,
         fold: !0
-      }), d = []), g.push(_);
+      }), p = []), d.push(v);
       continue;
     }
-    _.type === "equal" && (_.hide = !0, d.push(_)), g.push(_);
+    v.type === "equal" && (v.hide = !0, p.push(v)), d.push(v);
   }
-  return d.length && (d[0].hideIndex = f.collector.length, f.collector.push({
-    lines: d,
+  return p.length && (p[0].hideIndex = h.collector.length, h.collector.push({
+    lines: p,
     fold: !0
-  }), d = []), f.changes = g, f;
+  }), p = []), h.changes = d, h;
 }
 const Ge = {};
 Ge.props = {
@@ -4899,11 +4899,11 @@ Ge.props = {
 };
 Ge.setup = (e, n) => {
   const a = n.emit;
-  function u(h) {
-    return h === S.DELETE ? "-" : h === S.ADD ? "+" : "";
+  function u(g) {
+    return g === T.DELETE ? "-" : g === T.ADD ? "+" : "";
   }
   return {
-    DiffType: S,
+    DiffType: T,
     emit: a,
     getCodeMarker: u
   };
@@ -4959,25 +4959,25 @@ var ur = function() {
     }
   })])]);
 }, fr = [];
-function Ee(e, n, a, u, h, t, r, i) {
+function Ee(e, n, a, u, g, t, r, i) {
   var s = typeof e == "function" ? e.options : e;
   n && (s.render = n, s.staticRenderFns = a, s._compiled = !0), u && (s.functional = !0), t && (s._scopeId = "data-v-" + t);
   var o;
   if (r ? (o = function(f) {
     f = f || // cached call
     this.$vnode && this.$vnode.ssrContext || // stateful
-    this.parent && this.parent.$vnode && this.parent.$vnode.ssrContext, !f && typeof __VUE_SSR_CONTEXT__ != "undefined" && (f = __VUE_SSR_CONTEXT__), h && h.call(this, f), f && f._registeredComponents && f._registeredComponents.add(r);
-  }, s._ssrRegister = o) : h && (o = i ? function() {
-    h.call(
+    this.parent && this.parent.$vnode && this.parent.$vnode.ssrContext, !f && typeof __VUE_SSR_CONTEXT__ != "undefined" && (f = __VUE_SSR_CONTEXT__), g && g.call(this, f), f && f._registeredComponents && f._registeredComponents.add(r);
+  }, s._ssrRegister = o) : g && (o = i ? function() {
+    g.call(
       this,
       (s.functional ? this.parent : this).$root.$options.shadowRoot
     );
-  } : h), o)
+  } : g), o)
     if (s.functional) {
       s._injectStyles = o;
       var l = s.render;
-      s.render = function(g, d) {
-        return o.call(d), l(g, d);
+      s.render = function(h, d) {
+        return o.call(d), l(h, d);
       };
     } else {
       var c = s.beforeCreate;
@@ -5016,9 +5016,9 @@ _e.props = {
 _e.setup = (e, n) => {
   const a = e;
   function u({
-    hideIndex: h
+    hideIndex: g
   }) {
-    h !== void 0 && a.diffChange.collector[h].lines.forEach((t) => {
+    g !== void 0 && a.diffChange.collector[g].lines.forEach((t) => {
       t.hide = !1, t.fold = !1;
     });
   }
@@ -5033,11 +5033,11 @@ var pr = function() {
   var e, n = this, a = n.$createElement, u = n._self._c || a;
   return u("table", {
     staticClass: "diff-table"
-  }, [u("tbody", n._l((e = n.diffChange) === null || e === void 0 ? void 0 : e.changes, function(h, t) {
+  }, [u("tbody", n._l((e = n.diffChange) === null || e === void 0 ? void 0 : e.changes, function(g, t) {
     return u("UnifiedLine", {
       key: t,
       attrs: {
-        line: h
+        line: g
       },
       on: {
         expand: n.expandHandler
@@ -5073,9 +5073,9 @@ Ke.props = {
 Ke.setup = (e, n) => {
   const a = n.emit;
   function u(t) {
-    return t === S.DELETE ? "-" : t === S.ADD ? "+" : "";
+    return t === T.DELETE ? "-" : t === T.ADD ? "+" : "";
   }
-  function h(t) {
+  function g(t) {
     window.getSelection().removeAllRanges();
     const r = document.querySelectorAll(".file-diff-split .split-side-left"), i = document.querySelectorAll(".file-diff-split .split-side-right");
     for (const s of i)
@@ -5084,10 +5084,10 @@ Ke.setup = (e, n) => {
       s.classList.toggle("no-select", t === "right");
   }
   return {
-    DiffType: S,
+    DiffType: T,
     emit: a,
     getCodeMarker: u,
-    onSplitLineMousedown: h
+    onSplitLineMousedown: g
   };
 };
 var mr = function() {
@@ -5108,7 +5108,7 @@ var mr = function() {
       colspan: "3",
       align: "left"
     }
-  }, [e._v(" ⋯ ")])]) : e.splitLine.hide ? e._e() : a("tr", [e._l([e.splitLine.left, e.splitLine.right], function(u, h) {
+  }, [e._v(" ⋯ ")])]) : e.splitLine.hide ? e._e() : a("tr", [e._l([e.splitLine.left, e.splitLine.right], function(u, g) {
     return [u.type === e.DiffType.EMPTY ? [a("td", {
       staticClass: "blob-num blob-num-empty empty-cell"
     }), a("td", {
@@ -5128,12 +5128,12 @@ var mr = function() {
         "blob-code-addition": u.type === e.DiffType.ADD,
         "blob-code-context": u.type === e.DiffType.EQUAL,
         "blob-code-hunk": e.splitLine.hide !== void 0,
-        "split-side-left": h === 0,
-        "split-side-right": h === 1
+        "split-side-left": g === 0,
+        "split-side-right": g === 1
       },
       on: {
         mousedown: function(t) {
-          return e.onSplitLineMousedown(h === 0 ? "left" : "right");
+          return e.onSplitLineMousedown(g === 0 ? "left" : "right");
         }
       }
     }, [a("span", {
@@ -5175,9 +5175,9 @@ be.props = {
 be.setup = (e, n) => {
   const a = e;
   function u({
-    hideIndex: h
+    hideIndex: g
   }) {
-    h !== void 0 && a.diffChange.collector[h].lines.forEach((t) => {
+    g !== void 0 && a.diffChange.collector[g].lines.forEach((t) => {
       t.hide = !1, t.fold = !1;
     });
   }
@@ -5192,11 +5192,11 @@ var Mr = function() {
   var e, n = this, a = n.$createElement, u = n._self._c || a;
   return u("table", {
     staticClass: "file-diff-split diff-table"
-  }, [n._m(0), u("tbody", n._l((e = n.diffChange) === null || e === void 0 ? void 0 : e.changes, function(h, t) {
+  }, [n._m(0), u("tbody", n._l((e = n.diffChange) === null || e === void 0 ? void 0 : e.changes, function(g, t) {
     return u("SplitLine", {
       key: t,
       attrs: {
-        "split-line": h
+        "split-line": g
       },
       on: {
         expand: n.expandHandler
@@ -5230,7 +5230,7 @@ function Dr(e) {
   for (let n in fn)
     this[n] = fn[n];
 }
-const Rr = /* @__PURE__ */ function() {
+const Cr = /* @__PURE__ */ function() {
   return Sr.exports;
 }();
 const ve = {};
@@ -5263,6 +5263,12 @@ ve.props = {
     type: String,
     default: "word"
   },
+  forceInlineComparison: {
+    key: "forceInlineComparison",
+    required: !1,
+    type: Boolean,
+    default: !1
+  },
   outputFormat: {
     key: "outputFormat",
     required: !1,
@@ -5325,7 +5331,7 @@ ve.props = {
   }
 };
 ve.setup = (e, n) => {
-  const a = e, u = n.emit, h = ge(() => a.outputFormat === "line-by-line"), t = ge(() => {
+  const a = e, u = n.emit, g = ge(() => a.outputFormat === "line-by-line"), t = ge(() => {
     let l = a.oldString || "";
     return l = a.trim ? l.trim() : l, l = a.noDiffLineFeed ? l.replace(/(\r\n)/g, `
 `) : l, l;
@@ -5333,7 +5339,7 @@ ve.setup = (e, n) => {
     let l = a.newString || "";
     return l = a.trim ? l.trim() : l, l = a.noDiffLineFeed ? l.replace(/(\r\n)/g, `
 `) : l, l;
-  }), i = ge(() => h.value ? cr(t.value, r.value, a.language, a.diffStyle, a.context, a.ignoreMatchingLines) : lr(t.value, r.value, a.language, a.diffStyle, a.context, a.ignoreMatchingLines)), s = Fn(i.value), o = ge(() => s.value.stat.additionsNum === 0 && s.value.stat.deletionsNum === 0);
+  }), i = ge(() => g.value ? cr(t.value, r.value, a.language, a.diffStyle, a.forceInlineComparison, a.context, a.ignoreMatchingLines) : lr(t.value, r.value, a.language, a.diffStyle, a.forceInlineComparison, a.context, a.ignoreMatchingLines)), s = Fn(i.value), o = ge(() => s.value.stat.additionsNum === 0 && s.value.stat.deletionsNum === 0);
   return zn(() => a, () => {
     s.value = i.value, u("diff", {
       stat: {
@@ -5346,15 +5352,15 @@ ve.setup = (e, n) => {
     deep: !0,
     immediate: !0
   }), {
-    isUnifiedViewer: h,
+    isUnifiedViewer: g,
     diffChange: s
   };
 };
 ve.components = Object.assign({
   UnifiedViewer: Er,
-  SplitViewer: Rr
+  SplitViewer: Cr
 }, ve.components);
-var Cr = function() {
+var Rr = function() {
   var e = this, n = e.$createElement, a = e._self._c || n;
   return a("div", {
     staticClass: "code-diff-view",
@@ -5415,7 +5421,7 @@ var Cr = function() {
 const gn = {};
 var Or = /* @__PURE__ */ Ee(
   ve,
-  Cr,
+  Rr,
   Lr,
   !1,
   Ir,