Created
February 10, 2023 14:13
-
-
Save Stradivario/c4909dee07ec4cea92a23c8cf8447521 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Javascript string Diff Algorithm Service | |
*/ | |
export class DiffService { | |
public static diff(o: string, n: string) { | |
o = o.replace(/\s+$/, ''); | |
n = n.replace(/\s+$/, ''); | |
const out = this.calculate(o == '' ? [] : o.split(/\s+/), n == '' ? [] : n.split(/\s+/)); | |
let str = ''; | |
let oSpace = o.match(/\s+/g); | |
if (oSpace == null) { | |
oSpace = ['\n']; | |
} else { | |
oSpace.push('\n'); | |
} | |
let nSpace = n.match(/\s+/g); | |
if (nSpace == null) { | |
nSpace = ['\n']; | |
} else { | |
nSpace.push('\n'); | |
} | |
if (out.n.length == 0) { | |
for (let i = 0; i < out.o.length; i++) { | |
str += '<del>' + escape(out.o[i]) + oSpace[i] + '</del>'; | |
} | |
} else { | |
if (out.n[0].text == null) { | |
for (let n = 0; n < out.o.length && out.o[n].text == null; n++) { | |
str += '<del>' + escape(out.o[n]) + oSpace[n] + '</del>'; | |
} | |
} | |
for (let i = 0; i < out.n.length; i++) { | |
if (out.n[i].text == null) { | |
str += '<ins>' + escape(out.n[i]) + nSpace[i] + '</ins>'; | |
} else { | |
let pre = ''; | |
for (let n = out.n[i].row + 1; n < out.o.length && out.o[n].text == null; n++) { | |
pre += '<del>' + escape(out.o[n]) + oSpace[n] + '</del>'; | |
} | |
str += ' ' + out.n[i].text + nSpace[i] + pre; | |
} | |
} | |
} | |
return str; | |
} | |
private static calculate(o, n) { | |
const ns = new Object(); | |
const os = new Object(); | |
for (let i = 0; i < n.length; i++) { | |
if (ns[n[i]] == null) ns[n[i]] = { rows: [], o: null }; | |
ns[n[i]].rows.push(i); | |
} | |
for (let i = 0; i < o.length; i++) { | |
if (os[o[i]] == null) os[o[i]] = { rows: [], n: null }; | |
os[o[i]].rows.push(i); | |
} | |
for (const i in ns) { | |
if (ns[i].rows.length == 1 && typeof os[i] != 'undefined' && os[i].rows.length == 1) { | |
n[ns[i].rows[0]] = { text: n[ns[i].rows[0]], row: os[i].rows[0] }; | |
o[os[i].rows[0]] = { text: o[os[i].rows[0]], row: ns[i].rows[0] }; | |
} | |
} | |
for (let i = 0; i < n.length - 1; i++) { | |
if ( | |
n[i].text != null && | |
n[i + 1].text == null && | |
n[i].row + 1 < o.length && | |
o[n[i].row + 1].text == null && | |
n[i + 1] == o[n[i].row + 1] | |
) { | |
n[i + 1] = { text: n[i + 1], row: n[i].row + 1 }; | |
o[n[i].row + 1] = { text: o[n[i].row + 1], row: i + 1 }; | |
} | |
} | |
for (let i = n.length - 1; i > 0; i--) { | |
if ( | |
n[i].text != null && | |
n[i - 1].text == null && | |
n[i].row > 0 && | |
o[n[i].row - 1].text == null && | |
n[i - 1] == o[n[i].row - 1] | |
) { | |
n[i - 1] = { text: n[i - 1], row: n[i].row - 1 }; | |
o[n[i].row - 1] = { text: o[n[i].row - 1], row: i - 1 }; | |
} | |
} | |
return { o: o, n: n }; | |
} | |
private static escape(s: string) { | |
let n = s; | |
n = n.replace(/&/g, '&'); | |
n = n.replace(/</g, '<'); | |
n = n.replace(/>/g, '>'); | |
n = n.replace(/"/g, '"'); | |
return n; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment