RubyGems Navigation menu

diff-lcs 1.1.3

Diff::LCS is a port of Perl's Algorithm::Diff that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers. The implementation is based on Mario I. Wolczko's {Smalltalk version 1.2}[] (1993) and Ned Konz's Perl version {Algorithm::Diff 1.15}[]. This is release 1.1.3, fixing several small bugs found over the years. Version 1.1.0 added new features, including the ability to #patch and #unpatch changes as well as a new contextual diff callback, Diff::LCS::ContextDiffCallbacks, that should improve the context sensitivity of patching. This library is called Diff::LCS because of an early version of Algorithm::Diff which was restrictively licensed. This version has seen a minor license change: instead of being under Ruby's license as an option, the third optional license is the MIT license.


  1. 1.2.5 - November 8, 2013 (48 KB)
  2. 1.2.4 - April 21, 2013 (46 KB)
  3. 1.2.3 - April 12, 2013 (46.5 KB)
  4. 1.2.2 - March 30, 2013 (46 KB)
  5. 1.2.1 - February 9, 2013 (45 KB)
Show all versions (9 total)

Development Dependencies:


  • Austin Ziegler



Sha 256 checksum:


Total downloads 33,910,967

For this version 8,317,584

Show all versions (9 total)

Required Ruby Version: None



= Copy to clipboard Copied!

= Copy to clipboard Copied!