DiffMatchPatchDiffBisect Method

Find the 'middle snake' of a diff, split the problem in two and return the recursively constructed diff.

See Myers 1986 paper: An O(ND) Difference Algorithm and Its Variations.

Namespace: GSF.Text
Assembly: GSF.Core (in GSF.Core.dll) Version: 2.4.258-beta+f8b6aa3dbfe0b4cc2b0b0760dd5d2a3dd4f59d09

Syntax

protected List<Diff> DiffBisect(
	string text1,
	string text2,
	DateTime deadline
)

Protected Function DiffBisect ( 
	text1 As String,
	text2 As String,
	deadline As DateTime
) As List(Of Diff)

protected:
List<Diff^>^ DiffBisect(
	String^ text1, 
	String^ text2, 
	DateTime deadline
)

member DiffBisect : 
        text1 : string * 
        text2 : string * 
        deadline : DateTime -> List<Diff>

function DiffBisect(text1, text2, deadline);

ListDiff
List of Diff objects