Parse a JSON string that has git merge conflicts, resolving if possible
A JavaScript text diff implementation.
Fast Javascript text diff
Compare items in two sequences to find a longest common subsequence
Compare items in two sequences to find a longest common subsequence
bsdiff algorithm diff implementation for NodeJS
A fast, minimal, memory-efficient diff algorithm on strings, arrays, and typed arrays.
Implementation of paper 'An O(ND) Difference Algorithm and Its Variations' on array
Diff utility used in the Visual Studio Code source.
A diff for DOM elements, as client-side JavaScript code. Gets all modifications, insertions and removals between two DOM fragments.
JWA implementation (supports all JWS algorithms)
No description provided.
Implementation of JSON Web Signatures
Implemets the CIEDE2000 color difference algorithm, conversion between RGB and LAB color and mapping all colors in palette X to the closest or most different color in palette Y based on the CIEDE2000 difference.
A JavaScript library to diff two images. Uses the Longest-Common-Subsequence algorithm to allow content to shift.
Fast 3kb React-compatible Virtual DOM library.
Deep diffs two objects, including nested structures of arrays and objects, and return the difference.
Returns an array with only the unique values from the first array, by excluding all values from additional arrays using strict equality for comparisons.
Blazing-fast pixel-by-pixel image comparison with block-based optimization. 1.5x times faster than pixelmatch
npm package for https://github.com/google/diff-match-patch
Return an object representing the diffs between two objects. Supports jsonPatch protocol
A high-performance diff algorithm implementation with WASM backend, ported from VS Code
Continuation of a simple and beautiful text diff viewer component made with diff and React
JSON diff & patch (object and array diff, text diff, multiple output formats)
Computes the differences between two arrays of elements
A Ruby implementation of the Patience diff algorithm. Patience Diff creates more readable diffs than other algorithms in some cases, particularly when much of the content has changed between the documents being compared. There's a great explanation and example [here][example]. Patience diff was originally written by Bram Cohen and is used in the [Bazaar][bazaar] version control system. This version is loosely based off the Python implementation in Bazaar. [example]: http://alfedenzo.livejournal.com/170301.html [bazaar]: http://bazaar.canonical.com/
Diff Algorithm Implementation
Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool. This is release 2.0, which has significant breaking changes (removal of deprecations and workarounds) and requires at least Ruby 3.2 or higher. See full details in the `CHANGELOG`, but users of diff-lcs should not notice any significant changes to the APIs. ==== To Install:
Implementation of Myers 1986 text diff algorithm that started as a port of the jsdiff project with plans to branch out to human-friendly diffs
The Diff Match and Patch libraries offer robust algorithms to perform the operations required for synchronizing plain text.
Add modifications to 'git diff --shortstat' using the LCS algorithm.
This library performs diffs of CSV data, or any table-like source. Unlike a standard diff that compares line by line, and is sensitive to the ordering of records, CSV-Diff identifies common lines by key field(s), and then compares the contents of the fields in each line. Data may be supplied in the form of CSV files, or as an array of arrays. The diff process provides a fine level of control over what to diff, and can optionally ignore certain types of changes (e.g. changes in position). CSV-Diff is particularly well suited to data in parent-child format. Parent- child data does not lend itself well to standard text diffs, as small changes in the organisation of the tree at an upper level can lead to big movements in the position of descendant records. By instead matching records by key, CSV-Diff avoids this issue, while still being able to detect changes in sibling order. This gem implements the core diff algorithm, and handles the loading and diffing of CSV files (or Arrays of Arrays). It also supports converting data in XML format into tabular form, so that it can then be processed like any other CSV or table-like source. It returns a CSVDiff object containing the details of differences in object form. This is useful for projects that need diff capability, but want to handle the reporting or actioning of differences themselves. For a pre-built diff reporting capability, see the csv-diff-report gem, which provides a command-line tool for generating diff reports in HTML, Excel, or text formats.
A ruby gem that will implement the diff algorithm on hash
Deltoid diffs HTML documents using a relatively simple N-way algorithm. It reports deltas as an array of hashes, where each hash contains :content, :xpath, and :index keys.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.