this.Diff_Timeout = 5;

this.Diff_EditCost = 10;

this.Match_Threshold = .5;

this.Match_Distance = 21E3;

this.Patch_DeleteThreshold = .5;

this.Patch_Margin = 8;

this.Match_MaxBits = 32

"undefined" == typeof d && (d = 0 >= this.Diff_Timeout ? Number.MAX_VALUE : (new Date).getTime() + 1E3 * this.Diff_Timeout);

if (null == a || null == b)

throw Error("Null input. (diff_main)");

if (a == b)

return a ? [new diff_match_patch.Diff(DIFF_EQUAL, a)] : [];

"undefined" == typeof c && (c =! 0);

var e = c,

f = this.diff_commonPrefix(a, b);

c = a.substring(0, f);

a = a.substring(f);

b = b.substring(f);

f = this.diff_commonSuffix(a, b);

var g = a.substring(a.length - f);

a = a.substring(0, a.length - f);

b = b.substring(0, b.length - f);

a = this.diff_compute_(a, b, e, d);

c && a.unshift(new diff_match_patch.Diff(DIFF_EQUAL, c));

g && a.push(new diff_match_patch.Diff(DIFF_EQUAL, g));

this.diff_cleanupMerge(a);

return a

if (! a)

return [new diff_match_patch.Diff(DIFF_INSERT, b)];

if (! b)

return [new diff_match_patch.Diff(DIFF_DELETE, a)];

var e = a.length > b.length ? a : b,

f = a.length > b.length ? b : a,

g = e.indexOf(f);

return -1 != g ? (c =[

new diff_match_patch.Diff(DIFF_INSERT, e.substring(0, g)),

new diff_match_patch.Diff(DIFF_EQUAL, f),

new diff_match_patch.Diff(DIFF_INSERT, e.substring(g + f.length))

], a.length > b.length && (c[0][0] = c[2][0] = DIFF_DELETE), c) : 1 == f.length ? [

new diff_match_patch.Diff(DIFF_DELETE, a),

new diff_match_patch.Diff(DIFF_INSERT, b)

] : (e = this.diff_halfMatch_(a, b)) ? (b = e[1], f = e[3], a = e[4], e = this.diff_main(e[0], e[2], c, d), c = this.diff_main(b, f, c, d), e.concat([new diff_match_patch.Diff(DIFF_EQUAL, a)], c)) : c && 100 < a.length && 100 < b.length ? this.diff_lineMode_(a, b, d) : this.diff_bisect_(a, b, d)

var d = this.diff_linesToChars_(a, b);

a = d.chars1;

b = d.chars2;

d = d.lineArray;

a = this.diff_main(a, b, !1, c);

this.diff_charsToLines_(a, d);

this.diff_cleanupSemantic(a);

a.push(new diff_match_patch.Diff(DIFF_EQUAL, ""));

for (var e = d = b = 0, f = "", g = ""; b < a.length;) {

switch (a[b][0]) {

case DIFF_INSERT: e++;

g += a[b][1];

break;

case DIFF_DELETE: d++;

f += a[b][1];

break;

case DIFF_EQUAL: if (1 <= d && 1 <= e) {

a.splice(b - d - e, d + e);

b = b - d - e;

d = this.diff_main(f, g, !1, c);

for (e = d.length - 1; 0 <= e; e--)

a.splice(b, 0, d[e]);

b += d.length

}

d = e = 0;

g = f = ""

}

b++

}

a.pop();

return a

for (var d = a.length, e = b.length, f = Math.ceil((d + e) / 2), g = 2 * f, h = Array(g), l = Array(g), k = 0; k < g; k++)

h[k] = -1,

l[k] = -1;

h[f + 1] = 0;

l[f + 1] = 0;

k = d - e;

