Diff3.diffComm(a, b) where a and b are lists of words totalling about 20,000 characters each takes about 10 seconds on my laptop. This seems to be an uncharacteristically poor performance. With some simple testing, it seems to be O(n³).
In contrast, in the same time diffWords from diff performs a diff on strings of 20,000,000 characters each. I have not compared what algorithm it uses.
Diff3.diff3Merge(a, b, original) with a and original being identical 100,000 character strings, and b an empty string takes about 20 seconds on my laptop.
Diff3.diffComm(a, b)where a and b are lists of words totalling about 20,000 characters each takes about 10 seconds on my laptop. This seems to be an uncharacteristically poor performance. With some simple testing, it seems to beO(n³).In contrast, in the same time diffWords from diff performs a diff on strings of 20,000,000 characters each. I have not compared what algorithm it uses.
Diff3.diff3Merge(a, b, original)with a and original being identical 100,000 character strings, and b an empty string takes about 20 seconds on my laptop.