The Diff Match and Patch libraries offer robust algorithms to perform the operations required for synchronizing plain text.
Compare two blocks of plain text and efficiently return a list of differences.
Given a search string, find its best fuzzy match in a block of plain text. Weighted for both accuracy and location.
Apply a list of patches onto plain text. Use best-effort to apply patch even when the underlying text doesn't match.
This library implements Myer's diff algorithm which is generally considered to be the best general-purpose diff. A layer of pre-diff speedups and post-diff cleanups surround the diff algorithm, improving both performance and output quality.
This library also implements a Bitap matching algorithm at the heart of a flexible matching and patching strategy.
Install-Package Google.DiffMatchPatch.Js -Version 1.0.103
dotnet add package Google.DiffMatchPatch.Js --version 1.0.103
<PackageReference Include="Google.DiffMatchPatch.Js" Version="1.0.103" />
paket add Google.DiffMatchPatch.Js --version 1.0.103
Please note you need only the diff_match_patch.js in a production environment the test harness and the uncompressed versions are for debugging purposes only.
Updated to revision id 103 of repository.
This package has no dependencies.
This package is not used by any popular GitHub repositories.