for (var m = 0 != k % 2, p = 0, x = 0, w = 0, q = 0, t = 0; t < f && !((new Date).getTime() > c); t++) {

for (var v = - t + p; v <= t - x; v += 2) {

var n = f + v;

var r = v == - t || v != t && h[n - 1] < h[n + 1] ? h[n + 1] : h[n - 1] + 1;

for (var y = r - v; r < d && y < e && a.charAt(r) == b.charAt(y);)

r++,

y ++;

h[n] = r;

if (r > d)

x += 2;

else if (y > e)

p += 2;

else if (m && (n = f + k - v, 0 <= n && n < g && -1 != l[n])) {

var u = d - l[n];

if (r >= u)

return this.diff_bisectSplit_(a, b, r, y, c)

}

}

for (v = - t + w; v <= t - q; v += 2) {

n = f + v;

u = v == - t || v != t && l[n - 1] < l[n + 1] ? l[n + 1] : l[n - 1] + 1;

for (r = u - v; u < d && r < e && a.charAt(d - u - 1) == b.charAt(e - r - 1);)

u ++,

r ++;

l[n] = u;

if (u > d)

q += 2;

else if (r > e)

w += 2;

else if (! m && (n = f + k - v, 0 <= n && n < g && -1 != h[n] && (r = h[n], y = f + r - n, u = d - u, r >= u)))

return this.diff_bisectSplit_(a, b, r, y, c)

}

}

return [

new diff_match_patch.Diff(DIFF_DELETE, a),

new diff_match_patch.Diff(DIFF_INSERT, b)

]

var f = a.substring(0, c),

g = b.substring(0, d);

a = a.substring(c);

b = b.substring(d);

f = this.diff_main(f, g, !1, e);

e = this.diff_main(a, b, !1, e);

return f.concat(e)

function c(a) {

for (var b = "", c = 0, g = -1, h = d.length; g < a.length - 1;) {

g = a.indexOf("\n", c);

-1 == g && (g = a.length - 1);

var l = a.substring(c, g + 1);

(e.hasOwnProperty ? e.hasOwnProperty(l) : void 0 !== e[l]) ? b += String.fromCharCode(e[l]) : (h == f && (l = a.substring(c), g = a.length), b += String.fromCharCode(h), e[l] = h, d[h++] = l);

c = g + 1

}

return b

}

var d = [],

e = {};

d[0] = "";

var f = 4E4,

g = c(a);

f = 65535;

var h = c(b);

return {chars1: g, chars2: h, lineArray: d}

for (var c = 0; c < a.length; c++) {

for (var d = a[c][1], e =[], f = 0; f < d.length; f++)

e[f] = b[d.charCodeAt(f)];

a[c][1] = e.join("")

}

if (! a || ! b || a.charAt(0) != b.charAt(0))

return 0;

for (var c = 0, d = Math.min(a.length, b.length), e = d, f = 0; c < e;)

a.substring(f, e) == b.substring(f, e) ? f = c = e : d = e,

e = Math.floor((d - c) / 2 + c);

return e

if (! a || ! b || a.charAt(a.length - 1) != b.charAt(b.length - 1))

return 0;

for (var c = 0, d = Math.min(a.length, b.length), e = d, f = 0; c < e;)

a.substring(a.length - e, a.length - f) == b.substring(b.length - e, b.length - f) ? f = c = e : d = e,

e = Math.floor((d - c) / 2 + c);

return e

var c = a.length,

d = b.length;

if (0 == c || 0 == d)

return 0;

c > d ? a = a.substring(c - d) : c < d && (b = b.substring(0, c));

c = Math.min(c, d);

if (a == b)

return c;

d = 0;

for (var e = 1;;) {

var f = a.substring(c - e);

f = b.indexOf(f);

if (-1 == f)

return d;

e += f;

if (0 == f || a.substring(c - e) == b.substring(0, e))

d = e,

e ++

}

function c(a, b, c) {

for (var d = a.substring(c, c + Math.floor(a.length / 4)), e = -1, g = "", h, k, l, m; -1 != (e = b.indexOf(d, e + 1));) {

var p = f.diff_commonPrefix(a.substring(c), b.substring(e)),

u = f.diff_commonSuffix(a.substring(0, c), b.substring(0, e));

g.length < u + p && (g = b.substring(e - u, e) + b.substring(e, e + p), h = a.substring(0, c - u), k = a.substring(c + p), l = b.substring(0, e - u), m = b.substring(e + p))

}

return 2 * g.length >= a.length ? [

h,

k,

l,

m,

g

] : null

}

if (0 >= this.Diff_Timeout)

return null;

var d = a.length > b.length ? a : b,

e = a.length > b.length ? b : a;

if (4 > d.length || 2 * e.length < d.length)

return null;

var f = this,

g = c(d, e, Math.ceil(d.length / 4));

d = c(d, e, Math.ceil(d.length / 2));

