|
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.TextAssembly: GSF.Core (in GSF.Core.dll) Version: 2.4.246-beta+ff392465a0262ee2737937d4127fc3c2f08c6dcd
Syntaxprotected 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);
View SourceParameters
- text1 String
- Old string to be diffed
- text2 String
- New string to be diffed
- deadline DateTime
- Time at which to bail if not yet complete
Return Value
ListDiffList of Diff objects
See Also