413
return result;
414
} else if (!quitEarlyArr[0]) {
416
>
// First Half: (originalStart, modifiedStart) to (midOriginal, midModified)
417
>
// Second Half: (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd)
418
>
// NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point
419
>
420
>
const leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);
421
>
let rightChanges: DiffChange[] = [];
422
>
423
>
if (!quitEarlyArr[0]) {
424
>
rightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);
425
>
} else {
426
// We didn't have time to finish the first half, so we don't have time to compute this half.
427
// Consider the entire rest of the sequence different.