if (g || d)

g = d ? g ? g[4].length > d[4].length ? g : d : d : g;

else

return null;

if (a.length > b.length) {

d = g[0];

e = g[1];

var h = g[2];

var l = g[3]

} else

h = g[0],

l = g[1],

d = g[2],

e = g[3];

return [

d,

e,

h,

l,

g[4]

]

for (var b =! 1, c =[], d = 0, e = null, f = 0, g = 0, h = 0, l = 0, k = 0; f < a.length;)

a[f][0] == DIFF_EQUAL ? (c[d++] = f, g = l, h = k, k = l = 0, e = a[f][1]) : (a[f][0] == DIFF_INSERT ? l += a[f][1].length : k += a[f][1].length,

e && e.length <= Math.max(g, h) && e.length <= Math.max(l, k) && (a.splice(c[d - 1], 0, new diff_match_patch.Diff(DIFF_DELETE, e)), a[c[d - 1] + 1][0] = DIFF_INSERT,

d --,

d --,

f = 0 < d ? c[d - 1] : -1,

k = l = h = g = 0,

e = null,

b =! 0)),

f ++;

b && this.diff_cleanupMerge(a);

this.diff_cleanupSemanticLossless(a);

for (f = 1; f < a.length;) {

if (a[f - 1][0] == DIFF_DELETE && a[f][0] == DIFF_INSERT) {

b = a[f - 1][1];

c = a[f][1];

d = this.diff_commonOverlap_(b, c);

e = this.diff_commonOverlap_(c, b);

if (d >= e) {

if (d >= b.length / 2 || d >= c.length / 2)

a.splice(f, 0, new diff_match_patch.Diff(DIFF_EQUAL, c.substring(0, d))),

a[f - 1][1] = b.substring(0, b.length - d),

a[f + 1][1] = c.substring(d),

f ++

} else if (e >= b.length / 2 || e >= c.length / 2)

a.splice(f, 0, new diff_match_patch.Diff(DIFF_EQUAL, b.substring(0, e))),

a[f - 1][0] = DIFF_INSERT,

a[f - 1][1] = c.substring(0, c.length - e),

a[f + 1][0] = DIFF_DELETE,

a[f + 1][1] = b.substring(e),

f ++;

f++

}

f++

}

function b(a, b) {

if (! a || ! b)

return 6;

var c = a.charAt(a.length - 1),

d = b.charAt(0),

e = c.match(diff_match_patch.nonAlphaNumericRegex_),

f = d.match(diff_match_patch.nonAlphaNumericRegex_),

g = e && c.match(diff_match_patch.whitespaceRegex_),

h = f && d.match(diff_match_patch.whitespaceRegex_);

c = g && c.match(diff_match_patch.linebreakRegex_);

d = h && d.match(diff_match_patch.linebreakRegex_);

var k = c && a.match(diff_match_patch.blanklineEndRegex_),

l = d && b.match(diff_match_patch.blanklineStartRegex_);

return k || l ? 5 : c || d ? 4 : e && ! g && h ? 3 : g || h ? 2 : e || f ? 1 : 0

}

for (var c = 1; c < a.length - 1;) {

if (a[c - 1][0] == DIFF_EQUAL && a[c + 1][0] == DIFF_EQUAL) {

var d = a[c - 1][1],

e = a[c][1],

f = a[c + 1][1],

g = this.diff_commonSuffix(d, e);

if (g) {

var h = e.substring(e.length - g);

d = d.substring(0, d.length - g);

e = h + e.substring(0, e.length - g);

f = h + f

}

g = d;

h = e;

for (var l = f, k = b(d, e) + b(e, f); e.charAt(0) === f.charAt(0);) {

d += e.charAt(0);

e = e.substring(1) + f.charAt(0);

f = f.substring(1);

var m = b(d, e) + b(e, f);

m >= k && (k = m, g = d, h = e, l = f)

}

a[c - 1][1] != g && (g ? a[c - 1][1] = g : (a.splice(c - 1, 1), c --),

a[c][1] = h,

l ? a[c + 1][1] = l : (a.splice(c + 1, 1), c --))

}

c++

}

for (var b =! 1, c =[], d = 0, e = null, f = 0, g =! 1, h =! 1, l =! 1, k =! 1; f < a.length;)

