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 1.2.4, fixing a bug introduced after diff-lcs 1.1.3 that did not properly prune common sequences at the beginning of a comparison set. Thanks to Paul Kunysch for fixing this issue. Coincident with the release of diff-lcs 1.2.3, we reported an issue with Rubinius in 1.9 mode ({rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268]). We are happy to report that this issue has been resolved.

Required Ruby Version

None

Authors

Austin Ziegler

Versions

  1. 2.0.0

    1. source

      1. 2.0.0 source February 02, 2026 (68.5 KB)
  2. 2.0.0.beta.2

    1. source

      1. 2.0.0.beta.2 source January 22, 2026 (67.5 KB)
  3. 2.0.0.beta.1

    1. source

      1. 2.0.0.beta.1 source December 31, 2025 (57.5 KB)
  4. 1.6.2

    1. source

      1. 1.6.2 source May 12, 2025 (58 KB)
  5. 1.6.1

    1. source

      1. 1.6.1 source March 25, 2025 (57.5 KB)
  6. 1.2.5

    1. source

      1. 1.2.5 source November 08, 2013 (48 KB)
Show all versions (23 total)

SHA 256 checksum

← Previous version Next version →