Home

The Diff Match and Patch libraries offer robust algorithms to perform the operations required for synchronizing plain text.

1. Diff:
   • Compare two blocks of plain text and efficiently return a list of differences.
   • Diff Demo
2. Match:
   • Given a search string, find its best fuzzy match in a block of plain text. Weighted for both accuracy and location.
   • Match Demo
3. Patch:
   • Apply a list of patches onto plain text. Use best-effort to apply patch even when the underlying text doesn't match.
   • Patch Demo

Originally built in 2006 to power Google Docs, this library is now available in C++, C#, Dart, Java, JavaScript, Lua, Objective C, and Python. The original project maintains ports of the same code base for different languages, with the C version as the basis. This project aims to transform the code base into a more 'native C#' feel.

Documentation of the original port: original documentation

Reference

• API - API overview & usage documentation
• Line or Word Diffs - Less detailed diffs.
• Plain Text vs. Structured Content - How to deal with data like XML.
• Unidiff - The patch serialization format.

Algorithms

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.