a[f][0] == DIFF_EQUAL ? (a[f][1].length < this.Diff_EditCost && (l || k) ? (c[d++] = f, g = l, h = k, e = a[f][1]) : (d = 0, e = null),

l = k =! 1) : (a[f][0] == DIFF_DELETE ? k =! 0 : l =! 0,

e && (g && h && l && k || e.length < this.Diff_EditCost / 2 && 3 == g + h + l + k) && (a.splice(c[d - 1], 0, new diff_match_patch.Diff(DIFF_DELETE, e)), a[c[d - 1] + 1][0] = DIFF_INSERT,

d --,

e = null,

g && h ? (l = k =! 0, d = 0) : (d--, f = 0 < d ? c[d - 1] : -1, l = k =! 1),

b =! 0)),

f ++;

b && this.diff_cleanupMerge(a)

a.push(new diff_match_patch.Diff(DIFF_EQUAL, ""));

for (var b = 0, c = 0, d = 0, e = "", f = "", g; b < a.length;)

switch (a[b][0]) {

case DIFF_INSERT: d++;

f += a[b][1];

b++;

break;

case DIFF_DELETE: c++;

e += a[b][1];

b++;

break;

case DIFF_EQUAL: 1 < c + d ? (0 !== c && 0 !== d && (g = this.diff_commonPrefix(f, e), 0 !== g && (0 < b - c - d && a[b - c - d - 1][0] == DIFF_EQUAL ? a[b - c - d - 1][1] += f.substring(0, g) : (a.splice(0, 0, new diff_match_patch.Diff(DIFF_EQUAL, f.substring(0, g))), b ++),

f = f.substring(g),

e = e.substring(g)), g = this.diff_commonSuffix(f, e), 0 !== g && (a[b][1] = f.substring(f.length - g) + a[b][1],

f = f.substring(0, f.length - g),

e = e.substring(0, e.length - g))), b -= c + d, a.splice(b, c + d), e.length && (a.splice(b, 0, new diff_match_patch.Diff(DIFF_DELETE, e)), b ++), f.length && (a.splice(b, 0, new diff_match_patch.Diff(DIFF_INSERT, f)), b ++), b ++) : 0 !== b && a[b - 1][0] == DIFF_EQUAL ? (a[b - 1][1] += a[b][1],

a.splice(b, 1)) : b++,

c = d = 0,

f = e = ""

}

"" === a[a.length - 1][1] && a.pop();

c = !1;

for (b = 1; b < a.length - 1;)

a[b - 1][0] == DIFF_EQUAL && a[b + 1][0] == DIFF_EQUAL && (a[b][1].substring(a[b][1].length - a[b - 1][1].length) == a[b - 1][1] ? (a[b][1] = a[b - 1][1] + a[b][1].substring(0, a[b][1].length - a[b - 1][1].length),

a[b + 1][1] = a[b - 1][1] + a[b + 1][1],

a.splice(b - 1, 1),

c =! 0) : a[b][1].substring(0, a[b + 1][1].length) == a[b + 1][1] && (a[b - 1][1] += a[b + 1][1],

a[b][1] = a[b][1].substring(a[b + 1][1].length) + a[b + 1][1],

a.splice(b + 1, 1),

c =! 0)),

b ++;

c && this.diff_cleanupMerge(a)

var c = 0,

d = 0,

e = 0,

f = 0,

g;

for (g = 0; g < a.length; g++) {

a[g][0] !== DIFF_INSERT && (c += a[g][1].length);

a[g][0] !== DIFF_DELETE && (d += a[g][1].length);

if (c > b)

break;

e = c;

f = d

}

return a.length != g && a[g][0] === DIFF_DELETE ? f : f + (b - e)

for (var b =[], c =/&/g, d =/</g, e =/>/g, f =/\n/g, g = 0; g < a.length; g++) {

var h = a[g][0],

l = a[g][1].replace(c, "&amp;").replace(d, "&lt;").replace(e, "&gt;").replace(f, "&para;<br>");

switch (h) {

case DIFF_INSERT: b[g] = '<span id="missedyellow" style="background:#fffd89b8; padding:5px; border-radius:3px; font-family: Roboto;">' + l + "</span>";

break;

case DIFF_DELETE: b[g] = '<span style="color:red; padding:5px; border-radius:5px; font-family: Roboto;">' + l + "</span>";