v-code-diff 1.14.1 → 1.15.0

package/dist/v2/index.es.js

@@ -10,8 +10,8 @@ function te() {
 }
 te.prototype = {
   diff: function(n, s) {
-    var f, g = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = g.callback;
-    typeof g == "function" && (t = g, g = {}), this.options = g;
+    var f, h = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = h.callback;
+    typeof h == "function" && (t = h, h = {}), this.options = h;
     var i = this;
     function r(y) {
       return t ? (setTimeout(function() {
@@ -19,13 +19,13 @@ te.prototype = {
       }, 0), !0) : y;
     }
     n = this.castInput(n), s = this.castInput(s), n = this.removeEmpty(this.tokenize(n)), s = this.removeEmpty(this.tokenize(s));
-    var a = s.length, c = n.length, o = 1, l = a + c;
-    g.maxEditLength && (l = Math.min(l, g.maxEditLength));
-    var u = (f = g.timeout) !== null && f !== void 0 ? f : 1 / 0, h = Date.now() + u, d = [{
+    var a = s.length, l = n.length, o = 1, c = a + l;
+    h.maxEditLength && (c = Math.min(c, h.maxEditLength));
+    var u = (f = h.timeout) !== null && f !== void 0 ? f : 1 / 0, g = Date.now() + u, d = [{
       oldPos: -1,
       lastComponent: void 0
     }], p = this.extractCommon(d[0], s, n, 0);
-    if (d[0].oldPos + 1 >= c && p + 1 >= a)
+    if (d[0].oldPos + 1 >= l && p + 1 >= a)
       return r([{
         value: this.join(s),
         count: s.length
@@ -33,43 +33,43 @@ te.prototype = {
     var _ = -1 / 0, b = 1 / 0;
     function m() {
       for (var y = Math.max(_, -o); y <= Math.min(b, o); y += 2) {
-        var T = void 0, N = d[y - 1], S = d[y + 1];
-        N && (d[y - 1] = void 0);
+        var S = void 0, T = d[y - 1], D = d[y + 1];
+        T && (d[y - 1] = void 0);
         var k = !1;
-        if (S) {
-          var M = S.oldPos - y;
-          k = S && 0 <= M && M < a;
+        if (D) {
+          var M = D.oldPos - y;
+          k = D && 0 <= M && M < a;
         }
-        var L = N && N.oldPos + 1 < c;
+        var L = T && T.oldPos + 1 < l;
         if (!k && !L) {
           d[y] = void 0;
           continue;
         }
-        if (!L || k && N.oldPos + 1 < S.oldPos ? T = i.addToPath(S, !0, void 0, 0) : T = i.addToPath(N, void 0, !0, 1), p = i.extractCommon(T, s, n, y), T.oldPos + 1 >= c && p + 1 >= a)
-          return r(nt(i, T.lastComponent, s, n, i.useLongestToken));
-        d[y] = T, T.oldPos + 1 >= c && (b = Math.min(b, y - 1)), p + 1 >= a && (_ = Math.max(_, y + 1));
+        if (!L || k && T.oldPos + 1 < D.oldPos ? S = i.addToPath(D, !0, void 0, 0) : S = i.addToPath(T, void 0, !0, 1), p = i.extractCommon(S, s, n, y), S.oldPos + 1 >= l && p + 1 >= a)
+          return r(nt(i, S.lastComponent, s, n, i.useLongestToken));
+        d[y] = S, S.oldPos + 1 >= l && (b = Math.min(b, y - 1)), p + 1 >= a && (_ = Math.max(_, y + 1));
       }
       o++;
     }
     if (t)
       (function y() {
         setTimeout(function() {
-          if (o > l || Date.now() > h)
+          if (o > c || Date.now() > g)
             return t();
           m() || y();
         }, 0);
       })();
     else
-      for (; o <= l && Date.now() <= h; ) {
+      for (; o <= c && Date.now() <= g; ) {
         var E = m();
         if (E)
           return E;
       }
   },
-  addToPath: function(n, s, f, g) {
+  addToPath: function(n, s, f, h) {
     var t = n.lastComponent;
     return t && t.added === s && t.removed === f ? {
-      oldPos: n.oldPos + g,
+      oldPos: n.oldPos + h,
       lastComponent: {
         count: t.count + 1,
         added: s,
@@ -77,7 +77,7 @@ te.prototype = {
         previousComponent: t.previousComponent
       }
     } : {
-      oldPos: n.oldPos + g,
+      oldPos: n.oldPos + h,
       lastComponent: {
         count: 1,
         added: s,
@@ -86,11 +86,11 @@ te.prototype = {
       }
     };
   },
-  extractCommon: function(n, s, f, g) {
-    for (var t = s.length, i = f.length, r = n.oldPos, a = r - g, c = 0; a + 1 < t && r + 1 < i && this.equals(s[a + 1], f[r + 1]); )
-      a++, r++, c++;
-    return c && (n.lastComponent = {
-      count: c,
+  extractCommon: function(n, s, f, h) {
+    for (var t = s.length, i = f.length, r = n.oldPos, a = r - h, l = 0; a + 1 < t && r + 1 < i && this.equals(s[a + 1], f[r + 1]); )
+      a++, r++, l++;
+    return l && (n.lastComponent = {
+      count: l,
       previousComponent: n.lastComponent
     }), n.oldPos = r, a;
   },
@@ -112,27 +112,27 @@ te.prototype = {
     return n.join("");
   }
 };
-function nt(e, n, s, f, g) {
+function nt(e, n, s, f, h) {
   for (var t = [], i; n; )
     t.push(n), i = n.previousComponent, delete n.previousComponent, n = i;
   t.reverse();
-  for (var r = 0, a = t.length, c = 0, o = 0; r < a; r++) {
-    var l = t[r];
-    if (l.removed) {
-      if (l.value = e.join(f.slice(o, o + l.count)), o += l.count, r && t[r - 1].added) {
-        var h = t[r - 1];
-        t[r - 1] = t[r], t[r] = h;
+  for (var r = 0, a = t.length, l = 0, o = 0; r < a; r++) {
+    var c = t[r];
+    if (c.removed) {
+      if (c.value = e.join(f.slice(o, o + c.count)), o += c.count, r && t[r - 1].added) {
+        var g = t[r - 1];
+        t[r - 1] = t[r], t[r] = g;
       }
     } else {
-      if (!l.added && g) {
-        var u = s.slice(c, c + l.count);
+      if (!c.added && h) {
+        var u = s.slice(l, l + c.count);
         u = u.map(function(p, _) {
           var b = f[o + _];
           return b.length > p.length ? b : p;
-        }), l.value = e.join(u);
+        }), c.value = e.join(u);
       } else
-        l.value = e.join(s.slice(c, c + l.count));
-      c += l.count, l.added || (o += l.count);
+        c.value = e.join(s.slice(l, l + c.count));
+      l += c.count, c.added || (o += c.count);
     }
   }
   var d = t[a - 1];
@@ -171,8 +171,8 @@ We.tokenize = function(e) {
   var n = [], s = e.split(/(\n|\r\n)/);
   s[s.length - 1] || s.pop();
   for (var f = 0; f < s.length; f++) {
-    var g = s[f];
-    f % 2 && !this.options.newlineIsToken ? n[n.length - 1] += g : (this.options.ignoreWhitespace && (g = g.trim()), n.push(g));
+    var h = s[f];
+    f % 2 && !this.options.newlineIsToken ? n[n.length - 1] += h : (this.options.ignoreWhitespace && (h = h.trim()), n.push(h));
   }
   return n;
 };
@@ -199,16 +199,16 @@ var ct = Object.prototype.toString, de = new te();
 de.useLongestToken = !0;
 de.tokenize = We.tokenize;
 de.castInput = function(e) {
-  var n = this.options, s = n.undefinedReplacement, f = n.stringifyReplacer, g = f === void 0 ? function(t, i) {
+  var n = this.options, s = n.undefinedReplacement, f = n.stringifyReplacer, h = f === void 0 ? function(t, i) {
     return typeof i == "undefined" ? s : i;
   } : f;
-  return typeof e == "string" ? e : JSON.stringify(Be(e, null, null, g), g, "  ");
+  return typeof e == "string" ? e : JSON.stringify(Be(e, null, null, h), h, "  ");
 };
 de.equals = function(e, n) {
   return te.prototype.equals.call(de, e.replace(/,([\r\n])/g, "$1"), n.replace(/,([\r\n])/g, "$1"));
 };
-function Be(e, n, s, f, g) {
-  n = n || [], s = s || [], f && (e = f(g, e));
+function Be(e, n, s, f, h) {
+  n = n || [], s = s || [], f && (e = f(h, e));
   var t;
   for (t = 0; t < n.length; t += 1)
     if (n[t] === e)
@@ -216,7 +216,7 @@ function Be(e, n, s, f, g) {
   var i;
   if (ct.call(e) === "[object Array]") {
     for (n.push(e), i = new Array(e.length), s.push(i), t = 0; t < e.length; t += 1)
-      i[t] = Be(e[t], n, s, f, g);
+      i[t] = Be(e[t], n, s, f, h);
     return n.pop(), s.pop(), i;
   }
   if (e && e.toJSON && (e = e.toJSON()), Se(e) === "object" && e !== null) {
@@ -241,53 +241,53 @@ xe.join = xe.removeEmpty = function(e) {
 function ut(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var Nn = { exports: {} };
+var Mn = { 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;
-  }, s = -1, f = 1, g = 0;
+  }, s = -1, f = 1, h = 0;
   n.Diff = function(t, i) {
     return [t, i];
   }, n.prototype.diff_main = function(t, i, r, a) {
     typeof a == "undefined" && (this.Diff_Timeout <= 0 ? a = Number.MAX_VALUE : a = (/* @__PURE__ */ new Date()).getTime() + this.Diff_Timeout * 1e3);
-    var c = a;
+    var l = a;
     if (t == null || i == null)
       throw new Error("Null input. (diff_main)");
     if (t == i)
-      return t ? [new n.Diff(g, t)] : [];
+      return t ? [new n.Diff(h, t)] : [];
     typeof r == "undefined" && (r = !0);
-    var o = r, l = this.diff_commonPrefix(t, i), u = t.substring(0, l);
-    t = t.substring(l), i = i.substring(l), l = this.diff_commonSuffix(t, i);
-    var h = t.substring(t.length - l);
-    t = t.substring(0, t.length - l), i = i.substring(0, i.length - l);
-    var d = this.diff_compute_(t, i, o, c);
-    return u && d.unshift(new n.Diff(g, u)), h && d.push(new n.Diff(g, h)), this.diff_cleanupMerge(d), d;
+    var o = r, c = this.diff_commonPrefix(t, i), u = t.substring(0, c);
+    t = t.substring(c), i = i.substring(c), c = this.diff_commonSuffix(t, i);
+    var g = t.substring(t.length - c);
+    t = t.substring(0, t.length - c), i = i.substring(0, i.length - c);
+    var d = this.diff_compute_(t, i, o, l);
+    return u && d.unshift(new n.Diff(h, u)), g && d.push(new n.Diff(h, g)), this.diff_cleanupMerge(d), d;
   }, n.prototype.diff_compute_ = function(t, i, r, a) {
-    var c;
+    var l;
     if (!t)
       return [new n.Diff(f, i)];
     if (!i)
       return [new n.Diff(s, t)];
-    var o = t.length > i.length ? t : i, l = t.length > i.length ? i : t, u = o.indexOf(l);
+    var o = t.length > i.length ? t : i, c = t.length > i.length ? i : t, u = o.indexOf(c);
     if (u != -1)
-      return c = [
+      return l = [
         new n.Diff(f, o.substring(0, u)),
-        new n.Diff(g, l),
+        new n.Diff(h, c),
         new n.Diff(
           f,
-          o.substring(u + l.length)
+          o.substring(u + c.length)
         )
-      ], t.length > i.length && (c[0][0] = c[2][0] = s), c;
-    if (l.length == 1)
+      ], t.length > i.length && (l[0][0] = l[2][0] = s), l;
+    if (c.length == 1)
       return [
         new n.Diff(s, t),
         new n.Diff(f, i)
       ];
-    var h = this.diff_halfMatch_(t, i);
-    if (h) {
-      var d = h[0], p = h[1], _ = h[2], b = h[3], m = h[4], E = this.diff_main(d, _, r, a), y = this.diff_main(p, b, r, a);
+    var g = this.diff_halfMatch_(t, i);
+    if (g) {
+      var d = g[0], p = g[1], _ = g[2], b = g[3], m = g[4], E = this.diff_main(d, _, r, a), y = this.diff_main(p, b, r, a);
       return E.concat(
-        [new n.Diff(g, m)],
+        [new n.Diff(h, m)],
         y
       );
     }
@@ -295,48 +295,48 @@ var Nn = { exports: {} };
   }, n.prototype.diff_lineMode_ = function(t, i, r) {
     var a = this.diff_linesToChars_(t, i);
     t = a.chars1, i = a.chars2;
-    var c = a.lineArray, o = this.diff_main(t, i, !1, r);
-    this.diff_charsToLines_(o, c), this.diff_cleanupSemantic(o), o.push(new n.Diff(g, ""));
-    for (var l = 0, u = 0, h = 0, d = "", p = ""; l < o.length; ) {
-      switch (o[l][0]) {
+    var l = a.lineArray, o = this.diff_main(t, i, !1, r);
+    this.diff_charsToLines_(o, l), this.diff_cleanupSemantic(o), o.push(new n.Diff(h, ""));
+    for (var c = 0, u = 0, g = 0, d = "", p = ""; c < o.length; ) {
+      switch (o[c][0]) {
         case f:
-          h++, p += o[l][1];
+          g++, p += o[c][1];
           break;
         case s:
-          u++, d += o[l][1];
+          u++, d += o[c][1];
           break;
-        case g:
-          if (u >= 1 && h >= 1) {
+        case h:
+          if (u >= 1 && g >= 1) {
             o.splice(
-              l - u - h,
-              u + h
-            ), l = l - u - h;
+              c - u - g,
+              u + g
+            ), c = c - u - g;
             for (var _ = this.diff_main(d, p, !1, r), b = _.length - 1; b >= 0; b--)
-              o.splice(l, 0, _[b]);
-            l = l + _.length;
+              o.splice(c, 0, _[b]);
+            c = c + _.length;
           }
-          h = 0, u = 0, d = "", p = "";
+          g = 0, u = 0, d = "", p = "";
           break;
       }
-      l++;
+      c++;
     }
     return o.pop(), o;
   }, n.prototype.diff_bisect_ = function(t, i, r) {
-    for (var a = t.length, c = i.length, o = Math.ceil((a + c) / 2), l = o, u = 2 * o, h = new Array(u), d = new Array(u), p = 0; p < u; p++)
-      h[p] = -1, d[p] = -1;
-    h[l + 1] = 0, d[l + 1] = 0;
-    for (var _ = a - c, b = _ % 2 != 0, m = 0, E = 0, y = 0, T = 0, N = 0; N < o && !((/* @__PURE__ */ new Date()).getTime() > r); N++) {
-      for (var S = -N + m; S <= N - E; S += 2) {
-        var k = l + S, M;
-        S == -N || S != N && h[k - 1] < h[k + 1] ? M = h[k + 1] : M = h[k - 1] + 1;
-        for (var L = M - S; M < a && L < c && t.charAt(M) == i.charAt(L); )
+    for (var a = t.length, l = i.length, o = Math.ceil((a + l) / 2), c = o, u = 2 * o, g = new Array(u), d = new Array(u), p = 0; p < u; p++)
+      g[p] = -1, d[p] = -1;
+    g[c + 1] = 0, d[c + 1] = 0;
+    for (var _ = a - l, b = _ % 2 != 0, m = 0, E = 0, y = 0, S = 0, T = 0; T < o && !((/* @__PURE__ */ new Date()).getTime() > r); T++) {
+      for (var D = -T + m; D <= T - E; D += 2) {
+        var k = c + D, M;
+        D == -T || D != T && g[k - 1] < g[k + 1] ? M = g[k + 1] : M = g[k - 1] + 1;
+        for (var L = M - D; M < a && L < l && t.charAt(M) == i.charAt(L); )
           M++, L++;
-        if (h[k] = M, M > a)
+        if (g[k] = M, M > a)
           E += 2;
-        else if (L > c)
+        else if (L > l)
           m += 2;
         else if (b) {
-          var $ = l + _ - S;
+          var $ = c + _ - D;
           if ($ >= 0 && $ < u && d[$] != -1) {
             var x = a - d[$];
             if (M >= x)
@@ -344,19 +344,19 @@ var Nn = { exports: {} };
           }
         }
       }
-      for (var H = -N + y; H <= N - T; H += 2) {
-        var $ = l + H, x;
-        H == -N || H != N && d[$ - 1] < d[$ + 1] ? x = d[$ + 1] : x = d[$ - 1] + 1;
-        for (var K = x - H; x < a && K < c && t.charAt(a - x - 1) == i.charAt(c - K - 1); )
+      for (var H = -T + y; H <= T - S; H += 2) {
+        var $ = c + H, x;
+        H == -T || H != T && d[$ - 1] < d[$ + 1] ? x = d[$ + 1] : x = d[$ - 1] + 1;
+        for (var K = x - H; x < a && K < l && t.charAt(a - x - 1) == i.charAt(l - K - 1); )
           x++, K++;
         if (d[$] = x, x > a)
-          T += 2;
-        else if (K > c)
+          S += 2;
+        else if (K > l)
           y += 2;
         else if (!b) {
-          var k = l + _ - H;
-          if (k >= 0 && k < u && h[k] != -1) {
-            var M = h[k], L = l + M - k;
+          var k = c + _ - H;
+          if (k >= 0 && k < u && g[k] != -1) {
+            var M = g[k], L = c + M - k;
             if (x = a - x, M >= x)
               return this.diff_bisectSplit_(t, i, M, L, r);
           }
@@ -367,56 +367,56 @@ var Nn = { exports: {} };
       new n.Diff(s, t),
       new n.Diff(f, i)
     ];
-  }, n.prototype.diff_bisectSplit_ = function(t, i, r, a, c) {
-    var o = t.substring(0, r), l = i.substring(0, a), u = t.substring(r), h = i.substring(a), d = this.diff_main(o, l, !1, c), p = this.diff_main(u, h, !1, c);
+  }, n.prototype.diff_bisectSplit_ = function(t, i, r, a, l) {
+    var o = t.substring(0, r), c = i.substring(0, a), u = t.substring(r), g = i.substring(a), d = this.diff_main(o, c, !1, l), p = this.diff_main(u, g, !1, l);
     return d.concat(p);
   }, n.prototype.diff_linesToChars_ = function(t, i) {
     var r = [], a = {};
     r[0] = "";
-    function c(h) {
-      for (var d = "", p = 0, _ = -1, b = r.length; _ < h.length - 1; ) {
-        _ = h.indexOf(`
-`, p), _ == -1 && (_ = h.length - 1);
-        var m = h.substring(p, _ + 1);
-        (a.hasOwnProperty ? a.hasOwnProperty(m) : a[m] !== void 0) ? d += String.fromCharCode(a[m]) : (b == o && (m = h.substring(p), _ = h.length), d += String.fromCharCode(b), a[m] = b, r[b++] = m), p = _ + 1;
+    function l(g) {
+      for (var d = "", p = 0, _ = -1, b = r.length; _ < g.length - 1; ) {
+        _ = g.indexOf(`
+`, p), _ == -1 && (_ = g.length - 1);
+        var m = g.substring(p, _ + 1);
+        (a.hasOwnProperty ? a.hasOwnProperty(m) : a[m] !== void 0) ? d += String.fromCharCode(a[m]) : (b == o && (m = g.substring(p), _ = g.length), d += String.fromCharCode(b), a[m] = b, r[b++] = m), p = _ + 1;
       }
       return d;
     }
-    var o = 4e4, l = c(t);
+    var o = 4e4, c = l(t);
     o = 65535;
-    var u = c(i);
-    return { chars1: l, chars2: u, lineArray: r };
+    var u = l(i);
+    return { chars1: c, chars2: u, lineArray: r };
   }, n.prototype.diff_charsToLines_ = function(t, i) {
     for (var r = 0; r < t.length; r++) {
-      for (var a = t[r][1], c = [], o = 0; o < a.length; o++)
-        c[o] = i[a.charCodeAt(o)];
-      t[r][1] = c.join("");
+      for (var a = t[r][1], l = [], o = 0; o < a.length; o++)
+        l[o] = i[a.charCodeAt(o)];
+      t[r][1] = l.join("");
     }
   }, n.prototype.diff_commonPrefix = function(t, i) {
     if (!t || !i || t.charAt(0) != i.charAt(0))
       return 0;
-    for (var r = 0, a = Math.min(t.length, i.length), c = a, o = 0; r < c; )
-      t.substring(o, c) == i.substring(o, c) ? (r = c, o = r) : a = c, c = Math.floor((a - r) / 2 + r);
-    return c;
+    for (var r = 0, a = Math.min(t.length, i.length), l = a, o = 0; r < l; )
+      t.substring(o, l) == i.substring(o, l) ? (r = l, o = r) : a = l, l = Math.floor((a - r) / 2 + r);
+    return l;
   }, n.prototype.diff_commonSuffix = function(t, i) {
     if (!t || !i || t.charAt(t.length - 1) != i.charAt(i.length - 1))
       return 0;
-    for (var r = 0, a = Math.min(t.length, i.length), c = a, o = 0; r < c; )
-      t.substring(t.length - c, t.length - o) == i.substring(i.length - c, i.length - o) ? (r = c, o = r) : a = c, c = Math.floor((a - r) / 2 + r);
-    return c;
+    for (var r = 0, a = Math.min(t.length, i.length), l = a, o = 0; r < l; )
+      t.substring(t.length - l, t.length - o) == i.substring(i.length - l, i.length - o) ? (r = l, o = r) : a = l, l = Math.floor((a - r) / 2 + r);
+    return l;
   }, n.prototype.diff_commonOverlap_ = function(t, i) {
     var r = t.length, a = i.length;
     if (r == 0 || a == 0)
       return 0;
     r > a ? t = t.substring(r - a) : r < a && (i = i.substring(0, r));
-    var c = Math.min(r, a);
+    var l = Math.min(r, a);
     if (t == i)
-      return c;
-    for (var o = 0, l = 1; ; ) {
-      var u = t.substring(c - l), h = i.indexOf(u);
-      if (h == -1)
+      return l;
+    for (var o = 0, c = 1; ; ) {
+      var u = t.substring(l - c), g = i.indexOf(u);
+      if (g == -1)
         return o;
-      l += h, (h == 0 || t.substring(c - l) == i.substring(0, l)) && (o = l, l++);
+      c += g, (g == 0 || t.substring(l - c) == i.substring(0, c)) && (o = c, c++);
     }
   }, n.prototype.diff_halfMatch_ = function(t, i) {
     if (this.Diff_Timeout <= 0)
@@ -424,17 +424,17 @@ var Nn = { exports: {} };
     var r = t.length > i.length ? t : i, a = t.length > i.length ? i : t;
     if (r.length < 4 || a.length * 2 < r.length)
       return null;
-    var c = this;
-    function o(E, y, T) {
-      for (var N = E.substring(T, T + Math.floor(E.length / 4)), S = -1, k = "", M, L, $, x; (S = y.indexOf(N, S + 1)) != -1; ) {
-        var H = c.diff_commonPrefix(
-          E.substring(T),
-          y.substring(S)
-        ), K = c.diff_commonSuffix(
-          E.substring(0, T),
-          y.substring(0, S)
+    var l = this;
+    function o(E, y, S) {
+      for (var T = E.substring(S, S + Math.floor(E.length / 4)), D = -1, k = "", M, L, $, x; (D = y.indexOf(T, D + 1)) != -1; ) {
+        var H = l.diff_commonPrefix(
+          E.substring(S),
+          y.substring(D)
+        ), K = l.diff_commonSuffix(
+          E.substring(0, S),
+          y.substring(0, D)
         );
-        k.length < K + H && (k = y.substring(S - K, S) + y.substring(S, S + H), M = E.substring(0, T - K), L = E.substring(T + H), $ = y.substring(0, S - K), x = y.substring(S + H));
+        k.length < K + H && (k = y.substring(D - K, D) + y.substring(D, D + H), M = E.substring(0, S - K), L = E.substring(S + H), $ = y.substring(0, D - K), x = y.substring(D + H));
       }
       return k.length * 2 >= E.length ? [
         M,
@@ -444,7 +444,7 @@ var Nn = { exports: {} };
         k
       ] : null;
     }
-    var l = o(
+    var c = o(
       r,
       a,
       Math.ceil(r.length / 4)
@@ -452,32 +452,32 @@ var Nn = { exports: {} };
       r,
       a,
       Math.ceil(r.length / 2)
-    ), h;
-    if (!l && !u)
+    ), g;
+    if (!c && !u)
       return null;
-    u ? l ? h = l[4].length > u[4].length ? l : u : h = u : h = l;
+    u ? c ? g = c[4].length > u[4].length ? c : u : g = u : g = c;
     var d, p, _, b;
-    t.length > i.length ? (d = h[0], p = h[1], _ = h[2], b = h[3]) : (_ = h[0], b = h[1], d = h[2], p = h[3]);
-    var m = h[4];
+    t.length > i.length ? (d = g[0], p = g[1], _ = g[2], b = g[3]) : (_ = g[0], b = g[1], d = g[2], p = g[3]);
+    var m = g[4];
     return [d, p, _, b, m];
   }, n.prototype.diff_cleanupSemantic = function(t) {
-    for (var i = !1, r = [], a = 0, c = null, o = 0, l = 0, u = 0, h = 0, d = 0; o < t.length; )
-      t[o][0] == g ? (r[a++] = o, l = h, u = d, h = 0, d = 0, c = t[o][1]) : (t[o][0] == f ? h += t[o][1].length : d += t[o][1].length, c && c.length <= Math.max(l, u) && c.length <= Math.max(
-        h,
+    for (var i = !1, r = [], a = 0, l = null, o = 0, c = 0, u = 0, g = 0, d = 0; o < t.length; )
+      t[o][0] == h ? (r[a++] = o, c = g, u = d, g = 0, d = 0, l = t[o][1]) : (t[o][0] == f ? g += t[o][1].length : d += t[o][1].length, l && l.length <= Math.max(c, u) && l.length <= Math.max(
+        g,
         d
       ) && (t.splice(
         r[a - 1],
         0,
-        new n.Diff(s, c)
-      ), t[r[a - 1] + 1][0] = f, a--, a--, o = a > 0 ? r[a - 1] : -1, l = 0, u = 0, h = 0, d = 0, c = null, i = !0)), o++;
+        new n.Diff(s, l)
+      ), t[r[a - 1] + 1][0] = f, a--, a--, o = a > 0 ? r[a - 1] : -1, c = 0, u = 0, g = 0, d = 0, l = null, i = !0)), o++;
     for (i && this.diff_cleanupMerge(t), this.diff_cleanupSemanticLossless(t), o = 1; o < t.length; ) {
       if (t[o - 1][0] == s && t[o][0] == f) {
         var p = t[o - 1][1], _ = t[o][1], b = this.diff_commonOverlap_(p, _), m = this.diff_commonOverlap_(_, p);
         b >= m ? (b >= p.length / 2 || b >= _.length / 2) && (t.splice(o, 0, new n.Diff(
-          g,
+          h,
           _.substring(0, b)
         )), t[o - 1][1] = p.substring(0, p.length - b), t[o + 1][1] = _.substring(b), o++) : (m >= p.length / 2 || m >= _.length / 2) && (t.splice(o, 0, new n.Diff(
-          g,
+          h,
           p.substring(0, m)
         )), t[o - 1][0] = f, t[o - 1][1] = _.substring(0, _.length - m), t[o + 1][0] = s, t[o + 1][1] = p.substring(m), o++), o++;
       }
@@ -487,80 +487,80 @@ var Nn = { exports: {} };
     function i(m, E) {
       if (!m || !E)
         return 6;
-      var y = m.charAt(m.length - 1), T = E.charAt(0), N = y.match(n.nonAlphaNumericRegex_), S = T.match(n.nonAlphaNumericRegex_), k = N && y.match(n.whitespaceRegex_), M = S && T.match(n.whitespaceRegex_), L = k && y.match(n.linebreakRegex_), $ = M && T.match(n.linebreakRegex_), x = L && m.match(n.blanklineEndRegex_), H = $ && E.match(n.blanklineStartRegex_);
-      return x || H ? 5 : L || $ ? 4 : N && !k && M ? 3 : k || M ? 2 : N || S ? 1 : 0;
+      var y = m.charAt(m.length - 1), S = E.charAt(0), T = y.match(n.nonAlphaNumericRegex_), D = S.match(n.nonAlphaNumericRegex_), k = T && y.match(n.whitespaceRegex_), M = D && S.match(n.whitespaceRegex_), L = k && y.match(n.linebreakRegex_), $ = M && S.match(n.linebreakRegex_), x = L && m.match(n.blanklineEndRegex_), H = $ && E.match(n.blanklineStartRegex_);
+      return x || H ? 5 : L || $ ? 4 : T && !k && M ? 3 : k || M ? 2 : T || D ? 1 : 0;
     }
     for (var r = 1; r < t.length - 1; ) {
-      if (t[r - 1][0] == g && t[r + 1][0] == g) {
-        var a = t[r - 1][1], c = t[r][1], o = t[r + 1][1], l = this.diff_commonSuffix(a, c);
-        if (l) {
-          var u = c.substring(c.length - l);
-          a = a.substring(0, a.length - l), c = u + c.substring(0, c.length - l), o = u + o;
+      if (t[r - 1][0] == h && t[r + 1][0] == h) {
+        var a = t[r - 1][1], l = t[r][1], o = t[r + 1][1], c = this.diff_commonSuffix(a, l);
+        if (c) {
+          var u = l.substring(l.length - c);
+          a = a.substring(0, a.length - c), l = u + l.substring(0, l.length - c), o = u + o;
         }
-        for (var h = a, d = c, p = o, _ = i(a, c) + i(c, o); c.charAt(0) === o.charAt(0); ) {
-          a += c.charAt(0), c = c.substring(1) + o.charAt(0), o = o.substring(1);
-          var b = i(a, c) + i(c, o);
-          b >= _ && (_ = b, h = a, d = c, p = o);
+        for (var g = a, d = l, p = o, _ = i(a, l) + i(l, o); l.charAt(0) === o.charAt(0); ) {
+          a += l.charAt(0), l = l.substring(1) + o.charAt(0), o = o.substring(1);
+          var b = i(a, l) + i(l, o);
+          b >= _ && (_ = b, g = a, d = l, p = o);
         }
-        t[r - 1][1] != h && (h ? t[r - 1][1] = h : (t.splice(r - 1, 1), r--), t[r][1] = d, p ? t[r + 1][1] = p : (t.splice(r + 1, 1), r--));
+        t[r - 1][1] != g && (g ? t[r - 1][1] = g : (t.splice(r - 1, 1), r--), t[r][1] = d, p ? t[r + 1][1] = p : (t.splice(r + 1, 1), r--));
       }
       r++;
     }
   }, 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 i = !1, r = [], a = 0, c = null, o = 0, l = !1, u = !1, h = !1, d = !1; o < t.length; )
-      t[o][0] == g ? (t[o][1].length < this.Diff_EditCost && (h || d) ? (r[a++] = o, l = h, u = d, c = t[o][1]) : (a = 0, c = null), h = d = !1) : (t[o][0] == s ? d = !0 : h = !0, c && (l && u && h && d || c.length < this.Diff_EditCost / 2 && l + u + h + d == 3) && (t.splice(
+    for (var i = !1, r = [], a = 0, l = null, o = 0, c = !1, u = !1, g = !1, d = !1; o < t.length; )
+      t[o][0] == h ? (t[o][1].length < this.Diff_EditCost && (g || d) ? (r[a++] = o, c = g, u = d, l = t[o][1]) : (a = 0, l = null), g = d = !1) : (t[o][0] == s ? d = !0 : g = !0, l && (c && u && g && d || l.length < this.Diff_EditCost / 2 && c + u + g + d == 3) && (t.splice(
         r[a - 1],
         0,
-        new n.Diff(s, c)
-      ), t[r[a - 1] + 1][0] = f, a--, c = null, l && u ? (h = d = !0, a = 0) : (a--, o = a > 0 ? r[a - 1] : -1, h = d = !1), i = !0)), o++;
+        new n.Diff(s, l)
+      ), t[r[a - 1] + 1][0] = f, a--, l = null, c && u ? (g = d = !0, a = 0) : (a--, o = a > 0 ? r[a - 1] : -1, g = d = !1), i = !0)), o++;
     i && this.diff_cleanupMerge(t);
   }, n.prototype.diff_cleanupMerge = function(t) {
-    t.push(new n.Diff(g, ""));
-    for (var i = 0, r = 0, a = 0, c = "", o = "", l; i < t.length; )
+    t.push(new n.Diff(h, ""));
+    for (var i = 0, r = 0, a = 0, l = "", o = "", c; i < t.length; )
       switch (t[i][0]) {
         case f:
           a++, o += t[i][1], i++;
           break;
         case s:
-          r++, c += t[i][1], i++;
+          r++, l += t[i][1], i++;
           break;
-        case g:
-          r + a > 1 ? (r !== 0 && a !== 0 && (l = this.diff_commonPrefix(o, c), l !== 0 && (i - r - a > 0 && t[i - r - a - 1][0] == g ? t[i - r - a - 1][1] += o.substring(0, l) : (t.splice(0, 0, new n.Diff(
-            g,
-            o.substring(0, l)
-          )), i++), o = o.substring(l), c = c.substring(l)), l = this.diff_commonSuffix(o, c), l !== 0 && (t[i][1] = o.substring(o.length - l) + t[i][1], o = o.substring(0, o.length - l), c = c.substring(0, c.length - l))), i -= r + a, t.splice(i, r + a), c.length && (t.splice(
+        case h:
+          r + a > 1 ? (r !== 0 && a !== 0 && (c = this.diff_commonPrefix(o, l), c !== 0 && (i - r - a > 0 && t[i - r - a - 1][0] == h ? t[i - r - a - 1][1] += o.substring(0, c) : (t.splice(0, 0, new n.Diff(
+            h,
+            o.substring(0, c)
+          )), i++), o = o.substring(c), l = l.substring(c)), c = this.diff_commonSuffix(o, l), c !== 0 && (t[i][1] = o.substring(o.length - c) + t[i][1], o = o.substring(0, o.length - c), l = l.substring(0, l.length - c))), i -= r + a, t.splice(i, r + a), l.length && (t.splice(
             i,
             0,
-            new n.Diff(s, c)
+            new n.Diff(s, l)
           ), i++), o.length && (t.splice(
             i,
             0,
             new n.Diff(f, o)
-          ), i++), i++) : i !== 0 && t[i - 1][0] == g ? (t[i - 1][1] += t[i][1], t.splice(i, 1)) : i++, a = 0, r = 0, c = "", o = "";
+          ), i++), i++) : i !== 0 && t[i - 1][0] == h ? (t[i - 1][1] += t[i][1], t.splice(i, 1)) : i++, a = 0, r = 0, l = "", o = "";
           break;
       }
     t[t.length - 1][1] === "" && t.pop();
     var u = !1;
     for (i = 1; i < t.length - 1; )
-      t[i - 1][0] == g && t[i + 1][0] == g && (t[i][1].substring(t[i][1].length - t[i - 1][1].length) == t[i - 1][1] ? (t[i][1] = t[i - 1][1] + t[i][1].substring(0, t[i][1].length - t[i - 1][1].length), t[i + 1][1] = t[i - 1][1] + t[i + 1][1], t.splice(i - 1, 1), u = !0) : t[i][1].substring(0, t[i + 1][1].length) == t[i + 1][1] && (t[i - 1][1] += t[i + 1][1], t[i][1] = t[i][1].substring(t[i + 1][1].length) + t[i + 1][1], t.splice(i + 1, 1), u = !0)), i++;
+      t[i - 1][0] == h && t[i + 1][0] == h && (t[i][1].substring(t[i][1].length - t[i - 1][1].length) == t[i - 1][1] ? (t[i][1] = t[i - 1][1] + t[i][1].substring(0, t[i][1].length - t[i - 1][1].length), t[i + 1][1] = t[i - 1][1] + t[i + 1][1], t.splice(i - 1, 1), u = !0) : t[i][1].substring(0, t[i + 1][1].length) == t[i + 1][1] && (t[i - 1][1] += t[i + 1][1], t[i][1] = t[i][1].substring(t[i + 1][1].length) + t[i + 1][1], t.splice(i + 1, 1), u = !0)), i++;
     u && this.diff_cleanupMerge(t);
   }, n.prototype.diff_xIndex = function(t, i) {
-    var r = 0, a = 0, c = 0, o = 0, l;
-    for (l = 0; l < t.length && (t[l][0] !== f && (r += t[l][1].length), t[l][0] !== s && (a += t[l][1].length), !(r > i)); l++)
-      c = r, o = a;
-    return t.length != l && t[l][0] === s ? o : o + (i - c);
+    var r = 0, a = 0, l = 0, o = 0, c;
+    for (c = 0; c < t.length && (t[c][0] !== f && (r += t[c][1].length), t[c][0] !== s && (a += t[c][1].length), !(r > i)); c++)
+      l = r, o = a;
+    return t.length != c && t[c][0] === s ? o : o + (i - l);
   }, n.prototype.diff_prettyHtml = function(t) {
-    for (var i = [], r = /&/g, a = /</g, c = />/g, o = /\n/g, l = 0; l < t.length; l++) {
-      var u = t[l][0], h = t[l][1], d = h.replace(r, "&amp;").replace(a, "&lt;").replace(c, "&gt;").replace(o, "&para;<br>");
+    for (var i = [], r = /&/g, a = /</g, l = />/g, o = /\n/g, c = 0; c < t.length; c++) {
+      var u = t[c][0], g = t[c][1], d = g.replace(r, "&amp;").replace(a, "&lt;").replace(l, "&gt;").replace(o, "&para;<br>");
       switch (u) {
         case f:
-          i[l] = '<ins style="background:#e6ffe6;">' + d + "</ins>";
+          i[c] = '<ins style="background:#e6ffe6;">' + d + "</ins>";
           break;
         case s:
-          i[l] = '<del style="background:#ffe6e6;">' + d + "</del>";
+          i[c] = '<del style="background:#ffe6e6;">' + d + "</del>";
           break;
-        case g:
-          i[l] = "<span>" + d + "</span>";
+        case h:
+          i[c] = "<span>" + d + "</span>";
           break;
       }
     }
@@ -574,16 +574,16 @@ var Nn = { exports: {} };
       t[r][0] !== s && (i[r] = t[r][1]);
     return i.join("");
   }, n.prototype.diff_levenshtein = function(t) {
-    for (var i = 0, r = 0, a = 0, c = 0; c < t.length; c++) {
-      var o = t[c][0], l = t[c][1];
+    for (var i = 0, r = 0, a = 0, l = 0; l < t.length; l++) {
+      var o = t[l][0], c = t[l][1];
       switch (o) {
         case f:
-          r += l.length;
+          r += c.length;
           break;
         case s:
-          a += l.length;
+          a += c.length;
           break;
-        case g:
+        case h:
           i += Math.max(r, a), r = 0, a = 0;
           break;
       }
@@ -598,15 +598,15 @@ var Nn = { exports: {} };
         case s:
           i[r] = "-" + t[r][1].length;
           break;
-        case g:
+        case h:
           i[r] = "=" + t[r][1].length;
           break;
       }
     return i.join("	").replace(/%20/g, " ");
   }, n.prototype.diff_fromDelta = function(t, i) {
-    for (var r = [], a = 0, c = 0, o = i.split(/\t/g), l = 0; l < o.length; l++) {
-      var u = o[l].substring(1);
-      switch (o[l].charAt(0)) {
+    for (var r = [], a = 0, l = 0, o = i.split(/\t/g), c = 0; c < o.length; c++) {
+      var u = o[c].substring(1);
+      switch (o[c].charAt(0)) {
         case "+":
           try {
             r[a++] = new n.Diff(f, decodeURI(u));
@@ -616,19 +616,19 @@ var Nn = { exports: {} };
           break;
         case "-":
         case "=":
-          var h = parseInt(u, 10);
-          if (isNaN(h) || h < 0)
+          var g = parseInt(u, 10);
+          if (isNaN(g) || g < 0)
             throw new Error("Invalid number in diff_fromDelta: " + u);
-          var d = t.substring(c, c += h);
-          o[l].charAt(0) == "=" ? r[a++] = new n.Diff(g, d) : r[a++] = new n.Diff(s, d);
+          var d = t.substring(l, l += g);
+          o[c].charAt(0) == "=" ? r[a++] = new n.Diff(h, d) : r[a++] = new n.Diff(s, d);
           break;
         default:
-          if (o[l])
-            throw new Error("Invalid diff operation in diff_fromDelta: " + o[l]);
+          if (o[c])
+            throw new Error("Invalid diff operation in diff_fromDelta: " + o[c]);
       }
     }
-    if (c != t.length)
-      throw new Error("Delta length (" + c + ") does not equal source text length (" + t.length + ").");
+    if (l != t.length)
+      throw new Error("Delta length (" + l + ") does not equal source text length (" + t.length + ").");
     return r;
   }, n.prototype.match_main = function(t, i, r) {
     if (t == null || i == null || r == null)
@@ -637,35 +637,35 @@ var Nn = { exports: {} };
   }, n.prototype.match_bitap_ = function(t, i, r) {
     if (i.length > this.Match_MaxBits)
       throw new Error("Pattern too long for this browser.");
-    var a = this.match_alphabet_(i), c = this;
+    var a = this.match_alphabet_(i), l = this;
     function o(M, L) {
       var $ = M / i.length, x = Math.abs(r - L);
-      return c.Match_Distance ? $ + x / c.Match_Distance : x ? 1 : $;
+      return l.Match_Distance ? $ + x / l.Match_Distance : x ? 1 : $;
     }
-    var l = this.Match_Threshold, u = t.indexOf(i, r);
-    u != -1 && (l = Math.min(o(0, u), l), u = t.lastIndexOf(i, r + i.length), u != -1 && (l = Math.min(o(0, u), l)));
-    var h = 1 << i.length - 1;
+    var c = this.Match_Threshold, u = t.indexOf(i, r);
+    u != -1 && (c = Math.min(o(0, u), c), u = t.lastIndexOf(i, r + i.length), u != -1 && (c = Math.min(o(0, u), c)));
+    var g = 1 << i.length - 1;
     u = -1;
     for (var d, p, _ = i.length + t.length, b, m = 0; m < i.length; m++) {
       for (d = 0, p = _; d < p; )
-        o(m, r + p) <= l ? d = p : _ = p, p = Math.floor((_ - d) / 2 + d);
+        o(m, r + p) <= c ? d = p : _ = p, p = Math.floor((_ - d) / 2 + d);
       _ = p;
-      var E = Math.max(1, r - p + 1), y = Math.min(r + p, t.length) + i.length, T = Array(y + 2);
-      T[y + 1] = (1 << m) - 1;
-      for (var N = y; N >= E; N--) {
-        var S = a[t.charAt(N - 1)];
-        if (m === 0 ? T[N] = (T[N + 1] << 1 | 1) & S : T[N] = (T[N + 1] << 1 | 1) & S | ((b[N + 1] | b[N]) << 1 | 1) | b[N + 1], T[N] & h) {
-          var k = o(m, N - 1);
-          if (k <= l)
-            if (l = k, u = N - 1, u > r)
+      var E = Math.max(1, r - p + 1), y = Math.min(r + p, t.length) + i.length, S = Array(y + 2);
+      S[y + 1] = (1 << m) - 1;
+      for (var T = y; T >= E; T--) {
+        var D = a[t.charAt(T - 1)];
+        if (m === 0 ? S[T] = (S[T + 1] << 1 | 1) & D : S[T] = (S[T + 1] << 1 | 1) & D | ((b[T + 1] | b[T]) << 1 | 1) | b[T + 1], S[T] & g) {
+          var k = o(m, T - 1);
+          if (k <= c)
+            if (c = k, u = T - 1, u > r)
               E = Math.max(1, 2 * r - u);
             else
               break;
         }
       }
-      if (o(m + 1, r) > l)
+      if (o(m + 1, r) > c)
         break;
-      b = T;
+      b = S;
     }
     return u;
   }, n.prototype.match_alphabet_ = function(t) {
@@ -684,62 +684,62 @@ var Nn = { exports: {} };
           t.start2 + t.length1 + a
         );
       a += this.Patch_Margin;
-      var c = i.substring(t.start2 - a, t.start2);
-      c && t.diffs.unshift(new n.Diff(g, c));
+      var l = i.substring(t.start2 - a, t.start2);
+      l && t.diffs.unshift(new n.Diff(h, l));
       var o = i.substring(
         t.start2 + t.length1,
         t.start2 + t.length1 + a
       );
-      o && t.diffs.push(new n.Diff(g, o)), t.start1 -= c.length, t.start2 -= c.length, t.length1 += c.length + o.length, t.length2 += c.length + o.length;
+      o && t.diffs.push(new n.Diff(h, o)), t.start1 -= l.length, t.start2 -= l.length, t.length1 += l.length + o.length, t.length2 += l.length + o.length;
     }
   }, n.prototype.patch_make = function(t, i, r) {
-    var a, c;
+    var a, l;
     if (typeof t == "string" && typeof i == "string" && typeof r == "undefined")
       a = /** @type {string} */
-      t, c = this.diff_main(
+      t, l = this.diff_main(
         a,
         /** @type {string} */
         i,
         !0
-      ), c.length > 2 && (this.diff_cleanupSemantic(c), this.diff_cleanupEfficiency(c));
+      ), l.length > 2 && (this.diff_cleanupSemantic(l), this.diff_cleanupEfficiency(l));
     else if (t && typeof t == "object" && typeof i == "undefined" && typeof r == "undefined")
-      c = /** @type {!Array.<!diff_match_patch.Diff>} */
-      t, a = this.diff_text1(c);
+      l = /** @type {!Array.<!diff_match_patch.Diff>} */
+      t, a = this.diff_text1(l);
     else if (typeof t == "string" && i && typeof i == "object" && typeof r == "undefined")
       a = /** @type {string} */
-      t, c = /** @type {!Array.<!diff_match_patch.Diff>} */
+      t, l = /** @type {!Array.<!diff_match_patch.Diff>} */
       i;
     else if (typeof t == "string" && typeof i == "string" && r && typeof r == "object")
       a = /** @type {string} */
-      t, c = /** @type {!Array.<!diff_match_patch.Diff>} */
+      t, l = /** @type {!Array.<!diff_match_patch.Diff>} */
       r;
     else
       throw new Error("Unknown call format to patch_make.");
-    if (c.length === 0)
+    if (l.length === 0)
       return [];
-    for (var o = [], l = new n.patch_obj(), u = 0, h = 0, d = 0, p = a, _ = a, b = 0; b < c.length; b++) {
-      var m = c[b][0], E = c[b][1];
-      switch (!u && m !== g && (l.start1 = h, l.start2 = d), m) {
+    for (var o = [], c = new n.patch_obj(), u = 0, g = 0, d = 0, p = a, _ = a, b = 0; b < l.length; b++) {
+      var m = l[b][0], E = l[b][1];
+      switch (!u && m !== h && (c.start1 = g, c.start2 = d), m) {
         case f:
-          l.diffs[u++] = c[b], l.length2 += E.length, _ = _.substring(0, d) + E + _.substring(d);
+          c.diffs[u++] = l[b], c.length2 += E.length, _ = _.substring(0, d) + E + _.substring(d);
           break;
         case s:
-          l.length1 += E.length, l.diffs[u++] = c[b], _ = _.substring(0, d) + _.substring(d + E.length);
+          c.length1 += E.length, c.diffs[u++] = l[b], _ = _.substring(0, d) + _.substring(d + E.length);
           break;
-        case g:
-          E.length <= 2 * this.Patch_Margin && u && c.length != b + 1 ? (l.diffs[u++] = c[b], l.length1 += E.length, l.length2 += E.length) : E.length >= 2 * this.Patch_Margin && u && (this.patch_addContext_(l, p), o.push(l), l = new n.patch_obj(), u = 0, p = _, h = d);
+        case h:
+          E.length <= 2 * this.Patch_Margin && u && l.length != b + 1 ? (c.diffs[u++] = l[b], c.length1 += E.length, c.length2 += E.length) : E.length >= 2 * this.Patch_Margin && u && (this.patch_addContext_(c, p), o.push(c), c = new n.patch_obj(), u = 0, p = _, g = d);
           break;
       }
-      m !== f && (h += E.length), m !== s && (d += E.length);
+      m !== f && (g += E.length), m !== s && (d += E.length);
     }
-    return u && (this.patch_addContext_(l, p), o.push(l)), o;
+    return u && (this.patch_addContext_(c, p), o.push(c)), o;
   }, n.prototype.patch_deepCopy = function(t) {
     for (var i = [], r = 0; r < t.length; r++) {
-      var a = t[r], c = new n.patch_obj();
-      c.diffs = [];
+      var a = t[r], l = new n.patch_obj();
+      l.diffs = [];
       for (var o = 0; o < a.diffs.length; o++)
-        c.diffs[o] = new n.Diff(a.diffs[o][0], a.diffs[o][1]);
-      c.start1 = a.start1, c.start2 = a.start2, c.length1 = a.length1, c.length2 = a.length2, i[r] = c;
+        l.diffs[o] = new n.Diff(a.diffs[o][0], a.diffs[o][1]);
+      l.start1 = a.start1, l.start2 = a.start2, l.length1 = a.length1, l.length2 = a.length2, i[r] = l;
     }
     return i;
   }, n.prototype.patch_apply = function(t, i) {
@@ -748,32 +748,32 @@ var Nn = { exports: {} };
     t = this.patch_deepCopy(t);
     var r = this.patch_addPadding(t);
     i = r + i + r, this.patch_splitMax(t);
-    for (var a = 0, c = [], o = 0; o < t.length; o++) {
-      var l = t[o].start2 + a, u = this.diff_text1(t[o].diffs), h, d = -1;
-      if (u.length > this.Match_MaxBits ? (h = this.match_main(
+    for (var a = 0, l = [], o = 0; o < t.length; o++) {
+      var c = t[o].start2 + a, u = this.diff_text1(t[o].diffs), g, d = -1;
+      if (u.length > this.Match_MaxBits ? (g = this.match_main(
         i,
         u.substring(0, this.Match_MaxBits),
-        l
-      ), h != -1 && (d = this.match_main(
+        c
+      ), g != -1 && (d = this.match_main(
         i,
         u.substring(u.length - this.Match_MaxBits),
-        l + u.length - this.Match_MaxBits
-      ), (d == -1 || h >= d) && (h = -1))) : h = this.match_main(i, u, l), h == -1)
-        c[o] = !1, a -= t[o].length2 - t[o].length1;
+        c + u.length - this.Match_MaxBits
+      ), (d == -1 || g >= d) && (g = -1))) : g = this.match_main(i, u, c), g == -1)
+        l[o] = !1, a -= t[o].length2 - t[o].length1;
       else {
-        c[o] = !0, a = h - l;
+        l[o] = !0, a = g - c;
         var p;
-        if (d == -1 ? p = i.substring(h, h + u.length) : p = i.substring(h, d + this.Match_MaxBits), u == p)
-          i = i.substring(0, h) + this.diff_text2(t[o].diffs) + i.substring(h + u.length);
+        if (d == -1 ? p = i.substring(g, g + u.length) : p = i.substring(g, d + this.Match_MaxBits), u == p)
+          i = i.substring(0, g) + this.diff_text2(t[o].diffs) + i.substring(g + u.length);
         else {
           var _ = this.diff_main(u, p, !1);
           if (u.length > this.Match_MaxBits && this.diff_levenshtein(_) / u.length > this.Patch_DeleteThreshold)
-            c[o] = !1;
+            l[o] = !1;
           else {
             this.diff_cleanupSemanticLossless(_);
             for (var b = 0, m, E = 0; E < t[o].diffs.length; E++) {
               var y = t[o].diffs[E];
-              y[0] !== g && (m = this.diff_xIndex(_, b)), y[0] === f ? i = i.substring(0, h + m) + y[1] + i.substring(h + m) : y[0] === s && (i = i.substring(0, h + m) + i.substring(h + this.diff_xIndex(
+              y[0] !== h && (m = this.diff_xIndex(_, b)), y[0] === f ? i = i.substring(0, g + m) + y[1] + i.substring(g + m) : y[0] === s && (i = i.substring(0, g + m) + i.substring(g + this.diff_xIndex(
                 _,
                 b + y[1].length
               ))), y[0] !== s && (b += y[1].length);
@@ -782,24 +782,24 @@ var Nn = { exports: {} };
         }
       }
     }
-    return i = i.substring(r.length, i.length - r.length), [i, c];
+    return i = i.substring(r.length, i.length - r.length), [i, l];
   }, n.prototype.patch_addPadding = function(t) {
     for (var i = this.Patch_Margin, r = "", a = 1; a <= i; a++)
       r += String.fromCharCode(a);
     for (var a = 0; a < t.length; a++)
       t[a].start1 += i, t[a].start2 += i;
-    var c = t[0], o = c.diffs;
-    if (o.length == 0 || o[0][0] != g)
-      o.unshift(new n.Diff(g, r)), c.start1 -= i, c.start2 -= i, c.length1 += i, c.length2 += i;
+    var l = t[0], o = l.diffs;
+    if (o.length == 0 || o[0][0] != h)
+      o.unshift(new n.Diff(h, r)), l.start1 -= i, l.start2 -= i, l.length1 += i, l.length2 += i;
     else if (i > o[0][1].length) {
-      var l = i - o[0][1].length;
-      o[0][1] = r.substring(o[0][1].length) + o[0][1], c.start1 -= l, c.start2 -= l, c.length1 += l, c.length2 += l;
+      var c = i - o[0][1].length;
+      o[0][1] = r.substring(o[0][1].length) + o[0][1], l.start1 -= c, l.start2 -= c, l.length1 += c, l.length2 += c;
     }
-    if (c = t[t.length - 1], o = c.diffs, o.length == 0 || o[o.length - 1][0] != g)
-      o.push(new n.Diff(g, r)), c.length1 += i, c.length2 += i;
+    if (l = t[t.length - 1], o = l.diffs, o.length == 0 || o[o.length - 1][0] != h)
+      o.push(new n.Diff(h, r)), l.length1 += i, l.length2 += i;
     else if (i > o[o.length - 1][1].length) {
-      var l = i - o[o.length - 1][1].length;
-      o[o.length - 1][1] += r.substring(0, l), c.length1 += l, c.length2 += l;
+      var c = i - o[o.length - 1][1].length;
+      o[o.length - 1][1] += r.substring(0, c), l.length1 += c, l.length2 += c;
     }
     return r;
   }, n.prototype.patch_splitMax = function(t) {
@@ -807,18 +807,18 @@ var Nn = { exports: {} };
       if (!(t[r].length1 <= i)) {
         var a = t[r];
         t.splice(r--, 1);
-        for (var c = a.start1, o = a.start2, l = ""; a.diffs.length !== 0; ) {
-          var u = new n.patch_obj(), h = !0;
-          for (u.start1 = c - l.length, u.start2 = o - l.length, l !== "" && (u.length1 = u.length2 = l.length, u.diffs.push(new n.Diff(g, l))); a.diffs.length !== 0 && u.length1 < i - this.Patch_Margin; ) {
+        for (var l = a.start1, o = a.start2, c = ""; a.diffs.length !== 0; ) {
+          var u = new n.patch_obj(), g = !0;
+          for (u.start1 = l - c.length, u.start2 = o - c.length, c !== "" && (u.length1 = u.length2 = c.length, u.diffs.push(new n.Diff(h, c))); a.diffs.length !== 0 && u.length1 < i - this.Patch_Margin; ) {
             var d = a.diffs[0][0], p = a.diffs[0][1];
-            d === f ? (u.length2 += p.length, o += p.length, u.diffs.push(a.diffs.shift()), h = !1) : d === s && u.diffs.length == 1 && u.diffs[0][0] == g && p.length > 2 * i ? (u.length1 += p.length, c += p.length, h = !1, u.diffs.push(new n.Diff(d, p)), a.diffs.shift()) : (p = p.substring(
+            d === f ? (u.length2 += p.length, o += p.length, u.diffs.push(a.diffs.shift()), g = !1) : d === s && u.diffs.length == 1 && u.diffs[0][0] == h && p.length > 2 * i ? (u.length1 += p.length, l += p.length, g = !1, u.diffs.push(new n.Diff(d, p)), a.diffs.shift()) : (p = p.substring(
               0,
               i - u.length1 - this.Patch_Margin
-            ), u.length1 += p.length, c += p.length, d === g ? (u.length2 += p.length, o += p.length) : h = !1, u.diffs.push(new n.Diff(d, p)), p == a.diffs[0][1] ? a.diffs.shift() : a.diffs[0][1] = a.diffs[0][1].substring(p.length));
+            ), u.length1 += p.length, l += p.length, d === h ? (u.length2 += p.length, o += p.length) : g = !1, u.diffs.push(new n.Diff(d, p)), p == a.diffs[0][1] ? a.diffs.shift() : a.diffs[0][1] = a.diffs[0][1].substring(p.length));
           }
-          l = this.diff_text2(u.diffs), l = l.substring(l.length - this.Patch_Margin);
+          c = this.diff_text2(u.diffs), c = c.substring(c.length - this.Patch_Margin);
           var _ = this.diff_text1(a.diffs).substring(0, this.Patch_Margin);
-          _ !== "" && (u.length1 += _.length, u.length2 += _.length, u.diffs.length !== 0 && u.diffs[u.diffs.length - 1][0] === g ? u.diffs[u.diffs.length - 1][1] += _ : u.diffs.push(new n.Diff(g, _))), h || t.splice(++r, 0, u);
+          _ !== "" && (u.length1 += _.length, u.length2 += _.length, u.diffs.length !== 0 && u.diffs[u.diffs.length - 1][0] === h ? u.diffs[u.diffs.length - 1][1] += _ : u.diffs.push(new n.Diff(h, _))), g || t.splice(++r, 0, u);
         }
       }
   }, n.prototype.patch_toText = function(t) {
@@ -830,28 +830,28 @@ var Nn = { exports: {} };
     if (!t)
       return i;
     for (var r = t.split(`
-`), a = 0, c = /^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$/; a < r.length; ) {
-      var o = r[a].match(c);
+`), a = 0, l = /^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$/; a < r.length; ) {
+      var o = r[a].match(l);
       if (!o)
         throw new Error("Invalid patch string: " + r[a]);
-      var l = new n.patch_obj();
-      for (i.push(l), l.start1 = parseInt(o[1], 10), o[2] === "" ? (l.start1--, l.length1 = 1) : o[2] == "0" ? l.length1 = 0 : (l.start1--, l.length1 = parseInt(o[2], 10)), l.start2 = parseInt(o[3], 10), o[4] === "" ? (l.start2--, l.length2 = 1) : o[4] == "0" ? l.length2 = 0 : (l.start2--, l.length2 = parseInt(o[4], 10)), a++; a < r.length; ) {
+      var c = new n.patch_obj();
+      for (i.push(c), c.start1 = parseInt(o[1], 10), o[2] === "" ? (c.start1--, c.length1 = 1) : o[2] == "0" ? c.length1 = 0 : (c.start1--, c.length1 = parseInt(o[2], 10)), c.start2 = parseInt(o[3], 10), o[4] === "" ? (c.start2--, c.length2 = 1) : o[4] == "0" ? c.length2 = 0 : (c.start2--, c.length2 = parseInt(o[4], 10)), a++; a < r.length; ) {
         var u = r[a].charAt(0);
         try {
-          var h = decodeURI(r[a].substring(1));
+          var g = decodeURI(r[a].substring(1));
         } catch (d) {
-          throw new Error("Illegal escape in patch_fromText: " + h);
+          throw new Error("Illegal escape in patch_fromText: " + g);
         }
         if (u == "-")
-          l.diffs.push(new n.Diff(s, h));
+          c.diffs.push(new n.Diff(s, g));
         else if (u == "+")
-          l.diffs.push(new n.Diff(f, h));
+          c.diffs.push(new n.Diff(f, g));
         else if (u == " ")
-          l.diffs.push(new n.Diff(g, h));
+          c.diffs.push(new n.Diff(h, g));
         else {
           if (u == "@")
             break;
-          if (u !== "") throw new Error('Invalid patch mode "' + u + '" in: ' + h);
+          if (u !== "") throw new Error('Invalid patch mode "' + u + '" in: ' + g);
         }
         a++;
       }
@@ -863,25 +863,25 @@ var Nn = { exports: {} };
     var t, i;
     this.length1 === 0 ? t = this.start1 + ",0" : this.length1 == 1 ? t = this.start1 + 1 : t = this.start1 + 1 + "," + this.length1, this.length2 === 0 ? i = this.start2 + ",0" : this.length2 == 1 ? i = this.start2 + 1 : i = this.start2 + 1 + "," + this.length2;
     for (var r = ["@@ -" + t + " +" + i + ` @@
-`], a, c = 0; c < this.diffs.length; c++) {
-      switch (this.diffs[c][0]) {
+`], a, l = 0; l < this.diffs.length; l++) {
+      switch (this.diffs[l][0]) {
         case f:
           a = "+";
           break;
         case s:
           a = "-";
           break;
-        case g:
+        case h:
           a = " ";
           break;
       }
-      r[c + 1] = a + encodeURI(this.diffs[c][1]) + `
+      r[l + 1] = a + encodeURI(this.diffs[l][1]) + `
 `;
     }
     return r.join("").replace(/%20/g, " ");
-  }, e.exports = n, e.exports.diff_match_patch = n, e.exports.DIFF_DELETE = s, e.exports.DIFF_INSERT = f, e.exports.DIFF_EQUAL = g;
-})(Nn);
-var ke = Nn.exports;
+  }, e.exports = n, e.exports.diff_match_patch = n, e.exports.DIFF_DELETE = s, e.exports.DIFF_INSERT = f, e.exports.DIFF_EQUAL = h;
+})(Mn);
+var ke = Mn.exports;
 function Tn(e) {
   return e instanceof Map ? e.clear = e.delete = e.set = function() {
     throw new Error("map is read-only");
@@ -911,8 +911,8 @@ function re(e, ...n) {
   for (const f in e)
     s[f] = e[f];
   return n.forEach(function(f) {
-    for (const g in f)
-      s[g] = f[g];
+    for (const h in f)
+      s[h] = f[h];
   }), /** @type {T} */
   s;
 }
@@ -923,7 +923,7 @@ const ft = "</span>", on = (e) => !!e.scope, gt = (e, { prefix: n }) => {
     const s = e.split(".");
     return [
       `${n}${s.shift()}`,
-      ...s.map((f, g) => `${f}${"_".repeat(g + 1)}`)
+      ...s.map((f, h) => `${f}${"_".repeat(h + 1)}`)
     ].join(" ");
   }
   return `${n}${e}`;
@@ -1104,7 +1104,7 @@ function je(e, { joinWith: n }) {
   let s = 0;
   return e.map((f) => {
     s += 1;
-    const g = s;
+    const h = s;
     let t = pe(f), i = "";
     for (; t.length > 0; ) {
       const r = mt.exec(t);
@@ -1112,7 +1112,7 @@ function je(e, { joinWith: n }) {
         i += t;
         break;
       }
-      i += t.substring(0, r.index), t = t.substring(r.index + r[0].length), r[0][0] === "\\" && r[1] ? i += "\\" + String(Number(r[1]) + g) : (i += r[0], r[0] === "(" && s++);
+      i += t.substring(0, r.index), t = t.substring(r.index + r[0].length), r[0][0] === "\\" && r[1] ? i += "\\" + String(Number(r[1]) + h) : (i += r[0], r[0] === "(" && s++);
     }
     return i;
   }).map((f) => `(${f})`).join(n);
@@ -1137,19 +1137,19 @@ const Et = /\b\B/, Ln = "[a-zA-Z]\\w*", Ze = "[a-zA-Z_]\\w*", Rn = "\\b\\d+(\\.\
 }, _e = {
   begin: "\\\\[\\s\\S]",
   relevance: 0
-}, At = {
+}, Nt = {
   scope: "string",
   begin: "'",
   end: "'",
   illegal: "\\n",
   contains: [_e]
-}, Mt = {
+}, At = {
   scope: "string",
   begin: '"',
   end: '"',
   illegal: "\\n",
   contains: [_e]
-}, Nt = {
+}, Mt = {
   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/
 }, Le = function(e, n, s = {}) {
   const f = re(
@@ -1170,7 +1170,7 @@ const Et = /\b\B/, Ln = "[a-zA-Z]\\w*", Ze = "[a-zA-Z_]\\w*", Rn = "\\b\\d+(\\.\
     excludeBegin: !0,
     relevance: 0
   });
-  const g = Qe(
+  const h = Qe(
     // list of common 1 and 2 letter words in English
     "I",
     "a",
@@ -1210,7 +1210,7 @@ const Et = /\b\B/, Ln = "[a-zA-Z]\\w*", Ze = "[a-zA-Z_]\\w*", Rn = "\\b\\d+(\\.\
         /[ ]+/,
         // necessary to prevent us gobbling up doctags like /* @author Bob Mcgill */
         "(",
-        g,
+        h,
         /[.]?[:]?([.][ ]|[ ])/,
         "){3}"
       )
@@ -1269,9 +1269,9 @@ const Et = /\b\B/, Ln = "[a-zA-Z]\\w*", Ze = "[a-zA-Z_]\\w*", Rn = "\\b\\d+(\\.\
     }
   );
 };
-var Me = /* @__PURE__ */ Object.freeze({
+var Ae = /* @__PURE__ */ Object.freeze({
   __proto__: null,
-  APOS_STRING_MODE: At,
+  APOS_STRING_MODE: Nt,
   BACKSLASH_ESCAPE: _e,
   BINARY_NUMBER_MODE: Rt,
   BINARY_NUMBER_RE: In,
@@ -1287,8 +1287,8 @@ var Me = /* @__PURE__ */ Object.freeze({
   METHOD_GUARD: $t,
   NUMBER_MODE: Ct,
   NUMBER_RE: Rn,
-  PHRASAL_WORDS_MODE: Nt,
-  QUOTE_STRING_MODE: Mt,
+  PHRASAL_WORDS_MODE: Mt,
+  QUOTE_STRING_MODE: At,
   REGEXP_MODE: Ot,
   RE_STARTERS_RE: yt,
   SHEBANG: wt,
@@ -1347,13 +1347,13 @@ const Gt = (e, n) => {
 ], Wt = "keyword";
 function kn(e, n, s = Wt) {
   const f = /* @__PURE__ */ Object.create(null);
-  return typeof e == "string" ? g(s, e.split(" ")) : Array.isArray(e) ? g(s, e) : Object.keys(e).forEach(function(t) {
+  return typeof e == "string" ? h(s, e.split(" ")) : Array.isArray(e) ? h(s, e) : Object.keys(e).forEach(function(t) {
     Object.assign(
       f,
       kn(e[t], n, t)
     );
   }), f;
-  function g(t, i) {
+  function h(t, i) {
     n && (i = i.map((r) => r.toLowerCase())), i.forEach(function(r) {
       const a = r.split("|");
       f[a[0]] = [t, qt(a[0], a[1])];
@@ -1375,9 +1375,9 @@ const cn = {}, le = (e) => {
 }, Ce = new Error();
 function $n(e, n, { key: s }) {
   let f = 0;
-  const g = e[s], t = {}, i = {};
+  const h = e[s], t = {}, i = {};
   for (let r = 1; r <= n.length; r++)
-    i[r + f] = g[r], t[r + f] = !0, f += Cn(n[r - 1]);
+    i[r + f] = h[r], t[r + f] = !0, f += Cn(n[r - 1]);
   e[s] = i, e[s]._emit = t, e[s]._multi = !0;
 }
 function jt(e) {
@@ -1430,8 +1430,8 @@ function Xt(e) {
       const a = this.matcherRe.exec(r);
       if (!a)
         return null;
-      const c = a.findIndex((l, u) => u > 0 && l !== void 0), o = this.matchIndexes[c];
-      return a.splice(0, c), Object.assign(a, o);
+      const l = a.findIndex((c, u) => u > 0 && c !== void 0), o = this.matchIndexes[l];
+      return a.splice(0, l), Object.assign(a, o);
     }
   }
   class f {
@@ -1442,7 +1442,7 @@ function Xt(e) {
     getMatcher(r) {
       if (this.multiRegexes[r]) return this.multiRegexes[r];
       const a = new s();
-      return this.rules.slice(r).forEach(([c, o]) => a.addRule(c, o)), a.compile(), this.multiRegexes[r] = a, a;
+      return this.rules.slice(r).forEach(([l, o]) => a.addRule(l, o)), a.compile(), this.multiRegexes[r] = a, a;
     }
     resumingScanAtSamePosition() {
       return this.regexIndex !== 0;
@@ -1458,15 +1458,15 @@ function Xt(e) {
     exec(r) {
       const a = this.getMatcher(this.regexIndex);
       a.lastIndex = this.lastIndex;
-      let c = a.exec(r);
-      if (this.resumingScanAtSamePosition() && !(c && c.index === this.lastIndex)) {
+      let l = a.exec(r);
+      if (this.resumingScanAtSamePosition() && !(l && l.index === this.lastIndex)) {
         const o = this.getMatcher(0);
-        o.lastIndex = this.lastIndex + 1, c = o.exec(r);
+        o.lastIndex = this.lastIndex + 1, l = o.exec(r);
       }
-      return c && (this.regexIndex += c.position + 1, this.regexIndex === this.count && this.considerAll()), c;
+      return l && (this.regexIndex += l.position + 1, this.regexIndex === this.count && this.considerAll()), l;
     }
   }
-  function g(i) {
+  function h(i) {
     const r = new f();
     return i.contains.forEach((a) => r.addRule(a.begin, { rule: a, type: "begin" })), i.terminatorEnd && r.addRule(i.terminatorEnd, { type: "end" }), i.illegal && r.addRule(i.illegal, { type: "illegal" }), r;
   }
@@ -1491,8 +1491,8 @@ function Xt(e) {
       // default to 1 relevance if not specified
       zt
     ].forEach((o) => o(i, r)), i.isCompiled = !0;
-    let c = null;
-    return typeof i.keywords == "object" && i.keywords.$pattern && (i.keywords = Object.assign({}, i.keywords), c = i.keywords.$pattern, delete i.keywords.$pattern), c = c || /\w+/, i.keywords && (i.keywords = kn(i.keywords, e.case_insensitive)), a.keywordPatternRe = n(c, !0), r && (i.begin || (i.begin = /\B|\b/), a.beginRe = n(a.begin), !i.end && !i.endsWithParent && (i.end = /\B|\b/), i.end && (a.endRe = n(a.end)), a.terminatorEnd = pe(a.end) || "", i.endsWithParent && r.terminatorEnd && (a.terminatorEnd += (i.end ? "|" : "") + r.terminatorEnd)), i.illegal && (a.illegalRe = n(
+    let l = null;
+    return typeof i.keywords == "object" && i.keywords.$pattern && (i.keywords = Object.assign({}, i.keywords), l = i.keywords.$pattern, delete i.keywords.$pattern), l = l || /\w+/, i.keywords && (i.keywords = kn(i.keywords, e.case_insensitive)), a.keywordPatternRe = n(l, !0), r && (i.begin || (i.begin = /\B|\b/), a.beginRe = n(a.begin), !i.end && !i.endsWithParent && (i.end = /\B|\b/), i.end && (a.endRe = n(a.end)), a.terminatorEnd = pe(a.end) || "", i.endsWithParent && r.terminatorEnd && (a.terminatorEnd += (i.end ? "|" : "") + r.terminatorEnd)), i.illegal && (a.illegalRe = n(
       /** @type {RegExp | string} */
       i.illegal
     )), i.contains || (i.contains = []), i.contains = [].concat(...i.contains.map(function(o) {
@@ -1503,7 +1503,7 @@ function Xt(e) {
         o,
         a
       );
-    }), i.starts && t(i.starts, r), a.matcher = g(a), a;
+    }), i.starts && t(i.starts, r), a.matcher = h(a), a;
   }
   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.");
@@ -1528,7 +1528,7 @@ class ni extends Error {
 }
 const $e = Sn, fn = re, gn = Symbol("nomatch"), ti = 7, xn = function(e) {
   const n = /* @__PURE__ */ Object.create(null), s = /* @__PURE__ */ Object.create(null), f = [];
-  let g = !0;
+  let h = !0;
   const t = "Could not find the language '{}', did you forget to load/include a language module?", i = { disableAutodetect: !0, name: "Plain text", contains: [] };
   let r = {
     ignoreUnescapedHTML: !1,
@@ -1545,29 +1545,29 @@ const $e = Sn, fn = re, gn = Symbol("nomatch"), ti = 7, xn = function(e) {
   function a(v) {
     return r.noHighlightRe.test(v);
   }
-  function c(v) {
-    let A = v.className + " ";
-    A += v.parentNode ? v.parentNode.className : "";
-    const R = r.languageDetectRe.exec(A);
+  function l(v) {
+    let N = v.className + " ";
+    N += v.parentNode ? v.parentNode.className : "";
+    const R = r.languageDetectRe.exec(N);
     if (R) {
       const B = M(R[1]);
       return B || (un(t.replace("{}", R[1])), un("Falling back to no-highlight mode for this block.", v)), B ? R[1] : "no-highlight";
     }
-    return A.split(/\s+/).find((B) => a(B) || M(B));
+    return N.split(/\s+/).find((B) => a(B) || M(B));
   }
-  function o(v, A, R) {
+  function o(v, N, R) {
     let B = "", F = "";
-    typeof A == "object" ? (B = v, R = A.ignoreIllegals, F = A.language) : (fe("10.7.0", "highlight(lang, code, ...args) has been deprecated."), fe("10.7.0", `Please use highlight(code, options) instead.
-https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R === void 0 && (R = !0);
+    typeof N == "object" ? (B = v, R = N.ignoreIllegals, F = N.language) : (fe("10.7.0", "highlight(lang, code, ...args) has been deprecated."), fe("10.7.0", `Please use highlight(code, options) instead.
+https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = N), R === void 0 && (R = !0);
     const W = {
       code: B,
       language: F
     };
     ie("before:highlight", W);
-    const Z = W.result ? W.result : l(W.language, W.code, R);
+    const Z = W.result ? W.result : c(W.language, W.code, R);
     return Z.code = W.code, ie("after:highlight", Z), Z;
   }
-  function l(v, A, R, B) {
+  function c(v, N, R, B) {
     const F = /* @__PURE__ */ Object.create(null);
     function W(w, C) {
       return w.keywords[C];
@@ -1585,7 +1585,7 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
         const U = X.case_insensitive ? C[0].toLowerCase() : C[0], G = W(O, U);
         if (G) {
           const [ne, Vn] = G;
-          if (z.addText(I), I = "", F[U] = (F[U] || 0) + 1, F[U] <= ti && (Ae += Vn), ne.startsWith("_"))
+          if (z.addText(I), I = "", F[U] = (F[U] || 0) + 1, F[U] <= ti && (Ne += Vn), ne.startsWith("_"))
             I += C[0];
           else {
             const Xn = X.classNameAliases[ne] || ne;
@@ -1605,11 +1605,11 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
           z.addText(P);
           return;
         }
-        w = l(O.subLanguage, P, !0, tn[O.subLanguage]), tn[O.subLanguage] = /** @type {CompiledMode} */
+        w = c(O.subLanguage, P, !0, tn[O.subLanguage]), tn[O.subLanguage] = /** @type {CompiledMode} */
         w._top;
       } else
-        w = h(P, O.subLanguage.length ? O.subLanguage : null);
-      O.relevance > 0 && (Ae += w.relevance), z.__addSublanguage(w._emitter, w.language);
+        w = g(P, O.subLanguage.length ? O.subLanguage : null);
+      O.relevance > 0 && (Ne += w.relevance), z.__addSublanguage(w._emitter, w.language);
     }
     function q() {
       O.subLanguage != null ? ye() : Z(), P = "";
@@ -1659,13 +1659,13 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
       return I.skip ? P += C : (I.excludeBegin && (P += C), q(), !I.returnBegin && !I.excludeBegin && (P = C)), Je(I, w), I.returnBegin ? 0 : C.length;
     }
     function jn(w) {
-      const C = w[0], I = A.substring(w.index), U = en(O, w, I);
+      const C = w[0], I = N.substring(w.index), U = en(O, w, I);
       if (!U)
         return gn;
       const G = O;
       O.endScope && O.endScope._wrap ? (q(), V(C, O.endScope._wrap)) : O.endScope && O.endScope._multi ? (q(), Xe(O.endScope, w)) : G.skip ? P += C : (G.returnEnd || G.excludeEnd || (P += C), q(), G.excludeEnd && (P = C));
       do
-        O.scope && z.closeNode(), !O.skip && !O.subLanguage && (Ae += O.relevance), O = O.parent;
+        O.scope && z.closeNode(), !O.skip && !O.subLanguage && (Ne += O.relevance), O = O.parent;
       while (O !== U.parent);
       return U.starts && Je(U.starts, w), G.returnEnd ? 0 : C.length;
     }
@@ -1681,7 +1681,7 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
       if (P += w, I == null)
         return q(), 0;
       if (we.type === "begin" && C.type === "end" && we.index === C.index && I === "") {
-        if (P += A.slice(C.index, C.index + 1), !g) {
+        if (P += N.slice(C.index, C.index + 1), !h) {
           const U = new Error(`0 width match regex (${v})`);
           throw U.languageName = v, U.badRule = we.rule, U;
         }
@@ -1710,24 +1710,24 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     let Re = "", O = B || Yn;
     const tn = {}, z = new r.__emitter(r);
     Zn();
-    let P = "", Ae = 0, oe = 0, Oe = 0, Ie = !1;
+    let P = "", Ne = 0, oe = 0, Oe = 0, Ie = !1;
     try {
       if (X.__emitTokens)
-        X.__emitTokens(A, z);
+        X.__emitTokens(N, z);
       else {
         for (O.matcher.considerAll(); ; ) {
           Oe++, Ie ? Ie = !1 : O.matcher.considerAll(), O.matcher.lastIndex = oe;
-          const w = O.matcher.exec(A);
+          const w = O.matcher.exec(N);
           if (!w) break;
-          const C = A.substring(oe, w.index), I = nn(C, w);
+          const C = N.substring(oe, w.index), I = nn(C, w);
           oe = w.index + I;
         }
-        nn(A.substring(oe));
+        nn(N.substring(oe));
       }
       return z.finalize(), Re = z.toHTML(), {
         language: v,
         value: Re,
-        relevance: Ae,
+        relevance: Ne,
         illegal: !1,
         _emitter: z,
         _top: O
@@ -1736,22 +1736,22 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
       if (w.message && w.message.includes("Illegal"))
         return {
           language: v,
-          value: $e(A),
+          value: $e(N),
           illegal: !0,
           relevance: 0,
           _illegalBy: {
             message: w.message,
             index: oe,
-            context: A.slice(oe - 100, oe + 100),
+            context: N.slice(oe - 100, oe + 100),
             mode: w.mode,
             resultSoFar: Re
           },
           _emitter: z
         };
-      if (g)
+      if (h)
         return {
           language: v,
-          value: $e(A),
+          value: $e(N),
           illegal: !1,
           relevance: 0,
           errorRaised: w,
@@ -1762,19 +1762,19 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     }
   }
   function u(v) {
-    const A = {
+    const N = {
       value: $e(v),
       illegal: !1,
       relevance: 0,
       _top: i,
       _emitter: new r.__emitter(r)
     };
-    return A._emitter.addText(v), A;
+    return N._emitter.addText(v), N;
   }
-  function h(v, A) {
-    A = A || r.languages || Object.keys(n);
-    const R = u(v), B = A.filter(M).filter($).map(
-      (q) => l(q, v, !1)
+  function g(v, N) {
+    N = N || r.languages || Object.keys(n);
+    const R = u(v), B = N.filter(M).filter($).map(
+      (q) => c(q, v, !1)
     );
     B.unshift(R);
     const F = B.sort((q, V) => {
@@ -1789,13 +1789,13 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     }), [W, Z] = F, ye = W;
     return ye.secondBest = Z, ye;
   }
-  function d(v, A, R) {
-    const B = A && s[A] || R;
+  function d(v, N, R) {
+    const B = N && s[N] || R;
     v.classList.add("hljs"), v.classList.add(`language-${B}`);
   }
   function p(v) {
-    let A = null;
-    const R = c(v);
+    let N = null;
+    const R = l(v);
     if (a(R)) return;
     if (ie(
       "before:highlightElement",
@@ -1809,8 +1809,8 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
         "One of your code blocks includes unescaped HTML.",
         v.innerHTML
       );
-    A = v;
-    const B = A.textContent, F = R ? o(B, { language: R, ignoreIllegals: !0 }) : h(B);
+    N = v;
+    const B = N.textContent, F = R ? o(B, { language: R, ignoreIllegals: !0 }) : g(B);
     v.innerHTML = F.value, v.dataset.highlighted = "yes", d(v, R, F.language), v.result = {
       language: F.language,
       // TODO: remove with version 11.0
@@ -1838,27 +1838,27 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     }
     document.querySelectorAll(r.cssSelector).forEach(p);
   }
-  function T() {
+  function S() {
     E && y();
   }
-  typeof window != "undefined" && window.addEventListener && window.addEventListener("DOMContentLoaded", T, !1);
-  function N(v, A) {
+  typeof window != "undefined" && window.addEventListener && window.addEventListener("DOMContentLoaded", S, !1);
+  function T(v, N) {
     let R = null;
     try {
-      R = A(e);
+      R = N(e);
     } catch (B) {
-      if (le("Language definition for '{}' could not be registered.".replace("{}", v)), g)
+      if (le("Language definition for '{}' could not be registered.".replace("{}", v)), h)
         le(B);
       else
         throw B;
       R = i;
     }
-    R.name || (R.name = v), n[v] = R, R.rawDefinition = A.bind(null, e), R.aliases && L(R.aliases, { languageName: v });
+    R.name || (R.name = v), n[v] = R, R.rawDefinition = N.bind(null, e), R.aliases && L(R.aliases, { languageName: v });
   }
-  function S(v) {
+  function D(v) {
     delete n[v];
-    for (const A of Object.keys(s))
-      s[A] === v && delete s[A];
+    for (const N of Object.keys(s))
+      s[N] === v && delete s[N];
   }
   function k() {
     return Object.keys(n);
@@ -1866,23 +1866,23 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
   function M(v) {
     return v = (v || "").toLowerCase(), n[v] || n[s[v]];
   }
-  function L(v, { languageName: A }) {
+  function L(v, { languageName: N }) {
     typeof v == "string" && (v = [v]), v.forEach((R) => {
-      s[R.toLowerCase()] = A;
+      s[R.toLowerCase()] = N;
     });
   }
   function $(v) {
-    const A = M(v);
-    return A && !A.disableAutodetect;
+    const N = M(v);
+    return N && !N.disableAutodetect;
   }
   function x(v) {
-    v["before:highlightBlock"] && !v["before:highlightElement"] && (v["before:highlightElement"] = (A) => {
+    v["before:highlightBlock"] && !v["before:highlightElement"] && (v["before:highlightElement"] = (N) => {
       v["before:highlightBlock"](
-        Object.assign({ block: A.el }, A)
+        Object.assign({ block: N.el }, N)
       );
-    }), v["after:highlightBlock"] && !v["after:highlightElement"] && (v["after:highlightElement"] = (A) => {
+    }), v["after:highlightBlock"] && !v["after:highlightElement"] && (v["after:highlightElement"] = (N) => {
       v["after:highlightBlock"](
-        Object.assign({ block: A.el }, A)
+        Object.assign({ block: N.el }, N)
       );
     });
   }
@@ -1890,13 +1890,13 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     x(v), f.push(v);
   }
   function K(v) {
-    const A = f.indexOf(v);
-    A !== -1 && f.splice(A, 1);
+    const N = f.indexOf(v);
+    N !== -1 && f.splice(N, 1);
   }
-  function ie(v, A) {
+  function ie(v, N) {
     const R = v;
     f.forEach(function(B) {
-      B[R] && B[R](A);
+      B[R] && B[R](N);
     });
   }
   function ue(v) {
@@ -1904,7 +1904,7 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
   }
   Object.assign(e, {
     highlight: o,
-    highlightAuto: h,
+    highlightAuto: g,
     highlightAll: y,
     highlightElement: p,
     // TODO: Remove with v12 API
@@ -1912,8 +1912,8 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     configure: _,
     initHighlighting: b,
     initHighlightingOnLoad: m,
-    registerLanguage: N,
-    unregisterLanguage: S,
+    registerLanguage: T,
+    unregisterLanguage: D,
     listLanguages: k,
     getLanguage: M,
     registerAliases: L,
@@ -1922,9 +1922,9 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     addPlugin: H,
     removePlugin: K
   }), e.debugMode = function() {
-    g = !1;
+    h = !1;
   }, e.safeMode = function() {
-    g = !0;
+    h = !0;
   }, e.versionString = ei, e.regex = {
     concat: ce,
     lookahead: Dn,
@@ -1932,9 +1932,9 @@ https://github.com/highlightjs/highlight.js/issues/2277`), F = v, B = A), R ===
     optional: _t,
     anyNumberOfTimes: pt
   };
-  for (const v in Me)
-    typeof Me[v] == "object" && Tn(Me[v]);
-  return Object.assign(e, Me), e;
+  for (const v in Ae)
+    typeof Ae[v] == "object" && Tn(Ae[v]);
+  return Object.assign(e, Ae), e;
 }, he = xn({});
 he.newInstance = () => xn({});
 var ii = he;
@@ -1942,7 +1942,7 @@ he.HighlightJS = he;
 he.default = he;
 const j = /* @__PURE__ */ ut(ii);
 function ri(e) {
-  const n = e.regex, s = n.concat(/[\p{L}_]/u, n.optional(/[\p{L}0-9_.-]*:/u), /[\p{L}0-9_.-]*/u), f = /[\p{L}0-9._:-]+/u, g = {
+  const n = e.regex, s = n.concat(/[\p{L}_]/u, n.optional(/[\p{L}0-9_.-]*:/u), /[\p{L}0-9_.-]*/u), f = /[\p{L}0-9._:-]+/u, h = {
     className: "symbol",
     begin: /&[a-z]+;|&#[0-9]+;|&#x[a-f0-9]+;/
   }, t = {
@@ -1957,7 +1957,7 @@ function ri(e) {
   }, i = e.inherit(t, {
     begin: /\(/,
     end: /\)/
-  }), r = e.inherit(e.APOS_STRING_MODE, { className: "string" }), a = e.inherit(e.QUOTE_STRING_MODE, { className: "string" }), c = {
+  }), r = e.inherit(e.APOS_STRING_MODE, { className: "string" }), a = e.inherit(e.QUOTE_STRING_MODE, { className: "string" }), l = {
     endsWithParent: !0,
     illegal: /</,
     relevance: 0,
@@ -1978,12 +1978,12 @@ function ri(e) {
               {
                 begin: /"/,
                 end: /"/,
-                contains: [g]
+                contains: [h]
               },
               {
                 begin: /'/,
                 end: /'/,
-                contains: [g]
+                contains: [h]
               },
               { begin: /[^\s"'=<>`]+/ }
             ]
@@ -2048,7 +2048,7 @@ function ri(e) {
         end: /\]\]>/,
         relevance: 10
       },
-      g,
+      h,
       // xml processing instructions
       {
         className: "meta",
@@ -2076,7 +2076,7 @@ function ri(e) {
         begin: /<style(?=\s|>)/,
         end: />/,
         keywords: { name: "style" },
-        contains: [c],
+        contains: [l],
         starts: {
           end: /<\/style>/,
           returnEnd: !0,
@@ -2092,7 +2092,7 @@ function ri(e) {
         begin: /<script(?=\s|>)/,
         end: />/,
         keywords: { name: "script" },
-        contains: [c],
+        contains: [l],
         starts: {
           end: /<\/script>/,
           returnEnd: !0,
@@ -2127,7 +2127,7 @@ function ri(e) {
             className: "name",
             begin: s,
             relevance: 0,
-            starts: c
+            starts: l
           }
         ]
       },
@@ -2302,10 +2302,10 @@ const hn = "[A-Za-z$_][0-9A-Za-z$_]*", si = [
   Pn
 );
 function ci(e) {
-  const n = e.regex, s = (A, { after: R }) => {
-    const B = "</" + A[0].slice(1);
-    return A.input.indexOf(B, R) !== -1;
-  }, f = hn, g = {
+  const n = e.regex, s = (N, { after: R }) => {
+    const B = "</" + N[0].slice(1);
+    return N.input.indexOf(B, R) !== -1;
+  }, f = hn, h = {
     begin: "<>",
     end: "</>"
   }, t = /<[A-Za-z0-9\\._:-]+\s*\/>/, i = {
@@ -2315,8 +2315,8 @@ function ci(e) {
      * @param {RegExpMatchArray} match
      * @param {CallbackResponse} response
      */
-    isTrulyOpeningTag: (A, R) => {
-      const B = A[0].length + A.index, F = A.input[B];
+    isTrulyOpeningTag: (N, R) => {
+      const B = N[0].length + N.index, F = N.input[B];
       if (
         // HTML should not include another raw `<` inside a tag
         // nested type?
@@ -2328,9 +2328,9 @@ function ci(e) {
         R.ignoreMatch();
         return;
       }
-      F === ">" && (s(A, { after: B }) || R.ignoreMatch());
+      F === ">" && (s(N, { after: B }) || R.ignoreMatch());
       let W;
-      const Z = A.input.substring(B);
+      const Z = N.input.substring(B);
       if (W = Z.match(/^\s*=/)) {
         R.ignoreMatch();
         return;
@@ -2346,12 +2346,12 @@ function ci(e) {
     literal: ai,
     built_in: li,
     "variable.language": oi
-  }, a = "[0-9](_?[0-9])*", c = `\\.(${a})`, o = "0|[1-9](_?[0-9])*|0[0-7]*[89][0-9]*", l = {
+  }, a = "[0-9](_?[0-9])*", l = `\\.(${a})`, o = "0|[1-9](_?[0-9])*|0[0-7]*[89][0-9]*", c = {
     className: "number",
     variants: [
       // DecimalLiteral
-      { begin: `(\\b(${o})((${c})|\\.)?|(${c}))[eE][+-]?(${a})\\b` },
-      { begin: `\\b(${o})\\b((${c})\\b|\\.)?|(${c})\\b` },
+      { begin: `(\\b(${o})((${l})|\\.)?|(${l}))[eE][+-]?(${a})\\b` },
+      { begin: `\\b(${o})\\b((${l})\\b|\\.)?|(${l})\\b` },
       // DecimalBigIntegerLiteral
       { begin: "\\b(0|[1-9](_?[0-9])*)n\\b" },
       // NonDecimalIntegerLiteral
@@ -2370,7 +2370,7 @@ function ci(e) {
     keywords: r,
     contains: []
     // defined later
-  }, h = {
+  }, g = {
     begin: ".?html`",
     end: "",
     starts: {
@@ -2462,13 +2462,13 @@ function ci(e) {
   }, E = [
     e.APOS_STRING_MODE,
     e.QUOTE_STRING_MODE,
-    h,
+    g,
     d,
     p,
     _,
     // Skip numbers when they are part of a variable name
     { match: /\$\d+/ },
-    l
+    c
     // This is intentional:
     // See https://github.com/highlightjs/highlight.js/issues/3288
     // hljs.REGEXP_MODE
@@ -2483,7 +2483,7 @@ function ci(e) {
       "self"
     ].concat(E)
   });
-  const y = [].concat(m, u.contains), T = y.concat([
+  const y = [].concat(m, u.contains), S = y.concat([
     // eat recursive parens in sub expressions
     {
       begin: /(\s*)\(/,
@@ -2491,7 +2491,7 @@ function ci(e) {
       keywords: r,
       contains: ["self"].concat(y)
     }
-  ]), N = {
+  ]), T = {
     className: "params",
     // convert this to negative lookbehind in v12
     begin: /(\s*)\(/,
@@ -2500,8 +2500,8 @@ function ci(e) {
     excludeBegin: !0,
     excludeEnd: !0,
     keywords: r,
-    contains: T
-  }, S = {
+    contains: S
+  }, D = {
     variants: [
       // class Car extends vehicle
       {
@@ -2586,15 +2586,15 @@ function ci(e) {
       3: "title.function"
     },
     label: "func.def",
-    contains: [N],
+    contains: [T],
     illegal: /%/
   }, $ = {
     relevance: 0,
     match: /\b[A-Z][A-Z_0-9]+\b/,
     className: "variable.constant"
   };
-  function x(A) {
-    return n.concat("(?!", A.join("|"), ")");
+  function x(N) {
+    return n.concat("(?!", N.join("|"), ")");
   }
   const H = {
     match: n.concat(
@@ -2603,7 +2603,7 @@ function ci(e) {
         ...Fn,
         "super",
         "import"
-      ].map((A) => `${A}\\s*\\(`)),
+      ].map((N) => `${N}\\s*\\(`)),
       f,
       n.lookahead(/\s*\(/)
     ),
@@ -2634,7 +2634,7 @@ function ci(e) {
         // eat to avoid empty params
         begin: /\(\)/
       },
-      N
+      T
     ]
   }, ue = "(\\([^()]*(\\([^()]*(\\([^()]*\\)[^()]*)*\\)[^()]*)*\\)|" + e.UNDERSCORE_IDENT_RE + ")\\s*=>", v = {
     match: [
@@ -2653,7 +2653,7 @@ function ci(e) {
       3: "title.function"
     },
     contains: [
-      N
+      T
     ]
   };
   return {
@@ -2661,7 +2661,7 @@ function ci(e) {
     aliases: ["js", "jsx", "mjs", "cjs"],
     keywords: r,
     // this will be extended by TypeScript
-    exports: { PARAMS_CONTAINS: T, CLASS_REFERENCE: k },
+    exports: { PARAMS_CONTAINS: S, CLASS_REFERENCE: k },
     illegal: /#(?![$_A-z])/,
     contains: [
       e.SHEBANG({
@@ -2672,14 +2672,14 @@ function ci(e) {
       M,
       e.APOS_STRING_MODE,
       e.QUOTE_STRING_MODE,
-      h,
+      g,
       d,
       p,
       _,
       m,
       // Skip numbers when they are part of a variable name
       { match: /\$\d+/ },
-      l,
+      c,
       k,
       {
         className: "attr",
@@ -2722,7 +2722,7 @@ function ci(e) {
                     excludeBegin: !0,
                     excludeEnd: !0,
                     keywords: r,
-                    contains: T
+                    contains: S
                   }
                 ]
               }
@@ -2740,7 +2740,7 @@ function ci(e) {
           {
             // JSX
             variants: [
-              { begin: g.begin, end: g.end },
+              { begin: h.begin, end: h.end },
               { match: t },
               {
                 begin: i.begin,
@@ -2777,7 +2777,7 @@ function ci(e) {
         returnBegin: !0,
         label: "func.def",
         contains: [
-          N,
+          T,
           e.inherit(e.TITLE_MODE, { begin: f, className: "title.function" })
         ]
       },
@@ -2797,11 +2797,11 @@ function ci(e) {
       {
         match: [/\bconstructor(?=\s*\()/],
         className: { 1: "title.function" },
-        contains: [N]
+        contains: [T]
       },
       H,
       $,
-      S,
+      D,
       ie,
       {
         match: /\$[(.]/
@@ -2823,7 +2823,7 @@ function ui(e) {
     "true",
     "false",
     "null"
-  ], g = {
+  ], h = {
     scope: "literal",
     beginKeywords: f.join(" ")
   };
@@ -2837,7 +2837,7 @@ function ui(e) {
       n,
       s,
       e.QUOTE_STRING_MODE,
-      g,
+      h,
       e.C_NUMBER_MODE,
       e.C_LINE_COMMENT_MODE,
       e.C_BLOCK_COMMENT_MODE
@@ -2860,7 +2860,7 @@ function fi(e) {
         begin: /'\w[\w :()\./-]*':(?=[ \t]|$)/
       }
     ]
-  }, g = {
+  }, h = {
     className: "template-variable",
     variants: [
       {
@@ -2890,7 +2890,7 @@ function fi(e) {
     ],
     contains: [
       e.BACKSLASH_ESCAPE,
-      g
+      h
     ]
   }, i = e.inherit(t, { variants: [
     {
@@ -2902,7 +2902,7 @@ function fi(e) {
       end: /"/
     },
     { begin: /[^\s,{}[\]]+/ }
-  ] }), l = {
+  ] }), c = {
     className: "number",
     begin: "\\b" + "[0-9]{4}(-[0-9][0-9]){0,2}" + "([Tt \\t][0-9][0-9]?(:[0-9][0-9]){2})?" + "(\\.[0-9]*)?" + "([ \\t])*(Z|[-+][0-9][0-9]?(:[0-9][0-9])?)?" + "\\b"
   }, u = {
@@ -2911,7 +2911,7 @@ function fi(e) {
     excludeEnd: !0,
     keywords: n,
     relevance: 0
-  }, h = {
+  }, g = {
     begin: /\{/,
     end: /\}/,
     contains: [u],
@@ -2991,7 +2991,7 @@ function fi(e) {
       beginKeywords: n,
       keywords: { literal: n }
     },
-    l,
+    c,
     // numbers are any valid C-style number that
     // sit isolated from other words
     {
@@ -2999,7 +2999,7 @@ function fi(e) {
       begin: e.C_NUMBER_RE + "\\b",
       relevance: 0
     },
-    h,
+    g,
     d,
     t
   ], _ = [...p];
@@ -3156,7 +3156,7 @@ function hi(e) {
   }, a = {
     className: "meta",
     begin: /^(>>>|\.\.\.) /
-  }, c = {
+  }, l = {
     className: "subst",
     begin: /\{/,
     end: /\}/,
@@ -3165,7 +3165,7 @@ function hi(e) {
   }, o = {
     begin: /\{\{/,
     relevance: 0
-  }, l = {
+  }, c = {
     className: "string",
     contains: [e.BACKSLASH_ESCAPE],
     variants: [
@@ -3194,7 +3194,7 @@ function hi(e) {
           e.BACKSLASH_ESCAPE,
           a,
           o,
-          c
+          l
         ]
       },
       {
@@ -3204,7 +3204,7 @@ function hi(e) {
           e.BACKSLASH_ESCAPE,
           a,
           o,
-          c
+          l
         ]
       },
       {
@@ -3231,7 +3231,7 @@ function hi(e) {
         contains: [
           e.BACKSLASH_ESCAPE,
           o,
-          c
+          l
         ]
       },
       {
@@ -3240,13 +3240,13 @@ function hi(e) {
         contains: [
           e.BACKSLASH_ESCAPE,
           o,
-          c
+          l
         ]
       },
       e.APOS_STRING_MODE,
       e.QUOTE_STRING_MODE
     ]
-  }, u = "[0-9](_?[0-9])*", h = `(\\b(${u}))?\\.(${u})|\\b(${u})\\.`, d = `\\b|${f.join("|")}`, p = {
+  }, u = "[0-9](_?[0-9])*", g = `(\\b(${u}))?\\.(${u})|\\b(${u})\\.`, d = `\\b|${f.join("|")}`, p = {
     className: "number",
     relevance: 0,
     variants: [
@@ -3261,10 +3261,10 @@ function hi(e) {
       // because both MUST contain a decimal point and so cannot be confused with
       // the interior part of an identifier
       {
-        begin: `(\\b(${u})|(${h}))[eE][+-]?(${u})[jJ]?(?=${d})`
+        begin: `(\\b(${u})|(${g}))[eE][+-]?(${u})[jJ]?(?=${d})`
       },
       {
-        begin: `(${h})[jJ]?`
+        begin: `(${g})[jJ]?`
       },
       // decinteger, bininteger, octinteger, hexinteger
       // https://docs.python.org/3.9/reference/lexical_analysis.html#integer-literals
@@ -3326,14 +3326,14 @@ function hi(e) {
           "self",
           a,
           p,
-          l,
+          c,
           e.HASH_COMMENT_MODE
         ]
       }
     ]
   };
-  return c.contains = [
-    l,
+  return l.contains = [
+    c,
     p,
     a
   ], {
@@ -3361,7 +3361,7 @@ function hi(e) {
         relevance: 0
       },
       { match: /\bor\b/, scope: "keyword" },
-      l,
+      c,
       _,
       e.HASH_COMMENT_MODE,
       {
@@ -3410,21 +3410,21 @@ function hi(e) {
         contains: [
           p,
           b,
-          l
+          c
         ]
       }
     ]
   };
 }
-var ge = "[0-9](_*[0-9])*", Ne = `\\.(${ge})`, Te = "[0-9a-fA-F](_*[0-9a-fA-F])*", dn = {
+var ge = "[0-9](_*[0-9])*", Me = `\\.(${ge})`, Te = "[0-9a-fA-F](_*[0-9a-fA-F])*", dn = {
   className: "number",
   variants: [
     // DecimalFloatingPointLiteral
     // including ExponentPart
-    { begin: `(\\b(${ge})((${Ne})|\\.)?|(${Ne}))[eE][+-]?(${ge})[fFdD]?\\b` },
+    { begin: `(\\b(${ge})((${Me})|\\.)?|(${Me}))[eE][+-]?(${ge})[fFdD]?\\b` },
     // excluding ExponentPart
-    { begin: `\\b(${ge})((${Ne})[fFdD]?\\b|\\.([fFdD]\\b)?)` },
-    { begin: `(${Ne})[fFdD]?\\b` },
+    { begin: `\\b(${ge})((${Me})[fFdD]?\\b|\\.([fFdD]\\b)?)` },
+    { begin: `(${Me})[fFdD]?\\b` },
     { begin: `\\b(${ge})[fFdD]\\b` },
     // HexadecimalFloatingPointLiteral
     { begin: `\\b0[xX]((${Te})\\.?|(${Te})?\\.(${Te}))[pP][+-]?(${ge})[fFdD]?\\b` },
@@ -3508,7 +3508,7 @@ function di(e) {
       "super",
       "this"
     ]
-  }, c = {
+  }, l = {
     className: "meta",
     begin: "@" + s,
     contains: [
@@ -3636,7 +3636,7 @@ function di(e) {
             keywords: a,
             relevance: 0,
             contains: [
-              c,
+              l,
               e.APOS_STRING_MODE,
               e.QUOTE_STRING_MODE,
               dn,
@@ -3648,7 +3648,7 @@ function di(e) {
         ]
       },
       dn,
-      c
+      l
     ]
   };
 }
@@ -3677,7 +3677,7 @@ function pi(e) {
       f
     ]
   });
-  const g = {
+  const h = {
     className: "subst",
     begin: /\$\(/,
     end: /\)/,
@@ -3709,19 +3709,19 @@ function pi(e) {
     contains: [
       e.BACKSLASH_ESCAPE,
       s,
-      g
+      h
     ]
   };
-  g.contains.push(r);
+  h.contains.push(r);
   const a = {
     match: /\\"/
-  }, c = {
+  }, l = {
     className: "string",
     begin: /'/,
     end: /'/
   }, o = {
     match: /\\'/
-  }, l = {
+  }, c = {
     begin: /\$?\(\(/,
     end: /\)\)/,
     contains: [
@@ -3742,7 +3742,7 @@ function pi(e) {
     "tcsh",
     "dash",
     "scsh"
-  ], h = e.SHEBANG({
+  ], g = e.SHEBANG({
     binary: `(${u.join("|")})`,
     relevance: 10
   }), d = {
@@ -3881,7 +3881,7 @@ function pi(e) {
     "zsocket",
     "zstyle",
     "ztcp"
-  ], T = [
+  ], S = [
     "chcon",
     "chgrp",
     "chown",
@@ -4003,22 +4003,22 @@ function pi(e) {
         "set",
         "shopt",
         ...y,
-        ...T
+        ...S
       ]
     },
     contains: [
-      h,
+      g,
       // to catch known shells and boost relevancy
       e.SHEBANG(),
       // to catch unknown shells but still highlight the shebang
       d,
-      l,
+      c,
       t,
       i,
       b,
       r,
       a,
-      c,
+      l,
       o,
       s
     ]
@@ -4034,7 +4034,7 @@ function _i(e) {
         contains: [{ begin: /''/ }]
       }
     ]
-  }, g = {
+  }, h = {
     begin: /"/,
     end: /"/,
     contains: [{ begin: /""/ }]
@@ -4087,7 +4087,7 @@ function _i(e) {
     "first",
     "last",
     "view"
-  ], c = [
+  ], l = [
     "abs",
     "acos",
     "all",
@@ -4540,7 +4540,7 @@ function _i(e) {
     "var_pop",
     "var_samp",
     "width_bucket"
-  ], l = [
+  ], c = [
     "current_catalog",
     "current_date",
     "current_default_transform_group",
@@ -4573,8 +4573,8 @@ function _i(e) {
     "nulls last",
     "depth first",
     "breadth first"
-  ], h = o, d = [
-    ...c,
+  ], g = o, d = [
+    ...l,
     ...a
   ].filter((E) => !o.includes(E)), p = {
     className: "variable",
@@ -4584,16 +4584,16 @@ function _i(e) {
     begin: /[-+*/=%^~]|&&?|\|\|?|!=?|<(?:=>?|<|>)?|>[>=]?/,
     relevance: 0
   }, b = {
-    begin: n.concat(/\b/, n.either(...h), /\s*\(/),
+    begin: n.concat(/\b/, n.either(...g), /\s*\(/),
     relevance: 0,
-    keywords: { built_in: h }
+    keywords: { built_in: g }
   };
   function m(E, {
     exceptions: y,
-    when: T
+    when: S
   } = {}) {
-    const N = T;
-    return y = y || [], E.map((S) => S.match(/\|\d+$/) || y.includes(S) ? S : N(S) ? `${S}|0` : S);
+    const T = S;
+    return y = y || [], E.map((D) => D.match(/\|\d+$/) || y.includes(D) ? D : T(D) ? `${D}|0` : D);
   }
   return {
     name: "SQL",
@@ -4605,7 +4605,7 @@ function _i(e) {
       keyword: m(d, { when: (E) => E.length < 3 }),
       literal: t,
       type: r,
-      built_in: l
+      built_in: c
     },
     contains: [
       {
@@ -4625,7 +4625,7 @@ function _i(e) {
       b,
       p,
       f,
-      g,
+      h,
       e.C_NUMBER_MODE,
       e.C_BLOCK_COMMENT_MODE,
       s,
@@ -4642,7 +4642,7 @@ j.registerLanguage("python", hi);
 j.registerLanguage("java", di);
 j.registerLanguage("bash", pi);
 j.registerLanguage("sql", _i);
-var D = /* @__PURE__ */ ((e) => (e.EQUAL = "equal", e.DELETE = "removed", e.ADD = "added", e.EMPTY = "empty", e))(D || {});
+var A = /* @__PURE__ */ ((e) => (e.EQUAL = "equal", e.DELETE = "removed", e.ADD = "added", e.EMPTY = "empty", e))(A || {});
 const J = "<code-diff-modified>", ee = "</code-diff-modified>", bi = 1e4, Q = 1e3, pn = J.replace("<", "&lt;").replace(">", "&gt;"), _n = ee.replace("<", "&lt;").replace(">", "&gt;");
 function vi(e) {
   const n = {
@@ -4655,17 +4655,17 @@ function vi(e) {
   return e.replace(/[&<>"']/g, (s) => n[s]);
 }
 function se(e) {
-  return e === void 0 ? D.EQUAL : e.added ? D.ADD : e.removed ? D.DELETE : D.EQUAL;
+  return e === void 0 ? A.EQUAL : e.added ? A.ADD : e.removed ? A.DELETE : A.EQUAL;
 }
 function zn(e, n, s = "word", f = !1) {
   if (typeof e == "undefined" || typeof n == "undefined")
     return [e, n];
   if (!f && e.length + n.length > bi)
     return [e, n];
-  const t = (s === "char" ? it : st)(e, n), i = t.filter((a) => se(a) !== D.ADD).map(
-    (a) => se(a) === D.DELETE ? `${J}${a.value}${ee}` : a.value
-  ).join(""), r = t.filter((a) => se(a) !== D.DELETE).map(
-    (a) => se(a) === D.ADD ? `${J}${a.value}${ee}` : a.value
+  const t = (s === "char" ? it : st)(e, n), i = t.filter((a) => se(a) !== A.ADD).map(
+    (a) => se(a) === A.DELETE ? `${J}${a.value}${ee}` : a.value
+  ).join(""), r = t.filter((a) => se(a) !== A.DELETE).map(
+    (a) => se(a) === A.ADD ? `${J}${a.value}${ee}` : a.value
   ).join("");
   return [i, r];
 }
@@ -4679,38 +4679,38 @@ function Gn(e, n) {
   s !== f && (s ? e = e.slice(0, -1) : n = n.slice(0, -1)), e && (e += `
 `), n && (n += `
 `);
-  let g;
+  let h;
   if (e.length + n.length >= 1e5 && e.includes(`
 `) && n.includes(`
 `)) {
     const t = e ? e.replace(/\n$/, "").split(`
 `) : [], i = n ? n.replace(/\n$/, "").split(`
-`) : [], r = new Set(t), a = new Set(i), [c, o] = r.size < a.size ? [r, a] : [a, r];
-    let l = 0;
-    for (const p of c)
-      o.has(p) && l++;
-    const u = c.size ? l / c.size : 0, h = r.size >= 4e4 || r.size + a.size - l >= 65535, d = r.size + a.size - l * 2;
-    u < 0.01 || h && d > 200 ? (g = [], e && g.push({ count: t.length, value: e, removed: !0 }), n && g.push({ count: i.length, value: n, added: !0 })) : h && (g = at(e, n));
+`) : [], r = new Set(t), a = new Set(i), [l, o] = r.size < a.size ? [r, a] : [a, r];
+    let c = 0;
+    for (const p of l)
+      o.has(p) && c++;
+    const u = l.size ? c / l.size : 0, g = r.size >= 4e4 || r.size + a.size - c >= 65535, d = r.size + a.size - c * 2;
+    u < 0.01 || g && d > 200 ? (h = [], e && h.push({ count: t.length, value: e, removed: !0 }), n && h.push({ count: i.length, value: n, added: !0 })) : g && (h = at(e, n));
   }
-  if (!g) {
-    const t = new ke.diff_match_patch(), i = t.diff_linesToChars_(e, n), r = i.chars1, a = i.chars2, c = i.lineArray, o = t.diff_main(r, a, !1);
-    t.diff_charsToLines_(o, c), g = o.map((l) => {
-      const [u, h] = l;
+  if (!h) {
+    const t = new ke.diff_match_patch(), i = t.diff_linesToChars_(e, n), r = i.chars1, a = i.chars2, l = i.lineArray, o = t.diff_main(r, a, !1);
+    t.diff_charsToLines_(o, l), h = o.map((c) => {
+      const [u, g] = c;
       return {
-        count: h.replace(/\n$/, "").split(`
+        count: g.replace(/\n$/, "").split(`
 `).length,
-        value: h,
+        value: g,
         removed: u === ke.DIFF_DELETE,
         added: u === ke.DIFF_INSERT
       };
     });
   }
-  return s !== f && g.push({
+  return s !== f && h.push({
     count: 1,
     value: "",
     removed: s,
     added: f
-  }), g;
+  }), h;
 }
 function Ue(e, n) {
   if (typeof document == "undefined" || e === "plaintext")
@@ -4718,28 +4718,28 @@ function Ue(e, n) {
   if (!n.match(new RegExp(`(${J}|${ee})`, "g")))
     return j.highlight(n, { language: e }).value;
   let f = n;
-  const g = n.replace(new RegExp(`(${J}|${ee})`, "g"), ""), t = document.createElement("div");
-  t.innerHTML = j.highlight(g, { language: e }).value;
+  const h = n.replace(new RegExp(`(${J}|${ee})`, "g"), ""), t = document.createElement("div");
+  t.innerHTML = j.highlight(h, { language: e }).value;
   let i = !1;
   const r = (a) => {
-    a.childNodes.forEach((c) => {
-      if (c.nodeType === Node.ELEMENT_NODE && r(c), c.nodeType === Node.TEXT_NODE) {
-        if (!c.textContent)
+    a.childNodes.forEach((l) => {
+      if (l.nodeType === Node.ELEMENT_NODE && r(l), l.nodeType === Node.TEXT_NODE) {
+        if (!l.textContent)
           return;
-        let o = c.textContent, l = "";
-        for (i && (l = l + J); o.length; ) {
+        let o = l.textContent, c = "";
+        for (i && (c = c + J); o.length; ) {
           if (f.startsWith(J)) {
-            f = f.slice(J.length), l = l + J, i = !0;
+            f = f.slice(J.length), c = c + J, i = !0;
             continue;
           }
           if (f.startsWith(ee)) {
-            f = f.slice(ee.length), l = l + ee, i = !1;
+            f = f.slice(ee.length), c = c + ee, i = !1;
             continue;
           }
-          const u = f.match(new RegExp(`(${J}|${ee})`)), h = u && u.index ? u.index : f.length, d = Math.min(h, o.length);
-          l = l + f.substring(0, d), f = f.slice(d), o = o.slice(d);
+          const u = f.match(new RegExp(`(${J}|${ee})`)), g = u && u.index ? u.index : f.length, d = Math.min(g, o.length);
+          c = c + f.substring(0, d), f = f.slice(d), o = o.slice(d);
         }
-        i && (l = l + ee), c.textContent = l;
+        i && (c = c + ee), l.textContent = c;
       }
     });
   };
@@ -4752,95 +4752,95 @@ function Fe(e, n) {
   if (e.highlighted)
     return;
   const s = e.left.code;
-  s !== void 0 && (e.left.code = Ue(n, s)), e.right.code !== void 0 && (e.right.code = e.left.type === D.EQUAL && e.right.type === D.EQUAL && e.right.code === s ? e.left.code : Ue(n, e.right.code)), e.highlighted = !0;
+  s !== void 0 && (e.left.code = Ue(n, s)), e.right.code !== void 0 && (e.right.code = e.left.type === A.EQUAL && e.right.type === A.EQUAL && e.right.code === s ? e.left.code : Ue(n, e.right.code)), e.highlighted = !0;
 }
 function Kn(e, n) {
-  var a, c;
-  const s = (o, l) => (o.match(new RegExp(l, "g")) || []).length, f = (o) => o.filter((l) => n == null ? void 0 : n.test(l)).length;
-  let g = 0, t = 0, i = 0, r = 0;
+  var a, l;
+  const s = (o, c) => (o.match(new RegExp(c, "g")) || []).length, f = (o) => o.filter((c) => n == null ? void 0 : n.test(c)).length;
+  let h = 0, t = 0, i = 0, r = 0;
   for (const o of e) {
     if (o.added) {
       if (!n) {
-        g += (a = o.count) != null ? a : 0;
+        h += (a = o.count) != null ? a : 0;
         continue;
       }
-      const l = f(o.value.trim().split(`
+      const c = f(o.value.trim().split(`
 `));
-      g += s(o.value.trim(), `
-`) + 1 - l, i += l;
+      h += s(o.value.trim(), `
+`) + 1 - c, i += c;
       continue;
     }
     if (o.removed) {
       if (!n) {
-        t += (c = o.count) != null ? c : 0;
+        t += (l = o.count) != null ? l : 0;
         continue;
       }
-      const l = f(o.value.trim().split(`
+      const c = f(o.value.trim().split(`
 `));
       t += s(o.value.trim(), `
-`) + 1 - l, r += l;
+`) + 1 - c, r += c;
       continue;
     }
   }
   return {
-    additionsNum: g,
+    additionsNum: h,
     deletionsNum: t,
     ignoreAdditionsNum: i,
     ignoreDeletionsNum: r
   };
 }
-function mi(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
-  const r = () => ({ type: D.EMPTY }), a = (m, E, y) => ({ type: m, num: E, code: y }), c = Gn(e, n), o = i ? new RegExp(i) : void 0;
-  let l = 0, u = 0, h = !1;
+function mi(e, n, s = "plaintext", f = "word", h = !1, t = 10, i) {
+  const r = () => ({ type: A.EMPTY }), a = (m, E, y) => ({ type: m, num: E, code: y }), l = Gn(e, n), o = i ? new RegExp(i) : void 0;
+  let c = 0, u = 0, g = !1;
   const d = [], p = {
     changes: d,
     collector: [],
-    stat: Kn(c, o)
+    stat: Kn(l, o)
   };
-  for (let m = 0; m < c.length; m++) {
-    if (h) {
-      h = !1;
+  for (let m = 0; m < l.length; m++) {
+    if (g) {
+      g = !1;
       continue;
     }
-    const [E, y] = [c[m], c[m + 1]], [T, N] = [se(E), se(y)], S = E.value.replace(/\n$/, "").split(`
+    const [E, y] = [l[m], l[m + 1]], [S, T] = [se(E), se(y)], D = E.value.replace(/\n$/, "").split(`
 `);
     if (y === void 0) {
-      for (const M of S) {
+      for (const M of D) {
         let L = r(), $ = r();
-        T === D.EQUAL && (l++, u++, L = a(D.EQUAL, l, M), $ = a(D.EQUAL, u, M)), T === D.DELETE && (l++, L = a(D.DELETE, l, M), $ = r()), T === D.ADD && (u++, L = r(), $ = a(D.ADD, u, M)), d.push({ left: L, right: $ });
+        S === A.EQUAL && (c++, u++, L = a(A.EQUAL, c, M), $ = a(A.EQUAL, u, M)), S === A.DELETE && (c++, L = a(A.DELETE, c, M), $ = r()), S === A.ADD && (u++, L = r(), $ = a(A.ADD, u, M)), d.push({ left: L, right: $ });
       }
       break;
     }
-    if (T === D.EQUAL)
-      for (const M of S)
-        l++, u++, d.push({
-          left: a(D.EQUAL, l, M),
-          right: a(D.EQUAL, u, M)
+    if (S === A.EQUAL)
+      for (const M of D)
+        c++, u++, d.push({
+          left: a(A.EQUAL, c, M),
+          right: a(A.EQUAL, u, M)
         });
     const k = y.value.replace(/\n$/, "").split(`
 `);
-    if (T === D.DELETE) {
-      if (N === D.EQUAL)
-        for (const M of S)
-          l++, d.push({
-            left: a(D.DELETE, l, M),
+    if (S === A.DELETE) {
+      if (T === A.EQUAL)
+        for (const M of D)
+          c++, d.push({
+            left: a(A.DELETE, c, M),
             right: r()
           });
-      if (N === D.ADD) {
-        h = !0;
+      if (T === A.ADD) {
+        g = !0;
         const M = Math.max(E.count, y.count);
         for (let L = 0; L < M; L++) {
-          L < E.count && l++, L < y.count && u++;
-          const [$, x] = [S[L], k[L]], H = g || S.length === k.length, [K, ie] = H ? zn($, x, f, g) : [$, x], ue = o != null && o.test($) ? D.EQUAL : D.DELETE, v = o != null && o.test(x) ? D.EQUAL : D.ADD, A = L < E.count ? a(ue, l, K) : r(), R = L < y.count ? a(v, u, ie) : r();
-          d.push({ left: A, right: R });
+          L < E.count && c++, L < y.count && u++;
+          const [$, x] = [D[L], k[L]], H = h || D.length === k.length, [K, ie] = H ? zn($, x, f, h) : [$, x], ue = o != null && o.test($) ? A.EQUAL : A.DELETE, v = o != null && o.test(x) ? A.EQUAL : A.ADD, N = L < E.count ? a(ue, c, K) : r(), R = L < y.count ? a(v, u, ie) : r();
+          d.push({ left: N, right: R });
         }
       }
     }
-    if (T === D.ADD)
-      for (const M of S)
+    if (S === A.ADD)
+      for (const M of D)
         u++, d.push({
           left: r(),
-          right: a(D.ADD, u, M)
+          right: a(A.ADD, u, M)
         });
   }
   if (e === n) {
@@ -4850,10 +4850,10 @@ function mi(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
   }
   for (let m = 0; m < d.length; m++) {
     const E = d[m];
-    if (E.left.type === D.DELETE || E.right.type === D.ADD) {
-      const [y, T] = [Math.max(m - t, 0), Math.min(m + t + 1, d.length)];
-      for (let N = y; N < T; N++)
-        d[N].fold = !1;
+    if (E.left.type === A.DELETE || E.right.type === A.ADD) {
+      const [y, S] = [Math.max(m - t, 0), Math.min(m + t + 1, d.length)];
+      for (let T = y; T < S; T++)
+        d[T].fold = !1;
     }
     E.fold === void 0 && (E.fold = !0);
   }
@@ -4875,66 +4875,66 @@ function mi(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
     fold: !0
   }), b = []), p.changes = _, p.changes.filter((m) => !m.hide).slice(0, Q).forEach((m) => Fe(m, s)), p;
 }
-function Ei(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
+function Ei(e, n, s = "plaintext", f = "word", h = !1, t = 10, i) {
   const r = Gn(e, n), a = i ? new RegExp(i) : void 0;
-  let c = 0, o = 0, l = !1;
-  const u = [], h = {
+  let l = 0, o = 0, c = !1;
+  const u = [], g = {
     changes: u,
     collector: [],
     stat: Kn(r, a)
   };
   for (let _ = 0; _ < r.length; _++) {
-    if (l) {
-      l = !1;
+    if (c) {
+      c = !1;
       continue;
     }
-    const [b, m] = [r[_], r[_ + 1]], [E, y] = [se(b), se(m)], T = b.value.replace(/\n$/, "").split(`
+    const [b, m] = [r[_], r[_ + 1]], [E, y] = [se(b), se(m)], S = b.value.replace(/\n$/, "").split(`
 `);
     if (m === void 0) {
-      for (const S of T)
-        E === D.EQUAL && (c++, o++), E === D.DELETE && c++, E === D.ADD && o++, u.push({
+      for (const D of S)
+        E === A.EQUAL && (l++, o++), E === A.DELETE && l++, E === A.ADD && o++, u.push({
           type: E,
-          code: S,
-          addNum: E === D.DELETE ? void 0 : o,
-          delNum: E === D.ADD ? void 0 : c
+          code: D,
+          addNum: E === A.DELETE ? void 0 : o,
+          delNum: E === A.ADD ? void 0 : l
         });
       break;
     }
-    if (E === D.EQUAL)
-      for (const S of T)
-        c++, o++, u.push({ type: D.EQUAL, code: S, delNum: c, addNum: o });
-    const N = m.value.replace(/\n$/, "").split(`
+    if (E === A.EQUAL)
+      for (const D of S)
+        l++, o++, u.push({ type: A.EQUAL, code: D, delNum: l, addNum: o });
+    const T = m.value.replace(/\n$/, "").split(`
 `);
-    if (E === D.DELETE)
-      if (y === D.ADD && (T.length === N.length || g)) {
-        const S = Math.max(T.length, N.length), k = Array.from({ length: S }, (M, L) => zn(T[L], N[L], f, g));
-        for (let M = 0; M < T.length; M++) {
-          const L = T[M];
-          c++, u.push({
-            type: a != null && a.test(L) ? D.EQUAL : D.DELETE,
+    if (E === A.DELETE)
+      if (y === A.ADD && (S.length === T.length || h)) {
+        const D = Math.max(S.length, T.length), k = Array.from({ length: D }, (M, L) => zn(S[L], T[L], f, h));
+        for (let M = 0; M < S.length; M++) {
+          const L = S[M];
+          l++, u.push({
+            type: a != null && a.test(L) ? A.EQUAL : A.DELETE,
             code: k[M][0],
-            delNum: c
+            delNum: l
           });
         }
-        for (let M = 0; M < N.length; M++) {
-          const L = N[M];
+        for (let M = 0; M < T.length; M++) {
+          const L = T[M];
           o++, u.push({
-            type: a != null && a.test(L) ? D.EQUAL : D.ADD,
+            type: a != null && a.test(L) ? A.EQUAL : A.ADD,
             code: k[M][1],
             addNum: o
           });
         }
-        l = !0;
+        c = !0;
       } else
-        for (const S of T)
-          c++, u.push({ type: D.DELETE, code: S, delNum: c });
-    if (E === D.ADD)
-      for (const S of T)
-        o++, u.push({ type: D.ADD, code: S, addNum: o });
+        for (const D of S)
+          l++, u.push({ type: A.DELETE, code: D, delNum: l });
+    if (E === A.ADD)
+      for (const D of S)
+        o++, u.push({ type: A.ADD, code: D, addNum: o });
   }
   for (let _ = 0; _ < u.length; _++) {
     const b = u[_];
-    if (b.type === D.DELETE || b.type === D.ADD) {
+    if (b.type === A.DELETE || b.type === A.ADD) {
       const [m, E] = [Math.max(_ - t, 0), Math.min(_ + t + 1, u.length)];
       for (let y = m; y < E; y++)
         u[y].fold = !1;
@@ -4944,14 +4944,14 @@ function Ei(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
   if (e === n) {
     for (let _ = 0; _ < u.length; _++)
       u[_].fold = !1;
-    return u.slice(0, Q).forEach((_) => Pe(_, s)), h;
+    return u.slice(0, Q).forEach((_) => Pe(_, s)), g;
   }
   const d = [];
   let p = [];
   for (let _ = 0; _ < u.length; _++) {
     const b = u[_];
     if (b.fold === !1) {
-      p.length && (p[0].hideIndex = h.collector.length, h.collector.push({
+      p.length && (p[0].hideIndex = g.collector.length, g.collector.push({
         lines: p,
         fold: !0
       }), p = []), d.push(b);
@@ -4959,10 +4959,10 @@ function Ei(e, n, s = "plaintext", f = "word", g = !1, t = 10, i) {
     }
     b.type === "equal" && (b.hide = !0, p.push(b)), d.push(b);
   }
-  return p.length && (p[0].hideIndex = h.collector.length, h.collector.push({
+  return p.length && (p[0].hideIndex = g.collector.length, g.collector.push({
     lines: p,
     fold: !0
-  }), p = []), h.changes = d, h.changes.filter((_) => !_.hide).slice(0, Q).forEach((_) => Pe(_, s)), h;
+  }), p = []), g.changes = d, g.changes.filter((_) => !_.hide).slice(0, Q).forEach((_) => Pe(_, s)), g;
 }
 const Ye = {};
 Ye.props = {
@@ -4973,14 +4973,23 @@ Ye.props = {
   }
 };
 Ye.setup = (e, n) => {
-  const s = n.emit;
-  function f(g) {
-    return g === D.DELETE ? "-" : g === D.ADD ? "+" : "";
+  const s = e, f = n.emit;
+  function h(i) {
+    s.line.type !== A.ADD && s.line.type !== A.DELETE || f("change-click", {
+      side: s.line.type === A.DELETE ? "old" : "new",
+      type: s.line.type,
+      lineNumber: s.line.type === A.DELETE ? s.line.delNum : s.line.addNum,
+      event: i
+    });
+  }
+  function t(i) {
+    return i === A.DELETE ? "-" : i === A.ADD ? "+" : "";
   }
   return {
-    DiffType: D,
-    emit: s,
-    getCodeMarker: f
+    DiffType: A,
+    emit: f,
+    onChangeClick: h,
+    getCodeMarker: t
   };
 };
 var yi = function() {
@@ -5003,6 +5012,9 @@ var yi = function() {
   }, [e._v(" ⋯ ")])]) : e.line.hide ? e._e() : s("tr", {
     attrs: {
       "data-diff-change": e.line.type !== e.DiffType.EQUAL ? "" : void 0
+    },
+    on: {
+      click: e.onChangeClick
     }
   }, [s("td", {
     staticClass: "blob-num",
@@ -5038,20 +5050,20 @@ var yi = function() {
     }
   })])]);
 }, wi = [];
-function ae(e, n, s, f, g, t, i, r) {
+function ae(e, n, s, f, h, t, i, r) {
   var a = typeof e == "function" ? e.options : e;
   n && (a.render = n, a.staticRenderFns = s, a._compiled = !0), t && (a._scopeId = "data-v-" + t);
-  var c;
-  if (g && (c = g), c)
+  var l;
+  if (h && (l = h), l)
     if (a.functional) {
-      a._injectStyles = c;
+      a._injectStyles = l;
       var o = a.render;
-      a.render = function(h, d) {
-        return c.call(d), o(h, d);
+      a.render = function(g, d) {
+        return l.call(d), o(g, d);
       };
     } else {
-      var l = a.beforeCreate;
-      a.beforeCreate = l ? [].concat(l, c) : [c];
+      var c = a.beforeCreate;
+      a.beforeCreate = c ? [].concat(c, l) : [l];
     }
   return {
     exports: e,
@@ -5059,20 +5071,20 @@ function ae(e, n, s, f, g, t, i, r) {
   };
 }
 const bn = {};
-var Ai = /* @__PURE__ */ ae(
+var Ni = /* @__PURE__ */ ae(
   Ye,
   yi,
   wi,
   !1,
-  Mi,
+  Ai,
   null
 );
-function Mi(e) {
+function Ai(e) {
   for (let n in bn)
     this[n] = bn[n];
 }
-const Ni = /* @__PURE__ */ function() {
-  return Ai.exports;
+const Mi = /* @__PURE__ */ function() {
+  return Ni.exports;
 }(), be = {};
 be.props = {
   diffChange: {
@@ -5087,46 +5099,50 @@ be.props = {
   }
 };
 be.setup = (e, n) => {
-  const s = e, f = De(Q), g = ze(s.diffChange.changes.filter((l) => !l.hide || l.hideIndex !== void 0)), t = Y(() => g.value.slice(0, f.value)), i = Y(() => g.value.length - t.value.length), r = Y(() => Math.min(i.value, Q));
-  Ge(() => s.diffChange, (l) => {
-    f.value = Q, g.value = l.changes.filter((u) => !u.hide || u.hideIndex !== void 0);
+  const s = e, f = n.emit, h = De(Q), t = ze(s.diffChange.changes.filter((u) => !u.hide || u.hideIndex !== void 0)), i = Y(() => t.value.slice(0, h.value)), r = Y(() => t.value.length - i.value.length), a = Y(() => Math.min(r.value, Q));
+  Ge(() => s.diffChange, (u) => {
+    h.value = Q, t.value = u.changes.filter((g) => !g.hide || g.hideIndex !== void 0);
   });
-  function a() {
-    t.value.forEach((l) => Pe(l, s.language));
+  function l() {
+    i.value.forEach((u) => Pe(u, s.language));
   }
-  function c({
-    hideIndex: l
+  function o({
+    hideIndex: u
   }) {
-    l !== void 0 && (s.diffChange.collector[l].lines.forEach((u) => {
-      u.hide = !1, u.fold = !1;
-    }), g.value = s.diffChange.changes.filter((u) => !u.hide || u.hideIndex !== void 0), a());
+    u !== void 0 && (s.diffChange.collector[u].lines.forEach((g) => {
+      g.hide = !1, g.fold = !1;
+    }), t.value = s.diffChange.changes.filter((g) => !g.hide || g.hideIndex !== void 0), l());
   }
-  function o() {
-    f.value += Q, a();
+  function c() {
+    h.value += Q, l();
   }
   return {
-    renderedChanges: t,
-    remainingLines: i,
-    nextBatchSize: r,
-    expandHandler: c,
-    loadMore: o
+    emit: f,
+    renderedChanges: i,
+    remainingLines: r,
+    nextBatchSize: a,
+    expandHandler: o,
+    loadMore: c
   };
 };
 be.components = Object.assign({
-  UnifiedLine: Ni
+  UnifiedLine: Mi
 }, be.components);
 var Ti = function() {
   var e = this, n = e.$createElement, s = e._self._c || n;
   return s("table", {
     staticClass: "diff-table"
-  }, [s("tbody", [e._l(e.renderedChanges, function(f, g) {
+  }, [s("tbody", [e._l(e.renderedChanges, function(f, h) {
     return s("UnifiedLine", {
-      key: g,
+      key: h,
       attrs: {
         line: f
       },
       on: {
-        expand: e.expandHandler
+        expand: e.expandHandler,
+        "change-click": function(t) {
+          return e.emit("change-click", t);
+        }
       }
     });
   }), e.remainingLines ? s("tr", [s("td", {
@@ -5169,19 +5185,28 @@ Ve.props = {
 };
 Ve.setup = (e, n) => {
   const s = n.emit;
-  function f(t) {
-    return t === D.DELETE ? "-" : t === D.ADD ? "+" : "";
+  function f(i) {
+    return i === A.DELETE ? "-" : i === A.ADD ? "+" : "";
+  }
+  function h(i, r) {
+    const a = i.currentTarget.closest(".file-diff-split"), l = a.querySelectorAll(".split-side-left"), o = a.querySelectorAll(".split-side-right");
+    for (const c of o) c.classList.toggle("no-select", r === "left");
+    for (const c of l) c.classList.toggle("no-select", r === "right");
   }
-  function g(t, i) {
-    const r = t.currentTarget.closest(".file-diff-split"), a = r.querySelectorAll(".split-side-left"), c = r.querySelectorAll(".split-side-right");
-    for (const o of c) o.classList.toggle("no-select", i === "left");
-    for (const o of a) o.classList.toggle("no-select", i === "right");
+  function t(i, r, a) {
+    r.type !== A.ADD && r.type !== A.DELETE || s("change-click", {
+      side: a,
+      type: r.type,
+      lineNumber: r.num,
+      event: i
+    });
   }
   return {
-    DiffType: D,
+    DiffType: A,
     emit: s,
     getCodeMarker: f,
-    onSplitLineMousedown: g
+    onSplitLineMousedown: h,
+    onChangeClick: t
   };
 };
 var Ri = function() {
@@ -5206,7 +5231,7 @@ var Ri = function() {
     attrs: {
       "data-diff-change": e.splitLine.left.type === e.DiffType.DELETE || e.splitLine.right.type === e.DiffType.ADD ? "" : void 0
     }
-  }, [e._l([e.splitLine.left, e.splitLine.right], function(f, g) {
+  }, [e._l([e.splitLine.left, e.splitLine.right], function(f, h) {
     return [f.type === e.DiffType.EMPTY ? [s("td", {
       staticClass: "blob-num blob-num-empty empty-cell"
     }), s("td", {
@@ -5226,12 +5251,15 @@ var Ri = function() {
         "blob-code-addition": f.type === e.DiffType.ADD,
         "blob-code-context": f.type === e.DiffType.EQUAL,
         "blob-code-hunk": e.splitLine.hide !== void 0,
-        "split-side-left": g === 0,
-        "split-side-right": g === 1
+        "split-side-left": h === 0,
+        "split-side-right": h === 1
       },
       on: {
         mousedown: function(t) {
-          return e.onSplitLineMousedown(t, g === 0 ? "left" : "right");
+          return e.onSplitLineMousedown(t, h === 0 ? "left" : "right");
+        },
+        click: function(t) {
+          return e.onChangeClick(t, f, h === 0 ? "old" : "new");
         }
       }
     }, [s("span", {
@@ -5274,29 +5302,30 @@ ve.props = {
   }
 };
 ve.setup = (e, n) => {
-  const s = e, f = De(Q), g = ze(s.diffChange.changes.filter((l) => !l.hide || l.hideIndex !== void 0)), t = Y(() => g.value.slice(0, f.value)), i = Y(() => g.value.length - t.value.length), r = Y(() => Math.min(i.value, Q));
-  Ge(() => s.diffChange, (l) => {
-    f.value = Q, g.value = l.changes.filter((u) => !u.hide || u.hideIndex !== void 0);
+  const s = e, f = n.emit, h = De(Q), t = ze(s.diffChange.changes.filter((u) => !u.hide || u.hideIndex !== void 0)), i = Y(() => t.value.slice(0, h.value)), r = Y(() => t.value.length - i.value.length), a = Y(() => Math.min(r.value, Q));
+  Ge(() => s.diffChange, (u) => {
+    h.value = Q, t.value = u.changes.filter((g) => !g.hide || g.hideIndex !== void 0);
   });
-  function a() {
-    t.value.forEach((l) => Fe(l, s.language));
+  function l() {
+    i.value.forEach((u) => Fe(u, s.language));
   }
-  function c({
-    hideIndex: l
+  function o({
+    hideIndex: u
   }) {
-    l !== void 0 && (s.diffChange.collector[l].lines.forEach((u) => {
-      u.hide = !1, u.fold = !1;
-    }), g.value = s.diffChange.changes.filter((u) => !u.hide || u.hideIndex !== void 0), a());
+    u !== void 0 && (s.diffChange.collector[u].lines.forEach((g) => {
+      g.hide = !1, g.fold = !1;
+    }), t.value = s.diffChange.changes.filter((g) => !g.hide || g.hideIndex !== void 0), l());
   }
-  function o() {
-    f.value += Q, a();
+  function c() {
+    h.value += Q, l();
   }
   return {
-    renderedChanges: t,
-    remainingLines: i,
-    nextBatchSize: r,
-    expandHandler: c,
-    loadMore: o
+    emit: f,
+    renderedChanges: i,
+    remainingLines: r,
+    nextBatchSize: a,
+    expandHandler: o,
+    loadMore: c
   };
 };
 ve.components = Object.assign({
@@ -5306,14 +5335,17 @@ var Bi = function() {
   var e = this, n = e.$createElement, s = e._self._c || n;
   return s("table", {
     staticClass: "file-diff-split diff-table"
-  }, [e._m(0), s("tbody", [e._l(e.renderedChanges, function(f, g) {
+  }, [e._m(0), s("tbody", [e._l(e.renderedChanges, function(f, h) {
     return s("SplitLine", {
-      key: g,
+      key: h,
       attrs: {
         "split-line": f
       },
       on: {
-        expand: e.expandHandler
+        expand: e.expandHandler,
+        "change-click": function(t) {
+          return e.emit("change-click", t);
+        }
       }
     });
   }), e.remainingLines ? s("tr", [s("td", {
@@ -5505,6 +5537,12 @@ me.props = {
     type: Boolean,
     default: !1
   },
+  hideNavigation: {
+    key: "hideNavigation",
+    required: !1,
+    type: Boolean,
+    default: !1
+  },
   theme: {
     key: "theme",
     required: !1,
@@ -5519,7 +5557,7 @@ me.props = {
   }
 };
 me.setup = (e, n) => {
-  const s = e, f = n.emit, g = Y(() => s.outputFormat === "line-by-line"), t = Y(() => {
+  const s = e, f = n.emit, h = Y(() => s.outputFormat === "line-by-line"), t = Y(() => {
     let p = s.oldString || "";
     return p = s.trim ? p.trim() : p, p = s.noDiffLineFeed ? p.replace(/(\r\n)/g, `
 `) : p, p;
@@ -5527,17 +5565,17 @@ me.setup = (e, n) => {
     let p = s.newString || "";
     return p = s.trim ? p.trim() : p, p = s.noDiffLineFeed ? p.replace(/(\r\n)/g, `
 `) : p, p;
-  }), r = Y(() => g.value ? Ei(t.value, i.value, s.language, s.diffStyle, s.forceInlineComparison, s.context, s.ignoreMatchingLines) : mi(t.value, i.value, s.language, s.diffStyle, s.forceInlineComparison, s.context, s.ignoreMatchingLines)), a = ze(r.value), c = Y(() => a.value.stat.additionsNum === 0 && a.value.stat.deletionsNum === 0), o = De(-1), l = De();
+  }), r = Y(() => h.value ? Ei(t.value, i.value, s.language, s.diffStyle, s.forceInlineComparison, s.context, s.ignoreMatchingLines) : mi(t.value, i.value, s.language, s.diffStyle, s.forceInlineComparison, s.context, s.ignoreMatchingLines)), a = ze(r.value), l = Y(() => a.value.stat.additionsNum === 0 && a.value.stat.deletionsNum === 0), o = De(-1), c = De();
   function u() {
-    const p = l.value.querySelectorAll("[data-diff-change]");
+    const p = c.value.querySelectorAll("[data-diff-change]");
     o.value < p.length - 1 && (o.value++, d(p));
   }
-  function h() {
-    const p = l.value.querySelectorAll("[data-diff-change]");
+  function g() {
+    const p = c.value.querySelectorAll("[data-diff-change]");
     o.value > 0 && (o.value--, d(p));
   }
   function d(p) {
-    l.value.querySelectorAll(".current-diff").forEach((b) => b.classList.remove("current-diff"));
+    c.value.querySelectorAll(".current-diff").forEach((b) => b.classList.remove("current-diff"));
     const _ = p[o.value];
     _ && (_.querySelectorAll(".blob-code").forEach((b) => b.classList.add("current-diff")), _.scrollIntoView({
       behavior: "smooth",
@@ -5547,7 +5585,7 @@ me.setup = (e, n) => {
   return Ge(() => s, () => {
     o.value = -1, a.value = r.value, f("diff", {
       stat: {
-        isChanged: !c.value,
+        isChanged: !l.value,
         addNum: a.value.stat.additionsNum,
         delNum: a.value.stat.deletionsNum
       }
@@ -5556,11 +5594,12 @@ me.setup = (e, n) => {
     deep: !0,
     immediate: !0
   }), {
-    isUnifiedViewer: g,
+    emits: f,
+    isUnifiedViewer: h,
     diffChange: a,
-    root: l,
+    root: c,
     goToNextDiff: u,
-    goToPrevDiff: h
+    goToPrevDiff: g
   };
 };
 me.components = Object.assign({
@@ -5588,7 +5627,7 @@ var Ji = function() {
     staticClass: "info-left"
   }, [e._v(e._s(e.filename))]), s("div", {
     staticClass: "info-left"
-  }, [e._v(e._s(e.newFilename))])]), s("span", {
+  }, [e._v(e._s(e.newFilename))])]), e.hideNavigation ? e._e() : s("span", {
     staticClass: "diff-commandbar"
   }, [s("button", {
     staticClass: "command-item-button",
@@ -5626,7 +5665,7 @@ var Ji = function() {
     staticStyle: {
       "margin-left": "20px"
     }
-  }, [e._v(e._s(e.newFilename))]), s("span", {
+  }, [e._v(e._s(e.newFilename))]), e.hideNavigation ? e._e() : s("span", {
     staticClass: "diff-commandbar"
   }, [s("button", {
     staticClass: "command-item-button",
@@ -5658,15 +5697,25 @@ var Ji = function() {
     attrs: {
       "diff-change": e.diffChange,
       language: e.language
+    },
+    on: {
+      "change-click": function(f) {
+        return e.emits("change-click", f);
+      }
     }
   }) : s("SplitViewer", {
     attrs: {
       "diff-change": e.diffChange,
       language: e.language
+    },
+    on: {
+      "change-click": function(f) {
+        return e.emits("change-click", f);
+      }
     }
   })], 1);
 }, er = [];
-const An = {};
+const Nn = {};
 var nr = /* @__PURE__ */ ae(
   me,
   Ji,
@@ -5676,8 +5725,8 @@ var nr = /* @__PURE__ */ ae(
   null
 );
 function tr(e) {
-  for (let n in An)
-    this[n] = An[n];
+  for (let n in Nn)
+    this[n] = Nn[n];
 }
 const Wn = /* @__PURE__ */ function() {
   return nr.exports;
@@ -5710,7 +5759,7 @@ var ir = function() {
     }
   });
 }, rr = [];
-const Mn = {};
+const An = {};
 var sr = /* @__PURE__ */ ae(
   Ee,
   ir,
@@ -5720,8 +5769,8 @@ var sr = /* @__PURE__ */ ae(
   "8b22b876"
 );
 function ar(e) {
-  for (let n in Mn)
-    this[n] = Mn[n];
+  for (let n in An)
+    this[n] = An[n];
 }
 const or = /* @__PURE__ */ function() {
   return sr.exports;